/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CodeGenPGO.h | 21 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Object/ |
H A D | Binary.cpp | 29 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
H A D | PassManagerBuilder.h | 18 #include <memory> 224 /// generated. The idea is to reduce the size of the IR in memory.
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfFile.h | 20 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Breakpoint/ |
H A D | BreakpointLocation.h | 12 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/DataFormatters/ |
H A D | FormatClasses.h | 13 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Symbol/ |
H A D | Variable.h | 20 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Expression/ |
H A D | FunctionCaller.h | 13 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Host/ |
H A D | Socket.h | 12 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Frontend/ |
H A D | CompilerInvocation.h | 25 #include <memory>
|
H A D | MultiplexConsumer.h | 20 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/ |
H A D | CompilationDatabase.h | 35 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-bcanalyzer/ |
H A D | llvm-bcanalyzer.cpp | 36 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/ |
H A D | CodeRegionGenerator.cpp | 24 #include <memory>
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/ |
H A D | GlobalTypeTableBuilder.h | 23 #include <memory>
|
/freebsd-11-stable/contrib/dtc/Documentation/ |
H A D | dtc-paper.tex | 69 connected. During boot, before taking control of memory management, 104 even re-using OF's memory. So, when \kexec comes to boot another 148 resources, particularly RAM and flash memory space. Thus, the tree 170 \emph{off\_rsvmap} & \emph{address0} & memory reserve \\ 211 the \emph{memory reserve table}, the \emph{structure block} and the 216 The memory reserve map section gives a list of regions of memory that 279 usually implemented as a pointer or offset within OF memory.}. This 301 address}. For example \texttt{/memory@0} is the full path of a memory [all...] |
/freebsd-11-stable/sys/dev/sound/pci/ |
H A D | allegro_reg.h | 393 * DSP memory map 407 #error Assumption about code memory unit length failed. 410 #error Assumption about code memory unit length failed. 425 #error Assumption about data memory unit length failed. 428 #error Assumption about data memory unit length failed. 435 #error Code memory map length too short. 438 #error Data memory map length too short. 441 #error Code memory map length too short. 444 #error Data memory map length too short. 449 * Kernel code memory definitio [all...] |
/freebsd-11-stable/crypto/openssh/ |
H A D | moduli.c | 36 * First step: generate candidate primes (memory intensive) 91 * Using virtual memory can cause thrashing. This should be the largest 243 gen_candidates(FILE *out, u_int32_t memory, u_int32_t power, BIGNUM *start) argument 253 largememory = memory; 255 if (memory != 0 && 256 (memory < LARGE_MINIMUM || memory > LARGE_MAXIMUM)) { 257 error("Invalid memory amount (min %ld, max %ld)", 284 * Need idea of how much memory is available. We don't have to use all 288 logit("Limited memory [all...] |
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | gdbarch.sh | 703 # using the breakpoint system instead of blatting memory directly (as with rs6000). 1155 /* Helper function. Allocate memory from the \`\`struct gdbarch'' 1156 obstack. The memory is freed when the corresponding architecture 1209 gdbarch_obstack_zalloc. That memory will be deleted when the 1231 /* Register per-architecture memory region. 1233 Provide a memory-region swap mechanism. Per-architecture memory 1234 region are created. These memory regions are swapped whenever the 1235 architecture is changed. For a new architecture, the memory region 1444 /* Create an obstack for allocating all the per-architecture memory, [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/asan/ |
H A D | asan_malloc_win.cpp | 177 // We don't want memory to stand still while resizing buffers, so return 0. 204 #define OWNED_BY_RTL(heap, memory) \ 205 (!__sanitizer_get_ownership(memory) && HeapValidate(heap, 0, memory))
|
/freebsd-11-stable/contrib/unbound/contrib/ |
H A D | unbound_munin_ | 41 # unbound_munin_memory - memory usage 83 unbound_munin_memory - memory usage 190 echo "memory" 266 memory) 267 echo "graph_title Unbound memory usage" 269 echo "graph_vlabel memory used in bytes" 271 p_config "mem.cache.rrset" "RRset cache memory" "GAUGE" 272 p_config "mem.cache.message" "Message cache memory" "GAUGE" 273 p_config "mem.mod.iterator" "Iterator module memory" "GAUGE" 274 p_config "mem.mod.validator" "Validator module and key cache memory" "GAUG [all...] |
/freebsd-11-stable/contrib/binutils/bfd/ |
H A D | ecofflink.c | 365 PTR memory; 402 struct objalloc *memory; 434 n = (struct shuffle *) objalloc_alloc (ainfo->memory, 456 /* Add a memory entry to a shuffle list. */ 472 n = (struct shuffle *) objalloc_alloc (ainfo->memory, 482 n->u.memory = (PTR) data; 542 ainfo->memory = objalloc_create (); 543 if (ainfo->memory == NULL) 569 objalloc_free (ainfo->memory); 674 rfd_out = (bfd_byte *) objalloc_alloc (ainfo->memory, s 362 PTR memory; member in union:shuffle::__anon190 399 struct objalloc *memory; member in struct:accumulate [all...] |
/freebsd-11-stable/contrib/ncurses/ncurses/ |
H A D | curses.priv.h | 2181 #define MSG_NO_MEMORY "Out of memory"
|
/freebsd-11-stable/contrib/libreadline/ |
H A D | chardefs.h | 31 # include <memory.h>
|
/freebsd-11-stable/sys/dev/drm2/ |
H A D | drm_drv.c | 210 list_for_each_entry_safe(entry, tempe, &dev->agp->memory, head) { 212 drm_unbind_agp(entry->memory); 213 drm_free_agp(entry->memory, entry->pages); 216 INIT_LIST_HEAD(&dev->agp->memory);
|