| /external/opencv/cvaux/src/ |
| D | enmin.cpp | 86 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/ |
| D | SkRegion_path.cpp | 318 struct Edge { struct
329 Edge* fNext; argument
346 static void find_link(Edge* base, Edge* stop) { in find_link() argument
349 if (base->fFlags == Edge::kCompleteLink) { in find_link()
359 Edge* e = base; in find_link()
360 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
363 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
366 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
373 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
376 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | ProfileEstimatorPass.cpp | 38 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 …]
|
| D | ProfileInfo.cpp | 75 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 …]
|
| D | ProfileInfoLoaderPass.cpp | 42 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()
|
| D | ProfileVerifierPass.cpp | 85 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()
|
| D | BranchProbabilityInfo.cpp | 472 Edge E(Src, Dst); in getEdgeWeight()
473 DenseMap<Edge, uint32_t>::const_iterator I = Weights.find(E); in getEdgeWeight()
|
| /external/llvm/include/llvm/Analysis/ |
| D | ProfileInfo.h | 58 typedef std::pair<const BType*, const BType*> Edge; typedef
59 typedef std::pair<Edge, double> EdgeWeight;
60 typedef std::map<Edge, double> EdgeWeights;
88 static const FType* getFunction(Edge e) { in getFunction()
97 static Edge getEdge(const BType *Src, const BType *Dest) { in getEdge()
112 double getEdgeWeight(Edge e) const { in getEdgeWeight()
123 void setEdgeWeight(Edge e, double w) { in setEdgeWeight()
130 void addEdgeWeight(Edge e, double w);
141 void removeEdge(Edge e);
143 void replaceEdge(const Edge &, const Edge &);
[all …]
|
| D | BranchProbabilityInfo.h | 95 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge; typedef
105 DenseMap<Edge, uint32_t> Weights;
|
| D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef
132 std::set<Edge> KnownFeasibleEdges;
|
| /external/skia/src/gpu/ |
| D | GrTesselatedPathRenderer.cpp | 23 typedef GrTDArray<GrDrawState::Edge> GrEdgeArray;
33 static inline GrDrawState::Edge computeEdge(const GrPoint& p, in computeEdge()
39 return GrDrawState::Edge(tangent.fX * scale, in computeEdge()
170 const GrDrawState::Edge* edges() const { return fEdges; } in edges()
180 GrDrawState::Edge edge = computeEdge(p, q, 1.0f); in addEdge()
187 fEdges = new GrDrawState::Edge[count]; in begin()
188 memset(fEdges, 0, count * sizeof(GrDrawState::Edge)); in begin()
220 GrDrawState::Edge* fEdges;
265 static bool parallel(const GrDrawState::Edge& a, const GrDrawState::Edge& b) { in parallel()
302 static bool validEdge(const GrDrawState::Edge& edge) { in validEdge()
[all …]
|
| D | GrDrawState.h | 582 class Edge {
584 Edge() {} in Edge() function
585 Edge(float x, float y, float z) : fX(x), fY(y), fZ(z) {} in Edge() function
586 GrPoint intersect(const Edge& other) { in intersect()
602 void setEdgeAAData(const Edge* edges, int numEdges) { in setEdgeAAData()
604 memcpy(fEdgeAAEdges, edges, numEdges * sizeof(GrDrawState::Edge)); in setEdgeAAData()
610 const Edge* getAAEdges() const { return fEdgeAAEdges; } in getAAEdges()
800 Edge fEdgeAAEdges[kMaxEdges];
|
| /external/skia/include/utils/ |
| D | SkBoundaryPatch.h | 17 enum Edge { enum
24 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
49 virtual SkPoint eval(Edge, SkScalar);
58 virtual SkPoint eval(Edge, SkScalar);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | MaximumSpanningTree.h | 54 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()
|
| D | OptimalEdgeProfiling.cpp | 68 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()
|
| D | GCOVProfiling.cpp | 455 unsigned Edge = 0; in emitProfileArcs() local
464 Edge); in emitProfileArcs()
472 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge), in emitProfileArcs()
473 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge + 1)); in emitProfileArcs()
487 Edge += Successors; in emitProfileArcs()
543 unsigned Edge = 0; in buildEdgeLookupTable() local
552 Edge + i); in buildEdgeLookupTable()
557 Edge += Successors; in buildEdgeLookupTable()
|
| /external/chromium/chrome/browser/ui/ |
| D | window_sizer.h | 137 enum Edge { TOP, LEFT, BOTTOM, RIGHT }; enum
162 bool PositionIsOffscreen(int position, Edge edge) const;
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| D | 3d-cube.js | 301 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.1/ |
| D | 3d-cube.js | 301 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/ |
| D | SkBoundaryPatch.cpp | 65 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) { in eval()
70 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) { in eval()
|
| /external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/Post/ |
| D | CartoonEdge.j3md | 1 MaterialDef Cartoon Edge {
|
| /external/llvm/lib/CodeGen/ |
| D | CriticalAntiDepBreaker.cpp | 546 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
547 const SUnit *NextSU = Edge->getSUnit(); in BreakAntiDependencies()
550 if (Edge->getKind() == SDep::Anti) { in BreakAntiDependencies()
551 AntiDepReg = Edge->getReg(); in BreakAntiDependencies()
|
| D | AggressiveAntiDepBreaker.cpp | 816 const SDep *Edge = Edges[i]; in BreakAntiDependencies() local
817 SUnit *NextSU = Edge->getSUnit(); in BreakAntiDependencies()
819 if ((Edge->getKind() != SDep::Anti) && in BreakAntiDependencies()
820 (Edge->getKind() != SDep::Output)) continue; in BreakAntiDependencies()
822 unsigned AntiDepReg = Edge->getReg(); in BreakAntiDependencies()
|
| /external/llvm/tools/llvm-prof/ |
| D | llvm-prof.cpp | 105 std::vector<std::pair<ProfileInfo::Edge, double> > SuccCounts; in emitBasicBlockEndAnnot()
152 std::map<ProfileInfo::Edge, unsigned> EdgeFreqs; in runOnModule()
|
| /external/webkit/Source/WebCore/svg/ |
| D | SVGFEConvolveMatrixElement.idl | 34 // Edge Mode Values
|