HomeSort by relevance Sort by last modified time
    Searched refs:edge (Results 226 - 250 of 298) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
3d-cube.js 300 // anti-clockwise edge check
301 Q.Edge = [[0,1,2],[3,2,6],[7,6,5],[4,5,1],[4,0,3],[1,5,6]];
305 for (var i = 0; i < Q.Edge.length; i++) Q.Normal[i] = CalcNormal(Q[Q.Edge[i][0]].V, Q[Q.Edge[i][1]].V, Q[Q.Edge[i][2]].V);
  /external/chromium_org/third_party/tcmalloc/chromium/src/
pprof     [all...]
  /external/chromium_org/v8/test/webkit/fast/js/
primitive-property-access-edge-cases.js 25 "This page tests for assertion failures in edge cases of property lookup on primitive values."
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-flow-inline.h 472 /* Return the edge associated with argument I of phi node GS. */
474 static inline edge
488 /* Return the source location of the argument on edge E of phi node GS. */
491 gimple_phi_arg_location_from_edge (gimple gs, edge e)
gimple.h 264 are necessary to handle edge cases such as when statement is
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-flow-inline.h 472 /* Return the edge associated with argument I of phi node GS. */
474 static inline edge
488 /* Return the source location of the argument on edge E of phi node GS. */
491 gimple_phi_arg_location_from_edge (gimple gs, edge e)
gimple.h 264 are necessary to handle edge cases such as when statement is
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-flow-inline.h 472 /* Return the edge associated with argument I of phi node GS. */
474 static inline edge
488 /* Return the source location of the argument on edge E of phi node GS. */
491 gimple_phi_arg_location_from_edge (gimple gs, edge e)
gimple.h 264 are necessary to handle edge cases such as when statement is
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-flow-inline.h 472 /* Return the edge associated with argument I of phi node GS. */
474 static inline edge
488 /* Return the source location of the argument on edge E of phi node GS. */
491 gimple_phi_arg_location_from_edge (gimple gs, edge e)
gimple.h 264 are necessary to handle edge cases such as when statement is
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
ConstraintPainter.java 51 * such as a source node having its top edge constrained to a target node with a given margin.
69 Rect targetBounds = match.edge.node.getBounds();
72 paintConstraint(graphics, type, match.with.node, sourceBounds, match.edge.node,
423 // If however there is a margin on the target edge, it should be drawn like this:
528 // If not, we'll need to indicate a shared edge. This is the edge that separate
558 // Adjust position of source arrow such that it does not sit across edge; it
559 // should point directly at the edge
574 // Draw the line from the source anchor to the shared edge
579 // Draw the line from the target to the horizontal shared edge
    [all...]
  /external/libvpx/libvpx/vp8/common/x86/
loopfilter_mmx.asm 133 ; calculate high edge variance
191 pandn mm4, mm5 ; high edge variance additive
426 ; calculate high edge variance
509 pandn mm4, mm5 ; high edge variance additive
728 ; calculate high edge variance
    [all...]
  /packages/apps/Camera/jni/feature_mos/src/mosaic/
Blend.cpp 264 SEdgeVector *edge; local
265 int n = m_Triangulator.triangulate(&edge, numCenters, width, height);
266 m_Triangulator.linkNeighbors(edge, n, numCenters);
    [all...]
  /packages/apps/Camera2/jni/feature_mos/src/mosaic/
Blend.cpp 264 SEdgeVector *edge; local
265 int n = m_Triangulator.triangulate(&edge, numCenters, width, height);
266 m_Triangulator.linkNeighbors(edge, n, numCenters);
    [all...]
  /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/
Blend.cpp 264 SEdgeVector *edge; local
265 int n = m_Triangulator.triangulate(&edge, numCenters, width, height);
266 m_Triangulator.linkNeighbors(edge, n, numCenters);
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/
RelativeLayoutConversionHelper.java 207 // must have been a right edge
246 // must have been a right edge
263 // must have been a bottom edge
425 // See if we have a bottom/right edge to attach the forwards link to
496 // Attach to right/bottom edge of the layout
700 // Determine if the reference is to a known edge
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkOpSegment.h 302 bool subDivide(int start, int end, SkPoint edge[4]) const;
  /external/chromium_org/third_party/tcmalloc/vendor/src/
pprof     [all...]
  /external/skia/src/pathops/
SkOpSegment.h 302 bool subDivide(int start, int end, SkPoint edge[4]) const;
  /external/chromium_org/v8/test/mjsunit/
math-floor-of-div-nosudiv.js 167 // Test for edge cases.
math-floor-of-div.js 167 // Test for edge cases.
  /external/libvpx/libvpx/vp8/common/arm/armv6/
loopfilter_v6.asm 158 ;calculate high edge variance
366 ;calculate high edge variance
693 ;calculate high edge variance
    [all...]
  /external/llvm/lib/Analysis/
ProfileInfo.cpp 75 Edge e = getEdge(0, BB);
79 // the sum of the edge frequencies from the incoming edges.
102 Edge e = getEdge(BB,0);
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) {
185 assert (oldw != MissingValue && "Adding weight to Edge with no previous weight");
186 DEBUG(dbgs() << "Adding to Edge " << e
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) {
223 replaceEdge(const Edge &oldedge, const Edge &newedge) {
260 Edge e = getEdge(BB,*Succ)
    [all...]
  /external/bison/doc/
refcard.tex 147 % We want output .3 inch *from top of paper edge*; i.e. -.7in from TeX default

Completed in 921 milliseconds

1 2 3 4 5 6 7 8 91011>>