Searched refs:memory (Results 276 - 300 of 989) sorted by relevance

<<11121314151617181920>>

/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCodeGenPGO.h21 #include <memory>
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Object/
H A DBinary.cpp29 #include <memory>
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DPassManagerBuilder.h18 #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 DDwarfFile.h20 #include <memory>
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Breakpoint/
H A DBreakpointLocation.h12 #include <memory>
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/DataFormatters/
H A DFormatClasses.h13 #include <memory>
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DVariable.h20 #include <memory>
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Expression/
H A DFunctionCaller.h13 #include <memory>
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Host/
H A DSocket.h12 #include <memory>
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Frontend/
H A DCompilerInvocation.h25 #include <memory>
H A DMultiplexConsumer.h20 #include <memory>
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/
H A DCompilationDatabase.h35 #include <memory>
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-bcanalyzer/
H A Dllvm-bcanalyzer.cpp36 #include <memory>
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/
H A DCodeRegionGenerator.cpp24 #include <memory>
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DGlobalTypeTableBuilder.h23 #include <memory>
/freebsd-11-stable/contrib/dtc/Documentation/
H A Ddtc-paper.tex69 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 Dallegro_reg.h393 * 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 Dmoduli.c36 * 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 Dgdbarch.sh703 # 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 Dasan_malloc_win.cpp177 // 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 Dunbound_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 Decofflink.c365 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 Dcurses.priv.h2181 #define MSG_NO_MEMORY "Out of memory"
/freebsd-11-stable/contrib/libreadline/
H A Dchardefs.h31 # include <memory.h>
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_drv.c210 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);

Completed in 326 milliseconds

<<11121314151617181920>>