显示分配的内存块和字节数。
其实他们俩不属于哪个特定的对象，所以不会出现在为哪个特定对象分配的内存块里。
Actually they two do not belong to which specific target, won't go out to be distributive of which specific target now so in memory piece.
如果在堆的顶部分配的内存块不在缓存中，执行会在内存内容装入缓存的过程中出现延迟。
If you allocate a block of memory on the heap that is not already in the cache, execution will stall while the contents of that memory are brought into the cache.
AIX未存储关于哪些代码路径默认分配了特定内存块的信息，但这些信息很容易获得。
AIX does not store information about which code path allocated a particular chunk of memory by default, so this information is not easy to get.
缓冲区缓存——为存储从物理数据文件读取的数据块而分配的内存。
Buffer Cache - Memory allocated for storing data blocks read from physical data files.
溢出是指数据被添加到分配给该缓冲区的内存块之外。
An overflow occurs when data is added to the buffer outside the block of memory allocated to the buffer.
清单3 中的函数释放链表中的所有内存块，然后释放由 newBuffer()分配的Buffer 。
The function in Listing 3 frees any memory blocks in the linked list, then frees the Buffer allocated by newBuffer().
另一种避免同步问题的方法是，分配一个很大的全局内存块，并将其划分为较小的槽位，其中每个槽位都可由一个线程用来进行日志记录。
Another way to avoid synchronization issues is to allocate a large chunk of global memory and break it into smaller slots, where each slot is to be used by one thread for logging.
所以，如果一个字节序列可以是一个指向一块被分配的内存的指针，那么收集器就将其标记为正在被引用。
So, if a sequence of bytes could be a pointer to a piece of allocated memory, it marks it as being referenced.
内存管理器以块的形式将内存分配给线程，以最小化堆锁定争用。
The memory manager allocates memory to threads in chunks to minimize contention on the heap lock.
内存管理通常是由来自编码人员的请求处理的，以分配和释放内存块。
Memory management is usually handled by requests from the coder to allocate and release blocks of memory.
该方法释放您先前创建的内存块，并使得从分配程序例程返回的所有指针失效。
It frees every memory block you created earlier and invalidates all the Pointers returned from the allocator routines.
清单1中的代码将分配两个 512字节的内存块，然后指向第一个内存块的指针被设定为指向第二个内存块。
The code in Listing 1 allocates two 512-byte blocks of memory, and then the pointer to the first block is set to the second block.
一个进程分配内存时，它是这样进行的：首先，预定虚拟内存；然后，提交内存到该块中(这是实际使用的内存)。
When a process allocates memory it does so by first reserving virtual memory and then committing memory out of this chunk (this is the memory actually used).
结果，如果没有足够大的自由内存块能够满足请求的需要，则分配一个很大的对象就会失败。
As a result, the allocation of a sufficiently large object can fail if no free chunk of memory is large enough to satisfy the request.
第一个分配程序是通用分配，可以满足针对任何数量的连续内存块的请求。
The first is a general-purpose allocation and can serve requests for any number of contiguous chunks.
如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存)，它就会溢出到该数据库所有的临时表中。
If the sorted data cannot fit entirely into the sort heap, which is a block of memory that is allocated each time a sort is performed, it overflows into a temporary table owned by the database.
当用户需要一块内存时，就请求给自己分配一定大小的内存。
When users need a block of memory, they make a request for a given size.
一块被用作动态内存分配的内存区域。
An area of memory that is used for dynamic memory allocation.
如果在计算处理完成之前，内存或磁盘空间的块分配已经耗尽，用户就会看到内存或磁盘空间用完的错误消息。
If the allocation of parts of either memory or disk space have been exhausted before a calculation process is complete, your user will get an error message that memory or disk space has run out.
依赖于大量很小的内存块，但是知道总数近似值的程序会发现构造一些很简单的分配器是很有用的。
Programs relying on large but approximately known numbers of very small chunks may find it profitable to build very simple allocators.
因此，必然会引发长时间的暂停来整理碎片或进行压缩，堆将很多小块的自由内存区域整合为一块大的自由内存区域，从而满足大型分配请求。
Consequently, it must incur a long pause to defragment, or compact, the heap to coalesce many smaller free memory areas into larger free memory areas to satisfy a large allocation request.
因为ELF对象的偏移量是基于0的(除非重新分配)，所以这些方便变量将相对偏移量包含到临时内存块中。
Because the ELF objects are based at offset 0 (until relocation), the convenience variables include the relative offset into the temporary memory block.
分配程序不能将空闲空间拼合为更大的内存块。
所有垃圾收集算法所面临的问题是相同的 ――找出由分配器分配的，但是用户程序不可到达的内存块。
The problem faced by all garbage collection algorithms is the same -- identify blocks of memory that have been dispensed by the allocator, but are unreachable by the user program.
然而，我们将尝试为ESTORE分配10块160MB的内存。
However, we will try to allocate 10 chunks of 160mb for ESTORE.
堆是在计算机RAM中的一块内存,它可以进行,动态内存分配。
So the heap is a chunk of memory in a computer's RAM that's conceptually allocated to what's called dynamic memory allocation.
分配程序库可能需要的由零填充的内存块。
Allocating blocks of zero-filled memory the library may need.
每个内存块在分配时都包含一个bufferblockheader头，后面跟着一个用于存储实际数据的缓冲区块。
Each memory block, when allocated, consists of a BufferBlockHeader header followed by a buffer block for storage of actual data.
每个内存块在分配时都包含一个bufferblockheader头，后面跟着一个用于存储实际数据的缓冲区块。
Each memory block, when allocated, consists of a BufferBlockHeader header followed by a buffer block for storage of actual data.
应用推荐