| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| Edge.java | 33 * An edge in the control flow graph of a method body. See {@link Label Label}.
37 class Edge {
40 * Denotes a normal control flow graph edge.
45 * Denotes a control flow graph edge corresponding to an exception handler.
46 * More precisely any {@link Edge} whose {@link #info} is strictly positive
54 * Information about this control flow graph edge. If
56 * stack size in the basic block from which this edge originates. This size
57 * is equal to the stack size at the "jump" instruction to which this edge
60 * this field is the kind of this control flow graph edge (i.e. NORMAL or
66 * The successor block of the basic block from which this edge originates.
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 31 /// probabilities of each "edge" in the function's CFG where such an edge is
33 /// probability of an edge from one block is always relative to the
37 /// identify an edge, since we can have multiple edges from Src to Dst.
52 /// \brief Get an edge's probability, relative to other out-edges of the Src.
55 /// (0%) and one (100%) of this edge executing, relative to other edges
67 /// \brief Test if an edge is hot relative to other out-edges of the Src.
69 /// Check whether this edge out of the source block is 'hot'. We define hot
79 /// \brief Print an edge's probability.
81 /// Retrieves an edge's probability similarly to \see getEdgeProbability, bu
[all...] |
| SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge;
132 std::set<Edge> KnownFeasibleEdges;
165 /// isEdgeFeasible - Return true if the control flow edge from the 'From'
|
| LoopInfo.h | 213 /// Edge type.
214 typedef std::pair<const BlockT*, const BlockT*> Edge;
217 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
220 /// loop has a preheader if there is only one edge to the header of the loop
|
| /external/skia/include/utils/ |
| SkBoundaryPatch.h | 19 enum Edge {
25 // Edge index goes clockwise around the boundary, beginning at the "top"
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge;
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
50 // Equal edge weights: break ties by comparing block sizes.
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
93 // So we know now that the edge is not already in a subtree, so we push
94 // the edge to the MST.
|
| GCOVProfiling.cpp | 1 //===- GCOVProfiling.cpp - Insert edge counters for gcov profiling --------===//
601 unsigned Edge = 0;
609 Edge);
616 Builder.getInt64(Edge),
617 Builder.getInt64(Edge + 1));
632 Edge += Successors;
710 // the whole-Module pred edge# between the time we set it and the time we next
723 unsigned Edge = 0;
732 Edge + i);
737 Edge += Successors
[all...] |
| /external/llvm/lib/IR/ |
| GCOV.cpp | 184 GCOVEdge *Edge = Edges.back().get();
185 Blocks[BlockNo]->addDstEdge(Edge);
186 Blocks[Dst]->addSrcEdge(Edge);
188 return false; // Edge flag
303 // required to combine the edge counts that are contained in the GCDA file.
373 /// addCount - Add to block counter while storing the edge count. If the
404 for (const GCOVEdge *Edge : SrcEdges)
405 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), ";
410 for (const GCOVEdge *Edge : DstEdges
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| infoflow.py | 245 edge = Edge(self.subG, source, target)
246 yield step_output(source, target, edge.rules)
283 edge = Edge(self.subG, path[s - 1], path[s])
284 yield step_output(edge.source, edge.target, edge.rules)
319 edge = Edge(self.G, s, t, create=True
[all...] |
| dta.py | 213 edge = Edge(self.subG, source, target)
221 edge.transition,
222 self.__generate_entrypoints(edge),
223 edge.setexec,
224 edge.dyntransition,
225 edge.setcurrent)
246 def __generate_entrypoints(edge):
261 for e in edge.entrypoint:
262 yield entrypoint_output(e, edge.entrypoint[e], edge.execute[e], edge.type_transition[e]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/setools/ |
| infoflow.py | 245 edge = Edge(self.subG, source, target)
246 yield step_output(source, target, edge.rules)
283 edge = Edge(self.subG, path[s - 1], path[s])
284 yield step_output(edge.source, edge.target, edge.rules)
319 edge = Edge(self.G, s, t, create=True
[all...] |
| dta.py | 213 edge = Edge(self.subG, source, target)
221 edge.transition,
222 self.__generate_entrypoints(edge),
223 edge.setexec,
224 edge.dyntransition,
225 edge.setcurrent)
246 def __generate_entrypoints(edge):
261 for e in edge.entrypoint:
262 yield entrypoint_output(e, edge.entrypoint[e], edge.execute[e], edge.type_transition[e]
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); }
67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
68 Edge *prev[2];
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
95 inline Edge *getEdge() const { return e;
[all...] |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_deadlock_detector.h | 253 Edge e = {(u16)added_edges[i], (u16)cur_idx,
258 // Printf("Edge%zd: %u %zd=>%zd in T%d\n",
396 struct Edge {
410 Edge edges_[BV::kSize * 32];
|
| /external/llvm/lib/Transforms/Scalar/ |
| SampleProfile.cpp | 18 // to indicate the weights of each edge coming out of the branch.
19 // The weight of each edge is the weight of the target block for
20 // that edge. The weight of a block B is computed as the maximum
63 "sample block/edge weights through the CFG."));
68 typedef std::pair<BasicBlock *, BasicBlock *> Edge;
69 typedef DenseMap<Edge, unsigned> EdgeWeightMap;
108 void printEdgeWeight(raw_ostream &OS, Edge E);
117 unsigned visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
133 /// Edge weights are computed by propagating basic block weights i
[all...] |
| SCCP.cpp | 206 typedef std::pair<BasicBlock*, BasicBlock*> Edge;
207 DenseSet<Edge> KnownFeasibleEdges;
424 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
425 return; // This edge is already known to be executable!
428 // If the destination is already executable, we just made an *edge*
431 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
446 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
581 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
590 // Check to make sure this edge itself is actually feasible now.
599 // undef conditions mean that neither edge is feasible yet
[all...] |
| GVN.cpp | [all...] |
| /external/skia/src/core/ |
| SkRegion_path.cpp | 379 struct Edge {
390 Edge* fNext;
407 static void find_link(Edge* base, Edge* stop) {
410 if (base->fFlags == Edge::kCompleteLink) {
420 Edge* e = base;
421 if ((base->fFlags & Edge::kY0Link) == 0) {
424 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
427 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
434 if ((base->fFlags & Edge::kY1Link) == 0)
[all...] |
| /system/core/libpixelflinger/ |
| trap.cpp | 604 // the following routine fills a triangle via edge stepping, which
631 struct Edge
633 int32_t x; // edge position in 16.16 coordinates
640 edge_dump( Edge* edge )
643 edge->y_top, edge->y_top/float(TRI_ONE),
644 edge->y_bot, edge->y_bot/float(TRI_ONE),
645 edge->x, edge->x/float(FIXED_ONE)
672 Edge* edge = edges + *pcount; local
862 AAEdge* edge = edges + *pcount; local
[all...] |
| /external/llvm/lib/Analysis/ |
| CFLAliasAnalysis.cpp | 16 // memory location, and each edge is an action that happened on that memory
22 // the edge labels (actions) conforms to a context-free grammar.
112 // The edge used when we have an edge going from some handle to a Value.
118 // The edge used when our edge goes from a value to a handle that may have
126 struct Edge {
127 // \brief Which value the edge is coming from
130 // \brief Which value the edge is pointing to
133 // \brief Edge weigh
[all...] |
| /external/skia/src/gpu/ |
| GrTessellatingPathRenderer.cpp | 38 * Stages (4) and (5) use an active edge list, which a list of all edges for which the
47 * not exact and may violate the mesh topology or active edge list ordering. We
51 * A) Intersections may cause a shortened edge to no longer be ordered with respect to its
54 * B) Intersections may cause an edge to violate the left-to-right ordering of the
55 * active edge list. This is handled by splitting the neighbour edge on the
57 * C) Shortening an edge may cause an active edge to become inactive or an inactive edge
58 * to become active. This is handled by removing or inserting the edge in the activ
1016 Edge* edge = new_edge(v->fPrev, v, alloc, c); local
[all...] |
| /external/opencv/cvaux/src/ |
| cvlee.cpp | 199 // (site is an edge of polygon or a reflex vertex).
[all...] |
| /external/jarjar/lib/ |
| asm-4.0.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| asm-3.3.jar | |
