Listing 1. example1.c (vulnerable to a heap-based buffer overflow).
清单1 . example1 . c(容易出现基于堆的缓冲区溢出)。
Listing 4. example2.c (vulnerable to a heap-based buffer overflow).
清单4 . example2 . c(容易出现基于堆的缓冲区溢出)。
The following example is vulnerable to a heap-based buffer overflow
以下示例容易出现基于堆的缓冲区溢出
For example, the PalmOS provides two distinctive memory resources: heap-based and database-based.
例如，PalmOS提供两种不同的内存资源：基于堆和基于数据库。
NHRT programming with nonheap memory creates significantly more work compared with writing regular heap-based applications.
与编写普通的基于堆的应用程序相比，使用非堆内存的NHRT编程使工作量大大提高。
Our MeasurementManager will be used by NHRTs fetching measurements and by the heap-based auditing thread to return measurements.
我们的MeasurementManager将由NHRT用于获取度量结果，由基于堆的审计线程用于返回度量结果。
Listing 1 does not validate user-supplied data when copying it to the buffer member of the previously allocated struct mystruct using the strcpy function, resulting in a heap-based buffer overflow.
在使用strcpy函数将用户提供的数据复制到先前分配的struct mystruct的buffer成员中时，清单1不验证用户提供的数据，造成堆中缓冲区溢出。
This means DB2 will calculate the amount of instance memory needed for the current configuration, based on the sizes of the monitor heap, audit buffer and the FCM buffers.
这意味着DB 2将根据监视器堆、审计缓冲区和FCM缓冲区的大小计算当前配置所需的实例内存数量。
The size of the heap varies, based on the specified or default heap minimum and maximum sizes, and the usage of the heap.
堆的大小取决于指定或者默认的最小和最大值以及堆的使用情况。
So far, you've located the heap within the address space, based only on its size.
到目前为止，我们只是在根据大小来了解堆在地址空间中的分配情况。
These data types are not categorized into different data structures or regions based on their ownership context; rather, these are the top-most growing data types for the whole heap.
这些数据类型没有根据它们的所属权上下文分为不同种类的数据结构或区域；相反，它们是整个堆中增长最快的数据类型。
This can get rid of the sawtooth pattern often seen for the managed heap size in.net-based applications, and reduces the time an application spends performing garbage collection.
这可以消除基于.NET的应用程序中托管堆大小常见的锯齿模式，并且减少了应用程序为执行垃圾回收而花费的时间。
The time spent in GC pauses for the mark and sweep phases of a garbage collection are based on the number of live objects on the heap.
用于垃圾收集的标记和清扫阶段的GC暂停时间基于堆上的活动对象的数量。
MDD4J uses different terms for heap dump files based on when they were taken
MDD4J为堆转储文件使用不同的术语，以其获得的时间为依据
HeapRoots is an experimental console-based tool for analyzing IBM JDK heap dumps similar to the HAT tool, but it does not pinpoint the root cause of a memory leak.
HeapRoots是一种用于分析IBMjdk堆转储的基于控制台的实验性工具，它类似于HAT工具，但是它不能查明内存泄漏的根源。
DelayQueue: a time-based scheduling queue backed by a priority heap.
DelayQueue：一个由优先级堆支持的、基于时间的调度队列。
In addition, WebSphere Application Server tuning of the JVM heap and threads pools is automated based on the size of the virtual machine.
此外，jvm堆和线程池的WebSphereApplicationserver调优会根据虚拟机的大小自动进行。
Stack based Object not Copied to heap if you send retain message to it?
基于堆栈的对象复制到堆不如果你把保留信息吗？
The distance measure of two clusters is redefined. Based on this concept, heap structure is constructed.
在层次聚类过程中，重新定义了簇与簇之间的距离度量，并以此为基础建立堆结构。
A design model of a finite length rectangular pressure vessel was established based on the plate heap theory, the calculation formula of the side plate thickness was derived.
在平板叠加理论的基础上，建立了一个有限长对称矩形压力容器的设计模型，并推导出其侧板厚度的计算公式。
Finally, based on introduction of heap leaching technology at home and abroad, research difficulties of heap leaching theory are emphasized.
最后，在介绍国内外堆浸技术研究进展的基础上，重点阐述了堆浸理论的研究难点。
In a serious program this priority queue might be based on a heap, as described in Chapter 12, "Heaps."
在正式的程序中，优先级队列可能基于堆来实现，正如第12章“堆”所描述的。
To cope with the problem of heap memory leak, this paper presents a dynamic memory leak check technology based on red-black tree.
实现时采用红黑树管理所分配的堆内存，理论推导和实验表明其具有较高的效率。
To cope with the problem of heap memory leak, this paper presents a dynamic memory leak check technology based on red-black tree.
实现时采用红黑树管理所分配的堆内存，理论推导和实验表明其具有较高的效率。
应用推荐