/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | Edge.java | 37 class Edge {
class 46 * More precisely any {@link Edge} whose {@link #info} is strictly positive
74 Edge next;
|
/external/llvm/include/llvm/Analysis/ |
H A D | BranchProbabilityInfo.h | 121 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef in class:llvm::BranchProbabilityInfo 131 DenseMap<Edge, uint32_t> Weights;
|
H A D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef in class:llvm::SparseSolver 132 std::set<Edge> KnownFeasibleEdges;
|
H A D | LoopInfo.h | 213 /// Edge type. 214 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef in class:llvm::LoopBase 217 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
|
/external/skia/include/utils/ |
H A D | SkBoundaryPatch.h | 19 enum Edge { enum in class:SkBoundary 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/ |
H A D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree 31 typedef std::pair<Edge, double> EdgeWeight; 34 typedef std::vector<Edge> MaxSpanTree; 80 Edge e = (*EWi).first; 89 Edge e = (*EWi).first;
|
H A D | GCOVProfiling.cpp | 601 unsigned Edge = 0; local 609 Edge); 616 Builder.getInt64(Edge), 617 Builder.getInt64(Edge + 1)); 632 Edge += Successors; 723 unsigned Edge = 0; local 732 Edge + i); 737 Edge += Successors;
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get()) 40 class Edge class in class:nv50_ir::Graph 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; } 96 inline Edge [all...] |
H A D | 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); 125 if (kind == Edge::UNKNOWN) 158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) function in class:nv50_ir::Graph::Edge 187 if (ei.getType() == Edge::BACK || ei.getType() == Edge [all...] |
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 184 GCOVEdge *Edge = Edges.back().get(); local 185 Blocks[BlockNo]->addDstEdge(Edge); 186 Blocks[Dst]->addSrcEdge(Edge); 188 return false; // Edge flag 404 for (const GCOVEdge *Edge : SrcEdges) 405 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), "; 410 for (const GCOVEdge *Edge : DstEdges) 411 dbgs() << Edge->Dst.Number << " (" << Edge [all...] |
/external/skia/src/core/ |
H A D | SkRegion_path.cpp | 379 struct Edge { struct 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 408 SkASSERT(base < stop); if (base->fFlags == Edge::kCompleteLink) argument [all...] |
/external/compiler-rt/lib/sanitizer_common/ |
H A D | 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 { struct in class:__sanitizer::DeadlockDetector 410 Edge edges_[BV::kSize * 32];
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SampleProfile.cpp | 68 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef in namespace:__anon11084 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 in 141 SmallSet<Edge, 128> VisitedEdges; 182 /// \param E Edge to print. 183 void SampleProfileLoader::printEdgeWeight(raw_ostream &OS, Edge E) { 405 /// \param E Edge t [all...] |
H A D | SCCP.cpp | 206 typedef std::pair<BasicBlock*, BasicBlock*> Edge; typedef in class:__anon11075::SCCPSolver 207 DenseSet<Edge> KnownFeasibleEdges; 424 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second) 431 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
|
H A D | GVN.cpp | 2671 std::pair<TerminatorInst*, unsigned> Edge = toSplit.pop_back_val(); local 2672 SplitCriticalEdge(Edge.first, Edge.second,
|
/external/llvm/include/llvm/Support/ |
H A D | GCOV.h | 319 void addSrcEdge(GCOVEdge *Edge) { argument 320 assert(&Edge->Dst == this); // up to caller to ensure edge is valid 321 SrcEdges.push_back(Edge); 323 void addDstEdge(GCOVEdge *Edge) { argument 324 assert(&Edge->Src == this); // up to caller to ensure edge is valid 326 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number) 328 DstEdges.push_back(Edge);
|
/external/llvm/lib/Analysis/ |
H A D | CFLAliasAnalysis.cpp | 126 struct Edge { struct in namespace:__anon10333 133 // \brief Edge weight 141 Edge(Value *From, Value *To, EdgeType W, StratifiedAttrs A) function in struct:__anon10333::Edge 263 SmallVectorImpl<Edge> &Output; 266 GetEdgesVisitor(CFLAliasAnalysis &AA, SmallVectorImpl<Edge> &Output) 275 Output.push_back(Edge(Ptr, Ptr, EdgeType::Assign, AttrUnknown)); 280 Output.push_back(Edge(Ptr, Ptr, EdgeType::Assign, AttrUnknown)); 285 Edge(&Inst, Inst.getOperand(0), EdgeType::Assign, AttrNone)); 291 Output.push_back(Edge(&Inst, Op1, EdgeType::Assign, AttrNone)); 292 Output.push_back(Edge( 587 struct Edge { struct in class:__anon10333::WeightedBidirectionalGraph 591 Edge(const EdgeTypeT &W, const Node &N) : Weight(W), Other(N) {} function in struct:__anon10333::WeightedBidirectionalGraph::Edge [all...] |
/external/skia/src/gpu/ |
H A D | GrTessellatingPathRenderer.cpp | 95 struct Edge; 153 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex. 154 Edge* fLastEdgeAbove; // " 155 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex. 156 Edge* fLastEdgeBelow; // " 211 Edge* fHead; 212 Edge* fTail; 216 * An Edge joins a top Vertex to a bottom Vertex. Edge ordering for the list of "edges above" and 218 * Note that an Edge wil 233 struct Edge { struct in namespace:__anon13994 234 Edge(Vertex* top, Vertex* bottom, int winding) function in struct:__anon13994::Edge [all...] |
/external/opencv/cvaux/src/ |
H A D | cvlee.cpp | 2526 CvVoronoiEdgeInt Edge = {NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL}; local 2531 Edge.site = pSite; 2541 Edge.direction = _cvSeqPush(DirectionSeq,&EdgeDirection); 2544 pEdge1 = _cvSeqPush(EdgeSeq,&Edge); 2545 pEdge2 = _cvSeqPush(EdgeSeq,&Edge); 2552 pEdge1 = _cvSeqPush(EdgeSeq,&Edge); 2553 pEdge2 = _cvSeqPush(EdgeSeq,&Edge); 3081 CvVoronoiEdgeInt Edge = {NULL,pNode,pSite_right,NULL,NULL,NULL,NULL,NULL}; local 3083 pCvVoronoiEdge pEdge = &Edge; 3136 CvVoronoiEdgeInt Edge local [all...] |
/external/jarjar/lib/ |
H A D | asm-4.0.jar | META-INF/MANIFEST.MF org/objectweb/asm/AnnotationVisitor.class " package org.objectweb.asm public ... |
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | asm-3.3.jar | META-INF/MANIFEST.MF org/objectweb/asm/AnnotationVisitor.class " package org.objectweb.asm public ... |
/external/dexmaker/lib/ |
H A D | jarjar.jar | META-INF/ META-INF/MANIFEST.MF com/ com/tonicsystems/ com/tonicsystems/jarjar/ com/tonicsystems/jarjar/AbstractDepHandler ... |
H A D | mockito-core-1.9.1-SNAPSHOT.jar | META-INF/ META-INF/MANIFEST.MF org/ org/mockito/ org/mockito/asm/ org/mockito/asm/signature/ ... |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.objectweb.asm_3.2.0.v200909071300.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/robolectric/lib/test/ |
H A D | mockito-core-1.8.5.jar | META-INF/ META-INF/MANIFEST.MF org/ org/mockito/ org/mockito/asm/ org/mockito/asm/signature/ ... |