@@ -115,18 +115,18 @@ typedef long nmbrString; /* String of numbers */
115
115
* \brief an array (maybe of size 1) of untyped pointers (void*)
116
116
*
117
117
* In general this array is organized like a stack: the number of elements in
118
- * the pntrString grows and shrinks during program flow, values are pushed and
119
- * popped at the end. Such a stack is embedded in a \ref block that contains
120
- * administrative information about the stack. The stack begins with
118
+ * the pntrString array grows and shrinks during program flow, values are
119
+ * pushed and popped at the end. Such a stack is embedded in a \ref block that
120
+ * contains administrative information about the stack. The stack begins with
121
121
* element 0, and the administrative information is accessed through negative
122
122
* indices, but need reinterpretation then. To allow iterating through the
123
- * tail of the array from a certain element on, the array terminates with a
123
+ * tail of an array from a certain element on, an array terminates with a
124
124
* null pointer. This type of usage forbids null pointer as ordinary elements,
125
125
* and the terminal null pointer is not part of the data in the array.
126
126
*
127
127
* To summarize the usages of this type:
128
128
* - If you want to resize the array/stack you need a pointer to element 0.
129
- * - You can iterate from an arbitrary pointer to the end.
129
+ * - You can iterate from an arbitrary element to the end.
130
130
* - Sometimes pntrString denotes an isolated element, not embedded in a
131
131
* greater array.
132
132
*
@@ -161,7 +161,7 @@ typedef nmbrString temp_nmbrString;
161
161
*
162
162
* These elements are pushed onto and popped off a \ref stack
163
163
* "stack of temporary data". All pointer of this type should ONLY refer to
164
- * adynamically llocated memory on the heap. Special commands support
164
+ * dynamically allocated memory on the heap. Special commands support
165
165
* dependency tracking and free all pointers on and after a particular one in
166
166
* such a stack.
167
167
*/
@@ -324,10 +324,10 @@ void *poolFixedMalloc(long size /* bytes */);
324
324
* the given size is allocated from the system. In any case, the header of the
325
325
* \ref block is properly initialized. Exits program on out of memory
326
326
* condition.
327
- * \param[in] size (in bytes) of the block, not including the block header, but
328
- * including space for a terminal NULL.
329
- * \return a free and initialized block of memory with at least the requested
330
- * user space. Exit on out-of-memory
327
+ * \param[in] size (in bytes) of the block, not including the block header.
328
+ * \return a \ref block with enough capacity for \p size bytes of data. The
329
+ * data space is filled with random contents, but in the block header its
330
+ * \p size is noted. Exit on out-of-memory
331
331
*/
332
332
void * poolMalloc (long size /* bytes */ );
333
333
/*!
@@ -339,7 +339,7 @@ void *poolMalloc(long size /* bytes */);
339
339
* added.
340
340
* \param[in] ptr pointer to a \ref block.
341
341
* \pre
342
- * - \p ptr was previously allocated.
342
+ * - \p ptr was previously dynamically allocated.
343
343
* - all memory pointed to by \p ptr is considered free. This holds even if it
344
344
* it is kept in \ref memUsedPool.
345
345
* \post
0 commit comments