| /netbsd/external/gpl3/gcc/dist/libphobos/testsuite/libphobos.gc/ |
| H A D | precisegc.d | 46 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()
58 roots.l = new L; in init()
72 roots.c.val = cast(size_t) cast(void*) roots.c.next; in makeFalsePointers()
73 roots.c.next = null; in makeFalsePointers()
74 roots.s.val = cast(size_t) cast(void*) roots.s.next; in makeFalsePointers()
76 roots.l.data[7] = cast(size_t) cast(void*) roots.l.node; in makeFalsePointers()
[all …]
|
| /netbsd/external/apache2/llvm/dist/libcxx/utils/ |
| H A D | graph_header_deps.py | 104 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/share/examples/refuse/id3fs/ |
| H A D | id3info.sh | 33 roots=/usr/music
56 --roots=) roots=$(echo $1 | sed -e 's|--roots=||')
73 for d in $roots; do
|
| /netbsd/external/gpl3/gcc.old/dist/libphobos/libdruntime/gcstub/ |
| H A D | gc.d | 111 __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/sys/external/bsd/drm2/dist/drm/i915/ |
| H A D | i915_buddy.c | 136 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 D | i915_buddy.h | 58 struct i915_buddy_block **roots; member
|
| /netbsd/external/gpl3/gcc/dist/libphobos/libdruntime/gc/impl/manual/ |
| H A D | gc.d | 40 __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/external/gpl3/gcc.old/dist/libphobos/libdruntime/gc/impl/manual/ |
| H A D | gc.d | 40 __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/sys/arch/atari/stand/installboot/ |
| H A D | disklabel.c | 54 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/sys/arch/atari/stand/tostools/aptck/ |
| H A D | disklbl.c | 245 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 D | aptck.h | 72 u_int *roots; /* list of auxiliary roots */ member
|
| /netbsd/crypto/external/bsd/openssl.old/dist/test/ |
| H A D | crltest.c | 238 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/crypto/external/bsd/openssl/dist/test/ |
| H A D | crltest.c | 252 STACK_OF(X509) *roots = sk_X509_new_null(); in verify()
258 || !TEST_ptr(roots)) in verify()
263 if (!TEST_true(sk_X509_push(roots, root)) in verify()
266 X509_STORE_CTX_set0_trusted_stack(ctx, roots); in verify()
281 sk_X509_pop_free(roots, X509_free); in verify()
|
| /netbsd/external/gpl3/gcc/dist/gcc/ |
| H A D | tree-vect-slp.cc | 3366 roots.create (1); in vect_analyze_slp_instance()
3371 roots, in vect_analyze_slp_instance()
3376 roots.release (); in vect_analyze_slp_instance()
3412 vect_location = bb_vinfo->roots[i].roots[0]->stmt; in vect_analyze_slp()
3415 bb_vinfo->roots[i].roots, in vect_analyze_slp()
3419 bb_vinfo->roots[i].roots = vNULL; in vect_analyze_slp()
4408 roots (vNULL) in _bb_vec_info()
4459 roots[i].roots.release (); in ~_bb_vec_info()
4461 roots.release (); in ~_bb_vec_info()
5647 std::swap(roots[0], roots[roots.length () - 1]); in vect_slp_check_for_constructors()
[all …]
|
| H A D | ira-color.c | 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()
553 for (prev = NULL, node = *roots; node != NULL; node = next) in remove_unused_allocno_hard_regs_nodes()
570 *roots = node->first; in remove_unused_allocno_hard_regs_nodes()
[all …]
|
| /netbsd/external/gpl3/binutils/dist/gprofng/src/ |
| H A D | PRBTree.cc | 75 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 D | PRBTree.h | 85 Vector<LMap*> *roots; variable
|
| /netbsd/external/apache2/llvm/dist/llvm/docs/ |
| H A D | GarbageCollection.rst | 173 * Registration of global roots with the runtime.
225 Identifying GC roots on the stack
442 int32_t NumRoots; //< Number of roots in stack frame.
452 void *Roots[0]; //< Stack roots (in-place array).
477 // For roots [NumMeta, NumRoots), the metadata pointer is null.
746 The mutator carefully maintains a linked list of stack roots.
811 * ``roots_size()``: The count of roots in the function.
836 .. _init-roots:
838 Initializing roots to null
852 For GCs which use barriers or unusual treatment of stack roots, the
[all …]
|
| H A D | Lexicon.rst | 251 .. _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 D | GitBisecting.rst | 13 LLVM repository has multiple roots: One "normal" root, and then one for each
78 Bisecting across multiple roots
|
| /netbsd/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchDag.h | 111 iterator_range<std::vector<GIMatchDagInstr *>::iterator> roots() { in roots() function
114 iterator_range<std::vector<GIMatchDagInstr *>::const_iterator> roots() const { in roots() function
|
| /netbsd/external/gpl2/groff/dist/src/preproc/eqn/ |
| H A D | TODO | 33 Extensible square roots.
|
| /netbsd/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| H A D | GICombinerEmitter.cpp | 212 iterator_range<const_root_iterator> roots() const { in roots() function in __anon185ea0950111::CombineRule
235 for (auto &I : MatchDag.roots()) { in reorientToRoots()
866 for (const auto &Root : enumerate(Rule->getMatchDag().roots())) { in run()
|
| /netbsd/external/apache2/llvm/dist/libcxx/utils/ci/ |
| H A D | run-buildbot | 31 --osx-roots <DIR> Path to pre-downloaded macOS dylibs. By default, we download
52 --osx-roots)
|
| /netbsd/external/lgpl3/mpc/dist/tests/ |
| H A D | rootofunity.dat | 29 # roots of unity of small order, some of them with exact results
|