Home
last modified time | relevance | path

Searched refs:Edge (Results 1 – 25 of 48) sorted by relevance

12

/external/opencv/cvaux/src/
Denmin.cpp86 struct Edge
198 getSizeForGraph( Edge ),
233 ( ( Edge* )newEdgePtr ) -> weight = dFunc( leftLine,
238 ( ( Edge* )newEdgePtr ) -> flow = 0;
245 ( ( Edge* )newEdgePtr ) -> weight +=
252 ( ( Edge* )tempEdgePtr ) -> weight = vFunc( alpha, beta );
253 ( ( Edge* )tempEdgePtr ) -> flow = 0;
254 ( ( Edge* )tempEdgePtr ) -> srcVtx =
256 ( ( Edge* )tempEdgePtr ) -> destVtx =
266 ( ( Edge* )newEdgePtr ) -> weight +=
[all …]
/external/skia/src/core/
DSkRegion_path.cpp326 struct Edge { struct
337 Edge* fNext; argument
354 static void find_link(Edge* base, Edge* stop) { in find_link() argument
357 if (base->fFlags == Edge::kCompleteLink) { in find_link()
367 Edge* e = base; in find_link()
368 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
371 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
374 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
381 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
384 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
/external/llvm/lib/Analysis/
DProfileEstimatorPass.cpp38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) { in printEdgeError()
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) { in printEdgeWeight()
134 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock()
158 SmallVector<Edge, 8> ExitEdges; in recurseBasicBlock()
159 SmallVector<Edge, 8> Edges; in recurseBasicBlock()
183 std::set<Edge> ProcessedExits; in recurseBasicBlock()
184 for (SmallVector<Edge, 8>::iterator ei = ExitEdges.begin(), in recurseBasicBlock()
205 Edge edge = getEdge(Latch,0); in recurseBasicBlock()
[all …]
DProfileInfo.cpp75 Edge e = getEdge(0, BB); in getExecutionCount()
102 Edge e = getEdge(BB,0); in getExecutionCount()
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) { in addEdgeWeight()
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) { in removeEdge()
223 replaceEdge(const Edge &oldedge, const Edge &newedge) { in replaceEdge()
260 Edge e = getEdge(BB,*Succ); in GetPath()
282 divertFlow(const Edge &oldedge, const Edge &newedge) { in divertFlow()
300 Edge e = getEdge(Parent,BB); in divertFlow()
325 Edge e, newedge; in replaceAllUses()
352 Edge newedge = getEdge(DestBB, DestBB); in replaceAllUses()
[all …]
DProfileInfoLoaderPass.cpp42 std::set<Edge> SpanningTree;
64 virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, double &);
65 virtual void readEdge(ProfileInfo::Edge, std::vector<unsigned>&);
97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc, in readEdgeOrRemember()
126 Edge tocalc; in recurseBasicBlock()
132 void LoaderPass::readEdge(ProfileInfo::Edge e, in readEdge()
200 for (std::set<Edge>::iterator ei = SpanningTree.begin(), in runOnModule()
211 for (std::set<Edge>::iterator ei = SpanningTree.begin(), in runOnModule()
DBranchProbabilityInfo.cpp36 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef in __anonc6246ee30111::BranchProbabilityAnalysis
38 DenseMap<Edge, uint32_t> *Weights;
131 BranchProbabilityAnalysis(DenseMap<Edge, uint32_t> *W, in BranchProbabilityAnalysis() argument
326 Edge E(Src, Dst); in getEdgeWeight()
327 DenseMap<Edge, uint32_t>::const_iterator I = Weights.find(E); in getEdgeWeight()
DProfileVerifierPass.cpp85 double ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge);
104 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB); in printDebugInfo()
119 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi); in printDebugInfo()
200 …double ProfileVerifierPassT<FType, BType>::ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge … in ReadOrAssert()
/external/llvm/include/llvm/Analysis/
DProfileInfo.h57 typedef std::pair<const BType*, const BType*> Edge; typedef
58 typedef std::pair<Edge, double> EdgeWeight;
59 typedef std::map<Edge, double> EdgeWeights;
87 static const FType* getFunction(Edge e) { in getFunction()
98 static Edge getEdge(const BType *Src, const BType *Dest) { in getEdge()
113 double getEdgeWeight(Edge e) const { in getEdgeWeight()
124 void setEdgeWeight(Edge e, double w) { in setEdgeWeight()
131 void addEdgeWeight(Edge e, double w);
142 void removeEdge(Edge e);
144 void replaceEdge(const Edge &, const Edge &);
[all …]
DBranchProbabilityInfo.h36 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef
38 DenseMap<Edge, uint32_t> Weights;
DSparsePropagation.h131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef
132 std::set<Edge> KnownFeasibleEdges;
/external/skia/include/utils/
DSkBoundaryPatch.h10 enum Edge { enum
17 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
42 virtual SkPoint eval(Edge, SkScalar);
51 virtual SkPoint eval(Edge, SkScalar);
/external/llvm/include/llvm/CompilerDriver/
DCompilationGraph.h43 class Edge : public llvm::RefCountedBaseVPTR {
45 Edge(const std::string& T) : ToolName_(T) {} in Edge() function
46 virtual ~Edge() {} in ~Edge()
55 class SimpleEdge : public Edge {
57 SimpleEdge(const std::string& T) : Edge(T) {} in SimpleEdge()
64 typedef llvm::SmallVector<llvm::IntrusiveRefCntPtr<Edge>, 3> container_type;
85 void AddEdge(Edge* E);
115 llvm::SmallVector<llvm::IntrusiveRefCntPtr<Edge>, 3> tools_vector_type;
136 int insertEdge(const std::string& A, Edge* E);
/external/llvm/lib/Transforms/Instrumentation/
DMaximumSpanningTree.h54 typedef std::pair<const T*, const T*> Edge; typedef
55 typedef std::pair<Edge, double> EdgeWeight;
58 typedef std::vector<Edge> MaxSpanTree;
77 Edge e = (*EWi).first; in MaximumSpanningTree()
86 Edge e = (*EWi).first; in MaximumSpanningTree()
DOptimalEdgeProfiling.cpp68 inline static void printEdgeCounter(ProfileInfo::Edge e, in printEdgeCounter()
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); in runOnModule()
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); in runOnModule()
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); in runOnModule()
DGCOVProfiling.cpp459 unsigned Edge = 0; in emitProfileArcs() local
468 Edge); in emitProfileArcs()
476 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge), in emitProfileArcs()
477 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge + 1)); in emitProfileArcs()
492 Edge += Successors; in emitProfileArcs()
547 unsigned Edge = 0; in buildEdgeLookupTable() local
556 Edge + i); in buildEdgeLookupTable()
561 Edge += Successors; in buildEdgeLookupTable()
/external/llvm/lib/CompilerDriver/
DCompilationGraph.cpp52 const Edge* ChooseEdge(const C& EdgesContainer, in ChooseEdge()
55 const Edge* MaxEdge = 0; in ChooseEdge()
62 const Edge* e = B->getPtr(); in ChooseEdge()
93 void Node::AddEdge(Edge* Edg) { in AddEdge()
100 llvm::IntrusiveRefCntPtr<Edge>(Edg).swap(*B); in AddEdge()
104 OutEdges.push_back(llvm::IntrusiveRefCntPtr<Edge>(Edg)); in AddEdge()
146 int CompilationGraph::insertEdge(const std::string& A, Edge* Edg) { in insertEdge()
154 ToolsMap[*InLangs].push_back(IntrusiveRefCntPtr<Edge>(Edg)); in insertEdge()
201 const Edge* Edg = ChooseEdge(CurNode->OutEdges, InLangs, CurNode->Name()); in PassThroughGraph()
243 const Edge* Edg = ChooseEdge(TV, InLangs); in FindToolChain()
[all …]
/external/llvm/lib/CodeGen/
DSplitter.h78 bool isCriticalEdge(MachineLoop::Edge &edge);
79 bool canSplitEdge(MachineLoop::Edge &edge);
80 MachineBasicBlock& splitEdge(MachineLoop::Edge &edge, MachineLoop &loop);
DSplitter.cpp74 void splitOutgoing(MachineLoop::Edge &edge) { outSplits.insert(edge); } in splitOutgoing()
91 std::set<MachineLoop::Edge> outSplits;
158 for (std::set<MachineLoop::Edge>::iterator osItr = outSplits.begin(), in applyOutgoing()
161 MachineLoop::Edge edge = *osItr; in applyOutgoing()
370 typedef SmallVector<MachineLoop::Edge, 8> ExitEdgesList; in dumpLoopInfo()
386 MachineLoop::Edge &exitEdge = *exitEdgeItr; in dumpLoopInfo()
540 bool LoopSplitter::isCriticalEdge(MachineLoop::Edge &edge) { in isCriticalEdge()
547 bool LoopSplitter::canSplitEdge(MachineLoop::Edge &edge) { in canSplitEdge()
559 MachineBasicBlock& LoopSplitter::splitEdge(MachineLoop::Edge &edge, in splitEdge()
734 typedef SmallVector<MachineLoop::Edge, 8> ExitEdgesList; in processLoopExits()
[all …]
/external/skia/gpu/include/
DGrDrawTarget.h139 class Edge {
141 Edge() {} in Edge() function
142 Edge(float x, float y, float z) : fX(x), fY(y), fZ(z) {} in Edge() function
143 GrPoint intersect(const Edge& other) { in intersect()
189 Edge fEdgeAAEdges[kMaxEdges];
562 void setEdgeAAData(const Edge* edges, int numEdges);
/external/chromium/chrome/browser/ui/
Dwindow_sizer.h137 enum Edge { TOP, LEFT, BOTTOM, RIGHT }; enum
162 bool PositionIsOffscreen(int position, Edge edge) const;
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
D3d-cube.js301 Q.Edge = [[0,1,2],[3,2,6],[7,6,5],[4,5,1],[4,0,3],[1,5,6]];
305 …for (var i = 0; i < Q.Edge.length; i++) Q.Normal[i] = CalcNormal(Q[Q.Edge[i][0]].V, Q[Q.Edge[i][1]…
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
D3d-cube.js301 Q.Edge = [[0,1,2],[3,2,6],[7,6,5],[4,5,1],[4,0,3],[1,5,6]];
305 …for (var i = 0; i < Q.Edge.length; i++) Q.Normal[i] = CalcNormal(Q[Q.Edge[i][0]].V, Q[Q.Edge[i][1]…
/external/skia/src/utils/
DSkBoundaryPatch.cpp58 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) { in eval()
63 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) { in eval()
/external/skia/gpu/src/
DGrTesselatedPathRenderer.cpp88 typedef GrTDArray<GrDrawTarget::Edge> EdgeArray;
112 GrDrawTarget::Edge edge(tangent.fX * scale, in computeEdgesAndOffsetVertices()
118 GrDrawTarget::Edge prev_edge = *edges->back(); in computeEdgesAndOffsetVertices()
120 GrDrawTarget::Edge edge = edges->at(i); in computeEdgesAndOffsetVertices()
/external/llvm/utils/TableGen/
DLLVMCConfigurationEmitter.cpp1062 const DagInit* Edge = *B; in FilterNotInGraph() local
1063 const std::string& NodeA = InitPtrToString(Edge->getArg(0)); in FilterNotInGraph()
1064 const std::string& NodeB = InitPtrToString(Edge->getArg(1)); in FilterNotInGraph()
1115 const DagInit* Edge = *B; in TypecheckGraph() local
1116 const std::string& NodeA = InitPtrToString(Edge->getArg(0)); in TypecheckGraph()
1117 const std::string& NodeB = InitPtrToString(Edge->getArg(1)); in TypecheckGraph()
1286 const DagInit& Edge = **B; in CheckForSuperfluousOptions() local
1287 if (IsOptionalEdge(Edge)) { in CheckForSuperfluousOptions()
1288 const DagInit& Weight = InitPtrToDag(Edge.getArg(2)); in CheckForSuperfluousOptions()
2763 const DagInit& Edge = **B; in EmitEdgeClasses() local
[all …]

12