| /src/external/bsd/ntp/dist/ntpd/ |
| ntp_prio_q.c | 110 next_node( function
|
| ntp_prio_q.c | 110 next_node( function
|
| /src/external/gpl3/gcc/dist/libobjc/ |
| hash.c | 81 node_ptr next_node; local
94 while ((next_node = node->next))
97 node = next_node;
|
| hash.c | 81 node_ptr next_node; local
94 while ((next_node = node->next))
97 node = next_node;
|
| /src/external/gpl3/gcc.old/dist/libobjc/ |
| hash.c | 81 node_ptr next_node; local
94 while ((next_node = node->next))
97 node = next_node;
|
| hash.c | 81 node_ptr next_node; local
94 while ((next_node = node->next))
97 node = next_node;
|
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_mm.c | 235 struct drm_mm_node *next_node; local
248 next_node =
250 if (next_node->free) {
252 prev_node->size += next_node->size;
253 list_del(&next_node->ml_entry);
254 list_del(&next_node->fl_entry);
256 list_add(&next_node->fl_entry,
260 free(next_node, DRM_MEM_MM);
262 next_node->size += cur->size;
263 next_node->start = cur->start
[all...] |
| drm_mm.c | 235 struct drm_mm_node *next_node; local
248 next_node =
250 if (next_node->free) {
252 prev_node->size += next_node->size;
253 list_del(&next_node->ml_entry);
254 list_del(&next_node->fl_entry);
256 list_add(&next_node->fl_entry,
260 free(next_node, DRM_MEM_MM);
262 next_node->size += cur->size;
263 next_node->start = cur->start
[all...] |
| /src/external/cddl/osnet/dist/cmd/zpool/ |
| zpool_iter.c | 168 zpool_node_t *node, *next_node; local
171 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) {
172 next_node = uu_avl_next(zlp->zl_avl, node);
|
| zpool_iter.c | 168 zpool_node_t *node, *next_node; local
171 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) {
172 next_node = uu_avl_next(zlp->zl_avl, node);
|
| /src/common/lib/libc/gen/ |
| ptree.c | 721 uintptr_t node, next_node; local
735 next_node = node;
740 next_node = PT_NULL;
750 next_node = PT_NULL;
758 next_node = PTN_BRANCH_SLOT(ptn, slot + 1);
764 next_node = PTN_BRANCH_SLOT(ptn, slot - 1);
775 next_node = PTN_BRANCH_ROOT_SLOT(ptn);
776 ptn = PT_NODE(next_node);
784 KASSERT(PT_NULL_P(next_node));
790 node = next_node;
[all...] |
| ptree.c | 721 uintptr_t node, next_node; local
735 next_node = node;
740 next_node = PT_NULL;
750 next_node = PT_NULL;
758 next_node = PTN_BRANCH_SLOT(ptn, slot + 1);
764 next_node = PTN_BRANCH_SLOT(ptn, slot - 1);
775 next_node = PTN_BRANCH_ROOT_SLOT(ptn);
776 ptn = PT_NODE(next_node);
784 KASSERT(PT_NULL_P(next_node));
790 node = next_node;
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| gl_list.h | 375 gl_list_node_t (*next_node) (gl_list_t list, gl_list_node_t node); member in struct:gl_list_implementation
485 ->next_node (list, node);
|
| gl_list.h | 375 gl_list_node_t (*next_node) (gl_list_t list, gl_list_node_t node); member in struct:gl_list_implementation
485 ->next_node (list, node);
|
| /src/crypto/external/bsd/heimdal/dist/lib/base/ |
| heimbase.c | 737 heim_object_t node, next_node; local
766 next_node = heim_dict_get_value(node, path_element);
768 next_node = _heim_db_get_value(node, NULL, path_element, NULL);
782 next_node = heim_array_get_value(node, idx);
790 node = next_node;
916 heim_object_t next_node = NULL; local
928 next_node = heim_dict_get_value(node, path_element);
943 next_node = heim_array_get_value(node, idx);
945 next_node = NULL;
956 if (next_node == NULL)
[all...] |
| heimbase.c | 737 heim_object_t node, next_node; local
766 next_node = heim_dict_get_value(node, path_element);
768 next_node = _heim_db_get_value(node, NULL, path_element, NULL);
782 next_node = heim_array_get_value(node, idx);
790 node = next_node;
916 heim_object_t next_node = NULL; local
928 next_node = heim_dict_get_value(node, path_element);
943 next_node = heim_array_get_value(node, idx);
945 next_node = NULL;
956 if (next_node == NULL)
[all...] |
| /src/external/bsd/openldap/dist/servers/slapd/overlays/ |
| sssvlv.c | 416 TAvlnode *cur_node, *next_node; local
419 next_node = ldap_tavl_next( cur_node, TAVL_DIR_RIGHT );
423 cur_node = next_node;
608 TAvlnode *next_node = NULL; local
620 next_node = ldap_tavl_next( cur_node, TAVL_DIR_RIGHT );
629 cur_node = next_node;
642 so->so_tree = next_node;
643 if ( next_node )
644 next_node->avl_left = NULL;
|
| sssvlv.c | 416 TAvlnode *cur_node, *next_node; local
419 next_node = ldap_tavl_next( cur_node, TAVL_DIR_RIGHT );
423 cur_node = next_node;
608 TAvlnode *next_node = NULL; local
620 next_node = ldap_tavl_next( cur_node, TAVL_DIR_RIGHT );
629 cur_node = next_node;
642 so->so_tree = next_node;
643 if ( next_node )
644 next_node->avl_left = NULL;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| passes.cc | 1534 struct pass_list_node *next_node = added_pass_nodes->next;
1540 added_pass_nodes = next_node;
1533 struct pass_list_node *next_node = added_pass_nodes->next; local
|
| passes.cc | 1534 struct pass_list_node *next_node = added_pass_nodes->next;
1540 added_pass_nodes = next_node;
1533 struct pass_list_node *next_node = added_pass_nodes->next; local
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| passes.cc | 1534 struct pass_list_node *next_node = added_pass_nodes->next;
1540 added_pass_nodes = next_node;
1533 struct pass_list_node *next_node = added_pass_nodes->next; local
|
| passes.cc | 1534 struct pass_list_node *next_node = added_pass_nodes->next;
1540 added_pass_nodes = next_node;
1533 struct pass_list_node *next_node = added_pass_nodes->next; local
|
| /src/external/gpl2/xcvs/dist/lib/ |
| regexec.c | 3059 Idx next_node = dfa->nexts[cur_node];
3072 ok = re_node_set_insert (&union_set, next_node);
3225 Idx to_idx, next_node;
3240 next_node = dfa->edests[ent->node].elems[0];
3241 if (re_node_set_contains (cur_nodes, next_node))
3243 err = re_node_set_init_1 (&new_dests, next_node);
3260 next_node = dfa->nexts[ent->node];
3265 next_node))
3269 ok = re_node_set_insert (&union_set, next_node);
3279 err = re_node_set_init_1 (&union_set, next_node);
3055 Idx next_node = dfa->nexts[cur_node]; local
3221 Idx to_idx, next_node; local
3393 Idx next_node; local
[all...] |
| regexec.c | 3059 Idx next_node = dfa->nexts[cur_node];
3072 ok = re_node_set_insert (&union_set, next_node);
3225 Idx to_idx, next_node;
3240 next_node = dfa->edests[ent->node].elems[0];
3241 if (re_node_set_contains (cur_nodes, next_node))
3243 err = re_node_set_init_1 (&new_dests, next_node);
3260 next_node = dfa->nexts[ent->node];
3265 next_node))
3269 ok = re_node_set_insert (&union_set, next_node);
3279 err = re_node_set_init_1 (&union_set, next_node);
3055 Idx next_node = dfa->nexts[cur_node]; local
3221 Idx to_idx, next_node; local
3393 Idx next_node; local
[all...] |
| /src/sbin/fsck_udf/ |
| main.c | 3854 struct udf_fsck_node *cur_node, *next_node; local
4009 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
4094 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
4121 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
4157 struct udf_fsck_node *cur_node, *next_node; local
4162 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
|
