HomeSort by: relevance | last modified time | path
    Searched defs:add_node (Results 1 - 17 of 17) sorted by relevancy

  /src/usr.bin/ctags/
tree.c 53 static void add_node(NODE *, NODE *);
97 add_node(np, head);
101 add_node(NODE *node, NODE *cur_node) function
119 add_node(node, cur_node->left);
124 add_node(node, cur_node->right);
  /src/external/lgpl2/userspace-rcu/dist/doc/examples/urcu-flavors/
bp.c 31 int add_node(uint64_t v) function
60 ret = add_node(values[i]);
mb.c 32 int add_node(uint64_t v) function
70 ret = add_node(values[i]);
membarrier.c 32 int add_node(uint64_t v) function
70 ret = add_node(values[i]);
qsbr.c 31 int add_node(uint64_t v) function
69 ret = add_node(values[i]);
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
feasible-graph.cc 169 feasible_graph::add_node (const exploded_node *enode, function in class:ana::feasible_graph
176 digraph<fg_traits>::add_node (fnode);
191 digraph<fg_traits>::add_node (dst_fnode);
supergraph.cc 167 supernode *node_for_stmts = add_node (fun, bb, NULL, phi_nodes (bb));
190 node_for_stmts = add_node (fun, bb, as_a <gcall *> (stmt),
204 node_for_stmts = add_node (fun, bb, call, NULL);
497 supergraph::add_node (function *fun, basic_block bb, gcall *returning_call, function in class:ana::supergraph
diagnostic-manager.cc 230 void add_node (feasible_node *fnode) function in class:ana::feasible_worklist
404 feasible_node *origin = fg.add_node (m_eg.get_origin (), init_state, 0);
405 worklist.add_node (origin);
501 = fg->add_node (succ_eedge->m_dest,
524 worklist->add_node (succ_fnode);
  /src/external/gpl3/gcc/dist/gcc/analyzer/
feasible-graph.cc 193 feasible_graph::add_node (const exploded_node *enode, function in class:ana::feasible_graph
200 digraph<fg_traits>::add_node (fnode);
214 digraph<fg_traits>::add_node (dst_fnode);
supergraph.cc 168 supernode *node_for_stmts = add_node (fun, bb, NULL, phi_nodes (bb));
195 node_for_stmts = add_node (fun, bb, as_a <gcall *> (stmt),
209 node_for_stmts = add_node (fun, bb, call, NULL);
503 supergraph::add_node (function *fun, basic_block bb, gcall *returning_call, function in class:ana::supergraph
diagnostic-manager.cc 243 void add_node (feasible_node *fnode) function in class:ana::feasible_worklist
422 feasible_node *origin = fg.add_node (m_eg.get_origin (), init_state, 0);
423 worklist.add_node (origin);
525 = fg->add_node (succ_eedge->m_dest,
555 worklist->add_node (succ_fnode);
  /src/external/gpl3/gcc/dist/gcc/
digraph.h 101 void add_node (node_t *node);
117 added to it at the start of dumping, via calls to add_node.
134 virtual void add_node (node_t *node) = 0;
167 root_cluster->add_node (n);
228 digraph<GraphTraits>::add_node (node_t *node) function in class:digraph
  /src/external/gpl3/gcc.old/dist/gcc/
digraph.h 101 void add_node (node_t *node);
117 added to it at the start of dumping, via calls to add_node.
134 virtual void add_node (node_t *node) = 0;
167 root_cluster->add_node (n);
228 digraph<GraphTraits>::add_node (node_t *node) function in class:digraph
  /src/sys/dev/pci/
if_iwnvar.h 190 int (*add_node)(struct iwn_softc *, struct iwn_node_info *, member in struct:iwn_ops
  /src/external/gpl2/groff/dist/src/roff/troff/
env.cpp 336 void environment::add_node(node *n) function in class:environment
438 add_node(new word_space_node(x, get_fill_color(), w));
471 add_node(new word_space_node(x,
506 add_node(do_underline_special(1));
508 add_node(do_underline_special(0));
1496 curenv->add_node(do_underline_special(0));
1507 curenv->add_node(do_underline_special(1));
1682 add_node(new transparent_dummy_node);
1696 add_node(do_underline_special(0));
2201 add_node(new transparent_dummy_node)
    [all...]
  /src/external/mit/isl/dist/
isl_ast_codegen.c 1408 * from intersecting "executed" with "bounds" in add_node.
1816 static __isl_give isl_ast_graft_list *add_node( function
1947 * "executed" and "build" are extra arguments to be passed to add_node.
2005 data->list = add_node(data->list,
2084 return add_node(data.list, isl_union_map_copy(executed),
3256 data->list = add_node(data->list, isl_union_map_copy(data->executed),
isl_scheduler.c 972 static isl_stat add_node(struct isl_sched_graph *graph, function
1053 return add_node(graph, set, nvar, 0, NULL, NULL, NULL);
1069 return add_node(graph, set, nvar, 1, hull_set, compress, decompress);

Completed in 59 milliseconds