Searched refs:cgraph_nodes (Results 1 - 14 of 14) sorted by relevance

/freebsd-9.3-release/contrib/gcc/
H A Dipa.c45 for (node = cgraph_nodes; node; node = node->next)
47 for (node = cgraph_nodes; node; node = node->next)
86 for (node = cgraph_nodes; node; node = node->next)
110 for (node = cgraph_nodes; node; node = node->next)
113 for (node = cgraph_nodes; node; node = node->next)
154 for (node = cgraph_nodes; node; node = next)
205 for (node = cgraph_nodes; node; node = node->next)
H A Dipa-prop.c101 for (node = cgraph_nodes; node; node = node->next)
527 for (node = cgraph_nodes; node; node = node->next)
538 for (node = cgraph_nodes; node; node = node->next)
549 for (node = cgraph_nodes; node; node = node->next)
563 for (node = cgraph_nodes; node; node = node->next)
578 for (node = cgraph_nodes; node; node = node->next)
607 for (node = cgraph_nodes; node; node = node->next)
632 for (node = cgraph_nodes; node; node = node->next)
H A Dipa-cp.c384 for (node = cgraph_nodes; node; node = node->next)
519 for (node = cgraph_nodes; node; node = node->next)
527 for (node = cgraph_nodes; node; node = node->next)
557 for (node = cgraph_nodes; node; node = node->next)
647 for (node = cgraph_nodes; node; node = node->next)
687 for (node = cgraph_nodes; node; node = node->next)
701 for (node = cgraph_nodes; node; node = node->next)
716 for (node = cgraph_nodes; node; node = node->next)
737 for (node = cgraph_nodes; node; node = node->next)
790 for (node = cgraph_nodes; nod
[all...]
H A Dcgraphunit.c428 for (n = cgraph_nodes; n; n = next)
849 for (node = cgraph_nodes; node; node = node->next)
1004 for (node = cgraph_nodes; node != first; node = node->next)
1086 first_processed = cgraph_nodes;
1092 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
1133 first_processed = cgraph_nodes;
1142 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
1152 for (node = cgraph_nodes; node != first_analyzed; node = next)
1177 first_analyzed = cgraph_nodes;
1188 for (node = cgraph_nodes; nod
[all...]
H A Dcgraph.c111 struct cgraph_node *cgraph_nodes; variable in typeref:struct:cgraph_node
185 node->next = cgraph_nodes;
188 if (cgraph_nodes)
189 cgraph_nodes->previous = node;
192 cgraph_nodes = node;
289 for (node = cgraph_nodes; node ; node = node->next)
552 cgraph_nodes = node->next;
780 for (node = cgraph_nodes; node; node = node->next)
H A Dcgraph.h243 extern GTY(()) struct cgraph_node *cgraph_nodes; variable in typeref:struct:cgraph_node
H A Dipa-utils.c47 cgraph_nodes that has COUNT useful nodes in it. */
79 has been customized for cgraph_nodes. The env parameter is because
173 for (node = cgraph_nodes; node; node = node->next)
H A Dipa-inline.c680 for (node = cgraph_nodes; node != master_clone;
730 for (node = cgraph_nodes; node; node = node->next)
908 for (node = cgraph_nodes; node; node = node->next)
943 for (node = cgraph_nodes; node; node = node->next)
1192 for (node = cgraph_nodes; node; node = node->next)
1218 for (node = cgraph_nodes; node; node = node->next)
H A Dipa-pure-const.c624 for (node = cgraph_nodes; node; node = node->next)
745 for (node = cgraph_nodes; node; node = node->next)
H A Dipa-reference.c758 for (node = cgraph_nodes; node; node = node->next)
922 for (node = cgraph_nodes; node; node = node->next)
1294 for (node = cgraph_nodes; node; node = node->next)
H A Dpasses.c950 for (node = cgraph_nodes; node; node = node->next)
H A Dipa-type-escape.c1697 for (node = cgraph_nodes; node; node = node->next)
H A Dtree-ssa-structalias.c5053 for (node = cgraph_nodes; node; node = node->next)
5069 for (node = cgraph_nodes; node; node = node->next)
/freebsd-9.3-release/contrib/gcc/cp/
H A Ddecl2.c3019 for (node = cgraph_nodes; node ; node = node->next)

Completed in 122 milliseconds