| /bionic/libc/bionic/ |
| malloc_debug_common.cpp | 226 extern "C" void free(void* mem) { function
227 __libc_malloc_dispatch->free(mem);
310 InitMallocFunction<MallocDebugFree>(malloc_impl_handler, &table->free, prefix, "free");
467 (gMallocUse.free == NULL) ||
|
| /bionic/libc/kernel/common/linux/ |
| module.h | 66 void (*free)(struct module *); member in struct:module_attribute
|
| /dalvik/vm/jdwp/ |
| JdwpPriv.h | 57 void (*free)(struct JdwpState* state); member in struct:JdwpTransport
169 (*state->transport->free)(state);
|
| /development/ndk/platforms/android-3/include/linux/ |
| module.h | 59 void (*free)(struct module *); member in struct:module_attribute
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3baserecognizer.h | 352 /** Pointer to a function that knows how to free the resources of a base recognizer.
354 void (*free) (struct ANTLR3_BASE_RECOGNIZER_struct * recognizer); member in struct:ANTLR3_BASE_RECOGNIZER_struct
|
| antlr3basetreeadaptor.h | 144 void (*free) (struct ANTLR3_BASE_TREE_ADAPTOR_struct * adaptor); member in struct:ANTLR3_BASE_TREE_ADAPTOR_struct
|
| antlr3commontreenodestream.h | 119 void (*free) (struct ANTLR3_TREE_NODE_STREAM_struct * tns); member in struct:ANTLR3_TREE_NODE_STREAM_struct
299 void (*free) (struct ANTLR3_COMMON_TREE_NODE_STREAM_struct * ctns); member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
304 /// closed it will not free the root tree as this tree always
|
| antlr3debugeventlistener.h | 386 /// Free up the resources allocated to this structure
388 void (*free) (pANTLR3_DEBUG_EVENT_LISTENER delboy); member in struct:ANTLR3_DEBUG_EVENT_LISTENER_struct
|
| antlr3tokenstream.h | 180 /** Function that knows how to free the memory for an ANTLR3_TOKEN_STREAM
182 void (*free) (struct ANTLR3_TOKEN_STREAM_struct * tokenStream); member in struct:ANTLR3_TOKEN_STREAM_struct
285 * but that does not free up any resources, such as the token factory
293 /** Function that knows how to free an ANTLR3_COMMON_TOKEN_STREAM
295 void (*free) (struct ANTLR3_COMMON_TOKEN_STREAM_struct * tokenStream); member in struct:ANTLR3_COMMON_TOKEN_STREAM_struct
|
| /external/bluetooth/bluedroid/stack/avrc/ |
| avrc_api.c | 55 #define AVRC_OP_DROP_N_FREE 0xFD /* use this unused opcode to indication no need to call the callback function & free buffer */
404 /* Free original START packet, replace with pointer to reassembly buffer */
532 BOOLEAN free = TRUE; local
583 p_rsp = p_pkt; /* this also sets free = FALSE, drop = TRUE */
613 p_rsp = p_pkt; /* this also sets free = FALSE, drop = TRUE */
677 free = FALSE;
679 free = TRUE;
747 p_rsp = p_pkt; /* this also sets free = FALSE, drop = TRUE */
761 free = FALSE;
780 if (free)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 21 struct list_head free; member in struct:mm_bucket
41 int free; member in struct:mm_slab
50 if (slab->free == 0)
58 slab->free--;
71 slab->free++;
72 assert(slab->free <= slab->count);
134 FREE(slab);
142 slab->count = slab->free = size >> chunk_order;
144 LIST_ADD(&slab->head, &mm_bucket_by_order(cache, chunk_order)->free);
180 if (LIST_IS_EMPTY(&bucket->free)) {
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkPostConfig.h | 266 # ifdef free
267 # undef free macro
270 # undef free macro
|
| SkTemplates.h | 130 void free() { function in class:SkAutoTDelete
174 void free() { SkDELETE_ARRAY(fArray); fArray = NULL; } function in class:SkAutoTDeleteArray
181 /** Allocate an array of T elements, and free the array in the destructor
264 // 'fArray' was allocated last time so free it now
|
| /external/chromium_org/v8/src/ia32/ |
| lithium-gap-resolver-ia32.cc | 55 // registers free for the whole algorithm.
253 // 2. We may have a free register that we can use without spilling.
254 Register free = GetFreeRegisterNot(no_reg); local
255 if (!free.is(no_reg)) return free;
432 // Register-memory. Use a free register as a temp if possible. Do not
452 // free register after that, use it as a second temporary.
|
| /external/clang/test/SemaTemplate/ |
| alias-templates.cpp | 33 void free(inner_ptr&&);
49 ~thing() { traits.free(static_cast<inner_ptr&&>(val)); }
61 template<> void traits<thing<bool>>::free(bool&) {} function in class:X::traits
|
| /external/kernel-headers/original/linux/ |
| smb.h | 33 __u16 free; member in struct:smb_dskattr
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 21 struct list_head free; member in struct:mm_bucket
41 int free; member in struct:mm_slab
50 if (slab->free == 0)
58 slab->free--;
71 slab->free++;
72 assert(slab->free <= slab->count);
134 FREE(slab);
142 slab->count = slab->free = size >> chunk_order;
144 LIST_ADD(&slab->head, &mm_bucket_by_order(cache, chunk_order)->free);
180 if (LIST_IS_EMPTY(&bucket->free)) {
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_qsort.c | 61 #ifdef free
62 #undef free macro
64 #define free SDL_free macro
348 free(pivot);
379 free(pivot);
426 free(pivot);
|
| /external/skia/include/core/ |
| SkPostConfig.h | 266 # ifdef free
267 # undef free macro
270 # undef free macro
|
| SkTemplates.h | 130 void free() { function in class:SkAutoTDelete
174 void free() { SkDELETE_ARRAY(fArray); fArray = NULL; } function in class:SkAutoTDeleteArray
181 /** Allocate an array of T elements, and free the array in the destructor
264 // 'fArray' was allocated last time so free it now
|
| /external/srec/portable/src/ |
| pmalloc.c | 37 #undef free macro
61 * scanning the free-memory linked list in PortFree(). If SPEEDUP is defined, then
62 * split the memory pool into imaginary 'bins', and keep track of the first free list
108 /* Memory pool free list */
110 * free list entry in each bin. This is to speed up the linked-list search
197 free(memBuffer);
333 _UPD_Altab(q->_Size, q->_Size, 0); /* heap=alloc+free */
365 /* remove *qb cell from free list.
370 /* Check whether the cell is at the end of the 'free' linked-list */
373 /* The cell is not at the end of the free linked-list; find out which bin the next free cell is in *
[all...] |
| /external/v8/src/ia32/ |
| lithium-gap-resolver-ia32.cc | 55 // registers free for the whole algorithm.
253 // 2. We may have a free register that we can use without spilling.
254 Register free = GetFreeRegisterNot(no_reg); local
255 if (!free.is(no_reg)) return free;
374 // Register-memory. Use a free register as a temp if possible. Do not
394 // free register after that, use it as a second temporary.
|
| /external/valgrind/main/coregrind/ |
| m_xarray.c | 13 This program is free software; you can redistribute it and/or
15 published by the Free Software Foundation; either version 2 of the
24 along with this program; if not, write to the Free Software
43 void (*free) ( void* ); /* free fn */ member in struct:_XArray
72 xa->free = free_fn;
89 vg_assert(xa->free);
109 nyu->free(nyu);
122 vg_assert(xa->free);
124 xa->free(xa->arr)
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| os.h | 243 * os_free - Free dynamic memory
418 #define os_free(p) free((p))
513 #define free OS_DO_NOT_USE_free macro
|
| /hardware/libhardware/include/hardware/ |
| gralloc.h | 164 * This function doesn't close or free the handle itself; this is done
277 * (*free)() Frees a previously allocated buffer.
286 int (*free)(struct alloc_device_t* dev, member in struct:alloc_device_t
|
