| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/mtr/ |
| H A D | mtrBasic.c | 193 Mtr_FreeTree(node->younger); in Mtr_FreeTree()
233 if (node->younger != NULL) { in Mtr_CopyTree()
234 copy->younger = Mtr_CopyTree(node->younger, expansion); in Mtr_CopyTree()
244 if (copy->younger) copy->younger->elder = copy; in Mtr_CopyTree()
274 child->younger = parent->child; in Mtr_MakeFirstChild()
306 child->younger = NULL; in Mtr_MakeLastChild()
315 node->younger = child; in Mtr_MakeLastChild()
399 second->younger = first->younger; in Mtr_MakeNextSibling()
400 if (first->younger != NULL) { in Mtr_MakeNextSibling()
404 first->younger = second; in Mtr_MakeNextSibling()
[all …]
|
| H A D | mtrGroup.c | 268 last = first->younger; in Mtr_MakeGroup()
271 last = last->younger; in Mtr_MakeGroup()
284 newn->younger = NULL; in Mtr_MakeGroup()
325 newn->younger = last->younger; in Mtr_MakeGroup()
329 last->younger = NULL; in Mtr_MakeGroup()
370 for (last = group->child; last->younger != NULL; last = last->younger) { in Mtr_DissolveGroup()
375 last->younger = group->younger; in Mtr_DissolveGroup()
442 node = node->younger; in Mtr_FindGroup()
501 first->younger = second->younger; in Mtr_SwapGroups()
504 second->younger = first; in Mtr_SwapGroups()
[all …]
|
| /dports/math/cudd/cudd-3.0.0/mtr/ |
| H A D | mtrGroup.c | 219 newn->younger = first; in Mtr_MakeGroup()
244 last = last->younger; in Mtr_MakeGroup()
257 newn->younger = NULL; in Mtr_MakeGroup()
298 newn->younger = last->younger; in Mtr_MakeGroup()
342 for (last = group->child; last->younger != NULL; last = last->younger) { in Mtr_DissolveGroup()
347 last->younger = group->younger; in Mtr_DissolveGroup()
412 node = node->younger; in Mtr_FindGroup()
469 first->younger = second->younger; in Mtr_SwapGroups()
533 moving->younger = rightplace->younger; in Mtr_ReorderGroups()
572 assert(root->younger == NULL || root->younger->elder == root); in Mtr_PrintGroups()
[all …]
|
| H A D | mtrBasic.c | 165 Mtr_FreeTree(node->younger); in Mtr_FreeTree()
205 if (node->younger != NULL) { in Mtr_CopyTree()
206 copy->younger = Mtr_CopyTree(node->younger, expansion); in Mtr_CopyTree()
207 if (copy->younger == NULL) { in Mtr_CopyTree()
216 if (copy->younger) copy->younger->elder = copy; in Mtr_CopyTree()
272 child->younger = NULL; in Mtr_MakeLastChild()
279 node->younger != NULL; in Mtr_MakeLastChild()
280 node = node->younger); in Mtr_MakeLastChild()
281 node->younger = child; in Mtr_MakeLastChild()
357 second->younger = first->younger; in Mtr_MakeNextSibling()
[all …]
|
| /dports/math/teyjus/teyjus-2.1-7-ge63f40a/source/linker/ |
| H A D | code.c | 684 if(code[younger]==try||code[younger]==try_else) in MergeSubSequence()
687 c=younger; in MergeSubSequence()
730 return younger; in MergeSubSequence()
773 CodeInd younger; in TidySwitchOnReg() local
778 younger=*pyounger; in TidySwitchOnReg()
818 younger=MergeSequence(younger,c,n); in MergeDefs()
874 return younger; in MergeSequence()
882 return younger; in MergeSequence()
893 return younger; in MergeSequence()
903 return younger; in MergeSequence()
[all …]
|
| /dports/x11-toolkits/p5-Prima/Prima-1.63/unix/ |
| H A D | apc_timer.c | 6 if ( sys-> older || sys-> younger || guts. oldest == sys) { in inactivate_timer()
8 sys-> older-> younger = sys-> younger; in inactivate_timer()
10 guts. oldest = sys-> younger; in inactivate_timer()
12 if ( sys-> younger) in inactivate_timer()
13 sys-> younger-> older = sys-> older; in inactivate_timer()
16 sys-> younger = NULL; in inactivate_timer()
100 if ( !before-> younger) { in apc_timer_start()
101 before-> younger = sys; in apc_timer_start()
106 before = before-> younger; in apc_timer_start()
111 before-> older-> younger = sys; in apc_timer_start()
[all …]
|
| /dports/databases/grass7/grass-7.8.6/lib/segment/ |
| H A D | pagein.c | 53 SEG->scb[cur].age->younger->older = SEG->scb[cur].age->older; in seg_pagein()
54 SEG->scb[cur].age->older->younger = SEG->scb[cur].age->younger; in seg_pagein()
56 SEG->scb[cur].age->younger = SEG->youngest->younger; in seg_pagein()
58 SEG->scb[cur].age->older->younger = SEG->scb[cur].age; in seg_pagein()
59 SEG->scb[cur].age->younger->older = SEG->scb[cur].age; in seg_pagein()
70 SEG->oldest = SEG->oldest->younger; in seg_pagein()
122 SEG->youngest = SEG->youngest->younger; in seg_pagein()
|
| H A D | setup.c | 134 SEG->agequeue[i].younger = &(SEG->agequeue[i - 1]); in seg_setup()
138 SEG->agequeue[i].younger = &(SEG->agequeue[SEG->nseg]); in seg_setup()
144 SEG->agequeue[SEG->nseg].younger = &(SEG->agequeue[SEG->nseg - 1]); in seg_setup()
|
| /dports/www/mod_authnz_crowd/mod_authnz_crowd-2.2.2/src/ |
| H A D | cache.c | 56 cache->oldest = oldest->younger; in cache_clean()
110 if (entry->younger != NULL) { in cache_put()
111 entry->younger->older = entry->older; in cache_put()
113 cache->oldest = entry->younger; in cache_put()
115 entry->older->younger = entry->younger; in cache_put()
123 entry->younger = NULL; in cache_put()
|
| /dports/devel/icmake/icmake-9b958b05ac462adf6cde394875964a8127599514/icmake/scripts/ib/ |
| H A D | librarypreamble | 7 "VERSION" younger version || "YEARS" younger version ||
8 "AUTHOR" younger version
|
| H A D | checklexer | 7 "../"PARSER_DIR"/"PARSOUT younger SCANOUT;
24 if (scanfiles[idx] younger SCANOUT)
|
| /dports/textproc/py-elasticsearch-curator/curator-5.8.4/examples/actions/ |
| H A D | unfreeze.yml | 12 Open indices older than 30 days but younger than 60 days (based on index
15 Unfreeze indices older than 30 days but younger than 60 days (based on index
35 direction: younger
|
| H A D | open.yml | 12 Open indices older than 30 days but younger than 60 days (based on index
32 direction: younger
|
| /dports/textproc/p5-Text-NSP/Text-NSP-1.31/Testing/huge-merge/test-A2/ |
| H A D | test-A2-3sorted | 4 children<>younger<>1 1 1
20 younger<>years<>1 1 1
|
| H A D | test-A2-2sorted | 5 children<>younger<>1 1 1
25 younger<>years<>1 1 1
|
| H A D | test-A2.reqd | 11 children<>younger<>2 2 2
46 younger<>years<>2 2 2
|
| /dports/textproc/p5-Text-NSP/Text-NSP-1.31/Testing/huge-sort/ |
| H A D | test-A2.bigram | 18 children<>younger<>
19 younger<>years<>
|
| H A D | test-A2.bigrams | 18 children<>younger<>
19 younger<>years<>
|
| H A D | test-A2.reqd | 5 children<>younger<>1 1 1
25 younger<>years<>1 1 1
|
| H A D | test-B1.bigrams | 5 children<>younger<>1 1 1
25 younger<>years<>1 1 1
|
| H A D | test-B1.reqd | 5 children<>younger<>1 1 11 1 1
25 younger<>years<>1 1 11 1 1
|
| /dports/textproc/p5-Text-NSP/Text-NSP-1.31/Testing/huge-merge/test-A1/ |
| H A D | test-A2-sorted | 5 children<>younger<>1 1 1
25 younger<>years<>1 1 1
|
| H A D | test-A1.reqd | 11 children<>younger<>1 1 1
46 younger<>years<>1 1 1
|
| /dports/devel/cook/cook-2.30/cook/graph/ |
| H A D | run.c | 173 string_list_ty younger; in graph_recipe_run() local
266 string_list_constructor(&younger); in graph_recipe_run()
271 id_variable_new(&younger), in graph_recipe_run()
567 string_list_append_unique(&younger, gfp2->filename); in graph_recipe_run()
631 string_list_append_unique(&younger, gfp2->filename); in graph_recipe_run()
660 string_list_append_unique(&younger, gfp2->filename); in graph_recipe_run()
686 id_variable_new(&younger), in graph_recipe_run()
689 string_list_destructor(&younger); in graph_recipe_run()
|
| /dports/misc/lifelines/lifelines-3.1.1/reports/ |
| H A D | alive.ll | 183 set(younger,person)
187 while (and(not(byear_est),or(older,younger))) {
189 set(younger,nextsib(younger))
200 if (and(not(byear_est),younger)) {
201 call get_byear(younger)
|