| /dports/java/sablevm/sablevm-1.13/src/libsablevm/ |
| H A D | splay_tree.c | 67 _svmt_type_node **node_first = is_left_parent_child ? &node->left : &node->right; in _svmf_tree_splay_type() local
80 _svmt_type_node *B = same ? *parent_other : *node_first; in _svmf_tree_splay_type()
106 *node_first = grand_parent; in _svmf_tree_splay_type()
407 _svmt_gc_map_node *B = same ? *parent_other : *node_first; in _svmf_tree_splay_gc_map()
433 *node_first = grand_parent; in _svmf_tree_splay_gc_map()
734 _svmt_imethod_signature_node *B = same ? *parent_other : *node_first; in _svmf_tree_splay_imethod_signature()
760 *node_first = grand_parent; in _svmf_tree_splay_imethod_signature()
1061 _svmt_internal_method_node *B = same ? *parent_other : *node_first; in _svmf_tree_splay_internal_method()
1087 *node_first = grand_parent; in _svmf_tree_splay_internal_method()
1390 _svmt_sequence_node *B = same ? *parent_other : *node_first; in _svmf_tree_splay_sequence()
[all …]
|
| H A D | splay_tree.m4.c | 88 $2 **node_first = is_left_parent_child ? &node->left : &node->right; in _svmf_tree_splay_$1() local
101 $2 *B = same ? *parent_other : *node_first; in _svmf_tree_splay_$1()
127 *node_first = grand_parent; in _svmf_tree_splay_$1()
|
| /dports/games/rocksndiamonds/rnd_jue-3.3.0.0/src/libgame/ |
| H A D | misc.c | 1746 node_new->next = *node_first; in addNodeToList()
1747 *node_first = node_new; in addNodeToList()
1753 if (node_first == NULL || *node_first == NULL) in deleteNodeFromList()
1758 checked_free((*node_first)->key); in deleteNodeFromList()
1761 *node_first = (*node_first)->next; in deleteNodeFromList()
1769 if (node_first == NULL) in getNodeFromKey()
1772 if (strEqual(node_first->key, key)) in getNodeFromKey()
1773 return node_first; in getNodeFromKey()
1780 return (node_first ? 1 + getNumNodes(node_first->next) : 0); in getNumNodes()
1783 void dumpList(ListNode *node_first) in dumpList() argument
[all …]
|
| H A D | setup.c | 987 void pushTreeInfo(TreeInfo **node_first, TreeInfo *node_new) in pushTreeInfo() argument
989 node_new->next = *node_first; in pushTreeInfo()
990 *node_first = node_new; in pushTreeInfo()
1197 void sortTreeInfoBySortFunction(TreeInfo **node_first, in sortTreeInfoBySortFunction() argument
1201 int num_nodes = numTreeInfo(*node_first); in sortTreeInfoBySortFunction()
1203 TreeInfo *node = *node_first; in sortTreeInfoBySortFunction()
1231 *node_first = sort_array[0]; in sortTreeInfoBySortFunction()
1236 node = *node_first; in sortTreeInfoBySortFunction()
1246 void sortTreeInfo(TreeInfo **node_first) in sortTreeInfo() argument
3201 pushTreeInfo(node_first, leveldir_new); in LoadLevelInfoFromLevelConf()
[all …]
|
| /dports/games/rnd_jue/rnd_jue-3.3.0.0/src/libgame/ |
| H A D | misc.c | 1746 node_new->next = *node_first; in addNodeToList()
1747 *node_first = node_new; in addNodeToList()
1753 if (node_first == NULL || *node_first == NULL) in deleteNodeFromList()
1758 checked_free((*node_first)->key); in deleteNodeFromList()
1761 *node_first = (*node_first)->next; in deleteNodeFromList()
1769 if (node_first == NULL) in getNodeFromKey()
1772 if (strEqual(node_first->key, key)) in getNodeFromKey()
1773 return node_first; in getNodeFromKey()
1780 return (node_first ? 1 + getNumNodes(node_first->next) : 0); in getNumNodes()
1783 void dumpList(ListNode *node_first) in dumpList() argument
[all …]
|
| H A D | setup.c | 987 void pushTreeInfo(TreeInfo **node_first, TreeInfo *node_new) in pushTreeInfo() argument
989 node_new->next = *node_first; in pushTreeInfo()
990 *node_first = node_new; in pushTreeInfo()
1197 void sortTreeInfoBySortFunction(TreeInfo **node_first, in sortTreeInfoBySortFunction() argument
1201 int num_nodes = numTreeInfo(*node_first); in sortTreeInfoBySortFunction()
1203 TreeInfo *node = *node_first; in sortTreeInfoBySortFunction()
1231 *node_first = sort_array[0]; in sortTreeInfoBySortFunction()
1236 node = *node_first; in sortTreeInfoBySortFunction()
1246 void sortTreeInfo(TreeInfo **node_first) in sortTreeInfo() argument
3201 pushTreeInfo(node_first, leveldir_new); in LoadLevelInfoFromLevelConf()
[all …]
|
| /dports/games/rocksndiamonds/rocksndiamonds-3.3.1.2/src/libgame/ |
| H A D | misc.c | 1800 node_new->next = *node_first; in addNodeToList()
1801 *node_first = node_new; in addNodeToList()
1807 if (node_first == NULL || *node_first == NULL) in deleteNodeFromList()
1812 checked_free((*node_first)->key); in deleteNodeFromList()
1815 *node_first = (*node_first)->next; in deleteNodeFromList()
1823 if (node_first == NULL) in getNodeFromKey()
1826 if (strEqual(node_first->key, key)) in getNodeFromKey()
1827 return node_first; in getNodeFromKey()
1834 return (node_first ? 1 + getNumNodes(node_first->next) : 0); in getNumNodes()
1837 void dumpList(ListNode *node_first) in dumpList() argument
[all …]
|
| H A D | setup.c | 987 void pushTreeInfo(TreeInfo **node_first, TreeInfo *node_new) in pushTreeInfo() argument
989 node_new->next = *node_first; in pushTreeInfo()
990 *node_first = node_new; in pushTreeInfo()
1202 void sortTreeInfoBySortFunction(TreeInfo **node_first, in sortTreeInfoBySortFunction() argument
1206 int num_nodes = numTreeInfo(*node_first); in sortTreeInfoBySortFunction()
1208 TreeInfo *node = *node_first; in sortTreeInfoBySortFunction()
1236 *node_first = sort_array[0]; in sortTreeInfoBySortFunction()
1241 node = *node_first; in sortTreeInfoBySortFunction()
1251 void sortTreeInfo(TreeInfo **node_first) in sortTreeInfo() argument
3210 pushTreeInfo(node_first, leveldir_new); in LoadLevelInfoFromLevelConf()
[all …]
|
| /dports/games/rnd_jue/rocksndiamonds-3.3.1.0/src/libgame/ |
| H A D | misc.c | 1747 node_new->next = *node_first; in addNodeToList()
1748 *node_first = node_new; in addNodeToList()
1754 if (node_first == NULL || *node_first == NULL) in deleteNodeFromList()
1759 checked_free((*node_first)->key); in deleteNodeFromList()
1762 *node_first = (*node_first)->next; in deleteNodeFromList()
1770 if (node_first == NULL) in getNodeFromKey()
1773 if (strEqual(node_first->key, key)) in getNodeFromKey()
1774 return node_first; in getNodeFromKey()
1781 return (node_first ? 1 + getNumNodes(node_first->next) : 0); in getNumNodes()
1784 void dumpList(ListNode *node_first) in dumpList() argument
[all …]
|
| H A D | setup.c | 987 void pushTreeInfo(TreeInfo **node_first, TreeInfo *node_new) in pushTreeInfo() argument
989 node_new->next = *node_first; in pushTreeInfo()
990 *node_first = node_new; in pushTreeInfo()
1197 void sortTreeInfoBySortFunction(TreeInfo **node_first, in sortTreeInfoBySortFunction() argument
1201 int num_nodes = numTreeInfo(*node_first); in sortTreeInfoBySortFunction()
1203 TreeInfo *node = *node_first; in sortTreeInfoBySortFunction()
1231 *node_first = sort_array[0]; in sortTreeInfoBySortFunction()
1236 node = *node_first; in sortTreeInfoBySortFunction()
1246 void sortTreeInfo(TreeInfo **node_first) in sortTreeInfo() argument
3203 pushTreeInfo(node_first, leveldir_new); in LoadLevelInfoFromLevelConf()
[all …]
|
| /dports/games/mirrormagic/mirrormagic-2.0.2/src/ |
| H A D | screens.c | 793 struct LevelDirInfo *node, *node_first; in drawChooseLevelList() local
797 node_first = getLevelDirInfoFirstGroupEntry(leveldir_current); in drawChooseLevelList()
798 node = getLevelDirInfoFromPos(node_first, leveldir_pos); in drawChooseLevelList()
822 struct LevelDirInfo *node, *node_first; in drawChooseLevelInfo() local
825 node_first = getLevelDirInfoFirstGroupEntry(leveldir_current); in drawChooseLevelInfo()
826 node = getLevelDirInfoFromPos(node_first, leveldir_pos); in drawChooseLevelInfo()
953 struct LevelDirInfo *node_first, *node_cursor; in HandleChooseLevel() local
957 node_first = getLevelDirInfoFirstGroupEntry(leveldir_current); in HandleChooseLevel()
958 node_cursor = getLevelDirInfoFromPos(node_first, leveldir_pos); in HandleChooseLevel()
988 struct LevelDirInfo *node_first, *node_cursor; in HandleChooseLevel() local
[all …]
|
| /dports/games/mirrormagic/mirrormagic-2.0.2/src/libgame/ |
| H A D | misc.c | 1068 void pushLevelDirInfo(struct LevelDirInfo **node_first, in pushLevelDirInfo() argument
1071 node_new->next = *node_first; in pushLevelDirInfo()
1072 *node_first = node_new; in pushLevelDirInfo()
1217 void sortLevelDirInfo(struct LevelDirInfo **node_first, in sortLevelDirInfo() argument
1220 int num_nodes = numLevelDirInfo(*node_first); in sortLevelDirInfo()
1222 struct LevelDirInfo *node = *node_first; in sortLevelDirInfo()
1250 *node_first = sort_array[0]; in sortLevelDirInfo()
1255 node = *node_first; in sortLevelDirInfo()
|
| /dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 250 unsigned node_first = bi_get_node(ins->dest[0]); in bi_mark_interference() local
251 if (d == 1 && node_first < node_count) { in bi_mark_interference()
253 node_first, bi_writemask(ins, 0)); in bi_mark_interference()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 205 static struct node *node_first(struct sparsebit *s) in node_first() function
1094 nodep = node_first(s); in sparsebit_first_set()
1109 nodep1 = node_first(s); in sparsebit_first_clear()
1601 for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) { in sparsebit_dump()
1693 for (nodep = node_first(s); nodep; in sparsebit_validate_internal()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 205 static struct node *node_first(struct sparsebit *s) in node_first() function
1094 nodep = node_first(s); in sparsebit_first_set()
1109 nodep1 = node_first(s); in sparsebit_first_clear()
1601 for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) { in sparsebit_dump()
1693 for (nodep = node_first(s); nodep; in sparsebit_validate_internal()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 205 static struct node *node_first(struct sparsebit *s) in node_first() function
1094 nodep = node_first(s); in sparsebit_first_set()
1109 nodep1 = node_first(s); in sparsebit_first_clear()
1601 for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) { in sparsebit_dump()
1693 for (nodep = node_first(s); nodep; in sparsebit_validate_internal()
|
| /dports/print/tex-luatex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/print/tex-aleph/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/print/tex-xetex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.c | 440 node_first (avl_node * a) in node_first() function
461 return node_first (sub_right (a)); in node_next()
573 return node_first (a); in node_find_index()
1010 return get_item (node_first (t->root)); in avl_first()
1304 p = node_first (t->root); in node_del_first()
1832 a = node_first (sub_right (a)); in avl_ins_index()
2577 a = node_first (a); in avl_iterator_next()
|
| /dports/games/rnd_jue/rnd_jue-3.3.0.0/src/ |
| H A D | screens.c | 3325 TreeInfo *node, *node_first; in drawChooseTreeList() local
3339 node_first = getTreeInfoFirstGroupEntry(ti); in drawChooseTreeList()
3340 node = getTreeInfoFromPos(node_first, entry_pos); in drawChooseTreeList()
3362 TreeInfo *node, *node_first; in drawChooseTreeInfo() local
3370 node_first = getTreeInfoFirstGroupEntry(ti); in drawChooseTreeInfo()
3371 node = getTreeInfoFromPos(node_first, entry_pos); in drawChooseTreeInfo()
3548 TreeInfo *node_first, *node_cursor; in HandleChooseTree() local
3551 node_first = getTreeInfoFirstGroupEntry(ti); in HandleChooseTree()
3552 node_cursor = getTreeInfoFromPos(node_first, entry_pos); in HandleChooseTree()
3600 TreeInfo *node_first, *node_cursor; in HandleChooseTree() local
[all …]
|
| /dports/games/rnd_jue/rocksndiamonds-3.3.1.0/src/ |
| H A D | screens.c | 3372 TreeInfo *node, *node_first; in drawChooseTreeList() local
3386 node_first = getTreeInfoFirstGroupEntry(ti); in drawChooseTreeList()
3387 node = getTreeInfoFromPos(node_first, entry_pos); in drawChooseTreeList()
3409 TreeInfo *node, *node_first; in drawChooseTreeInfo() local
3420 node_first = getTreeInfoFirstGroupEntry(ti); in drawChooseTreeInfo()
3421 node = getTreeInfoFromPos(node_first, entry_pos); in drawChooseTreeInfo()
3614 TreeInfo *node_first, *node_cursor; in HandleChooseTree() local
3617 node_first = getTreeInfoFirstGroupEntry(ti); in HandleChooseTree()
3618 node_cursor = getTreeInfoFromPos(node_first, entry_pos); in HandleChooseTree()
3666 TreeInfo *node_first, *node_cursor; in HandleChooseTree() local
[all …]
|