HomeSort by: relevance | last modified time | path
    Searched refs:roots (Results 1 - 25 of 42) sorted by relevancy

1 2

  /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/crypto/external/apache2/openssl/dist/test/
crltest.c 344 STACK_OF(X509) *roots = sk_X509_new_null();
350 || !TEST_ptr(roots))
356 if (!TEST_true(sk_X509_push(roots, root))) {
362 X509_STORE_CTX_set0_trusted_stack(ctx, roots);
377 OSSL_STACK_OF_X509_free(roots);
573 STACK_OF(X509) *roots = sk_X509_new_null();
580 || !TEST_ptr(roots))
586 if (!TEST_true(sk_X509_push(roots, test_root))) {
593 X509_STORE_CTX_set0_trusted_stack(ctx, roots);
611 OSSL_STACK_OF_X509_free(roots);
    [all...]
  /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/crypto/external/bsd/openssl/dist/test/
crltest.c 259 STACK_OF(X509) *roots = sk_X509_new_null();
265 || !TEST_ptr(roots))
270 if (!TEST_true(sk_X509_push(roots, root))
273 X509_STORE_CTX_set0_trusted_stack(ctx, roots);
288 sk_X509_pop_free(roots, X509_free);
  /src/crypto/external/bsd/openssl.old/dist/test/
crltest.c 238 STACK_OF(X509) *roots = sk_X509_new_null();
244 || !TEST_ptr(roots))
249 if (!TEST_true(sk_X509_push(roots, root))
252 X509_STORE_CTX_set0_trusted_stack(ctx, roots);
267 sk_X509_pop_free(roots, X509_free);
  /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/crypto/external/apache2/openssl/dist/crypto/slh_dsa/
slh_fors.c 224 uint8_t roots[SLH_MAX_ROOTS]; local
225 size_t roots_len = 0; /* The size of |roots| */
226 uint8_t *node0, *node1; /* Pointers into roots[] */
227 WPACKET root_pkt, *wroot_pkt = &root_pkt; /* Points to |roots| buffer */
237 if (!WPACKET_init_static_len(wroot_pkt, roots, sizeof(roots), 0))
243 /* Compute the roots of k Merkle trees */
283 /* The public key is the hash of all the roots of the k trees */
287 ret = hashf->T(ctx, pk_seed, pk_adrs, roots, roots_len, pk_out, pk_out_len);
  /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/dist/gcc/
tree-vect-slp.cc 3629 vec<stmt_vec_info> roots = vNULL; local
3633 roots, remain,
3668 for (unsigned i = 0; i < bb_vinfo->roots.length (); ++i)
3670 vect_location = bb_vinfo->roots[i].roots[0]->stmt;
3672 for (unsigned j = 0; j < bb_vinfo->roots[i].stmts.length (); ++j)
3673 bb_vinfo->roots[i].stmts[j]
3674 = vect_stmt_to_vectorize (bb_vinfo->roots[i].stmts[j]);
3675 if (vect_build_slp_instance (bb_vinfo, bb_vinfo->roots[i].kind,
3676 bb_vinfo->roots[i].stmts
6833 hash_set<stmt_vec_info> roots; local
6841 vect_slp_prune_covered_roots (SLP_INSTANCE_TREE (instance), roots, local
7443 vec<stmt_vec_info> roots = vNULL; local
7478 vec<stmt_vec_info> roots = vNULL; local
7630 vec<stmt_vec_info> roots; local
    [all...]
  /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...]
  /src/crypto/external/apache2/openssl/dist/crypto/ml_kem/
ml_kem.c 830 * off the last iteration of the usual FFT code, with the 128 relevant roots of
837 const uint16_t *roots = kNTTRoots; local
846 uint32_t zeta = *++roots;
865 * using the precomputed 128 roots of unity stored in InverseNTTRoots.
869 const uint16_t *roots = kInverseNTTRoots; local
878 uint32_t zeta = *++roots;
926 const uint16_t *roots = kModRoots; local
931 uint32_t zetapow = *roots++;
944 const uint16_t *roots = kModRoots; local
951 uint32_t zetapow = *roots++
    [all...]

Completed in 78 milliseconds

1 2