/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | ProfileEstimatorPass.cpp | 159 SmallVector<Edge, 8> Edges; local 189 Edges.push_back(*ei); 202 if (Edges.size() == 0) { 218 double fraction = floor(incoming/Edges.size()); 219 for (SmallVector<Edge, 8>::iterator ei = Edges.begin(), ee = Edges.end(); 260 Edges.clear(); 278 Edges.push_back(edge); 289 double fraction = floor(BBWeight/Edges.size()); 292 for (SmallVector<Edge, 8>::iterator ei = Edges [all...] |
H A D | ProfileInfo.cpp | 421 std::set<Edge> Edges; local 426 Edges.insert(old); 429 for (std::set<Edge>::iterator EI = Edges.begin(), EE = Edges.end(); 450 DEBUG(dbgs() << "Splitting " << NumPreds << " Edges from " << BB->getName() 664 // The set of return edges (Edges with no successors).
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 188 EdgeVector Edges; member in class:llvm::PBQP::Graph 202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } 203 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } 225 Edges[EId] = std::move(E); 227 EId = Edges.size(); 228 Edges.push_back(std::move(E)); 280 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { 320 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } 321 bool empty() const { return G.Edges.empty(); } 323 return G.Edges [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | LazyCallGraph.h | 207 mutable EdgeVectorT Edges; member in class:llvm::LazyCallGraph::Edge::Node 210 /// Basic constructor implements the scanning of F into Edges and 240 return edge_iterator(Edges.begin(), Edges.end()); 242 edge_iterator end() const { return edge_iterator(Edges.end(), Edges.end()); } 244 const Edge &operator[](int i) const { return Edges[i]; } 247 return Edges[EdgeIndexMap.find(&F)->second]; 252 return call_edge_iterator(Edges.begin(), Edges [all...] |
H A D | BlockFrequencyInfoImpl.h | 563 std::deque<const IrrNode *> Edges; member in struct:llvm::bfi_detail::IrreducibleGraph::IrrNode 567 iterator pred_begin() const { return Edges.begin(); } 568 iterator succ_begin() const { return Edges.begin() + NumIn; } 570 iterator succ_end() const { return Edges.end(); }
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 137 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; local 138 FindFunctionBackedges(F, Edges); 140 for (unsigned i = 0, e = Edges.size(); i != e; ++i) 141 LoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second));
|
H A D | JumpThreading.cpp | 342 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; local 343 FindFunctionBackedges(F, Edges); 345 for (const auto &Edge : Edges)
|
/external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
H A D | graphcycles_test.cc | 40 typedef std::vector<Edge> Edges; typedef 43 static bool IsReachable(Edges *edges, int from, int to, 68 static void PrintEdges(Edges *edges) { 92 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, 123 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, 146 static void CheckEdges(Nodes *nodes, Edges *edges, 183 static int RandomEdge(std::mt19937 *rnd, Edges *edges) { 189 static int EdgeIndex(Edges *edges, int from, int to) { 200 Edges edges; // from, to
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | GCOV.h | 189 void addEdge(uint32_t N) { Edges.push_back(N); } 197 SmallVector<uint32_t, 16> Edges; member in class:llvm::GCOVBlock
|
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
H A D | GCOV.cpp | 174 Edges.clear(); 196 if (!Edges.empty()) { 198 for (SmallVector<uint32_t, 16>::iterator I = Edges.begin(), E = Edges.end();
|
/external/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, argument 37 EdgeIndexMap.insert({&F, Edges.size()}).second) { 39 Edges.emplace_back(LazyCallGraph::Edge(F, EK)); 45 SmallVectorImpl<LazyCallGraph::Edge> &Edges, 51 addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref); 81 addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph::Edge::Call); 93 findReferences(Worklist, Visited, Edges, EdgeIndexMap); 100 EdgeIndexMap.insert({&Target, Edges.size()}); 101 Edges.emplace_back(Target, EK); 105 EdgeIndexMap.insert({&TargetN.getFunction(), Edges 43 findReferences(SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, SmallVectorImpl<LazyCallGraph::Edge> &Edges, DenseMap<Function *, int> &EdgeIndexMap) argument [all...] |
H A D | CFLGraph.h | 48 EdgeList Edges; member in struct:llvm::cflaa::CFLGraph::NodeInfo 115 FromInfo->Edges.push_back(Edge{To});
|
H A D | CFLSteensAliasAnalysis.cpp | 231 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges)
|
H A D | BlockFrequencyInfoImpl.cpp | 616 Irr.Edges.push_back(&SuccIrr); 617 SuccIrr.Edges.push_front(&Irr);
|
/external/llvm/lib/CodeGen/ |
H A D | AggressiveAntiDepBreaker.cpp | 250 /// AntiDepEdges - Return in Edges the anti- and output- dependencies 252 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { 258 Edges.push_back(&*P); 815 std::vector<const SDep *> Edges; 817 AntiDepEdges(PathSU, Edges); 833 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { 834 const SDep *Edge = Edges[i];
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | AggressiveAntiDepBreaker.cpp | 276 /// AntiDepEdges - Return in Edges the anti- and output- dependencies 278 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { 285 Edges.push_back(&*P); 794 std::vector<const SDep *> Edges; 796 AntiDepEdges(PathSU, Edges); 812 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { 813 const SDep *Edge = Edges[i];
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | PGOInstrumentation.cpp | 447 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { argument 449 for (auto &E : Edges) { 511 void setEdgeCount(DirectEdges &Edges, uint64_t Value); 570 // unknown edge in Edges vector. 571 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { argument 572 for (auto &E : Edges) {
|
H A D | GCOVProfiling.cpp | 598 unsigned Edges = 0; local 602 ++Edges; 604 Edges += TI->getNumSuccessors(); 608 ArrayType::get(Type::getInt64Ty(*Ctx), Edges);
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 433 unsigned Edges = 0; local 437 ++Edges; 439 Edges += TI->getNumSuccessors(); 443 ArrayType::get(Type::getInt64Ty(*Ctx), Edges);
|
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 184 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); 185 GCOVEdge *Edge = Edges.back().get(); 408 dbgs() << "\tSource Edges : "; 414 dbgs() << "\tDestination Edges : ";
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 277 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; local 278 FindFunctionBackedges(F, Edges); 280 for (unsigned i = 0, e = Edges.size(); i != e; ++i) 281 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second));
|
/external/llvm/include/llvm/Support/ |
H A D | GCOV.h | 293 SmallVector<std::unique_ptr<GCOVEdge>, 16> Edges; member in class:llvm::GCOVFunction
|
/external/ImageMagick/www/api/ |
H A D | morphology.php | 254 <dd> Peak:radius1,radius2 Find any peak larger than the pixels the fall between the two radii. The default ring of pixels is as per "Ring". Edges Find flat orthogonal edges of a binary shape Corners Find 90 degree corners of a binary shape Diagonals:type A special kernel to thin the 'outside' of diagonals LineEnds:type Find end points of lines (for pruning a skeletion) Two types of lines ends (default to both) can be searched for Type 0: All line ends Type 1: single kernel for 4-conneected line ends Type 2: single kernel for simple line ends LineJunctions Find three line junctions (within a skeletion) Type 0: all line junctions Type 1: Y Junction kernel Type 2: Diagonal T Junction kernel Type 3: Orthogonal T Junction kernel Type 4: Diagonal X Junction kernel Type 5: Orthogonal + Junction kernel Ridges:type Find single pixel ridges or thin lines Type 1: Fine single pixel thick lines and ridges Type 2: Find two pixel thick lines and ridges ConvexHull Octagonal Thickening Kernel, to generate convex hulls of 45 degrees Skeleton:type Traditional skeleton generating kernels. Type 1: Tradional Skeleton kernel (4 connected skeleton) Type 2: HIPR2 Skeleton kernel (8 connected skeleton) Type 3: Thinning skeleton based on a ressearch paper by Dan S. Bloomberg (Default Type) ThinSE:type A huge variety of Thinning Kernels designed to preserve conectivity. many other kernel sets use these kernels as source definitions. Type numbers are 41-49, 81-89, 481, and 482 which are based on the super and sub notations used in the source research paper. </dd>
|