| /external/markdown/docs/ |
| release-2.0.2.txt | 7 fixes for minor parsing bugs in some edge cases. For a full list of changes,
|
| /external/skia/src/gpu/batches/ |
| GrCopySurfaceBatch.cpp | 21 // clip the left edge to src and dst bounds, adjusting dstPoint if necessary
31 // clip the top edge to src and dst bounds, adjusting dstPoint if necessary
41 // clip the right edge to the src and dst bounds.
49 // clip the bottom edge to the src and dst bounds.
|
| /external/v8/src/compiler/ |
| control-flow-optimizer.cc | 55 for (Edge edge : node->use_edges()) {
56 if (NodeProperties::IsControlEdge(edge)) {
57 Enqueue(edge.from());
142 for (Edge edge : use->use_edges()) {
148 if (edge.from()->op()->ControlInputCount() != 1) return false;
149 Node* control = NodeProperties::GetControlInput(edge.from());
150 if (NodeProperties::IsPhi(edge.from())) {
151 control = NodeProperties::GetControlInput(control, edge.index())
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_DeblockChroma_I.c | 51 * follows: {external vertical edge, internal vertical edge,
52 * external horizontal edge, internal horizontal edge }. Per
55 * { external vertical edge, internal vertical edge, external
56 * horizontal edge, internal horizontal edge }. Per [ISO14496-10]
59 * or above edge of each 4x2 or 2x4 block, arranged in vertical
|
| omxVCM4P10_DeblockLuma_I.c | 52 * follows: {external vertical edge, internal vertical edge,
53 * external horizontal edge, internal horizontal edge }. Per
56 * {external vertical edge, internal vertical edge, external
57 * horizontal edge, internal horizontal edge }. Per [ISO14496-10]
60 * follows: {values for the left or above edge of each 4x4 block,
|
| /frameworks/support/v17/leanback/api21/android/support/v17/leanback/transition/ |
| TransitionHelperApi21.java | 94 public static Object createFadeAndShortSlide(int edge) {
95 return new FadeAndShortSlide(edge);
98 public static Object createFadeAndShortSlide(int edge, float distance) {
99 FadeAndShortSlide slide = new FadeAndShortSlide(edge);
|
| /frameworks/support/v7/cardview/res/values/ |
| attrs.xml | 33 <!-- Inner padding between the left edge of the Card and children of the CardView. -->
35 <!-- Inner padding between the right edge of the Card and children of the CardView. -->
37 <!-- Inner padding between the top edge of the Card and children of the CardView. -->
39 <!-- Inner padding between the bottom edge of the Card and children of the CardView. -->
|
| /prebuilts/sdk/current/support/v7/cardview/res/values/ |
| attrs.xml | 33 <!-- Inner padding between the left edge of the Card and children of the CardView. -->
35 <!-- Inner padding between the right edge of the Card and children of the CardView. -->
37 <!-- Inner padding between the top edge of the Card and children of the CardView. -->
39 <!-- Inner padding between the bottom edge of the Card and children of the CardView. -->
|
| /frameworks/support/core-ui/java/android/support/v4/widget/ |
| AutoScrollHelper.java | 32 * AutoScrollHelper is a utility class for adding automatic edge-triggered
46 * As the user touches closer to the extreme edge of the activation area,
47 * scrolling accelerates up to a maximum velocity. When using the default edge
109 * Edge type that specifies an activation area starting at the view bounds
117 * Edge type that specifies an activation area starting at the view bounds
126 * Edge type that specifies an activation area starting at the view bounds
148 /** Edge insets used to activate auto-scrolling. */
151 /** Clamping values for edge insets used to activate auto-scrolling. */
154 /** The type of edge being used. */
157 /** Delay after entering an activation edge before auto-scrolling begins. *
[all...] |
| /external/skia/src/core/ |
| SkDistanceFieldGen.cpp | 13 float fDistSq; // distance squared to nearest (so far) edge texel
14 SkPoint fDistVector; // distance vector to nearest (so far) edge texel
31 // We treat an "edge" as a place where we cross from >=128 to <128, or vice versa, or
41 // search for an edge
107 // computes the distance to an edge given an edge normal vector and a pixel's alpha value
124 // a1 = 0.5*dy/dx is the smaller fractional area chopped off by the edge
129 // relative to the edge fractional area
161 // i.e., if you're outside, gradient points towards edge
162 // if you're inside, gradient points away from edge
435 float edge = 0.0f; local
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| PGOInstrumentation.cpp | 16 // the entry and exit), the sum of incoming edge counts equals the sum of
17 // outgoing edge counts. The count of edge on spanning tree can be derived from
27 // (1) Pass PGOInstrumentationGen which instruments the IR to generate edge
29 // (2) Pass PGOInstrumentationUse which reads the edge count profile and
39 // Class PGOEdge represents a CFG edge and some auxiliary information. Class
80 STATISTIC(NumOfPGOSplit, "Number of critical edge splits.");
182 // Return the information string of an edge.
204 template <class Edge, class BBInfo> class FuncPGOInstrumentation {
216 CFGMST<Edge, BBInfo> MST
[all...] |
| 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/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/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/shapes/ |
| EdgeShape.java | 36 * A line segment (edge) shape. These can be connected in chains or loops to other edge shapes. The
44 * edge vertex 1
48 * edge vertex 2
64 super(ShapeType.EDGE);
138 // Put the ray into the edge's frame of reference.
244 EdgeShape edge = new EdgeShape(); local
245 edge.m_radius = this.m_radius;
246 edge.m_hasVertex0 = this.m_hasVertex0;
247 edge.m_hasVertex3 = this.m_hasVertex3
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 78 /// \brief Option class for critical edge splitting.
81 /// during critical edge splitting.
110 /// SplitCriticalEdge - If this edge is a critical edge, insert a new node to
111 /// split the critical edge. This will update the analyses passed in through
112 /// the option struct. This returns the new block if the edge was split, null
117 /// critical edge block. This is most commonly interesting with switch
121 /// edge".
123 /// It is invalid to call this function on a critical edge that starts at an
140 /// SplitCriticalEdge - If the edge from *PI to BB is not critical, retur
[all...] |
| /hardware/bsp/intel/peripheral/libmraa/api/mraa/ |
| gpio.hpp | 63 * Gpio Edge types for interupts
70 } Edge;
119 * Set the edge mode for ISR
121 * @param mode The edge mode to set
125 edge(Edge mode) function in class:mraa::Gpio
131 isr(Edge mode, PyObject* pyfunc, PyObject* args)
166 isr(Edge mode, v8::Handle<v8::Function> func)
177 isr(Edge mode, jobject runnable)
185 * @param mode The edge mode to se
[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...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| infoflow.py | 238 yield Edge(self.subG, source, target)
274 yield Edge(self.subG, path[s - 1], path[s])
310 edge = Edge(self.G, s, t, create=True)
311 edge.rules.append(rule)
312 edge.weight = wweight
315 edge = Edge(self.G, t, s, create=True)
316 edge.rules.append(rule)
317 edge.weight = rweigh
[all...] |
| /external/opencv3/modules/features2d/src/ |
| mser.cpp | 699 // the preprocess to get the edge list with proper gaussian blur
701 MSCREdge* edge,
748 // assian dx, dy to proper edge list and initialize mscr node
753 *total += edge->chi = *dxptr;
755 edge->left = nodeptr;
756 edge->right = nodeptr+1;
757 edge++;
763 *total += edge->chi = *dxptr;
765 edge->left = nodeptr;
766 edge->right = nodeptr+1
903 MSCREdge* edge = (MSCREdge*)cvAlloc( Ne*sizeof(edge[0]) ); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 78 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
80 MachineBasicBlock *Succ = Edge.ToBB;
84 if (PredBB == Edge.NewBB)
100 "critical edge split has more "
114 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
116 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB);
122 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode);
|
| /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/test/CodeGen/WebAssembly/ |
| cpus.ll | 7 ; RUN: llc < %s -mtriple=wasm32-unknown-unknown -mcpu=bleeding-edge 2>&1 | FileCheck %s
8 ; RUN: llc < %s -mtriple=wasm64-unknown-unknown -mcpu=bleeding-edge 2>&1 | FileCheck %s
|
| /external/llvm/test/Transforms/InstCombine/ |
| inline-intrinsic-assert.ll | 4 ; The inliner should not add an edge to an intrinsic and
5 ; then assert that it did not add an edge to an intrinsic!
|
| /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/opencv3/samples/cpp/tutorial_code/ImgTrans/ |
| Sobel_Demo.cpp | 3 * @brief Sample code using Sobel and/orScharr OpenCV functions to make a simple Edge Detector
23 const char* window_name = "Sobel Demo - Simple Edge Detector";
|
