HomeSort by: relevance | last modified time | path
    Searched defs:node2 (Results 1 - 25 of 31) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.cpp 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); local
179 &G.getNodeMetadata(node2).getAllowedRegs();
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
202 G.addEdge(node1, node2, std::move(costs));
206 if (G.getEdgeNode1Id(edge) == node2) {
207 std::swap(node1, node2);
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); local
275 &G.getNodeMetadata(node2).getAllowedRegs();
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
283 if (G.getEdgeNode1Id(edge) == node2) {
    [all...]
  /src/external/historical/nawk/dist/
parse.c 64 Node *node2(int a, Node *b, Node *c) function
127 x = node2(a,b,c);
163 x = node2(a,b,c);
  /src/sys/dev/microcode/aic7xxx/
aicasm_symbol.c 300 symbol_node_t *node1, *node2; local
304 node2 = SLIST_NEXT(node1, links);
306 node1 = node2;
  /src/external/gpl2/xcvs/dist/src/
hash.c 441 Node **node2 = (Node **) elem2; local
442 return client_comp (*node1, *node2);
  /src/external/gpl3/gcc.old/dist/gcc/lto/
lto-symtab.cc 1001 symtab_node *node2; local
1064 && (node2 = symtab_node::get (vnode->decl))
1065 && node2 != node)
1066 lto_varpool_replace_node (dyn_cast <varpool_node *> (node2),
  /src/external/gpl3/gcc/dist/gcc/lto/
lto-symtab.cc 1001 symtab_node *node2; local
1064 && (node2 = symtab_node::get (vnode->decl))
1065 && node2 != node)
1066 lto_varpool_replace_node (dyn_cast <varpool_node *> (node2),
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
dsl_deleg.c 388 const perm_set_t *node2 = arg2; local
391 val = strcmp(node1->p_setname, node2->p_setname);
zfs_fuid.c 75 const fuid_domain_t *node2 = arg2; local
77 if (node1->f_idx < node2->f_idx)
79 else if (node1->f_idx > node2->f_idx)
91 const fuid_domain_t *node2 = arg2; local
94 val = strcmp(node1->f_ksid->kd_name, node2->f_ksid->kd_name);
sa.c 247 const sa_lot_t *node2 = arg2; local
249 if (node1->lot_num > node2->lot_num)
251 else if (node1->lot_num < node2->lot_num)
260 const sa_lot_t *node2 = arg2; local
262 if (node1->lot_hash > node2->lot_hash)
264 if (node1->lot_hash < node2->lot_hash)
266 if (node1->lot_instance > node2->lot_instance)
268 if (node1->lot_instance < node2->lot_instance)
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-utils.cc 278 struct cgraph_node *node, *node2; local
312 node2 = NULL;
313 while (stack[stack_size].edge && !node2)
316 node2 = edge->caller;
324 node2 = NULL;
328 ref) && !node2;
332 node2 = dyn_cast <cgraph_node *> (ref->referring);
334 if (!node2)
336 if (!node2->aux)
338 stack[++stack_size].node = node2;
    [all...]
tree-nested.cc 81 cgraph_node **node2 = &nested_function_info::get local
85 while (*node2 != node)
86 node2 = &nested_function_info::get (*node2)->next_nested;
87 *node2 = info->next_nested;
107 cgraph_node **node2 local
111 while ((info = nested_function_info::get (*node2)) != this && info)
112 node2 = &info->next_nested;
113 *node2 = next_nested;
  /src/external/gpl3/gcc/dist/gcc/
ipa-utils.cc 288 struct cgraph_node *node, *node2; local
322 node2 = NULL;
323 while (stack[stack_size].edge && !node2)
326 node2 = edge->caller;
331 ref) && !node2;
335 node2 = dyn_cast <cgraph_node *> (ref->referring);
337 if (!node2)
339 if (!node2->aux)
341 stack[++stack_size].node = node2;
342 stack[stack_size].edge = node2->callers
    [all...]
tree-nested.cc 81 cgraph_node **node2 = &nested_function_info::get local
85 while (*node2 != node)
86 node2 = &nested_function_info::get (*node2)->next_nested;
87 *node2 = info->next_nested;
107 cgraph_node **node2 local
111 while ((info = nested_function_info::get (*node2)) != this && info)
112 node2 = &info->next_nested;
113 *node2 = next_nested;
  /src/sys/arch/sparc/sparc/
cpu.c 1374 int mid, node2; local
1376 for (node2 = firstchild(findroot());
1377 node2;
1378 node2 = nextsibling(node2)) {
1379 cp = prom_getpropstringA(node2, "device_type",
1384 mid = prom_getpropint(node2, "mid", -1);
1386 node = node2;
  /src/sys/external/bsd/drm2/dist/drm/selftests/
test-drm_mm.c 1162 const char *node1 = NULL, *node2 = NULL; local
1170 node2 = kasprintf(GFP_KERNEL,
1177 node2);
1179 kfree(node2);
  /src/external/bsd/libarchive/dist/libarchive/
archive_ppmd7.c 220 CPpmd7_Node *node2 = NODE(n) + nu; local
221 nu += node2->NU;
222 if (node2->Stamp != 0 || nu >= 0x10000)
224 NODE(node2->Prev)->Next = node2->Next;
225 NODE(node2->Next)->Prev = node2->Prev;
archive_ppmd8.c 170 CPpmd8_Node *node2; local
173 while ((node2 = node + node->NU)->Stamp == EMPTY_NODE)
175 node->NU += node2->NU;
176 node2->NU = 0;
  /src/external/bsd/unbound/dist/testcode/
unitmain.c 1187 struct local_zone *node1, *node2; local
1193 node2=(struct local_zone*)rbtree_first(&z2->ztree);
1195 (rbnode_type*)node2 != RBTREE_NULL;
1197 node2=(struct local_zone*)rbtree_next((rbnode_type*)node2)) {
1202 node2->name, node2->namelabs,
1206 (node1->parent == NULL && node2->parent == NULL) ||
1207 (node1->parent != NULL && node2->parent != NULL));
1211 node2->parent->name, node2->parent->namelabs
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
CallStack.cc 1226 CallStackNode *node2 = (CallStackNode *) stack2; local
1227 while (node1 != NULL && node2 != NULL)
1231 if (node1->instr->id < node2->instr->id)
1233 else if (node1->instr->id > node2->instr->id)
1236 node2 = node2->ancestor;
1238 if (node1 == NULL && node2 != NULL)
1240 else if (node1 != NULL && node2 == NULL)
  /src/external/gpl3/binutils.old/dist/gprofng/src/
CallStack.cc 1226 CallStackNode *node2 = (CallStackNode *) stack2; local
1227 while (node1 != NULL && node2 != NULL)
1231 if (node1->instr->id < node2->instr->id)
1233 else if (node1->instr->id > node2->instr->id)
1236 node2 = node2->ancestor;
1238 if (node1 == NULL && node2 != NULL)
1240 else if (node1 != NULL && node2 == NULL)
  /src/external/mit/isl/dist/
isl_flow.c 2972 isl_schedule_node *node2 = second; local
2977 shared = isl_schedule_node_get_shared_ancestor(node1, node2);
2989 pos2 = isl_schedule_node_get_ancestor_child_position(node2,
3011 isl_schedule_node *node2 = second; local
3013 return isl_bool_ok(node1 == node2);
isl_schedule_node.c 245 /* Do "node1" and "node2" point to the same position in the same
249 __isl_keep isl_schedule_node *node2)
254 if (!node1 || !node2)
256 if (node1 == node2)
258 if (node1->schedule != node2->schedule)
262 n2 = isl_schedule_node_get_tree_depth(node2);
268 if (node1->child_pos[i] != node2->child_pos[i])
4606 isl_schedule_node *node2; local
4643 node2 = isl_schedule_node_copy(node);
4645 node2 = isl_schedule_node_gist(node2, isl_union_set_copy(filter))
    [all...]
  /src/sbin/fsck_udf/
main.c 167 struct udf_fsck_node *node2; member in struct:udf_fsck_overlap
659 new_overlap->node2 = NULL;
724 overlap->node2 = node;
3979 udf_node_path(overlap->node2));
  /src/external/gpl3/binutils/dist/bfd/
elfnn-loongarch.c 5278 splay_tree_node node1 = NULL, node2 = NULL; local
5293 node1->key -\ /- node2->key
5304 to the op's start; in case node2 == NULL, the chunk's end is the section's
5312 for (; node1; node1 = node2)
5317 node2 = splay_tree_successor (pdops, node1->key);
5318 bfd_vma op2_start_off = node2 ? (bfd_vma)node2->key : toaddr;
5332 if (node2 == NULL)
  /src/external/gpl3/binutils.old/dist/bfd/
elfnn-loongarch.c 4921 splay_tree_node node1 = NULL, node2 = NULL; local
4936 node1->key -\ /- node2->key
4947 to the op's start; in case node2 == NULL, the chunk's end is the section's
4955 for (; node1; node1 = node2)
4960 node2 = splay_tree_successor (pdops, node1->key);
4961 bfd_vma op2_start_off = node2 ? (bfd_vma)node2->key : toaddr;
4975 if (node2 == NULL)

Completed in 180 milliseconds

1 2