| /src/external/gpl3/gcc/dist/libsanitizer/tsan/ |
| tsan_mman.h | 50 // Invoking malloc/free hooks that may be installed by the user. 64 void Free(T *&p) { 76 Free(p);
|
| tsan_dense_alloc.h | 14 // allocates/free indices of objects and provide a functionality to map 74 void Free(Cache *c, IndexT idx) { 112 // The freelist is organized as a lock-free stack of batches of nodes.
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/ |
| tsan_mman.h | 46 // Invoking malloc/free hooks that may be installed by the user. 60 void Free(T *&p) { 72 Free(p);
|
| tsan_dense_alloc.h | 14 // allocates/free indices of objects and provide a functionality to map 74 void Free(Cache *c, IndexT idx) {
|
| /src/external/gpl3/gcc/dist/libgcc/config/avr/libf7/ |
| f7-wraps.h | 1 ;; Copyright (C) 2019-2024 Free Software Foundation, Inc. 5 ;; GCC is free software; you can redistribute it and/or modify it under 6 ;; the terms of the GNU General Public License as published by the Free 17 ;; 3.1, as published by the Free Software Foundation.
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_dlsym.h | 50 static void Free(void *ptr) { 61 Free(ptr); 69 Free(ptr);
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/avr/libf7/ |
| f7-wraps.h | 1 ;; Copyright (C) 2019-2022 Free Software Foundation, Inc. 5 ;; GCC is free software; you can redistribute it and/or modify it under 6 ;; the terms of the GNU General Public License as published by the Free 17 ;; 3.1, as published by the Free Software Foundation.
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_dlsym.h | 50 static void Free(void *ptr) { 61 Free(ptr); 69 Free(ptr);
|
| /src/sys/arch/amiga/stand/bootblock/boot/ |
| amigatypes.h | 60 u_int32_t First, Lower, Upper, Free;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/ |
| tsan_dense_alloc.h | 15 // allocates/free indices of objects and provide a functionality to map 68 void Free(Cache *c, IndexT idx) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/ |
| SectionMemoryManager.h | 154 // The actual block of free memory 155 sys::MemoryBlock Free;
|
| /src/sbin/routed/ |
| radix.h | 142 #define Free(p) free((void *)p);
|
| /src/sys/net/ |
| radix.h | 131 #define Free(p) free(p, M_RTABLE);
|
| /src/crypto/external/bsd/openssl.old/dist/test/ossl_shim/ |
| ossl_shim.cc | 142 struct Free { 144 free(buf);
|
| /src/lib/libc/isc/ |
| eventlib_p.h | 51 #define OKFREE(x, y) if ((x) < 0) { FREE((y)); EV_ERR(errno); } \ 63 #define FREE(p) memput((p), sizeof *(p)) 169 enum { Accept, File, Stream, Timer, Wait, Free, Null } type; 176 struct { struct evEvent_p *next; } free; member in union:evEvent_p::__anon367
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyLowerEmscriptenEHSjLj.cpp | 511 // The reason we include malloc/free here is to exclude the malloc/free 513 if (CalleeName == "setjmp" || CalleeName == "malloc" || CalleeName == "free") 1137 // Free setjmpTable buffer before each return instruction 1142 auto *Free = CallInst::CreateFree(SetjmpTable, TI); 1143 Free->setDebugLoc(DL); 1146 if (auto *FreeCallI = dyn_cast<CallInst>(Free)) {
|
| /src/external/bsd/libbind/dist/isc/ |
| eventlib_p.h | 51 #define OKFREE(x, y) if ((x) < 0) { FREE((y)); EV_ERR(errno); } \ 63 #define FREE(p) memput((p), sizeof *(p)) 169 enum { Accept, File, Stream, Timer, Wait, Free, Null } type; 176 struct { struct evEvent_p *next; } free; member in union:evEvent_p::__anon7181
|
| /src/sys/arch/prep/include/ |
| residual.h | 277 Free = 0x10, /* Free part of System Memory */
|
| /src/external/bsd/openldap/dist/contrib/slapd-modules/comp_match/ |
| componentlib.h | 403 FreeFcn Free; 431 void InstallAnyByComponentInt (int anyId, ComponentInt intId, unsigned int size, EncodeFcn encode, gser_decoder_func* G_decode, ber_tag_decoder_func B_decode, ExtractFcn extract, MatchFcn match, FreeFcn free, PrintFcn print); 433 void InstallAnyByComponentOid (int anyId, AsnOid *oid, unsigned int size, EncodeFcn encode, gser_decoder_func* G_decode, ber_tag_decoder_func* B_decode, ExtractFcn extract, MatchFcn match, FreeFcn free, PrintFcn print);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| InlineCost.cpp | 1025 /// Use TTI to check whether a GEP is free. 1225 // Constant GEPs are modeled as free. 1762 // SROA can't look through these, but they may be free. 1775 // SROA can't look through these, but they may be free. 1784 /// free. 1862 // SROA can usually chew through these intrinsics, but they aren't free. 1896 // At least one return instruction will be free after inlining. 1897 bool Free = !HasReturn; 1899 return Free; 1903 // We model unconditional branches as essentially free -- they reall [all...] |