Home
last modified time | relevance | path

Searched refs:roots (Results 1 – 25 of 137) sorted by relevance

123456

/netbsd-src/external/gpl3/gcc/dist/libphobos/testsuite/libphobos.gc/
H A Dprecisegc.d46 Roots* roots; variable
51 roots = new Roots; in init()
52 roots.c = new C; in init()
53 roots.c.next = new C; in init()
55 roots.s = new S; in init()
56 roots.s.next = new S; in init()
58 roots.l = new L; in init()
59 roots.l.node = new S; in init()
72 roots.c.val = cast(size_t) cast(void*) roots.c.next; in makeFalsePointers()
73 roots.c.next = null; in makeFalsePointers()
[all …]
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/
H A Dgraph_header_deps.py104 def build_graph(roots, options): argument
105 original_roots = list(roots)
107 while roots:
108 frontier = roots
109 roots = []
114 roots += graph[fname].includes
182 roots = list_all_roots_under(options.root) variable
184 roots = [options.root] variable
188 graph = build_graph(roots, options)
/netbsd-src/share/examples/refuse/id3fs/
H A Did3info.sh33 roots=/usr/music
56 --roots=) roots=$(echo $1 | sed -e 's|--roots=||')
73 for d in $roots; do
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/libdruntime/gcstub/
H A Dgc.d111 __gshared void** roots = null; variable
135 free( roots ); in gc_term()
286 void** r = cast(void**) realloc( roots, in gc_addRoot()
287 (nroots+1) * roots[0].sizeof ); in gc_addRoot()
291 roots = r; in gc_addRoot()
322 if ( roots[i] is p ) in gc_removeRoot()
324 roots[i] = roots[--nroots]; in gc_removeRoot()
375 foreach ( r; roots[0 .. nroots] ) in export()
385 foreach ( r; roots[0 .. nroots] ) in export()
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/internal/gc/impl/proto/
H A Dgc.d33 Array!Root roots;
49 foreach (ref r; roots) in transferRangesAndRoots()
171 roots.insertBack(Root(p)); in addRoot()
176 foreach (ref r; roots) in removeRoot()
180 r = roots.back; in removeRoot()
181 roots.popBack(); in removeRoot()
194 foreach (ref r; roots)
/netbsd-src/sys/external/bsd/drm2/dist/drm/i915/
H A Di915_buddy.c136 mm->roots = kmalloc_array(mm->n_roots, in i915_buddy_init()
139 if (!mm->roots) in i915_buddy_init()
166 mm->roots[i] = root; in i915_buddy_init()
177 i915_block_free(mm->roots[i]); in i915_buddy_init()
178 kfree(mm->roots); in i915_buddy_init()
189 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); in i915_buddy_fini()
190 i915_block_free(mm->roots[i]); in i915_buddy_fini()
193 kfree(mm->roots); in i915_buddy_fini()
371 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in i915_buddy_alloc_range()
H A Di915_buddy.h58 struct i915_buddy_block **roots; member
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/internal/gc/impl/manual/
H A Dgc.d51 Array!Root roots;
190 roots.insertBack(Root(p)); in addRoot()
195 foreach (ref r; roots) in removeRoot()
199 r = roots.back; in removeRoot()
200 roots.popBack(); in removeRoot()
214 foreach (ref r; roots)
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/libdruntime/gc/impl/manual/
H A Dgc.d40 __gshared Array!Root roots;
200 roots.insertBack(Root(p)); in addRoot()
205 foreach (ref r; roots) in removeRoot()
209 r = roots.back; in removeRoot()
210 roots.popBack(); in removeRoot()
224 foreach (ref r; roots)
/netbsd-src/sys/arch/atari/stand/installboot/
H A Ddisklabel.c54 daddr_t *roots; member
153 daddr_t aux = al.roots[j]; in ahdi_label()
222 alab->roots = realloc(alab->roots, in ahdi_getparts()
223 (alab->nroots + 1) * sizeof(*alab->roots)); in ahdi_getparts()
224 alab->roots[alab->nroots++] = aux; in ahdi_getparts()
/netbsd-src/sys/arch/atari/stand/tostools/aptck/
H A Ddisklbl.c245 qsort(dd->roots, dd->nroots, sizeof *dd->roots, root_cmp); in ahdi_display()
258 u_int aux = dd->roots[j]; in ahdi_display()
326 dd->roots = xrealloc(dd->roots, i * sizeof *dd->roots);
327 dd->roots[--i] = offs;
H A Daptck.h72 u_int *roots; /* list of auxiliary roots */ member
/netbsd-src/crypto/external/bsd/openssl.old/dist/test/
H A Dcrltest.c238 STACK_OF(X509) *roots = sk_X509_new_null(); in verify()
244 || !TEST_ptr(roots)) in verify()
249 if (!TEST_true(sk_X509_push(roots, root)) in verify()
252 X509_STORE_CTX_set0_trusted_stack(ctx, roots); in verify()
267 sk_X509_pop_free(roots, X509_free); in verify()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-vect-slp.cc3383 vec<stmt_vec_info> roots = vNULL; in vect_analyze_slp_instance() local
3386 roots.create (1); in vect_analyze_slp_instance()
3387 roots.quick_push (stmt_info); in vect_analyze_slp_instance()
3391 roots, in vect_analyze_slp_instance()
3396 roots.release (); in vect_analyze_slp_instance()
3430 for (unsigned i = 0; i < bb_vinfo->roots.length (); ++i) in vect_analyze_slp()
3432 vect_location = bb_vinfo->roots[i].roots[0]->stmt; in vect_analyze_slp()
3434 for (unsigned j = 0; j < bb_vinfo->roots[i].stmts.length (); ++j) in vect_analyze_slp()
3435 bb_vinfo->roots[i].stmts[j] in vect_analyze_slp()
3436 = vect_stmt_to_vectorize (bb_vinfo->roots[i].stmts[j]); in vect_analyze_slp()
[all …]
/netbsd-src/external/gpl3/binutils/dist/gprofng/src/
H A DPRBTree.cc75 roots = new Vector<LMap*>; in PRBTree()
93 delete roots; in ~PRBTree()
204 roots->append (root); in rb_fix_chld()
337 lm = roots->fetch (rt); in rb_locate()
H A DPRBTree.h85 Vector<LMap*> *roots; variable
/netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/
H A DPRBTree.cc75 roots = new Vector<LMap*>; in PRBTree()
93 delete roots; in ~PRBTree()
204 roots->append (root); in rb_fix_chld()
337 lm = roots->fetch (rt); in rb_locate()
H A DPRBTree.h85 Vector<LMap*> *roots; variable
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DGarbageCollection.rst59 You will need to identify roots (i.e. references to heap objects your collector
173 * Registration of global roots with the runtime.
225 Identifying GC roots on the stack
406 stack maps, this algorithm carefully maintains a linked list of stack roots
430 roots, and for this it needs to integrate with the shadow stack. Luckily, doing
442 int32_t NumRoots; //< Number of roots in stack frame.
452 void *Roots[0]; //< Stack roots (in-place array).
473 // For roots [0, NumMeta), the metadata pointer is in the FrameMap.
477 // For roots [NumMeta, NumRoots), the metadata pointer is null.
691 | roots | | | | | | | | |
[all …]
H A DLexicon.rst251 .. _stack roots:
268 In garbage collection, it is necessary to identify `stack roots`_ so that
273 pointers`_ must be reloaded from stack roots.
304 identifies `roots`_ within the stack frame of an executing function.
H A DGitBisecting.rst13 LLVM repository has multiple roots: One "normal" root, and then one for each
78 Bisecting across multiple roots
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.h111 iterator_range<std::vector<GIMatchDagInstr *>::iterator> roots() { in roots() function
114 iterator_range<std::vector<GIMatchDagInstr *>::const_iterator> roots() const { in roots() function
/netbsd-src/external/gpl2/groff/dist/src/preproc/eqn/
H A DTODO33 Extensible square roots.
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp212 iterator_range<const_root_iterator> roots() const { in roots() function in __anon31f3a7ff0111::CombineRule
235 for (auto &I : MatchDag.roots()) { in reorientToRoots()
866 for (const auto &Root : enumerate(Rule->getMatchDag().roots())) { in run()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dira-color.c352 add_new_allocno_hard_regs_node_to_forest (allocno_hard_regs_node_t *roots, in add_new_allocno_hard_regs_node_to_forest() argument
355 new_node->next = *roots; in add_new_allocno_hard_regs_node_to_forest()
359 *roots = new_node; in add_new_allocno_hard_regs_node_to_forest()
365 add_allocno_hard_regs_to_forest (allocno_hard_regs_node_t *roots, in add_allocno_hard_regs_to_forest() argument
374 for (node = *roots; node != NULL; node = node->next) in add_allocno_hard_regs_to_forest()
413 *roots = node->next; in add_allocno_hard_regs_to_forest()
426 add_new_allocno_hard_regs_node_to_forest (roots, new_node); in add_allocno_hard_regs_to_forest()
513 print_hard_regs_subforest (FILE *f, allocno_hard_regs_node_t roots, in print_hard_regs_subforest() argument
519 for (node = roots; node != NULL; node = node->next) in print_hard_regs_subforest()
549 remove_unused_allocno_hard_regs_nodes (allocno_hard_regs_node_t *roots) in remove_unused_allocno_hard_regs_nodes() argument
[all …]

123456