Home
last modified time | relevance | path

Searched refs:dep_map (Results 1 – 3 of 3) sorted by relevance

/external/llvm-project/polly/lib/External/isl/
Disl_flow.c642 struct isl_map *dep_map; in last_source() local
649 dep_map = isl_map_apply_range(read_map, write_map); in last_source()
650 after = after_at_level(isl_map_get_space(dep_map), level); in last_source()
651 dep_map = isl_map_intersect(dep_map, after); in last_source()
652 result = restricted_partial_lexmax(acc, dep_map, j, set_C, empty); in last_source()
674 struct isl_map *dep_map; in last_later_source() local
684 dep_map = isl_map_apply_range(read_map, write_map); in last_later_source()
690 dep_map = isl_map_intersect(dep_map, after_write); in last_later_source()
691 before_read = after_at_level(isl_map_get_space(dep_map), before_level); in last_later_source()
692 dep_map = isl_map_intersect(dep_map, before_read); in last_later_source()
[all …]
/external/tensorflow/tensorflow/core/kernels/hexagon/
Dgraph_transferer.cc1033 const std::unordered_map<int, std::unordered_set<int>>& dep_map) in TransferParamsComparator() argument
1034 : dependency_map_(dep_map) {} in TransferParamsComparator()
1061 std::unordered_map<int, std::unordered_set<int>>& dep_map, in FillDependencyRec() argument
1063 if (dep_map.count(node_id) == 0 || dep_map.at(node_id).empty() || in FillDependencyRec()
1067 CHECK_EQ(dep_map.count(node_id), 1); in FillDependencyRec()
1070 for (int child_node_id : dep_map.at(node_id)) { in FillDependencyRec()
1075 FillDependencyRec(child_node_id, dep_map, completed); in FillDependencyRec()
1080 for (int child_node_id : dep_map.at(node_id)) { in FillDependencyRec()
1081 if (dep_map.count(child_node_id) == 0) { in FillDependencyRec()
1084 for (int depending_id : dep_map.at(child_node_id)) { in FillDependencyRec()
[all …]
Dgraph_transferer.h102 const std::unordered_map<int, std::unordered_set<int>>& dep_map);
205 int node_id, std::unordered_map<int, std::unordered_set<int>>& dep_map,