Coverage Report

Created: 2017-11-21 16:49

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_local.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2014      Ecole Normale Superieure
3
 *
4
 * Use of this software is governed by the MIT license
5
 *
6
 * Written by Sven Verdoolaege,
7
 * Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France
8
 */
9
10
#include <isl_mat_private.h>
11
#include <isl_seq.h>
12
13
/* Given a matrix "div" representing local variables,
14
 * is the variable at position "pos" marked as not having
15
 * an explicit representation?
16
 * Note that even if this variable is not marked in this way and therefore
17
 * does have an explicit representation, this representation may still
18
 * depend (indirectly) on other local variables that do not
19
 * have an explicit representation.
20
 */
21
isl_bool isl_local_div_is_marked_unknown(__isl_keep isl_mat *div, int pos)
22
72.8k
{
23
72.8k
  if (!div)
24
0
    return isl_bool_error;
25
72.8k
  if (pos < 0 || pos >= div->n_row)
26
72.8k
    
isl_die0
(isl_mat_get_ctx(div), isl_error_invalid,
27
72.8k
      "position out of bounds", return isl_bool_error);
28
72.8k
  return isl_int_is_zero(div->row[pos][0]);
29
72.8k
}
30
31
/* Given a matrix "div" representing local variables,
32
 * does the variable at position "pos" have a complete explicit representation?
33
 * Having a complete explicit representation requires not only
34
 * an explicit representation, but also that all local variables
35
 * that appear in this explicit representation in turn have
36
 * a complete explicit representation.
37
 */
38
isl_bool isl_local_div_is_known(__isl_keep isl_mat *div, int pos)
39
245
{
40
245
  isl_bool marked;
41
245
  int i, n, off;
42
245
43
245
  if (!div)
44
0
    return isl_bool_error;
45
245
  if (pos < 0 || pos >= div->n_row)
46
245
    
isl_die0
(isl_mat_get_ctx(div), isl_error_invalid,
47
245
      "position out of bounds", return isl_bool_error);
48
245
49
245
  marked = isl_local_div_is_marked_unknown(div, pos);
50
245
  if (marked < 0 || marked)
51
9
    return isl_bool_not(marked);
52
236
53
236
  n = isl_mat_rows(div);
54
236
  off = isl_mat_cols(div) - n;
55
236
56
530
  for (i = n - 1; i >= 0; 
--i294
) {
57
294
    isl_bool known;
58
294
59
294
    if (isl_int_is_zero(div->row[pos][off + i]))
60
294
      
continue293
;
61
1
    known = isl_local_div_is_known(div, i);
62
1
    if (known < 0 || !known)
63
0
      return known;
64
294
  }
65
236
66
236
  return isl_bool_true;
67
245
}
68
69
/* Compare two matrices representing local variables, defined over
70
 * the same space.
71
 *
72
 * Return -1 if "div1" is "smaller" than "div2", 1 if "div1" is "greater"
73
 * than "div2" and 0 if they are equal.
74
 *
75
 * The order is fairly arbitrary.  We do "prefer" divs that only involve
76
 * earlier dimensions in the sense that we consider matrices where
77
 * the first differing div involves earlier dimensions to be smaller.
78
 */
79
int isl_local_cmp(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
80
2.85k
{
81
2.85k
  int i;
82
2.85k
  int cmp;
83
2.85k
  isl_bool unknown1, unknown2;
84
2.85k
  int last1, last2;
85
2.85k
  int n_col;
86
2.85k
87
2.85k
  if (div1 == div2)
88
0
    return 0;
89
2.85k
  if (!div1)
90
0
    return -1;
91
2.85k
  if (!div2)
92
0
    return 1;
93
2.85k
94
2.85k
  if (div1->n_row != div2->n_row)
95
54
    return div1->n_row - div2->n_row;
96
2.79k
97
2.79k
  n_col = isl_mat_cols(div1);
98
2.80k
  for (i = 0; i < div1->n_row; 
++i4
) {
99
75
    unknown1 = isl_local_div_is_marked_unknown(div1, i);
100
75
    unknown2 = isl_local_div_is_marked_unknown(div2, i);
101
75
    if (unknown1 && 
unknown20
)
102
0
      continue;
103
75
    if (unknown1)
104
0
      return 1;
105
75
    if (unknown2)
106
0
      return -1;
107
75
    last1 = isl_seq_last_non_zero(div1->row[i] + 1, n_col - 1);
108
75
    last2 = isl_seq_last_non_zero(div2->row[i] + 1, n_col - 1);
109
75
    if (last1 != last2)
110
24
      return last1 - last2;
111
51
    cmp = isl_seq_cmp(div1->row[i], div2->row[i], n_col);
112
51
    if (cmp != 0)
113
47
      return cmp;
114
75
  }
115
2.79k
116
2.79k
  
return 02.72k
;
117
2.85k
}