Searched refs:edge (Results 201 - 225 of 253) sorted by relevance

1234567891011

/external/opencv/cxcore/src/
H A Dcxpersistence.cpp4558 // alignment of user part of the edge data following 2if
4580 CvGraphEdge* edge = (CvGraphEdge*)reader.ptr; local
4582 ((int*)src_ptr)[0] = edge->vtx[0]->flags;
4583 ((int*)src_ptr)[1] = edge->vtx[1]->flags;
4584 *(float*)(src_ptr + sizeof(int)*2) = edge->weight;
4589 memcpy( src_ptr2, edge + 1, elem_size - sizeof(CvGraphEdge) );
4701 // alignment of user part of the edge data following 2if
4773 CvGraphEdge* edge = 0; local
4784 vtx_buf[vtx1], vtx_buf[vtx2], 0, &edge ));
4787 CV_ERROR( CV_StsBadArg, "Duplicated edge ha
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/
H A Den.stg261 ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives. ANTLR will re-analyze the decision with a fixed lookahead of k=1. Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
/external/deqp/framework/common/
H A DtcuRasterizationVerifier.cpp1190 // image boundary, missing fragment could be over the image edge
2149 // a) too far from any edge
2156 const I64Vec2 edge = triangleSubPixelSpaceRound[otherVtxNdx] - triangleSubPixelSpaceRound[vtxNdx];
2158 const deInt64 crossProduct = (edge.x() * v.y() - edge.y() * v.x());
2160 // distance from edge: (edge x v) / |edge|
2161 // (edge x v) / |edge| > maxPixelDistanc
[all...]
/external/libavc/common/arm/
H A Dih264_deblk_luma_a9.s25 @/* edge. Functions are coded in NEON assembly and can */
54 @* Performs filtering of a luma block horizontal edge for cases where the
194 @* Performs filtering of a luma block horizontal edge when the
360 @* Performs filtering of a luma block vertical edge for cases where the
581 @* Performs filtering of a luma block vertical edge when the
807 @* Performs filtering of a luma block vertical edge when the
949 @* Performs filtering of a luma block vertical edge for cases where the
/external/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_clip.c449 * Note: at this point we can't just use the per-vertex edge flags.
450 * We have to observe the edge flag bits set in header->flags which
452 * an edge flags array which parallels the vertex array.
453 * Later, in the 'unfilled' pipeline stage we'll draw the edge if both
482 boolean *edge = &inEdges[i]; local
520 /* Whether or not to set edge flag for the new vert depends
525 /* we want to see an edge along the clip plane */
530 /* we don't want to see an edge along the frustum clip plane */
549 edge_prev = edge;
H A Ddraw_llvm.c1357 LLVMValueRef edge = lp_build_const_int_vec(gallivm, bldivec.type, local
1359 clipmask_bool = LLVMBuildXor(builder, clipmask_bool, edge, "");
/external/tensorflow/tensorflow/core/common_runtime/
H A Dshape_refiner.cc472 Status ShapeRefiner::TryToInferTensorOutputFromInputShapes(const Edge* edge, argument
476 const Node* node = edge->src();
640 // Add a copy of its node and a new edge to the new subgraph.
655 // Add the edge to the destination node.
H A Dexecutor.cc242 // ith output edge.
433 // connected to n by a single edge, but might be a downstream
591 for (const Edge* edge : n->in_edges()) {
592 if (edge->IsControlEdge()) {
894 // source node of an edge and is cleared by the destination of the same
895 // edge. The latter node is never run concurrently with the former node.
2455 // Only the first live edge sets the input and (potentially)
/external/v8/src/compiler/
H A Djs-native-context-specialization.cc247 for (Edge edge : node->use_edges()) {
248 if (NodeProperties::IsValueEdge(edge) && edge.from() != value) {
249 edge.UpdateTo(value);
250 Revisit(edge.from());
1345 // TODO(bmeurer): Properly rewire the IfException edge here if there's any.
2114 // This needs to stay here because of the edge case described in
H A Dinstruction-selector.cc251 for (Edge const edge : node->use_edges()) {
252 if (edge.from() != user && NodeProperties::IsValueEdge(edge)) {
264 for (Edge const edge : node->use_edges()) {
265 Node* from = edge.from();
H A Dwasm-compiler.cc2514 for (Edge const edge : value->use_edges()) {
2515 if (NodeProperties::IsControlEdge(edge)) continue;
2516 if (NodeProperties::IsEffectEdge(edge)) continue;
2517 DCHECK(NodeProperties::IsValueEdge(edge));
/external/jemalloc/bin/
H A Djeprof.in2154 # Get edges and counts per edge
2155 my %edge = ();
2169 if (!exists($edge{$edge_label})) {
2170 $edge{$edge_label} = 0;
2172 $edge{$edge_label} += $n;
2180 foreach my $e (sort { $edge{$b} <=> $edge{$a} } keys(%edge)) {
2182 $n = $edge{$e};
2192 # Keep edge i
[all...]
/external/tensorflow/tensorflow/core/graph/
H A Dgraph.h35 // "input index" and "output index" labels per edge.
174 // Returns into '*e' the edge connecting to the 'idx' input of this Node.
302 // carried by this edge. The special value kControlSlot is used
307 // carried by this edge. The special value kControlSlot is used
311 // Return true iff this is an edge that indicates a control-flow
393 // single SINK (always id kSinkId) node, and an edge from SOURCE->SINK.
400 // single SINK (always id kSinkId) node, and an edge from SOURCE->SINK.
432 // Adds an edge that connects the xth output of `source` to the yth input of
436 // Adds a control edge (no data flows along this edge) tha
[all...]
/external/deqp/modules/gles2/scripts/
H A Dgenutil.py187 def step(a, b): return (b.expandVec(a)).applyBinary(lambda edge, x: [1.0, 0.0][x < edge], a.expandVec(b))
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DProfileInfo.cpp79 // the sum of the edge frequencies from the incoming edges.
285 // First check if the old edge was taken, if not, just delete it...
362 /// Splits an edge in the ProfileInfo and redirects flow over NewBB.
363 /// Since its possible that there is more than one edge in the CFG from FristBB
399 // proportional part of the edge weight over NewBB.
492 static double readEdgeOrRemember(ProfileInfo::Edge edge, double w, argument
495 tocalc = edge;
547 // if exactly one edge weight was missing, calculate it and remove it from
686 // If the return edge has no value, try to read value from block.
692 // If both return edge an
[all...]
/external/swiftshader/src/Shader/
H A DShaderCore.cpp1004 void ShaderCore::step(Vector4f &dst, const Vector4f &edge, const Vector4f &x) argument
1006 dst.x = As<Float4>(CmpNLT(x.x, edge.x) & As<Int4>(Float4(1.0f)));
1007 dst.y = As<Float4>(CmpNLT(x.y, edge.y) & As<Int4>(Float4(1.0f)));
1008 dst.z = As<Float4>(CmpNLT(x.z, edge.z) & As<Int4>(Float4(1.0f)));
1009 dst.w = As<Float4>(CmpNLT(x.w, edge.w) & As<Int4>(Float4(1.0f)));
/external/deqp/modules/gles3/scripts/
H A Dgenutil.py197 def step(a, b): return (b.expandVec(a)).applyBinary(lambda edge, x: [1.0, 0.0][x < edge], a.expandVec(b))
/external/deqp/modules/gles31/scripts/
H A Dgenutil.py197 def step(a, b): return (b.expandVec(a)).applyBinary(lambda edge, x: [1.0, 0.0][x < edge], a.expandVec(b))
/external/annotation-tools/annotation-file-utilities/lib/
H A Dguava-20.0.jarMETA-INF/MANIFEST.MF META-INF/ META-INF/maven/ META-INF/maven/com. ...
/external/ImageMagick/Magick++/lib/Magick++/
H A DImage.h851 void edge(const double radius_=0.0);
1011 // An edge preserving noise reduction filter.
/external/ImageMagick/www/api/
H A Deffect.php322 <p>KuwaharaImage() is an edge preserving noise reduction filter.</p>
H A Dquantize.php67 <p>The tree's root node represents the entire domain, (0,0,0) through (Cmax,Cmax,Cmax). Each lower level in the tree is generated by subdividing one node's cube into eight smaller cubes of equal size. This corresponds to bisecting the parent cube with planes passing through the midpoints of each edge.</p>
/external/mesa3d/src/compiler/glsl/
H A Dbuiltin_functions.cpp3729 ir_variable *edge = in_var(edge_type, "edge"); local
3731 MAKE_SIG(x_type, avail, 2, edge, x);
3737 body.emit(assign(t, f2d(b2f(gequal(x, edge)))));
3739 body.emit(assign(t, b2f(gequal(x, edge))));
3741 /* x is a vector but edge is a float */
3744 body.emit(assign(t, f2d(b2f(gequal(swizzle(x, i, 1), edge))), 1 << i));
3746 body.emit(assign(t, b2f(gequal(swizzle(x, i, 1), edge)), 1 << i));
3752 body.emit(assign(t, f2d(b2f(gequal(swizzle(x, i, 1), swizzle(edge, i, 1)))),
3755 body.emit(assign(t, b2f(gequal(swizzle(x, i, 1), swizzle(edge,
[all...]
/external/ImageMagick/Magick++/lib/
H A DSTL.cpp346 image_.edge( _radius );
/external/opencv/cvaux/src/
H A Dcvlee.cpp199 // (site is an edge of polygon or a reflex vertex).
1075 Description : function intersects given edge pEdge (and his twin edge)
1078 pEdge : in, given edge
1090 Description : function intersects given edge pEdge (and his twin edge)
1093 pEdge : in, given edge
1830 pNewSite->edge[1] = pNewEdge1;
1880 pNewSite->edge[0] = pNewEdge1;
1931 // pNewSite->edge[
[all...]

Completed in 778 milliseconds

1234567891011