Searched refs:edge (Results 51 - 75 of 253) sorted by relevance

1234567891011

/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
H A DOptimalEdgeProfiling.cpp1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===//
10 // This pass instruments the specified program with counters for edge profiling.
15 #define DEBUG_TYPE "insert-optimal-edge-profiling"
55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
56 "Insert optimal instrumentation for edge profiling",
60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
61 "Insert optimal instrumentation for edge profiling",
78 errs() << "WARNING: cannot insert edge profiling into a module"
85 // For the entry block a virtual edge (0,entry) is reserved, for each block
86 // with no successors an edge (B
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local
[all...]
/external/tensorflow/tensorflow/core/common_runtime/
H A Dmemory_types.cc114 static string GetTensorName(const Edge* edge) {
117 edge->src()->name());
121 const string& device_name, bool host, const Edge* edge) {
124 .Input(edge->src(), edge->src_output())
135 const string& device_name, bool host, const Edge* edge) {
139 .Attr("tensor_type", edge->src()->output_type(edge->src_output()))
152 const Edge* edge;
167 return errors::Internal("Unexpected memory type pair on an edge
[all...]
/external/skia/samplecode/
H A DSamplePatch.cpp81 static void eval_sheet(const SkPoint edge[], int nu, int nv, int iu, int iv, argument
96 SkScalar x0 = UV * edge[TL].fX + uV * edge[TR].fX + Uv * edge[BL].fX + uv * edge[BR].fX;
97 SkScalar y0 = UV * edge[TL].fY + uV * edge[TR].fY + Uv * edge[BL].fY + uv * edge[BR].fY;
99 SkScalar x = (1 - v) * edge[T
[all...]
/external/skqp/samplecode/
H A DSamplePatch.cpp81 static void eval_sheet(const SkPoint edge[], int nu, int nv, int iu, int iv, argument
96 SkScalar x0 = UV * edge[TL].fX + uV * edge[TR].fX + Uv * edge[BL].fX + uv * edge[BR].fX;
97 SkScalar y0 = UV * edge[TL].fY + uV * edge[TR].fY + Uv * edge[BL].fY + uv * edge[BR].fY;
99 SkScalar x = (1 - v) * edge[T
[all...]
/external/tensorflow/tensorflow/compiler/jit/
H A Dencapsulate_subgraphs_pass.cc269 // Returns the index of the arg that the dst of edge should connect to.
270 int GetArgIndexForEdge(const Edge* edge) const;
272 // Returns the index of the result that the src of edge should connect to.
273 int GetResultIndexForEdge(const Edge* edge) const;
280 // source of edge in an outside_compilation subgraph.
282 const Edge* edge) const;
289 // destination of edge in an outside_compilation subgraph.
291 const Edge* edge) const;
293 // Creates an _Arg node for the src node of edge, and add its index to
295 // and adds the edge withi
652 RecordArg( const Edge* edge, const std::unordered_map<const Node*, Node*>& node_images, std::vector<std::pair<const Node*, Node*>>* src_arg_pairs) argument
686 RecordResult( const Edge* edge, const std::unordered_map<const Node*, Node*>& node_images) argument
715 RecordOutsideCompilationInputOrControl( const string& outside_compilation_id, const Edge* edge) argument
730 RecordOutsideCompilationOutputOrControl( const string& outside_compilation_id, const Edge* edge) argument
1436 FindOutputSlotOfEdgeSrc( const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const Edge* edge) argument
1484 FindOutputSlotOfEdgeDst( const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const Edge* edge) argument
1506 CopyEdgeToOutputGraph( const Edge* edge, const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out, std::unordered_set<std::pair<NodeSlot, NodeSlot>, NodeSlot::PairHasher>* edges_added) argument
[all...]
/external/freetype/src/autofit/
H A Dafhints.c95 /* Get new edge for given axis, direction, and position, */
96 /* without initializing the edge itself. */
107 AF_Edge edge = NULL; local
123 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
153 edge = edges + axis->num_edges;
155 while ( edge > edges )
157 if ( top_to_bottom_hinting ? ( edge[-1].fpos > fpos )
158 : ( edge[-1].fpos < fpos ) )
161 /* we want the edge with same position and minor direction */
163 if ( edge[
555 AF_Edge edge; local
1194 AF_Edge edge = seg->edge; local
1220 AF_Edge edge = seg->edge; local
1275 AF_Edge edge; local
[all...]
/external/v8/src/compiler/
H A Dnode-properties.h54 static bool IsValueEdge(Edge edge);
55 static bool IsContextEdge(Edge edge);
56 static bool IsFrameStateEdge(Edge edge);
57 static bool IsEffectEdge(Edge edge);
58 static bool IsControlEdge(Edge edge);
172 static inline bool IsInputRange(Edge edge, int first, int count);
H A Dmemory-optimizer.cc125 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()) {
303 if (NodeProperties::IsEffectEdge(edge)) {
304 EnqueueUse(edge.from(), edge
[all...]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DSplitter.h78 bool isCriticalEdge(MachineLoop::Edge &edge);
79 bool canSplitEdge(MachineLoop::Edge &edge);
80 MachineBasicBlock& splitEdge(MachineLoop::Edge &edge, MachineLoop &loop);
/external/v8/tools/turbolizer/
H A Dnode.js113 var edge = this.inputs[i];
114 edge.visible = v;
116 if (!edge.source.visible) {
117 edge.source.visible = true;
H A Dgraph-view.js190 edges.forEach(function(edge) {
191 if (edgeFilter == undefined || edgeFilter(edge, edgeNumber)) {
192 frontier.add(edge);
207 edgeFrontier.forEach(function(edge) {
208 if (edge.visible) {
213 edgeFrontier.forEach(function(edge) {
214 edge.visible = newState;
216 var node = inEdges ? edge.source : edge.target;
322 element.__data__.inputs.forEach(function(edge) {
[all...]
H A Dgraph-layout.js133 var edge = node.inputs[i];
134 if (!edge.isBackEdge()) {
135 var source = edge.source;
136 var horizontalPos = edge.getInputHorizontalPosition(graph);
211 source.outputs.forEach(function(edge) {
212 if (edge.isVisible()) {
213 var target = edge.target;
216 var horizontalPos = edge.getInputHorizontalPosition(graph);
355 var edge = n.outputs[l];
356 if (edge
[all...]
/external/deqp/external/openglcts/modules/glesext/tessellation_shader/
H A DesextcTessellationShaderVertexSpacing.cpp158 /* First convert the array data to a vector of edges, where each edge
160 * points for each edge need to be sorted by U component.
164 /* Isolines are simple - we only need to create a new edge per each unique height */
176 _tess_edge& edge = *edges_iterator; local
178 /* Each edge uses the same Y component, so we only need to check the first entry */
179 if (de::abs(edge.points[0].y - coordinate[1]) < epsilon)
182 edge.points.push_back(new_item);
190 /* New edge starts at this point.
203 /* For each edge, sort the points by U coordinate */
257 * data set to identify all points that are part of edges connecting the edge corner
428 _tess_edge& edge = *(edge_ptrs[n_edge]); local
486 _tess_edge& edge = *(edge_ptrs[n_edge]); local
505 _tess_edge& edge = *(edge_ptrs[n_edge]); local
726 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; local
836 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; local
1111 const _tess_edge& edge = *edges_iterator; local
[all...]
/external/clang/utils/analyzer/
H A Dubiviz35 elif action == 'edge':
38 edge = G.new_edge(src,dst)
40 G.set_edge_attribute(edge, attribute[0], attribute[1])
/external/pdfium/xfa/fxfa/parser/
H A Dcxfa_box.cpp162 CXFA_Edge* edge; local
164 edge = JSObject()->GetOrCreateProperty<CXFA_Edge>(i, XFA_Element::Edge);
166 edge = JSObject()->GetProperty<CXFA_Edge>(i, XFA_Element::Edge);
169 // with a null edge in the first position.
170 if (edge || i == 0) {
171 strokes[j] = edge;
224 CXFA_Edge* edge = GetEdgeIfExists(0); local
225 float fThickness = std::fmax(0.0, edge ? edge->GetThickness() : 0);
275 CXFA_Edge* edge local
[all...]
/external/skia/src/core/
H A DSkRegion_path.cpp448 static int extract_path(Edge* edge, Edge* stop, SkPath* path) { argument
449 while (0 == edge->fFlags) {
450 edge++; // skip over "used" edges
453 SkASSERT(edge < stop);
455 Edge* base = edge;
456 Edge* prev = edge;
457 edge = edge->fNext;
458 SkASSERT(edge != base);
464 if (prev->fX != edge
[all...]
/external/skqp/src/core/
H A DSkRegion_path.cpp448 static int extract_path(Edge* edge, Edge* stop, SkPath* path) { argument
449 while (0 == edge->fFlags) {
450 edge++; // skip over "used" edges
453 SkASSERT(edge < stop);
455 Edge* base = edge;
456 Edge* prev = edge;
457 edge = edge->fNext;
458 SkASSERT(edge != base);
464 if (prev->fX != edge
[all...]
/external/tensorflow/tensorflow/core/graph/
H A Dgraph.cc211 for (const Edge* edge : in_edges()) {
212 if (edge->dst_input() == idx) {
213 *e = edge;
218 return errors::NotFound("Could not find input edge ", idx, " for ", name());
226 for (const Edge* edge : in_edges()) {
227 if (edge->IsControlEdge()) continue;
228 if (edge->dst_input() < 0 || edge->dst_input() >= num_inputs()) {
229 return errors::Internal("Invalid edge input number ", edge
574 const Edge* edge = inputs[i]; local
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_split_prim.h14 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/swiftshader/third_party/LLVM/lib/Analysis/
H A DPathNumbering.cpp114 // Add an edge to the predecessor list.
115 void BallLarusNode::addPredEdge(BallLarusEdge* edge) { argument
116 _predEdges.push_back(edge);
119 // Remove an edge from the predecessor list.
120 void BallLarusNode::removePredEdge(BallLarusEdge* edge) { argument
121 removeEdge(_predEdges, edge);
124 // Add an edge to the successor list.
125 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) { argument
126 _succEdges.push_back(edge);
129 // Remove an edge fro
130 removeSuccEdge(BallLarusEdge* edge) argument
[all...]
/external/opencv/cxcore/src/
H A Dcxdatastructs.cpp2979 CvGraphEdge *edge = vtx->first; local
2980 if( !edge )
2982 cvGraphRemoveEdgeByPtr( graph, edge->vtx[0], edge->vtx[1] );
3014 CvGraphEdge *edge = vtx->first; local
3017 if( !edge )
3019 cvGraphRemoveEdgeByPtr( graph, edge->vtx[0], edge->vtx[1] );
3030 /* Find a graph edge given pointers to the ending vertices: */
3036 CvGraphEdge *edge 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/opencv/cv/src/
H A D_cvgeom.h60 void icvCreateCenterNormalLine( CvSubdiv2DEdge edge, double* a, double* b, double* c );
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
H A DPathNumbering.h87 // 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 i
[all...]
/external/tensorflow/tensorflow/core/debug/
H A Ddebug_graph_utils.cc109 for (const Edge* edge : src_node->out_edges()) {
110 const int src_output = edge->src_output();
112 output_slot_to_edges[src_output] = {edge};
114 output_slot_to_edges[src_output].push_back(edge);
130 // 1) Mark this edge as to be removed, iff this is a non-Reference
133 // 3) Add a new edge, from the source tensor to the Copy node
134 // 4) Add a new edge, from the Copy node to the destination node, iff
161 // Add edge from watched tensor to the copy node.
195 for (const Edge* edge : output_slot_to_edges[src_output_slot]) {
196 // Mark the edge fo
[all...]
/external/skia/src/sksl/
H A Dsksl_enums.inc14 * We have coverage effects that clip rendering to the edge of some geometric primitive.

Completed in 876 milliseconds

1234567891011