Coverage Report

Created: 2017-11-23 03:11

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_seq.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2008-2009 Katholieke Universiteit Leuven
3
 * Copyright 2011      INRIA Saclay
4
 *
5
 * Use of this software is governed by the MIT license
6
 *
7
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9
 */
10
11
#include <isl_ctx_private.h>
12
#include <isl_seq.h>
13
14
void isl_seq_clr(isl_int *p, unsigned len)
15
76.5M
{
16
76.5M
  int i;
17
207M
  for (i = 0; i < len; 
++i131M
)
18
131M
    isl_int_set_si(p[i], 0);
19
76.5M
}
20
21
void isl_seq_set_si(isl_int *p, int v, unsigned len)
22
1.64k
{
23
1.64k
  int i;
24
2.51k
  for (i = 0; i < len; 
++i870
)
25
1.64k
    
isl_int_set_si870
(p[i], v);
26
1.64k
}
27
28
void isl_seq_set(isl_int *p, isl_int v, unsigned len)
29
10
{
30
10
  int i;
31
22
  for (i = 0; i < len; 
++i12
)
32
12
    isl_int_set(p[i], v);
33
10
}
34
35
void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len)
36
19.6M
{
37
19.6M
  int i;
38
203M
  for (i = 0; i < len; 
++i184M
)
39
184M
    isl_int_neg(dst[i], src[i]);
40
19.6M
}
41
42
void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len)
43
62.5M
{
44
62.5M
  int i;
45
595M
  for (i = 0; i < len; 
++i532M
)
46
532M
    isl_int_set(dst[i], src[i]);
47
62.5M
}
48
49
void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
50
5.39k
{
51
5.39k
  int i;
52
43.9k
  for (i = 0; i < len; 
++i38.5k
)
53
38.5k
    isl_int_submul(dst[i], f, src[i]);
54
5.39k
}
55
56
void isl_seq_addmul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
57
61.9k
{
58
61.9k
  int i;
59
331k
  for (i = 0; i < len; 
++i269k
)
60
269k
    isl_int_addmul(dst[i], f, src[i]);
61
61.9k
}
62
63
void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len)
64
3.09M
{
65
3.09M
  int i;
66
28.5M
  for (i = 0; i < len; 
++i25.4M
)
67
25.4M
    isl_int_swap_or_set(dst[i], src[i]);
68
3.09M
}
69
70
void isl_seq_scale(isl_int *dst, isl_int *src, isl_int m, unsigned len)
71
4.60M
{
72
4.60M
  int i;
73
15.1M
  for (i = 0; i < len; 
++i10.5M
)
74
10.5M
    isl_int_mul(dst[i], src[i], m);
75
4.60M
}
76
77
void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int m, unsigned len)
78
3.36M
{
79
3.36M
  int i;
80
41.4M
  for (i = 0; i < len; 
++i38.0M
)
81
38.0M
    isl_int_divexact(dst[i], src[i], m);
82
3.36M
}
83
84
void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
85
3.24k
{
86
3.24k
  int i;
87
11.7k
  for (i = 0; i < len; 
++i8.46k
)
88
8.46k
    isl_int_cdiv_q(dst[i], src[i], m);
89
3.24k
}
90
91
void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
92
90
{
93
90
  int i;
94
617
  for (i = 0; i < len; 
++i527
)
95
527
    isl_int_fdiv_q(dst[i], src[i], m);
96
90
}
97
98
void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len)
99
607
{
100
607
  int i;
101
3.58k
  for (i = 0; i < len; 
++i2.97k
)
102
2.97k
    isl_int_fdiv_r(dst[i], src[i], m);
103
607
}
104
105
void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1,
106
      isl_int m2, isl_int *src2, unsigned len)
107
12.1M
{
108
12.1M
  int i;
109
12.1M
  isl_int tmp;
110
12.1M
111
12.1M
  if (dst == src1 && 
isl_int_is_one12.1M
(m1)) {
112
10.8M
    if (isl_int_is_zero(m2))
113
10.8M
      
return5.73M
;
114
40.7M
    
for (i = 0; 5.09M
i < len;
++i35.6M
)
115
35.6M
      isl_int_addmul(src1[i], m2, src2[i]);
116
10.8M
    return;
117
10.8M
  }
118
1.33M
119
1.33M
  isl_int_init(tmp);
120
10.9M
  for (i = 0; i < len; 
++i9.63M
) {
121
9.63M
    isl_int_mul(tmp, m1, src1[i]);
122
9.63M
    isl_int_addmul(tmp, m2, src2[i]);
123
9.63M
    isl_int_set(dst[i], tmp);
124
9.63M
  }
125
1.33M
  isl_int_clear(tmp);
126
12.1M
}
127
128
/*
129
 * Let d = dst[pos] and s = src[pos]
130
 * dst is replaced by |s| dst - sgn(s)d src
131
 */
132
void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len,
133
      isl_int *m)
134
2.27M
{
135
2.27M
  isl_int a;
136
2.27M
  isl_int b;
137
2.27M
138
2.27M
  if (isl_int_is_zero(dst[pos]))
139
2.27M
    
return2.70k
;
140
2.27M
141
2.27M
  isl_int_init(a);
142
2.27M
  isl_int_init(b);
143
2.27M
144
2.27M
  isl_int_gcd(a, src[pos], dst[pos]);
145
2.27M
  isl_int_divexact(b, dst[pos], a);
146
2.27M
  if (isl_int_is_pos(src[pos]))
147
2.27M
    
isl_int_neg2.10M
(b, b);
148
2.27M
  isl_int_divexact(a, src[pos], a);
149
2.27M
  isl_int_abs(a, a);
150
2.27M
  isl_seq_combine(dst, a, dst, b, src, len);
151
2.27M
152
2.27M
  if (m)
153
2.27M
    
isl_int_mul10.8k
(*m, *m, a);
154
2.27M
155
2.27M
  isl_int_clear(a);
156
2.27M
  isl_int_clear(b);
157
2.27M
}
158
159
int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len)
160
14.9M
{
161
14.9M
  int i;
162
112M
  for (i = 0; i < len; 
++i97.4M
)
163
104M
    if (isl_int_ne(p1[i], p2[i]))
164
104M
      
return 06.74M
;
165
14.9M
  
return 18.18M
;
166
14.9M
}
167
168
int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len)
169
2.74M
{
170
2.74M
  int i;
171
2.74M
  int cmp;
172
22.4M
  for (i = 0; i < len; 
++i19.7M
)
173
21.2M
    if ((cmp = isl_int_cmp(p1[i], p2[i])) != 0)
174
1.49M
      return cmp;
175
2.74M
  
return 01.24M
;
176
2.74M
}
177
178
int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len)
179
136k
{
180
136k
  int i;
181
136k
182
735k
  for (i = 0; i < len; 
++i598k
) {
183
702k
    if (isl_int_abs_ne(p1[i], p2[i]))
184
702k
      
return 024.7k
;
185
677k
    if (isl_int_is_zero(p1[i]))
186
677k
      
continue537k
;
187
139k
    if (isl_int_eq(p1[i], p2[i]))
188
139k
      
return 079.3k
;
189
702k
  }
190
136k
  
return 132.8k
;
191
136k
}
192
193
int isl_seq_first_non_zero(isl_int *p, unsigned len)
194
47.2M
{
195
47.2M
  int i;
196
47.2M
197
264M
  for (i = 0; i < len; 
++i217M
)
198
252M
    if (!isl_int_is_zero(p[i]))
199
252M
      
return i35.8M
;
200
47.2M
  
return -111.4M
;
201
47.2M
}
202
203
int isl_seq_last_non_zero(isl_int *p, unsigned len)
204
10.1M
{
205
10.1M
  int i;
206
10.1M
207
53.8M
  for (i = len - 1; i >= 0; 
--i43.7M
)
208
49.7M
    if (!isl_int_is_zero(p[i]))
209
49.7M
      
return i5.99M
;
210
10.1M
  
return -14.15M
;
211
10.1M
}
212
213
void isl_seq_abs_max(isl_int *p, unsigned len, isl_int *max)
214
17.1k
{
215
17.1k
  int i;
216
17.1k
217
17.1k
  isl_int_set_si(*max, 0);
218
17.1k
219
113k
  for (i = 0; i < len; 
++i96.1k
)
220
96.1k
    if (isl_int_abs_gt(p[i], *max))
221
96.1k
      
isl_int_abs17.3k
(*max, p[i]);
222
17.1k
}
223
224
int isl_seq_abs_min_non_zero(isl_int *p, unsigned len)
225
30.6M
{
226
30.6M
  int i, min = isl_seq_first_non_zero(p, len);
227
30.6M
  if (min < 0)
228
2.17M
    return -1;
229
210M
  
for (i = min + 1; 28.4M
i < len;
++i181M
) {
230
181M
    if (isl_int_is_zero(p[i]))
231
181M
      
continue145M
;
232
36.6M
    if (isl_int_abs_lt(p[i], p[min]))
233
36.6M
      
min = i6.97M
;
234
181M
  }
235
30.6M
  return min;
236
30.6M
}
237
238
void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd)
239
28.7M
{
240
28.7M
  int i, min = isl_seq_abs_min_non_zero(p, len);
241
28.7M
242
28.7M
  if (min < 0) {
243
1.61M
    isl_int_set_si(*gcd, 0);
244
1.61M
    return;
245
1.61M
  }
246
27.1M
  isl_int_abs(*gcd, p[min]);
247
67.8M
  for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && 
i < len44.3M
;
++i40.7M
) {
248
40.7M
    if (i == min)
249
3.96M
      continue;
250
36.8M
    if (isl_int_is_zero(p[i]))
251
36.8M
      
continue23.7M
;
252
13.1M
    isl_int_gcd(*gcd, *gcd, p[i]);
253
13.1M
  }
254
28.7M
}
255
256
void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len)
257
12.2M
{
258
12.2M
  if (len == 0)
259
0
    return;
260
12.2M
  isl_seq_gcd(p, len, &ctx->normalize_gcd);
261
12.2M
  if (!isl_int_is_zero(ctx->normalize_gcd) &&
262
12.2M
      
!11.5M
isl_int_is_one11.5M
(ctx->normalize_gcd))
263
12.2M
    
isl_seq_scale_down(p, p, ctx->normalize_gcd, len)3.20M
;
264
12.2M
}
265
266
void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm)
267
2.46k
{
268
2.46k
  int i;
269
2.46k
270
2.46k
  if (len == 0) {
271
0
    isl_int_set_si(*lcm, 1);
272
0
    return;
273
0
  }
274
2.46k
  isl_int_set(*lcm, p[0]);
275
5.24k
  for (i = 1; i < len; 
++i2.77k
)
276
2.77k
    isl_int_lcm(*lcm, *lcm, p[i]);
277
2.46k
}
278
279
void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len,
280
         isl_int *prod)
281
9.88M
{
282
9.88M
  int i;
283
9.88M
  if (len == 0) {
284
0
    isl_int_set_si(*prod, 0);
285
0
    return;
286
0
  }
287
9.88M
  isl_int_mul(*prod, p1[0], p2[0]);
288
84.0M
  for (i = 1; i < len; 
++i74.1M
)
289
74.1M
    isl_int_addmul(*prod, p1[i], p2[i]);
290
9.88M
}
291
292
uint32_t isl_seq_hash(isl_int *p, unsigned len, uint32_t hash)
293
21.4M
{
294
21.4M
  int i;
295
217M
  for (i = 0; i < len; 
++i195M
) {
296
195M
    if (isl_int_is_zero(p[i]))
297
195M
      
continue167M
;
298
28.0M
    hash *= 16777619;
299
28.0M
    hash ^= (i & 0xFF);
300
28.0M
    hash = isl_int_hash(p[i], hash);
301
195M
  }
302
21.4M
  return hash;
303
21.4M
}
304
305
/* Given two affine expressions "p" of length p_len (including the
306
 * denominator and the constant term) and "subs" of length subs_len,
307
 * plug in "subs" for the variable at position "pos".
308
 * The variables of "subs" and "p" are assumed to match up to subs_len,
309
 * but "p" may have additional variables.
310
 * "v" is an initialized isl_int that can be used internally.
311
 *
312
 * In particular, if "p" represents the expression
313
 *
314
 *  (a i + g)/m
315
 *
316
 * with i the variable at position "pos" and "subs" represents the expression
317
 *
318
 *  f/d
319
 *
320
 * then the result represents the expression
321
 *
322
 *  (a f + d g)/(m d)
323
 *
324
 */
325
void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
326
  int p_len, int subs_len, isl_int v)
327
1.68k
{
328
1.68k
  isl_int_set(v, p[1 + pos]);
329
1.68k
  isl_int_set_si(p[1 + pos], 0);
330
1.68k
  isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1);
331
1.68k
  isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len);
332
1.68k
  isl_int_mul(p[0], p[0], subs[0]);
333
1.68k
}
334
335
uint32_t isl_seq_get_hash(isl_int *p, unsigned len)
336
21.4M
{
337
21.4M
  uint32_t hash = isl_hash_init();
338
21.4M
339
21.4M
  return isl_seq_hash(p, len, hash);
340
21.4M
}
341
342
uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits)
343
21.2M
{
344
21.2M
  uint32_t hash;
345
21.2M
346
21.2M
  hash = isl_seq_get_hash(p, len);
347
21.2M
  return isl_hash_bits(hash, bits);
348
21.2M
}
349
350
void isl_seq_dump(isl_int *p, unsigned len)
351
0
{
352
0
  int i;
353
0
354
0
  for (i = 0; i < len; ++i) {
355
0
    if (i)
356
0
      fprintf(stderr, " ");
357
0
    isl_int_print(stderr, p[i], 0);
358
0
  }
359
0
  fprintf(stderr, "\n");
360
0
}