| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | graph_view.h | 39 struct EdgeInfo { struct
112 gtl::MutableArraySlice<EdgeInfo> mutable_output_edges() { in mutable_output_edges()
113 return gtl::MutableArraySlice<EdgeInfo>(output_edge_base(), in mutable_output_edges()
117 gtl::ArraySlice<EdgeInfo> output_edges() const { in output_edges()
118 return gtl::ArraySlice<EdgeInfo>(output_edge_base(), num_output_edges); in output_edges()
167 EdgeInfo* output_edge_base() const { in output_edge_base()
168 return reinterpret_cast<EdgeInfo*>(var()); in output_edge_base()
172 return reinterpret_cast<ControlEdgeInfo*>(var() + sizeof(EdgeInfo) * in output_control_edge_base()
178 var() + sizeof(EdgeInfo) * num_output_edges + in output_attr_base()
182 return reinterpret_cast<int*>(var() + sizeof(EdgeInfo) * num_output_edges + in forward_from_base()
[all …]
|
| D | graph_view.cc | 51 static_assert(std::is_trivially_destructible<EdgeInfo>::value, in ~GraphView()
95 + num_output_edges * sizeof(EdgeInfo) // output_edges[...] in NodeItemBytes()
105 static_assert(kItemAlignment % alignof(EdgeInfo) == 0, in NodeItemBytes()
111 static_assert(sizeof(NodeItem) % alignof(EdgeInfo) == 0, in NodeItemBytes()
115 static_assert(sizeof(EdgeInfo) % alignof(AllocatorAttributes) == 0, in NodeItemBytes()
158 gtl::InlinedVector<EdgeInfo*, 4> last_indices(num_outputs, nullptr); in InitializeNode()
159 EdgeInfo* dst_edge = item->output_edge_base(); in InitializeNode()
175 for (EdgeInfo* edge_info : last_indices) { in InitializeNode()
|
| D | simple_propagator_state.cc | 77 for (const EdgeInfo& e : item->output_edges()) { in PropagateOutputs()
|
| D | propagator_state.cc | 313 for (const EdgeInfo& e : item->output_edges()) { in DeleteFrame()
414 for (const EdgeInfo& e : item->output_edges()) { in ActivateNodesFastPathInternal()
471 for (const EdgeInfo& e : item->output_edges()) { in ActivateNodesSlowPath()
|
| D | immutable_executor_state.cc | 250 for (EdgeInfo& e : item->mutable_output_edges()) { in Initialize()
|
| D | graph_constructor.cc | 382 struct EdgeInfo { struct in tensorflow::__anon605085930111::GraphConstructor
383 explicit EdgeInfo(const string& name, int i1, Node* n, int i2) in EdgeInfo() argument
391 std::vector<EdgeInfo> back_edges_;
|
| /external/libaom/libaom/av1/encoder/ |
| D | rdopt.h | 92 } EdgeInfo; typedef
100 EdgeInfo av1_edge_exists(const uint8_t *src, int src_stride, int w, int h,
|
| D | rdopt.c | 5453 static EdgeInfo edge_probability(const uint8_t *input, int w, int h, in edge_probability()
5474 EdgeInfo ei = { .magnitude = highest, .x = highest_x, .y = highest_y }; in edge_probability()
5481 EdgeInfo av1_edge_exists(const uint8_t *src, int src_stride, int w, int h, in av1_edge_exists()
5484 EdgeInfo n = { .magnitude = 0, .x = 0, .y = 0 }; in av1_edge_exists()
5498 EdgeInfo prob = edge_probability(blurred, w, h, high_bd, bd); in av1_edge_exists()
|
| D | encodeframe.c | 688 static EdgeInfo edge_info(const struct buf_2d *ref, const BLOCK_SIZE bsize, in edge_info()
696 EdgeInfo ei = { .magnitude = 0, .x = 0, .y = 0 }; in edge_info()
810 EdgeInfo ei = in pick_sb_modes()
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | encapsulate_util.cc | 118 struct EdgeInfo { in PreprocessDataEdgesBetweenOutsideCompilations() struct
121 std::vector<EdgeInfo> edges; in PreprocessDataEdgesBetweenOutsideCompilations()
134 edges.push_back(EdgeInfo{e->dst_input(), e->dst()->id()}); in PreprocessDataEdgesBetweenOutsideCompilations()
|
| D | mark_for_compilation_pass.cc | 1513 struct EdgeInfo { in VLogClusteringSummary() struct
1526 bool operator<(const EdgeInfo& other) const { in VLogClusteringSummary() argument
1531 using EdgeInfoMap = std::map<absl::string_view, std::map<EdgeInfo, int64>>; in VLogClusteringSummary()
1553 [EdgeInfo{from->name(), from_cluster_name}]++; in VLogClusteringSummary()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionImport.cpp | 260 using EdgeInfo = std::pair<const FunctionSummary *, unsigned /* Threshold */>; typedef
268 SmallVectorImpl<EdgeInfo> &Worklist, in computeImportForFunction()
342 SmallVector<EdgeInfo, 128> Worklist; in ComputeImportForModule()
|
| /external/llvm-project/llvm/lib/Transforms/IPO/ |
| D | FunctionImport.cpp | 264 using EdgeInfo = typedef
287 SmallVectorImpl<EdgeInfo> &Worklist, in computeImportForReferencedGlobals()
364 SmallVectorImpl<EdgeInfo> &Worklist, in computeImportForFunction()
530 SmallVector<EdgeInfo, 128> Worklist; in ComputeImportForModule()
|
| /external/ImageMagick/MagickCore/ |
| D | draw.c | 129 } EdgeInfo; typedef
161 EdgeInfo
423 if (polygon_info->edges != (EdgeInfo *) NULL) in DestroyPolygonInfo()
429 polygon_info->edges=(EdgeInfo *) RelinquishMagickMemory( in DestroyPolygonInfo()
455 p=((const EdgeInfo *) p_edge)->points; in DrawCompareEdges()
456 q=((const EdgeInfo *) q_edge)->points; in DrawCompareEdges()
472 EdgeInfo in LogPolygonInfo()
556 polygon_info->edges=(EdgeInfo *) AcquireQuantumMemory(number_edges, in ConvertPathToPolygon()
558 if (polygon_info->edges == (EdgeInfo *) NULL) in ConvertPathToPolygon()
595 polygon_info->edges=(EdgeInfo *) ResizeQuantumMemory( in ConvertPathToPolygon()
[all …]
|
| D | attribute.c | 134 } EdgeInfo; typedef
239 static inline double GetMinEdgeBackgroundCensus(const EdgeInfo *edge) in GetMinEdgeBackgroundCensus()
262 EdgeInfo in GetEdgeBoundingBox()
|
| /external/llvm/include/llvm/Analysis/ |
| D | ScalarEvolution.h | 678 struct EdgeInfo {
679 EdgeInfo(BasicBlock *Block, const SCEV *Taken, SCEVUnionPredicate &P) :
711 BackedgeTakenInfo(SmallVectorImpl<EdgeInfo> &ExitCounts, bool Complete,
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | FunctionImport.cpp | 264 using EdgeInfo = std::tuple<const FunctionSummary *, unsigned /* Threshold */, typedef
365 SmallVectorImpl<EdgeInfo> &Worklist, in computeImportForFunction()
544 SmallVector<EdgeInfo, 128> Worklist; in ComputeImportForModule()
|
| /external/llvm-project/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 683 for (const EdgeInfo &EI : Node.UserTreeIndices) in findRootOrder()
780 struct EdgeInfo { struct in llvm::slpvectorizer::BoUpSLP
781 EdgeInfo() = default;
782 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo() argument
790 const BoUpSLP::EdgeInfo &EI) { in operator <<()
1490 const EdgeInfo &EI);
1577 SmallVector<EdgeInfo, 1> UserTreeIndices;
1763 const EdgeInfo &UserTreeIdx, in newTreeEntry()
1776 const EdgeInfo &UserTreeIdx, in newTreeEntry()
2399 ChildIteratorType, SmallVector<BoUpSLP::EdgeInfo, 1>::iterator> {
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 675 struct EdgeInfo { struct in llvm::slpvectorizer::BoUpSLP
676 EdgeInfo() = default;
677 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo() function
685 const BoUpSLP::EdgeInfo &EI) { in operator <<()
1385 const EdgeInfo &EI);
1469 SmallVector<EdgeInfo, 1> UserTreeIndices;
1639 const EdgeInfo &UserTreeIdx, in newTreeEntry()
2244 ChildIteratorType, SmallVector<BoUpSLP::EdgeInfo, 1>::iterator> {
2247 ChildIteratorType(SmallVector<BoUpSLP::EdgeInfo, 1>::iterator W, in ChildIteratorType()
2363 buildTree_rec(Roots, 0, EdgeInfo()); in buildTree()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | ScalarEvolution.cpp | 5601 SmallVectorImpl<EdgeInfo> &ExitCounts, bool Complete, const SCEV *MaxCount) in BackedgeTakenInfo()
5617 ExitCounts.end(), [](EdgeInfo &Entry) { in BackedgeTakenInfo()
5666 SmallVector<EdgeInfo, 4> ExitCounts; in computeBackedgeTakenCount()
5689 ExitCounts.emplace_back(EdgeInfo(ExitBB, EL.Exact, EL.Pred)); in computeBackedgeTakenCount()
|