| /external/lzma/CPP/Windows/ |
| COM.h | 34 ~CStgMedium() { Free(); }
35 void Free()
|
| DLL.h | 17 /* Win32: Don't call CLibrary::Free() and FreeLibrary() from another
28 ~CLibrary() { Free(); }
36 Free();
46 bool Free() throw();
|
| Shell.h | 27 ~CItemIDList() { Free(); }
28 void Free();
31 Free();
57 void Free();
60 ~CDrop() { Free(); }
|
| DLL.cpp | 16 bool CLibrary::Free() throw()
28 if (!Free())
45 if (!Free())
|
| /external/perfetto/src/tracing/core/ |
| id_allocator_unittest.cc | 43 id_allocator.Free(42);
49 id_allocator.Free(1);
50 id_allocator.Free(kMaxId);
59 id_allocator.Free(kMaxId - i);
71 id_allocator.Free(0xff);
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Core/Dxe/Mem/ |
| Pool.c | 309 POOL_FREE *Free;
363 // If there's no free pool in the proper list size, go get some more pages
375 Free = CR (Pool->FreeList[Index].ForwardLink, POOL_FREE, Link, POOL_FREE_SIGNATURE);
376 RemoveEntryList (&Free->Link);
377 NewPage = (VOID *) Free;
398 // Carve up remaining space into free pool blocks
406 Free = (POOL_FREE *) &NewPage[Offset];
407 Free->Signature = POOL_FREE_SIGNATURE;
408 Free->Index = (UINT32)Index;
409 InsertHeadList (&Pool->FreeList[Index], &Free->Link);
[all...] |
| /external/libchrome/base/files/ |
| scoped_file.cc | 24 void ScopedFDCloseTraits::Free(int fd) {
|
| scoped_file.h | 26 static void Free(int fd);
|
| /external/tensorflow/tensorflow/core/platform/ |
| mem.h | 34 void Free(void* ptr);
36 // Tries to release num_bytes of free memory back to the operating
|
| /external/lzma/CPP/7zip/Common/ |
| CWrappers.h | 62 ~CByteInBufWrap() { Free(); }
63 void Free() throw();
94 ~CByteOutBufWrap() { Free(); }
95 void Free() throw();
|
| InBuffer.h | 85 ~CInBuffer() { Free(); }
87 void Free() throw();
|
| OutBuffer.h | 37 ~COutBuffer() { Free(); }
40 void Free() throw();
|
| /system/core/libmemunreachable/tests/ |
| MemUnreachable_test.cpp | 36 ~HiddenPointer() { Free(); }
38 void Free() {
39 free(Get());
112 hidden_ptr.Free();
145 hidden_ptr.Free();
178 hidden_ptr.Free();
219 hidden_ptr.Free();
234 hidden_ptr.Free();
|
| /external/lzma/CPP/7zip/Archive/7z/ |
| 7zIn.h | 95 PackPositions.Free();
100 NumUnpackStreamsVector.Free();
101 CoderUnpackSizes.Free();
102 FoToCoderUnpackSizes.Free();
103 FoStartPackStreamIndex.Free();
104 FoToMainUnpackSizeIndex.Free();
105 FoCodersDataOffset.Free();
106 CodersData.Free();
131 SecureBuf.Free();
141 NamesBuf.Free();
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| heap_simulator_test.cc | 37 const char kFree[] = "Free";
40 // CallSequence records a sequence of Alloc/Free/Finish calls.
57 void Free(const LogicalBuffer* buffer, int64 size) override {
83 // Since we're only tracking the sequence of Alloc/Free calls, the actual
118 // order. The Free calls are sorted by LogicalBuffer.id, which is at least
139 // Ensures the expected sequence of Alloc/Free/Finish calls was performed.
475 // The order of the remaining Free calls is based on the LogicalBuffer.id,
546 heap.Free(buffer_a_, 10);
547 heap.Free(buffer_b_, 20);
548 heap.Free(buffer_c_, 30)
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/pdp11/ |
| absreloc.s | 2 # Copyright (C) 2011-2016 Free Software Foundation, Inc.
4 # This file is free software; you can redistribute it and/or modify
6 # the Free Software Foundation; either version 3 of the License, or
15 # along with this program; if not, write to the Free Software
|
| /external/lzma/C/ |
| 7zBuf.c | 33 alloc->Free(alloc, p->data);
|
| 7zBuf2.c | 34 alloc->Free(alloc, p->data);
47 alloc->Free(alloc, p->data);
|
| /art/libartbase/base/ |
| allocator.cc | 37 void Free(void* p) {
38 free(p);
57 void Free(void* p ATTRIBUTE_UNUSED) {
|
| /external/llvm/lib/ExecutionEngine/ |
| SectionMemoryManager.cpp | 50 // Look in the list of free memory regions and use a block there if one
53 if (FreeMB.Free.size() >= RequiredSize) {
54 Addr = (uintptr_t)FreeMB.Free.base();
55 uintptr_t EndOfBlock = Addr + FreeMB.Free.size();
71 // Remember how much free space is now left in this block
72 FreeMB.Free = sys::MemoryBlock((void *)(Addr + Size), EndOfBlock - Addr - Size);
77 // No pre-allocated free block was large enough. Allocate a new memory region.
112 // this case, we store the unused memory as a free memory block.
116 FreeMB.Free = sys::MemoryBlock((void*)(Addr + Size), FreeSize);
189 // Now go through free blocks and trim any of them that don't span the entir
[all...] |
| /external/v8/src/regexp/ |
| regexp-stack.cc | 31 thread_local_.Free();
58 void RegExpStack::ThreadLocal::Free() {
|
| regexp-stack.h | 72 void FreeThreadResources() { thread_local_.Free(); }
99 void Free();
|
| /external/valgrind/drd/tests/ |
| tc15_laog_lockdel.stderr.exp | 4 Free 2 and re-allocate it. This gives it a new identity,
|
| /external/lzma/CPP/Common/ |
| MyBuffer.h | 14 void Free()
47 Free();
60 Free();
136 void Free()
171 void Free()
228 Free();
|
| /external/v8/src/heap/ |
| array-buffer-tracker.cc | 17 void LocalArrayBufferTracker::Free() {
24 heap_->isolate()->array_buffer_allocator()->Free(buffer->backing_store(),
64 heap_->isolate()->array_buffer_allocator()->Free(
93 tracker->Free<LocalArrayBufferTracker::kFreeDead>();
102 tracker->Free<LocalArrayBufferTracker::kFreeAll>();
|
