| /src/external/gpl3/binutils/dist/gprofng/src/ |
| PRBTree.h | 85 Vector<LMap*> *roots; member in class:PRBTree
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| PRBTree.h | 85 Vector<LMap*> *roots; member in class:PRBTree
|
| /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/ |
| aptck.h | 69 u_int *roots; /* list of auxiliary roots */ member in struct:__anon1223
|
| /src/sys/external/bsd/drm2/dist/drm/i915/ |
| i915_buddy.h | 58 struct i915_buddy_block **roots; member in struct:i915_buddy_mm
|
| /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/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/crypto/dist/ipsec-tools/misc/ |
| cvs2cl.pl | 540 # todo: we're still collecting branch roots, but we're not
912 my $branchroots = $qunkref->roots;
1830 # roots => [ "branchtag1", "branchtag2", ... ]
1874 $self{'roots'} = [ map { $branch_names->{$_} } @$branch_roots ]
1891 sub roots { $_[0]->{roots} } subroutine
|
| /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...] |
| /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:__anon5800::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/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...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-vectorizer.h | 1084 : kind(kind_), stmts(stmts_), roots(roots_), remain(remain_) {}
1087 vec<stmt_vec_info> roots; member in struct:slp_root
1103 vec<slp_root> roots; member in class:_bb_vec_info
|
| 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...] |
| 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
|
