| /external/chromium_org/components/url_matcher/ |
| substring_set_matcher.h | 71 // The Aho Corasick algorithm improves this runtime by using failure edges.
85 typedef std::map<char, uint32> Edges;
97 const Edges& edges() const { return edges_; } function in class:url_matcher::SubstringSetMatcher::AhoCorasickNode
107 // Outgoing edges of current node.
108 Edges edges_;
|
| substring_set_matcher.cc | 34 // For the subsequent patterns, only count the edges which were not counted
191 typedef AhoCorasickNode::Edges Edges;
197 const Edges& root_edges = root.edges();
198 for (Edges::const_iterator e = root_edges.begin(); e != root_edges.end();
208 for (Edges::const_iterator e = current_node.edges().begin();
209 e != current_node.edges().end(); ++e) {
255 Edges::const_iterator i = edges_.find(c)
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 185 EdgeVector Edges;
193 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
194 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
216 Edges[EId] = std::move(E);
218 EId = Edges.size();
219 Edges.push_back(std::move(E));
265 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) {
305 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); }
306 bool empty() const { return G.Edges.empty(); }
308 return G.Edges.size() - G.FreeEdgeIds.size()
[all...] |
| /external/llvm/lib/CodeGen/ |
| AggressiveAntiDepBreaker.cpp | 258 /// AntiDepEdges - Return in Edges the anti- and output- dependencies
260 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) {
267 Edges.push_back(&*P);
287 // other types of edges.
763 // Attempt to break anti-dependence edges. Walk the instructions
784 // The dependence edges that represent anti- and output-
786 std::vector<const SDep *> Edges;
788 AntiDepEdges(PathSU, Edges);
804 for (unsigned i = 0, e = Edges.size(); i != e; ++i) {
805 const SDep *Edge = Edges[i]
[all...] |
| /external/chromium_org/courgette/ |
| adjustment_method.cc | 144 typedef std::map<LabelInfo*, Node*> Edges;
145 Edges edges_;
276 // Compare frequencies of unassigned edges, and either make
513 Node::Edges::iterator e = m_parent->edges_.find(m_label);
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
| GraphicsContext.h | 363 typedef unsigned Edges;
364 void drawInnerShadow(const RoundedRect&, const Color& shadowColor, const IntSize shadowOffset, int shadowBlur, int shadowSpread, Edges clippedEdges = NoEdge);
|
| GraphicsContext.cpp | 624 void GraphicsContext::drawInnerShadow(const RoundedRect& rect, const Color& shadowColor, const IntSize shadowOffset, int shadowBlur, int shadowSpread, Edges clippedEdges)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 214 ExitMap Exits; ///< Successor edges (and weights).
275 /// there are no irreducilbe edges to Node, then it will have complexity
323 /// All edges in the original function are 32-bit. However, exit edges from
366 /// Combines multiple edges to the same \a Weight::TargetNode and scales
388 /// \brief Add all edges out of a packaged loop to the distribution.
390 /// Adds all edges from LocalLoopHead to Dist. Calls addToDist() to add each
528 /// graphs for most edges, but getting others from \a LoopData::ExitMap. The
544 std::deque<const IrrNode *> Edges;
548 iterator pred_begin() const { return Edges.begin();
[all...] |
| /external/llvm/lib/Analysis/ |
| BlockFrequencyInfoImpl.cpp | 143 // Sort so edges to the same node are adjacent.
148 // Combine adjacent edges.
569 Irr.Edges.push_back(&SuccIrr);
570 SuccIrr.Edges.push_front(&Irr);
633 // Skip forward edges.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda"
99 // Modify the program to track transitions along edges and call into the
114 // pred block number for certain non-trivial edges.
242 // function, number of lines belonging to each block, and a set of edges to
302 // set of blocks and a map of edges between blocks. This is the only GCOV
382 // Emit edges between blocks.
582 unsigned Edges = 0;
586 ++Edges;
588 Edges += TI->getNumSuccessors();
592 ArrayType::get(Type::getInt64Ty(*Ctx), Edges);
[all...] |
| /external/llvm/include/llvm/Support/ |
| GCOV.h | 288 SmallVector<std::unique_ptr<GCOVEdge>, 16> Edges;
|
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 166 // back edges. This works for normal cases but not for unreachable blocks as
184 // edges which simplifies the CFG.
298 /// edges across a loop header. For example, threading a jump from outside the
307 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges;
308 FindFunctionBackedges(F, Edges);
310 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
311 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second));
[all...] |
| /external/llvm/lib/IR/ |
| GCOV.cpp | 143 // read edges.
158 Edges.push_back(make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst]));
159 GCOVEdge *Edge = Edges.back().get();
267 errs() << "Unexpected number of edges (in " << Name << ").\n";
274 errs() << "Unexpected number of edges (in " << Name << ").\n";
330 /// destination has no outgoing edges, also update that block's count too.
339 /// sortDstEdges - Sort destination edges by block number, nop if already
360 dbgs() << "\tSource Edges : ";
368 dbgs() << "\tDestination Edges : ";
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderBoxModelObject.cpp | 2402 BorderEdge edges[4]; local
[all...] |
