| /external/chromium_org/extensions/common/matcher/ |
| substring_set_matcher.h | 70 // The Aho Corasick algorithm improves this runtime by using failure edges.
84 typedef std::map<char, uint32> Edges;
96 const Edges& edges() const { return edges_; } function in class:extensions::SubstringSetMatcher::AhoCorasickNode
106 // Outgoing edges of current node.
107 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/Support/ |
| GCOV.h | 191 void addEdge(uint32_t N) { Edges.push_back(N); }
199 SmallVector<uint32_t, 16> Edges;
|
| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 113 // weight of the incoming edges must be equal the block weight which must in
114 // turn be equal to the sume of the weights of the outgoing edges.
128 // To get the block weight, read all incoming edges.
146 // If the edges value is missing (and this is no loop header, and this is
159 SmallVector<Edge, 8> Edges;
167 // *) get all the exit edges, read the flow that is already leaving this
168 // loop, remember the edges that do not have any flow on them right now.
169 // (The edges that have already flow on them are most likely exiting edges of
175 // the remaining exiting edges
[all...] |
| ProfileInfo.cpp | 79 // the sum of the edge frequencies from the incoming edges.
313 /// This checks all edges of the function the blocks reside in and replaces the
375 // Generate edges and read current weight.
384 // First count the edges from FristBB to SecondBB, if there is more than
394 // When the edges are merged anyway, then redirect all flow.
398 // We know now how many edges there are from FirstBB to SecondBB, reroute a
421 std::set<Edge> Edges;
426 Edges.insert(old);
429 for (std::set<Edge>::iterator EI = Edges.begin(), EE = Edges.end();
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| GraphicsContext.h | 319 typedef unsigned Edges;
320 void drawInnerShadow(const RoundedRect&, const Color& shadowColor, const IntSize shadowOffset, int shadowBlur, int shadowSpread, Edges clippedEdges = NoEdge);
|
| /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/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 12 // to records the edges between blocks that run and emit a complementary "gcda"
97 // Modify the program to track transitions along edges and call into the
111 // pred block number for certain non-trivial edges.
243 // function, number of lines belonging to each block, and a set of edges to
300 // set of blocks and a map of edges between blocks. This is the only GCOV
353 // Emit edges between blocks.
496 unsigned Edges = 0;
500 ++Edges;
502 Edges += TI->getNumSuccessors();
506 ArrayType::get(Type::getInt64Ty(*Ctx), Edges);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 170 // edges which simplifies the CFG.
284 /// edges across a loop header. For example, threading a jump from outside the
293 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges;
294 FindFunctionBackedges(F, Edges);
296 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
297 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second));
[all...] |
