| polylib.h | polylib.h | |||
|---|---|---|---|---|
| skipping to change at line 13 | skipping to change at line 13 | |||
| */ | */ | |||
| /* WARNING: you should not include directly this file, but use | /* WARNING: you should not include directly this file, but use | |||
| polylib32.h or polylib64.h (for 32 or 64 bits integers). | polylib32.h or polylib64.h (for 32 or 64 bits integers). | |||
| */ | */ | |||
| #if POLYLIB_BITS == 32 | #if POLYLIB_BITS == 32 | |||
| #define LINEAR_VALUE_IS_INT | #define LINEAR_VALUE_IS_INT | |||
| #elif POLYLIB_BITS == 64 | #elif POLYLIB_BITS == 64 | |||
| #define LINEAR_VALUE_IS_LONGLONG | #define LINEAR_VALUE_IS_LONGLONG | |||
| #define LINEAR_VALUE_PROTECT_MULTIPLY | #define LINEAR_VALUE_PROTECT_MULTIPLY | |||
| #define LINEAR_VALUE_ASSUME_SOFTWARE_IDIV | #define LINEAR_VALUE_ASSUME_SOFTWARE_IDIV | |||
| #endif | #endif | |||
| #if ! defined(LINEAR_VALUE_IS_LONGLONG) \ | #if ! defined(LINEAR_VALUE_IS_LONGLONG) \ | |||
| && ! defined(LINEAR_VALUE_IS_LONG) \ | && ! defined(LINEAR_VALUE_IS_LONG) \ | |||
| && ! defined(LINEAR_VALUE_IS_INT) \ | && ! defined(LINEAR_VALUE_IS_INT) \ | |||
| && ! defined(LINEAR_VALUE_IS_CHARS) \ | && ! defined(LINEAR_VALUE_IS_CHARS) \ | |||
| && ! defined(GNUMP) \ | && ! defined(GNUMP) \ | |||
| && ! defined(CLN) | && ! defined(CLN) | |||
| #error Please define LINEAR_VALUE_IS_* or #include polylib32.h or polylib64 .h | #error Please define LINEAR_VALUE_IS_* or #include polylib32.h or polylib64 .h | |||
| #endif | #endif | |||
| End of changes. 1 change blocks. | ||||
| 2 lines changed or deleted | 2 lines changed or added | |||
| ranking.h | ranking.h | |||
|---|---|---|---|---|
| skipping to change at line 23 | skipping to change at line 23 | |||
| You should have received a copy of the GNU General Public License | You should have received a copy of the GNU General Public License | |||
| along with PolyLib. If not, see <http://www.gnu.org/licenses/>. | along with PolyLib. If not, see <http://www.gnu.org/licenses/>. | |||
| */ | */ | |||
| /** | /** | |||
| * Tools to compute the ranking function of an iteration J: the number of | * Tools to compute the ranking function of an iteration J: the number of | |||
| * integer points in P that are lexicographically inferior to J | * integer points in P that are lexicographically inferior to J | |||
| * @author B. Meister <meister@icps.u-strasbg.fr> | * @author B. Meister <meister@icps.u-strasbg.fr> | |||
| * 6/2005 | * 6/2005 | |||
| * LSIIT-ICPS, UMR 7005 CNRS Universit� Louis Pasteur | * LSIIT-ICPS, UMR 7005 CNRS Universite Louis Pasteur | |||
| * HiPEAC Network | * HiPEAC Network | |||
| */ | */ | |||
| #ifndef __BM_POLYLIB_RANKING_H__ | #ifndef __BM_POLYLIB_RANKING_H__ | |||
| #define __BM_POLYLIB_RANKING_H__ | #define __BM_POLYLIB_RANKING_H__ | |||
| #include <polylib/polylib.h> | #include <polylib/polylib.h> | |||
| /* | /* | |||
| * Returns a list of polytopes needed to compute | * Returns a list of polytopes needed to compute | |||
| * the number of points in P that are lexicographically | * the number of points in P that are lexicographically | |||
| End of changes. 1 change blocks. | ||||
| 1 lines changed or deleted | 1 lines changed or added | |||