Searched defs:free (Results 126 - 150 of 203) sorted by relevance

123456789

/external/jemalloc/include/jemalloc/
H A Djemalloc.h180 # define free je_free macro
/external/libnfc-nci/src/nfa/include/
H A Dnfa_snep_api.h158 UINT8 *p_buff; /* buffer to free */
181 tNFA_SNEP_FREE free; /* NFA_SNEP_FREE_BUFF_EVT */ member in union:__anon24077
323 ** through registered p_cback. Application may free the buffer
347 ** through p_cback. Application may free the buffer after receiving
382 ** through registered callback function. Application may free
/external/skia/include/core/
H A DSkTemplates.h131 void free() { function in class:SkAutoTDelete
179 void free() { SkDELETE_ARRAY(fArray); fArray = NULL; } function in class:SkAutoTDeleteArray
193 /** Allocate an array of T elements, and free the array in the destructor
276 // 'fArray' was allocated last time so free it now
/external/skia/src/core/
H A DSkTLList.h302 bool free = fFreeList.isInList(block->fNodes + i); local
304 SkASSERT(free != active);
306 freeCnt += free;
323 bool free = fFreeList.isInList(block->fNodes + i); local
325 SkASSERT(free != active);
327 freeCnt += free;
/external/srec/portable/src/
H A Dpmalloc.c37 #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 linke
[all...]
H A Dpmemfixed.c28 #undef free macro
36 of free memory blocks of a fixed size. The memory pools are ordered in increasing block
39 to store the address of the next free memory block in the linked list, and to store the
40 memory block's pool ID (this is used by the free function to determine which pool the block
47 memory manager searches the remaining pools in the sequence until it finds a free block or
467 by PortFree to determine how much requested memory has been free'd */
H A Dpmemory.c37 #undef free macro
62 /* If enabled, logs individual memory allocation, reallocation, free operations */
120 #define free PortDelete macro
313 free((LCHAR*) gMemoryMap[i].tag);
442 pfprintf(gFile, L("pmem|free|%s|%s|%d|0x%x|%s|\n"), e->tag, data->stackTrace, data->size, ptr, stackTrace);
444 pfprintf(gFile, L("pmem|free|%s|%d|0x%x\n"), e->tag, data->size, ptr);
565 Upon successful completion with size not equal to 0, malloc() shall return a pointer to the allocated space. If size is 0, either a null pointer or a unique pointer that can be successfully passed to free() shall be returned. Otherwise, it shall return a null pointer and set errno to indicate the error.
643 free(stackTrace);
726 If ptr does not match a pointer returned earlier by calloc(), malloc() or realloc() or if the space has previously been deallocated by a call to free() or realloc(), the behaviour is undefined.
731 Upon successful completion with a size not equal to 0, realloc() returns a pointer to the (possibly moved) allocated space. If size is 0, either a null pointer or a unique pointer that can be successfully passed to free() i
[all...]
/external/wpa_supplicant_8/hostapd/src/utils/
H A Dos.h484 #define os_free(p) free((p))
617 #define free OS_DO_NOT_USE_free macro
/external/wpa_supplicant_8/src/utils/
H A Dos.h484 #define os_free(p) free((p))
617 #define free OS_DO_NOT_USE_free macro
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dos.h484 #define os_free(p) free((p))
617 #define free OS_DO_NOT_USE_free macro
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h76 void (ANTLR3_CDECL *free)(void * data); member in struct:ANTLR3_HASH_ENTRY_struct
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table); member in struct:ANTLR3_HASH_TABLE_struct
174 void (*free) (struct ANTLR3_HASH_ENUM_struct * table); member in struct:ANTLR3_HASH_ENUM_struct
186 void (*free) (struct ANTLR3_LIST_struct * list); member in struct:ANTLR3_LIST_struct
208 void (*free) (struct ANTLR3_STACK_struct * stack); member in struct:ANTLR3_STACK_struct
230 * that can free the element if it is removed. It auto resizes but does not
250 * the malloc/free callas we would otherwise require.
255 * case only the factory can free the memory for the actual vector,
256 * though the vector free function is called and will recurse through its
257 * entries calling any free pointer
265 void (ANTLR3_CDECL *free) (struct ANTLR3_VECTOR_struct * vector); member in struct:ANTLR3_VECTOR_struct
386 void (*free) (struct ANTLR3_INT_TRIE_struct * trie); member in struct:ANTLR3_INT_TRIE_struct
503 void (*free) (struct ANTLR3_TOPO_struct * topo); member in struct:ANTLR3_TOPO_struct
[all...]
/external/chromium_org/content/public/android/java/src/org/chromium/content/browser/
H A DChildProcessLauncher.java59 // The list of free (not bound) service indices. When looking for a free service, the first
109 public void free(ChildProcessConnection connection) { method in class:ChildProcessLauncher.ChildConnectionAllocator
115 Log.e(TAG, "Unable to find connection to free in slot: " + slot +
215 getConnectionAllocator(connection.isInSandbox()).free(connection);
378 // Notify the native code so it can free the heap allocated callback.
/external/chromium_org/third_party/freetype/src/base/
H A Dftdbgmem.c136 FT_Free_Func free; member in struct:FT_MemTableRec_
249 table->free( memory, block );
325 table->free = memory->free;
334 memory->free( memory, table );
667 "trying to free unknown block at %p in (%s:%ld)\n",
718 ft_mem_debug_panic( "trying to free NULL in (%s:%ld)",
836 memory->free = ft_mem_debug_free;
889 memory->free = table->free;
[all...]
/external/chromium_org/third_party/ots/src/
H A Dots.cc89 void (*free)(ots::OpenTypeFile *file); member in struct:__anon14752::__anon14753
733 table_parsers[i].free(&header);
/external/chromium_org/third_party/skia/src/gpu/gl/
H A DGrGLCreateNullInterface.cpp55 // NULL out the entries that are really free list links rather than ptrs before deleting.
77 // no free slots - create a new one
82 // grab the head of the free list and advance the head to the next free slot.
93 void free(BufferObj* buffer) { function in class:BufferManager
105 // Index of the first entry of fBuffers in the free list. Free slots in fBuffers are indices to
106 // the next free slot. The last free slot has a value of kFreeListEnd.
235 ctx->fBufferManager.free(buffer);
/external/conscrypt/src/main/java/org/conscrypt/
H A DOpenSSLEngineImpl.java704 free();
708 private void free() { method in class:OpenSSLEngineImpl
719 free();
/external/deqp/framework/platform/null/
H A DtcuNullRenderContext.cpp61 void free (deUint32 object) function in class:tcu::null::ObjectManager
/external/freetype/src/base/
H A Dftdbgmem.c136 FT_Free_Func free; member in struct:FT_MemTableRec_
249 table->free( memory, block );
325 table->free = memory->free;
334 memory->free( memory, table );
667 "trying to free unknown block at %p in (%s:%ld)\n",
718 ft_mem_debug_panic( "trying to free NULL in (%s:%ld)",
836 memory->free = ft_mem_debug_free;
889 memory->free = table->free;
[all...]
/external/libnfc-nci/src/nfc/nfc/
H A Dnfc_ncif.c364 ** Returns TRUE if need to free buffer
370 BOOLEAN free = TRUE; local
384 free = FALSE;
403 free = nci_proc_core_rsp (p_msg);
456 return (free);
/external/libxml2/
H A Ddict.c106 xmlChar *free; member in struct:_xmlDictStrings
252 if (pool->end - pool->free > namelen)
275 pool->free = &pool->array[0];
284 ret = pool->free;
285 memcpy(pool->free, name, namelen);
286 pool->free += namelen;
287 *(pool->free++) = 0;
320 if (pool->end - pool->free > namelen + plen + 1)
343 pool->free = &pool->array[0];
352 ret = pool->free;
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftdbgmem.c136 FT_Free_Func free; member in struct:FT_MemTableRec_
249 table->free( memory, block );
325 table->free = memory->free;
334 memory->free( memory, table );
667 "trying to free unknown block at %p in (%s:%ld)\n",
718 ft_mem_debug_panic( "trying to free NULL in (%s:%ld)",
836 memory->free = ft_mem_debug_free;
889 memory->free = table->free;
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/
H A DSDL_sysvideo.h5 This library is free software; you can redistribute it and/or
68 be verified by ListModes(), and the video subsystem is free to
324 void (*free)(_THIS); member in struct:SDL_VideoDevice
/external/qemu/hw/android/goldfish/
H A Daudio.c185 goldfish_audio_buff_send( struct goldfish_audio_buff* b, int free, struct goldfish_audio_state* s ) argument
189 if (write > free)
190 write = free;
501 static void goldfish_audio_callback(void *opaque, int free) argument
506 /* loop until free is zero or both buffers are empty */
507 while (free && s->current_buffer) {
510 while (free && s->current_buffer == 1) {
511 int written = goldfish_audio_buff_send( s->out_buff1, free, s );
514 free -= written;
526 while (free
[all...]
/external/valgrind/main/coregrind/
H A Dm_oset.c13 This program is free software; you can redistribute it and/or
117 OSetFree_t free; // deallocator member in struct:_OSet
307 t->free = _free;
337 t->free);
354 t->free = os->free;
395 /* must free all children of a node before the node itself. */
410 t->free(n);
419 t->free(t);
449 t->free( node_of_ele
[all...]
/external/valgrind/main/memcheck/
H A Dmc_malloc_wrappers.c3 /*--- malloc/free wrappers for detecting errors and updating bits. ---*/
14 This program is free software; you can redistribute it and/or
63 /*--- Tracking malloc'd and free'd blocks ---*/
90 This allows a client to allocate and free big blocks
129 /* Release enough of the oldest blocks to bring the free queue
163 /* free MC_Chunk */
206 if the free list volume is exceeded. */
460 /* Note: we do not free fill the custom allocs produced
475 /* If the free list volume is bigger than MC_(clo_freelist_vol),
507 /* check if it is a matching free() / delet
516 void MC_(free) ( ThreadId tid, void* p ) function
[all...]

Completed in 536 milliseconds

123456789