Home
last modified time | relevance | path

Searched refs:treep (Results 1 – 25 of 61) sorted by relevance

123

/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/wiredtiger/src/include/
H A Dbtree_cmp.i45 treep = tree_item->data; in __wt_lex_compare()
88 t = vld1q_u8(treep); in __wt_lex_compare()
101 if (*userp != *treep) in __wt_lex_compare()
273 ++treep; in __wt_lex_compare_short()
279 ++treep; in __wt_lex_compare_short()
285 ++treep; in __wt_lex_compare_short()
291 ++treep; in __wt_lex_compare_short()
297 ++treep; in __wt_lex_compare_short()
303 ++treep; in __wt_lex_compare_short()
309 ++treep; in __wt_lex_compare_short()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/native_client/src/trusted/interval_multiset/
H A Dnacl_interval_range_tree.c171 *treep = node; in NaClAvlTreeInsert()
238 *treep = tmp; in NaClAvlTreeInsert()
287 tmp = *treep; in NaClAvlTreeInsert()
307 *treep = tmp; in NaClAvlTreeInsert()
355 *treep = tmp; in NaClAvlTreeBalanceLeft()
382 *treep = tmp; in NaClAvlTreeBalanceLeft()
432 *treep = tmp; in NaClAvlTreeBalanceRight()
459 *treep = tmp; in NaClAvlTreeBalanceRight()
487 tmp = *treep; in NaClAvlFindRightMost()
506 tmp = *treep; in NaClAvlFindLeftMost()
[all …]
/dports/editors/cooledit/cooledit-3.17.28/widget/
H A Dmad.c1187 if (!(*treep)) { in tree_insert()
1188 (*treep) = new; in tree_insert()
1189 (*treep)->left = 0; in tree_insert()
1190 (*treep)->right = 0; in tree_insert()
1238 if (!*treep) in tree_delete()
1435 (*treep) = temp; in rebalance_right()
1445 (*treep)->right->left = (*treep); in rebalance_right()
1446 (*treep) = (*treep)->right; in rebalance_right()
1505 (*treep) = temp; in rebalance_left()
1515 (*treep)->left->right = (*treep); in rebalance_left()
[all …]
/dports/www/squid/squid-4.15/src/acl/
H A DGadgets.cc145 aclParseAccessLine(const char *directive, ConfigParser &, acl_access **treep) in aclParseAccessLine() argument
167 const int ruleId = ((treep && *treep) ? (*treep)->childrenCount() : 0) + 1; in aclParseAccessLine()
185 assert(treep); in aclParseAccessLine()
186 if (!*treep) { in aclParseAccessLine()
187 *treep = new Acl::Tree; in aclParseAccessLine()
188 (*treep)->context(directive, config_input_line); in aclParseAccessLine()
191 (*treep)->add(rule, action); in aclParseAccessLine()
198 aclParseAclList(ConfigParser &, Acl::Tree **treep, const char *label) in aclParseAclList() argument
223 assert(treep); in aclParseAclList()
224 assert(!*treep); in aclParseAclList()
[all …]
/dports/cad/verilator/verilator-4.216/src/
H A DV3SenTree.h100 AstSenTree* treep = m_trees.find(senTreep); in getSenTree() local
101 if (!treep) { in getSenTree()
103 treep = senTreep->cloneTree(false); in getSenTree()
104 m_topScopep->addSenTreep(treep); in getSenTree()
105 UINFO(8, " New SENTREE " << treep << endl); in getSenTree()
106 m_trees.add(treep); in getSenTree()
108 return treep; in getSenTree()
H A DV3Delayed.cpp190 AstSenTree* const treep = new AstSenTree(m_activep->fileline(), sena); in checkActivePost() local
191 if (senb) treep->addSensesp(senb); in checkActivePost()
196 oldactivep->sensesStorep(treep); in checkActivePost()
197 oldactivep->sensesp(treep); in checkActivePost()
/dports/sysutils/xdu/xdu-3.0/
H A Dxdu.c115 findnode(treep, x, y) in findnode() argument
116 struct node *treep; in findnode()
122 if (treep == NODE_NULL)
125 if (x >= treep->rect.left && x < treep->rect.left+treep->rect.width
126 && y >= treep->rect.top && y < treep->rect.top+treep->rect.height) {
128 return treep; /* found */
132 for (np = treep->child; np != NULL; np = np->peer) {
/dports/net/iaxmodem/iaxmodem-1.2.0/lib/spandsp/tests/
H A Dsuper_tone_tx_tests.c109 super_tone_tx_step_t *treep; in parse_tone() local
166 treep = super_tone_tx_make_step(NULL, in parse_tone()
173 *tree = treep; in parse_tone()
174 tree = &(treep->next); in parse_tone()
175 parse_tone(&(treep->nest), doc, ns, cur); in parse_tone()
H A Dsuper_tone_rx_tests.c104 super_tone_tx_step_t *treep; in parse_tone() local
180 treep = super_tone_tx_make_step(NULL, in parse_tone()
187 *tree = treep; in parse_tone()
188 tree = &(treep->next); in parse_tone()
189 parse_tone(desc, tone_id, &(treep->nest), doc, ns, cur); in parse_tone()
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/spandsp/tests/
H A Dsuper_tone_tx_tests.c104 super_tone_tx_step_t *treep; in parse_tone() local
161 treep = super_tone_tx_make_step(NULL, in parse_tone()
168 *tree = treep; in parse_tone()
169 tree = &treep->next; in parse_tone()
170 parse_tone(&treep->nest, doc, ns, cur); in parse_tone()
H A Dsuper_tone_rx_tests.c107 super_tone_tx_step_t *treep; in parse_tone() local
183 treep = super_tone_tx_make_step(NULL, in parse_tone()
190 *tree = treep; in parse_tone()
191 tree = &treep->next; in parse_tone()
192 parse_tone(desc, tone_id, &treep->nest, doc, ns, cur); in parse_tone()
/dports/comms/spandsp/spandsp-284fe91/tests/
H A Dsuper_tone_tx_tests.c104 super_tone_tx_step_t *treep; in parse_tone() local
161 treep = super_tone_tx_make_step(NULL, in parse_tone()
168 *tree = treep; in parse_tone()
169 tree = &treep->next; in parse_tone()
170 parse_tone(&treep->nest, doc, ns, cur); in parse_tone()
H A Dsuper_tone_rx_tests.c107 super_tone_tx_step_t *treep; in parse_tone() local
183 treep = super_tone_tx_make_step(NULL, in parse_tone()
190 *tree = treep; in parse_tone()
191 tree = &treep->next; in parse_tone()
192 parse_tone(desc, tone_id, &treep->nest, doc, ns, cur); in parse_tone()
/dports/misc/libsupertone/libsupertone-0.0.2/
H A Dsupertone.c80 super_tone_tx_step_t *treep; in parse_tone() local
154 treep = super_tone_tx_make_step(NULL, in parse_tone()
161 *tree = treep; in parse_tone()
162 tree = &(treep->next); in parse_tone()
163 parse_tone(desc, tone_id, &(treep->nest), doc, ns, cur); in parse_tone()
/dports/textproc/bibtool/BibTool/
H A Dkey.c1320 static bool add_fmt_tree(s, treep) /* */ in add_fmt_tree() argument
1322 KeyNode *treep; /* */
1330 { free_key_node(*treep); /* */
1350 { free_key_node(*treep); /* */
1352 NodePre(*treep) = special; /* */
1363 if ( *treep == (KeyNode)0 ) { *treep = kn; } /* */
1365 { free_key_node(*treep); /* */
1366 *treep = kn; /* */
1370 NodeThen(kn_or) = *treep; /* */
1372 *treep = kn_or; /* */
[all …]
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/wiredtiger/src/lsm/
H A Dlsm_tree.c406 const char *uri, bool exclusive, WT_LSM_TREE **treep) in __lsm_tree_find() argument
410 *treep = NULL; in __lsm_tree_find()
456 *treep = lsm_tree; in __lsm_tree_find()
501 const char *uri, bool exclusive, WT_LSM_TREE **treep) in __lsm_tree_open() argument
518 session, uri, exclusive, treep)) != WT_NOTFOUND) in __lsm_tree_open()
556 *treep = lsm_tree; in __lsm_tree_open()
570 const char *uri, bool exclusive, WT_LSM_TREE **treep) in __wt_lsm_tree_get() argument
581 ret = __lsm_tree_find(session, uri, exclusive, treep)); in __wt_lsm_tree_get()
584 ret = __lsm_tree_find(session, uri, exclusive, treep)); in __wt_lsm_tree_get()
587 ret = __lsm_tree_open(session, uri, exclusive, treep)); in __wt_lsm_tree_get()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/netcdf/vtknetcdf/libdispatch/
H A Djson.c48 NCjsonparse(char* text, NCjson** treep) in NCjsonparse() argument
73 if(treep) *treep = tree; in NCjsonparse()
/dports/math/vtk8/VTK-8.2.0/ThirdParty/netcdf/vtknetcdf/libdispatch/
H A Djson.c48 NCjsonparse(char* text, NCjson** treep) in NCjsonparse() argument
73 if(treep) *treep = tree; in NCjsonparse()
/dports/japanese/gawk/gawk-3.0.6/
H A Deval.c799 register NODE **treep; local
831 treep = treelist;
833 *treep++ = tree->rnode;
836 *treep = tree;
849 while (treep >= treelist) {
850 *strp = force_string(tree_eval(*treep--));
/dports/net/mpich/mpich-3.4.3/src/pm/hydra2/libhydra/topo/hwloc/hwloc/include/hwloc/
H A Dplugins.h566 HWLOC_DECLSPEC void hwloc_pcidisc_tree_insert_by_busid(struct hwloc_obj **treep, struct hwloc_obj *…
/dports/net/mpich/mpich-3.4.3/modules/hwloc/include/hwloc/
H A Dplugins.h566 HWLOC_DECLSPEC void hwloc_pcidisc_tree_insert_by_busid(struct hwloc_obj **treep, struct hwloc_obj *…
/dports/net/openmpi/openmpi-4.1.1/opal/mca/hwloc/hwloc201/hwloc/include/hwloc/
H A Dplugins.h489 HWLOC_DECLSPEC void hwloc_pcidisc_tree_insert_by_busid(struct hwloc_obj **treep, struct hwloc_obj *…
/dports/net/mpich/mpich-3.4.3/src/pm/hydra/tools/topo/hwloc/hwloc/include/hwloc/
H A Dplugins.h566 HWLOC_DECLSPEC void hwloc_pcidisc_tree_insert_by_busid(struct hwloc_obj **treep, struct hwloc_obj *…
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5min/rel2onto/dznFolder/
H A Drel2onto.mzn95 predicate treep(
148 constraint treep(vs,es,adjacent,endpairs);
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo10min/rel2onto/dznFolder/
H A Drel2onto.mzn95 predicate treep(
148 constraint treep(vs,es,adjacent,endpairs);

123