return NULL;
}
- /* Only considere the actual usable range. */
+ /* Only consider the actual usable range. */
__set_vma_name (p2, size, " glibc: malloc arena");
madvise_thp (p2, size);
there's no compelling reason to bother to do this.)
The main declaration needed is the mallinfo struct that is returned
- (by-copy) by mallinfo(). The SVID/XPG malloinfo struct contains a
+ (by-copy) by mallinfo(). The SVID/XPG mallinfo struct contains a
bunch of fields that are not even meaningful in this version of
malloc. These fields are are instead filled by mallinfo() with
other numbers that might be of interest.
might set to a value close to the average size of a process
(program) running on your system. Releasing this much memory
would allow such a process to run in memory. Generally, it's
- worth it to tune for trimming rather tham memory mapping when a
+ worth it to tune for trimming rather than memory mapping when a
program undergoes phases where several large chunks are
allocated and released in ways that can reuse each other's
storage, perhaps mixed with phases where there are no such
having to zero memory over and over again
The implementation works with a sliding threshold, which is by default
- limited to go between 128Kb and 32Mb (64Mb for 64 bitmachines) and starts
+ limited to go between 128Kb and 32Mb (64Mb for 64 bit machines) and starts
out at 128Kb as per the 2001 default.
This allows us to satisfy requirement 1) under the assumption that long
It is only constructed if the pedantic testing is requested. */
static struct hdr *root;
-/* Nonzero if pedentic checking of all blocks is requested. */
+/* Nonzero if pedantic checking of all blocks is requested. */
static bool pedantic;
#if defined _LIBC || defined STDC_HEADERS || defined USG
failed[idx_munmap] ? "\e[01;41m" : "",
(unsigned long int) failed[idx_munmap]);
- /* Write out a histoogram of the sizes of the allocations. */
+ /* Write out a histogram of the sizes of the allocations. */
fprintf (stderr, "\e[01;32mHistogram for block sizes:\e[0;0m\n");
/* Determine the maximum of all calls for each size range. */
xpthread_barrier_wait (&barrier);
- /* Stage 2: Half of the threads allocationg memory and the other
+ /* Stage 2: Half of the threads allocating memory and the other
* half deallocating:
* - In the non cross-thread dealloc scenario the first half will be
* deallocating the memory allocated by themselves in stage 1 and the
EINTR). So pthread_cancel cannot send SIGCANCEL unless the cancellation
is enabled.
In this case the target thread is set as 'cancelled' (CANCELED_BITMASK)
- by atomically setting 'cancelhandling' and the cancelation will be acted
- upon on next cancellation entrypoing in the target thread.
+ by atomically setting 'cancelhandling' and the cancellation will be acted
+ upon on next cancellation entrypoint in the target thread.
It also requires to atomically check if cancellation is enabled, so the
state are also tracked on 'cancelhandling'. */
if (oldval == newval)
break;
- /* Only send the SIGANCEL signal if cancellation is enabled, since some
+ /* Only send the SIGCANCEL signal if cancellation is enabled, since some
syscalls are never restarted even with SA_RESTART. The signal
will act iff async cancellation is enabled. */
if (cancel_enabled (newval))
if (__glibc_unlikely (GLRO(dl_debug_mask) & DL_DEBUG_SECURITY))
warn (l, program);
/* Binary is not marked and loaded via dlopen: abort. Also, do not
- fail is optional dlopne_mode is being used with audit modules without
+ fail is optional dlopen_mode is being used with audit modules without
GCS support. */
if (program == NULL && (dlopen_mode & __RTLD_AUDIT) == 0)
fail (l, program);
/* Find origin of the executable. */
extern const char *_dl_get_origin (void) attribute_hidden;
-/* Return the canonalized path name from the opened file descriptor FD,
+/* Return the canonicalized path name from the opened file descriptor FD,
or NULL otherwise. */
extern char * _dl_canonicalize (int fd) attribute_hidden;
}
/* Call the la_objsearch from the audit modules from the link map L. If
- ORIGNAME is non NULL, it is updated with the revious name prior calling
+ ORIGNAME is non NULL, it is updated with the previous name prior calling
la_objsearch. */
const char *_dl_audit_objsearch (const char *name, struct link_map *l,
unsigned int code)