llvm/polly/lib/External/isl/isl_seq.c

/*
 * Copyright 2008-2009 Katholieke Universiteit Leuven
 * Copyright 2011      INRIA Saclay
 *
 * Use of this software is governed by the MIT license
 *
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
 */

#include <isl_ctx_private.h>
#include <isl_seq.h>

void isl_seq_clr(isl_int *p, unsigned len)
{ … }

void isl_seq_set_si(isl_int *p, int v, unsigned len)
{ … }

void isl_seq_set(isl_int *p, isl_int v, unsigned len)
{ … }

void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len)
{ … }

void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len)
{ … }

void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
{ … }

void isl_seq_addmul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
{ … }

void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len)
{ … }

void isl_seq_scale(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{ … }

void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{ … }

void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{ … }

void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{ … }

void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{ … }

void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1,
			isl_int m2, isl_int *src2, unsigned len)
{ … }

/* Eliminate element "pos" from "dst" using "src".
 * In particular, let d = dst[pos] and s = src[pos], then
 * dst is replaced by (|s| dst - sgn(s)d src)/gcd(s,d),
 * such that dst[pos] is zero after the elimination.
 * If "m" is not NULL, then *m is multiplied by |s|/gcd(s,d).
 * That is, it is multiplied by the same factor as "dst".
 */
void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len,
		  isl_int *m)
{ … }

int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len)
{ … }

int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len)
{ … }

int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len)
{ … }

int isl_seq_first_non_zero(isl_int *p, unsigned len)
{ … }

int isl_seq_last_non_zero(isl_int *p, unsigned len)
{ … }

void isl_seq_abs_max(isl_int *p, unsigned len, isl_int *max)
{ … }

int isl_seq_abs_min_non_zero(isl_int *p, unsigned len)
{ … }

void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd)
{ … }

void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len)
{ … }

void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm)
{ … }

void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len,
			   isl_int *prod)
{ … }

uint32_t isl_seq_hash(isl_int *p, unsigned len, uint32_t hash)
{ … }

/* Given two affine expressions "p" of length p_len (including the
 * denominator and the constant term) and "subs" of length subs_len,
 * plug in "subs" for the variable at position "pos".
 * The variables of "subs" and "p" are assumed to match up to subs_len,
 * but "p" may have additional variables.
 * "v" is an initialized isl_int that can be used internally.
 *
 * In particular, if "p" represents the expression
 *
 *	(a i + g)/m
 *
 * with i the variable at position "pos" and "subs" represents the expression
 *
 *	f/d
 *
 * then the result represents the expression
 *
 *	(a f + d g)/(m d)
 *
 */
void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
	int p_len, int subs_len, isl_int v)
{ … }

uint32_t isl_seq_get_hash(isl_int *p, unsigned len)
{ … }

uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits)
{ … }

void isl_seq_dump(isl_int *p, unsigned len)
{ … }