| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
| H A D | IntervalMap.cpp | 21 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second));
38 // NR is the subtree containing our left sibling.
39 NodeRef NR = path[l].subtree(path[l].offset - 1);
43 NR = NR.subtree(NR.size() - 1);
62 // NR is the subtree containing our left sibling.
64 NodeRef NR = subtree(l);
66 // Get the rightmost node in the subtree.
69 NR = NR.subtree(NR.size() - 1);
88 // NR is the subtree containing our right sibling.
89 NodeRef NR = path[l].subtree(pat
[all...] |
| /freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | rtree.h | 48 * A non-NULL subtree points to a subtree rooted along the hypothetical
51 * subtree pointers may remain NULL.
55 * accessed via subtrees[2], the subtree prefixed by 0x0000 (excluding
71 rtree_node_elm_t *subtree; member in union:rtree_level_s::__anon1797
88 * bits to which subtree level to start at.
221 rtree_node_elm_t *subtree; local
224 subtree = rtree->levels[level].subtree;
225 if (!dependent && unlikely(!rtree_node_valid(subtree)))
234 rtree_node_elm_t *subtree; local
[all...] |
| /freebsd-11-stable/contrib/jemalloc/src/ |
| H A D | rtree.c | 37 rtree->levels[0].subtree = NULL;
43 rtree->levels[i].subtree = NULL;
50 rtree->levels[height-1].subtree = NULL;
87 rtree_node_elm_t *subtree = rtree->levels[i].subtree; local
88 if (subtree != NULL)
89 rtree_delete_subtree(rtree, subtree, i);
121 return (rtree_node_init(rtree, level, &rtree->levels[level].subtree));
|
| /freebsd-11-stable/usr.sbin/makefs/ |
| H A D | makefs.c | 101 char *subtree; local
298 subtree = argv[1];
300 root = walk_dir(subtree, ".", NULL, NULL);
304 subtree = ".";
327 apply_specfile(specfile, subtree, root, fsoptions.onlyspec);
332 printf("\nparent: %s\n", subtree);
339 fstype->make_fs(argv[0], subtree, root, &fsoptions);
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_delta/ |
| H A D | branch_nested.c | 188 svn_branch__subtree_t *subtree = apr_pcalloc(result_pool, sizeof(*subtree)); local
190 subtree->tree = svn_element__tree_create(e_map, root_eid, result_pool);
191 subtree->subbranches = apr_hash_make(result_pool);
192 return subtree;
225 /* Is it pathwise at or below EID? If so, add it into the subtree. */
248 svn_branch__subtree_get_subbranch_at_eid(svn_branch__subtree_t *subtree, argument
252 subtree = svn_eid__hash_get(subtree->subbranches, eid);
254 return subtree;
[all...] |
| /freebsd-11-stable/contrib/subversion/subversion/include/private/ |
| H A D | svn_branch_nested.h | 143 /* A subtree of a branch, including any nested branches.
159 /* Create an empty subtree (no elements populated, not even ROOT_EID).
169 /* Return the subtree of BRANCH rooted at EID.
187 svn_branch__subtree_get_subbranch_at_eid(svn_branch__subtree_t *subtree,
|
| /freebsd-11-stable/contrib/bsnmp/snmp_vacm/ |
| H A D | vacm_snmp.c | 811 oid->subs[sub] = view->subtree.len;
813 asn_append_oid(oid, &view->subtree);
820 struct asn_oid subtree; local
823 if (vacm_view_index_decode(oid, sub, vname, &subtree) < 0)
828 asn_compare_oid(&subtree, &view->subtree)== 0)
838 struct asn_oid subtree; local
844 if (vacm_view_index_decode(oid, sub, vname, &subtree) < 0)
849 asn_compare_oid(&subtree, &view->subtree)
[all...] |
| /freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 517 /// subtree - Access the i'th subtree reference in a branch node.
520 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
686 // The key array in a branch node holds the rightmost stop key of each subtree.
690 // It is unusual for a branch node to only have one subtree, but it can happen
703 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
706 NodeRef &subtree(unsigned i) { return this->first[i]; }
708 /// findFrom - Find the first subtree after i that may contain x.
713 /// This is the first subtree that can possibly contain x.
722 /// safeFind - Find a subtree tha
[all...] |
| /freebsd-11-stable/contrib/bsnmp/snmpd/ |
| H A D | snmpmod.h | 428 struct asn_oid subtree; /* key */ member in struct:vacm_view
|
| H A D | main.c | 467 suboid = asn_is_suboid(&view->subtree, &pdu->bindings[i].var);
2984 return (asn_compare_oid(&v1->subtree, &v2->subtree));
3002 asn_append_oid(&view->subtree, oid);
|
| /freebsd-11-stable/contrib/ofed/opensm/opensm/ |
| H A D | osm_ucast_ftree.c | 1372 IN unsigned int subtree)
1388 new_tuple[p_ftree->leaf_switch_rank] = subtree;
1644 unsigned int subtree = 0; local
1664 in the subtree.
1665 The tuple will be as follows: [rank].0...0.subtree
1668 fabric_assign_first_tuple(p_ftree, p_sw, subtree++);
1370 fabric_assign_first_tuple(IN ftree_fabric_t * p_ftree, IN ftree_sw_t * p_sw, IN unsigned int subtree) argument
|
| /freebsd-11-stable/contrib/dtc/Documentation/ |
| H A D | dtc-paper.tex | 142 node (or whole subtree). It should be possible to do this without
|