|
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 |
|
@@ -607,7 +607,7 @@ DEFAULT_MMAP_THRESHOLD default: 256K
|
607 | 607 | declaration needed is the mallinfo struct that is returned (by-copy)
|
608 | 608 | by mallinfo(). The malloinfo struct contains a bunch of fields that
|
609 | 609 | are not even meaningful in this version of malloc. These fields are
|
610 |
| - are instead filled by mallinfo() with other numbers that might be of |
| 610 | + instead filled by mallinfo() with other numbers that might be of |
611 | 611 | interest.
|
612 | 612 |
|
613 | 613 | HAVE_USR_INCLUDE_MALLOC_H should be set if you have a
|
@@ -1621,7 +1621,7 @@ static MLOCK_T magic_init_mutex;
|
1621 | 1621 | Each freshly allocated chunk must have both cinuse and pinuse set.
|
1622 | 1622 | That is, each allocated chunk borders either a previously allocated
|
1623 | 1623 | and still in-use chunk, or the base of its memory arena. This is
|
1624 |
| - ensured by making all allocations from the the `lowest' part of any |
| 1624 | + ensured by making all allocations from the `lowest' part of any |
1625 | 1625 | found chunk. Further, no free chunk physically borders another one,
|
1626 | 1626 | so each free chunk is known to be preceded and followed by either
|
1627 | 1627 | inuse chunks or the ends of memory.
|
@@ -1827,12 +1827,12 @@ nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|
1827 | 1827 | of the same size are arranged in a circularly-linked list, with only
|
1828 | 1828 | the oldest chunk (the next to be used, in our FIFO ordering)
|
1829 | 1829 | actually in the tree. (Tree members are distinguished by a non-null
|
1830 |
| - parent pointer.) If a chunk with the same size an an existing node |
| 1830 | + parent pointer.) If a chunk with the same size as an existing node |
1831 | 1831 | is inserted, it is linked off the existing node using pointers that
|
1832 | 1832 | work in the same way as fd/bk pointers of small chunks.
|
1833 | 1833 |
|
1834 | 1834 | Each tree contains a power of 2 sized range of chunk sizes (the
|
1835 |
| - smallest is 0x100 <= x < 0x180), which is is divided in half at each |
| 1835 | + smallest is 0x100 <= x < 0x180), which is divided in half at each |
1836 | 1836 | tree level, with the chunks in the smaller half of the range (0x100
|
1837 | 1837 | <= x < 0x140 for the top nose) in the left subtree and the larger
|
1838 | 1838 | half (0x140 <= x < 0x180) in the right subtree. This is, of course,
|
@@ -3442,7 +3442,7 @@ static void* sys_alloc(mstate m, size_t nb) {
|
3442 | 3442 | least-preferred order):
|
3443 | 3443 | 1. A call to MORECORE that can normally contiguously extend memory.
|
3444 | 3444 | (disabled if not MORECORE_CONTIGUOUS or not HAVE_MORECORE or
|
3445 |
| - or main space is mmapped or a previous contiguous call failed) |
| 3445 | + main space is mmapped or a previous contiguous call failed) |
3446 | 3446 | 2. A call to MMAP new space (disabled if not HAVE_MMAP).
|
3447 | 3447 | Note that under the default settings, if MORECORE is unable to
|
3448 | 3448 | fulfill a request, and HAVE_MMAP is true, then mmap is
|
|
0 commit comments