Searched defs:heap (Results 1 - 25 of 148) sorted by last modified time

123456

/external/zlib/src/
H A Ddeflate.h46 /* maximum heap size */
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
207 int heap_len; /* number of elements in the heap */
209 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
210 * The same heap array is used to build all trees.
/external/valgrind/main/perf/
H A Dbz2.c3206 zz = z; tmp = heap[zz]; \
3207 while (weight[tmp] < weight[heap[zz >> 1]]) { \
3208 heap[zz] = heap[zz >> 1]; \
3211 heap[zz] = tmp; \
3217 zz = z; tmp = heap[zz]; \
3222 weight[heap[yy+1]] < weight[heap[yy]]) \
3224 if (weight[tmp] < weight[heap[yy]]) break; \
3225 heap[z
3245 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
H A Dtest_input_for_tinycc.c2755 Int32 heap [ 258 + 2 ]; local
2767 heap[0] = 0;
2774 heap[nHeap] = i;
2775 { Int32 zz, tmp; zz = nHeap; tmp = heap[zz]; while (weight[tmp] < weight[heap[zz >> 1]]) { heap[zz] = heap[zz >> 1]; zz >>= 1; } heap[zz] = tmp; };
2781 n1 = heap[1]; heap[
[all...]
/external/valgrind/main/VEX/switchback/
H A Dtest_bzip2.c3191 zz = z; tmp = heap[zz]; \
3192 while (weight[tmp] < weight[heap[zz >> 1]]) { \
3193 heap[zz] = heap[zz >> 1]; \
3196 heap[zz] = tmp; \
3202 zz = z; tmp = heap[zz]; \
3207 weight[heap[yy+1]] < weight[heap[yy]]) \
3209 if (weight[tmp] < weight[heap[yy]]) break; \
3210 heap[z
3230 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/external/valgrind/main/exp-sgcheck/tests/
H A Dhackedbz2.c3215 zz = z; tmp = heap[zz]; \
3216 while (weight[tmp] < weight[heap[zz >> 1]]) { \
3217 heap[zz] = heap[zz >> 1]; \
3220 heap[zz] = tmp; \
3226 zz = z; tmp = heap[zz]; \
3231 weight[heap[yy+1]] < weight[heap[yy]]) \
3233 if (weight[tmp] < weight[heap[yy]]) break; \
3234 heap[z
3254 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/external/valgrind/main/memcheck/tests/
H A Dorigin5-bz2.c3206 zz = z; tmp = heap[zz]; \
3207 while (weight[tmp] < weight[heap[zz >> 1]]) { \
3208 heap[zz] = heap[zz >> 1]; \
3211 heap[zz] = tmp; \
3217 zz = z; tmp = heap[zz]; \
3222 weight[heap[yy+1]] < weight[heap[yy]]) \
3224 if (weight[tmp] < weight[heap[yy]]) break; \
3225 heap[z
3245 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
H A Dvarinfo6.c3244 zz = z; tmp = heap[zz]; \
3245 while (weight[tmp] < weight[heap[zz >> 1]]) { \
3246 heap[zz] = heap[zz >> 1]; \
3249 heap[zz] = tmp; \
3255 zz = z; tmp = heap[zz]; \
3260 weight[heap[yy+1]] < weight[heap[yy]]) \
3262 if (weight[tmp] < weight[heap[yy]]) break; \
3263 heap[z
3283 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/external/srec/srec/Semproc/src/
H A DSemanticProcessorImpl.c83 static ESR_ReturnCode sem_partial_path_list_init(sem_partial_path* heap, int nheap);
84 static sem_partial_path* sem_partial_path_create(sem_partial_path* heap);
85 static ESR_ReturnCode sem_partial_path_free(sem_partial_path* heap, sem_partial_path* path);
251 sem_partial_path* heap,
303 pp_branch = sem_partial_path_create(heap);
325 ESR_ReturnCode rc = checkpath_forwardByWordID(semgraph, heap, atokfna, pp_branch, currentWord);
340 sem_partial_path_free(heap, pp->next);
357 sem_partial_path* heap,
415 pp_branch = sem_partial_path_create(heap);
436 ESR_ReturnCode rc = checkpath_forward(semgraph, heap, atokfn
250 checkpath_forwardByWordID(SR_SemanticGraphImpl* semgraph, sem_partial_path* heap, arc_token* atoken_start, sem_partial_path *pp, const wordID* wordIDs) argument
356 checkpath_forward(SR_SemanticGraphImpl* semgraph, sem_partial_path* heap, arc_token* atoken_start, sem_partial_path *pp, const LCHAR* transcription) argument
488 sem_partial_path heap[MAX_SEM_PARTIAL_PATHS]; local
794 sem_partial_path heap[MAX_SEM_PARTIAL_PATHS]; local
1089 sem_partial_path_list_init(sem_partial_path* heap, int nheap) argument
1098 sem_partial_path_create(sem_partial_path* heap) argument
1153 sem_partial_path_free(sem_partial_path* heap, sem_partial_path* path) argument
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-path.h281 vector<StateId> heap; local
291 heap.push_back(final);
293 while (!heap.empty()) {
294 pop_heap(heap.begin(), heap.end(), compare);
295 StateId state = heap.back();
297 heap.pop_back();
317 heap.push_back(next);
318 push_heap(heap.begin(), heap
[all...]
/external/skia/src/core/
H A DSkPicture.cpp212 SkBitmapHeap* heap = SkNEW(SkBitmapHeap); local
213 copyInfo.controller.setBitmapStorage(heap);
214 heap->unref();
H A DSkPictureFlat.cpp76 void SkFlatController::setBitmapHeap(SkBitmapHeap* heap) { argument
77 SkRefCnt_SafeAssign(fBitmapHeap, heap);
H A DSkPictureFlat.h193 * objects being flattened contain bitmaps they are stored in this heap
194 * and the flattenable stores the index to the bitmap on the heap.
494 // Without a bitmap heap, we'll flatten bitmaps into paints. That's never what you want.
597 void setBitmapStorage(SkBitmapHeap* heap) { argument
598 this->setBitmapHeap(heap);
/external/skia/src/pipe/
H A DSkGPipeWrite.cpp90 void setBitmapStorage(SkBitmapHeap* heap) { argument
91 this->setBitmapHeap(heap);
133 // Look through the flattenable heap.
/external/qemu/distrib/zlib-1.2.8/
H A Ddeflate.h46 /* maximum heap size */
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
207 int heap_len; /* number of elements in the heap */
209 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
210 * The same heap array is used to build all trees.
/external/owasp/sanitizer/distrib/lib/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/owasp/sanitizer/lib/guava-libraries/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dant.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ...
H A Dfindbugs.jarMETA-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ...
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Ddeflate.h46 /* maximum heap size */
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
207 int heap_len; /* number of elements in the heap */
209 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
210 * The same heap array is used to build all trees.
/external/opencv/cxcore/include/
H A Dcxtypes.h753 struct CvSet* heap; member in struct:CvSparseMat
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_bufmgr_mm.c59 struct mem_block *heap; member in struct:mm_pb_manager
204 mm_buf->block = u_mmAllocMem(mm->heap, (int)size, (int)mm->align2, 0);
207 debug_printf("warning: heap full\n");
208 mmDumpMemInfo(mm->heap);
238 u_mmDestroy(mm->heap);
279 mm->heap = u_mmInit(0, (int)size);
280 if (!mm->heap)
286 if(mm->heap)
287 u_mmDestroy(mm->heap);
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_mm.c34 u_mmDumpMemInfo(const struct mem_block *heap) argument
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == 0) {
38 debug_printf(" heap == 0\n");
44 for (p = heap->next; p != heap; p = p->next) {
58 for (p = heap->next_free; p != heap; p = p->next_free) {
72 struct mem_block *heap, *bloc local
177 u_mmAllocMem(struct mem_block *heap, int size, int align2, int startSearch) argument
214 u_mmFindBlock(struct mem_block *heap, int start) argument
282 u_mmDestroy(struct mem_block *heap) argument
[all...]
H A Du_mm.h40 struct mem_block *heap; member in struct:mem_block
50 * return: a heap pointer if OK, NULL if error
61 * startSearch = linear offset from start of heap to begin search
64 extern struct mem_block *u_mmAllocMem(struct mem_block *heap, int size, int align2,
76 * input: pointer to a heap, start offset
79 extern struct mem_block *u_mmFindBlock(struct mem_block *heap, int start);
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c29 nouveau_heap_init(struct nouveau_heap **heap, argument
40 *heap = r;
45 nouveau_heap_destroy(struct nouveau_heap **heap) argument
47 if (!*heap)
49 free(*heap);
50 *heap = NULL;
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv, argument
59 if (!heap || !size || !res || *res)
62 while (heap) {
63 if (!heap
[all...]
/external/mesa3d/src/gallium/drivers/nv30/
H A Dnv30_draw.c283 struct nouveau_heap *heap = nv30_screen(pscreen)->vp_exec_heap; local
284 if (nouveau_heap_alloc(heap, 16, &r->vertprog, &r->vertprog)) {
285 while (heap->next && heap->size < 16) {
286 struct nouveau_heap **evict = heap->next->priv;
290 if (nouveau_heap_alloc(heap, 16, &r->vertprog, &r->vertprog))

Completed in 3034 milliseconds

123456