Browse Source

Touch up a comment

Ian Goldberg 1 year ago
parent
commit
4898b27dbd
2 changed files with 12 additions and 12 deletions
  1. 6 6
      Enclave/sort.hpp
  2. 6 6
      Enclave/sort.tcc

+ 6 - 6
Enclave/sort.hpp

@@ -55,12 +55,12 @@ void sort_mtobliv(threadid_t nthreads, uint8_t* items, uint16_t msg_size,
     std::function<void(const uint8_t*, const T*, uint32_t Nr)>);
 
 // As above, but the first Nr msg_size-byte entries in the items array
-// will end up with the sorted values.  Note: entries beyond Nr may also
-// change, but you should not even look at those values!  This calls the
-// above function, and then copies the data in sorted order into a
-// temporary buffer, then copies that buffer back into the items array,
-// so it's less efficient, both in memory and CPU, than the above
-// function.
+// will end up with the sorted values.  Note: if Nr < Na, entries beyond
+// Nr may also change, but you should not even look at those values!
+// This calls the above function, and then copies the data in sorted
+// order into a temporary buffer, then copies that buffer back into the
+// items array, so it's less efficient, both in memory and CPU, than the
+// above function.
 template<typename T>
 void sort_mtobliv(threadid_t nthreads, uint8_t* items, uint16_t msg_size,
     uint32_t Nr, uint32_t Na);

+ 6 - 6
Enclave/sort.tcc

@@ -133,12 +133,12 @@ static void *move_sorted(void *voidargs)
 }
 
 // As above, but the first Nr msg_size-byte entries in the items array
-// will end up with the sorted values.  Note: entries beyond Nr may also
-// change, but you should not even look at those values!  This calls the
-// above function, and then copies the data in sorted order into a
-// temporary buffer, then copies that buffer back into the items array,
-// so it's less efficient, both in memory and CPU, than the above
-// function.
+// will end up with the sorted values.  Note: if Nr < Na, entries beyond
+// Nr may also change, but you should not even look at those values!
+// This calls the above function, and then copies the data in sorted
+// order into a temporary buffer, then copies that buffer back into the
+// items array, so it's less efficient, both in memory and CPU, than the
+// above function.
 template<typename T>
 void sort_mtobliv(threadid_t nthreads, uint8_t* items, uint16_t msg_size,
     uint32_t Nr, uint32_t Na)