reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
201 class schedule_node;
104 static isl::schedule_node 105 optimizeScheduleNode(isl::schedule_node Node, 124 static isl::schedule_node isolateFullPartialTiles(isl::schedule_node Node, 124 static isl::schedule_node isolateFullPartialTiles(isl::schedule_node Node, 138 static isl::schedule_node tileNode(isl::schedule_node Node, 138 static isl::schedule_node tileNode(isl::schedule_node Node, 149 static isl::schedule_node applyRegisterTiling(isl::schedule_node Node, 149 static isl::schedule_node applyRegisterTiling(isl::schedule_node Node, 198 static isl::schedule_node 199 optimizeMatMulPattern(isl::schedule_node Node, 209 static bool isTileableBandNode(isl::schedule_node Node); 242 static isl::schedule_node prevectSchedBand(isl::schedule_node Node, 242 static isl::schedule_node prevectSchedBand(isl::schedule_node Node, 277 static isl::schedule_node standardBandOpts(isl::schedule_node Node, 277 static isl::schedule_node standardBandOpts(isl::schedule_node Node, 300 static bool isMatrMultPattern(isl::schedule_node Node, 314 static isl::schedule_node 315 createMacroKernel(isl::schedule_node Node, 329 static isl::schedule_node 330 createMicroKernel(isl::schedule_node Node,tools/polly/lib/External/isl/include/isl/isl-noexceptions.h
2474 inline schedule_node get_root() const; 2533 inline schedule_node manage(__isl_take isl_schedule_node *ptr); 2534 inline schedule_node manage_copy(__isl_keep isl_schedule_node *ptr); 2537 friend inline schedule_node manage(__isl_take isl_schedule_node *ptr); 2538 friend inline schedule_node manage_copy(__isl_keep isl_schedule_node *ptr); 2546 inline /* implicit */ schedule_node(const schedule_node &obj); 2548 inline schedule_node &operator=(schedule_node obj); 2548 inline schedule_node &operator=(schedule_node obj); 2560 inline schedule_node align_params(space space) const; 2561 inline schedule_node ancestor(int generation) const; 2563 inline schedule_node band_member_set_coincident(int pos, int coincident) const; 2564 inline schedule_node band_set_ast_build_options(union_set options) const; 2565 inline schedule_node child(int pos) const; 2567 inline schedule_node cut() const; 2573 inline schedule_node first_child() const; 2574 inline stat foreach_ancestor_top_down(const std::function<stat(schedule_node)> &fn) const; 2575 static inline schedule_node from_domain(union_set domain); 2576 static inline schedule_node from_extension(union_map extension); 2577 inline int get_ancestor_child_position(const schedule_node &ancestor) const; 2578 inline schedule_node get_child(int pos) const; 2587 inline schedule_node get_shared_ancestor(const schedule_node &node2) const; 2587 inline schedule_node get_shared_ancestor(const schedule_node &node2) const; 2593 inline schedule_node graft_after(schedule_node graft) const; 2593 inline schedule_node graft_after(schedule_node graft) const; 2594 inline schedule_node graft_before(schedule_node graft) const; 2594 inline schedule_node graft_before(schedule_node graft) const; 2595 inline schedule_node group(id group_id) const; 2601 inline schedule_node insert_context(set context) const; 2602 inline schedule_node insert_filter(union_set filter) const; 2603 inline schedule_node insert_guard(set context) const; 2604 inline schedule_node insert_mark(id mark) const; 2605 inline schedule_node insert_partial_schedule(multi_union_pw_aff schedule) const; 2606 inline schedule_node insert_sequence(union_set_list filters) const; 2607 inline schedule_node insert_set(union_set_list filters) const; 2608 inline boolean is_equal(const schedule_node &node2) const; 2612 inline schedule_node next_sibling() const; 2613 inline schedule_node order_after(union_set filter) const; 2614 inline schedule_node order_before(union_set filter) const; 2615 inline schedule_node parent() const; 2616 inline schedule_node previous_sibling() const; 2617 inline schedule_node reset_user() const; 2618 inline schedule_node root() const; 2619 inline schedule_node sequence_splice_child(int pos) const; 13775 schedule_node schedule::get_root() const 14006 schedule_node manage(__isl_take isl_schedule_node *ptr) { 14009 schedule_node manage_copy(__isl_keep isl_schedule_node *ptr) { 14017 schedule_node::schedule_node(const schedule_node &obj) 14030 schedule_node &schedule_node::operator=(schedule_node obj) { 14030 schedule_node &schedule_node::operator=(schedule_node obj) { 14080 schedule_node schedule_node::align_params(space space) const 14086 schedule_node schedule_node::ancestor(int generation) const 14098 schedule_node schedule_node::band_member_set_coincident(int pos, int coincident) const 14104 schedule_node schedule_node::band_set_ast_build_options(union_set options) const 14110 schedule_node schedule_node::child(int pos) const 14122 schedule_node schedule_node::cut() const 14158 schedule_node schedule_node::first_child() const 14164 stat schedule_node::foreach_ancestor_top_down(const std::function<stat(schedule_node)> &fn) const 14167 const std::function<stat(schedule_node)> *func; 14178 schedule_node schedule_node::from_domain(union_set domain) 14184 schedule_node schedule_node::from_extension(union_map extension) 14190 int schedule_node::get_ancestor_child_position(const schedule_node &ancestor) const 14196 schedule_node schedule_node::get_child(int pos) const 14250 schedule_node schedule_node::get_shared_ancestor(const schedule_node &node2) const 14250 schedule_node schedule_node::get_shared_ancestor(const schedule_node &node2) const 14286 schedule_node schedule_node::graft_after(schedule_node graft) const 14286 schedule_node schedule_node::graft_after(schedule_node graft) const 14292 schedule_node schedule_node::graft_before(schedule_node graft) const 14292 schedule_node schedule_node::graft_before(schedule_node graft) const 14298 schedule_node schedule_node::group(id group_id) const 14334 schedule_node schedule_node::insert_context(set context) const 14340 schedule_node schedule_node::insert_filter(union_set filter) const 14346 schedule_node schedule_node::insert_guard(set context) const 14352 schedule_node schedule_node::insert_mark(id mark) const 14358 schedule_node schedule_node::insert_partial_schedule(multi_union_pw_aff schedule) const 14364 schedule_node schedule_node::insert_sequence(union_set_list filters) const 14370 schedule_node schedule_node::insert_set(union_set_list filters) const 14376 boolean schedule_node::is_equal(const schedule_node &node2) const 14400 schedule_node schedule_node::next_sibling() const 14406 schedule_node schedule_node::order_after(union_set filter) const 14412 schedule_node schedule_node::order_before(union_set filter) const 14418 schedule_node schedule_node::parent() const 14424 schedule_node schedule_node::previous_sibling() const 14430 schedule_node schedule_node::reset_user() const 14436 schedule_node schedule_node::root() const 14442 schedule_node schedule_node::sequence_splice_child(int pos) consttools/polly/lib/Transform/ScheduleOptimizer.cpp
381 isl::schedule_node 382 ScheduleTreeOptimizer::isolateFullPartialTiles(isl::schedule_node Node, 398 isl::schedule_node ScheduleTreeOptimizer::prevectSchedBand( 399 isl::schedule_node Node, unsigned DimToVectorize, int VectorWidth) { 433 isl::schedule_node ScheduleTreeOptimizer::tileNode(isl::schedule_node Node, 433 isl::schedule_node ScheduleTreeOptimizer::tileNode(isl::schedule_node Node, 460 isl::schedule_node ScheduleTreeOptimizer::applyRegisterTiling( 461 isl::schedule_node Node, ArrayRef<int> TileSizes, int DefaultTileSize) { 467 static bool isSimpleInnermostBand(const isl::schedule_node &Node) { 479 auto Sequence = Node.child(0); 483 auto Child = Sequence.child(c); 493 bool ScheduleTreeOptimizer::isTileableBandNode(isl::schedule_node Node) { 512 __isl_give isl::schedule_node 513 ScheduleTreeOptimizer::standardBandOpts(isl::schedule_node Node, void *User) { 807 static isl::schedule_node permuteBandNodeDimensions(isl::schedule_node Node, 807 static isl::schedule_node permuteBandNodeDimensions(isl::schedule_node Node, 825 isl::schedule_node ScheduleTreeOptimizer::createMicroKernel( 826 isl::schedule_node Node, MicroKernelParamsTy MicroKernelParams) { 833 isl::schedule_node ScheduleTreeOptimizer::createMacroKernel( 834 isl::schedule_node Node, MacroKernelParamsTy MacroKernelParams) { 1053 isl::schedule_node createExtensionNode(isl::schedule_node Node, 1053 isl::schedule_node createExtensionNode(isl::schedule_node Node, 1056 auto NewNode = isl::schedule_node::from_extension(Extension); 1056 auto NewNode = isl::schedule_node::from_extension(Extension); 1092 static isl::schedule_node 1093 optimizeDataLayoutMatrMulPattern(isl::schedule_node Node, isl::map MapOldIndVar, 1171 getInductionVariablesSubstitution(isl::schedule_node Node, 1174 auto Child = Node.child(0); 1197 static isl::schedule_node 1198 isolateAndUnrollMatMulInnerLoops(isl::schedule_node Node, 1200 isl::schedule_node Child = Node.get_child(0); 1227 static isl::schedule_node markInterIterationAliasFree(isl::schedule_node Node, 1227 static isl::schedule_node markInterIterationAliasFree(isl::schedule_node Node, 1241 static isl::schedule_node markLoopVectorizerDisabled(isl::schedule_node Node) { 1241 static isl::schedule_node markLoopVectorizerDisabled(isl::schedule_node Node) { 1254 static isl::schedule_node 1255 getBandNodeWithOriginDimOrder(isl::schedule_node Node) { 1274 isl::schedule_node 1275 ScheduleTreeOptimizer::optimizeMatMulPattern(isl::schedule_node Node, 1309 bool ScheduleTreeOptimizer::isMatrMultPattern(isl::schedule_node Node, 1351 auto Root = Schedule.get_root(); 1356 isl::schedule_node ScheduleTreeOptimizer::optimizeScheduleNode( 1357 isl::schedule_node Node, const OptimizerAdditionalInfoTy *OAI) { 1425 auto Root = Schedule.get_root(); 1432 isl::schedule_node Node = isl::manage_copy(nodeptr);tools/polly/lib/Transform/ScheduleTreeTransform.cpp
31 RetTy visit(const isl::schedule_node &Node, Args... args) { 31 RetTy visit(const isl::schedule_node &Node, Args... args) { 63 RetTy visitDomain(const isl::schedule_node &Domain, Args... args) { 63 RetTy visitDomain(const isl::schedule_node &Domain, Args... args) { 67 RetTy visitBand(const isl::schedule_node &Band, Args... args) { 67 RetTy visitBand(const isl::schedule_node &Band, Args... args) { 71 RetTy visitSequence(const isl::schedule_node &Sequence, Args... args) { 71 RetTy visitSequence(const isl::schedule_node &Sequence, Args... args) { 75 RetTy visitSet(const isl::schedule_node &Set, Args... args) { 75 RetTy visitSet(const isl::schedule_node &Set, Args... args) { 79 RetTy visitLeaf(const isl::schedule_node &Leaf, Args... args) { 79 RetTy visitLeaf(const isl::schedule_node &Leaf, Args... args) { 83 RetTy visitMark(const isl::schedule_node &Mark, Args... args) { 83 RetTy visitMark(const isl::schedule_node &Mark, Args... args) { 87 RetTy visitExtension(const isl::schedule_node &Extension, Args... args) { 87 RetTy visitExtension(const isl::schedule_node &Extension, Args... args) { 92 RetTy visitFilter(const isl::schedule_node &Extension, Args... args) { 92 RetTy visitFilter(const isl::schedule_node &Extension, Args... args) { 97 RetTy visitSingleChild(const isl::schedule_node &Node, Args... args) { 97 RetTy visitSingleChild(const isl::schedule_node &Node, Args... args) { 101 RetTy visitMultiChild(const isl::schedule_node &Node, Args... args) { 101 RetTy visitMultiChild(const isl::schedule_node &Node, Args... args) { 105 RetTy visitNode(const isl::schedule_node &Node, Args... args) { 105 RetTy visitNode(const isl::schedule_node &Node, Args... args) { 113 : public ScheduleTreeVisitor<Derived, RetTy, Args...> { 114 using BaseTy = ScheduleTreeVisitor<Derived, RetTy, Args...>; 123 RetTy visit(const isl::schedule &Schedule, Args... args) { 129 RetTy visit(const isl::schedule_node &Node, Args... args) { 129 RetTy visit(const isl::schedule_node &Node, Args... args) { 133 RetTy visitNode(const isl::schedule_node &Node, Args... args) { 133 RetTy visitNode(const isl::schedule_node &Node, Args... args) { 148 : public RecursiveScheduleTreeVisitor<Derived, isl::schedule_node, 155 isl::schedule_node visitNode(const isl::schedule_node &Node, Args... args) { 155 isl::schedule_node visitNode(const isl::schedule_node &Node, Args... args) { 159 isl::schedule_node It = Node.first_child(); 186 isl::schedule visitDomain(const isl::schedule_node &Node, Args... args) { 191 isl::schedule visitBand(const isl::schedule_node &Band, Args... args) { 196 isl::schedule_node NewNode = 211 isl::schedule visitSequence(const isl::schedule_node &Sequence, 222 isl::schedule visitSet(const isl::schedule_node &Set, Args... args) { 235 isl::schedule visitLeaf(const isl::schedule_node &Leaf, Args... args) { 239 isl::schedule visitMark(const isl::schedule_node &Mark, Args... args) { 241 isl::schedule_node NewChild = 249 isl::schedule visitExtension(const isl::schedule_node &Extension, 252 isl::schedule_node NewChild = getDerived() 256 isl::schedule_node NewExtension = 257 isl::schedule_node::from_extension(TheExtension); 261 isl::schedule visitFilter(const isl::schedule_node &Filter, Args... args) { 268 isl::schedule visitNode(const isl::schedule_node &Node, Args... args) { 300 isl::schedule visitSequence(const isl::schedule_node &Sequence, 306 isl::schedule_node OldChild = Sequence.child(i); 315 isl::schedule visitSet(const isl::schedule_node &Set, 321 isl::schedule_node OldChild = Set.child(i); 331 isl::schedule visitLeaf(const isl::schedule_node &Leaf, 339 isl::schedule visitBand(const isl::schedule_node &OldNode, 342 isl::schedule_node OldChild = OldNode.first_child(); 371 isl::schedule_node NewNode = 389 isl::schedule visitFilter(const isl::schedule_node &Filter, 399 isl::schedule visitExtension(const isl::schedule_node &Extension, 424 void visitBand(const isl::schedule_node &Band) { 456 isl::schedule_node visitBand(const isl::schedule_node &Band) { 456 isl::schedule_node visitBand(const isl::schedule_node &Band) { 457 isl::schedule_node Result =usr/include/c++/7.4.0/bits/move.h
72 constexpr _Tp&& 73 forward(typename std::remove_reference<_Tp>::type& __t) noexcept 83 constexpr _Tp&& 84 forward(typename std::remove_reference<_Tp>::type&& __t) noexceptusr/include/c++/7.4.0/bits/std_function.h
62 : std::unary_function<_T1, _Res> { }; 390 : public _Maybe_unary_or_binary_function<_Res, _ArgTypes...>, 595 _Res operator()(_ArgTypes... __args) const; 628 using _Invoker_type = _Res (*)(const _Any_data&, _ArgTypes&&...); 706 return _M_invoker(_M_functor, std::forward<_ArgTypes>(__args)...);usr/include/c++/7.4.0/bits/stl_function.h
108 typedef _Arg argument_type;
usr/include/c++/7.4.0/type_traits 1629 { typedef _Tp type; };