Polaris: access_util.h Source File

access_util.h Go to the documentation of this file. //// /// #ifndef _ACCESS_UTIL_H #define _ACCESS_UTIL_H /// //// /// file access_util.h /// /// \file /// \brief access regions utility functions /// \defgroup Polaris /// \ingroup Polaris /// access_util.h /// \see access_util.h /// \see access_util.cc /// #include "../AbstractAccess.h" #include "../SimEdgeKernel.h" #include "../SimBiGraph.h" #include "../SimGraphIterator.h" #include "../SimEdge.h" #include "../Program.h" #include "../IPAStats.h" enum AR_MEET { AR_X, AR_Y, AR_OR, AR_AND, AR_X_NOTY, AR_NOTX_Y }; enum AR_CONSERVATIVE { UNDERESTIMATE, OVERESTIMATE }; enum AR_CERTAINTY { AR_YES, AR_NO, AR_UNSURE }; struct Dimcount { int dims; int count; Dimcount * next; }; struct Accreg_set { AbstractAccess * ar; int count; Accreg_set * next; }; struct AR_Stats { bool print; int total; int exact; int inexact; int proc_boundary; ///< how many total procedure boundary crossings (via call) int both_same_dims; ///< at proc boundary, symbol has same # dims int caller_grtr_dims; ///< at proc boundary, caller symbol has > # dims int callee_grtr_dims; ///< at proc boundary, callee has same # dims int callee_1; ///< caller: n dims; callee: 1 dim int caller_1; ///< caller: 1 dim; callee: n dims int subscr_subscr; int match_declared_dim; ///< and not triangular and affine and not sub-sub int less_declared_dim; ///< and not triangular and affine and not sub-sub int greater_declared_dim; ///< and not triangular and affine and not sub-sub int nonaffine; ///< and not subscripted-subscript int triangular; ///< and affine and not sub-sub int diagonal; ///< and affine and not sub-sub and not triangular int total_dims; ///< total dimensions from the group of descriptors int proven_monotonic; int proven_nonmonotonic; int monotonic_unknown; int minnest; int maxnest; int totalnest; Dimcount * base_dc; Dimcount * last_dc; int dc_count; Accreg_set * base_ars_uniq; Accreg_set * last_ars_uniq; int ars_uniq_count; Accreg_set * base_ars_uniq_dims; Accreg_set * last_ars_uniq_dims; int ars_uniq_dims_count; Accreg_set * base_ars_uniq_strd; Accreg_set * last_ars_uniq_strd; int ars_uniq_strd_count; Accreg_set * base_ars_uniq_dims_st; Accreg_set * last_ars_uniq_dims_st; int ars_uniq_dims_st_count; }; void print_access_region_statistics(ostream & o, const RefList<AbstractAccess> & list, Statement & stmt, Symbol & sym ); void print_access_region_statistics(ostream & o, const List<AbstractAccess> & list, Statement & stmt, Symbol & sym ); void init_ar_statistics( AR_Stats & stats ); void collect_ar_statistics (AbstractAccess & access_region, AR_Stats & stats, Symbol & sym ); void print_ar_stats_line( ostream & o, Statement & stmt, AR_Stats & stats ); bool intersect_ARDs (AbstractAccess & ard1, AbstractAccess & ard2, RangeAccessor & range_acc, SimEdge & edge, AR_CONSERVATIVE direction, List<AbstractAccess> & new_ard1, List<AbstractAccess> & new_ard2, List<AbstractAccess> & intersect, AR_MEET meet_op, IPAStats & istats); ///< low-level intersection routine bool ar_intersect (List<AbstractAccess> & list1, AR_CONSERVATIVE direction, IPAStats & istats); bool ar_intersect (List<AbstractAccess> & list1, int ard1, RefList<AbstractAccess> & discard1, List<AbstractAccess> & list2, int ard2, SimBiGraph & sbg, SimEdge & edge, IPAStats & istats); bool ar_intersect (List<AbstractAccess> & list1, int ard1, RefList<AbstractAccess> & discard1, List<AbstractAccess> & list2, int ard2, RefList<AbstractAccess> & discard2, SimBiGraph & sg, SimEdge & edge, List<AbstractAccess> & intersect, AR_CONSERVATIVE direction, AR_MEET meet_op, IPAStats & istats); void ar_intersect(List<AbstractAccess> & list1, List<AbstractAccess> & list2, AR_CONSERVATIVE direction, List<AbstractAccess> & result, IPAStats & istats); void ar_subtract(List<AbstractAccess> & list1, List<AbstractAccess> & list2, AR_CONSERVATIVE direction, List<AbstractAccess> & result); void ar_subtract(List<AbstractAccess> & list1, List<AbstractAccess> & list2, AR_CONSERVATIVE direction); bool ar_plausible_execution(List<AbstractAccess> & list); ///< Determine whether any descriptors have a non-.FALSE. exec predicate bool ar_plausible_execution(AbstractAccess & aa); ///< Determine whether this descriptor has a non-.FALSE. exec predicate bool ar_subregion(AbstractAccess & ar1, AbstractAccess & ar2, SimEdge & edge, AR_CONSERVATIVE direction, Array<int> *match = 0); void ar_append(List<AbstractAccess> & list1, List<AbstractAccess> & list2, IPAStats & istats); void ar_append_new_pred(List<AbstractAccess> & list1, List<AbstractAccess> & list2, List<AbstractAccess> & lista, int indexa, List<AbstractAccess> & listb, int indexb, AR_MEET meet_op, PredicateRepository & repos, IPAStats & istats); void ar_append(List<AbstractAccess> & list1, AbstractAccess * ard); AbstractAccess * compute_abstract_access(const Expression & expr, Statement * stmt, AR_TYPE artype ); SimilarityType contig_type (SimilarityType oldtype); void check_access_patterns(Program & prog, ProgramUnit & pgm); void simplify_descriptors( List<AbstractAccess> &, IPAStats & istats); void simplify_descriptors_scalar( List<AbstractAccess> &, IPAStats &); SimTypeOfChange ar_aggregate(SimEdge & edge, SimGraph & sg, List<AbstractAccess> & list ); SimTypeOfChange contiguous_aggregation ( RangeAccessor * range_acc, AbstractAccess * edge1, AbstractAccess * edge2, int smaller_offset, int dim_less_index, int dim_grt_index ); RefList<AbstractAccess> * ar_interleave(SimGraphIterator & sgit, SimGraph & sg); void add_to_chain(AbstractAccess *node1, AbstractAccess *node2, List<RefList<AbstractAccess> > & chain_list); void calc_stride_span_match(AbstractAccess & aa1, AbstractAccess & aa2, RangeAccessor & range_acc, Array<int> & stride_match1, Array<int> & stride_match2, Array<bool> & span_match1, Array<bool> & span_match2); Array<int> * invert_match(Array<int> * match_index, int new_dims); ///< Take the match of ARD1 to ARD2 indicated by match_index and return a match array from ///< ARD2 to ARD2. bool ar_implies(AbstractAccess & aa1, AbstractAccess & aa2); bool ar_offsets_match(AbstractAccess & descr1, AbstractAccess & descr2); bool ar_predicates_equal(AbstractAccess & aa1, AbstractAccess & aa2); bool ar_predicates_negation(AbstractAccess & aa1, AbstractAccess & aa2); Expression * and_predicate(Expression * ex1, Expression * ex2, Expression * ex3=0); Expression * or_predicate(Expression * ex1, Expression * ex2, Expression * ex3=0); bool ar_subsume(Expression & implier, Expression & implied); bool subsume_relation(const Expression & implier_subtree, const Expression & implied_subtree); Expression * transform_not_equal(Expression * expr); bool test_linkedness(const Expression & expr1, const Expression & expr2); void elim_equivalent_descrs( List<AbstractAccess> & list, IPAStats & istats ); bool ar_descriptors_equal( AbstractAccess & ard1, AbstractAccess & ard2 ); bool ar_descriptor_member (List<AbstractAccess> & list, AbstractAccess & lmad); int ar_effort_limit ( ); void ar_replace_with_approx(List<AbstractAccess> & list); bool divides_diff (Expression & expr, Expression * diff, AbstractAccess & ard1, AbstractAccess & ard2, AR_CONSERVATIVE direction); bool is_singleton(Symbol & index, Expression & expr); #endif

© 1995-2005 University of Illinois, Urbana-Champaign. All rights reserved.  Fri Mar 25 23:05:36 2005