Searched refs:edges (Results 1 - 6 of 6) sorted by relevance
| /freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 99 EdgeVector edges; member in class:PBQP::Graph
107 EdgeEntry& getEdge(EdgeId eId) { return edges[eId]; }
108 const EdgeEntry& getEdge(EdgeId eId) const { return edges[eId]; }
130 edges[edgeId] = e;
132 edgeId = edges.size();
133 edges.push_back(e);
184 : edgeId(edgeId), endEdgeId(g.edges.size()), freeEdges(g.freeEdges) {
232 /// \brief Get the number of edges in the graph.
233 /// @return Number of edges in the graph.
234 unsigned getNumEdges() const { return edges
[all...] |
| /freebsd-9.3-release/contrib/libpcap/ |
| H A D | optimize.c | 125 struct edge **edges; variable in typeref:struct:edge
1353 target = fold_edge(ep->succ, edges[k]);
1807 free((void *)edges);
1916 edges = (struct edge **)calloc(n_edges, sizeof(*edges));
1917 if (edges == NULL)
1955 edges[i] = &b->et;
1957 edges[n_blocks + i] = &b->ef;
|
| /freebsd-9.3-release/contrib/gcc/ |
| H A D | cfglayout.c | 653 outgoing edges. */
752 /* No fallthru implies a noreturn function with EH edges, or
1220 Created copies of N_EDGES edges in array EDGES are stored in array NEW_EDGES,
1228 edge *edges, unsigned num_edges, edge *new_edges,
1267 /* Redirect edges. */
1279 if (edges[j] && edges[j]->src == bb && edges[j]->dest == e->dest)
1217 copy_bbs(basic_block *bbs, unsigned n, basic_block *new_bbs, edge *edges, unsigned num_edges, edge *new_edges, struct loop *base, basic_block after) argument
|
| H A D | cfgloop.c | 36 /* Ratio of frequencies of edges so that one of more latch edges is
438 /* A callback for make_forwarder block, to redirect all edges except for
449 /* A callback for make_forwarder block, to redirect the latch edges into an
501 /* We could not redirect edges freely here. On the other hand,
652 /* Look for back edges where a predecessor is dominated
782 order against direction of edges from latch. Specially, if
918 /* Gets exit edges of a LOOP, returning their number in N_EDGES. */
922 edge *edges, e;
935 edges
921 edge *edges, e; local
[all...] |
| H A D | loop-unroll.c | 463 /* Peel all iterations of LOOP, remove exit edges and cancel the loop
524 /* Remove the exit edges. */
812 /* Remove the edges. */
1132 /* Remove the edges. */
1708 edge *edges = get_loop_exit_edges (loop, &num_edges); local
1729 && !(edges[0]->flags & EDGE_COMPLEX))
1731 opt_info->loop_exit = loop_split_edge_with (edges[0], NULL_RTX);
1772 free (edges);
|
| /freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| H A D | PlistDiagnostics.cpp | 173 // Emit edges.
174 Indent(o, indent) << "<key>edges</key>\n";
183 // Make the ranges of the start and end point self-consistent with adjacent edges
|
Completed in 106 milliseconds