|
100 | 100 |
|
101 | 101 | If you don't like either of these options, you can define
|
102 | 102 | CORRUPTION_ERROR_ACTION and USAGE_ERROR_ACTION to do anything
|
103 |
| - else. And if if you are sure that your program using malloc has |
| 103 | + else. And if you are sure that your program using malloc has |
104 | 104 | no errors or vulnerabilities, you can define INSECURE to 1,
|
105 | 105 | which might (or might not) provide a small performance improvement.
|
106 | 106 |
|
@@ -599,7 +599,7 @@ DEFAULT_MMAP_THRESHOLD default: 256K
|
599 | 599 | declaration needed is the mallinfo struct that is returned (by-copy)
|
600 | 600 | by mallinfo(). The malloinfo struct contains a bunch of fields that
|
601 | 601 | are not even meaningful in this version of malloc. These fields are
|
602 |
| - are instead filled by mallinfo() with other numbers that might be of |
| 602 | + instead filled by mallinfo() with other numbers that might be of |
603 | 603 | interest.
|
604 | 604 |
|
605 | 605 | HAVE_USR_INCLUDE_MALLOC_H should be set if you have a
|
@@ -1564,7 +1564,7 @@ static MLOCK_T magic_init_mutex;
|
1564 | 1564 | Each freshly allocated chunk must have both cinuse and pinuse set.
|
1565 | 1565 | That is, each allocated chunk borders either a previously allocated
|
1566 | 1566 | and still in-use chunk, or the base of its memory arena. This is
|
1567 |
| - ensured by making all allocations from the the `lowest' part of any |
| 1567 | + ensured by making all allocations from the `lowest' part of any |
1568 | 1568 | found chunk. Further, no free chunk physically borders another one,
|
1569 | 1569 | so each free chunk is known to be preceded and followed by either
|
1570 | 1570 | inuse chunks or the ends of memory.
|
@@ -1770,12 +1770,12 @@ nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
1770 | 1770 | of the same size are arranged in a circularly-linked list, with only
|
1771 | 1771 | the oldest chunk (the next to be used, in our FIFO ordering)
|
1772 | 1772 | actually in the tree. (Tree members are distinguished by a non-null
|
1773 |
| - parent pointer.) If a chunk with the same size an an existing node |
| 1773 | + parent pointer.) If a chunk with the same size as an existing node |
1774 | 1774 | is inserted, it is linked off the existing node using pointers that
|
1775 | 1775 | work in the same way as fd/bk pointers of small chunks.
|
1776 | 1776 |
|
1777 | 1777 | Each tree contains a power of 2 sized range of chunk sizes (the
|
1778 |
| - smallest is 0x100 <= x < 0x180), which is is divided in half at each |
| 1778 | + smallest is 0x100 <= x < 0x180), which is divided in half at each |
1779 | 1779 | tree level, with the chunks in the smaller half of the range (0x100
|
1780 | 1780 | <= x < 0x140 for the top nose) in the left subtree and the larger
|
1781 | 1781 | half (0x140 <= x < 0x180) in the right subtree. This is, of course,
|
@@ -3380,7 +3380,7 @@ static void* sys_alloc(mstate m, size_t nb) {
|
3380 | 3380 | least-preferred order):
|
3381 | 3381 | 1. A call to MORECORE that can normally contiguously extend memory.
|
3382 | 3382 | (disabled if not MORECORE_CONTIGUOUS or not HAVE_MORECORE or
|
3383 |
| - or main space is mmapped or a previous contiguous call failed) |
| 3383 | + main space is mmapped or a previous contiguous call failed) |
3384 | 3384 | 2. A call to MMAP new space (disabled if not HAVE_MMAP).
|
3385 | 3385 | Note that under the default settings, if MORECORE is unable to
|
3386 | 3386 | fulfill a request, and HAVE_MMAP is true, then mmap is
|
|
0 commit comments