| /src/external/gpl3/gcc.old/dist/libphobos/testsuite/libphobos.gc/ |
| precisegc.d | 39 struct Roots
46 Roots* roots;
51 roots = new Roots;
52 roots.c = new C;
53 roots.c.next = new C;
55 roots.s = new S;
56 roots.s.next = new S;
58 roots.l = new L
[all...] |
| /src/share/examples/refuse/id3fs/ |
| id3info.sh | 33 roots=/usr/music
56 --roots=) roots=$(echo $1 | sed -e 's|--roots=||')
73 for d in $roots; do
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/gc/impl/proto/ |
| gc.d | 33 Array!Root roots;
48 // Transfer all roots
49 foreach (ref r; roots)
171 roots.insertBack(Root(p));
176 foreach (ref r; roots)
180 r = roots.back;
181 roots.popBack();
194 foreach (ref r; roots)
|
| /src/sys/external/bsd/drm2/dist/drm/i915/ |
| i915_buddy.c | 136 mm->roots = kmalloc_array(mm->n_roots,
139 if (!mm->roots)
166 mm->roots[i] = root;
177 i915_block_free(mm->roots[i]);
178 kfree(mm->roots);
189 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i]));
190 i915_block_free(mm->roots[i]);
193 kfree(mm->roots);
371 list_add_tail(&mm->roots[i]->tmp_link, &dfs);
|
| i915_buddy.h | 58 struct i915_buddy_block **roots; member in struct:i915_buddy_mm
|
| /src/external/apache2/llvm/dist/libcxx/utils/ |
| graph_header_deps.py | 104 def build_graph(roots, options):
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)
184 roots = [options.root]
188 graph = build_graph(roots, options)
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/gc/impl/manual/ |
| gc.d | 51 Array!Root roots;
190 roots.insertBack(Root(p));
195 foreach (ref r; roots)
199 r = roots.back;
200 roots.popBack();
214 foreach (ref r; roots)
|
| /src/sys/arch/atari/stand/installboot/ |
| disklabel.c | 51 daddr_t *roots; member in struct:ahdilabel
150 daddr_t aux = al.roots[j];
219 alab->roots = realloc(alab->roots,
220 (alab->nroots + 1) * sizeof(*alab->roots));
221 alab->roots[alab->nroots++] = aux;
|
| /src/sys/arch/atari/stand/tostools/aptck/ |
| disklbl.c | 242 qsort(dd->roots, dd->nroots, sizeof *dd->roots, root_cmp);
255 u_int aux = dd->roots[j];
282 printf("\nTotal number of auxiliary roots: %u\n", dd->nroots);
323 dd->roots = xrealloc(dd->roots, i * sizeof *dd->roots);
324 dd->roots[--i] = offs;
|
| aptck.h | 69 u_int *roots; /* list of auxiliary roots */ member in struct:__anon1223
|
| diskio.c | 80 free(dd->roots);
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/gcstub/ |
| gc.d | 111 __gshared void** roots = null;
135 free( roots );
286 void** r = cast(void**) realloc( roots,
287 (nroots+1) * roots[0].sizeof );
291 roots = r;
322 if ( roots[i] is p )
324 roots[i] = roots[--nroots];
375 foreach ( r; roots[0 .. nroots] )
385 foreach ( r; roots[0 .. nroots]
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| PRBTree.h | 85 Vector<LMap*> *roots; member in class:PRBTree
|
| PRBTree.cc | 75 roots = new Vector<LMap*>;
93 delete roots;
204 roots->append (root);
337 lm = roots->fetch (rt);
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| PRBTree.h | 85 Vector<LMap*> *roots; member in class:PRBTree
|
| PRBTree.cc | 75 roots = new Vector<LMap*>;
93 delete roots;
204 roots->append (root);
337 lm = roots->fetch (rt);
|
| /src/external/bsd/zstd/dist/build/single_file_libs/ |
| combine.py | 24 # Set of file roots when searching (equivalent to -I paths for the compiler).
25 roots: Set[Path] = set()
114 for root in roots:
217 # Resolve all of the root paths upfront (we'll halt here on invalid roots)
220 roots.add(path.resolve(strict=True))
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| GIMatchDag.h | 111 iterator_range<std::vector<GIMatchDagInstr *>::iterator> roots() { function in class:llvm::GIMatchDag
114 iterator_range<std::vector<GIMatchDagInstr *>::const_iterator> roots() const { function in class:llvm::GIMatchDag
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-vect-slp.cc | 3386 vec<stmt_vec_info> roots = vNULL; local
3389 roots.create (1);
3390 roots.quick_push (stmt_info);
3394 roots,
3399 roots.release ();
3433 for (unsigned i = 0; i < bb_vinfo->roots.length (); ++i)
3435 vect_location = bb_vinfo->roots[i].roots[0]->stmt;
3437 for (unsigned j = 0; j < bb_vinfo->roots[i].stmts.length (); ++j)
3438 bb_vinfo->roots[i].stmts[j
5049 hash_set<stmt_vec_info> roots; local
5057 vect_slp_prune_covered_roots (SLP_INSTANCE_TREE (instance), roots, local
5670 vec<stmt_vec_info> roots = vNULL; local
5793 vec<stmt_vec_info> roots; local
[all...] |
| ira-color.cc | 330 /* Roots of the forest containing hard register sets can be assigned
357 given by ROOTS. */
359 add_new_allocno_hard_regs_node_to_forest (allocno_hard_regs_node_t *roots,
362 new_node->next = *roots;
366 *roots = new_node;
370 not possible) to the forest on its level given by ROOTS. */
372 add_allocno_hard_regs_to_forest (allocno_hard_regs_node_t *roots,
381 for (node = *roots; node != NULL; node = node->next)
420 *roots = node->next;
433 add_new_allocno_hard_regs_node_to_forest (roots, new_node)
[all...] |
| tree-vectorizer.h | 966 : kind(kind_), stmts(stmts_), roots(roots_) {}
969 vec<stmt_vec_info> roots; member in struct:slp_root
984 vec<slp_root> roots; member in class:_bb_vec_info
|
| /src/external/apache2/llvm/dist/libcxx/utils/ci/ |
| run-buildbot | 31 --osx-roots <DIR> Path to pre-downloaded macOS dylibs. By default, we download
52 --osx-roots)
364 PREVIOUS_DYLIBS_URL="https://dl.dropboxusercontent.com/s/liu4fmc53qzlfly/libcxx-roots.tar.gz"
365 OSX_ROOTS="${BUILD_DIR}/macos-roots"
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUUnifyDivergentExitNodes.cpp | 247 for (BasicBlock *BB : PDT.roots()) {
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| GICombinerEmitter.cpp | 144 /// The roots of a match. These are the leaves of the DAG that are closest to
148 std::vector<RootInfo> Roots;
204 size_t getNumRoots() const { return Roots.size(); }
210 const_root_iterator roots_begin() const { return Roots.begin(); }
211 const_root_iterator roots_end() const { return Roots.end(); }
212 iterator_range<const_root_iterator> roots() const { function in class:__anon3489::CombineRule
213 return llvm::make_range(Roots.begin(), Roots.end());
226 /// The matcher will begin from the roots and will perform the match by
231 SmallSet<const GIMatchDagInstr *, 5> Roots;
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| GenericDomTree.h | 249 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
266 : Roots(std::move(Arg.Roots)),
276 Roots = std::move(RHS.Roots);
289 /// Iteration over roots.
297 root_iterator root_begin() { return Roots.begin(); }
298 const_root_iterator root_begin() const { return Roots.begin(); }
299 root_iterator root_end() { return Roots.end(); }
300 const_root_iterator root_end() const { return Roots.end();
304 iterator_range<root_iterator> roots() { function in class:llvm::DominatorTreeBase
307 iterator_range<const_root_iterator> roots() const { function in class:llvm::DominatorTreeBase
[all...] |
