Coverage Report

Created: 2017-08-21 19:50

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/llvm/tools/polly/lib/External/isl/isl_list_templ.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2008-2009 Katholieke Universiteit Leuven
3
 * Copyright 2011      INRIA Saclay
4
 * Copyright 2012-2013 Ecole Normale Superieure
5
 * Copyright 2017      Sven Verdoolaege
6
 *
7
 * Use of this software is governed by the MIT license
8
 *
9
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11
 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12
 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13
 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14
 */
15
16
#include <isl_sort.h>
17
#include <isl_tarjan.h>
18
19
4.82k
#define xCAT(A,B) A ## B
20
4.82k
#define CAT(A,B) xCAT(A,B)
21
#undef EL
22
4.82k
#define EL CAT(isl_,BASE)
23
2.54M
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
24
2.54M
#define FN(TYPE,NAME) xFN(TYPE,NAME)
25
510k
#define xLIST(EL) EL ## _list
26
510k
#define LIST(EL) xLIST(EL)
27
2.90k
#define xS(TYPE,NAME) struct TYPE ## _ ## NAME
28
2.90k
#define S(TYPE,NAME) xS(TYPE,NAME)
29
30
isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
31
83.4k
{
32
83.4k
  return list ? list->ctx : NULL;
33
83.4k
}
isl_val_list_get_ctx
Line
Count
Source
31
8
{
32
8
  return list ? list->ctx : NULL;
33
8
}
isl_union_set_list_get_ctx
Line
Count
Source
31
162
{
32
162
  return list ? list->ctx : NULL;
33
162
}
isl_set_list_get_ctx
Line
Count
Source
31
20
{
32
20
  return list ? list->ctx : NULL;
33
20
}
isl_basic_set_list_get_ctx
Line
Count
Source
31
1.89k
{
32
1.89k
  return list ? list->ctx : NULL;
33
1.89k
}
isl_schedule_tree_list_get_ctx
Line
Count
Source
31
58.5k
{
32
58.5k
  return list ? list->ctx : NULL;
33
58.5k
}
isl_union_map_list_get_ctx
Line
Count
Source
31
1
{
32
1
  return list ? list->ctx : NULL;
33
1
}
isl_map_list_get_ctx
Line
Count
Source
31
472
{
32
472
  return list ? list->ctx : NULL;
33
472
}
isl_basic_map_list_get_ctx
Line
Count
Source
31
1.05k
{
32
1.05k
  return list ? list->ctx : NULL;
33
1.05k
}
isl_id_list_get_ctx
Line
Count
Source
31
610
{
32
610
  return list ? list->ctx : NULL;
33
610
}
isl_constraint_list_get_ctx
Line
Count
Source
31
1.11k
{
32
1.11k
  return list ? list->ctx : NULL;
33
1.11k
}
isl_band_list_get_ctx
Line
Count
Source
31
12
{
32
12
  return list ? list->ctx : NULL;
33
12
}
isl_ast_graft_list_get_ctx
Line
Count
Source
31
9.23k
{
32
9.23k
  return list ? list->ctx : NULL;
33
9.23k
}
isl_ast_node_list_get_ctx
Line
Count
Source
31
358
{
32
358
  return list ? list->ctx : NULL;
33
358
}
Unexecuted instantiation: isl_ast_expr_list_get_ctx
Unexecuted instantiation: isl_union_pw_multi_aff_list_get_ctx
isl_union_pw_aff_list_get_ctx
Line
Count
Source
31
15
{
32
15
  return list ? list->ctx : NULL;
33
15
}
isl_pw_aff_list_get_ctx
Line
Count
Source
31
9.96k
{
32
9.96k
  return list ? list->ctx : NULL;
33
9.96k
}
isl_aff_list_get_ctx
Line
Count
Source
31
20
{
32
20
  return list ? list->ctx : NULL;
33
20
}
34
35
__isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n)
36
127k
{
37
127k
  LIST(EL) *list;
38
127k
39
127k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
127k
      "cannot create list of negative length",
42
127k
      return NULL);
43
127k
  
list = 127k
isl_alloc127k
(ctx, LIST(EL),
44
127k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
127k
  if (!list)
46
0
    return NULL;
47
127k
48
127k
  list->ctx = ctx;
49
127k
  isl_ctx_ref(ctx);
50
127k
  list->ref = 1;
51
127k
  list->size = n;
52
127k
  list->n = 0;
53
127k
  return list;
54
127k
}
isl_aff_list_alloc
Line
Count
Source
36
7.27k
{
37
7.27k
  LIST(EL) *list;
38
7.27k
39
7.27k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
7.27k
      "cannot create list of negative length",
42
7.27k
      return NULL);
43
7.27k
  
list = 7.27k
isl_alloc7.27k
(ctx, LIST(EL),
44
7.27k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
7.27k
  if (!list)
46
0
    return NULL;
47
7.27k
48
7.27k
  list->ctx = ctx;
49
7.27k
  isl_ctx_ref(ctx);
50
7.27k
  list->ref = 1;
51
7.27k
  list->size = n;
52
7.27k
  list->n = 0;
53
7.27k
  return list;
54
7.27k
}
isl_pw_aff_list_alloc
Line
Count
Source
36
14.7k
{
37
14.7k
  LIST(EL) *list;
38
14.7k
39
14.7k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
14.7k
      "cannot create list of negative length",
42
14.7k
      return NULL);
43
14.7k
  
list = 14.7k
isl_alloc14.7k
(ctx, LIST(EL),
44
14.7k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
14.7k
  if (!list)
46
0
    return NULL;
47
14.7k
48
14.7k
  list->ctx = ctx;
49
14.7k
  isl_ctx_ref(ctx);
50
14.7k
  list->ref = 1;
51
14.7k
  list->size = n;
52
14.7k
  list->n = 0;
53
14.7k
  return list;
54
14.7k
}
isl_union_pw_aff_list_alloc
Line
Count
Source
36
15
{
37
15
  LIST(EL) *list;
38
15
39
15
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
15
      "cannot create list of negative length",
42
15
      return NULL);
43
15
  
list = 15
isl_alloc15
(ctx, LIST(EL),
44
15
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
15
  if (!list)
46
0
    return NULL;
47
15
48
15
  list->ctx = ctx;
49
15
  isl_ctx_ref(ctx);
50
15
  list->ref = 1;
51
15
  list->size = n;
52
15
  list->n = 0;
53
15
  return list;
54
15
}
isl_union_pw_multi_aff_list_alloc
Line
Count
Source
36
7
{
37
7
  LIST(EL) *list;
38
7
39
7
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
7
      "cannot create list of negative length",
42
7
      return NULL);
43
7
  
list = 7
isl_alloc7
(ctx, LIST(EL),
44
7
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
7
  if (!list)
46
0
    return NULL;
47
7
48
7
  list->ctx = ctx;
49
7
  isl_ctx_ref(ctx);
50
7
  list->ref = 1;
51
7
  list->size = n;
52
7
  list->n = 0;
53
7
  return list;
54
7
}
Unexecuted instantiation: isl_ast_expr_list_alloc
isl_ast_node_list_alloc
Line
Count
Source
36
3.40k
{
37
3.40k
  LIST(EL) *list;
38
3.40k
39
3.40k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
3.40k
      "cannot create list of negative length",
42
3.40k
      return NULL);
43
3.40k
  
list = 3.40k
isl_alloc3.40k
(ctx, LIST(EL),
44
3.40k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
3.40k
  if (!list)
46
0
    return NULL;
47
3.40k
48
3.40k
  list->ctx = ctx;
49
3.40k
  isl_ctx_ref(ctx);
50
3.40k
  list->ref = 1;
51
3.40k
  list->size = n;
52
3.40k
  list->n = 0;
53
3.40k
  return list;
54
3.40k
}
isl_ast_graft_list_alloc
Line
Count
Source
36
14.6k
{
37
14.6k
  LIST(EL) *list;
38
14.6k
39
14.6k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
14.6k
      "cannot create list of negative length",
42
14.6k
      return NULL);
43
14.6k
  
list = 14.6k
isl_alloc14.6k
(ctx, LIST(EL),
44
14.6k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
14.6k
  if (!list)
46
0
    return NULL;
47
14.6k
48
14.6k
  list->ctx = ctx;
49
14.6k
  isl_ctx_ref(ctx);
50
14.6k
  list->ref = 1;
51
14.6k
  list->size = n;
52
14.6k
  list->n = 0;
53
14.6k
  return list;
54
14.6k
}
isl_band_list_alloc
Line
Count
Source
36
16
{
37
16
  LIST(EL) *list;
38
16
39
16
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
16
      "cannot create list of negative length",
42
16
      return NULL);
43
16
  
list = 16
isl_alloc16
(ctx, LIST(EL),
44
16
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
16
  if (!list)
46
0
    return NULL;
47
16
48
16
  list->ctx = ctx;
49
16
  isl_ctx_ref(ctx);
50
16
  list->ref = 1;
51
16
  list->size = n;
52
16
  list->n = 0;
53
16
  return list;
54
16
}
isl_constraint_list_alloc
Line
Count
Source
36
2.21k
{
37
2.21k
  LIST(EL) *list;
38
2.21k
39
2.21k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.21k
      "cannot create list of negative length",
42
2.21k
      return NULL);
43
2.21k
  
list = 2.21k
isl_alloc2.21k
(ctx, LIST(EL),
44
2.21k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.21k
  if (!list)
46
0
    return NULL;
47
2.21k
48
2.21k
  list->ctx = ctx;
49
2.21k
  isl_ctx_ref(ctx);
50
2.21k
  list->ref = 1;
51
2.21k
  list->size = n;
52
2.21k
  list->n = 0;
53
2.21k
  return list;
54
2.21k
}
isl_id_list_alloc
Line
Count
Source
36
1.78k
{
37
1.78k
  LIST(EL) *list;
38
1.78k
39
1.78k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
1.78k
      "cannot create list of negative length",
42
1.78k
      return NULL);
43
1.78k
  
list = 1.78k
isl_alloc1.78k
(ctx, LIST(EL),
44
1.78k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
1.78k
  if (!list)
46
0
    return NULL;
47
1.78k
48
1.78k
  list->ctx = ctx;
49
1.78k
  isl_ctx_ref(ctx);
50
1.78k
  list->ref = 1;
51
1.78k
  list->size = n;
52
1.78k
  list->n = 0;
53
1.78k
  return list;
54
1.78k
}
isl_basic_map_list_alloc
Line
Count
Source
36
2.61k
{
37
2.61k
  LIST(EL) *list;
38
2.61k
39
2.61k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.61k
      "cannot create list of negative length",
42
2.61k
      return NULL);
43
2.61k
  
list = 2.61k
isl_alloc2.61k
(ctx, LIST(EL),
44
2.61k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.61k
  if (!list)
46
0
    return NULL;
47
2.61k
48
2.61k
  list->ctx = ctx;
49
2.61k
  isl_ctx_ref(ctx);
50
2.61k
  list->ref = 1;
51
2.61k
  list->size = n;
52
2.61k
  list->n = 0;
53
2.61k
  return list;
54
2.61k
}
isl_map_list_alloc
Line
Count
Source
36
433
{
37
433
  LIST(EL) *list;
38
433
39
433
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
433
      "cannot create list of negative length",
42
433
      return NULL);
43
433
  
list = 433
isl_alloc433
(ctx, LIST(EL),
44
433
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
433
  if (!list)
46
0
    return NULL;
47
433
48
433
  list->ctx = ctx;
49
433
  isl_ctx_ref(ctx);
50
433
  list->ref = 1;
51
433
  list->size = n;
52
433
  list->n = 0;
53
433
  return list;
54
433
}
isl_union_map_list_alloc
Line
Count
Source
36
1
{
37
1
  LIST(EL) *list;
38
1
39
1
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
1
      "cannot create list of negative length",
42
1
      return NULL);
43
1
  
list = 1
isl_alloc1
(ctx, LIST(EL),
44
1
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
1
  if (!list)
46
0
    return NULL;
47
1
48
1
  list->ctx = ctx;
49
1
  isl_ctx_ref(ctx);
50
1
  list->ref = 1;
51
1
  list->size = n;
52
1
  list->n = 0;
53
1
  return list;
54
1
}
isl_schedule_tree_list_alloc
Line
Count
Source
36
68.0k
{
37
68.0k
  LIST(EL) *list;
38
68.0k
39
68.0k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
68.0k
      "cannot create list of negative length",
42
68.0k
      return NULL);
43
68.0k
  
list = 68.0k
isl_alloc68.0k
(ctx, LIST(EL),
44
68.0k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
68.0k
  if (!list)
46
0
    return NULL;
47
68.0k
48
68.0k
  list->ctx = ctx;
49
68.0k
  isl_ctx_ref(ctx);
50
68.0k
  list->ref = 1;
51
68.0k
  list->size = n;
52
68.0k
  list->n = 0;
53
68.0k
  return list;
54
68.0k
}
isl_basic_set_list_alloc
Line
Count
Source
36
2.78k
{
37
2.78k
  LIST(EL) *list;
38
2.78k
39
2.78k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.78k
      "cannot create list of negative length",
42
2.78k
      return NULL);
43
2.78k
  
list = 2.78k
isl_alloc2.78k
(ctx, LIST(EL),
44
2.78k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.78k
  if (!list)
46
0
    return NULL;
47
2.78k
48
2.78k
  list->ctx = ctx;
49
2.78k
  isl_ctx_ref(ctx);
50
2.78k
  list->ref = 1;
51
2.78k
  list->size = n;
52
2.78k
  list->n = 0;
53
2.78k
  return list;
54
2.78k
}
isl_set_list_alloc
Line
Count
Source
36
9.09k
{
37
9.09k
  LIST(EL) *list;
38
9.09k
39
9.09k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
9.09k
      "cannot create list of negative length",
42
9.09k
      return NULL);
43
9.09k
  
list = 9.09k
isl_alloc9.09k
(ctx, LIST(EL),
44
9.09k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
9.09k
  if (!list)
46
0
    return NULL;
47
9.09k
48
9.09k
  list->ctx = ctx;
49
9.09k
  isl_ctx_ref(ctx);
50
9.09k
  list->ref = 1;
51
9.09k
  list->size = n;
52
9.09k
  list->n = 0;
53
9.09k
  return list;
54
9.09k
}
isl_union_set_list_alloc
Line
Count
Source
36
398
{
37
398
  LIST(EL) *list;
38
398
39
398
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
398
      "cannot create list of negative length",
42
398
      return NULL);
43
398
  
list = 398
isl_alloc398
(ctx, LIST(EL),
44
398
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
398
  if (!list)
46
0
    return NULL;
47
398
48
398
  list->ctx = ctx;
49
398
  isl_ctx_ref(ctx);
50
398
  list->ref = 1;
51
398
  list->size = n;
52
398
  list->n = 0;
53
398
  return list;
54
398
}
isl_val_list_alloc
Line
Count
Source
36
11
{
37
11
  LIST(EL) *list;
38
11
39
11
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
11
      "cannot create list of negative length",
42
11
      return NULL);
43
11
  
list = 11
isl_alloc11
(ctx, LIST(EL),
44
11
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
11
  if (!list)
46
0
    return NULL;
47
11
48
11
  list->ctx = ctx;
49
11
  isl_ctx_ref(ctx);
50
11
  list->ref = 1;
51
11
  list->size = n;
52
11
  list->n = 0;
53
11
  return list;
54
11
}
55
56
__isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list)
57
92.1k
{
58
92.1k
  if (!list)
59
0
    return NULL;
60
92.1k
61
92.1k
  list->ref++;
62
92.1k
  return list;
63
92.1k
}
Unexecuted instantiation: isl_aff_list_copy
isl_pw_aff_list_copy
Line
Count
Source
57
10.6k
{
58
10.6k
  if (!list)
59
0
    return NULL;
60
10.6k
61
10.6k
  list->ref++;
62
10.6k
  return list;
63
10.6k
}
Unexecuted instantiation: isl_union_pw_aff_list_copy
Unexecuted instantiation: isl_union_pw_multi_aff_list_copy
Unexecuted instantiation: isl_ast_expr_list_copy
isl_ast_node_list_copy
Line
Count
Source
57
184
{
58
184
  if (!list)
59
0
    return NULL;
60
184
61
184
  list->ref++;
62
184
  return list;
63
184
}
Unexecuted instantiation: isl_ast_graft_list_copy
Unexecuted instantiation: isl_band_list_copy
isl_constraint_list_copy
Line
Count
Source
57
698
{
58
698
  if (!list)
59
0
    return NULL;
60
698
61
698
  list->ref++;
62
698
  return list;
63
698
}
isl_id_list_copy
Line
Count
Source
57
27.3k
{
58
27.3k
  if (!list)
59
0
    return NULL;
60
27.3k
61
27.3k
  list->ref++;
62
27.3k
  return list;
63
27.3k
}
Unexecuted instantiation: isl_basic_map_list_copy
Unexecuted instantiation: isl_map_list_copy
Unexecuted instantiation: isl_union_map_list_copy
isl_schedule_tree_list_copy
Line
Count
Source
57
53.2k
{
58
53.2k
  if (!list)
59
0
    return NULL;
60
53.2k
61
53.2k
  list->ref++;
62
53.2k
  return list;
63
53.2k
}
isl_basic_set_list_copy
Line
Count
Source
57
13
{
58
13
  if (!list)
59
0
    return NULL;
60
13
61
13
  list->ref++;
62
13
  return list;
63
13
}
Unexecuted instantiation: isl_set_list_copy
Unexecuted instantiation: isl_union_set_list_copy
Unexecuted instantiation: isl_val_list_copy
64
65
__isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list)
66
43.0k
{
67
43.0k
  int i;
68
43.0k
  LIST(EL) *dup;
69
43.0k
70
43.0k
  if (!list)
71
0
    return NULL;
72
43.0k
73
43.0k
  
dup = 43.0k
FN43.0k
(LIST(EL),alloc)(
FN43.0k
(LIST(EL),get_ctx)(list), list->n);
74
43.0k
  if (!dup)
75
0
    return NULL;
76
214k
  
for (i = 0; 43.0k
i < list->n214k
;
++i171k
)
77
171k
    
dup = 171k
FN171k
(LIST(EL),add)(dup,
FN171k
(EL,copy)(list->p[i]));
78
43.0k
  return dup;
79
43.0k
}
Unexecuted instantiation: isl_aff_list_dup
Unexecuted instantiation: isl_id_list_dup
Unexecuted instantiation: isl_val_list_dup
Unexecuted instantiation: isl_union_set_list_dup
Unexecuted instantiation: isl_set_list_dup
Unexecuted instantiation: isl_basic_set_list_dup
isl_schedule_tree_list_dup
Line
Count
Source
66
42.0k
{
67
42.0k
  int i;
68
42.0k
  LIST(EL) *dup;
69
42.0k
70
42.0k
  if (!list)
71
0
    return NULL;
72
42.0k
73
42.0k
  
dup = 42.0k
FN42.0k
(LIST(EL),alloc)(
FN42.0k
(LIST(EL),get_ctx)(list), list->n);
74
42.0k
  if (!dup)
75
0
    return NULL;
76
211k
  
for (i = 0; 42.0k
i < list->n211k
;
++i169k
)
77
169k
    
dup = 169k
FN169k
(LIST(EL),add)(dup,
FN169k
(EL,copy)(list->p[i]));
78
42.0k
  return dup;
79
42.0k
}
Unexecuted instantiation: isl_union_map_list_dup
Unexecuted instantiation: isl_map_list_dup
Unexecuted instantiation: isl_basic_map_list_dup
isl_constraint_list_dup
Line
Count
Source
66
698
{
67
698
  int i;
68
698
  LIST(EL) *dup;
69
698
70
698
  if (!list)
71
0
    return NULL;
72
698
73
698
  
dup = 698
FN698
(LIST(EL),alloc)(
FN698
(LIST(EL),get_ctx)(list), list->n);
74
698
  if (!dup)
75
0
    return NULL;
76
2.17k
  
for (i = 0; 698
i < list->n2.17k
;
++i1.47k
)
77
1.47k
    
dup = 1.47k
FN1.47k
(LIST(EL),add)(dup,
FN1.47k
(EL,copy)(list->p[i]));
78
698
  return dup;
79
698
}
isl_band_list_dup
Line
Count
Source
66
4
{
67
4
  int i;
68
4
  LIST(EL) *dup;
69
4
70
4
  if (!list)
71
0
    return NULL;
72
4
73
4
  
dup = 4
FN4
(LIST(EL),alloc)(
FN4
(LIST(EL),get_ctx)(list), list->n);
74
4
  if (!dup)
75
0
    return NULL;
76
10
  
for (i = 0; 4
i < list->n10
;
++i6
)
77
6
    
dup = 6
FN6
(LIST(EL),add)(dup,
FN6
(EL,copy)(list->p[i]));
78
4
  return dup;
79
4
}
Unexecuted instantiation: isl_ast_graft_list_dup
Unexecuted instantiation: isl_ast_node_list_dup
Unexecuted instantiation: isl_ast_expr_list_dup
Unexecuted instantiation: isl_union_pw_multi_aff_list_dup
Unexecuted instantiation: isl_union_pw_aff_list_dup
isl_pw_aff_list_dup
Line
Count
Source
66
282
{
67
282
  int i;
68
282
  LIST(EL) *dup;
69
282
70
282
  if (!list)
71
0
    return NULL;
72
282
73
282
  
dup = 282
FN282
(LIST(EL),alloc)(
FN282
(LIST(EL),get_ctx)(list), list->n);
74
282
  if (!dup)
75
0
    return NULL;
76
646
  
for (i = 0; 282
i < list->n646
;
++i364
)
77
364
    
dup = 364
FN364
(LIST(EL),add)(dup,
FN364
(EL,copy)(list->p[i]));
78
282
  return dup;
79
282
}
80
81
__isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list)
82
89.3k
{
83
89.3k
  if (!list)
84
0
    return NULL;
85
89.3k
86
89.3k
  
if (89.3k
list->ref == 189.3k
)
87
46.2k
    return list;
88
89.3k
  list->ref--;
89
43.0k
  return FN(LIST(EL),dup)(list);
90
89.3k
}
Unexecuted instantiation: isl_val_list_cow
isl_aff_list_cow
Line
Count
Source
82
2
{
83
2
  if (!list)
84
0
    return NULL;
85
2
86
2
  
if (2
list->ref == 12
)
87
2
    return list;
88
2
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
2
}
isl_union_set_list_cow
Line
Count
Source
82
854
{
83
854
  if (!list)
84
0
    return NULL;
85
854
86
854
  
if (854
list->ref == 1854
)
87
854
    return list;
88
854
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
854
}
isl_set_list_cow
Line
Count
Source
82
1.45k
{
83
1.45k
  if (!list)
84
0
    return NULL;
85
1.45k
86
1.45k
  
if (1.45k
list->ref == 11.45k
)
87
1.45k
    return list;
88
1.45k
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1.45k
}
isl_basic_set_list_cow
Line
Count
Source
82
2.48k
{
83
2.48k
  if (!list)
84
0
    return NULL;
85
2.48k
86
2.48k
  
if (2.48k
list->ref == 12.48k
)
87
2.48k
    return list;
88
2.48k
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
2.48k
}
isl_schedule_tree_list_cow
Line
Count
Source
82
79.1k
{
83
79.1k
  if (!list)
84
0
    return NULL;
85
79.1k
86
79.1k
  
if (79.1k
list->ref == 179.1k
)
87
37.0k
    return list;
88
79.1k
  list->ref--;
89
42.0k
  return FN(LIST(EL),dup)(list);
90
79.1k
}
isl_union_map_list_cow
Line
Count
Source
82
6
{
83
6
  if (!list)
84
0
    return NULL;
85
6
86
6
  
if (6
list->ref == 16
)
87
6
    return list;
88
6
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
6
}
Unexecuted instantiation: isl_map_list_cow
isl_basic_map_list_cow
Line
Count
Source
82
55
{
83
55
  if (!list)
84
0
    return NULL;
85
55
86
55
  
if (55
list->ref == 155
)
87
55
    return list;
88
55
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
55
}
isl_id_list_cow
Line
Count
Source
82
1
{
83
1
  if (!list)
84
0
    return NULL;
85
1
86
1
  
if (1
list->ref == 11
)
87
1
    return list;
88
1
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1
}
isl_constraint_list_cow
Line
Count
Source
82
2.20k
{
83
2.20k
  if (!list)
84
0
    return NULL;
85
2.20k
86
2.20k
  
if (2.20k
list->ref == 12.20k
)
87
1.50k
    return list;
88
2.20k
  list->ref--;
89
698
  return FN(LIST(EL),dup)(list);
90
2.20k
}
Unexecuted instantiation: isl_band_list_cow
isl_ast_graft_list_cow
Line
Count
Source
82
35
{
83
35
  if (!list)
84
0
    return NULL;
85
35
86
35
  
if (35
list->ref == 135
)
87
35
    return list;
88
35
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
35
}
Unexecuted instantiation: isl_ast_node_list_cow
Unexecuted instantiation: isl_ast_expr_list_cow
Unexecuted instantiation: isl_union_pw_multi_aff_list_cow
Unexecuted instantiation: isl_union_pw_aff_list_cow
isl_pw_aff_list_cow
Line
Count
Source
82
3.07k
{
83
3.07k
  if (!list)
84
0
    return NULL;
85
3.07k
86
3.07k
  
if (3.07k
list->ref == 13.07k
)
87
2.79k
    return list;
88
3.07k
  list->ref--;
89
282
  return FN(LIST(EL),dup)(list);
90
3.07k
}
91
92
/* Make sure "list" has room for at least "n" more pieces.
93
 * Always return a list with a single reference.
94
 *
95
 * If there is only one reference to list, we extend it in place.
96
 * Otherwise, we create a new LIST(EL) and copy the elements.
97
 */
98
static __isl_give LIST(EL) *FN(LIST(EL),grow)(__isl_take LIST(EL) *list, int n)
99
306k
{
100
306k
  isl_ctx *ctx;
101
306k
  int i, new_size;
102
306k
  LIST(EL) *res;
103
306k
104
306k
  if (!list)
105
0
    return NULL;
106
306k
  
if (306k
list->ref == 1 && 306k
list->n + n <= list->size297k
)
107
285k
    return list;
108
306k
109
20.2k
  
ctx = 20.2k
FN20.2k
(LIST(EL),get_ctx)(list);
110
20.2k
  new_size = ((list->n + n + 1) * 3) / 2;
111
20.2k
  if (
list->ref == 120.2k
)
{11.7k
112
11.7k
    res = isl_realloc(ctx, list, LIST(EL),
113
11.7k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
11.7k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
11.7k
    res->size = new_size;
117
11.7k
    return res;
118
20.2k
  }
119
20.2k
120
8.56k
  
if (8.56k
list->n + n <= list->size && 8.56k
list->size < new_size2.13k
)
121
2.06k
    new_size = list->size;
122
8.56k
123
8.56k
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
8.56k
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
8.56k
127
27.8k
  
for (i = 0; 8.56k
i < list->n27.8k
;
++i19.2k
)
128
19.2k
    
res = 19.2k
FN19.2k
(LIST(EL),add)(res,
FN19.2k
(EL,copy)(list->p[i]));
129
8.56k
130
8.56k
  FN(LIST(EL),free)(list);
131
8.56k
  return res;
132
306k
}
isl_aff.c:isl_aff_list_grow
Line
Count
Source
99
7.25k
{
100
7.25k
  isl_ctx *ctx;
101
7.25k
  int i, new_size;
102
7.25k
  LIST(EL) *res;
103
7.25k
104
7.25k
  if (!list)
105
0
    return NULL;
106
7.25k
  
if (7.25k
list->ref == 1 && 7.25k
list->n + n <= list->size7.25k
)
107
7.23k
    return list;
108
7.25k
109
20
  
ctx = 20
FN20
(LIST(EL),get_ctx)(list);
110
20
  new_size = ((list->n + n + 1) * 3) / 2;
111
20
  if (
list->ref == 120
)
{20
112
20
    res = isl_realloc(ctx, list, LIST(EL),
113
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
20
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
20
    res->size = new_size;
117
20
    return res;
118
20
  }
119
20
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
7.25k
}
isl_set_list.c:isl_set_list_grow
Line
Count
Source
99
10.0k
{
100
10.0k
  isl_ctx *ctx;
101
10.0k
  int i, new_size;
102
10.0k
  LIST(EL) *res;
103
10.0k
104
10.0k
  if (!list)
105
0
    return NULL;
106
10.0k
  
if (10.0k
list->ref == 1 && 10.0k
list->n + n <= list->size10.0k
)
107
10.0k
    return list;
108
10.0k
109
20
  
ctx = 20
FN20
(LIST(EL),get_ctx)(list);
110
20
  new_size = ((list->n + n + 1) * 3) / 2;
111
20
  if (
list->ref == 120
)
{20
112
20
    res = isl_realloc(ctx, list, LIST(EL),
113
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
20
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
20
    res->size = new_size;
117
20
    return res;
118
20
  }
119
20
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
10.0k
}
isl_set_list.c:isl_basic_set_list_grow
Line
Count
Source
99
2.89k
{
100
2.89k
  isl_ctx *ctx;
101
2.89k
  int i, new_size;
102
2.89k
  LIST(EL) *res;
103
2.89k
104
2.89k
  if (!list)
105
0
    return NULL;
106
2.89k
  
if (2.89k
list->ref == 1 && 2.89k
list->n + n <= list->size2.89k
)
107
2.89k
    return list;
108
2.89k
109
2
  
ctx = 2
FN2
(LIST(EL),get_ctx)(list);
110
2
  new_size = ((list->n + n + 1) * 3) / 2;
111
2
  if (
list->ref == 12
)
{2
112
2
    res = isl_realloc(ctx, list, LIST(EL),
113
2
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
2
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
2
    res->size = new_size;
117
2
    return res;
118
2
  }
119
2
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
2.89k
}
isl_schedule_tree.c:isl_schedule_tree_list_grow
Line
Count
Source
99
228k
{
100
228k
  isl_ctx *ctx;
101
228k
  int i, new_size;
102
228k
  LIST(EL) *res;
103
228k
104
228k
  if (!list)
105
0
    return NULL;
106
228k
  
if (228k
list->ref == 1 && 228k
list->n + n <= list->size220k
)
107
213k
    return list;
108
228k
109
15.4k
  
ctx = 15.4k
FN15.4k
(LIST(EL),get_ctx)(list);
110
15.4k
  new_size = ((list->n + n + 1) * 3) / 2;
111
15.4k
  if (
list->ref == 115.4k
)
{6.93k
112
6.93k
    res = isl_realloc(ctx, list, LIST(EL),
113
6.93k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
6.93k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
6.93k
    res->size = new_size;
117
6.93k
    return res;
118
15.4k
  }
119
15.4k
120
8.56k
  
if (8.56k
list->n + n <= list->size && 8.56k
list->size < new_size2.13k
)
121
2.06k
    new_size = list->size;
122
8.56k
123
8.56k
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
8.56k
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
8.56k
127
27.8k
  
for (i = 0; 8.56k
i < list->n27.8k
;
++i19.2k
)
128
19.2k
    
res = 19.2k
FN19.2k
(LIST(EL),add)(res,
FN19.2k
(EL,copy)(list->p[i]));
129
8.56k
130
8.56k
  FN(LIST(EL),free)(list);
131
8.56k
  return res;
132
228k
}
isl_map_list.c:isl_union_map_list_grow
Line
Count
Source
99
5
{
100
5
  isl_ctx *ctx;
101
5
  int i, new_size;
102
5
  LIST(EL) *res;
103
5
104
5
  if (!list)
105
0
    return NULL;
106
5
  
if (5
list->ref == 1 && 5
list->n + n <= list->size5
)
107
4
    return list;
108
5
109
1
  
ctx = 1
FN1
(LIST(EL),get_ctx)(list);
110
1
  new_size = ((list->n + n + 1) * 3) / 2;
111
1
  if (
list->ref == 11
)
{1
112
1
    res = isl_realloc(ctx, list, LIST(EL),
113
1
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
1
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
1
    res->size = new_size;
117
1
    return res;
118
1
  }
119
1
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
5
}
isl_map_list.c:isl_map_list_grow
Line
Count
Source
99
866
{
100
866
  isl_ctx *ctx;
101
866
  int i, new_size;
102
866
  LIST(EL) *res;
103
866
104
866
  if (!list)
105
0
    return NULL;
106
866
  
if (866
list->ref == 1 && 866
list->n + n <= list->size866
)
107
866
    return list;
108
866
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
866
}
isl_map_list.c:isl_basic_map_list_grow
Line
Count
Source
99
14.4k
{
100
14.4k
  isl_ctx *ctx;
101
14.4k
  int i, new_size;
102
14.4k
  LIST(EL) *res;
103
14.4k
104
14.4k
  if (!list)
105
0
    return NULL;
106
14.4k
  
if (14.4k
list->ref == 1 && 14.4k
list->n + n <= list->size14.4k
)
107
14.4k
    return list;
108
14.4k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
14.4k
}
isl_id.c:isl_id_list_grow
Line
Count
Source
99
2.22k
{
100
2.22k
  isl_ctx *ctx;
101
2.22k
  int i, new_size;
102
2.22k
  LIST(EL) *res;
103
2.22k
104
2.22k
  if (!list)
105
0
    return NULL;
106
2.22k
  
if (2.22k
list->ref == 1 && 2.22k
list->n + n <= list->size2.22k
)
107
2.22k
    return list;
108
2.22k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
2.22k
}
isl_constraint.c:isl_constraint_list_grow
Line
Count
Source
99
3.49k
{
100
3.49k
  isl_ctx *ctx;
101
3.49k
  int i, new_size;
102
3.49k
  LIST(EL) *res;
103
3.49k
104
3.49k
  if (!list)
105
0
    return NULL;
106
3.49k
  
if (3.49k
list->ref == 1 && 3.49k
list->n + n <= list->size3.49k
)
107
3.49k
    return list;
108
3.49k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
3.49k
}
isl_val.c:isl_val_list_grow
Line
Count
Source
99
21
{
100
21
  isl_ctx *ctx;
101
21
  int i, new_size;
102
21
  LIST(EL) *res;
103
21
104
21
  if (!list)
105
0
    return NULL;
106
21
  
if (21
list->ref == 1 && 21
list->n + n <= list->size21
)
107
13
    return list;
108
21
109
8
  
ctx = 8
FN8
(LIST(EL),get_ctx)(list);
110
8
  new_size = ((list->n + n + 1) * 3) / 2;
111
8
  if (
list->ref == 18
)
{8
112
8
    res = isl_realloc(ctx, list, LIST(EL),
113
8
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
8
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
8
    res->size = new_size;
117
8
    return res;
118
8
  }
119
8
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
21
}
isl_band.c:isl_band_list_grow
Line
Count
Source
99
18
{
100
18
  isl_ctx *ctx;
101
18
  int i, new_size;
102
18
  LIST(EL) *res;
103
18
104
18
  if (!list)
105
0
    return NULL;
106
18
  
if (18
list->ref == 1 && 18
list->n + n <= list->size18
)
107
18
    return list;
108
18
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
18
}
isl_ast_graft.c:isl_ast_graft_list_grow
Line
Count
Source
99
13.0k
{
100
13.0k
  isl_ctx *ctx;
101
13.0k
  int i, new_size;
102
13.0k
  LIST(EL) *res;
103
13.0k
104
13.0k
  if (!list)
105
0
    return NULL;
106
13.0k
  
if (13.0k
list->ref == 1 && 13.0k
list->n + n <= list->size13.0k
)
107
13.0k
    return list;
108
13.0k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
13.0k
}
isl_ast.c:isl_ast_node_list_grow
Line
Count
Source
99
4.56k
{
100
4.56k
  isl_ctx *ctx;
101
4.56k
  int i, new_size;
102
4.56k
  LIST(EL) *res;
103
4.56k
104
4.56k
  if (!list)
105
0
    return NULL;
106
4.56k
  
if (4.56k
list->ref == 1 && 4.56k
list->n + n <= list->size4.56k
)
107
4.53k
    return list;
108
4.56k
109
27
  
ctx = 27
FN27
(LIST(EL),get_ctx)(list);
110
27
  new_size = ((list->n + n + 1) * 3) / 2;
111
27
  if (
list->ref == 127
)
{27
112
27
    res = isl_realloc(ctx, list, LIST(EL),
113
27
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
27
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
27
    res->size = new_size;
117
27
    return res;
118
27
  }
119
27
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
4.56k
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_grow
isl_aff.c:isl_union_pw_multi_aff_list_grow
Line
Count
Source
99
7
{
100
7
  isl_ctx *ctx;
101
7
  int i, new_size;
102
7
  LIST(EL) *res;
103
7
104
7
  if (!list)
105
0
    return NULL;
106
7
  
if (7
list->ref == 1 && 7
list->n + n <= list->size7
)
107
7
    return list;
108
7
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
7
}
isl_aff.c:isl_union_pw_aff_list_grow
Line
Count
Source
99
27
{
100
27
  isl_ctx *ctx;
101
27
  int i, new_size;
102
27
  LIST(EL) *res;
103
27
104
27
  if (!list)
105
0
    return NULL;
106
27
  
if (27
list->ref == 1 && 27
list->n + n <= list->size27
)
107
12
    return list;
108
27
109
15
  
ctx = 15
FN15
(LIST(EL),get_ctx)(list);
110
15
  new_size = ((list->n + n + 1) * 3) / 2;
111
15
  if (
list->ref == 115
)
{15
112
15
    res = isl_realloc(ctx, list, LIST(EL),
113
15
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
15
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
15
    res->size = new_size;
117
15
    return res;
118
15
  }
119
15
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
27
}
isl_aff.c:isl_pw_aff_list_grow
Line
Count
Source
99
17.2k
{
100
17.2k
  isl_ctx *ctx;
101
17.2k
  int i, new_size;
102
17.2k
  LIST(EL) *res;
103
17.2k
104
17.2k
  if (!list)
105
0
    return NULL;
106
17.2k
  
if (17.2k
list->ref == 1 && 17.2k
list->n + n <= list->size17.2k
)
107
12.6k
    return list;
108
17.2k
109
4.53k
  
ctx = 4.53k
FN4.53k
(LIST(EL),get_ctx)(list);
110
4.53k
  new_size = ((list->n + n + 1) * 3) / 2;
111
4.53k
  if (
list->ref == 14.53k
)
{4.53k
112
4.53k
    res = isl_realloc(ctx, list, LIST(EL),
113
4.53k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
4.53k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
4.53k
    res->size = new_size;
117
4.53k
    return res;
118
4.53k
  }
119
4.53k
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
17.2k
}
isl_set_list.c:isl_union_set_list_grow
Line
Count
Source
99
1.34k
{
100
1.34k
  isl_ctx *ctx;
101
1.34k
  int i, new_size;
102
1.34k
  LIST(EL) *res;
103
1.34k
104
1.34k
  if (!list)
105
0
    return NULL;
106
1.34k
  
if (1.34k
list->ref == 1 && 1.34k
list->n + n <= list->size1.34k
)
107
1.18k
    return list;
108
1.34k
109
162
  
ctx = 162
FN162
(LIST(EL),get_ctx)(list);
110
162
  new_size = ((list->n + n + 1) * 3) / 2;
111
162
  if (
list->ref == 1162
)
{162
112
162
    res = isl_realloc(ctx, list, LIST(EL),
113
162
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
162
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
162
    res->size = new_size;
117
162
    return res;
118
162
  }
119
162
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
1.34k
}
133
134
/* Check that "index" is a valid position in "list".
135
 */
136
static isl_stat FN(LIST(EL),check_index)(__isl_keep LIST(EL) *list, int index)
137
575k
{
138
575k
  if (!list)
139
0
    return isl_stat_error;
140
575k
  
if (575k
index < 0 || 575k
index >= list->n575k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
575k
      "index out of bounds", return isl_stat_error);
143
575k
  return isl_stat_ok;
144
575k
}
isl_val.c:isl_val_list_check_index
Line
Count
Source
137
21
{
138
21
  if (!list)
139
0
    return isl_stat_error;
140
21
  
if (21
index < 0 || 21
index >= list->n21
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
21
      "index out of bounds", return isl_stat_error);
143
21
  return isl_stat_ok;
144
21
}
isl_set_list.c:isl_union_set_list_check_index
Line
Count
Source
137
2.00k
{
138
2.00k
  if (!list)
139
0
    return isl_stat_error;
140
2.00k
  
if (2.00k
index < 0 || 2.00k
index >= list->n2.00k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
2.00k
      "index out of bounds", return isl_stat_error);
143
2.00k
  return isl_stat_ok;
144
2.00k
}
isl_set_list.c:isl_set_list_check_index
Line
Count
Source
137
14.9k
{
138
14.9k
  if (!list)
139
0
    return isl_stat_error;
140
14.9k
  
if (14.9k
index < 0 || 14.9k
index >= list->n14.9k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
14.9k
      "index out of bounds", return isl_stat_error);
143
14.9k
  return isl_stat_ok;
144
14.9k
}
isl_set_list.c:isl_basic_set_list_check_index
Line
Count
Source
137
10.0k
{
138
10.0k
  if (!list)
139
0
    return isl_stat_error;
140
10.0k
  
if (10.0k
index < 0 || 10.0k
index >= list->n10.0k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
10.0k
      "index out of bounds", return isl_stat_error);
143
10.0k
  return isl_stat_ok;
144
10.0k
}
isl_schedule_tree.c:isl_schedule_tree_list_check_index
Line
Count
Source
137
462k
{
138
462k
  if (!list)
139
0
    return isl_stat_error;
140
462k
  
if (462k
index < 0 || 462k
index >= list->n462k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
462k
      "index out of bounds", return isl_stat_error);
143
462k
  return isl_stat_ok;
144
462k
}
isl_map_list.c:isl_union_map_list_check_index
Line
Count
Source
137
11
{
138
11
  if (!list)
139
0
    return isl_stat_error;
140
11
  
if (11
index < 0 || 11
index >= list->n11
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
11
      "index out of bounds", return isl_stat_error);
143
11
  return isl_stat_ok;
144
11
}
isl_map_list.c:isl_map_list_check_index
Line
Count
Source
137
1.09k
{
138
1.09k
  if (!list)
139
0
    return isl_stat_error;
140
1.09k
  
if (1.09k
index < 0 || 1.09k
index >= list->n1.09k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
1.09k
      "index out of bounds", return isl_stat_error);
143
1.09k
  return isl_stat_ok;
144
1.09k
}
isl_map_list.c:isl_basic_map_list_check_index
Line
Count
Source
137
10.1k
{
138
10.1k
  if (!list)
139
0
    return isl_stat_error;
140
10.1k
  
if (10.1k
index < 0 || 10.1k
index >= list->n10.1k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
10.1k
      "index out of bounds", return isl_stat_error);
143
10.1k
  return isl_stat_ok;
144
10.1k
}
isl_id.c:isl_id_list_check_index
Line
Count
Source
137
17.2k
{
138
17.2k
  if (!list)
139
0
    return isl_stat_error;
140
17.2k
  
if (17.2k
index < 0 || 17.2k
index >= list->n17.2k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
17.2k
      "index out of bounds", return isl_stat_error);
143
17.2k
  return isl_stat_ok;
144
17.2k
}
isl_constraint.c:isl_constraint_list_check_index
Line
Count
Source
137
1.96k
{
138
1.96k
  if (!list)
139
0
    return isl_stat_error;
140
1.96k
  
if (1.96k
index < 0 || 1.96k
index >= list->n1.96k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
1.96k
      "index out of bounds", return isl_stat_error);
143
1.96k
  return isl_stat_ok;
144
1.96k
}
isl_band.c:isl_band_list_check_index
Line
Count
Source
137
6
{
138
6
  if (!list)
139
0
    return isl_stat_error;
140
6
  
if (6
index < 0 || 6
index >= list->n6
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
6
      "index out of bounds", return isl_stat_error);
143
6
  return isl_stat_ok;
144
6
}
isl_ast_graft.c:isl_ast_graft_list_check_index
Line
Count
Source
137
30.2k
{
138
30.2k
  if (!list)
139
0
    return isl_stat_error;
140
30.2k
  
if (30.2k
index < 0 || 30.2k
index >= list->n30.2k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
30.2k
      "index out of bounds", return isl_stat_error);
143
30.2k
  return isl_stat_ok;
144
30.2k
}
isl_ast.c:isl_ast_node_list_check_index
Line
Count
Source
137
3.40k
{
138
3.40k
  if (!list)
139
0
    return isl_stat_error;
140
3.40k
  
if (3.40k
index < 0 || 3.40k
index >= list->n3.40k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
3.40k
      "index out of bounds", return isl_stat_error);
143
3.40k
  return isl_stat_ok;
144
3.40k
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_check_index
isl_aff.c:isl_union_pw_multi_aff_list_check_index
Line
Count
Source
137
7
{
138
7
  if (!list)
139
0
    return isl_stat_error;
140
7
  
if (7
index < 0 || 7
index >= list->n7
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
7
      "index out of bounds", return isl_stat_error);
143
7
  return isl_stat_ok;
144
7
}
isl_aff.c:isl_union_pw_aff_list_check_index
Line
Count
Source
137
27
{
138
27
  if (!list)
139
0
    return isl_stat_error;
140
27
  
if (27
index < 0 || 27
index >= list->n27
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
27
      "index out of bounds", return isl_stat_error);
143
27
  return isl_stat_ok;
144
27
}
isl_aff.c:isl_pw_aff_list_check_index
Line
Count
Source
137
14.6k
{
138
14.6k
  if (!list)
139
0
    return isl_stat_error;
140
14.6k
  
if (14.6k
index < 0 || 14.6k
index >= list->n14.6k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
14.6k
      "index out of bounds", return isl_stat_error);
143
14.6k
  return isl_stat_ok;
144
14.6k
}
isl_aff.c:isl_aff_list_check_index
Line
Count
Source
137
7.47k
{
138
7.47k
  if (!list)
139
0
    return isl_stat_error;
140
7.47k
  
if (7.47k
index < 0 || 7.47k
index >= list->n7.47k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
7.47k
      "index out of bounds", return isl_stat_error);
143
7.47k
  return isl_stat_ok;
144
7.47k
}
145
146
__isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
147
  __isl_take struct EL *el)
148
306k
{
149
306k
  list = FN(LIST(EL),grow)(list, 1);
150
306k
  if (
!list || 306k
!el306k
)
151
0
    goto error;
152
306k
  list->p[list->n] = el;
153
306k
  list->n++;
154
306k
  return list;
155
306k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
306k
  return NULL;
159
306k
}
isl_val_list_add
Line
Count
Source
148
21
{
149
21
  list = FN(LIST(EL),grow)(list, 1);
150
21
  if (
!list || 21
!el21
)
151
0
    goto error;
152
21
  list->p[list->n] = el;
153
21
  list->n++;
154
21
  return list;
155
21
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
21
  return NULL;
159
21
}
isl_union_set_list_add
Line
Count
Source
148
1.34k
{
149
1.34k
  list = FN(LIST(EL),grow)(list, 1);
150
1.34k
  if (
!list || 1.34k
!el1.34k
)
151
0
    goto error;
152
1.34k
  list->p[list->n] = el;
153
1.34k
  list->n++;
154
1.34k
  return list;
155
1.34k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
1.34k
  return NULL;
159
1.34k
}
isl_set_list_add
Line
Count
Source
148
10.0k
{
149
10.0k
  list = FN(LIST(EL),grow)(list, 1);
150
10.0k
  if (
!list || 10.0k
!el10.0k
)
151
0
    goto error;
152
10.0k
  list->p[list->n] = el;
153
10.0k
  list->n++;
154
10.0k
  return list;
155
10.0k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
10.0k
  return NULL;
159
10.0k
}
isl_basic_set_list_add
Line
Count
Source
148
2.89k
{
149
2.89k
  list = FN(LIST(EL),grow)(list, 1);
150
2.89k
  if (
!list || 2.89k
!el2.89k
)
151
0
    goto error;
152
2.89k
  list->p[list->n] = el;
153
2.89k
  list->n++;
154
2.89k
  return list;
155
2.89k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
2.89k
  return NULL;
159
2.89k
}
isl_schedule_tree_list_add
Line
Count
Source
148
228k
{
149
228k
  list = FN(LIST(EL),grow)(list, 1);
150
228k
  if (
!list || 228k
!el228k
)
151
0
    goto error;
152
228k
  list->p[list->n] = el;
153
228k
  list->n++;
154
228k
  return list;
155
228k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
228k
  return NULL;
159
228k
}
isl_union_map_list_add
Line
Count
Source
148
5
{
149
5
  list = FN(LIST(EL),grow)(list, 1);
150
5
  if (
!list || 5
!el5
)
151
0
    goto error;
152
5
  list->p[list->n] = el;
153
5
  list->n++;
154
5
  return list;
155
5
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
5
  return NULL;
159
5
}
isl_map_list_add
Line
Count
Source
148
866
{
149
866
  list = FN(LIST(EL),grow)(list, 1);
150
866
  if (
!list || 866
!el866
)
151
0
    goto error;
152
866
  list->p[list->n] = el;
153
866
  list->n++;
154
866
  return list;
155
866
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
866
  return NULL;
159
866
}
isl_basic_map_list_add
Line
Count
Source
148
14.4k
{
149
14.4k
  list = FN(LIST(EL),grow)(list, 1);
150
14.4k
  if (
!list || 14.4k
!el14.4k
)
151
0
    goto error;
152
14.4k
  list->p[list->n] = el;
153
14.4k
  list->n++;
154
14.4k
  return list;
155
14.4k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
14.4k
  return NULL;
159
14.4k
}
isl_id_list_add
Line
Count
Source
148
2.22k
{
149
2.22k
  list = FN(LIST(EL),grow)(list, 1);
150
2.22k
  if (
!list || 2.22k
!el2.22k
)
151
0
    goto error;
152
2.22k
  list->p[list->n] = el;
153
2.22k
  list->n++;
154
2.22k
  return list;
155
2.22k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
2.22k
  return NULL;
159
2.22k
}
isl_constraint_list_add
Line
Count
Source
148
3.49k
{
149
3.49k
  list = FN(LIST(EL),grow)(list, 1);
150
3.49k
  if (
!list || 3.49k
!el3.49k
)
151
0
    goto error;
152
3.49k
  list->p[list->n] = el;
153
3.49k
  list->n++;
154
3.49k
  return list;
155
3.49k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
3.49k
  return NULL;
159
3.49k
}
isl_band_list_add
Line
Count
Source
148
18
{
149
18
  list = FN(LIST(EL),grow)(list, 1);
150
18
  if (
!list || 18
!el18
)
151
0
    goto error;
152
18
  list->p[list->n] = el;
153
18
  list->n++;
154
18
  return list;
155
18
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
18
  return NULL;
159
18
}
isl_ast_graft_list_add
Line
Count
Source
148
13.0k
{
149
13.0k
  list = FN(LIST(EL),grow)(list, 1);
150
13.0k
  if (
!list || 13.0k
!el13.0k
)
151
0
    goto error;
152
13.0k
  list->p[list->n] = el;
153
13.0k
  list->n++;
154
13.0k
  return list;
155
13.0k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
13.0k
  return NULL;
159
13.0k
}
isl_ast_node_list_add
Line
Count
Source
148
4.56k
{
149
4.56k
  list = FN(LIST(EL),grow)(list, 1);
150
4.56k
  if (
!list || 4.56k
!el4.56k
)
151
0
    goto error;
152
4.56k
  list->p[list->n] = el;
153
4.56k
  list->n++;
154
4.56k
  return list;
155
4.56k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
4.56k
  return NULL;
159
4.56k
}
Unexecuted instantiation: isl_ast_expr_list_add
isl_union_pw_multi_aff_list_add
Line
Count
Source
148
7
{
149
7
  list = FN(LIST(EL),grow)(list, 1);
150
7
  if (
!list || 7
!el7
)
151
0
    goto error;
152
7
  list->p[list->n] = el;
153
7
  list->n++;
154
7
  return list;
155
7
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
7
  return NULL;
159
7
}
isl_union_pw_aff_list_add
Line
Count
Source
148
27
{
149
27
  list = FN(LIST(EL),grow)(list, 1);
150
27
  if (
!list || 27
!el27
)
151
0
    goto error;
152
27
  list->p[list->n] = el;
153
27
  list->n++;
154
27
  return list;
155
27
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
27
  return NULL;
159
27
}
isl_pw_aff_list_add
Line
Count
Source
148
17.2k
{
149
17.2k
  list = FN(LIST(EL),grow)(list, 1);
150
17.2k
  if (
!list || 17.2k
!el17.2k
)
151
0
    goto error;
152
17.2k
  list->p[list->n] = el;
153
17.2k
  list->n++;
154
17.2k
  return list;
155
17.2k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
17.2k
  return NULL;
159
17.2k
}
isl_aff_list_add
Line
Count
Source
148
7.25k
{
149
7.25k
  list = FN(LIST(EL),grow)(list, 1);
150
7.25k
  if (
!list || 7.25k
!el7.25k
)
151
0
    goto error;
152
7.25k
  list->p[list->n] = el;
153
7.25k
  list->n++;
154
7.25k
  return list;
155
7.25k
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
7.25k
  return NULL;
159
7.25k
}
160
161
/* Remove the "n" elements starting at "first" from "list".
162
 */
163
__isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list,
164
  unsigned first, unsigned n)
165
61.3k
{
166
61.3k
  int i;
167
61.3k
168
61.3k
  if (!list)
169
0
    return NULL;
170
61.3k
  
if (61.3k
first + n > list->n || 61.3k
first + n < first61.3k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
61.3k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
61.3k
  
if (61.3k
n == 061.3k
)
174
652
    return list;
175
60.7k
  
list = 60.7k
FN60.7k
(LIST(EL),cow)(list);
176
60.7k
  if (!list)
177
0
    return NULL;
178
182k
  
for (i = 0; 60.7k
i < n182k
;
++i121k
)
179
121k
    
FN121k
(EL,free)(list->p[first + i])121k
;
180
63.1k
  for (i = first; 
i + n < list->n63.1k
;
++i2.41k
)
181
2.41k
    list->p[i] = list->p[i + n];
182
60.7k
  list->n -= n;
183
60.7k
  return list;
184
61.3k
}
Unexecuted instantiation: isl_aff_list_drop
Unexecuted instantiation: isl_pw_aff_list_drop
Unexecuted instantiation: isl_union_pw_aff_list_drop
Unexecuted instantiation: isl_union_pw_multi_aff_list_drop
Unexecuted instantiation: isl_ast_expr_list_drop
Unexecuted instantiation: isl_ast_node_list_drop
Unexecuted instantiation: isl_ast_graft_list_drop
Unexecuted instantiation: isl_band_list_drop
isl_constraint_list_drop
Line
Count
Source
165
2.09k
{
166
2.09k
  int i;
167
2.09k
168
2.09k
  if (!list)
169
0
    return NULL;
170
2.09k
  
if (2.09k
first + n > list->n || 2.09k
first + n < first2.09k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
2.09k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
2.09k
  
if (2.09k
n == 02.09k
)
174
652
    return list;
175
1.44k
  
list = 1.44k
FN1.44k
(LIST(EL),cow)(list);
176
1.44k
  if (!list)
177
0
    return NULL;
178
2.97k
  
for (i = 0; 1.44k
i < n2.97k
;
++i1.52k
)
179
1.52k
    
FN1.52k
(EL,free)(list->p[first + i])1.52k
;
180
2.30k
  for (i = first; 
i + n < list->n2.30k
;
++i864
)
181
864
    list->p[i] = list->p[i + n];
182
1.44k
  list->n -= n;
183
1.44k
  return list;
184
2.09k
}
isl_id_list_drop
Line
Count
Source
165
1
{
166
1
  int i;
167
1
168
1
  if (!list)
169
0
    return NULL;
170
1
  
if (1
first + n > list->n || 1
first + n < first1
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
1
      "index out of bounds", return FN(LIST(EL),free)(list));
173
1
  
if (1
n == 01
)
174
0
    return list;
175
1
  
list = 1
FN1
(LIST(EL),cow)(list);
176
1
  if (!list)
177
0
    return NULL;
178
2
  
for (i = 0; 1
i < n2
;
++i1
)
179
1
    
FN1
(EL,free)(list->p[first + i])1
;
180
3
  for (i = first; 
i + n < list->n3
;
++i2
)
181
2
    list->p[i] = list->p[i + n];
182
1
  list->n -= n;
183
1
  return list;
184
1
}
Unexecuted instantiation: isl_basic_map_list_drop
Unexecuted instantiation: isl_map_list_drop
isl_union_map_list_drop
Line
Count
Source
165
4
{
166
4
  int i;
167
4
168
4
  if (!list)
169
0
    return NULL;
170
4
  
if (4
first + n > list->n || 4
first + n < first4
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
4
      "index out of bounds", return FN(LIST(EL),free)(list));
173
4
  
if (4
n == 04
)
174
0
    return list;
175
4
  
list = 4
FN4
(LIST(EL),cow)(list);
176
4
  if (!list)
177
0
    return NULL;
178
8
  
for (i = 0; 4
i < n8
;
++i4
)
179
4
    
FN4
(EL,free)(list->p[first + i])4
;
180
4
  for (i = first; 
i + n < list->n4
;
++i0
)
181
0
    list->p[i] = list->p[i + n];
182
4
  list->n -= n;
183
4
  return list;
184
4
}
isl_schedule_tree_list_drop
Line
Count
Source
165
58.4k
{
166
58.4k
  int i;
167
58.4k
168
58.4k
  if (!list)
169
0
    return NULL;
170
58.4k
  
if (58.4k
first + n > list->n || 58.4k
first + n < first58.4k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
58.4k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
58.4k
  
if (58.4k
n == 058.4k
)
174
0
    return list;
175
58.4k
  
list = 58.4k
FN58.4k
(LIST(EL),cow)(list);
176
58.4k
  if (!list)
177
0
    return NULL;
178
177k
  
for (i = 0; 58.4k
i < n177k
;
++i119k
)
179
119k
    
FN119k
(EL,free)(list->p[first + i])119k
;
180
59.9k
  for (i = first; 
i + n < list->n59.9k
;
++i1.54k
)
181
1.54k
    list->p[i] = list->p[i + n];
182
58.4k
  list->n -= n;
183
58.4k
  return list;
184
58.4k
}
isl_basic_set_list_drop
Line
Count
Source
165
4
{
166
4
  int i;
167
4
168
4
  if (!list)
169
0
    return NULL;
170
4
  
if (4
first + n > list->n || 4
first + n < first4
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
4
      "index out of bounds", return FN(LIST(EL),free)(list));
173
4
  
if (4
n == 04
)
174
0
    return list;
175
4
  
list = 4
FN4
(LIST(EL),cow)(list);
176
4
  if (!list)
177
0
    return NULL;
178
12
  
for (i = 0; 4
i < n12
;
++i8
)
179
8
    
FN8
(EL,free)(list->p[first + i])8
;
180
4
  for (i = first; 
i + n < list->n4
;
++i0
)
181
0
    list->p[i] = list->p[i + n];
182
4
  list->n -= n;
183
4
  return list;
184
4
}
Unexecuted instantiation: isl_set_list_drop
isl_union_set_list_drop
Line
Count
Source
165
854
{
166
854
  int i;
167
854
168
854
  if (!list)
169
0
    return NULL;
170
854
  
if (854
first + n > list->n || 854
first + n < first854
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
854
      "index out of bounds", return FN(LIST(EL),free)(list));
173
854
  
if (854
n == 0854
)
174
0
    return list;
175
854
  
list = 854
FN854
(LIST(EL),cow)(list);
176
854
  if (!list)
177
0
    return NULL;
178
1.70k
  
for (i = 0; 854
i < n1.70k
;
++i854
)
179
854
    
FN854
(EL,free)(list->p[first + i])854
;
180
854
  for (i = first; 
i + n < list->n854
;
++i0
)
181
0
    list->p[i] = list->p[i + n];
182
854
  list->n -= n;
183
854
  return list;
184
854
}
Unexecuted instantiation: isl_val_list_drop
185
186
/* Insert "el" at position "pos" in "list".
187
 *
188
 * If there is only one reference to "list" and if it already has space
189
 * for one extra element, we insert it directly into "list".
190
 * Otherwise, we create a new list consisting of "el" and copied
191
 * elements from "list".
192
 */
193
__isl_give LIST(EL) *FN(LIST(EL),insert)(__isl_take LIST(EL) *list,
194
  unsigned pos, __isl_take struct EL *el)
195
25
{
196
25
  int i;
197
25
  isl_ctx *ctx;
198
25
  LIST(EL) *res;
199
25
200
25
  if (
!list || 25
!el25
)
201
0
    goto error;
202
25
  
ctx = 25
FN25
(LIST(EL),get_ctx)(list);
203
25
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
25
      "index out of bounds", goto error);
206
25
207
25
  
if (25
list->ref == 1 && 25
list->size > list->n22
)
{1
208
2
    for (i = list->n; 
i > pos2
;
--i1
)
209
1
      list->p[i] = list->p[i - 1];
210
1
    list->n++;
211
1
    list->p[pos] = el;
212
1
    return list;
213
25
  }
214
25
215
24
  
res = 24
FN24
(LIST(EL),alloc)(ctx, list->n + 1);
216
54
  for (i = 0; 
i < pos54
;
++i30
)
217
30
    
res = 30
FN30
(LIST(EL),add)(res,
FN30
(EL,copy)(list->p[i]));
218
24
  res = FN(LIST(EL),add)(res, el);
219
26
  for (i = pos; 
i < list->n26
;
++i2
)
220
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list->p[i]));
221
24
  FN(LIST(EL),free)(list);
222
24
223
25
  return res;
224
25
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
25
  return NULL;
228
25
}
isl_id_list_insert
Line
Count
Source
195
4
{
196
4
  int i;
197
4
  isl_ctx *ctx;
198
4
  LIST(EL) *res;
199
4
200
4
  if (
!list || 4
!el4
)
201
0
    goto error;
202
4
  
ctx = 4
FN4
(LIST(EL),get_ctx)(list);
203
4
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
4
      "index out of bounds", goto error);
206
4
207
4
  
if (4
list->ref == 1 && 4
list->size > list->n1
)
{1
208
2
    for (i = list->n; 
i > pos2
;
--i1
)
209
1
      list->p[i] = list->p[i - 1];
210
1
    list->n++;
211
1
    list->p[pos] = el;
212
1
    return list;
213
4
  }
214
4
215
3
  
res = 3
FN3
(LIST(EL),alloc)(ctx, list->n + 1);
216
6
  for (i = 0; 
i < pos6
;
++i3
)
217
3
    
res = 3
FN3
(LIST(EL),add)(res,
FN3
(EL,copy)(list->p[i]));
218
3
  res = FN(LIST(EL),add)(res, el);
219
3
  for (i = pos; 
i < list->n3
;
++i0
)
220
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
221
3
  FN(LIST(EL),free)(list);
222
3
223
4
  return res;
224
4
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
4
  return NULL;
228
4
}
Unexecuted instantiation: isl_aff_list_insert
Unexecuted instantiation: isl_union_set_list_insert
Unexecuted instantiation: isl_set_list_insert
Unexecuted instantiation: isl_basic_set_list_insert
Unexecuted instantiation: isl_schedule_tree_list_insert
Unexecuted instantiation: isl_union_map_list_insert
Unexecuted instantiation: isl_map_list_insert
Unexecuted instantiation: isl_basic_map_list_insert
Unexecuted instantiation: isl_val_list_insert
Unexecuted instantiation: isl_constraint_list_insert
Unexecuted instantiation: isl_band_list_insert
isl_ast_graft_list_insert
Line
Count
Source
195
21
{
196
21
  int i;
197
21
  isl_ctx *ctx;
198
21
  LIST(EL) *res;
199
21
200
21
  if (
!list || 21
!el21
)
201
0
    goto error;
202
21
  
ctx = 21
FN21
(LIST(EL),get_ctx)(list);
203
21
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
21
      "index out of bounds", goto error);
206
21
207
21
  
if (21
list->ref == 1 && 21
list->size > list->n21
)
{0
208
0
    for (i = list->n; 
i > pos0
;
--i0
)
209
0
      list->p[i] = list->p[i - 1];
210
0
    list->n++;
211
0
    list->p[pos] = el;
212
0
    return list;
213
21
  }
214
21
215
21
  
res = 21
FN21
(LIST(EL),alloc)(ctx, list->n + 1);
216
48
  for (i = 0; 
i < pos48
;
++i27
)
217
27
    
res = 27
FN27
(LIST(EL),add)(res,
FN27
(EL,copy)(list->p[i]));
218
21
  res = FN(LIST(EL),add)(res, el);
219
23
  for (i = pos; 
i < list->n23
;
++i2
)
220
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list->p[i]));
221
21
  FN(LIST(EL),free)(list);
222
21
223
21
  return res;
224
21
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
21
  return NULL;
228
21
}
Unexecuted instantiation: isl_ast_node_list_insert
Unexecuted instantiation: isl_ast_expr_list_insert
Unexecuted instantiation: isl_union_pw_multi_aff_list_insert
Unexecuted instantiation: isl_union_pw_aff_list_insert
Unexecuted instantiation: isl_pw_aff_list_insert
229
230
__isl_null LIST(EL) *FN(LIST(EL),free)(__isl_take LIST(EL) *list)
231
211k
{
232
211k
  int i;
233
211k
234
211k
  if (!list)
235
35.4k
    return NULL;
236
211k
237
176k
  
if (176k
--list->ref > 0176k
)
238
49.0k
    return NULL;
239
176k
240
176k
  isl_ctx_deref(list->ctx);
241
312k
  for (i = 0; 
i < list->n312k
;
++i184k
)
242
184k
    
FN184k
(EL,free)(list->p[i])184k
;
243
127k
  free(list);
244
127k
245
176k
  return NULL;
246
211k
}
isl_union_set_list_free
Line
Count
Source
231
398
{
232
398
  int i;
233
398
234
398
  if (!list)
235
0
    return NULL;
236
398
237
398
  
if (398
--list->ref > 0398
)
238
0
    return NULL;
239
398
240
398
  isl_ctx_deref(list->ctx);
241
886
  for (i = 0; 
i < list->n886
;
++i488
)
242
488
    
FN488
(EL,free)(list->p[i])488
;
243
398
  free(list);
244
398
245
398
  return NULL;
246
398
}
isl_aff_list_free
Line
Count
Source
231
13.8k
{
232
13.8k
  int i;
233
13.8k
234
13.8k
  if (!list)
235
6.53k
    return NULL;
236
13.8k
237
7.27k
  
if (7.27k
--list->ref > 07.27k
)
238
0
    return NULL;
239
7.27k
240
7.27k
  isl_ctx_deref(list->ctx);
241
14.5k
  for (i = 0; 
i < list->n14.5k
;
++i7.25k
)
242
7.25k
    
FN7.25k
(EL,free)(list->p[i])7.25k
;
243
7.27k
  free(list);
244
7.27k
245
7.27k
  return NULL;
246
13.8k
}
isl_pw_aff_list_free
Line
Count
Source
231
25.0k
{
232
25.0k
  int i;
233
25.0k
234
25.0k
  if (!list)
235
3
    return NULL;
236
25.0k
237
25.0k
  
if (25.0k
--list->ref > 025.0k
)
238
10.3k
    return NULL;
239
25.0k
240
25.0k
  isl_ctx_deref(list->ctx);
241
31.9k
  for (i = 0; 
i < list->n31.9k
;
++i17.2k
)
242
17.2k
    
FN17.2k
(EL,free)(list->p[i])17.2k
;
243
14.7k
  free(list);
244
14.7k
245
25.0k
  return NULL;
246
25.0k
}
isl_union_pw_aff_list_free
Line
Count
Source
231
15
{
232
15
  int i;
233
15
234
15
  if (!list)
235
0
    return NULL;
236
15
237
15
  
if (15
--list->ref > 015
)
238
0
    return NULL;
239
15
240
15
  isl_ctx_deref(list->ctx);
241
42
  for (i = 0; 
i < list->n42
;
++i27
)
242
27
    
FN27
(EL,free)(list->p[i])27
;
243
15
  free(list);
244
15
245
15
  return NULL;
246
15
}
isl_union_pw_multi_aff_list_free
Line
Count
Source
231
7
{
232
7
  int i;
233
7
234
7
  if (!list)
235
0
    return NULL;
236
7
237
7
  
if (7
--list->ref > 07
)
238
0
    return NULL;
239
7
240
7
  isl_ctx_deref(list->ctx);
241
14
  for (i = 0; 
i < list->n14
;
++i7
)
242
7
    
FN7
(EL,free)(list->p[i])7
;
243
7
  free(list);
244
7
245
7
  return NULL;
246
7
}
Unexecuted instantiation: isl_ast_expr_list_free
isl_ast_node_list_free
Line
Count
Source
231
3.59k
{
232
3.59k
  int i;
233
3.59k
234
3.59k
  if (!list)
235
0
    return NULL;
236
3.59k
237
3.59k
  
if (3.59k
--list->ref > 03.59k
)
238
184
    return NULL;
239
3.59k
240
3.59k
  isl_ctx_deref(list->ctx);
241
7.97k
  for (i = 0; 
i < list->n7.97k
;
++i4.56k
)
242
4.56k
    
FN4.56k
(EL,free)(list->p[i])4.56k
;
243
3.40k
  free(list);
244
3.40k
245
3.59k
  return NULL;
246
3.59k
}
isl_ast_graft_list_free
Line
Count
Source
231
14.6k
{
232
14.6k
  int i;
233
14.6k
234
14.6k
  if (!list)
235
0
    return NULL;
236
14.6k
237
14.6k
  
if (14.6k
--list->ref > 014.6k
)
238
0
    return NULL;
239
14.6k
240
14.6k
  isl_ctx_deref(list->ctx);
241
27.6k
  for (i = 0; 
i < list->n27.6k
;
++i13.0k
)
242
13.0k
    
FN13.0k
(EL,free)(list->p[i])13.0k
;
243
14.6k
  free(list);
244
14.6k
245
14.6k
  return NULL;
246
14.6k
}
isl_band_list_free
Line
Count
Source
231
6.10k
{
232
6.10k
  int i;
233
6.10k
234
6.10k
  if (!list)
235
6.08k
    return NULL;
236
6.10k
237
16
  
if (16
--list->ref > 016
)
238
0
    return NULL;
239
16
240
16
  isl_ctx_deref(list->ctx);
241
34
  for (i = 0; 
i < list->n34
;
++i18
)
242
18
    
FN18
(EL,free)(list->p[i])18
;
243
16
  free(list);
244
16
245
16
  return NULL;
246
6.10k
}
isl_val_list_free
Line
Count
Source
231
11
{
232
11
  int i;
233
11
234
11
  if (!list)
235
0
    return NULL;
236
11
237
11
  
if (11
--list->ref > 011
)
238
0
    return NULL;
239
11
240
11
  isl_ctx_deref(list->ctx);
241
32
  for (i = 0; 
i < list->n32
;
++i21
)
242
21
    
FN21
(EL,free)(list->p[i])21
;
243
11
  free(list);
244
11
245
11
  return NULL;
246
11
}
isl_id_list_free
Line
Count
Source
231
29.1k
{
232
29.1k
  int i;
233
29.1k
234
29.1k
  if (!list)
235
0
    return NULL;
236
29.1k
237
29.1k
  
if (29.1k
--list->ref > 029.1k
)
238
27.3k
    return NULL;
239
29.1k
240
29.1k
  isl_ctx_deref(list->ctx);
241
4.01k
  for (i = 0; 
i < list->n4.01k
;
++i2.22k
)
242
2.22k
    
FN2.22k
(EL,free)(list->p[i])2.22k
;
243
1.78k
  free(list);
244
1.78k
245
29.1k
  return NULL;
246
29.1k
}
isl_basic_map_list_free
Line
Count
Source
231
2.14k
{
232
2.14k
  int i;
233
2.14k
234
2.14k
  if (!list)
235
0
    return NULL;
236
2.14k
237
2.14k
  
if (2.14k
--list->ref > 02.14k
)
238
0
    return NULL;
239
2.14k
240
2.14k
  isl_ctx_deref(list->ctx);
241
14.1k
  for (i = 0; 
i < list->n14.1k
;
++i12.0k
)
242
12.0k
    
FN12.0k
(EL,free)(list->p[i])12.0k
;
243
2.14k
  free(list);
244
2.14k
245
2.14k
  return NULL;
246
2.14k
}
isl_map_list_free
Line
Count
Source
231
483
{
232
483
  int i;
233
483
234
483
  if (!list)
235
0
    return NULL;
236
483
237
483
  
if (483
--list->ref > 0483
)
238
0
    return NULL;
239
483
240
483
  isl_ctx_deref(list->ctx);
241
1.60k
  for (i = 0; 
i < list->n1.60k
;
++i1.12k
)
242
1.12k
    
FN1.12k
(EL,free)(list->p[i])1.12k
;
243
483
  free(list);
244
483
245
483
  return NULL;
246
483
}
isl_union_map_list_free
Line
Count
Source
231
1
{
232
1
  int i;
233
1
234
1
  if (!list)
235
0
    return NULL;
236
1
237
1
  
if (1
--list->ref > 01
)
238
0
    return NULL;
239
1
240
1
  isl_ctx_deref(list->ctx);
241
2
  for (i = 0; 
i < list->n2
;
++i1
)
242
1
    
FN1
(EL,free)(list->p[i])1
;
243
1
  free(list);
244
1
245
1
  return NULL;
246
1
}
isl_schedule_tree_list_free
Line
Count
Source
231
95.4k
{
232
95.4k
  int i;
233
95.4k
234
95.4k
  if (!list)
235
16.2k
    return NULL;
236
95.4k
237
79.2k
  
if (79.2k
--list->ref > 079.2k
)
238
11.1k
    return NULL;
239
79.2k
240
79.2k
  isl_ctx_deref(list->ctx);
241
177k
  for (i = 0; 
i < list->n177k
;
++i109k
)
242
109k
    
FN109k
(EL,free)(list->p[i])109k
;
243
68.0k
  free(list);
244
68.0k
245
79.2k
  return NULL;
246
95.4k
}
isl_basic_set_list_free
Line
Count
Source
231
3.26k
{
232
3.26k
  int i;
233
3.26k
234
3.26k
  if (!list)
235
0
    return NULL;
236
3.26k
237
3.26k
  
if (3.26k
--list->ref > 03.26k
)
238
13
    return NULL;
239
3.26k
240
3.26k
  isl_ctx_deref(list->ctx);
241
8.56k
  for (i = 0; 
i < list->n8.56k
;
++i5.30k
)
242
5.30k
    
FN5.30k
(EL,free)(list->p[i])5.30k
;
243
3.25k
  free(list);
244
3.25k
245
3.26k
  return NULL;
246
3.26k
}
isl_set_list_free
Line
Count
Source
231
15.5k
{
232
15.5k
  int i;
233
15.5k
234
15.5k
  if (!list)
235
6.53k
    return NULL;
236
15.5k
237
9.04k
  
if (9.04k
--list->ref > 09.04k
)
238
0
    return NULL;
239
9.04k
240
9.04k
  isl_ctx_deref(list->ctx);
241
18.8k
  for (i = 0; 
i < list->n18.8k
;
++i9.80k
)
242
9.80k
    
FN9.80k
(EL,free)(list->p[i])9.80k
;
243
9.04k
  free(list);
244
9.04k
245
9.04k
  return NULL;
246
15.5k
}
isl_constraint_list_free
Line
Count
Source
231
2.21k
{
232
2.21k
  int i;
233
2.21k
234
2.21k
  if (!list)
235
0
    return NULL;
236
2.21k
237
2.21k
  
if (2.21k
--list->ref > 02.21k
)
238
0
    return NULL;
239
2.21k
240
2.21k
  isl_ctx_deref(list->ctx);
241
4.17k
  for (i = 0; 
i < list->n4.17k
;
++i1.96k
)
242
1.96k
    
FN1.96k
(EL,free)(list->p[i])1.96k
;
243
2.21k
  free(list);
244
2.21k
245
2.21k
  return NULL;
246
2.21k
}
247
248
int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
249
828k
{
250
828k
  return list ? 
list->n815k
:
012.6k
;
251
828k
}
isl_aff_list_n_aff
Line
Count
Source
249
946
{
250
946
  return list ? 
list->n946
:
00
;
251
946
}
isl_val_list_n_val
Line
Count
Source
249
11
{
250
11
  return list ? 
list->n11
:
00
;
251
11
}
isl_union_set_list_n_union_set
Line
Count
Source
249
1.91k
{
250
1.91k
  return list ? 
list->n1.91k
:
00
;
251
1.91k
}
isl_set_list_n_set
Line
Count
Source
249
6.56k
{
250
6.56k
  return list ? 
list->n6.56k
:
00
;
251
6.56k
}
isl_basic_set_list_n_basic_set
Line
Count
Source
249
5.21k
{
250
5.21k
  return list ? 
list->n5.21k
:
00
;
251
5.21k
}
isl_schedule_tree_list_n_schedule_tree
Line
Count
Source
249
766k
{
250
766k
  return list ? 
list->n754k
:
012.6k
;
251
766k
}
isl_union_map_list_n_union_map
Line
Count
Source
249
13
{
250
13
  return list ? 
list->n13
:
00
;
251
13
}
isl_map_list_n_map
Line
Count
Source
249
472
{
250
472
  return list ? 
list->n472
:
00
;
251
472
}
isl_basic_map_list_n_basic_map
Line
Count
Source
249
1.88k
{
250
1.88k
  return list ? 
list->n1.88k
:
00
;
251
1.88k
}
isl_id_list_n_id
Line
Count
Source
249
1.04k
{
250
1.04k
  return list ? 
list->n1.04k
:
00
;
251
1.04k
}
isl_constraint_list_n_constraint
Line
Count
Source
249
3.61k
{
250
3.61k
  return list ? 
list->n3.61k
:
00
;
251
3.61k
}
isl_band_list_n_band
Line
Count
Source
249
4
{
250
4
  return list ? 
list->n4
:
00
;
251
4
}
isl_ast_graft_list_n_ast_graft
Line
Count
Source
249
21.1k
{
250
21.1k
  return list ? 
list->n21.1k
:
00
;
251
21.1k
}
isl_ast_node_list_n_ast_node
Line
Count
Source
249
3.75k
{
250
3.75k
  return list ? 
list->n3.75k
:
00
;
251
3.75k
}
Unexecuted instantiation: isl_ast_expr_list_n_ast_expr
isl_union_pw_multi_aff_list_n_union_pw_multi_aff
Line
Count
Source
249
7
{
250
7
  return list ? 
list->n7
:
00
;
251
7
}
isl_union_pw_aff_list_n_union_pw_aff
Line
Count
Source
249
15
{
250
15
  return list ? 
list->n15
:
00
;
251
15
}
isl_pw_aff_list_n_pw_aff
Line
Count
Source
249
14.9k
{
250
14.9k
  return list ? 
list->n14.9k
:
00
;
251
14.9k
}
252
253
__isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
254
539k
{
255
539k
  if (
FN539k
(LIST(EL),check_index)(list, index) < 0539k
)
256
0
    return NULL;
257
539k
  
return 539k
FN539k
(EL,copy)(list->p[index]);
258
539k
}
isl_val_list_get_val
Line
Count
Source
254
21
{
255
21
  if (
FN21
(LIST(EL),check_index)(list, index) < 021
)
256
0
    return NULL;
257
21
  
return 21
FN21
(EL,copy)(list->p[index]);
258
21
}
isl_pw_aff_list_get_pw_aff
Line
Count
Source
254
11.6k
{
255
11.6k
  if (
FN11.6k
(LIST(EL),check_index)(list, index) < 011.6k
)
256
0
    return NULL;
257
11.6k
  
return 11.6k
FN11.6k
(EL,copy)(list->p[index]);
258
11.6k
}
isl_union_pw_aff_list_get_union_pw_aff
Line
Count
Source
254
27
{
255
27
  if (
FN27
(LIST(EL),check_index)(list, index) < 027
)
256
0
    return NULL;
257
27
  
return 27
FN27
(EL,copy)(list->p[index]);
258
27
}
isl_union_pw_multi_aff_list_get_union_pw_multi_aff
Line
Count
Source
254
7
{
255
7
  if (
FN7
(LIST(EL),check_index)(list, index) < 07
)
256
0
    return NULL;
257
7
  
return 7
FN7
(EL,copy)(list->p[index]);
258
7
}
Unexecuted instantiation: isl_ast_expr_list_get_ast_expr
isl_ast_node_list_get_ast_node
Line
Count
Source
254
3.40k
{
255
3.40k
  if (
FN3.40k
(LIST(EL),check_index)(list, index) < 03.40k
)
256
0
    return NULL;
257
3.40k
  
return 3.40k
FN3.40k
(EL,copy)(list->p[index]);
258
3.40k
}
isl_ast_graft_list_get_ast_graft
Line
Count
Source
254
25.1k
{
255
25.1k
  if (
FN25.1k
(LIST(EL),check_index)(list, index) < 025.1k
)
256
0
    return NULL;
257
25.1k
  
return 25.1k
FN25.1k
(EL,copy)(list->p[index]);
258
25.1k
}
isl_band_list_get_band
Line
Count
Source
254
6
{
255
6
  if (
FN6
(LIST(EL),check_index)(list, index) < 06
)
256
0
    return NULL;
257
6
  
return 6
FN6
(EL,copy)(list->p[index]);
258
6
}
isl_constraint_list_get_constraint
Line
Count
Source
254
1.96k
{
255
1.96k
  if (
FN1.96k
(LIST(EL),check_index)(list, index) < 01.96k
)
256
0
    return NULL;
257
1.96k
  
return 1.96k
FN1.96k
(EL,copy)(list->p[index]);
258
1.96k
}
isl_id_list_get_id
Line
Count
Source
254
17.2k
{
255
17.2k
  if (
FN17.2k
(LIST(EL),check_index)(list, index) < 017.2k
)
256
0
    return NULL;
257
17.2k
  
return 17.2k
FN17.2k
(EL,copy)(list->p[index]);
258
17.2k
}
isl_basic_map_list_get_basic_map
Line
Count
Source
254
7.73k
{
255
7.73k
  if (
FN7.73k
(LIST(EL),check_index)(list, index) < 07.73k
)
256
0
    return NULL;
257
7.73k
  
return 7.73k
FN7.73k
(EL,copy)(list->p[index]);
258
7.73k
}
isl_map_list_get_map
Line
Count
Source
254
1.09k
{
255
1.09k
  if (
FN1.09k
(LIST(EL),check_index)(list, index) < 01.09k
)
256
0
    return NULL;
257
1.09k
  
return 1.09k
FN1.09k
(EL,copy)(list->p[index]);
258
1.09k
}
isl_union_map_list_get_union_map
Line
Count
Source
254
9
{
255
9
  if (
FN9
(LIST(EL),check_index)(list, index) < 09
)
256
0
    return NULL;
257
9
  
return 9
FN9
(EL,copy)(list->p[index]);
258
9
}
isl_schedule_tree_list_get_schedule_tree
Line
Count
Source
254
441k
{
255
441k
  if (
FN441k
(LIST(EL),check_index)(list, index) < 0441k
)
256
0
    return NULL;
257
441k
  
return 441k
FN441k
(EL,copy)(list->p[index]);
258
441k
}
isl_basic_set_list_get_basic_set
Line
Count
Source
254
7.46k
{
255
7.46k
  if (
FN7.46k
(LIST(EL),check_index)(list, index) < 07.46k
)
256
0
    return NULL;
257
7.46k
  
return 7.46k
FN7.46k
(EL,copy)(list->p[index]);
258
7.46k
}
isl_set_list_get_set
Line
Count
Source
254
12.4k
{
255
12.4k
  if (
FN12.4k
(LIST(EL),check_index)(list, index) < 012.4k
)
256
0
    return NULL;
257
12.4k
  
return 12.4k
FN12.4k
(EL,copy)(list->p[index]);
258
12.4k
}
isl_union_set_list_get_union_set
Line
Count
Source
254
2.00k
{
255
2.00k
  if (
FN2.00k
(LIST(EL),check_index)(list, index) < 02.00k
)
256
0
    return NULL;
257
2.00k
  
return 2.00k
FN2.00k
(EL,copy)(list->p[index]);
258
2.00k
}
isl_aff_list_get_aff
Line
Count
Source
254
7.47k
{
255
7.47k
  if (
FN7.47k
(LIST(EL),check_index)(list, index) < 07.47k
)
256
0
    return NULL;
257
7.47k
  
return 7.47k
FN7.47k
(EL,copy)(list->p[index]);
258
7.47k
}
259
260
/* Replace the element at position "index" in "list" by "el".
261
 */
262
__isl_give LIST(EL) *FN(FN(LIST(EL),set),BASE)(__isl_take LIST(EL) *list,
263
  int index, __isl_take EL *el)
264
36.2k
{
265
36.2k
  if (
!list || 36.2k
!el36.2k
)
266
0
    goto error;
267
36.2k
  
if (36.2k
FN36.2k
(LIST(EL),check_index)(list, index) < 036.2k
)
268
0
    goto error;
269
36.2k
  
if (36.2k
list->p[index] == el36.2k
)
{8.44k
270
8.44k
    FN(EL,free)(el);
271
8.44k
    return list;
272
36.2k
  }
273
27.7k
  
list = 27.7k
FN27.7k
(LIST(EL),cow)(list);
274
27.7k
  if (!list)
275
0
    goto error;
276
27.7k
  
FN27.7k
(EL,free)(list->p[index]);27.7k
277
27.7k
  list->p[index] = el;
278
27.7k
  return list;
279
27.7k
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
27.7k
  return NULL;
283
36.2k
}
isl_pw_aff_list_set_pw_aff
Line
Count
Source
264
3.00k
{
265
3.00k
  if (
!list || 3.00k
!el3.00k
)
266
0
    goto error;
267
3.00k
  
if (3.00k
FN3.00k
(LIST(EL),check_index)(list, index) < 03.00k
)
268
0
    goto error;
269
3.00k
  
if (3.00k
list->p[index] == el3.00k
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
3.00k
  }
273
3.00k
  
list = 3.00k
FN3.00k
(LIST(EL),cow)(list);
274
3.00k
  if (!list)
275
0
    goto error;
276
3.00k
  
FN3.00k
(EL,free)(list->p[index]);3.00k
277
3.00k
  list->p[index] = el;
278
3.00k
  return list;
279
3.00k
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
3.00k
  return NULL;
283
3.00k
}
Unexecuted instantiation: isl_val_list_set_val
Unexecuted instantiation: isl_union_set_list_set_union_set
isl_set_list_set_set
Line
Count
Source
264
2.52k
{
265
2.52k
  if (
!list || 2.52k
!el2.52k
)
266
0
    goto error;
267
2.52k
  
if (2.52k
FN2.52k
(LIST(EL),check_index)(list, index) < 02.52k
)
268
0
    goto error;
269
2.52k
  
if (2.52k
list->p[index] == el2.52k
)
{1.07k
270
1.07k
    FN(EL,free)(el);
271
1.07k
    return list;
272
2.52k
  }
273
1.45k
  
list = 1.45k
FN1.45k
(LIST(EL),cow)(list);
274
1.45k
  if (!list)
275
0
    goto error;
276
1.45k
  
FN1.45k
(EL,free)(list->p[index]);1.45k
277
1.45k
  list->p[index] = el;
278
1.45k
  return list;
279
1.45k
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
1.45k
  return NULL;
283
2.52k
}
isl_basic_set_list_set_basic_set
Line
Count
Source
264
2.48k
{
265
2.48k
  if (
!list || 2.48k
!el2.48k
)
266
0
    goto error;
267
2.48k
  
if (2.48k
FN2.48k
(LIST(EL),check_index)(list, index) < 02.48k
)
268
0
    goto error;
269
2.48k
  
if (2.48k
list->p[index] == el2.48k
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
2.48k
  }
273
2.48k
  
list = 2.48k
FN2.48k
(LIST(EL),cow)(list);
274
2.48k
  if (!list)
275
0
    goto error;
276
2.48k
  
FN2.48k
(EL,free)(list->p[index]);2.48k
277
2.48k
  list->p[index] = el;
278
2.48k
  return list;
279
2.48k
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
2.48k
  return NULL;
283
2.48k
}
isl_schedule_tree_list_set_schedule_tree
Line
Count
Source
264
20.7k
{
265
20.7k
  if (
!list || 20.7k
!el20.7k
)
266
0
    goto error;
267
20.7k
  
if (20.7k
FN20.7k
(LIST(EL),check_index)(list, index) < 020.7k
)
268
0
    goto error;
269
20.7k
  
if (20.7k
list->p[index] == el20.7k
)
{3
270
3
    FN(EL,free)(el);
271
3
    return list;
272
20.7k
  }
273
20.7k
  
list = 20.7k
FN20.7k
(LIST(EL),cow)(list);
274
20.7k
  if (!list)
275
0
    goto error;
276
20.7k
  
FN20.7k
(EL,free)(list->p[index]);20.7k
277
20.7k
  list->p[index] = el;
278
20.7k
  return list;
279
20.7k
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
20.7k
  return NULL;
283
20.7k
}
isl_union_map_list_set_union_map
Line
Count
Source
264
2
{
265
2
  if (
!list || 2
!el2
)
266
0
    goto error;
267
2
  
if (2
FN2
(LIST(EL),check_index)(list, index) < 02
)
268
0
    goto error;
269
2
  
if (2
list->p[index] == el2
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
2
  }
273
2
  
list = 2
FN2
(LIST(EL),cow)(list);
274
2
  if (!list)
275
0
    goto error;
276
2
  
FN2
(EL,free)(list->p[index]);2
277
2
  list->p[index] = el;
278
2
  return list;
279
2
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
2
  return NULL;
283
2
}
Unexecuted instantiation: isl_map_list_set_map
isl_basic_map_list_set_basic_map
Line
Count
Source
264
2.42k
{
265
2.42k
  if (
!list || 2.42k
!el2.42k
)
266
0
    goto error;
267
2.42k
  
if (2.42k
FN2.42k
(LIST(EL),check_index)(list, index) < 02.42k
)
268
0
    goto error;
269
2.42k
  
if (2.42k
list->p[index] == el2.42k
)
{2.36k
270
2.36k
    FN(EL,free)(el);
271
2.36k
    return list;
272
2.42k
  }
273
55
  
list = 55
FN55
(LIST(EL),cow)(list);
274
55
  if (!list)
275
0
    goto error;
276
55
  
FN55
(EL,free)(list->p[index]);55
277
55
  list->p[index] = el;
278
55
  return list;
279
55
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
55
  return NULL;
283
2.42k
}
isl_aff_list_set_aff
Line
Count
Source
264
2
{
265
2
  if (
!list || 2
!el2
)
266
0
    goto error;
267
2
  
if (2
FN2
(LIST(EL),check_index)(list, index) < 02
)
268
0
    goto error;
269
2
  
if (2
list->p[index] == el2
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
2
  }
273
2
  
list = 2
FN2
(LIST(EL),cow)(list);
274
2
  if (!list)
275
0
    goto error;
276
2
  
FN2
(EL,free)(list->p[index]);2
277
2
  list->p[index] = el;
278
2
  return list;
279
2
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
2
  return NULL;
283
2
}
Unexecuted instantiation: isl_id_list_set_id
Unexecuted instantiation: isl_constraint_list_set_constraint
Unexecuted instantiation: isl_band_list_set_band
isl_ast_graft_list_set_ast_graft
Line
Count
Source
264
5.02k
{
265
5.02k
  if (
!list || 5.02k
!el5.02k
)
266
0
    goto error;
267
5.02k
  
if (5.02k
FN5.02k
(LIST(EL),check_index)(list, index) < 05.02k
)
268
0
    goto error;
269
5.02k
  
if (5.02k
list->p[index] == el5.02k
)
{5.00k
270
5.00k
    FN(EL,free)(el);
271
5.00k
    return list;
272
5.02k
  }
273
17
  
list = 17
FN17
(LIST(EL),cow)(list);
274
17
  if (!list)
275
0
    goto error;
276
17
  
FN17
(EL,free)(list->p[index]);17
277
17
  list->p[index] = el;
278
17
  return list;
279
17
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
17
  return NULL;
283
5.02k
}
Unexecuted instantiation: isl_ast_node_list_set_ast_node
Unexecuted instantiation: isl_ast_expr_list_set_ast_expr
Unexecuted instantiation: isl_union_pw_multi_aff_list_set_union_pw_multi_aff
Unexecuted instantiation: isl_union_pw_aff_list_set_union_pw_aff
284
285
/* Return the element at position "index" of "list".
286
 * This may be either a copy or the element itself
287
 * if there is only one reference to "list".
288
 * This allows the element to be modified inplace
289
 * if both the list and the element have only a single reference.
290
 * The caller is not allowed to modify "list" between
291
 * this call to isl_list_*_take_* and a subsequent call
292
 * to isl_list_*_restore_*.
293
 * The only exception is that isl_list_*_free can be called instead.
294
 */
295
static __isl_give EL *FN(FN(LIST(EL),take),BASE)(__isl_keep LIST(EL) *list,
296
  int index)
297
63
{
298
63
  EL *el;
299
63
300
63
  if (
FN63
(LIST(EL),check_index)(list, index) < 063
)
301
0
    return NULL;
302
63
  
if (63
list->ref != 163
)
303
0
    
return 0
FN0
(FN(LIST(EL),get),BASE)(list, index);
304
63
  el = list->p[index];
305
63
  list->p[index] = NULL;
306
63
  return el;
307
63
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_take_aff
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_take_pw_aff
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_take_union_pw_aff
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_take_union_pw_multi_aff
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_take_ast_expr
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_take_ast_node
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_take_ast_graft
Unexecuted instantiation: isl_band.c:isl_band_list_take_band
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_take_constraint
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_take_basic_map
Unexecuted instantiation: isl_map_list.c:isl_map_list_take_map
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_take_union_map
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_take_schedule_tree
isl_set_list.c:isl_basic_set_list_take_basic_set
Line
Count
Source
297
63
{
298
63
  EL *el;
299
63
300
63
  if (
FN63
(LIST(EL),check_index)(list, index) < 063
)
301
0
    return NULL;
302
63
  
if (63
list->ref != 163
)
303
0
    
return 0
FN0
(FN(LIST(EL),get),BASE)(list, index);
304
63
  el = list->p[index];
305
63
  list->p[index] = NULL;
306
63
  return el;
307
63
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_take_set
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_take_union_set
Unexecuted instantiation: isl_val.c:isl_val_list_take_val
Unexecuted instantiation: isl_id.c:isl_id_list_take_id
308
309
/* Set the element at position "index" of "list" to "el",
310
 * where the position may be empty due to a previous call
311
 * to isl_list_*_take_*.
312
 */
313
static __isl_give LIST(EL) *FN(FN(LIST(EL),restore),BASE)(
314
  __isl_take LIST(EL) *list, int index, __isl_take EL *el)
315
63
{
316
63
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
317
63
}
Unexecuted instantiation: isl_val.c:isl_val_list_restore_val
Unexecuted instantiation: isl_band.c:isl_band_list_restore_band
Unexecuted instantiation: isl_aff.c:isl_aff_list_restore_aff
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_restore_pw_aff
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_restore_union_pw_aff
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_restore_union_pw_multi_aff
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_restore_ast_expr
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_restore_ast_node
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_restore_ast_graft
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_restore_constraint
Unexecuted instantiation: isl_id.c:isl_id_list_restore_id
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_restore_basic_map
Unexecuted instantiation: isl_map_list.c:isl_map_list_restore_map
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_restore_union_map
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_restore_schedule_tree
isl_set_list.c:isl_basic_set_list_restore_basic_set
Line
Count
Source
315
63
{
316
63
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
317
63
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_restore_set
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_restore_union_set
318
319
isl_stat FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list,
320
  isl_stat (*fn)(__isl_take EL *el, void *user), void *user)
321
1.52k
{
322
1.52k
  int i;
323
1.52k
324
1.52k
  if (!list)
325
0
    return isl_stat_error;
326
1.52k
327
3.34k
  
for (i = 0; 1.52k
i < list->n3.34k
;
++i1.82k
)
{2.36k
328
2.36k
    
EL2.36k
*el =
FN2.36k
(EL,copy)(list->p[i]);
329
2.36k
    if (!el)
330
0
      return isl_stat_error;
331
2.36k
    
if (2.36k
fn(el, user) < 02.36k
)
332
538
      return isl_stat_error;
333
2.36k
  }
334
1.52k
335
982
  return isl_stat_ok;
336
1.52k
}
Unexecuted instantiation: isl_val_list_foreach
Unexecuted instantiation: isl_union_set_list_foreach
Unexecuted instantiation: isl_set_list_foreach
isl_basic_set_list_foreach
Line
Count
Source
321
124
{
322
124
  int i;
323
124
324
124
  if (!list)
325
0
    return isl_stat_error;
326
124
327
250
  
for (i = 0; 124
i < list->n250
;
++i126
)
{126
328
126
    
EL126
*el =
FN126
(EL,copy)(list->p[i]);
329
126
    if (!el)
330
0
      return isl_stat_error;
331
126
    
if (126
fn(el, user) < 0126
)
332
0
      return isl_stat_error;
333
126
  }
334
124
335
124
  return isl_stat_ok;
336
124
}
Unexecuted instantiation: isl_schedule_tree_list_foreach
Unexecuted instantiation: isl_union_map_list_foreach
Unexecuted instantiation: isl_map_list_foreach
Unexecuted instantiation: isl_basic_map_list_foreach
Unexecuted instantiation: isl_id_list_foreach
isl_pw_aff_list_foreach
Line
Count
Source
321
698
{
322
698
  int i;
323
698
324
698
  if (!list)
325
0
    return isl_stat_error;
326
698
327
868
  
for (i = 0; 698
i < list->n868
;
++i170
)
{708
328
708
    
EL708
*el =
FN708
(EL,copy)(list->p[i]);
329
708
    if (!el)
330
0
      return isl_stat_error;
331
708
    
if (708
fn(el, user) < 0708
)
332
538
      return isl_stat_error;
333
708
  }
334
698
335
160
  return isl_stat_ok;
336
698
}
isl_constraint_list_foreach
Line
Count
Source
321
698
{
322
698
  int i;
323
698
324
698
  if (!list)
325
0
    return isl_stat_error;
326
698
327
2.22k
  
for (i = 0; 698
i < list->n2.22k
;
++i1.52k
)
{1.52k
328
1.52k
    
EL1.52k
*el =
FN1.52k
(EL,copy)(list->p[i]);
329
1.52k
    if (!el)
330
0
      return isl_stat_error;
331
1.52k
    
if (1.52k
fn(el, user) < 01.52k
)
332
0
      return isl_stat_error;
333
1.52k
  }
334
698
335
698
  return isl_stat_ok;
336
698
}
Unexecuted instantiation: isl_band_list_foreach
Unexecuted instantiation: isl_ast_graft_list_foreach
Unexecuted instantiation: isl_ast_node_list_foreach
Unexecuted instantiation: isl_ast_expr_list_foreach
Unexecuted instantiation: isl_union_pw_multi_aff_list_foreach
Unexecuted instantiation: isl_union_pw_aff_list_foreach
Unexecuted instantiation: isl_aff_list_foreach
337
338
/* Replace each element in "list" by the result of calling "fn"
339
 * on the element.
340
 */
341
__isl_give LIST(EL) *FN(LIST(EL),map)(__isl_keep LIST(EL) *list,
342
  __isl_give EL *(*fn)(__isl_take EL *el, void *user), void *user)
343
62
{
344
62
  int i, n;
345
62
346
62
  if (!list)
347
0
    return NULL;
348
62
349
62
  n = list->n;
350
125
  for (i = 0; 
i < n125
;
++i63
)
{63
351
63
    
EL63
*el =
FN63
(FN(LIST(EL),take),BASE)(list, i);
352
63
    if (!el)
353
0
      
return 0
FN0
(LIST(EL),free)(list);
354
63
    el = fn(el, user);
355
63
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
356
63
  }
357
62
358
62
  return list;
359
62
}
Unexecuted instantiation: isl_aff_list_map
Unexecuted instantiation: isl_val_list_map
Unexecuted instantiation: isl_union_set_list_map
Unexecuted instantiation: isl_set_list_map
isl_basic_set_list_map
Line
Count
Source
343
62
{
344
62
  int i, n;
345
62
346
62
  if (!list)
347
0
    return NULL;
348
62
349
62
  n = list->n;
350
125
  for (i = 0; 
i < n125
;
++i63
)
{63
351
63
    
EL63
*el =
FN63
(FN(LIST(EL),take),BASE)(list, i);
352
63
    if (!el)
353
0
      
return 0
FN0
(LIST(EL),free)(list);
354
63
    el = fn(el, user);
355
63
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
356
63
  }
357
62
358
62
  return list;
359
62
}
Unexecuted instantiation: isl_schedule_tree_list_map
Unexecuted instantiation: isl_union_map_list_map
Unexecuted instantiation: isl_map_list_map
Unexecuted instantiation: isl_basic_map_list_map
Unexecuted instantiation: isl_id_list_map
Unexecuted instantiation: isl_constraint_list_map
Unexecuted instantiation: isl_band_list_map
Unexecuted instantiation: isl_ast_graft_list_map
Unexecuted instantiation: isl_ast_node_list_map
Unexecuted instantiation: isl_ast_expr_list_map
Unexecuted instantiation: isl_union_pw_multi_aff_list_map
Unexecuted instantiation: isl_union_pw_aff_list_map
Unexecuted instantiation: isl_pw_aff_list_map
360
361
/* Internal data structure for isl_*_list_sort.
362
 *
363
 * "cmp" is the original comparison function.
364
 * "user" is a user provided pointer that should be passed to "cmp".
365
 */
366
S(LIST(EL),sort_data) {
367
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user);
368
  void *user;
369
};
370
371
/* Compare two entries of an isl_*_list based on the user provided
372
 * comparison function on pairs of isl_* objects.
373
 */
374
static int FN(LIST(EL),cmp)(const void *a, const void *b, void *user)
375
1.13k
{
376
1.13k
  S(LIST(EL),sort_data) *data = user;
377
1.13k
  EL * const *el1 = a;
378
1.13k
  EL * const *el2 = b;
379
1.13k
380
1.13k
  return data->cmp(*el1, *el2, data->user);
381
1.13k
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_cmp
Unexecuted instantiation: isl_id.c:isl_id_list_cmp
Unexecuted instantiation: isl_val.c:isl_val_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_set_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_basic_set_list_cmp
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_map_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_cmp
isl_constraint.c:isl_constraint_list_cmp
Line
Count
Source
375
1.03k
{
376
1.03k
  S(LIST(EL),sort_data) *data = user;
377
1.03k
  EL * const *el1 = a;
378
1.03k
  EL * const *el2 = b;
379
1.03k
380
1.03k
  return data->cmp(*el1, *el2, data->user);
381
1.03k
}
Unexecuted instantiation: isl_band.c:isl_band_list_cmp
isl_ast_graft.c:isl_ast_graft_list_cmp
Line
Count
Source
375
18
{
376
18
  S(LIST(EL),sort_data) *data = user;
377
18
  EL * const *el1 = a;
378
18
  EL * const *el2 = b;
379
18
380
18
  return data->cmp(*el1, *el2, data->user);
381
18
}
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_cmp
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_cmp
isl_aff.c:isl_pw_aff_list_cmp
Line
Count
Source
375
84
{
376
84
  S(LIST(EL),sort_data) *data = user;
377
84
  EL * const *el1 = a;
378
84
  EL * const *el2 = b;
379
84
380
84
  return data->cmp(*el1, *el2, data->user);
381
84
}
382
383
/* Sort the elements of "list" in ascending order according to
384
 * comparison function "cmp".
385
 */
386
__isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list,
387
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *user)
388
1.62k
{
389
1.62k
  S(LIST(EL),sort_data) data = { cmp, user };
390
1.62k
391
1.62k
  if (!list)
392
0
    return NULL;
393
1.62k
  
if (1.62k
list->n <= 11.62k
)
394
765
    return list;
395
856
  
list = 856
FN856
(LIST(EL),cow)(list);
396
856
  if (!list)
397
0
    return NULL;
398
856
399
856
  
if (856
isl_sort(list->p, list->n, sizeof(list->p[0]),856
400
856
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
856
403
856
  return list;
404
1.62k
}
Unexecuted instantiation: isl_id_list_sort
Unexecuted instantiation: isl_val_list_sort
Unexecuted instantiation: isl_union_set_list_sort
Unexecuted instantiation: isl_set_list_sort
Unexecuted instantiation: isl_basic_set_list_sort
Unexecuted instantiation: isl_schedule_tree_list_sort
Unexecuted instantiation: isl_union_map_list_sort
Unexecuted instantiation: isl_map_list_sort
Unexecuted instantiation: isl_basic_map_list_sort
isl_constraint_list_sort
Line
Count
Source
388
1.51k
{
389
1.51k
  S(LIST(EL),sort_data) data = { cmp, user };
390
1.51k
391
1.51k
  if (!list)
392
0
    return NULL;
393
1.51k
  
if (1.51k
list->n <= 11.51k
)
394
754
    return list;
395
764
  
list = 764
FN764
(LIST(EL),cow)(list);
396
764
  if (!list)
397
0
    return NULL;
398
764
399
764
  
if (764
isl_sort(list->p, list->n, sizeof(list->p[0]),764
400
764
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
764
403
764
  return list;
404
1.51k
}
Unexecuted instantiation: isl_band_list_sort
isl_ast_graft_list_sort
Line
Count
Source
388
18
{
389
18
  S(LIST(EL),sort_data) data = { cmp, user };
390
18
391
18
  if (!list)
392
0
    return NULL;
393
18
  
if (18
list->n <= 118
)
394
0
    return list;
395
18
  
list = 18
FN18
(LIST(EL),cow)(list);
396
18
  if (!list)
397
0
    return NULL;
398
18
399
18
  
if (18
isl_sort(list->p, list->n, sizeof(list->p[0]),18
400
18
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
18
403
18
  return list;
404
18
}
Unexecuted instantiation: isl_ast_node_list_sort
Unexecuted instantiation: isl_ast_expr_list_sort
Unexecuted instantiation: isl_union_pw_multi_aff_list_sort
Unexecuted instantiation: isl_union_pw_aff_list_sort
isl_pw_aff_list_sort
Line
Count
Source
388
85
{
389
85
  S(LIST(EL),sort_data) data = { cmp, user };
390
85
391
85
  if (!list)
392
0
    return NULL;
393
85
  
if (85
list->n <= 185
)
394
11
    return list;
395
74
  
list = 74
FN74
(LIST(EL),cow)(list);
396
74
  if (!list)
397
0
    return NULL;
398
74
399
74
  
if (74
isl_sort(list->p, list->n, sizeof(list->p[0]),74
400
74
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
74
403
74
  return list;
404
85
}
Unexecuted instantiation: isl_aff_list_sort
405
406
/* Internal data structure for isl_*_list_foreach_scc.
407
 *
408
 * "list" is the original list.
409
 * "follows" is the user provided callback that defines the edges of the graph.
410
 */
411
S(LIST(EL),foreach_scc_data) {
412
  LIST(EL) *list;
413
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user);
414
  void *follows_user;
415
};
416
417
/* Does element i of data->list follow element j?
418
 *
419
 * Use the user provided callback to find out.
420
 */
421
static isl_bool FN(LIST(EL),follows)(int i, int j, void *user)
422
106
{
423
106
  S(LIST(EL),foreach_scc_data) *data = user;
424
106
425
106
  return data->follows(data->list->p[i], data->list->p[j],
426
106
        data->follows_user);
427
106
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_follows
isl_set_list.c:isl_basic_set_list_follows
Line
Count
Source
422
106
{
423
106
  S(LIST(EL),foreach_scc_data) *data = user;
424
106
425
106
  return data->follows(data->list->p[i], data->list->p[j],
426
106
        data->follows_user);
427
106
}
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_follows
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_follows
Unexecuted instantiation: isl_map_list.c:isl_map_list_follows
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_follows
Unexecuted instantiation: isl_id.c:isl_id_list_follows
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_follows
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_follows
Unexecuted instantiation: isl_val.c:isl_val_list_follows
Unexecuted instantiation: isl_band.c:isl_band_list_follows
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_follows
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_follows
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_follows
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_aff_list_follows
428
429
/* Call "fn" on the sublist of "list" that consists of the elements
430
 * with indices specified by the "n" elements of "pos".
431
 */
432
static isl_stat FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos,
433
  int n, isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *user)
434
68
{
435
68
  int i;
436
68
  isl_ctx *ctx;
437
68
  LIST(EL) *slice;
438
68
439
68
  ctx = FN(LIST(EL),get_ctx)(list);
440
68
  slice = FN(LIST(EL),alloc)(ctx, n);
441
136
  for (i = 0; 
i < n136
;
++i68
)
{68
442
68
    EL *el;
443
68
444
68
    el = FN(EL,copy)(list->p[pos[i]]);
445
68
    slice = FN(LIST(EL),add)(slice, el);
446
68
  }
447
68
448
68
  return fn(slice, user);
449
68
}
Unexecuted instantiation: isl_id.c:isl_id_list_call_on_scc
Unexecuted instantiation: isl_val.c:isl_val_list_call_on_scc
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_call_on_scc
Unexecuted instantiation: isl_set_list.c:isl_set_list_call_on_scc
isl_set_list.c:isl_basic_set_list_call_on_scc
Line
Count
Source
434
68
{
435
68
  int i;
436
68
  isl_ctx *ctx;
437
68
  LIST(EL) *slice;
438
68
439
68
  ctx = FN(LIST(EL),get_ctx)(list);
440
68
  slice = FN(LIST(EL),alloc)(ctx, n);
441
136
  for (i = 0; 
i < n136
;
++i68
)
{68
442
68
    EL *el;
443
68
444
68
    el = FN(EL,copy)(list->p[pos[i]]);
445
68
    slice = FN(LIST(EL),add)(slice, el);
446
68
  }
447
68
448
68
  return fn(slice, user);
449
68
}
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_map_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_aff_list_call_on_scc
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_call_on_scc
Unexecuted instantiation: isl_band.c:isl_band_list_call_on_scc
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_call_on_scc
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_call_on_scc
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_call_on_scc
450
451
/* Call "fn" on each of the strongly connected components (SCCs) of
452
 * the graph with as vertices the elements of "list" and
453
 * a directed edge from node b to node a iff follows(a, b)
454
 * returns 1.  follows should return -1 on error.
455
 *
456
 * If SCC a contains a node i that follows a node j in another SCC b
457
 * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a
458
 * after being called on SCC b.
459
 *
460
 * We simply call isl_tarjan_graph_init, extract the SCCs from the result and
461
 * call fn on each of them.
462
 */
463
isl_stat FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list,
464
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user),
465
  void *follows_user,
466
  isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user)
467
44
{
468
44
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
469
44
  int i, n;
470
44
  isl_ctx *ctx;
471
44
  struct isl_tarjan_graph *g;
472
44
473
44
  if (!list)
474
0
    return isl_stat_error;
475
44
  
if (44
list->n == 044
)
476
0
    return isl_stat_ok;
477
44
  
if (44
list->n == 144
)
478
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
479
44
480
44
  
ctx = 44
FN44
(LIST(EL),get_ctx)(list);
481
44
  n = list->n;
482
44
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
483
44
  if (!g)
484
0
    return isl_stat_error;
485
44
486
44
  i = 0;
487
81
  do {
488
81
    int first;
489
81
490
81
    if (g->order[i] == -1)
491
0
      isl_die(ctx, isl_error_internal, "cannot happen",
492
81
        break);
493
81
    first = i;
494
181
    while (
g->order[i] != -1181
)
{100
495
100
      ++i; --n;
496
100
    }
497
81
    if (
first == 0 && 81
n == 044
)
{13
498
13
      isl_tarjan_graph_free(g);
499
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
500
81
    }
501
68
    
if (68
FN68
(LIST(EL),call_on_scc)(list, g->order + first, i - first,68
502
68
              fn, fn_user) < 0)
503
0
      break;
504
68
    ++i;
505
68
  } while (n);
506
44
507
44
  isl_tarjan_graph_free(g);
508
31
509
31
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok31
;
510
44
}
Unexecuted instantiation: isl_aff_list_foreach_scc
Unexecuted instantiation: isl_union_pw_aff_list_foreach_scc
Unexecuted instantiation: isl_union_pw_multi_aff_list_foreach_scc
Unexecuted instantiation: isl_ast_expr_list_foreach_scc
Unexecuted instantiation: isl_ast_node_list_foreach_scc
Unexecuted instantiation: isl_ast_graft_list_foreach_scc
Unexecuted instantiation: isl_band_list_foreach_scc
Unexecuted instantiation: isl_constraint_list_foreach_scc
Unexecuted instantiation: isl_id_list_foreach_scc
Unexecuted instantiation: isl_basic_map_list_foreach_scc
Unexecuted instantiation: isl_map_list_foreach_scc
Unexecuted instantiation: isl_union_map_list_foreach_scc
Unexecuted instantiation: isl_schedule_tree_list_foreach_scc
isl_basic_set_list_foreach_scc
Line
Count
Source
467
44
{
468
44
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
469
44
  int i, n;
470
44
  isl_ctx *ctx;
471
44
  struct isl_tarjan_graph *g;
472
44
473
44
  if (!list)
474
0
    return isl_stat_error;
475
44
  
if (44
list->n == 044
)
476
0
    return isl_stat_ok;
477
44
  
if (44
list->n == 144
)
478
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
479
44
480
44
  
ctx = 44
FN44
(LIST(EL),get_ctx)(list);
481
44
  n = list->n;
482
44
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
483
44
  if (!g)
484
0
    return isl_stat_error;
485
44
486
44
  i = 0;
487
81
  do {
488
81
    int first;
489
81
490
81
    if (g->order[i] == -1)
491
0
      isl_die(ctx, isl_error_internal, "cannot happen",
492
81
        break);
493
81
    first = i;
494
181
    while (
g->order[i] != -1181
)
{100
495
100
      ++i; --n;
496
100
    }
497
81
    if (
first == 0 && 81
n == 044
)
{13
498
13
      isl_tarjan_graph_free(g);
499
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
500
81
    }
501
68
    
if (68
FN68
(LIST(EL),call_on_scc)(list, g->order + first, i - first,68
502
68
              fn, fn_user) < 0)
503
0
      break;
504
68
    ++i;
505
68
  } while (n);
506
44
507
44
  isl_tarjan_graph_free(g);
508
31
509
31
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok31
;
510
44
}
Unexecuted instantiation: isl_set_list_foreach_scc
Unexecuted instantiation: isl_union_set_list_foreach_scc
Unexecuted instantiation: isl_val_list_foreach_scc
Unexecuted instantiation: isl_pw_aff_list_foreach_scc
511
512
__isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el)
513
27.2k
{
514
27.2k
  isl_ctx *ctx;
515
27.2k
  LIST(EL) *list;
516
27.2k
517
27.2k
  if (!el)
518
1
    return NULL;
519
27.2k
  
ctx = 27.2k
FN27.2k
(EL,get_ctx)(el);
520
27.2k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
27.2k
  if (!list)
522
0
    goto error;
523
27.2k
  
list = 27.2k
FN27.2k
(LIST(EL),add)(list, el);
524
27.2k
  return list;
525
27.2k
error:
526
0
  FN(EL,free)(el);
527
27.2k
  return NULL;
528
27.2k
}
isl_union_set_list_from_union_set
Line
Count
Source
513
326
{
514
326
  isl_ctx *ctx;
515
326
  LIST(EL) *list;
516
326
517
326
  if (!el)
518
0
    return NULL;
519
326
  
ctx = 326
FN326
(EL,get_ctx)(el);
520
326
  list = FN(LIST(EL),alloc)(ctx, 1);
521
326
  if (!list)
522
0
    goto error;
523
326
  
list = 326
FN326
(LIST(EL),add)(list, el);
524
326
  return list;
525
326
error:
526
0
  FN(EL,free)(el);
527
326
  return NULL;
528
326
}
isl_band_list_from_band
Line
Count
Source
513
6
{
514
6
  isl_ctx *ctx;
515
6
  LIST(EL) *list;
516
6
517
6
  if (!el)
518
0
    return NULL;
519
6
  
ctx = 6
FN6
(EL,get_ctx)(el);
520
6
  list = FN(LIST(EL),alloc)(ctx, 1);
521
6
  if (!list)
522
0
    goto error;
523
6
  
list = 6
FN6
(LIST(EL),add)(list, el);
524
6
  return list;
525
6
error:
526
0
  FN(EL,free)(el);
527
6
  return NULL;
528
6
}
isl_set_list_from_set
Line
Count
Source
513
6.51k
{
514
6.51k
  isl_ctx *ctx;
515
6.51k
  LIST(EL) *list;
516
6.51k
517
6.51k
  if (!el)
518
0
    return NULL;
519
6.51k
  
ctx = 6.51k
FN6.51k
(EL,get_ctx)(el);
520
6.51k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
6.51k
  if (!list)
522
0
    goto error;
523
6.51k
  
list = 6.51k
FN6.51k
(LIST(EL),add)(list, el);
524
6.51k
  return list;
525
6.51k
error:
526
0
  FN(EL,free)(el);
527
6.51k
  return NULL;
528
6.51k
}
isl_basic_set_list_from_basic_set
Line
Count
Source
513
835
{
514
835
  isl_ctx *ctx;
515
835
  LIST(EL) *list;
516
835
517
835
  if (!el)
518
0
    return NULL;
519
835
  
ctx = 835
FN835
(EL,get_ctx)(el);
520
835
  list = FN(LIST(EL),alloc)(ctx, 1);
521
835
  if (!list)
522
0
    goto error;
523
835
  
list = 835
FN835
(LIST(EL),add)(list, el);
524
835
  return list;
525
835
error:
526
0
  FN(EL,free)(el);
527
835
  return NULL;
528
835
}
isl_schedule_tree_list_from_schedule_tree
Line
Count
Source
513
3.47k
{
514
3.47k
  isl_ctx *ctx;
515
3.47k
  LIST(EL) *list;
516
3.47k
517
3.47k
  if (!el)
518
0
    return NULL;
519
3.47k
  
ctx = 3.47k
FN3.47k
(EL,get_ctx)(el);
520
3.47k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
3.47k
  if (!list)
522
0
    goto error;
523
3.47k
  
list = 3.47k
FN3.47k
(LIST(EL),add)(list, el);
524
3.47k
  return list;
525
3.47k
error:
526
0
  FN(EL,free)(el);
527
3.47k
  return NULL;
528
3.47k
}
isl_union_map_list_from_union_map
Line
Count
Source
513
1
{
514
1
  isl_ctx *ctx;
515
1
  LIST(EL) *list;
516
1
517
1
  if (!el)
518
0
    return NULL;
519
1
  
ctx = 1
FN1
(EL,get_ctx)(el);
520
1
  list = FN(LIST(EL),alloc)(ctx, 1);
521
1
  if (!list)
522
0
    goto error;
523
1
  
list = 1
FN1
(LIST(EL),add)(list, el);
524
1
  return list;
525
1
error:
526
0
  FN(EL,free)(el);
527
1
  return NULL;
528
1
}
Unexecuted instantiation: isl_map_list_from_map
Unexecuted instantiation: isl_basic_map_list_from_basic_map
Unexecuted instantiation: isl_id_list_from_id
Unexecuted instantiation: isl_constraint_list_from_constraint
isl_ast_graft_list_from_ast_graft
Line
Count
Source
513
1.64k
{
514
1.64k
  isl_ctx *ctx;
515
1.64k
  LIST(EL) *list;
516
1.64k
517
1.64k
  if (!el)
518
0
    return NULL;
519
1.64k
  
ctx = 1.64k
FN1.64k
(EL,get_ctx)(el);
520
1.64k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
1.64k
  if (!list)
522
0
    goto error;
523
1.64k
  
list = 1.64k
FN1.64k
(LIST(EL),add)(list, el);
524
1.64k
  return list;
525
1.64k
error:
526
0
  FN(EL,free)(el);
527
1.64k
  return NULL;
528
1.64k
}
isl_ast_node_list_from_ast_node
Line
Count
Source
513
21
{
514
21
  isl_ctx *ctx;
515
21
  LIST(EL) *list;
516
21
517
21
  if (!el)
518
0
    return NULL;
519
21
  
ctx = 21
FN21
(EL,get_ctx)(el);
520
21
  list = FN(LIST(EL),alloc)(ctx, 1);
521
21
  if (!list)
522
0
    goto error;
523
21
  
list = 21
FN21
(LIST(EL),add)(list, el);
524
21
  return list;
525
21
error:
526
0
  FN(EL,free)(el);
527
21
  return NULL;
528
21
}
Unexecuted instantiation: isl_ast_expr_list_from_ast_expr
isl_union_pw_multi_aff_list_from_union_pw_multi_aff
Line
Count
Source
513
7
{
514
7
  isl_ctx *ctx;
515
7
  LIST(EL) *list;
516
7
517
7
  if (!el)
518
0
    return NULL;
519
7
  
ctx = 7
FN7
(EL,get_ctx)(el);
520
7
  list = FN(LIST(EL),alloc)(ctx, 1);
521
7
  if (!list)
522
0
    goto error;
523
7
  
list = 7
FN7
(LIST(EL),add)(list, el);
524
7
  return list;
525
7
error:
526
0
  FN(EL,free)(el);
527
7
  return NULL;
528
7
}
Unexecuted instantiation: isl_union_pw_aff_list_from_union_pw_aff
isl_pw_aff_list_from_pw_aff
Line
Count
Source
513
7.95k
{
514
7.95k
  isl_ctx *ctx;
515
7.95k
  LIST(EL) *list;
516
7.95k
517
7.95k
  if (!el)
518
1
    return NULL;
519
7.95k
  
ctx = 7.95k
FN7.95k
(EL,get_ctx)(el);
520
7.95k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
7.95k
  if (!list)
522
0
    goto error;
523
7.95k
  
list = 7.95k
FN7.95k
(LIST(EL),add)(list, el);
524
7.95k
  return list;
525
7.95k
error:
526
0
  FN(EL,free)(el);
527
7.95k
  return NULL;
528
7.95k
}
isl_aff_list_from_aff
Line
Count
Source
513
6.51k
{
514
6.51k
  isl_ctx *ctx;
515
6.51k
  LIST(EL) *list;
516
6.51k
517
6.51k
  if (!el)
518
0
    return NULL;
519
6.51k
  
ctx = 6.51k
FN6.51k
(EL,get_ctx)(el);
520
6.51k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
6.51k
  if (!list)
522
0
    goto error;
523
6.51k
  
list = 6.51k
FN6.51k
(LIST(EL),add)(list, el);
524
6.51k
  return list;
525
6.51k
error:
526
0
  FN(EL,free)(el);
527
6.51k
  return NULL;
528
6.51k
}
isl_val_list_from_val
Line
Count
Source
513
4
{
514
4
  isl_ctx *ctx;
515
4
  LIST(EL) *list;
516
4
517
4
  if (!el)
518
0
    return NULL;
519
4
  
ctx = 4
FN4
(EL,get_ctx)(el);
520
4
  list = FN(LIST(EL),alloc)(ctx, 1);
521
4
  if (!list)
522
0
    goto error;
523
4
  
list = 4
FN4
(LIST(EL),add)(list, el);
524
4
  return list;
525
4
error:
526
0
  FN(EL,free)(el);
527
4
  return NULL;
528
4
}
529
530
/* Append the elements of "list2" to "list1", where "list1" is known
531
 * to have only a single reference and enough room to hold
532
 * the extra elements.
533
 */
534
static __isl_give LIST(EL) *FN(LIST(EL),concat_inplace)(
535
  __isl_take LIST(EL) *list1, __isl_take LIST(EL) *list2)
536
1.96k
{
537
1.96k
  int i;
538
1.96k
539
2.03k
  for (i = 0; 
i < list2->n2.03k
;
++i63
)
540
63
    
list1 = 63
FN63
(LIST(EL),add)(list1,
FN63
(EL,copy)(list2->p[i]));
541
1.96k
  FN(LIST(EL),free)(list2);
542
1.96k
  return list1;
543
1.96k
}
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_aff_list_concat_inplace
Unexecuted instantiation: isl_val.c:isl_val_list_concat_inplace
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_concat_inplace
Unexecuted instantiation: isl_set_list.c:isl_set_list_concat_inplace
isl_set_list.c:isl_basic_set_list_concat_inplace
Line
Count
Source
536
43
{
537
43
  int i;
538
43
539
106
  for (i = 0; 
i < list2->n106
;
++i63
)
540
63
    
list1 = 63
FN63
(LIST(EL),add)(list1,
FN63
(EL,copy)(list2->p[i]));
541
43
  FN(LIST(EL),free)(list2);
542
43
  return list1;
543
43
}
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_concat_inplace
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_concat_inplace
Unexecuted instantiation: isl_map_list.c:isl_map_list_concat_inplace
isl_map_list.c:isl_basic_map_list_concat_inplace
Line
Count
Source
536
39
{
537
39
  int i;
538
39
539
39
  for (i = 0; 
i < list2->n39
;
++i0
)
540
0
    
list1 = 0
FN0
(LIST(EL),add)(list1,
FN0
(EL,copy)(list2->p[i]));
541
39
  FN(LIST(EL),free)(list2);
542
39
  return list1;
543
39
}
Unexecuted instantiation: isl_id.c:isl_id_list_concat_inplace
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_concat_inplace
Unexecuted instantiation: isl_band.c:isl_band_list_concat_inplace
isl_ast_graft.c:isl_ast_graft_list_concat_inplace
Line
Count
Source
536
1.88k
{
537
1.88k
  int i;
538
1.88k
539
1.88k
  for (i = 0; 
i < list2->n1.88k
;
++i0
)
540
0
    
list1 = 0
FN0
(LIST(EL),add)(list1,
FN0
(EL,copy)(list2->p[i]));
541
1.88k
  FN(LIST(EL),free)(list2);
542
1.88k
  return list1;
543
1.88k
}
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_concat_inplace
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_concat_inplace
544
545
/* Concatenate "list1" and "list2".
546
 * If "list1" has only one reference and has enough room
547
 * for the elements of "list2", the add the elements to "list1" itself.
548
 * Otherwise, create a new list to store the result.
549
 */
550
__isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1,
551
  __isl_take LIST(EL) *list2)
552
6.77k
{
553
6.77k
  int i;
554
6.77k
  isl_ctx *ctx;
555
6.77k
  LIST(EL) *res;
556
6.77k
557
6.77k
  if (
!list1 || 6.77k
!list26.77k
)
558
0
    goto error;
559
6.77k
560
6.77k
  
if (6.77k
list1->ref == 1 && 6.77k
list1->n + list2->n <= list1->size6.17k
)
561
1.96k
    
return 1.96k
FN1.96k
(LIST(EL),concat_inplace)(list1, list2);
562
6.77k
563
4.81k
  
ctx = 4.81k
FN4.81k
(LIST(EL),get_ctx)(list1);
564
4.81k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
15.3k
  for (i = 0; 
i < list1->n15.3k
;
++i10.5k
)
566
10.5k
    
res = 10.5k
FN10.5k
(LIST(EL),add)(res,
FN10.5k
(EL,copy)(list1->p[i]));
567
12.0k
  for (i = 0; 
i < list2->n12.0k
;
++i7.22k
)
568
7.22k
    
res = 7.22k
FN7.22k
(LIST(EL),add)(res,
FN7.22k
(EL,copy)(list2->p[i]));
569
4.81k
570
4.81k
  FN(LIST(EL),free)(list1);
571
4.81k
  FN(LIST(EL),free)(list2);
572
6.77k
  return res;
573
6.77k
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
6.77k
  return NULL;
577
6.77k
}
Unexecuted instantiation: isl_aff_list_concat
isl_pw_aff_list_concat
Line
Count
Source
552
137
{
553
137
  int i;
554
137
  isl_ctx *ctx;
555
137
  LIST(EL) *res;
556
137
557
137
  if (
!list1 || 137
!list2137
)
558
0
    goto error;
559
137
560
137
  
if (137
list1->ref == 1 && 137
list1->n + list2->n <= list1->size137
)
561
0
    
return 0
FN0
(LIST(EL),concat_inplace)(list1, list2);
562
137
563
137
  
ctx = 137
FN137
(LIST(EL),get_ctx)(list1);
564
137
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
321
  for (i = 0; 
i < list1->n321
;
++i184
)
566
184
    
res = 184
FN184
(LIST(EL),add)(res,
FN184
(EL,copy)(list1->p[i]));
567
274
  for (i = 0; 
i < list2->n274
;
++i137
)
568
137
    
res = 137
FN137
(LIST(EL),add)(res,
FN137
(EL,copy)(list2->p[i]));
569
137
570
137
  FN(LIST(EL),free)(list1);
571
137
  FN(LIST(EL),free)(list2);
572
137
  return res;
573
137
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
137
  return NULL;
577
137
}
Unexecuted instantiation: isl_union_pw_aff_list_concat
Unexecuted instantiation: isl_union_pw_multi_aff_list_concat
Unexecuted instantiation: isl_ast_expr_list_concat
Unexecuted instantiation: isl_ast_node_list_concat
isl_ast_graft_list_concat
Line
Count
Source
552
4.80k
{
553
4.80k
  int i;
554
4.80k
  isl_ctx *ctx;
555
4.80k
  LIST(EL) *res;
556
4.80k
557
4.80k
  if (
!list1 || 4.80k
!list24.80k
)
558
0
    goto error;
559
4.80k
560
4.80k
  
if (4.80k
list1->ref == 1 && 4.80k
list1->n + list2->n <= list1->size4.80k
)
561
1.88k
    
return 1.88k
FN1.88k
(LIST(EL),concat_inplace)(list1, list2);
562
4.80k
563
2.92k
  
ctx = 2.92k
FN2.92k
(LIST(EL),get_ctx)(list1);
564
2.92k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
3.16k
  for (i = 0; 
i < list1->n3.16k
;
++i239
)
566
239
    
res = 239
FN239
(LIST(EL),add)(res,
FN239
(EL,copy)(list1->p[i]));
567
6.64k
  for (i = 0; 
i < list2->n6.64k
;
++i3.71k
)
568
3.71k
    
res = 3.71k
FN3.71k
(LIST(EL),add)(res,
FN3.71k
(EL,copy)(list2->p[i]));
569
2.92k
570
2.92k
  FN(LIST(EL),free)(list1);
571
2.92k
  FN(LIST(EL),free)(list2);
572
4.80k
  return res;
573
4.80k
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
4.80k
  return NULL;
577
4.80k
}
isl_band_list_concat
Line
Count
Source
552
4
{
553
4
  int i;
554
4
  isl_ctx *ctx;
555
4
  LIST(EL) *res;
556
4
557
4
  if (
!list1 || 4
!list24
)
558
0
    goto error;
559
4
560
4
  
if (4
list1->ref == 1 && 4
list1->n + list2->n <= list1->size4
)
561
0
    
return 0
FN0
(LIST(EL),concat_inplace)(list1, list2);
562
4
563
4
  
ctx = 4
FN4
(LIST(EL),get_ctx)(list1);
564
4
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
6
  for (i = 0; 
i < list1->n6
;
++i2
)
566
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list1->p[i]));
567
8
  for (i = 0; 
i < list2->n8
;
++i4
)
568
4
    
res = 4
FN4
(LIST(EL),add)(res,
FN4
(EL,copy)(list2->p[i]));
569
4
570
4
  FN(LIST(EL),free)(list1);
571
4
  FN(LIST(EL),free)(list2);
572
4
  return res;
573
4
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
4
  return NULL;
577
4
}
Unexecuted instantiation: isl_constraint_list_concat
Unexecuted instantiation: isl_val_list_concat
isl_id_list_concat
Line
Count
Source
552
606
{
553
606
  int i;
554
606
  isl_ctx *ctx;
555
606
  LIST(EL) *res;
556
606
557
606
  if (
!list1 || 606
!list2606
)
558
0
    goto error;
559
606
560
606
  
if (606
list1->ref == 1 && 606
list1->n + list2->n <= list1->size0
)
561
0
    
return 0
FN0
(LIST(EL),concat_inplace)(list1, list2);
562
606
563
606
  
ctx = 606
FN606
(LIST(EL),get_ctx)(list1);
564
606
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
1.11k
  for (i = 0; 
i < list1->n1.11k
;
++i509
)
566
509
    
res = 509
FN509
(LIST(EL),add)(res,
FN509
(EL,copy)(list1->p[i]));
567
1.46k
  for (i = 0; 
i < list2->n1.46k
;
++i854
)
568
854
    
res = 854
FN854
(LIST(EL),add)(res,
FN854
(EL,copy)(list2->p[i]));
569
606
570
606
  FN(LIST(EL),free)(list1);
571
606
  FN(LIST(EL),free)(list2);
572
606
  return res;
573
606
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
606
  return NULL;
577
606
}
isl_basic_map_list_concat
Line
Count
Source
552
1.09k
{
553
1.09k
  int i;
554
1.09k
  isl_ctx *ctx;
555
1.09k
  LIST(EL) *res;
556
1.09k
557
1.09k
  if (
!list1 || 1.09k
!list21.09k
)
558
0
    goto error;
559
1.09k
560
1.09k
  
if (1.09k
list1->ref == 1 && 1.09k
list1->n + list2->n <= list1->size1.09k
)
561
39
    
return 39
FN39
(LIST(EL),concat_inplace)(list1, list2);
562
1.09k
563
1.05k
  
ctx = 1.05k
FN1.05k
(LIST(EL),get_ctx)(list1);
564
1.05k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
10.6k
  for (i = 0; 
i < list1->n10.6k
;
++i9.63k
)
566
9.63k
    
res = 9.63k
FN9.63k
(LIST(EL),add)(res,
FN9.63k
(EL,copy)(list1->p[i]));
567
3.47k
  for (i = 0; 
i < list2->n3.47k
;
++i2.42k
)
568
2.42k
    
res = 2.42k
FN2.42k
(LIST(EL),add)(res,
FN2.42k
(EL,copy)(list2->p[i]));
569
1.05k
570
1.05k
  FN(LIST(EL),free)(list1);
571
1.05k
  FN(LIST(EL),free)(list2);
572
1.09k
  return res;
573
1.09k
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
1.09k
  return NULL;
577
1.09k
}
Unexecuted instantiation: isl_map_list_concat
Unexecuted instantiation: isl_union_map_list_concat
Unexecuted instantiation: isl_schedule_tree_list_concat
isl_basic_set_list_concat
Line
Count
Source
552
134
{
553
134
  int i;
554
134
  isl_ctx *ctx;
555
134
  LIST(EL) *res;
556
134
557
134
  if (
!list1 || 134
!list2134
)
558
0
    goto error;
559
134
560
134
  
if (134
list1->ref == 1 && 134
list1->n + list2->n <= list1->size134
)
561
43
    
return 43
FN43
(LIST(EL),concat_inplace)(list1, list2);
562
134
563
91
  
ctx = 91
FN91
(LIST(EL),get_ctx)(list1);
564
91
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
105
  for (i = 0; 
i < list1->n105
;
++i14
)
566
14
    
res = 14
FN14
(LIST(EL),add)(res,
FN14
(EL,copy)(list1->p[i]));
567
183
  for (i = 0; 
i < list2->n183
;
++i92
)
568
92
    
res = 92
FN92
(LIST(EL),add)(res,
FN92
(EL,copy)(list2->p[i]));
569
91
570
91
  FN(LIST(EL),free)(list1);
571
91
  FN(LIST(EL),free)(list2);
572
134
  return res;
573
134
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
134
  return NULL;
577
134
}
Unexecuted instantiation: isl_set_list_concat
Unexecuted instantiation: isl_union_set_list_concat
578
579
__isl_give isl_printer *CAT(isl_printer_print_,LIST(BASE))(
580
  __isl_take isl_printer *p, __isl_keep LIST(EL) *list)
581
0
{
582
0
  int i;
583
0
584
0
  if (
!p || 0
!list0
)
585
0
    goto error;
586
0
  p = isl_printer_print_str(p, "(");
587
0
  for (i = 0; 
i < list->n0
;
++i0
)
{0
588
0
    if (i)
589
0
      p = isl_printer_print_str(p, ",");
590
0
    p = CAT(isl_printer_print_,BASE)(p, list->p[i]);
591
0
  }
592
0
  p = isl_printer_print_str(p, ")");
593
0
  return p;
594
0
error:
595
0
  isl_printer_free(p);
596
0
  return NULL;
597
0
}
Unexecuted instantiation: isl_printer_print_val_list
Unexecuted instantiation: isl_printer_print_aff_list
Unexecuted instantiation: isl_printer_print_union_set_list
Unexecuted instantiation: isl_printer_print_set_list
Unexecuted instantiation: isl_printer_print_basic_set_list
Unexecuted instantiation: isl_printer_print_schedule_tree_list
Unexecuted instantiation: isl_printer_print_union_map_list
Unexecuted instantiation: isl_printer_print_map_list
Unexecuted instantiation: isl_printer_print_basic_map_list
Unexecuted instantiation: isl_printer_print_id_list
Unexecuted instantiation: isl_printer_print_constraint_list
Unexecuted instantiation: isl_printer_print_band_list
Unexecuted instantiation: isl_printer_print_ast_graft_list
Unexecuted instantiation: isl_printer_print_ast_node_list
Unexecuted instantiation: isl_printer_print_ast_expr_list
Unexecuted instantiation: isl_printer_print_union_pw_multi_aff_list
Unexecuted instantiation: isl_printer_print_union_pw_aff_list
Unexecuted instantiation: isl_printer_print_pw_aff_list
598
599
void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list)
600
0
{
601
0
  isl_printer *printer;
602
0
603
0
  if (!list)
604
0
    return;
605
0
606
0
  
printer = isl_printer_to_file(0
FN0
(LIST(EL),get_ctx)(list), stderr);
607
0
  printer = CAT(isl_printer_print_,LIST(BASE))(printer, list);
608
0
  printer = isl_printer_end_line(printer);
609
0
610
0
  isl_printer_free(printer);
611
0
}
Unexecuted instantiation: isl_union_set_list_dump
Unexecuted instantiation: isl_aff_list_dump
Unexecuted instantiation: isl_pw_aff_list_dump
Unexecuted instantiation: isl_union_pw_aff_list_dump
Unexecuted instantiation: isl_union_pw_multi_aff_list_dump
Unexecuted instantiation: isl_ast_expr_list_dump
Unexecuted instantiation: isl_ast_node_list_dump
Unexecuted instantiation: isl_ast_graft_list_dump
Unexecuted instantiation: isl_band_list_dump
Unexecuted instantiation: isl_val_list_dump
Unexecuted instantiation: isl_id_list_dump
Unexecuted instantiation: isl_basic_map_list_dump
Unexecuted instantiation: isl_map_list_dump
Unexecuted instantiation: isl_union_map_list_dump
Unexecuted instantiation: isl_schedule_tree_list_dump
Unexecuted instantiation: isl_basic_set_list_dump
Unexecuted instantiation: isl_set_list_dump
Unexecuted instantiation: isl_constraint_list_dump