| /src/external/bsd/tcpdump/dist/ |
| print-tipc.c | 113 nd_uint32_t prev_node; member in struct:payload_tipc_pkthdr
127 nd_uint32_t prev_node; member in struct:internal_tipc_pkthdr
149 nd_uint32_t prev_node; member in struct:link_conf_tipc_pkthdr
169 u_int prev_node; local
181 prev_node = GET_BE_U_4(ap->prev_node);
187 TIPC_ZONE(prev_node), TIPC_CLUSTER(prev_node), TIPC_NODE(prev_node),
211 TIPC_ZONE(prev_node), TIPC_CLUSTER(prev_node), TIPC_NODE(prev_node)
230 u_int prev_node; local
289 u_int prev_node; local
[all...] |
| /src/external/gpl3/gcc/dist/libgcc/ |
| libgcov.h | 500 struct gcov_kvp *prev_node = NULL; local
516 prev_node = current_node;
555 else if (prev_node && !prev_node->next)
559 success = !__sync_val_compare_and_swap (&prev_node->next, 0,
564 prev_node->next = new_node;
|
| /src/external/gpl3/gcc.old/dist/libgcc/ |
| libgcov.h | 508 struct gcov_kvp *prev_node = NULL; local
524 prev_node = current_node;
563 else if (prev_node && !prev_node->next)
567 success = !__sync_val_compare_and_swap (&prev_node->next, 0,
572 prev_node->next = new_node;
|
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_mm.c | 234 struct drm_mm_node *prev_node = NULL; local
240 prev_node =
242 if (prev_node->free) {
243 prev_node->size += cur->size;
252 prev_node->size += next_node->size;
|
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_mm.c | 718 struct drm_mm_node *prev_node; local
723 prev_node = list_prev_entry(node, node_list);
735 if (drm_mm_hole_follows(prev_node))
736 rm_hole(prev_node);
737 add_hole(prev_node);
968 struct drm_mm_node *prev_node; local
981 * backwards correctly we check that prev_node->next == node->next,
985 prev_node = list_prev_entry(node, node_list);
986 DRM_MM_BUG_ON(list_next_entry(prev_node, node_list) !=
988 list_add(&node->node_list, &prev_node->node_list)
[all...] |
| /src/sys/ufs/chfs/ |
| chfs_readinode.c | 325 struct rb_node *node, *prev_node; local
332 prev_node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
333 if (!prev_node) {
337 node = prev_node;
446 prev_node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
447 if (!prev_node) {
451 node = prev_node;
|
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| intrusive_list.h | 355 intrusive_list_node<T> *prev_node = as_node (prev_elem);
361 prev_node->next = &elem;
480 intrusive_list_node<T> *prev_node = as_node (elem_node->prev);
481 prev_node->next = elem_node->next;
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| intrusive_list.h | 355 intrusive_list_node<T> *prev_node = as_node (prev_elem);
361 prev_node->next = &elem;
480 intrusive_list_node<T> *prev_node = as_node (elem_node->prev);
481 prev_node->next = elem_node->next;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/python/libstdcxx/v6/ |
| xmethods.py | 259 prev_node = obj['_M_impl']['_M_finish']['_M_node'] - 1
260 return prev_node[0][self._bufsize - 1]
425 prev_node = obj['_M_impl']['_M_node']['_M_prev'].cast(self._node_type)
426 return self.get_value_from_node(prev_node)
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/python/libstdcxx/v6/ |
| xmethods.py | 259 prev_node = obj['_M_impl']['_M_finish']['_M_node'] - 1
260 return prev_node[0][self._bufsize - 1]
425 prev_node = obj['_M_impl']['_M_node']['_M_prev'].cast(self._node_type)
426 return self.get_value_from_node(prev_node)
|
| /src/external/gpl2/xcvs/dist/lib/ |
| regexec.c | 1666 Idx prev_node = cur_src->elems[i];
1671 re_token_type_t type = dfa->nodes[prev_node].type;
1676 if (dfa->nodes[prev_node].accept_mb)
1677 naccepted = sift_states_iter_mb (mctx, sctx, prev_node,
1684 && check_node_accept (mctx, dfa->nodes + prev_node, str_idx)
1686 dfa->nexts[prev_node]))
1696 dfa->nexts[prev_node], to_idx,
1697 prev_node, str_idx))
1700 ok = re_node_set_insert (cur_dest, prev_node);
1663 Idx prev_node = cur_src->elems[i]; local
|
| /src/external/gpl3/gdb/dist/readline/readline/doc/ |
| texi2html | 4081 if ($prev_node)
4083 $node2next{$prev_node} = $node;
4084 $node2prev{$node} = $prev_node;
4086 $prev_node = $node;
|
| /src/external/gpl3/gdb.old/dist/readline/readline/doc/ |
| texi2html | 4081 if ($prev_node)
4083 $node2next{$prev_node} = $node;
4084 $node2prev{$node} = $prev_node;
4086 $prev_node = $node;
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| gdbtypes.c | 2970 struct dynamic_prop_list *prev_node, *curr_node;
2973 prev_node = NULL;
2983 if (NULL == prev_node)
2986 prev_node->next = curr_node->next;
2991 prev_node = curr_node;
2969 struct dynamic_prop_list *prev_node, *curr_node; local
|
| /src/external/gpl3/gdb/dist/gdb/ |
| gdbtypes.c | 3032 struct dynamic_prop_list *prev_node, *curr_node;
3035 prev_node = NULL;
3045 if (NULL == prev_node)
3048 prev_node->next = curr_node->next;
3053 prev_node = curr_node;
3031 struct dynamic_prop_list *prev_node, *curr_node; local
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-vect-slp.cc | 108 this->prev_node = NULL;
110 slp_first_node->prev_node = this;
135 if (this->prev_node)
136 this->prev_node->next_node = this->next_node;
140 this->next_node->prev_node = this->prev_node;
|
| tree-vectorizer.h | 241 slp_tree prev_node; member in struct:_slp_tree
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-vect-slp.cc | 94 this->prev_node = NULL;
96 slp_first_node->prev_node = this;
121 if (this->prev_node)
122 this->prev_node->next_node = this->next_node;
126 this->next_node->prev_node = this->prev_node;
|
| gimplify.cc | 8724 initially created). PREV_NODE is the first of two or three mappings for a
8732 if SCP is null, the new node is inserted before PREV_NODE.
8734 - PREV_NODE, if SCP is non-null.
8741 tree prev_node, tree *scp)
8748 tree cl = scp ? prev_node : c2;
8751 OMP_CLAUSE_CHAIN (c2) = scp ? *scp : prev_node;
8752 if (OMP_CLAUSE_CHAIN (prev_node) != c
8753 && OMP_CLAUSE_CODE (OMP_CLAUSE_CHAIN (prev_node)) == OMP_CLAUSE_MAP
8754 && (OMP_CLAUSE_MAP_KIND (OMP_CLAUSE_CHAIN (prev_node))
8756 OMP_CLAUSE_SIZE (c2) = OMP_CLAUSE_SIZE (OMP_CLAUSE_CHAIN (prev_node));
[all...] |
| tree-vectorizer.h | 221 slp_tree prev_node; member in struct:_slp_tree
|
| /src/sys/external/bsd/ena-com/ |
| ena_com.c | 425 int prev_node = 0; local
444 prev_node);
|
