| /glibc-2.36/string/ |
| D | str-two-way.h | 245 size_t memory = 0; in two_way_short_needle() local
253 i = MAX (suffix, memory); in two_way_short_needle()
265 while (memory < i + 1 && (CANON_ELEMENT (*pneedle--) in two_way_short_needle()
268 if (i + 1 < memory + 1) in two_way_short_needle()
273 memory = needle_len - period; in two_way_short_needle()
278 memory = 0; in two_way_short_needle()
420 size_t memory = 0; in two_way_long_needle() local
433 if (memory && shift < period) in two_way_long_needle()
440 memory = 0; in two_way_long_needle()
446 i = MAX (suffix, memory); in two_way_long_needle()
[all …]
|
| /glibc-2.36/manual/ |
| D | memory.texi | 3 @c %MENU% Allocating virtual memory and controlling paging
4 @cindex memory allocation
7 This chapter describes how processes manage and use memory in a system
11 virtual memory in various ways. They vary in generality and in
13 and allocation of real memory.
20 * Memory Protection:: Controlling access to memory regions.
31 One of the most basic resources a process has available to it is memory.
32 There are a lot of different ways systems organize memory, but in a
38 The virtual memory is divided into pages (4 kilobytes is typical).
39 Backing each page of virtual memory is a page of real memory (called a
[all …]
|
| D | tunables.texi | 72 * Memory Allocation Tunables:: Tunables in the memory allocation subsystem
78 * Memory Related Tunables:: Tunables that control the use of memory by
105 @cindex memory allocation tunables
121 efficient) memory allocator for the @code{malloc} family of functions that is
124 bugs). Not all such errors can be protected against, however, and memory
140 This tunable determines the amount of extra memory in bytes to obtain from the
153 If set to a non-zero value, memory blocks are initialized with values depending
156 uninitialized or freed heap memory. Note that this option does not guarantee
169 it is guaranteed that the memory for these chunks can be returned to the system
185 memory to the system from that arena.
[all …]
|
| D | resource.texi | 5 resources (CPU time, memory, etc.) a process has used and getting and setting
12 * Memory Resources:: Querying memory available resources.
71 number of kilobytes of physical memory that @var{processes} used
76 indicates the amount of memory used by text that was shared with other
81 unshared memory used for data.
85 unshared memory used for stack space.
94 The number of times @var{processes} was swapped entirely out of main memory.
284 The maximum size of data memory for the process. If the process tries
285 to allocate data memory beyond this amount, the allocation function
303 The maximum amount of physical memory that this process should get.
[all …]
|
| D | probes.texi | 18 * Memory Allocation Probes:: Probes in the memory allocation subsystem
26 the virtual memory subsystem of @theglibc{}.
45 @var{$arg1} is a pointer to the base of the memory area, where the
74 obtain the requested amount of memory from the arena in use, before they
76 retry the allocation. Argument @var{$arg1} is the amount of memory
79 @var{$arg2} is the pointer to the memory area being resized. In the
95 important to determine which of the various memory allocation functions
135 @code{reused_arena}, when a thread first tries to allocate memory or
246 This probe is triggered when @code{free} determines that the memory
250 the allocated memory matching the key used to detect double frees.
[all …]
|
| D | debug.texi | 68 @c Collects info returned by _dl_addr in an auto array, allocates memory
103 The return value is @code{NULL} if sufficient memory for the strings
124 situations where the memory handling via @code{malloc} does not work
|
| D | setjmp.texi | 334 same memory region for a stack.
342 While allocating the memory for the stack one has to be careful. Most
343 modern processors keep track of whether a certain memory region is
345 heap memory are normally not tagged to allow this. The result is that
348 Safe ways to allocate stacks correctly include using memory on the
349 original thread's stack or explicitly allocating memory tagged for
357 the @code{uc_stack} element to point to the base of the memory region
358 allocated for the stack and the size of the memory region is stored in
|
| D | threads.texi | 68 enough memory.
674 The system does not have sufficient memory.
695 This function returns zero on success, and @code{ENOMEM} on memory
859 example by using regular instructions to load and store memory instead
860 of atomic instructions, or using relaxed memory ordering instead of
861 stronger memory ordering.
887 @c Note: No memory order on __libc_single_threaded. The
909 possible to use the weaker @code{__ATOMIC_RELAXED} memory ordering on
944 is able to prove that the memory is not shared.
989 must not be left pointing to memory areas which are freed or re-used.
[all …]
|
| D | dynlink.texi | 28 This function returns information about @var{handle} in the memory
64 of the @code{Dl_serinfo} object. The caller should then allocate memory
188 unwinding information, this is the in-memory address of the
|
| D | string.texi | 37 * Erasing Sensitive Data:: Clearing memory which contains sensitive
60 or dynamically allocated memory (@pxref{Memory Allocation}). It's up to
61 you to store the address of the chosen memory space into the pointer
109 The amount of memory allocated for a byte array may extend past the null byte
112 total amount of memory allocated for an array, while the term
173 blocks of memory, and functions that are specific to strings and wide
176 Functions that operate on arbitrary blocks of memory have names
179 (in bytes and wide characters respectively) of the block of memory to
212 Some of the memory and string functions take single characters as
371 function might get stuck in a loop trashing all the memory allocated to
[all …]
|
| D | search.texi | 115 the element one is searching for the memory allocated for the array
203 in-place sort and might thereby use an extra amount of memory to store
215 @comment This example is dedicated to the memory of Jim Henson. RIP.
289 in local memory out of control of the programmer. As an extension @theglibc{}
299 table in use or the program ran out of memory.
315 strings (if necessary at all). Freeing all the element memory is not
408 This allows having more than one hashing table at one time. The memory
415 program ran out of memory.
|
| D | intro.texi | 6 common operations as input/output, memory management, string
206 of the memory synchronization mechanisms POSIX exposes to users. It is
368 @c releasing the old memory. The ac-unsafe realloc could be implemented
380 Functions marked with @code{heap} may call heap memory management
395 opening files, mapping them into memory, allocating additional memory,
522 use memory synchronization primitives to avoid data races just as they
534 expected to access directly, such as memory buffers, strings, and
723 @c access uninitialized, unmapped or recycled memory. Each access will
817 memory if asynchronous thread cancellation interrupts their execution.
820 interface to allocate memory and store its address in the argument to a
[all …]
|
| D | llio.texi | 45 * Memory-mapped I/O:: Using files like memory.
158 is a problem if the thread allocates some resources (like memory, file
243 is a problem if the thread allocates some resources (like memory, file
322 Either there is not enough memory for the operation, or the process is
406 physical memory to lock down the user's pages. This is limited to
407 devices that transfer with direct memory access into the user's memory,
449 is a problem if the thread allocates some resources (like memory, file
593 physical memory to lock down the user's pages. This is limited to
594 devices that transfer with direct memory access into the user's memory,
647 is a problem if the thread allocates some resources (like memory, file
[all …]
|
| D | signal.texi | 9 invalid memory addresses; others report asynchronous events, such as
116 and invalid memory addresses.
372 the memory that is allocated for it, or to write memory that can only be
374 enough outside to be detected by the system's memory protection
389 @code{SIGSEGV} indicates an invalid access to valid memory, while
1821 A function can be non-reentrant if it uses memory that is not on the
1863 because they use a static data structure which records what memory
1865 free memory are reentrant. This includes functions that allocate space
1868 The best way to avoid the need to allocate memory in a handler is to
1871 The best way to avoid freeing memory in a handler is to flag or record
[all …]
|
| /glibc-2.36/iconv/ |
| D | strtab.c | 46 char memory[0]; member
53 struct memoryblock *memory; member
120 newmem->next = st->memory; in morememory()
121 st->memory = newmem; in morememory()
122 st->backp = newmem->memory; in morememory()
123 st->left = len - offsetof (struct memoryblock, memory); in morememory()
130 struct memoryblock *mb = st->memory; in strtabfree()
|
| /glibc-2.36/mach/ |
| D | err_kern.sub | 62 "(os/kern) memory failure",
63 "(os/kern) memory error",
76 "(os/kern) memory present",
88 "(os/device) memory allocation failure",
105 "(os/unix) insufficient memory",
107 "(os/unix) memory access fault",
|
| D | err_ipc.sub | 50 "(ipc/send) invalid memory", /* -101 */
65 "(ipc/rcv) invalid memory", /* -201 */
|
| D | err_mach.sub | 72 /* 12 */ "(ipc/send) invalid memory",
|
| /glibc-2.36/sysdeps/s390/ |
| D | configure.ac | 89 : : "a" (buf) : "memory", "r0");
117 : "memory", "cc");
170 : "=d" (i) : : "memory", "v16");
198 : : "a" (buf) : "memory", "r0");
|
| D | configure | 125 : : "a" (buf) : "memory", "r0");
164 : "memory", "cc");
237 : "=d" (i) : : "memory", "v16");
275 : : "a" (buf) : "memory", "r0");
|
| /glibc-2.36/ChangeLog.old/ |
| D | ChangeLog.libidn | 119 * idna.c (idna_to_unicode_4z4z): Fix test for failed memory allocation.
124 * stringprep.c (stringprep): Free memory if allocation failed.
125 * idna.c: Fix memory handling in several places.
|
| /glibc-2.36/sysdeps/alpha/alphaev6/ |
| D | memset.S | 148 wh64 ($4) # L1 : memory subsystem write hint
200 stq $1, 0($5) # L : And back to memory
|
| /glibc-2.36/po/ |
| D | rw.po | 40 msgid "out of memory"
|
| /glibc-2.36/ |
| D | NEWS | 28 caller to release the memory of a dying process. The release of the
29 memory is carried out in the context of the caller, using the caller's
114 [28850] libc: linux: __get_nprocs_sched reads uninitialized memory
116 [28852] libc: getaddrinfo leaks memory with AI_ALL
385 function could result in a memory leak and potential access of
386 uninitialized memory. Reported by Qualys.
415 [25947] malloc: memory leak in muntrace
702 * The deprecated memory allocation hooks __malloc_hook, __realloc_hook,
715 file shared memory file system to be mounted at /dev/shm. These functions
762 [19511] nptl: 8MB memory leak in pthread_create in case of failure
[all …]
|
| D | config.make.in | 83 memory-tagging = @memory_tagging@
|