@@ -1443,7 +1443,7 @@ static FORCEINLINE void* win32direct_mmap(size_t size) {
14431443 return (ptr != 0 )? ptr : MFAIL ;
14441444}
14451445
1446- /* This function supports releasing coalesed segments */
1446+ /* This function supports releasing coalesced segments */
14471447static FORCEINLINE int win32munmap (void * ptr , size_t size ) {
14481448 MEMORY_BASIC_INFORMATION minfo ;
14491449 char * cptr = (char * )ptr ;
@@ -1480,7 +1480,7 @@ static FORCEINLINE int win32munmap(void* ptr, size_t size) {
14801480#define CALL_MORECORE (S ) MFAIL
14811481#endif /* HAVE_MORECORE */
14821482
1483- /* mstate bit set if continguous morecore disabled or failed */
1483+ /* mstate bit set if contiguous morecore disabled or failed */
14841484#define USE_NONCONTIGUOUS_BIT (4U)
14851485
14861486/* segment bit set in create_mspace_with_base */
@@ -2094,7 +2094,7 @@ nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
20942094 work in the same way as fd/bk pointers of small chunks.
20952095
20962096 Each tree contains a power of 2 sized range of chunk sizes (the
2097- smallest is 0x100 <= x < 0x180), which is is divided in half at each
2097+ smallest is 0x100 <= x < 0x180), which is divided in half at each
20982098 tree level, with the chunks in the smaller half of the range (0x100
20992099 <= x < 0x140 for the top nose) in the left subtree and the larger
21002100 half (0x140 <= x < 0x180) in the right subtree. This is, of course,
@@ -2284,7 +2284,7 @@ typedef struct malloc_segment* msegmentptr;
22842284
22852285 Trim support
22862286 Fields holding the amount of unused topmost memory that should trigger
2287- timming , and a counter to force periodic scanning to release unused
2287+ timing , and a counter to force periodic scanning to release unused
22882288 non-topmost segments.
22892289
22902290 Locking
@@ -2692,7 +2692,7 @@ static size_t traverse_and_check(mstate m);
26922692 http://www.usenix.org/events/lisa03/tech/robertson.html The footer
26932693 of an inuse chunk holds the xor of its mstate and a random seed,
26942694 that is checked upon calls to free() and realloc(). This is
2695- (probablistically ) unguessable from outside the program, but can be
2695+ (probabilistically ) unguessable from outside the program, but can be
26962696 computed by any code successfully malloc'ing any chunk, so does not
26972697 itself provide protection against code that has already broken
26982698 security through some other means. Unlike Robertson et al, we
@@ -4539,7 +4539,7 @@ void* dlmalloc(size_t bytes) {
45394539
45404540void dlfree (void * mem ) {
45414541 /*
4542- Consolidate freed chunks with preceeding or succeeding bordering
4542+ Consolidate freed chunks with preceding or succeeding bordering
45434543 free chunks, if they exist, and then place in a bin. Intermixed
45444544 with special cases for top, dv, mmapped chunks, and usage errors.
45454545 */
@@ -5430,10 +5430,10 @@ int mspace_mallopt(int param_number, int value) {
54305430 Wolfram Gloger (Gloger@lrz.uni-muenchen.de).
54315431 * Use last_remainder in more cases.
54325432 * Pack bins using idea from colin@nyx10.cs.du.edu
5433- * Use ordered bins instead of best-fit threshhold
5433+ * Use ordered bins instead of best-fit threshold
54345434 * Eliminate block-local decls to simplify tracing and debugging.
54355435 * Support another case of realloc via move into top
5436- * Fix error occuring when initial sbrk_base not word-aligned.
5436+ * Fix error occurring when initial sbrk_base not word-aligned.
54375437 * Rely on page size for units instead of SBRK_UNIT to
54385438 avoid surprises about sbrk alignment conventions.
54395439 * Add mallinfo, mallopt. Thanks to Raymond Nijssen
0 commit comments