2011-04-29 14:27:02 +08:00
|
|
|
//===- GmpConv.cpp - Recreate LLVM IR from the Scop. ---------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// Functions for converting between gmp objects and apint.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "polly/Support/GICHelper.h"
|
2014-07-25 07:48:02 +08:00
|
|
|
#include "llvm/IR/Value.h"
|
2013-05-07 16:11:54 +08:00
|
|
|
#include "isl/aff.h"
|
2011-04-29 14:27:02 +08:00
|
|
|
#include "isl/map.h"
|
2011-07-01 04:01:02 +08:00
|
|
|
#include "isl/schedule.h"
|
2013-05-07 16:11:54 +08:00
|
|
|
#include "isl/set.h"
|
2016-02-18 23:24:42 +08:00
|
|
|
#include "isl/space.h"
|
2013-05-07 16:11:54 +08:00
|
|
|
#include "isl/union_map.h"
|
|
|
|
#include "isl/union_set.h"
|
2013-06-21 14:41:31 +08:00
|
|
|
#include "isl/val.h"
|
|
|
|
|
2016-08-26 18:43:28 +08:00
|
|
|
#include <climits>
|
|
|
|
|
2011-04-29 14:27:02 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2013-06-21 14:41:31 +08:00
|
|
|
__isl_give isl_val *polly::isl_valFromAPInt(isl_ctx *Ctx, const APInt Int,
|
|
|
|
bool IsSigned) {
|
|
|
|
APInt Abs;
|
|
|
|
isl_val *v;
|
|
|
|
|
2016-08-26 20:01:07 +08:00
|
|
|
// As isl is interpreting the input always as unsigned value, we need some
|
|
|
|
// additional pre and post processing to import signed values. The approach
|
|
|
|
// we take is to first obtain the absolute value of Int and then negate the
|
|
|
|
// value after it has been imported to isl.
|
|
|
|
//
|
|
|
|
// It should be noted that the smallest integer value represented in two's
|
|
|
|
// complement with a certain amount of bits does not have a corresponding
|
|
|
|
// positive representation in two's complement representation with the same
|
|
|
|
// number of bits. E.g. 110 (-2) does not have a corresponding value for (2).
|
|
|
|
// To ensure that there is always a corresponding value available we first
|
|
|
|
// sign-extend the input by one bit and only then take the absolute value.
|
2013-06-21 14:41:31 +08:00
|
|
|
if (IsSigned)
|
2016-08-26 20:01:07 +08:00
|
|
|
Abs = Int.sext(Int.getBitWidth() + 1).abs();
|
2013-06-21 14:41:31 +08:00
|
|
|
else
|
|
|
|
Abs = Int;
|
|
|
|
|
|
|
|
const uint64_t *Data = Abs.getRawData();
|
|
|
|
unsigned Words = Abs.getNumWords();
|
|
|
|
|
|
|
|
v = isl_val_int_from_chunks(Ctx, Words, sizeof(uint64_t), Data);
|
|
|
|
|
|
|
|
if (IsSigned && Int.isNegative())
|
|
|
|
v = isl_val_neg(v);
|
|
|
|
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
APInt polly::APIntFromVal(__isl_take isl_val *Val) {
|
|
|
|
uint64_t *Data;
|
|
|
|
int NumChunks;
|
2016-08-26 18:43:28 +08:00
|
|
|
const static int ChunkSize = sizeof(uint64_t);
|
2013-06-21 14:41:31 +08:00
|
|
|
|
2016-08-26 18:43:28 +08:00
|
|
|
assert(isl_val_is_int(Val) && "Only integers can be converted to APInt");
|
2013-06-21 14:41:31 +08:00
|
|
|
|
2016-08-26 18:43:28 +08:00
|
|
|
NumChunks = isl_val_n_abs_num_chunks(Val, ChunkSize);
|
|
|
|
Data = (uint64_t *)malloc(NumChunks * ChunkSize);
|
|
|
|
isl_val_get_abs_num_chunks(Val, ChunkSize, Data);
|
|
|
|
int NumBits = CHAR_BIT * ChunkSize * NumChunks;
|
|
|
|
APInt A(NumBits, NumChunks, Data);
|
2013-06-21 14:41:31 +08:00
|
|
|
|
2016-08-26 18:43:28 +08:00
|
|
|
// As isl provides only an interface to obtain data that describes the
|
|
|
|
// absolute value of an isl_val, A at this point always contains a positive
|
|
|
|
// number. In case Val was originally negative, we expand the size of A by
|
|
|
|
// one and negate the value (in two's complement representation). As a result,
|
|
|
|
// the new value in A corresponds now with Val.
|
2013-06-21 14:41:31 +08:00
|
|
|
if (isl_val_is_neg(Val)) {
|
|
|
|
A = A.zext(A.getBitWidth() + 1);
|
|
|
|
A = -A;
|
|
|
|
}
|
|
|
|
|
2016-08-26 18:43:28 +08:00
|
|
|
// isl may represent small numbers with more than the minimal number of bits.
|
|
|
|
// We truncate the APInt to the minimal number of bits needed to represent the
|
|
|
|
// signed value it contains, to ensure that the bitwidth is always minimal.
|
2013-06-21 14:41:31 +08:00
|
|
|
if (A.getMinSignedBits() < A.getBitWidth())
|
|
|
|
A = A.trunc(A.getMinSignedBits());
|
|
|
|
|
|
|
|
free(Data);
|
|
|
|
isl_val_free(Val);
|
|
|
|
return A;
|
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
template <typename ISLTy, typename ISL_CTX_GETTER, typename ISL_PRINTER>
|
2013-05-07 15:30:56 +08:00
|
|
|
static inline std::string stringFromIslObjInternal(__isl_keep ISLTy *isl_obj,
|
|
|
|
ISL_CTX_GETTER ctx_getter_fn,
|
|
|
|
ISL_PRINTER printer_fn) {
|
2015-12-14 03:35:26 +08:00
|
|
|
if (!isl_obj)
|
|
|
|
return "null";
|
2012-07-05 16:42:39 +08:00
|
|
|
isl_ctx *ctx = ctx_getter_fn(isl_obj);
|
|
|
|
isl_printer *p = isl_printer_to_str(ctx);
|
2016-09-08 22:34:54 +08:00
|
|
|
p = printer_fn(p, isl_obj);
|
2011-08-20 19:11:18 +08:00
|
|
|
char *char_str = isl_printer_get_str(p);
|
2015-11-10 23:09:44 +08:00
|
|
|
std::string string;
|
|
|
|
if (char_str)
|
|
|
|
string = char_str;
|
|
|
|
else
|
|
|
|
string = "null";
|
2011-08-20 19:11:18 +08:00
|
|
|
free(char_str);
|
2011-04-29 14:27:02 +08:00
|
|
|
isl_printer_free(p);
|
|
|
|
return string;
|
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_map *map) {
|
|
|
|
return stringFromIslObjInternal(map, isl_map_get_ctx, isl_printer_print_map);
|
2012-07-05 16:42:39 +08:00
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_set *set) {
|
|
|
|
return stringFromIslObjInternal(set, isl_set_get_ctx, isl_printer_print_set);
|
2011-04-29 14:27:02 +08:00
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_union_map *umap) {
|
2012-07-05 16:42:39 +08:00
|
|
|
return stringFromIslObjInternal(umap, isl_union_map_get_ctx,
|
|
|
|
isl_printer_print_union_map);
|
2011-04-29 14:27:02 +08:00
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_union_set *uset) {
|
2012-07-05 16:42:39 +08:00
|
|
|
return stringFromIslObjInternal(uset, isl_union_set_get_ctx,
|
|
|
|
isl_printer_print_union_set);
|
2011-04-29 14:27:02 +08:00
|
|
|
}
|
2011-07-01 04:01:02 +08:00
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_schedule *schedule) {
|
2014-11-22 03:39:42 +08:00
|
|
|
return stringFromIslObjInternal(schedule, isl_schedule_get_ctx,
|
2012-07-05 16:42:39 +08:00
|
|
|
isl_printer_print_schedule);
|
2011-07-01 04:01:02 +08:00
|
|
|
}
|
2012-07-05 16:55:31 +08:00
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_multi_aff *maff) {
|
2012-07-05 16:55:31 +08:00
|
|
|
return stringFromIslObjInternal(maff, isl_multi_aff_get_ctx,
|
|
|
|
isl_printer_print_multi_aff);
|
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_pw_multi_aff *pma) {
|
2012-07-05 16:55:31 +08:00
|
|
|
return stringFromIslObjInternal(pma, isl_pw_multi_aff_get_ctx,
|
|
|
|
isl_printer_print_pw_multi_aff);
|
|
|
|
}
|
|
|
|
|
2016-02-20 11:40:19 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_union_pw_multi_aff *upma) {
|
|
|
|
return stringFromIslObjInternal(upma, isl_union_pw_multi_aff_get_ctx,
|
|
|
|
isl_printer_print_union_pw_multi_aff);
|
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_aff *aff) {
|
2012-07-05 16:55:31 +08:00
|
|
|
return stringFromIslObjInternal(aff, isl_aff_get_ctx, isl_printer_print_aff);
|
|
|
|
}
|
|
|
|
|
2013-02-22 16:21:52 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_pw_aff *pwaff) {
|
2012-07-05 16:55:31 +08:00
|
|
|
return stringFromIslObjInternal(pwaff, isl_pw_aff_get_ctx,
|
|
|
|
isl_printer_print_pw_aff);
|
|
|
|
}
|
2014-07-25 07:48:02 +08:00
|
|
|
|
2016-02-18 23:24:42 +08:00
|
|
|
std::string polly::stringFromIslObj(__isl_keep isl_space *space) {
|
|
|
|
return stringFromIslObjInternal(space, isl_space_get_ctx,
|
|
|
|
isl_printer_print_space);
|
|
|
|
}
|
|
|
|
|
2014-07-25 07:48:02 +08:00
|
|
|
static void replace(std::string &str, const std::string &find,
|
|
|
|
const std::string &replace) {
|
|
|
|
size_t pos = 0;
|
|
|
|
while ((pos = str.find(find, pos)) != std::string::npos) {
|
|
|
|
str.replace(pos, find.length(), replace);
|
|
|
|
pos += replace.length();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void makeIslCompatible(std::string &str) {
|
|
|
|
replace(str, ".", "_");
|
|
|
|
replace(str, "\"", "_");
|
2015-07-09 15:31:45 +08:00
|
|
|
replace(str, " ", "__");
|
|
|
|
replace(str, "=>", "TO");
|
2014-07-25 07:48:02 +08:00
|
|
|
}
|
|
|
|
|
2015-02-20 02:09:39 +08:00
|
|
|
std::string polly::getIslCompatibleName(const std::string &Prefix,
|
|
|
|
const std::string &Middle,
|
|
|
|
const std::string &Suffix) {
|
|
|
|
std::string S = Prefix + Middle + Suffix;
|
|
|
|
makeIslCompatible(S);
|
|
|
|
return S;
|
|
|
|
}
|
|
|
|
|
2015-02-20 06:16:12 +08:00
|
|
|
std::string polly::getIslCompatibleName(const std::string &Prefix,
|
|
|
|
const Value *Val,
|
2015-02-20 02:09:39 +08:00
|
|
|
const std::string &Suffix) {
|
2014-07-25 07:48:02 +08:00
|
|
|
std::string ValStr;
|
|
|
|
raw_string_ostream OS(ValStr);
|
|
|
|
Val->printAsOperand(OS, false);
|
|
|
|
ValStr = OS.str();
|
|
|
|
// Remove the leading %
|
|
|
|
ValStr.erase(0, 1);
|
2015-02-20 02:09:39 +08:00
|
|
|
return getIslCompatibleName(Prefix, ValStr, Suffix);
|
2014-07-25 07:48:02 +08:00
|
|
|
}
|
Add -polly-flatten-schedule pass.
The -polly-flatten-schedule pass reduces the number of scattering
dimensions in its isl_union_map form to make them easier to understand.
It is not meant to be used in production, only for debugging and
regression tests.
To illustrate, how it can make sets simpler, here is a lifetime set
used computed by the porposed DeLICM pass without flattening:
{ Stmt_reduction_for[0, 4] -> [0, 2, o2, o3] : o2 < 0;
Stmt_reduction_for[0, 4] -> [0, 1, o2, o3] : o2 >= 5;
Stmt_reduction_for[0, 4] -> [0, 1, 4, o3] : o3 > 0;
Stmt_reduction_for[0, i1] -> [0, 1, i1, 1] : 0 <= i1 <= 3;
Stmt_reduction_for[0, 4] -> [0, 2, 0, o3] : o3 <= 0 }
And here the same lifetime for a semantically identical one-dimensional
schedule:
{ Stmt_reduction_for[0, i1] -> [2 + 3i1] : 0 <= i1 <= 4 }
Differential Revision: https://reviews.llvm.org/D24310
llvm-svn: 280948
2016-09-08 23:02:36 +08:00
|
|
|
|
|
|
|
void polly::foreachElt(NonowningIslPtr<isl_union_map> UMap,
|
|
|
|
const std::function<void(IslPtr<isl_map> Map)> &F) {
|
|
|
|
isl_union_map_foreach_map(
|
|
|
|
UMap.keep(),
|
|
|
|
[](__isl_take isl_map *Map, void *User) -> isl_stat {
|
|
|
|
auto &F =
|
|
|
|
*static_cast<const std::function<void(IslPtr<isl_map>)> *>(User);
|
|
|
|
F(give(Map));
|
|
|
|
return isl_stat_ok;
|
|
|
|
},
|
|
|
|
const_cast<void *>(static_cast<const void *>(&F)));
|
|
|
|
}
|
|
|
|
|
|
|
|
void polly::foreachElt(NonowningIslPtr<isl_union_pw_aff> UPwAff,
|
|
|
|
const std::function<void(IslPtr<isl_pw_aff>)> &F) {
|
|
|
|
isl_union_pw_aff_foreach_pw_aff(
|
|
|
|
UPwAff.keep(),
|
|
|
|
[](__isl_take isl_pw_aff *PwAff, void *User) -> isl_stat {
|
|
|
|
auto &F =
|
|
|
|
*static_cast<const std::function<void(IslPtr<isl_pw_aff>)> *>(User);
|
|
|
|
F(give(PwAff));
|
|
|
|
return isl_stat_ok;
|
|
|
|
},
|
|
|
|
const_cast<void *>(static_cast<const void *>(&F)));
|
|
|
|
}
|
|
|
|
|
|
|
|
isl_stat polly::foreachEltWithBreak(
|
|
|
|
NonowningIslPtr<isl_map> Map,
|
|
|
|
const std::function<isl_stat(IslPtr<isl_basic_map>)> &F) {
|
|
|
|
return isl_map_foreach_basic_map(
|
|
|
|
Map.keep(),
|
|
|
|
[](__isl_take isl_basic_map *BMap, void *User) -> isl_stat {
|
|
|
|
auto &F = *static_cast<
|
|
|
|
const std::function<isl_stat(IslPtr<isl_basic_map>)> *>(User);
|
|
|
|
return F(give(BMap));
|
|
|
|
},
|
|
|
|
const_cast<void *>(static_cast<const void *>(&F)));
|
|
|
|
}
|
|
|
|
|
|
|
|
isl_stat polly::foreachEltWithBreak(
|
|
|
|
NonowningIslPtr<isl_union_map> UMap,
|
|
|
|
const std::function<isl_stat(IslPtr<isl_map> Map)> &F) {
|
|
|
|
return isl_union_map_foreach_map(
|
|
|
|
UMap.keep(),
|
|
|
|
[](__isl_take isl_map *Map, void *User) -> isl_stat {
|
|
|
|
auto &F =
|
|
|
|
*static_cast<const std::function<isl_stat(IslPtr<isl_map> Map)> *>(
|
|
|
|
User);
|
|
|
|
return F(give(Map));
|
|
|
|
},
|
|
|
|
const_cast<void *>(static_cast<const void *>(&F)));
|
|
|
|
}
|
|
|
|
|
|
|
|
isl_stat polly::foreachPieceWithBreak(
|
|
|
|
NonowningIslPtr<isl_pw_aff> PwAff,
|
|
|
|
const std::function<isl_stat(IslPtr<isl_set>, IslPtr<isl_aff>)> &F) {
|
|
|
|
return isl_pw_aff_foreach_piece(
|
|
|
|
PwAff.keep(),
|
|
|
|
[](__isl_take isl_set *Domain, __isl_take isl_aff *Aff,
|
|
|
|
void *User) -> isl_stat {
|
|
|
|
auto &F = *static_cast<
|
|
|
|
const std::function<isl_stat(IslPtr<isl_set>, IslPtr<isl_aff>)> *>(
|
|
|
|
User);
|
|
|
|
return F(give(Domain), give(Aff));
|
|
|
|
},
|
|
|
|
const_cast<void *>(static_cast<const void *>(&F)));
|
|
|
|
}
|