/external/google-fruit/include/fruit/impl/data_structures/ |
D | semistatic_graph.defn.h | 34 inline SemistaticGraph<NodeId, Node>::node_iterator::node_iterator(NodeData* itr) : itr(itr) {} in node_iterator() function 37 inline Node& SemistaticGraph<NodeId, Node>::node_iterator::getNode() { in getNode() 43 inline bool SemistaticGraph<NodeId, Node>::node_iterator::isTerminal() { in isTerminal() 49 inline void SemistaticGraph<NodeId, Node>::node_iterator::setTerminal() { in setTerminal() 55 inline bool SemistaticGraph<NodeId, Node>::node_iterator::operator==(const node_iterator& other) co… 63 inline SemistaticGraph<NodeId, Node>::const_node_iterator::const_node_iterator(node_iterator itr) :… in const_node_iterator() 84 SemistaticGraph<NodeId, Node>::node_iterator::neighborsBegin() { in neighborsBegin() 94 inline typename SemistaticGraph<NodeId, Node>::node_iterator 95 SemistaticGraph<NodeId, Node>::edge_iterator::getNodeIterator(node_iterator nodes_begin) { in getNodeIterator() 96 return node_iterator{nodeAtId(nodes_begin.itr, *itr)}; in getNodeIterator() [all …]
|
D | semistatic_graph.h | 110 class node_iterator { 116 node_iterator(NodeData* itr); 131 bool operator==(const node_iterator&) const; 143 const_node_iterator(node_iterator itr); 159 friend class SemistaticGraph<NodeId, Node>::node_iterator; 165 node_iterator getNodeIterator(node_iterator nodes_begin); 170 node_iterator getNodeIterator(std::size_t i, node_iterator nodes_begin); 215 node_iterator begin(); 217 node_iterator end(); 222 node_iterator at(NodeId nodeId); [all …]
|
/external/google-fruit/include/fruit/impl/injector/ |
D | injector_storage.h | 148 Graph::node_iterator lazyGetPtr(); 152 const C* getPtr(Graph::node_iterator itr); 155 const void* getPtrInternal(Graph::node_iterator itr); 158 Graph::node_iterator lazyGetPtr(TypeId type); 161 Graph::node_iterator lazyGetPtr(Graph::edge_iterator deps, std::size_t dep_index); 185 … InjectorStorage::Graph::node_iterator node_itr); 188 …ct_ptr_t createInjectedObjectForProvider(InjectorStorage& injector, Graph::node_iterator node_itr); 192 … Graph::node_iterator node_itr); 196 Graph::node_iterator node_itr); 200 … Graph::node_iterator node_itr); [all …]
|
D | injector_storage.defn.h | 105 const C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { in operator() 112 const C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 120 C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 128 C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 136 const C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 143 C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 152 const C* operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 159 …Provider<C> operator()(InjectorStorage& injector, InjectorStorage::Graph::node_iterator node_itr) { 239 inline T InjectorStorage::get(InjectorStorage::Graph::node_iterator node_iterator) { 243 return GetSecondStage<T>()(GetFirstStage<T>()(*this, node_iterator)); [all …]
|
/external/mesa3d/src/gallium/drivers/r600/sb/ |
D | sb_ra_checker.cpp | 180 for (node_iterator I = p->begin(), E = p->end(); I != E; ++I) { in check_phi_src() 189 for (node_iterator I = p->begin(), E = p->end(); I != E; ++I) { in process_phi_dst() 197 for (node_iterator I = g->begin(), E = g->end(); I != E; ++I) { in check_alu_group() 211 for (node_iterator I = g->begin(), E = g->end(); I != E; ++I) { in check_alu_group() 239 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in run_on()
|
D | sb_ssa_builder.cpp | 143 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() 147 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() 215 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() 219 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() 427 for (node_iterator I = phi->begin(), E = phi->end(); I != E; ++I) { in rename_phi_args()
|
D | sb_if_conversion.cpp | 64 for (node_iterator I = c->begin(), E = c->end(), N; I != E; I = N) { in convert_kill_instructions() 185 for (node_iterator I = r->phi->begin(), E = r->phi->end(); I != E; ++I) { in check_and_convert() 268 for (node_iterator I = r->phi->begin(), E = r->phi->end(); I != E; in run_on()
|
D | sb_gcm.cpp | 52 for (node_iterator N, I = pending.begin(), E = pending.end(); in run() 111 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in collect_instructions() 124 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in collect_instructions() 140 for (node_iterator I = n->begin(), E = n->end(); I != E; ++I) { in sched_early() 703 for (node_iterator I = s.begin(), E = s.end(); I != E; ++I) { in init_use_count() 753 for (node_iterator I = s.begin(), E = s.end(); I != E; ++I) { in init_def_count()
|
D | sb_def_use.cpp | 40 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in process_phi() 74 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in run_on()
|
D | sb_bc_finalize.cpp | 255 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in run_on() 308 for (node_iterator I = g->begin(), E = g->end(); I != E; ++I) { in finalize_alu_group() 392 for (node_iterator pI = prev->begin(), pE = prev->end(); pI != pE; ++pI) { in finalize_alu_src() 470 for (node_iterator pI = prev->begin(), pE = prev->end(); pI != pE; ++pI) { in finalize_alu_src() 951 for (node_iterator N, I = sh.root->begin(), E = sh.root->end(); I != E; in cf_peephole() 966 for (node_iterator N, I = sh.root->begin(), E = sh.root->end(); I != E; in cf_peephole()
|
D | sb_bc_builder.cpp | 43 for (node_iterator it = root->begin(), end = root->end(); in build() 64 for (node_iterator I = root->begin(), end = root->end(); in build() 96 for (node_iterator I = n->begin(), E = n->end(); in build_alu_clause() 109 for (node_iterator I = n->begin(), E = n->end(); in build_alu_group() 128 for (node_iterator I = n->begin(), E = n->end(); in build_fetch_clause()
|
D | sb_bc_parser.cpp | 293 for (node_iterator I = g->begin(), E = g->end(); I != E; ++I) { in decode_alu_group() 329 for (node_iterator I = cf->begin(), E = cf->end(); I != E; ++I) { in prepare_alu_clause() 368 for (node_iterator I = g->begin(), E = g->end(); in prepare_alu_group() 579 for (node_iterator N, I = g->begin(), E = g->end(); I != E; I = N) { in prepare_alu_group() 641 for (node_iterator I = cf->begin(), E = cf->end(); I != E; ++I) { in prepare_fetch_clause()
|
D | sb_ra_init.cpp | 322 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in ra_node() 539 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in split_phi_src() 559 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in split_phi_dst() 579 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in init_phi_constraints()
|
D | sb_pass.cpp | 55 for (node_iterator N, I = n.begin(), E = n.end(); I != E; I = N) { in run_on()
|
D | sb_liveness.cpp | 376 for (node_iterator I = phi->begin(), E = phi->end(); I != E; ++I) { in process_phi_outs() 390 for (node_iterator I = phi->begin(), E = phi->end(); I != E; ++I) { in process_phi_branch()
|
D | sb_ir.cpp | 312 for (node_iterator I = begin(), E = end(); I != E; ++I) in get_slot_mask() 352 for (node_iterator I = begin(), E = end(); I != E; ++I) { in update_packed_items() 451 for (node_iterator I = begin(), E = end(); I != E; ++I) { in collect_stats()
|
/external/google-fruit/include/fruit/ |
D | provider.h | 139 fruit::impl::InjectorStorage::Graph::node_iterator itr; 141 …der(fruit::impl::InjectorStorage* storage, fruit::impl::InjectorStorage::Graph::node_iterator itr);
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
D | ExplodedGraph.h | 341 typedef AllNodesTy::iterator node_iterator; typedef 344 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin() 346 node_iterator nodes_end() { return Nodes.end(); } in nodes_end()
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
D | GraphWriter.h | 59 typedef typename GTraits::nodes_iterator node_iterator; typedef 137 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
|
/external/google-fruit/include/fruit/impl/ |
D | provider.defn.h | 29 fruit::impl::InjectorStorage::Graph::node_iterator itr) in Provider()
|
/external/llvm/include/llvm/Analysis/ |
D | Interval.h | 45 typedef std::vector<BasicBlock*>::iterator node_iterator; typedef
|
/external/llvm/lib/Analysis/ |
D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
D | IntervalPartition.cpp | 54 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
|
/external/llvm/include/llvm/Support/ |
D | GraphWriter.h | 63 typedef typename GTraits::nodes_iterator node_iterator; typedef 141 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
|