forked from OSchip/llvm-project
129 lines
4.6 KiB
C
129 lines
4.6 KiB
C
#ifndef PPCG_H
|
|
#define PPCG_H
|
|
|
|
#include <isl/schedule.h>
|
|
#include <isl/set.h>
|
|
#include <isl/union_set.h>
|
|
#include <isl/union_map.h>
|
|
#include <isl/id_to_ast_expr.h>
|
|
#include <pet.h>
|
|
|
|
#include "ppcg_options.h"
|
|
|
|
const char *ppcg_base_name(const char *filename);
|
|
int ppcg_extract_base_name(char *name, const char *input);
|
|
|
|
/* Representation of the scop for use inside PPCG.
|
|
*
|
|
* "options" are the options specified by the user.
|
|
* Some fields in this structure may depend on some of the options.
|
|
*
|
|
* "start" and "end" are file offsets of the corresponding program text.
|
|
* "context" represents constraints on the parameters.
|
|
* "domain" is the union of all iteration domains.
|
|
* "call" contains the iteration domains of statements with a call expression.
|
|
* "reads" contains all potential read accesses.
|
|
* "tagged_reads" is the same as "reads", except that the domain is a wrapped
|
|
* relation mapping an iteration domain to a reference identifier
|
|
* "live_in" contains the potential read accesses that potentially
|
|
* have no corresponding writes in the scop.
|
|
* "may_writes" contains all potential write accesses.
|
|
* "tagged_may_writes" is the same as "may_writes", except that the domain
|
|
* is a wrapped relation mapping an iteration domain
|
|
* to a reference identifier
|
|
* "must_writes" contains all definite write accesses.
|
|
* "tagged_must_writes" is the same as "must_writes", except that the domain
|
|
* is a wrapped relation mapping an iteration domain
|
|
* to a reference identifier
|
|
* "live_out" contains the potential write accesses that are potentially
|
|
* not killed by any kills or any other writes.
|
|
* "must_kills" contains all definite kill accesses.
|
|
* "tagged_must_kills" is the same as "must_kills", except that the domain
|
|
* is a wrapped relation mapping an iteration domain
|
|
* to a reference identifier.
|
|
*
|
|
* "tagger" maps tagged iteration domains to the corresponding untagged
|
|
* iteration domain.
|
|
*
|
|
* "independence" is the union of all independence filters.
|
|
*
|
|
* "dep_flow" represents the potential flow dependences.
|
|
* "tagged_dep_flow" is the same as "dep_flow", except that both domain and
|
|
* range are wrapped relations mapping an iteration domain to
|
|
* a reference identifier. May be NULL if not computed.
|
|
* "dep_false" represents the potential false (anti and output) dependences.
|
|
* "dep_forced" represents the validity constraints that should be enforced
|
|
* even when live-range reordering is used.
|
|
* In particular, these constraints ensure that all live-in
|
|
* accesses remain live-in and that all live-out accesses remain live-out
|
|
* and that multiple potential sources for the same read are
|
|
* executed in the original order.
|
|
* "dep_order"/"tagged_dep_order" represents the order dependences between
|
|
* the live range intervals in "dep_flow"/"tagged_dep_flow".
|
|
* It is only used if the live_range_reordering
|
|
* option is set. Otherwise it is NULL.
|
|
* If "dep_order" is used, then "dep_false" only contains a limited
|
|
* set of anti and output dependences.
|
|
* "schedule" represents the (original) schedule.
|
|
*
|
|
* "names" contains all variable names that are in use by the scop.
|
|
* The names are mapped to a dummy value.
|
|
*
|
|
* "pet" is the original pet_scop.
|
|
*/
|
|
struct ppcg_scop {
|
|
struct ppcg_options *options;
|
|
|
|
unsigned start;
|
|
unsigned end;
|
|
|
|
isl_set *context;
|
|
isl_union_set *domain;
|
|
isl_union_set *call;
|
|
isl_union_map *tagged_reads;
|
|
isl_union_map *reads;
|
|
isl_union_map *live_in;
|
|
isl_union_map *tagged_may_writes;
|
|
isl_union_map *may_writes;
|
|
isl_union_map *tagged_must_writes;
|
|
isl_union_map *must_writes;
|
|
isl_union_map *live_out;
|
|
isl_union_map *tagged_must_kills;
|
|
isl_union_map *must_kills;
|
|
|
|
isl_union_pw_multi_aff *tagger;
|
|
|
|
isl_union_map *independence;
|
|
|
|
isl_union_map *dep_flow;
|
|
isl_union_map *tagged_dep_flow;
|
|
isl_union_map *dep_false;
|
|
isl_union_map *dep_forced;
|
|
isl_union_map *dep_order;
|
|
isl_union_map *tagged_dep_order;
|
|
isl_schedule *schedule;
|
|
|
|
isl_id_to_ast_expr *names;
|
|
|
|
struct pet_scop *pet;
|
|
};
|
|
|
|
int ppcg_scop_any_hidden_declarations(struct ppcg_scop *scop);
|
|
__isl_give isl_id_list *ppcg_scop_generate_names(struct ppcg_scop *scop,
|
|
int n, const char *prefix);
|
|
|
|
int ppcg_transform(isl_ctx *ctx, const char *input, FILE *out,
|
|
struct ppcg_options *options,
|
|
__isl_give isl_printer *(*fn)(__isl_take isl_printer *p,
|
|
struct ppcg_scop *scop, void *user), void *user);
|
|
|
|
__isl_give isl_schedule *ppcg_compute_schedule(
|
|
__isl_take isl_schedule_constraints *sc,
|
|
__isl_keep isl_schedule *schedule, struct ppcg_options *options);
|
|
|
|
void compute_tagger(struct ppcg_scop *ps);
|
|
void compute_dependences(struct ppcg_scop *scop);
|
|
void eliminate_dead_code(struct ppcg_scop *ps);
|
|
void *ppcg_scop_free(struct ppcg_scop *ps);
|
|
#endif
|