Searched refs:Edge (Results 1 - 25 of 37) sorted by relevance

12

/external/skia/include/utils/
H A DSkBoundaryPatch.h17 enum Edge { enum in class:SkBoundary
23 // Edge index goes clockwise around the boundary, beginning at the "top"
24 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
49 virtual SkPoint eval(Edge, SkScalar);
58 virtual SkPoint eval(Edge, SkScalar);
/external/llvm/include/llvm/Analysis/
H A DProfileDataLoader.h42 // The profiling information defines an Edge by its source and sink basic
44 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileDataT
47 typedef DenseMap<Edge, unsigned> EdgeWeights;
57 /// getFunction() - Returns the Function for an Edge.
58 static const FType *getFunction(Edge e) {
61 && "A ProfileData::Edge can not be between two functions");
62 assert(e.second && "A ProfileData::Edge must have a real sink");
66 /// getEdge() - Creates an Edge between two BasicBlocks.
67 static Edge getEdge(const BType *Src, const BType *Dest) {
68 return Edge(Sr
[all...]
H A DProfileInfo.h58 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileInfoT
59 typedef std::pair<Edge, double> EdgeWeight;
60 typedef std::map<Edge, double> EdgeWeights;
87 // getFunction() - Returns the Function for an Edge, checking for validity.
88 static const FType* getFunction(Edge e) {
93 llvm_unreachable("Invalid ProfileInfo::Edge");
96 // getEdge() - Creates an Edge from two BasicBlocks.
97 static Edge getEdge(const BType *Src, const BType *Dest) {
112 double getEdgeWeight(Edge e) const {
123 void setEdgeWeight(Edge
[all...]
H A DBranchProbabilityInfo.h113 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef in class:llvm::BranchProbabilityInfo
123 DenseMap<Edge, uint32_t> Weights;
H A DSparsePropagation.h131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef in class:llvm::SparseSolver
132 std::set<Edge> KnownFeasibleEdges;
/external/skia/src/core/
H A DSkRegion_path.cpp318 struct Edge { struct
329 Edge* fNext;
346 static void find_link(Edge* base, Edge* stop) {
349 if (base->fFlags == Edge::kCompleteLink) {
359 Edge* e = base;
360 if ((base->fFlags & Edge::kY0Link) == 0) {
363 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
366 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
373 if ((base->fFlags & Edge
347 SkASSERT(base < stop); if (base->fFlags == Edge::kCompleteLink) argument
[all...]
/external/llvm/lib/Analysis/
H A DProfileEstimatorPass.cpp38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) {
102 DEBUG(dbgs() << "-- Edge " << e << " is not calculated, " << M << "\n");
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) {
106 DEBUG(dbgs() << "-- Weight of Edge " << E << ":"
134 Edge edge = getEdge(*bbi,BB);
158 SmallVector<Edge, 8> ExitEdges;
159 SmallVector<Edge, 8> Edges;
183 std::set<Edge> ProcessedExit
[all...]
H A 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,
126 Edge tocalc;
132 void LoaderPass::readEdge(ProfileInfo::Edge e,
143 DEBUG(dbgs() << "--Read Edge Counter for " << e
200 for (std::set<Edge>
[all...]
H A DProfileInfo.cpp75 Edge e = getEdge(0, BB);
102 Edge e = getEdge(BB,0);
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) {
185 assert (oldw != MissingValue && "Adding weight to Edge with no previous weight");
186 DEBUG(dbgs() << "Adding to Edge " << e
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) {
223 replaceEdge(const Edge &oldedge, const Edge &newedge) {
260 Edge e = getEdge(BB,*Succ);
282 divertFlow(const Edge
[all...]
H A DProfileDataLoaderPass.cpp65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge,
94 ProfileData &PB, ProfileData::Edge e,
102 DEBUG(dbgs() << "-- Read Edge Counter for " << e
152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s));
154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight "
H A DProfileVerifierPass.cpp85 double ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge);
104 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB);
119 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi);
200 double ProfileVerifierPassT<FType, BType>::ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge E) {
203 dbgs() << "Edge " << E << " in Function "
205 ASSERTMESSAGE("Edge has missing value");
209 dbgs() << "Edge " << E << " in Function "
211 ASSERTMESSAGE("Edge has negative value");
H A DBranchProbabilityInfo.cpp196 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
229 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
492 DenseMap<Edge, uint32_t>::const_iterator I =
506 DenseMap<Edge, uint32_t>::const_iterator MapI;
/external/opencv/cvaux/src/
H A Denmin.cpp81 // struct Edge is used for storing edges of graph
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* )tempEdgePt
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h30 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 DOptimalEdgeProfiling.cpp11 // Edge profiling can give a reasonable approximation of the hot paths through a
49 return "Optimal Edge Profiler";
68 inline static void printEdgeCounter(ProfileInfo::Edge e,
71 DEBUG(dbgs() << "--Edge Counter for " << (e) << " in " \
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry);
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0);
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ);
H A DGCOVProfiling.cpp456 unsigned Edge = 0; local
465 Edge);
473 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge),
474 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge + 1));
488 Edge += Successors;
550 unsigned Edge = 0; local
559 Edge + i);
564 Edge += Successors;
/external/skia/src/gpu/
H A DGrTesselatedPathRenderer.cpp23 typedef GrTDArray<GrDrawState::Edge> GrEdgeArray;
33 static inline GrDrawState::Edge computeEdge(const GrPoint& p,
39 return GrDrawState::Edge(tangent.fX * scale,
170 const GrDrawState::Edge* edges() const { return fEdges; }
180 GrDrawState::Edge edge = computeEdge(p, q, 1.0f);
187 fEdges = new GrDrawState::Edge[count];
188 memset(fEdges, 0, count * sizeof(GrDrawState::Edge));
220 GrDrawState::Edge* fEdges;
265 static bool parallel(const GrDrawState::Edge& a, const GrDrawState::Edge
[all...]
H A DGrDrawState.h529 // @name Edge AA
582 class Edge { class in struct:GrDrawState
584 Edge() {} function in class:GrDrawState::Edge
585 Edge(float x, float y, float z) : fX(x), fY(y), fZ(z) {} function in class:GrDrawState::Edge
586 GrPoint intersect(const Edge& other) {
602 void setEdgeAAData(const Edge* edges, int numEdges) {
604 memcpy(fEdgeAAEdges, edges, numEdges * sizeof(GrDrawState::Edge));
610 const Edge* getAAEdges() const { return fEdgeAAEdges; }
800 Edge fEdgeAAEdges[kMaxEdges];
/external/chromium/chrome/browser/ui/
H A Dwindow_sizer.h137 enum Edge { TOP, LEFT, BOTTOM, RIGHT }; enum in class:WindowSizer
162 bool PositionIsOffscreen(int position, Edge edge) const;
/external/skia/src/utils/
H A DSkBoundaryPatch.cpp65 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) {
70 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) {
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A 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]].V, Q[Q.Edge[i][2]].V);
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A 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]].V, Q[Q.Edge[i][2]].V);
/external/llvm/lib/CodeGen/
H A DCriticalAntiDepBreaker.cpp523 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) {
524 const SUnit *NextSU = Edge->getSUnit();
527 if (Edge->getKind() == SDep::Anti) {
528 AntiDepReg = Edge->getReg();
H A DAggressiveAntiDepBreaker.cpp811 const SDep *Edge = Edges[i];
812 SUnit *NextSU = Edge->getSUnit();
814 if ((Edge->getKind() != SDep::Anti) &&
815 (Edge->getKind() != SDep::Output)) continue;
817 unsigned AntiDepReg = Edge->getReg();
/external/llvm/tools/llvm-prof/
H A Dllvm-prof.cpp105 std::vector<std::pair<ProfileInfo::Edge, double> > SuccCounts;
152 std::map<ProfileInfo::Edge, unsigned> EdgeFreqs;

Completed in 2598 milliseconds

12