| /system/libhidl/libhidlcache/ |
| MemoryDealer.cpp | 62 chunk_t(size_t start, size_t size) : start(start), size(size), free(1) {}
65 int free : 4; member in struct:android::hardware::SimpleBestFitAllocator::chunk_t
165 if (cur->free && (cur->size >= (size + extra))) {
177 free_chunk->free = 0;
210 LOG_FATAL_IF(cur->free, "block at offset 0x%08lX of size 0x%08lX already freed",
215 cur->free = 1;
221 if (p->free || !cur->size) {
230 } while (cur && cur->free);
233 if (!freed->free) {
234 dump_l("dealloc (!freed->free)");
[all...] |
| /system/nfc/src/nfa/include/ |
| nfa_snep_api.h | 146 uint8_t* p_buff; /* buffer to free */
167 tNFA_SNEP_FREE free; /* NFA_SNEP_FREE_BUFF_EVT */ member in union:__anon3514
|
| /external/cmockery/cmockery_0_1_2/src/google/ |
| cmockery.h | 241 // Redirect malloc, calloc and free to the unit test allocators.
245 #define free test_free macro
|
| /external/libchrome/base/process/ |
| process_metrics.h | 287 // GetSystemMemoryInfo(). Total/free swap memory are available on all platforms
292 // Free is absent on Windows (see "avail_phys" below).
303 int free = 0; member in struct:base::SystemMemoryInfoKB
309 // size of the standby, free, and zero lists." (MSDN).
|
| /external/libxml2/ |
| dict.c | 106 xmlChar *free; member in struct:_xmlDictStrings
217 * Free the dictionary mutex. Do not call unless sure the library
252 if ((size_t)(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 ((size_t)(pool->end - pool->free) > namelen + plen + 1)
343 pool->free = &pool->array[0]
[all...] |
| /external/protobuf/js/binary/ |
| reader.js | 150 jspb.BinaryReader.prototype.free = function() { method in class:jspb.BinaryReader
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGLCreateNullInterface.cpp | 41 // nullptr out the entries that are really free list links rather than ptrs before deleting.
63 // no free slots - create a new one
68 // grab the head of the free list and advance the head to the next free slot.
79 void free(T* object) { function in class:__anon34095::TGLObjectManager
92 // Index of the first entry of fGLObjects in the free list. Free slots in fGLObjects are indices
93 // to the next free slot. The last free slot has a value of kFreeListEnd.
293 fBufferManager.free(buffer)
[all...] |
| /external/skqp/src/gpu/gl/ |
| GrGLCreateNullInterface.cpp | 41 // nullptr out the entries that are really free list links rather than ptrs before deleting.
63 // no free slots - create a new one
68 // grab the head of the free list and advance the head to the next free slot.
79 void free(T* object) { function in class:__anon34761::TGLObjectManager
92 // Index of the first entry of fGLObjects in the free list. Free slots in fGLObjects are indices
93 // to the next free slot. The last free slot has a value of kFreeListEnd.
293 fBufferManager.free(buffer)
[all...] |
| /external/syslinux/memdisk/ |
| unzip.c | 101 static void free(void *where);
125 static void free(void *where) function
|
| /external/tensorflow/tensorflow/contrib/lite/ |
| context.h | 61 // This returns a pointer, that you must free using TfLiteIntArrayFree().
68 // You are expected to free memory with TfLiteIntArrayFree
71 // Free memory of array `v`.
199 // Free memory of tensor `t`;
202 // Set all of a tensor's fields (and free any previously allocated data).
311 // function to return `nullptr` and implement the free function to be a no-op.
315 void (*free)(TfLiteContext* context, void* buffer); member in struct:_TfLiteRegistration
|
| /frameworks/native/libs/binder/ |
| MemoryDealer.cpp | 144 : start(start), size(size), free(1), prev(0), next(0) {
148 int free : 4; member in struct:android::SimpleBestFitAllocator::chunk_t
182 /* NOTE: it's VERY important to not free allocations of size 0 because
342 if (cur->free && (cur->size >= (size+extra))) {
355 free_chunk->free = 0;
389 LOG_FATAL_IF(cur->free,
395 cur->free = 1;
399 if (p && (p->free || !cur->size)) {
406 } while (cur && cur->free);
409 if (!freed->free) {
[all...] |
| /hardware/qcom/audio/voice_processing/ |
| voice_processing.c | 329 free(session);
398 int free = -1; local
713 free(session);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/cloog/ |
| clast.h | 58 void (*free)(struct clast_stmt *); member in struct:clast_stmt_op
|
| /prebuilts/go/darwin-x86/src/fmt/ |
| print.go | 140 // free saves used pp structs in ppFree; avoids an allocation per invocation.
141 func (p *pp) free() { func
190 p.free()
205 p.free()
224 p.free()
241 p.free()
256 p.free()
273 p.free()
|
| scan.go | 124 s.free(old)
133 s.free(old)
144 s.free(old)
401 // free saves used ss structs in ssFree; avoid an allocation per invocation.
402 func (s *ss) free(old ssave) { func
|
| /prebuilts/go/linux-x86/src/fmt/ |
| print.go | 140 // free saves used pp structs in ppFree; avoids an allocation per invocation.
141 func (p *pp) free() { func
190 p.free()
205 p.free()
224 p.free()
241 p.free()
256 p.free()
273 p.free()
|
| scan.go | 124 s.free(old)
133 s.free(old)
144 s.free(old)
401 // free saves used ss structs in ssFree; avoid an allocation per invocation.
402 func (s *ss) free(old ssave) { func
|
| /tools/apkzlib/src/main/java/com/android/tools/build/apkzlib/zip/ |
| FileUseMap.java | 35 * some data (an entry, the Central Directory, the EOCD) or is a free entry.
37 * <p>For example: [0-95, "foo/"][95-260, "xpto"][260-310, free][310-360, Central Directory]
44 * <li>there are no two free entries next to each other; this is guaranteed by coalescing the
46 * <li>all free entries have a minimum size defined in the constructor, with the possible exception
66 * Tree with all free blocks ordered by size. This is essentially a view over {@link #map}
67 * containing only the free blocks, but in a different order.
70 private TreeSet<FileUseMapEntry<?>> free; field in class:FileUseMap
73 * If defined, defines the minimum size for a free entry.
81 * @param minFreeSize minimum size of a free entry
89 free = new TreeSet<>(FileUseMapEntry.COMPARE_BY_SIZE)
[all...] |
| /bionic/libc/bionic/ |
| malloc_common.cpp | 55 Malloc(free),
95 extern "C" void free(void* mem) { function
96 auto _free = __libc_globals->malloc_dispatch.free;
100 Malloc(free)(mem);
281 if (!InitMallocFunction<MallocFree>(impl_handler, &table->free, prefix, "free")) {
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/ |
| symtable.c | 320 which determines whether a name is local, global, or free. In addition,
322 bindings that are used for free variables in enclosed blocks.
324 There are also two kinds of free variables, implicit and explicit. An
326 global is a free variable for which the compiler has found no binding
340 are used to determine if the variable is free or an implicit global.
344 The children update the free variable set. If a local variable is free
347 frame. Cell variables are removed from the free set before the analyze
350 The sets of bound and free variables are implemented as dictionaries
374 PyObject *bound, PyObject *local, PyObject *free,
780 PyObject *free, *global; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/ |
| symtable.c | 318 which determines whether a name is local, global, or free. In addition,
320 bindings that are used for free variables in enclosed blocks.
322 There are also two kinds of free variables, implicit and explicit. An
324 global is a free variable for which the compiler has found no binding
338 are used to determine if the variable is free or an implicit global.
342 The children update the free variable set. If a local variable is free
345 frame. Cell variables are removed from the free set before the analyze
348 The sets of bound and free variables are implemented as dictionaries
372 PyObject *bound, PyObject *local, PyObject *free,
778 PyObject *free, *global; local
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 76 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 pointers for each entry
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/autotest/client/deps/nvmap_compactor/src/ |
| nvmap_carveout_compactor.c | 103 * This function gets the free amount of carveout from sysfs.
105 int GetCarveoutFreeSize(unsigned int *free)
114 * can query free carveout size
124 fscanf(f, "%d", free);
191 free(data);
353 unsigned int free; local
354 GetCarveoutFreeSize(&free);
355 printf("CarveOut free after phase %d allocation: %d\n",
356 phase, free);
389 printf("CarveOut free before cleanup: %d [%dMB]\n", carveoutFree
419 unsigned int free; local
451 unsigned int free; local
[all...] |
| /external/deqp/framework/platform/null/ |
| tcuNullRenderContext.cpp | 64 void free (deUint32 object) function in class:tcu::null::ObjectManager
|
| /external/freetype/src/base/ |
| ftdbgmem.c | 136 FT_Free_Func free; member in struct:FT_MemTableRec_
249 table->free( memory, block );
326 table->free = memory->free;
336 memory->free( memory, table );
670 "trying to free unknown block at %p in (%s:%ld)\n",
721 ft_mem_debug_panic( "trying to free NULL in (%s:%ld)",
840 memory->free = ft_mem_debug_free;
893 memory->free = table->free;
[all...] |
