| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 98 * It can yield states that have only a single edge on EOT to an accept
105 * for keyword versus ID as the state with EOT edge emanating from it will
106 * also have another edge.
192 Transition edge = (Transition) d.transition(i); local
193 DFAState edgeTarget = ((DFAState)edge.target);
196 edge.label.toString(d.dfa.nfa.grammar)+"->"+
221 Transition edge = (Transition) d.transition(i); local
222 DFAState edgeTarget = ((DFAState)edge.target);
225 edge.label.toString(d.dfa.nfa.grammar)+"->"+
228 // if only one edge coming out, it is EOT, and target is accept prun
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 72 /// Option class for critical edge splitting.
75 /// during critical edge splitting.
104 /// If this edge is a critical edge, insert a new node to split the critical
105 /// edge. This will update the analyses passed in through the option struct.
106 /// This returns the new block if the edge was split, null otherwise.
110 /// critical edge block. This is most commonly interesting with switch
114 /// edge".
116 /// It is invalid to call this function on a critical edge that starts at an
133 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| HeuristicBase.h | 29 /// change to the cost matrix on the given edge (by R2).
31 /// costs on the given edge.
33 /// edge into the PBQP graph (by R2).
35 /// disconnection of the given edge from the given node.
49 /// node/edge in the PBQP graph.
200 /// \brief Prepare a change in the costs on the given edge.
201 /// @param eItr Edge iterator.
206 /// \brief Handle the change in the costs on the given edge.
207 /// @param eItr Edge iterator.
212 /// \brief Handle the addition of a new edge into the PBQP graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 74 /// Option class for critical edge splitting.
77 /// during critical edge splitting.
105 /// If this edge is a critical edge, insert a new node to split the critical
106 /// edge. This will update the analyses passed in through the option struct.
107 /// This returns the new block if the edge was split, null otherwise.
111 /// critical edge block. This is most commonly interesting with switch
115 /// edge".
117 /// It is invalid to call this function on a critical edge that starts at an
134 /// If the edge from *PI to BB is not critical, return false. Otherwise, spli
[all...] |
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| BaseGridView.java | 66 * The first item is aligned with the low edge of the viewport. When
69 * For HorizontalGridView, low edge refers to getPaddingLeft() when RTL is false or
71 * For VerticalGridView, low edge refers to getPaddingTop().
77 * Note if there are very few items between low edge and key line, use
79 * to align the items to key line or low edge. Default is preferring low edge.
84 * The last item is aligned with the high edge of the viewport when
88 * For HorizontalGridView, high edge refers to getWidth() - getPaddingRight() when RTL is false
90 * For VerticalGridView, high edge refers to getHeight() - getPaddingBottom().
96 * Note if there are very few items between high edge and key line, us
[all...] |
| ItemAlignmentFacet.java | 55 * Sets number of pixels to the end of low edge. Supports right to left layout direction.
56 * @param offset In left to right or vertical case, it's the offset added to left/top edge.
57 * In right to left case, it's the offset subtracted from right edge.
64 * Returns number of pixels to the end of low edge. Supports right to left layout direction.
65 * In left to right or vertical case, it's the offset added to left/top edge. In right to
66 * left case, it's the offset subtracted from right edge.
67 * @return Number of pixels to the end of low edge.
103 * means 40% of width/height from the low edge. In the right to left case, it's the 40%
104 * width from right edge. Use {@link #ITEM_ALIGN_OFFSET_PERCENT_DISABLED} to disable.
116 * means 40% of the width from the low edge. In the right to left case, it's the 40% fro
[all...] |
| /system/update_engine/payload_generator/ |
| cycle_breaker.cc | 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) {
85 // add a subgraph_ edge
110 Edge min_edge = make_pair(stack_[0], stack_[1]);
115 Edge edge = make_pair(*it, *(it + 1)); local
116 if (cut_edges_.find(edge) != cut_edges_.end()) {
120 uint64_t edge_weight = graph_utils::EdgeWeight(subgraph_, edge);
123 min_edge = edge;
148 Edge edge = make_pair(*(it - 1), *it) local
[all...] |
| /external/v8/src/compiler/ |
| memory-optimizer.cc | 125 for (Edge const edge : node->use_edges()) {
126 Node* const user = edge.from();
127 if (user->opcode() == IrOpcode::kStoreField && edge.index() == 0) {
138 for (Edge const edge : node->use_edges()) {
139 Node* const user = edge.from();
140 if (user->opcode() == IrOpcode::kStoreField && edge.index() == 1) {
302 for (Edge edge : node->use_edges())
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| infoflow.py | 242 yield Edge(self.subG, source, target)
278 yield Edge(self.subG, path[s - 1], path[s])
314 edge = Edge(self.G, s, t, create=True)
315 edge.rules.append(rule)
316 edge.weight = wweight
319 edge = Edge(self.G, t, s, create=True)
320 edge.rules.append(rule)
321 edge.weight = rweigh
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | 18 // to indicate the weights of each edge coming out of the branch.
19 // The weight of each edge is the weight of the target block for
20 // that edge. The weight of a block B is computed as the maximum
69 "sample block/edge weights through the CFG."));
86 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge;
87 typedef DenseMap<Edge, uint64_t> EdgeWeightMap;
118 void printEdgeWeight(raw_ostream &OS, Edge E);
126 uint64_t visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
141 /// Edge weights are computed by propagating basic block weights i
[all...] |
| /external/llvm/lib/Analysis/ |
| LazyCallGraph.cpp | 23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
25 LazyCallGraph::Edge::Kind EK) {
27 // edge. Even if the function's definition is subject to replacement by
35 // safety of optimizing a direct call edge.
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);
96 void LazyCallGraph::Node::insertEdgeInternal(Function &Target, Edge::Kind EK) {
104 void LazyCallGraph::Node::insertEdgeInternal(Node &TargetN, Edge::Kind EK)
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 94 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
96 MachineBasicBlock *Succ = Edge.ToBB;
100 if (PredBB == Edge.NewBB)
116 "critical edge split has more "
130 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
132 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB);
138 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge;
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
50 // Equal edge weights: break ties by comparing block sizes.
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
93 // So we know now that the edge is not already in a subtree, so we push
94 // the edge to the MST.
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| scev-invalid.ll | 3 ; PR15570: SEGV: SCEV back-edge info invalid after dead code removal.
5 ; Indvars creates a SCEV expression for the loop's back edge taken
|
| /external/llvm/utils/ |
| DSAextract.py | 4 #the associated edges. An edge is kept iff for edge x -> y
7 #known issues: if a line contains '->' and is not an edge line
53 #used to check to see if the current line is an edge line
61 #filter out the unnecessary checks on all the edge lines
89 #1) node lines, 2) edge lines 3) support lines (like page size, etc)
91 #is this an edge line?
92 #note that this is no completely robust, if a none edge line
|
| /external/swiftshader/third_party/LLVM/utils/ |
| DSAextract.py | 4 #the associated edges. An edge is kept iff for edge x -> y
7 #known issues: if a line contains '->' and is not an edge line
53 #used to check to see if the current line is an edge line
61 #filter out the unnecessary checks on all the edge lines
89 #1) node lines, 2) edge lines 3) support lines (like page size, etc)
91 #is this an edge line?
92 #note that this is no completely robust, if a none edge line
|
| /frameworks/base/core/tests/coretests/src/android/widget/focus/ |
| ScrollingThroughListOfFocusablesTest.java | 53 // Make sure we have some fading edge regardless of ListView style.
98 assertTrue("bottom of view should be just above fading edge",
102 // make sure fading edge is the expected view
104 assertEquals("should be a second view visible due to the fading edge",
147 "the bottom of the list view (no fading edge)",
186 // now we are at top row, should have caused scrolling, and fading edge...
194 assertEquals("top of selected row should be just below top vertical fading edge",
199 // make sure fading edge is the view we expect
|
| /hardware/interfaces/tests/pointer/1.0/ |
| IGraph.hal | 24 struct Edge {
30 vec<Edge> edges;
|
