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

1 2 34 5 6 7 8 91011>>

  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_split_prim.h 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
  /external/llvm/lib/Analysis/
PathNumbering.cpp 113 // Add an edge to the predecessor list.
114 void BallLarusNode::addPredEdge(BallLarusEdge* edge) {
115 _predEdges.push_back(edge);
118 // Remove an edge from the predecessor list.
119 void BallLarusNode::removePredEdge(BallLarusEdge* edge) {
120 removeEdge(_predEdges, edge);
123 // Add an edge to the successor list.
124 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) {
125 _succEdges.push_back(edge);
128 // Remove an edge from the successor list
    [all...]
ProfileDataLoaderPass.cpp 65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge,
92 /// readEdge - Take the value from a profile counter and assign it to an edge.
94 ProfileData &PB, ProfileData::Edge e,
102 DEBUG(dbgs() << "-- Read Edge Counter for " << e
107 /// matchEdges - Link every profile counter with an edge.
131 /// edge into branch weights for each conditional branch (a branch with 2 or
152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); local
153 Weights[s] = (uint32_t)PB.getEdgeWeight(edge);
154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_split_prim.h 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
  /frameworks/av/media/libstagefright/codecs/avc/common/src/
deblock.cpp 60 //static void GetStrength(AVCCommonObj *video, uint8 *Strength, AVCMacroblock* MbP, AVCMacroblock* MbQ, int dir, int edge);
293 int edge, QP, QPC; local
318 /* NOTE: edge=0 and edge=1~3 are separate cases because of the difference of MbP, index A and indexB calculation */
319 /* for edge = 1~3, MbP, indexA and indexB remain the same, and thus there is no need to re-calculate them for each edge */
323 /* 1.VERTICAL EDGE + MB BOUNDARY (edge = 0) */
327 //GetStrength(video, Strength, MbP, MbQ, 0, 0); // Strength for 4 blks in 1 stripe, 0 => vertical edge
373 /* 2.VERTICAL EDGE (no boundary), the edges are all inside a MB *
    [all...]
  /external/opencv/cxcore/src/
cxdatastructs.cpp 2979 CvGraphEdge *edge = vtx->first; local
3014 CvGraphEdge *edge = vtx->first; local
3036 CvGraphEdge *edge = 0; local
3075 CvGraphEdge *edge = 0; local
3107 CvGraphEdge *edge = 0; local
3211 CvGraphEdge *edge, *next_edge, *prev_edge; local
3294 CvGraphEdge *edge; local
3321 CvGraphEdge *edge; local
3350 CvGraphEdge* edge; member in struct:CvGraphItem
3528 CvGraphEdge* edge; local
3734 CvGraphEdge* edge = (CvGraphEdge*)reader.ptr; local
    [all...]
  /external/chromium_org/third_party/skia/src/effects/gradients/
SkClampRange.cpp 13 * returns [0..count] for the number of steps (<= count) for which x0 <= edge
16 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) {
20 if (x0 >= edge) {
23 if (x1 <= edge) {
26 int64_t n = (edge - x0 + dx - 1) / dx;
  /external/llvm/include/llvm/Analysis/
PathNumbering.h 87 // Add an edge to the predecessor list.
88 void addPredEdge(BallLarusEdge* edge);
90 // Remove an edge from the predecessor list.
91 void removePredEdge(BallLarusEdge* edge);
93 // Add an edge to the successor list.
94 void addSuccEdge(BallLarusEdge* edge);
96 // Remove an edge from the successor list.
97 void removeSuccEdge(BallLarusEdge* edge);
123 // Removes an edge from an edgeVector. Used by removePredEdge and
128 // Represents an edge in the Dag. For an edge, v -> w, v is the source, an
    [all...]
  /external/opencv/cv/src/
_cvgeom.h 60 void icvCreateCenterNormalLine( CvSubdiv2DEdge edge, double* a, double* b, double* c );
  /external/pixman/pixman/
Android.mk 25 pixman-edge.c \
26 pixman-edge-accessors.c \
  /external/skia/src/effects/gradients/
SkClampRange.cpp 13 * returns [0..count] for the number of steps (<= count) for which x0 <= edge
16 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) {
20 if (x0 >= edge) {
23 if (x1 <= edge) {
26 int64_t n = (edge - x0 + dx - 1) / dx;
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/
ImageFilterEdge.java 24 private static final String SERIALIZATION_NAME = "EDGE";
26 mName = "Edge";
31 representation.setName("Edge");
34 representation.setTextId(R.string.edge);
  /external/bison/src/
lalr.c 162 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
182 edge[nedges++] = map_goto (stateno, sym);
190 memcpy (reads[i], edge, nedges * sizeof edge[0]);
202 free (edge);
221 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
263 edge[nedges++] = map_goto (states1[--length],
278 includes[i][j] = edge[j]
    [all...]
  /external/chromium_org/cc/trees/
layer_sorter.cc 167 // return an order based on the maximum depth difference but with an edge
338 GraphEdge& edge = edges_[i]; local
339 active_edges_[&edge] = &edge;
340 edge.from->outgoing.push_back(&edge);
341 edge.to->incoming.push_back(&edge);
342 edge.to->incoming_edge_weight += edge.weight
    [all...]
  /packages/apps/Gallery2/jni/
Android.mk 31 filters/edge.c \
  /external/chromium_org/chrome/browser/ui/gtk/panels/
panel_drag_gtk.cc 16 panel::ResizingSides GdkWindowEdgeToResizingSide(GdkWindowEdge edge) {
17 switch (edge) {
86 ResizeDragDelegate(Panel* panel, GdkWindowEdge edge)
88 resizing_side_(GdkWindowEdgeToResizingSide(edge)) {}
101 // The edge from which the panel is being resized.
148 GdkWindowEdge& edge) {
150 drag_delegate_ = new ResizeDragDelegate(panel_, edge);
  /external/chromium_org/ash/wm/dock/
docked_window_layout_manager_unittest.cc 148 // horizontally to the edge with an added offset from the edge of |dx|.
149 void DragRelativeToEdge(DockedEdge edge,
153 edge,
159 void DragToVerticalPositionAndToEdge(DockedEdge edge,
162 DragToVerticalPositionRelativeToEdge(edge, window, 0, y);
165 void DragToVerticalPositionRelativeToEdge(DockedEdge edge,
170 DragVerticallyAndRelativeToEdge(edge, window, dx, y - initial_bounds.y());
174 // horizontally to the edge with an added offset from the edge of |dx|
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
CodeGenerator.java 661 * edge. Generate a simple if-then-else. Cannot be an accept state as
678 Transition edge = (Transition) s.transition(i); local
680 if ( edge.label.getAtom()==Label.EOT ) {
689 genLabelExpr(templates,edge,1);
694 Utils.integer(edge.target.stateNumber));
695 // stick in any gated predicates for any edge if not already a pred
696 if ( !edge.label.isSemanticPredicate() ) {
697 DFAState t = (DFAState)edge.target;
707 if ( edge.label.getAtom()!=Label.EOT ) {
712 // state has >= 1 edge with a gated pred (syn or sem
1284 Transition edge = (Transition) s.transition(i); local
    [all...]
  /external/opencv/cvaux/src/
cvclique.cpp 83 #define CV_GET_ADJ_VTX( vertex, edge ) \
85 assert(edge->vtx[0]==vertex||edge->vtx[1] == vertex ), \
86 (edge->vtx[0] == vertex)?edge->vtx[1]:edge->vtx[0] \
173 CvGraphEdge* edge = cvFindGraphEdgeByPtr( graph, ver1, ver2 );
174 if( edge )
176 assert( ((CvGraphWeightedEdge*)edge)->weight >= 0 );
178 finder->edge_weights[ j * graph->total + i ] = ((CvGraphWeightedEdge*)edge)->weight
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
LL1DFA.java 39 * predicates to resolve edge set collisions.
43 * an LL(1) DFA. One edge per set.
87 IntervalSet edge = (IntervalSet)it.next(); local
88 List<Integer> alts = edgeMap.get(edge);
90 //System.out.println(edge+" -> "+alts);
93 Label e = getLabelForSet(edge);
  /external/opencv/cv/include/
cvtypes.h 200 /* get the next edge with the same origin point (counterwise) */
201 #define CV_SUBDIV2D_NEXT_EDGE( edge ) (((CvQuadEdge2D*)((edge) & ~3))->next[(edge)&3])
  /packages/apps/Camera2/src/com/android/camera/crop/
CropObject.java 160 public boolean selectEdge(int edge) {
161 if (!checkValid(edge)) {
163 throw new IllegalArgumentException("bad edge selected");
166 if ((mFixAspectRatio && !checkCorner(edge)) && !checkBlock(edge) && edge != MOVE_NONE) {
171 mMovingEdges = edge;
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/crop/
CropObject.java 162 public boolean selectEdge(int edge) {
163 if (!checkValid(edge)) {
165 throw new IllegalArgumentException("bad edge selected");
168 if ((mFixAspectRatio && !checkCorner(edge)) && !checkBlock(edge) && edge != MOVE_NONE) {
173 mMovingEdges = edge;
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
ResizeHandler.java 57 * @param horizontalEdgeType the type of horizontal edge being resized, or null
58 * @param verticalEdgeType the type of vertical edge being resized, or null
153 protected boolean isEdgeTypeCompatible(SegmentType edge, SegmentType dragged, int delta) {
154 boolean compatible = super.isEdgeTypeCompatible(edge, dragged, delta);
157 // width) we cannot use -negative- margins to jump back to a closer edge; we
221 if (mHorizontalDeps.contains(match.edge.node)) {
225 snapHorizontal(hEdge, match.edge.at, newBounds);
245 if (mVerticalDeps.contains(match.edge.node)) {
250 snapVertical(vEdge, match.edge.at, newBounds);
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
dot.stg 55 edge(src,target,label,arrowhead) ::= <<

Completed in 269 milliseconds

1 2 34 5 6 7 8 91011>>