File: isl_factorization.h

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (34 lines) | stat: -rw-r--r-- 782 bytes parent folder | download | duplicates (9) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
 
#ifndef ISL_FACTORIZATION_H
#define ISL_FACTORIZATION_H

#include <isl/set.h>
#include <isl_morph.h>

#if defined(__cplusplus)
extern "C" {
#endif

/* Data for factorizing a particular basic set.
 * After applying "morph" to the basic set, there are "n_group"
 * groups of consecutive set variables, each of length "len[i]",
 * with 0 <= i < n_group.
 * If no factorization is possible, then "n_group" is set to 0.
 */
struct isl_factorizer {
	isl_morph	*morph;
	int		n_group;
	int		*len;
};
typedef struct isl_factorizer isl_factorizer;

__isl_give isl_factorizer *isl_basic_set_factorizer(
	__isl_keep isl_basic_set *bset);

void isl_factorizer_free(__isl_take isl_factorizer *f);
void isl_factorizer_dump(__isl_take isl_factorizer *f);

#if defined(__cplusplus)
}
#endif

#endif