/external/deqp/external/vulkancts/framework/vulkan/ |
vkAllocationCallbackUtil.hpp | 48 virtual void free (void* mem) = 0; 96 } free; member in union:vk::AllocationCallbackRecord::__anon17580 111 static AllocationCallbackRecord free (void* mem); 124 void free (void* mem); 141 void free (void* mem);
|
/external/e2fsprogs/lib/ext2fs/ |
qcow2.h | 73 __u32 free; member in struct:ext2_qcow2_l2_cache
|
/external/jemalloc/include/jemalloc/ |
jemalloc_mangle.h | 19 # define free je_free macro
|
jemalloc_mangle_jet.h | 19 # define free jet_free macro
|
/external/libchrome/base/metrics/ |
persistent_memory_allocator.h | 123 // Like the allocator itself, iterators are lock-free and thread-secure. 234 size_t free; member in struct:base::PersistentMemoryAllocator::MemoryInfo 467 // Get the information about the amount of free space in the allocator. The 468 // amount of free space should be treated as approximate due to extras from 491 // While the above works much like malloc & free, these next methods provide [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/ |
nouveau_mm.c | 28 struct list_head free; member in struct:mm_bucket 48 int free; member in struct:mm_slab 57 if (slab->free == 0) 65 slab->free--; 78 slab->free++; 79 assert(slab->free <= slab->count); 141 FREE(slab); 149 slab->count = slab->free = size >> chunk_order; 151 LIST_ADD(&slab->head, &mm_bucket_by_order(cache, chunk_order)->free); 187 if (LIST_IS_EMPTY(&bucket->free)) { [all...] |
/external/oj-libjdwp/src/share/javavm/export/ |
jdwpTransport.h | 5 * This code is free software; you can redistribute it and/or modify it 7 * published by the Free Software Foundation. Oracle designates this 18 * 2 along with this work; if not, write to the Free Software Foundation, 137 void (*free)(void *buffer); /* Call this for all deallocations */ member in struct:jdwpTransportCallback
|
/external/perf_data_converter/src/ |
perf_data_converter_test.cc | 134 std::unique_ptr<char, decltype(std::free)*> cwd(getcwd(nullptr, 0), 135 std::free); member in class:perftools::std
|
/external/protobuf/js/binary/ |
decoder.js | 142 jspb.BinaryIterator.prototype.free = function() { method in class:jspb.BinaryIterator 155 this.decoder_.free(); 306 jspb.BinaryDecoder.prototype.free = function() { method in class:jspb.BinaryDecoder
|
/external/python/cpython3/Include/ |
objimpl.h | 18 Because the Python implementation is free to change internal details, and 23 malloc/realloc/ calloc/free, or with calls to PyMem_. 74 /* Functions to call the same malloc/realloc/free as used by Python's 76 the platform malloc/realloc/free. The Python object allocator is 83 PyObject_Realloc(p != NULL, 0) does not return NULL, or free the memory 91 possible. The PyObject_{Malloc, Realloc, Free} family is exposed 214 /* free an arena */ 215 void (*free) (void *ctx, void *ptr, size_t size); member in struct:__anon33164
|
/external/skia/src/core/ |
SkDescriptor.h | 144 ~SkAutoDescriptor() { this->free(); } 147 this->free(); 157 void free() { function in class:SkAutoDescriptor
|
SkTLList.h | 43 // Having fCount initialized to -1 indicates that the first time we attempt to grab a free node 44 // all the nodes in the pre-allocated first block need to be inserted into the free list. This 268 // Don't ever elease the first block, just add its nodes to the free list 288 // We should not yet have initialized the free list. 292 // Should only have the nodes from the first block in the free list. 304 // Only the first block is allowed to have all its nodes in the free list. 310 bool free = fFreeList.isInList(block->fNodes + i); local 312 SkASSERT(free != active); 314 freeCnt += free; 331 bool free = fFreeList.isInList(block->fNodes + i) local [all...] |
/external/skia/src/gpu/vk/ |
GrVkMemory.cpp | 123 SkASSERT_RELEASE(heap->free(*alloc)); 134 SkASSERT_RELEASE(heap->free(alloc)); 217 SkASSERT_RELEASE(heap->free(*alloc)); 239 if (!heap->free(alloc)) { 436 SkDebugf("Can't allocate %d bytes, %d bytes available, largest free block %d\n", alignedSize, fFreeSize, fLargestBlockSize); 441 void GrVkFreeListAlloc::free(VkDeviceSize allocOffset, VkDeviceSize allocSize) { function in class:GrVkFreeListAlloc 545 void GrVkSubHeap::free(const GrVkAlloc& alloc) { function in class:GrVkSubHeap 548 INHERITED::free(alloc.fOffset, alloc.fSize); 664 bool GrVkHeap::free(const GrVkAlloc& alloc) { function in class:GrVkHeap 674 fSubHeaps[i]->free(alloc) [all...] |
/external/skqp/src/core/ |
SkDescriptor.h | 144 ~SkAutoDescriptor() { this->free(); } 147 this->free(); 157 void free() { function in class:SkAutoDescriptor
|
SkTLList.h | 43 // Having fCount initialized to -1 indicates that the first time we attempt to grab a free node 44 // all the nodes in the pre-allocated first block need to be inserted into the free list. This 268 // Don't ever elease the first block, just add its nodes to the free list 288 // We should not yet have initialized the free list. 292 // Should only have the nodes from the first block in the free list. 304 // Only the first block is allowed to have all its nodes in the free list. 310 bool free = fFreeList.isInList(block->fNodes + i); local 312 SkASSERT(free != active); 314 freeCnt += free; 331 bool free = fFreeList.isInList(block->fNodes + i) local [all...] |
/external/skqp/src/gpu/vk/ |
GrVkMemory.cpp | 123 SkASSERT_RELEASE(heap->free(*alloc)); 134 SkASSERT_RELEASE(heap->free(alloc)); 217 SkASSERT_RELEASE(heap->free(*alloc)); 239 if (!heap->free(alloc)) { 436 SkDebugf("Can't allocate %d bytes, %d bytes available, largest free block %d\n", alignedSize, fFreeSize, fLargestBlockSize); 441 void GrVkFreeListAlloc::free(VkDeviceSize allocOffset, VkDeviceSize allocSize) { function in class:GrVkFreeListAlloc 545 void GrVkSubHeap::free(const GrVkAlloc& alloc) { function in class:GrVkSubHeap 548 INHERITED::free(alloc.fOffset, alloc.fSize); 664 bool GrVkHeap::free(const GrVkAlloc& alloc) { function in class:GrVkHeap 674 fSubHeaps[i]->free(alloc) [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
FileSystem.h | 86 uint64_t free; member in struct:llvm::sys::fs::space_info
|
/external/syslinux/com32/gplinclude/zzjson/ |
zzjson.h | 30 /* needed by: pa = parser, pr = printer, f = free, q = query, c = create */ 38 void (*free)(void *ptr); // pa f c member in struct:ZZJSON_CONFIG
|
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
BaseTween.java | 126 public void free() { method in class:BaseTween 322 * want to call {@link free()} to reuse the object later.
|
/external/v8/src/crankshaft/ia32/ |
lithium-gap-resolver-ia32.cc | 31 // registers free for the whole algorithm. 233 // 2. We may have a free register that we can use without spilling. 234 Register free = GetFreeRegisterNot(no_reg); local 235 if (!free.is(no_reg)) return free; 375 // Register-memory. Use a free register as a temp if possible. Do not 395 // free register after that, use it as a second temporary.
|
/external/v8/src/crankshaft/x87/ |
lithium-gap-resolver-x87.cc | 32 // registers free for the whole algorithm. 234 // 2. We may have a free register that we can use without spilling. 235 Register free = GetFreeRegisterNot(no_reg); local 236 if (!free.is(no_reg)) return free; 378 // Register-memory. Use a free register as a temp if possible. Do not 398 // free register after that, use it as a second temporary.
|
/external/wayland/tests/ |
test-runner.c | 4 * Permission is hereby granted, free of charge, to any person obtaining 76 free(void* mem) function 351 /* Load system malloc, free, and realloc */ 355 sys_free = dlsym(RTLD_NEXT, "free");
|
/external/wpa_supplicant_8/src/utils/ |
os.h | 325 * os_free - Free dynamic memory 491 #define os_free(p) free((p)) 642 #define free OS_DO_NOT_USE_free macro
|
/frameworks/av/media/ndk/ |
NdkImage.cpp | 76 AImage::free() { function in class:AImage 78 ALOGE("Cannot free AImage before close!"); 628 image->free();
|
/hardware/libhardware/include/hardware/ |
gralloc.h | 180 * This function doesn't close or free the handle itself; this is done 347 * (*free)() Frees a previously allocated buffer. 356 int (*free)(struct alloc_device_t* dev, member in struct:alloc_device_t
|