Searched refs:roots (Results 1 - 12 of 12) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.h111 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
H A DGIMatchTree.cpp366 *(Leaf.getMatchDag().roots().begin() + Leaf.getRootIdx());
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Dwc_db_wcroot.c275 apr_hash_t *roots = apr_hash_make(scratch_pool);
287 svn_hash_sets(roots, wcroot->abspath, wcroot);
293 return svn_error_trace(svn_wc__db_close_many_wcroots(roots, db->state_pool,
392 svn_wc__db_close_many_wcroots(apr_hash_t *roots,
398 for (hi = apr_hash_first(scratch_pool, roots); hi; hi = apr_hash_next(hi))
274 apr_hash_t *roots = apr_hash_make(scratch_pool); local
391 svn_wc__db_close_many_wcroots(apr_hash_t *roots, apr_pool_t *state_pool, apr_pool_t *scratch_pool) argument
H A Dwc_db_private.h117 svn_wc__db_close_many_wcroots(apr_hash_t *roots,
H A Dwc-metadata.sql665 initializes the update/switch roots to make sure future updates fetch the
H A Dwc-queries.sql1630 /* This statement returns pairs of move-roots below the path ?2 in WC_ID ?1.
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DLayoutPass.cpp153 std::set<const DefinedAtom *> roots; local
155 roots.insert(ai.second);
156 for (const DefinedAtom *root : roots)
160 // their roots.
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_omp.h74 addr_and_size_t roots; // Pointer to __kmp_root. member in struct:__anon3442
/freebsd-11-stable/usr.bin/dtc/
H A Dfdt.cc1561 std::vector<node_ptr> &roots,
1639 roots.push_back(std::move(n));
1937 std::vector<node_ptr> roots; local
1950 parse_file(input, roots, read_header);
1951 switch (roots.size())
1958 root = generate_root(roots[0], fragnum);
1968 root = generate_root(roots[0], fragnum);
1975 for (auto i=++(roots.begin()), e=roots.end() ; i!=e ; ++i)
1560 parse_file(text_input_buffer &input, std::vector<node_ptr> &roots, bool &read_header) argument
H A Dfdt.hh905 * Parses a dts file in the given buffer and adds the roots to the parsed
911 std::vector<node_ptr> &roots,
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp143 /// The roots of a match. These are the leaves of the DAG that are closest to
211 iterator_range<const_root_iterator> roots() const { function in class:__anon2928::CombineRule
225 /// The matcher will begin from the roots and will perform the match by
234 for (auto &I : MatchDag.roots()) {
248 PrintError(TheDef.getLoc(), "One or more roots are unnecessary");
576 // the order in which we build the DAG. We build from the roots outwards
863 for (const auto &Root : enumerate(Rule->getMatchDag().roots())) {
/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-structalias.c1102 sbitmap roots; member in struct:scc_info
1141 if (TEST_BIT (si->roots, w))
1196 SET_BIT (si->roots, n);
1583 si->roots = sbitmap_alloc (size);
1584 sbitmap_zero (si->roots);
1601 sbitmap_free (si->roots);
1709 if (TEST_BIT (si->roots, w))
1729 if (TEST_BIT (si->roots, w))
1756 SET_BIT (si->roots, n);

Completed in 115 milliseconds