Coverage Report

Created: 2017-10-03 07:32

/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.84k
#define xCAT(A,B) A ## B
20
4.84k
#define CAT(A,B) xCAT(A,B)
21
#undef EL
22
4.84k
#define EL CAT(isl_,BASE)
23
2.83M
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
24
2.83M
#define FN(TYPE,NAME) xFN(TYPE,NAME)
25
565k
#define xLIST(EL) EL ## _list
26
565k
#define LIST(EL) xLIST(EL)
27
3.00k
#define xS(TYPE,NAME) struct TYPE ## _ ## NAME
28
3.00k
#define S(TYPE,NAME) xS(TYPE,NAME)
29
30
isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
31
90.7k
{
32
90.7k
  return list ? list->ctx : NULL;
33
90.7k
}
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
176
{
32
176
  return list ? list->ctx : NULL;
33
176
}
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.15k
{
32
1.15k
  return list ? list->ctx : NULL;
33
1.15k
}
isl_schedule_tree_list_get_ctx
Line
Count
Source
31
62.9k
{
32
62.9k
  return list ? list->ctx : NULL;
33
62.9k
}
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
738
{
32
738
  return list ? list->ctx : NULL;
33
738
}
isl_basic_map_list_get_ctx
Line
Count
Source
31
1.62k
{
32
1.62k
  return list ? list->ctx : NULL;
33
1.62k
}
isl_id_list_get_ctx
Line
Count
Source
31
619
{
32
619
  return list ? list->ctx : NULL;
33
619
}
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
11.6k
{
32
11.6k
  return list ? list->ctx : NULL;
33
11.6k
}
isl_ast_node_list_get_ctx
Line
Count
Source
31
495
{
32
495
  return list ? list->ctx : NULL;
33
495
}
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
10.0k
{
32
10.0k
  return list ? list->ctx : NULL;
33
10.0k
}
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
140k
{
37
140k
  LIST(EL) *list;
38
140k
39
140k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
140k
      "cannot create list of negative length",
42
140k
      return NULL);
43
140k
  
list = 140k
isl_alloc140k
(ctx, LIST(EL),
44
140k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
140k
  if (!list)
46
0
    return NULL;
47
140k
48
140k
  list->ctx = ctx;
49
140k
  isl_ctx_ref(ctx);
50
140k
  list->ref = 1;
51
140k
  list->size = n;
52
140k
  list->n = 0;
53
140k
  return list;
54
140k
}
isl_aff_list_alloc
Line
Count
Source
36
8.67k
{
37
8.67k
  LIST(EL) *list;
38
8.67k
39
8.67k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
8.67k
      "cannot create list of negative length",
42
8.67k
      return NULL);
43
8.67k
  
list = 8.67k
isl_alloc8.67k
(ctx, LIST(EL),
44
8.67k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
8.67k
  if (!list)
46
0
    return NULL;
47
8.67k
48
8.67k
  list->ctx = ctx;
49
8.67k
  isl_ctx_ref(ctx);
50
8.67k
  list->ref = 1;
51
8.67k
  list->size = n;
52
8.67k
  list->n = 0;
53
8.67k
  return list;
54
8.67k
}
isl_pw_aff_list_alloc
Line
Count
Source
36
14.9k
{
37
14.9k
  LIST(EL) *list;
38
14.9k
39
14.9k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
14.9k
      "cannot create list of negative length",
42
14.9k
      return NULL);
43
14.9k
  
list = 14.9k
isl_alloc14.9k
(ctx, LIST(EL),
44
14.9k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
14.9k
  if (!list)
46
0
    return NULL;
47
14.9k
48
14.9k
  list->ctx = ctx;
49
14.9k
  isl_ctx_ref(ctx);
50
14.9k
  list->ref = 1;
51
14.9k
  list->size = n;
52
14.9k
  list->n = 0;
53
14.9k
  return list;
54
14.9k
}
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
4.40k
{
37
4.40k
  LIST(EL) *list;
38
4.40k
39
4.40k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
4.40k
      "cannot create list of negative length",
42
4.40k
      return NULL);
43
4.40k
  
list = 4.40k
isl_alloc4.40k
(ctx, LIST(EL),
44
4.40k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
4.40k
  if (!list)
46
0
    return NULL;
47
4.40k
48
4.40k
  list->ctx = ctx;
49
4.40k
  isl_ctx_ref(ctx);
50
4.40k
  list->ref = 1;
51
4.40k
  list->size = n;
52
4.40k
  list->n = 0;
53
4.40k
  return list;
54
4.40k
}
isl_ast_graft_list_alloc
Line
Count
Source
36
17.5k
{
37
17.5k
  LIST(EL) *list;
38
17.5k
39
17.5k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
17.5k
      "cannot create list of negative length",
42
17.5k
      return NULL);
43
17.5k
  
list = 17.5k
isl_alloc17.5k
(ctx, LIST(EL),
44
17.5k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
17.5k
  if (!list)
46
0
    return NULL;
47
17.5k
48
17.5k
  list->ctx = ctx;
49
17.5k
  isl_ctx_ref(ctx);
50
17.5k
  list->ref = 1;
51
17.5k
  list->size = n;
52
17.5k
  list->n = 0;
53
17.5k
  return list;
54
17.5k
}
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.27k
{
37
2.27k
  LIST(EL) *list;
38
2.27k
39
2.27k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.27k
      "cannot create list of negative length",
42
2.27k
      return NULL);
43
2.27k
  
list = 2.27k
isl_alloc2.27k
(ctx, LIST(EL),
44
2.27k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.27k
  if (!list)
46
0
    return NULL;
47
2.27k
48
2.27k
  list->ctx = ctx;
49
2.27k
  isl_ctx_ref(ctx);
50
2.27k
  list->ref = 1;
51
2.27k
  list->size = n;
52
2.27k
  list->n = 0;
53
2.27k
  return list;
54
2.27k
}
isl_id_list_alloc
Line
Count
Source
36
1.81k
{
37
1.81k
  LIST(EL) *list;
38
1.81k
39
1.81k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
1.81k
      "cannot create list of negative length",
42
1.81k
      return NULL);
43
1.81k
  
list = 1.81k
isl_alloc1.81k
(ctx, LIST(EL),
44
1.81k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
1.81k
  if (!list)
46
0
    return NULL;
47
1.81k
48
1.81k
  list->ctx = ctx;
49
1.81k
  isl_ctx_ref(ctx);
50
1.81k
  list->ref = 1;
51
1.81k
  list->size = n;
52
1.81k
  list->n = 0;
53
1.81k
  return list;
54
1.81k
}
isl_basic_map_list_alloc
Line
Count
Source
36
4.03k
{
37
4.03k
  LIST(EL) *list;
38
4.03k
39
4.03k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
4.03k
      "cannot create list of negative length",
42
4.03k
      return NULL);
43
4.03k
  
list = 4.03k
isl_alloc4.03k
(ctx, LIST(EL),
44
4.03k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
4.03k
  if (!list)
46
0
    return NULL;
47
4.03k
48
4.03k
  list->ctx = ctx;
49
4.03k
  isl_ctx_ref(ctx);
50
4.03k
  list->ref = 1;
51
4.03k
  list->size = n;
52
4.03k
  list->n = 0;
53
4.03k
  return list;
54
4.03k
}
isl_map_list_alloc
Line
Count
Source
36
686
{
37
686
  LIST(EL) *list;
38
686
39
686
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
686
      "cannot create list of negative length",
42
686
      return NULL);
43
686
  
list = 686
isl_alloc686
(ctx, LIST(EL),
44
686
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
686
  if (!list)
46
0
    return NULL;
47
686
48
686
  list->ctx = ctx;
49
686
  isl_ctx_ref(ctx);
50
686
  list->ref = 1;
51
686
  list->size = n;
52
686
  list->n = 0;
53
686
  return list;
54
686
}
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
72.8k
{
37
72.8k
  LIST(EL) *list;
38
72.8k
39
72.8k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
72.8k
      "cannot create list of negative length",
42
72.8k
      return NULL);
43
72.8k
  
list = 72.8k
isl_alloc72.8k
(ctx, LIST(EL),
44
72.8k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
72.8k
  if (!list)
46
0
    return NULL;
47
72.8k
48
72.8k
  list->ctx = ctx;
49
72.8k
  isl_ctx_ref(ctx);
50
72.8k
  list->ref = 1;
51
72.8k
  list->size = n;
52
72.8k
  list->n = 0;
53
72.8k
  return list;
54
72.8k
}
isl_basic_set_list_alloc
Line
Count
Source
36
2.09k
{
37
2.09k
  LIST(EL) *list;
38
2.09k
39
2.09k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.09k
      "cannot create list of negative length",
42
2.09k
      return NULL);
43
2.09k
  
list = 2.09k
isl_alloc2.09k
(ctx, LIST(EL),
44
2.09k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.09k
  if (!list)
46
0
    return NULL;
47
2.09k
48
2.09k
  list->ctx = ctx;
49
2.09k
  isl_ctx_ref(ctx);
50
2.09k
  list->ref = 1;
51
2.09k
  list->size = n;
52
2.09k
  list->n = 0;
53
2.09k
  return list;
54
2.09k
}
isl_set_list_alloc
Line
Count
Source
36
10.9k
{
37
10.9k
  LIST(EL) *list;
38
10.9k
39
10.9k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
10.9k
      "cannot create list of negative length",
42
10.9k
      return NULL);
43
10.9k
  
list = 10.9k
isl_alloc10.9k
(ctx, LIST(EL),
44
10.9k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
10.9k
  if (!list)
46
0
    return NULL;
47
10.9k
48
10.9k
  list->ctx = ctx;
49
10.9k
  isl_ctx_ref(ctx);
50
10.9k
  list->ref = 1;
51
10.9k
  list->size = n;
52
10.9k
  list->n = 0;
53
10.9k
  return list;
54
10.9k
}
isl_union_set_list_alloc
Line
Count
Source
36
415
{
37
415
  LIST(EL) *list;
38
415
39
415
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
415
      "cannot create list of negative length",
42
415
      return NULL);
43
415
  
list = 415
isl_alloc415
(ctx, LIST(EL),
44
415
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
415
  if (!list)
46
0
    return NULL;
47
415
48
415
  list->ctx = ctx;
49
415
  isl_ctx_ref(ctx);
50
415
  list->ref = 1;
51
415
  list->size = n;
52
415
  list->n = 0;
53
415
  return list;
54
415
}
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
103k
{
58
103k
  if (!list)
59
0
    return NULL;
60
103k
61
103k
  list->ref++;
62
103k
  return list;
63
103k
}
Unexecuted instantiation: isl_aff_list_copy
isl_pw_aff_list_copy
Line
Count
Source
57
10.7k
{
58
10.7k
  if (!list)
59
0
    return NULL;
60
10.7k
61
10.7k
  list->ref++;
62
10.7k
  return list;
63
10.7k
}
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
199
{
58
199
  if (!list)
59
0
    return NULL;
60
199
61
199
  list->ref++;
62
199
  return list;
63
199
}
Unexecuted instantiation: isl_ast_graft_list_copy
Unexecuted instantiation: isl_band_list_copy
isl_constraint_list_copy
Line
Count
Source
57
695
{
58
695
  if (!list)
59
0
    return NULL;
60
695
61
695
  list->ref++;
62
695
  return list;
63
695
}
isl_id_list_copy
Line
Count
Source
57
34.4k
{
58
34.4k
  if (!list)
59
0
    return NULL;
60
34.4k
61
34.4k
  list->ref++;
62
34.4k
  return list;
63
34.4k
}
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
57.0k
{
58
57.0k
  if (!list)
59
0
    return NULL;
60
57.0k
61
57.0k
  list->ref++;
62
57.0k
  return list;
63
57.0k
}
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
45.6k
{
67
45.6k
  int i;
68
45.6k
  LIST(EL) *dup;
69
45.6k
70
45.6k
  if (!list)
71
0
    return NULL;
72
45.6k
73
45.6k
  
dup = 45.6k
FN45.6k
(LIST(EL),alloc)(
FN45.6k
(LIST(EL),get_ctx)(list), list->n);
74
45.6k
  if (!dup)
75
0
    return NULL;
76
227k
  
for (i = 0; 45.6k
i < list->n227k
;
++i181k
)
77
181k
    
dup = 181k
FN181k
(LIST(EL),add)(dup,
FN181k
(EL,copy)(list->p[i]));
78
45.6k
  return dup;
79
45.6k
}
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
44.7k
{
67
44.7k
  int i;
68
44.7k
  LIST(EL) *dup;
69
44.7k
70
44.7k
  if (!list)
71
0
    return NULL;
72
44.7k
73
44.7k
  
dup = 44.7k
FN44.7k
(LIST(EL),alloc)(
FN44.7k
(LIST(EL),get_ctx)(list), list->n);
74
44.7k
  if (!dup)
75
0
    return NULL;
76
224k
  
for (i = 0; 44.7k
i < list->n224k
;
++i179k
)
77
179k
    
dup = 179k
FN179k
(LIST(EL),add)(dup,
FN179k
(EL,copy)(list->p[i]));
78
44.7k
  return dup;
79
44.7k
}
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
695
{
67
695
  int i;
68
695
  LIST(EL) *dup;
69
695
70
695
  if (!list)
71
0
    return NULL;
72
695
73
695
  
dup = 695
FN695
(LIST(EL),alloc)(
FN695
(LIST(EL),get_ctx)(list), list->n);
74
695
  if (!dup)
75
0
    return NULL;
76
2.16k
  
for (i = 0; 695
i < list->n2.16k
;
++i1.46k
)
77
1.46k
    
dup = 1.46k
FN1.46k
(LIST(EL),add)(dup,
FN1.46k
(EL,copy)(list->p[i]));
78
695
  return dup;
79
695
}
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
283
{
67
283
  int i;
68
283
  LIST(EL) *dup;
69
283
70
283
  if (!list)
71
0
    return NULL;
72
283
73
283
  
dup = 283
FN283
(LIST(EL),alloc)(
FN283
(LIST(EL),get_ctx)(list), list->n);
74
283
  if (!dup)
75
0
    return NULL;
76
646
  
for (i = 0; 283
i < list->n646
;
++i363
)
77
363
    
dup = 363
FN363
(LIST(EL),add)(dup,
FN363
(EL,copy)(list->p[i]));
78
283
  return dup;
79
283
}
80
81
__isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list)
82
97.5k
{
83
97.5k
  if (!list)
84
0
    return NULL;
85
97.5k
86
97.5k
  
if (97.5k
list->ref == 197.5k
)
87
51.8k
    return list;
88
45.6k
  list->ref--;
89
45.6k
  return FN(LIST(EL),dup)(list);
90
97.5k
}
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
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
2
}
isl_union_set_list_cow
Line
Count
Source
82
899
{
83
899
  if (!list)
84
0
    return NULL;
85
899
86
899
  
if (899
list->ref == 1899
)
87
899
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
899
}
isl_set_list_cow
Line
Count
Source
82
1.85k
{
83
1.85k
  if (!list)
84
0
    return NULL;
85
1.85k
86
1.85k
  
if (1.85k
list->ref == 11.85k
)
87
1.85k
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1.85k
}
isl_basic_set_list_cow
Line
Count
Source
82
3.32k
{
83
3.32k
  if (!list)
84
0
    return NULL;
85
3.32k
86
3.32k
  
if (3.32k
list->ref == 13.32k
)
87
3.32k
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
3.32k
}
isl_schedule_tree_list_cow
Line
Count
Source
82
85.7k
{
83
85.7k
  if (!list)
84
0
    return NULL;
85
85.7k
86
85.7k
  
if (85.7k
list->ref == 185.7k
)
87
41.0k
    return list;
88
44.7k
  list->ref--;
89
44.7k
  return FN(LIST(EL),dup)(list);
90
85.7k
}
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
0
  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
435
{
83
435
  if (!list)
84
0
    return NULL;
85
435
86
435
  
if (435
list->ref == 1435
)
87
435
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
435
}
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
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1
}
isl_constraint_list_cow
Line
Count
Source
82
2.19k
{
83
2.19k
  if (!list)
84
0
    return NULL;
85
2.19k
86
2.19k
  
if (2.19k
list->ref == 12.19k
)
87
1.50k
    return list;
88
695
  list->ref--;
89
695
  return FN(LIST(EL),dup)(list);
90
2.19k
}
Unexecuted instantiation: isl_band_list_cow
isl_ast_graft_list_cow
Line
Count
Source
82
39
{
83
39
  if (!list)
84
0
    return NULL;
85
39
86
39
  
if (39
list->ref == 139
)
87
39
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
39
}
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.08k
{
83
3.08k
  if (!list)
84
0
    return NULL;
85
3.08k
86
3.08k
  
if (3.08k
list->ref == 13.08k
)
87
2.79k
    return list;
88
283
  list->ref--;
89
283
  return FN(LIST(EL),dup)(list);
90
3.08k
}
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
340k
{
100
340k
  isl_ctx *ctx;
101
340k
  int i, new_size;
102
340k
  LIST(EL) *res;
103
340k
104
340k
  if (!list)
105
0
    return NULL;
106
340k
  
if (340k
list->ref == 1 && 340k
list->n + n <= list->size331k
)
107
318k
    return list;
108
340k
109
22.2k
  
ctx = 22.2k
FN22.2k
(LIST(EL),get_ctx)(list);
110
22.2k
  new_size = ((list->n + n + 1) * 3) / 2;
111
22.2k
  if (
list->ref == 122.2k
) {
112
12.6k
    res = isl_realloc(ctx, list, LIST(EL),
113
12.6k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
12.6k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
12.6k
    res->size = new_size;
117
12.6k
    return res;
118
12.6k
  }
119
22.2k
120
9.55k
  
if (9.55k
list->n + n <= list->size && 9.55k
list->size < new_size2.63k
)
121
2.56k
    new_size = list->size;
122
9.55k
123
9.55k
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
9.55k
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
9.55k
127
37.3k
  
for (i = 0; 9.55k
i < list->n37.3k
;
++i27.7k
)
128
27.7k
    
res = 27.7k
FN27.7k
(LIST(EL),add)(res,
FN27.7k
(EL,copy)(list->p[i]));
129
9.55k
130
9.55k
  FN(LIST(EL),free)(list);
131
9.55k
  return res;
132
340k
}
isl_aff.c:isl_aff_list_grow
Line
Count
Source
99
8.68k
{
100
8.68k
  isl_ctx *ctx;
101
8.68k
  int i, new_size;
102
8.68k
  LIST(EL) *res;
103
8.68k
104
8.68k
  if (!list)
105
0
    return NULL;
106
8.68k
  
if (8.68k
list->ref == 1 && 8.68k
list->n + n <= list->size8.68k
)
107
8.66k
    return list;
108
8.68k
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
) {
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
8.68k
}
isl_set_list.c:isl_set_list_grow
Line
Count
Source
99
12.5k
{
100
12.5k
  isl_ctx *ctx;
101
12.5k
  int i, new_size;
102
12.5k
  LIST(EL) *res;
103
12.5k
104
12.5k
  if (!list)
105
0
    return NULL;
106
12.5k
  
if (12.5k
list->ref == 1 && 12.5k
list->n + n <= list->size12.5k
)
107
12.5k
    return list;
108
12.5k
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
) {
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
12.5k
}
isl_set_list.c:isl_basic_set_list_grow
Line
Count
Source
99
2.21k
{
100
2.21k
  isl_ctx *ctx;
101
2.21k
  int i, new_size;
102
2.21k
  LIST(EL) *res;
103
2.21k
104
2.21k
  if (!list)
105
0
    return NULL;
106
2.21k
  
if (2.21k
list->ref == 1 && 2.21k
list->n + n <= list->size2.21k
)
107
2.21k
    return list;
108
2.21k
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
) {
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.21k
}
isl_schedule_tree.c:isl_schedule_tree_list_grow
Line
Count
Source
99
252k
{
100
252k
  isl_ctx *ctx;
101
252k
  int i, new_size;
102
252k
  LIST(EL) *res;
103
252k
104
252k
  if (!list)
105
0
    return NULL;
106
252k
  
if (252k
list->ref == 1 && 252k
list->n + n <= list->size242k
)
107
234k
    return list;
108
252k
109
17.2k
  
ctx = 17.2k
FN17.2k
(LIST(EL),get_ctx)(list);
110
17.2k
  new_size = ((list->n + n + 1) * 3) / 2;
111
17.2k
  if (
list->ref == 117.2k
) {
112
7.71k
    res = isl_realloc(ctx, list, LIST(EL),
113
7.71k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
7.71k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
7.71k
    res->size = new_size;
117
7.71k
    return res;
118
7.71k
  }
119
17.2k
120
9.55k
  
if (9.55k
list->n + n <= list->size && 9.55k
list->size < new_size2.63k
)
121
2.56k
    new_size = list->size;
122
9.55k
123
9.55k
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
9.55k
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
9.55k
127
37.3k
  
for (i = 0; 9.55k
i < list->n37.3k
;
++i27.7k
)
128
27.7k
    
res = 27.7k
FN27.7k
(LIST(EL),add)(res,
FN27.7k
(EL,copy)(list->p[i]));
129
9.55k
130
9.55k
  FN(LIST(EL),free)(list);
131
9.55k
  return res;
132
252k
}
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
) {
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
1.37k
{
100
1.37k
  isl_ctx *ctx;
101
1.37k
  int i, new_size;
102
1.37k
  LIST(EL) *res;
103
1.37k
104
1.37k
  if (!list)
105
0
    return NULL;
106
1.37k
  
if (1.37k
list->ref == 1 && 1.37k
list->n + n <= list->size1.37k
)
107
1.37k
    return list;
108
1.37k
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
) {
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
1.37k
}
isl_map_list.c:isl_basic_map_list_grow
Line
Count
Source
99
16.8k
{
100
16.8k
  isl_ctx *ctx;
101
16.8k
  int i, new_size;
102
16.8k
  LIST(EL) *res;
103
16.8k
104
16.8k
  if (!list)
105
0
    return NULL;
106
16.8k
  
if (16.8k
list->ref == 1 && 16.8k
list->n + n <= list->size16.8k
)
107
16.8k
    return list;
108
16.8k
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
) {
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
16.8k
}
isl_id.c:isl_id_list_grow
Line
Count
Source
99
2.25k
{
100
2.25k
  isl_ctx *ctx;
101
2.25k
  int i, new_size;
102
2.25k
  LIST(EL) *res;
103
2.25k
104
2.25k
  if (!list)
105
0
    return NULL;
106
2.25k
  
if (2.25k
list->ref == 1 && 2.25k
list->n + n <= list->size2.25k
)
107
2.25k
    return list;
108
2.25k
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
) {
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.25k
}
isl_constraint.c:isl_constraint_list_grow
Line
Count
Source
99
3.53k
{
100
3.53k
  isl_ctx *ctx;
101
3.53k
  int i, new_size;
102
3.53k
  LIST(EL) *res;
103
3.53k
104
3.53k
  if (!list)
105
0
    return NULL;
106
3.53k
  
if (3.53k
list->ref == 1 && 3.53k
list->n + n <= list->size3.53k
)
107
3.53k
    return list;
108
3.53k
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
) {
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.53k
}
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
) {
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
) {
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
16.3k
{
100
16.3k
  isl_ctx *ctx;
101
16.3k
  int i, new_size;
102
16.3k
  LIST(EL) *res;
103
16.3k
104
16.3k
  if (!list)
105
0
    return NULL;
106
16.3k
  
if (16.3k
list->ref == 1 && 16.3k
list->n + n <= list->size16.3k
)
107
16.3k
    return list;
108
16.3k
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
) {
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
16.3k
}
isl_ast.c:isl_ast_node_list_grow
Line
Count
Source
99
6.02k
{
100
6.02k
  isl_ctx *ctx;
101
6.02k
  int i, new_size;
102
6.02k
  LIST(EL) *res;
103
6.02k
104
6.02k
  if (!list)
105
0
    return NULL;
106
6.02k
  
if (6.02k
list->ref == 1 && 6.02k
list->n + n <= list->size6.02k
)
107
5.95k
    return list;
108
6.02k
109
71
  
ctx = 71
FN71
(LIST(EL),get_ctx)(list);
110
71
  new_size = ((list->n + n + 1) * 3) / 2;
111
71
  if (
list->ref == 171
) {
112
71
    res = isl_realloc(ctx, list, LIST(EL),
113
71
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
71
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
71
    res->size = new_size;
117
71
    return res;
118
71
  }
119
71
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
6.02k
}
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
) {
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
) {
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.3k
{
100
17.3k
  isl_ctx *ctx;
101
17.3k
  int i, new_size;
102
17.3k
  LIST(EL) *res;
103
17.3k
104
17.3k
  if (!list)
105
0
    return NULL;
106
17.3k
  
if (17.3k
list->ref == 1 && 17.3k
list->n + n <= list->size17.3k
)
107
12.7k
    return list;
108
17.3k
109
4.62k
  
ctx = 4.62k
FN4.62k
(LIST(EL),get_ctx)(list);
110
4.62k
  new_size = ((list->n + n + 1) * 3) / 2;
111
4.62k
  if (
list->ref == 14.62k
) {
112
4.62k
    res = isl_realloc(ctx, list, LIST(EL),
113
4.62k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
4.62k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
4.62k
    res->size = new_size;
117
4.62k
    return res;
118
4.62k
  }
119
4.62k
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.3k
}
isl_set_list.c:isl_union_set_list_grow
Line
Count
Source
99
1.40k
{
100
1.40k
  isl_ctx *ctx;
101
1.40k
  int i, new_size;
102
1.40k
  LIST(EL) *res;
103
1.40k
104
1.40k
  if (!list)
105
0
    return NULL;
106
1.40k
  
if (1.40k
list->ref == 1 && 1.40k
list->n + n <= list->size1.40k
)
107
1.22k
    return list;
108
1.40k
109
176
  
ctx = 176
FN176
(LIST(EL),get_ctx)(list);
110
176
  new_size = ((list->n + n + 1) * 3) / 2;
111
176
  if (
list->ref == 1176
) {
112
176
    res = isl_realloc(ctx, list, LIST(EL),
113
176
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
176
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
176
    res->size = new_size;
117
176
    return res;
118
176
  }
119
176
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.40k
}
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
649k
{
138
649k
  if (!list)
139
0
    return isl_stat_error;
140
649k
  
if (649k
index < 0 || 649k
index >= list->n649k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
649k
      "index out of bounds", return isl_stat_error);
143
649k
  return isl_stat_ok;
144
649k
}
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.12k
{
138
2.12k
  if (!list)
139
0
    return isl_stat_error;
140
2.12k
  
if (2.12k
index < 0 || 2.12k
index >= list->n2.12k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
2.12k
      "index out of bounds", return isl_stat_error);
143
2.12k
  return isl_stat_ok;
144
2.12k
}
isl_set_list.c:isl_set_list_check_index
Line
Count
Source
137
18.4k
{
138
18.4k
  if (!list)
139
0
    return isl_stat_error;
140
18.4k
  
if (18.4k
index < 0 || 18.4k
index >= list->n18.4k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
18.4k
      "index out of bounds", return isl_stat_error);
143
18.4k
  return isl_stat_ok;
144
18.4k
}
isl_set_list.c:isl_basic_set_list_check_index
Line
Count
Source
137
11.8k
{
138
11.8k
  if (!list)
139
0
    return isl_stat_error;
140
11.8k
  
if (11.8k
index < 0 || 11.8k
index >= list->n11.8k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
11.8k
      "index out of bounds", return isl_stat_error);
143
11.8k
  return isl_stat_ok;
144
11.8k
}
isl_schedule_tree.c:isl_schedule_tree_list_check_index
Line
Count
Source
137
509k
{
138
509k
  if (!list)
139
0
    return isl_stat_error;
140
509k
  
if (509k
index < 0 || 509k
index >= list->n509k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
509k
      "index out of bounds", return isl_stat_error);
143
509k
  return isl_stat_ok;
144
509k
}
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.67k
{
138
1.67k
  if (!list)
139
0
    return isl_stat_error;
140
1.67k
  
if (1.67k
index < 0 || 1.67k
index >= list->n1.67k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
1.67k
      "index out of bounds", return isl_stat_error);
143
1.67k
  return isl_stat_ok;
144
1.67k
}
isl_map_list.c:isl_basic_map_list_check_index
Line
Count
Source
137
13.7k
{
138
13.7k
  if (!list)
139
0
    return isl_stat_error;
140
13.7k
  
if (13.7k
index < 0 || 13.7k
index >= list->n13.7k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
13.7k
      "index out of bounds", return isl_stat_error);
143
13.7k
  return isl_stat_ok;
144
13.7k
}
isl_id.c:isl_id_list_check_index
Line
Count
Source
137
23.0k
{
138
23.0k
  if (!list)
139
0
    return isl_stat_error;
140
23.0k
  
if (23.0k
index < 0 || 23.0k
index >= list->n23.0k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
23.0k
      "index out of bounds", return isl_stat_error);
143
23.0k
  return isl_stat_ok;
144
23.0k
}
isl_constraint.c:isl_constraint_list_check_index
Line
Count
Source
137
2.01k
{
138
2.01k
  if (!list)
139
0
    return isl_stat_error;
140
2.01k
  
if (2.01k
index < 0 || 2.01k
index >= list->n2.01k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
2.01k
      "index out of bounds", return isl_stat_error);
143
2.01k
  return isl_stat_ok;
144
2.01k
}
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
39.7k
{
138
39.7k
  if (!list)
139
0
    return isl_stat_error;
140
39.7k
  
if (39.7k
index < 0 || 39.7k
index >= list->n39.7k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
39.7k
      "index out of bounds", return isl_stat_error);
143
39.7k
  return isl_stat_ok;
144
39.7k
}
isl_ast.c:isl_ast_node_list_check_index
Line
Count
Source
137
4.33k
{
138
4.33k
  if (!list)
139
0
    return isl_stat_error;
140
4.33k
  
if (4.33k
index < 0 || 4.33k
index >= list->n4.33k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
4.33k
      "index out of bounds", return isl_stat_error);
143
4.33k
  return isl_stat_ok;
144
4.33k
}
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.7k
{
138
14.7k
  if (!list)
139
0
    return isl_stat_error;
140
14.7k
  
if (14.7k
index < 0 || 14.7k
index >= list->n14.7k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
14.7k
      "index out of bounds", return isl_stat_error);
143
14.7k
  return isl_stat_ok;
144
14.7k
}
isl_aff.c:isl_aff_list_check_index
Line
Count
Source
137
8.89k
{
138
8.89k
  if (!list)
139
0
    return isl_stat_error;
140
8.89k
  
if (8.89k
index < 0 || 8.89k
index >= list->n8.89k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
8.89k
      "index out of bounds", return isl_stat_error);
143
8.89k
  return isl_stat_ok;
144
8.89k
}
145
146
__isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
147
  __isl_take struct EL *el)
148
340k
{
149
340k
  list = FN(LIST(EL),grow)(list, 1);
150
340k
  if (
!list || 340k
!el340k
)
151
0
    goto error;
152
340k
  list->p[list->n] = el;
153
340k
  list->n++;
154
340k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
340k
}
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
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
21
}
isl_union_set_list_add
Line
Count
Source
148
1.40k
{
149
1.40k
  list = FN(LIST(EL),grow)(list, 1);
150
1.40k
  if (
!list || 1.40k
!el1.40k
)
151
0
    goto error;
152
1.40k
  list->p[list->n] = el;
153
1.40k
  list->n++;
154
1.40k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
1.40k
}
isl_set_list_add
Line
Count
Source
148
12.5k
{
149
12.5k
  list = FN(LIST(EL),grow)(list, 1);
150
12.5k
  if (
!list || 12.5k
!el12.5k
)
151
0
    goto error;
152
12.5k
  list->p[list->n] = el;
153
12.5k
  list->n++;
154
12.5k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
12.5k
}
isl_basic_set_list_add
Line
Count
Source
148
2.21k
{
149
2.21k
  list = FN(LIST(EL),grow)(list, 1);
150
2.21k
  if (
!list || 2.21k
!el2.21k
)
151
0
    goto error;
152
2.21k
  list->p[list->n] = el;
153
2.21k
  list->n++;
154
2.21k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
2.21k
}
isl_schedule_tree_list_add
Line
Count
Source
148
252k
{
149
252k
  list = FN(LIST(EL),grow)(list, 1);
150
252k
  if (
!list || 252k
!el252k
)
151
0
    goto error;
152
252k
  list->p[list->n] = el;
153
252k
  list->n++;
154
252k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
252k
}
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
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
5
}
isl_map_list_add
Line
Count
Source
148
1.37k
{
149
1.37k
  list = FN(LIST(EL),grow)(list, 1);
150
1.37k
  if (
!list || 1.37k
!el1.37k
)
151
0
    goto error;
152
1.37k
  list->p[list->n] = el;
153
1.37k
  list->n++;
154
1.37k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
1.37k
}
isl_basic_map_list_add
Line
Count
Source
148
16.8k
{
149
16.8k
  list = FN(LIST(EL),grow)(list, 1);
150
16.8k
  if (
!list || 16.8k
!el16.8k
)
151
0
    goto error;
152
16.8k
  list->p[list->n] = el;
153
16.8k
  list->n++;
154
16.8k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
16.8k
}
isl_id_list_add
Line
Count
Source
148
2.25k
{
149
2.25k
  list = FN(LIST(EL),grow)(list, 1);
150
2.25k
  if (
!list || 2.25k
!el2.25k
)
151
0
    goto error;
152
2.25k
  list->p[list->n] = el;
153
2.25k
  list->n++;
154
2.25k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
2.25k
}
isl_constraint_list_add
Line
Count
Source
148
3.53k
{
149
3.53k
  list = FN(LIST(EL),grow)(list, 1);
150
3.53k
  if (
!list || 3.53k
!el3.53k
)
151
0
    goto error;
152
3.53k
  list->p[list->n] = el;
153
3.53k
  list->n++;
154
3.53k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
3.53k
}
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
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
18
}
isl_ast_graft_list_add
Line
Count
Source
148
16.3k
{
149
16.3k
  list = FN(LIST(EL),grow)(list, 1);
150
16.3k
  if (
!list || 16.3k
!el16.3k
)
151
0
    goto error;
152
16.3k
  list->p[list->n] = el;
153
16.3k
  list->n++;
154
16.3k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
16.3k
}
isl_ast_node_list_add
Line
Count
Source
148
6.02k
{
149
6.02k
  list = FN(LIST(EL),grow)(list, 1);
150
6.02k
  if (
!list || 6.02k
!el6.02k
)
151
0
    goto error;
152
6.02k
  list->p[list->n] = el;
153
6.02k
  list->n++;
154
6.02k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
6.02k
}
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
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  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
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
27
}
isl_pw_aff_list_add
Line
Count
Source
148
17.3k
{
149
17.3k
  list = FN(LIST(EL),grow)(list, 1);
150
17.3k
  if (
!list || 17.3k
!el17.3k
)
151
0
    goto error;
152
17.3k
  list->p[list->n] = el;
153
17.3k
  list->n++;
154
17.3k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
17.3k
}
isl_aff_list_add
Line
Count
Source
148
8.68k
{
149
8.68k
  list = FN(LIST(EL),grow)(list, 1);
150
8.68k
  if (
!list || 8.68k
!el8.68k
)
151
0
    goto error;
152
8.68k
  list->p[list->n] = el;
153
8.68k
  list->n++;
154
8.68k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
8.68k
}
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
66.7k
{
166
66.7k
  int i;
167
66.7k
168
66.7k
  if (!list)
169
0
    return NULL;
170
66.7k
  
if (66.7k
first + n > list->n || 66.7k
first + n < first66.7k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
66.7k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
66.7k
  
if (66.7k
n == 066.7k
)
174
647
    return list;
175
66.1k
  
list = 66.1k
FN66.1k
(LIST(EL),cow)(list);
176
66.1k
  if (!list)
177
0
    return NULL;
178
195k
  
for (i = 0; 66.1k
i < n195k
;
++i129k
)
179
129k
    
FN129k
(EL,free)(list->p[first + i])129k
;
180
68.5k
  for (i = first; 
i + n < list->n68.5k
;
++i2.42k
)
181
2.42k
    list->p[i] = list->p[i + n];
182
66.1k
  list->n -= n;
183
66.1k
  return list;
184
66.7k
}
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.08k
{
166
2.08k
  int i;
167
2.08k
168
2.08k
  if (!list)
169
0
    return NULL;
170
2.08k
  
if (2.08k
first + n > list->n || 2.08k
first + n < first2.08k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
2.08k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
2.08k
  
if (2.08k
n == 02.08k
)
174
647
    return list;
175
1.43k
  
list = 1.43k
FN1.43k
(LIST(EL),cow)(list);
176
1.43k
  if (!list)
177
0
    return NULL;
178
2.96k
  
for (i = 0; 1.43k
i < n2.96k
;
++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.43k
  list->n -= n;
183
1.43k
  return list;
184
2.08k
}
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
63.8k
{
166
63.8k
  int i;
167
63.8k
168
63.8k
  if (!list)
169
0
    return NULL;
170
63.8k
  
if (63.8k
first + n > list->n || 63.8k
first + n < first63.8k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
63.8k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
63.8k
  
if (63.8k
n == 063.8k
)
174
0
    return list;
175
63.8k
  
list = 63.8k
FN63.8k
(LIST(EL),cow)(list);
176
63.8k
  if (!list)
177
0
    return NULL;
178
190k
  
for (i = 0; 63.8k
i < n190k
;
++i126k
)
179
126k
    
FN126k
(EL,free)(list->p[first + i])126k
;
180
65.3k
  for (i = first; 
i + n < list->n65.3k
;
++i1.56k
)
181
1.56k
    list->p[i] = list->p[i + n];
182
63.8k
  list->n -= n;
183
63.8k
  return list;
184
63.8k
}
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
899
{
166
899
  int i;
167
899
168
899
  if (!list)
169
0
    return NULL;
170
899
  
if (899
first + n > list->n || 899
first + n < first899
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
899
      "index out of bounds", return FN(LIST(EL),free)(list));
173
899
  
if (899
n == 0899
)
174
0
    return list;
175
899
  
list = 899
FN899
(LIST(EL),cow)(list);
176
899
  if (!list)
177
0
    return NULL;
178
1.79k
  
for (i = 0; 899
i < n1.79k
;
++i899
)
179
899
    
FN899
(EL,free)(list->p[first + i])899
;
180
899
  for (i = first; 
i + n < list->n899
;
++i0
)
181
0
    list->p[i] = list->p[i + n];
182
899
  list->n -= n;
183
899
  return list;
184
899
}
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
27
{
196
27
  int i;
197
27
  isl_ctx *ctx;
198
27
  LIST(EL) *res;
199
27
200
27
  if (
!list || 27
!el27
)
201
0
    goto error;
202
27
  
ctx = 27
FN27
(LIST(EL),get_ctx)(list);
203
27
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
27
      "index out of bounds", goto error);
206
27
207
27
  
if (27
list->ref == 1 && 27
list->size > list->n24
) {
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
1
  }
214
27
215
26
  
res = 26
FN26
(LIST(EL),alloc)(ctx, list->n + 1);
216
59
  for (i = 0; 
i < pos59
;
++i33
)
217
33
    
res = 33
FN33
(LIST(EL),add)(res,
FN33
(EL,copy)(list->p[i]));
218
26
  res = FN(LIST(EL),add)(res, el);
219
28
  for (i = pos; 
i < list->n28
;
++i2
)
220
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list->p[i]));
221
26
  FN(LIST(EL),free)(list);
222
26
223
26
  return res;
224
0
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
0
  return NULL;
228
27
}
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
) {
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
1
  }
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
3
  return res;
224
0
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
0
  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
23
{
196
23
  int i;
197
23
  isl_ctx *ctx;
198
23
  LIST(EL) *res;
199
23
200
23
  if (
!list || 23
!el23
)
201
0
    goto error;
202
23
  
ctx = 23
FN23
(LIST(EL),get_ctx)(list);
203
23
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
23
      "index out of bounds", goto error);
206
23
207
23
  
if (23
list->ref == 1 && 23
list->size > list->n23
) {
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
0
  }
214
23
215
23
  
res = 23
FN23
(LIST(EL),alloc)(ctx, list->n + 1);
216
53
  for (i = 0; 
i < pos53
;
++i30
)
217
30
    
res = 30
FN30
(LIST(EL),add)(res,
FN30
(EL,copy)(list->p[i]));
218
23
  res = FN(LIST(EL),add)(res, el);
219
25
  for (i = pos; 
i < list->n25
;
++i2
)
220
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list->p[i]));
221
23
  FN(LIST(EL),free)(list);
222
23
223
23
  return res;
224
0
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
0
  return NULL;
228
23
}
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
237k
{
232
237k
  int i;
233
237k
234
237k
  if (!list)
235
39.1k
    return NULL;
236
237k
237
198k
  
if (198k
--list->ref > 0198k
)
238
57.4k
    return NULL;
239
198k
240
140k
  isl_ctx_deref(list->ctx);
241
352k
  for (i = 0; 
i < list->n352k
;
++i211k
)
242
211k
    
FN211k
(EL,free)(list->p[i])211k
;
243
140k
  free(list);
244
140k
245
140k
  return NULL;
246
237k
}
isl_union_set_list_free
Line
Count
Source
231
415
{
232
415
  int i;
233
415
234
415
  if (!list)
235
0
    return NULL;
236
415
237
415
  
if (415
--list->ref > 0415
)
238
0
    return NULL;
239
415
240
415
  isl_ctx_deref(list->ctx);
241
921
  for (i = 0; 
i < list->n921
;
++i506
)
242
506
    
FN506
(EL,free)(list->p[i])506
;
243
415
  free(list);
244
415
245
415
  return NULL;
246
415
}
isl_aff_list_free
Line
Count
Source
231
16.5k
{
232
16.5k
  int i;
233
16.5k
234
16.5k
  if (!list)
235
7.90k
    return NULL;
236
16.5k
237
8.67k
  
if (8.67k
--list->ref > 08.67k
)
238
0
    return NULL;
239
8.67k
240
8.67k
  isl_ctx_deref(list->ctx);
241
17.3k
  for (i = 0; 
i < list->n17.3k
;
++i8.68k
)
242
8.68k
    
FN8.68k
(EL,free)(list->p[i])8.68k
;
243
8.67k
  free(list);
244
8.67k
245
8.67k
  return NULL;
246
16.5k
}
isl_pw_aff_list_free
Line
Count
Source
231
25.4k
{
232
25.4k
  int i;
233
25.4k
234
25.4k
  if (!list)
235
3
    return NULL;
236
25.4k
237
25.4k
  
if (25.4k
--list->ref > 025.4k
)
238
10.4k
    return NULL;
239
25.4k
240
14.9k
  isl_ctx_deref(list->ctx);
241
32.3k
  for (i = 0; 
i < list->n32.3k
;
++i17.3k
)
242
17.3k
    
FN17.3k
(EL,free)(list->p[i])17.3k
;
243
14.9k
  free(list);
244
14.9k
245
14.9k
  return NULL;
246
25.4k
}
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
4.60k
{
232
4.60k
  int i;
233
4.60k
234
4.60k
  if (!list)
235
0
    return NULL;
236
4.60k
237
4.60k
  
if (4.60k
--list->ref > 04.60k
)
238
199
    return NULL;
239
4.60k
240
4.40k
  isl_ctx_deref(list->ctx);
241
10.4k
  for (i = 0; 
i < list->n10.4k
;
++i6.02k
)
242
6.02k
    
FN6.02k
(EL,free)(list->p[i])6.02k
;
243
4.40k
  free(list);
244
4.40k
245
4.40k
  return NULL;
246
4.60k
}
isl_ast_graft_list_free
Line
Count
Source
231
17.5k
{
232
17.5k
  int i;
233
17.5k
234
17.5k
  if (!list)
235
0
    return NULL;
236
17.5k
237
17.5k
  
if (17.5k
--list->ref > 017.5k
)
238
0
    return NULL;
239
17.5k
240
17.5k
  isl_ctx_deref(list->ctx);
241
33.8k
  for (i = 0; 
i < list->n33.8k
;
++i16.3k
)
242
16.3k
    
FN16.3k
(EL,free)(list->p[i])16.3k
;
243
17.5k
  free(list);
244
17.5k
245
17.5k
  return NULL;
246
17.5k
}
isl_band_list_free
Line
Count
Source
231
6.40k
{
232
6.40k
  int i;
233
6.40k
234
6.40k
  if (!list)
235
6.38k
    return NULL;
236
6.40k
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.40k
}
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
36.2k
{
232
36.2k
  int i;
233
36.2k
234
36.2k
  if (!list)
235
0
    return NULL;
236
36.2k
237
36.2k
  
if (36.2k
--list->ref > 036.2k
)
238
34.4k
    return NULL;
239
36.2k
240
1.81k
  isl_ctx_deref(list->ctx);
241
4.06k
  for (i = 0; 
i < list->n4.06k
;
++i2.25k
)
242
2.25k
    
FN2.25k
(EL,free)(list->p[i])2.25k
;
243
1.81k
  free(list);
244
1.81k
245
1.81k
  return NULL;
246
36.2k
}
isl_basic_map_list_free
Line
Count
Source
231
3.29k
{
232
3.29k
  int i;
233
3.29k
234
3.29k
  if (!list)
235
0
    return NULL;
236
3.29k
237
3.29k
  
if (3.29k
--list->ref > 03.29k
)
238
0
    return NULL;
239
3.29k
240
3.29k
  isl_ctx_deref(list->ctx);
241
16.9k
  for (i = 0; 
i < list->n16.9k
;
++i13.6k
)
242
13.6k
    
FN13.6k
(EL,free)(list->p[i])13.6k
;
243
3.29k
  free(list);
244
3.29k
245
3.29k
  return NULL;
246
3.29k
}
isl_map_list_free
Line
Count
Source
231
749
{
232
749
  int i;
233
749
234
749
  if (!list)
235
0
    return NULL;
236
749
237
749
  
if (749
--list->ref > 0749
)
238
0
    return NULL;
239
749
240
749
  isl_ctx_deref(list->ctx);
241
2.45k
  for (i = 0; 
i < list->n2.45k
;
++i1.70k
)
242
1.70k
    
FN1.70k
(EL,free)(list->p[i])1.70k
;
243
749
  free(list);
244
749
245
749
  return NULL;
246
749
}
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
102k
{
232
102k
  int i;
233
102k
234
102k
  if (!list)
235
16.9k
    return NULL;
236
102k
237
85.1k
  
if (85.1k
--list->ref > 085.1k
)
238
12.3k
    return NULL;
239
85.1k
240
72.8k
  isl_ctx_deref(list->ctx);
241
198k
  for (i = 0; 
i < list->n198k
;
++i125k
)
242
125k
    
FN125k
(EL,free)(list->p[i])125k
;
243
72.8k
  free(list);
244
72.8k
245
72.8k
  return NULL;
246
102k
}
isl_basic_set_list_free
Line
Count
Source
231
2.84k
{
232
2.84k
  int i;
233
2.84k
234
2.84k
  if (!list)
235
0
    return NULL;
236
2.84k
237
2.84k
  
if (2.84k
--list->ref > 02.84k
)
238
13
    return NULL;
239
2.84k
240
2.83k
  isl_ctx_deref(list->ctx);
241
8.29k
  for (i = 0; 
i < list->n8.29k
;
++i5.46k
)
242
5.46k
    
FN5.46k
(EL,free)(list->p[i])5.46k
;
243
2.83k
  free(list);
244
2.83k
245
2.83k
  return NULL;
246
2.84k
}
isl_set_list_free
Line
Count
Source
231
18.8k
{
232
18.8k
  int i;
233
18.8k
234
18.8k
  if (!list)
235
7.90k
    return NULL;
236
18.8k
237
10.9k
  
if (10.9k
--list->ref > 010.9k
)
238
0
    return NULL;
239
10.9k
240
10.9k
  isl_ctx_deref(list->ctx);
241
23.1k
  for (i = 0; 
i < list->n23.1k
;
++i12.2k
)
242
12.2k
    
FN12.2k
(EL,free)(list->p[i])12.2k
;
243
10.9k
  free(list);
244
10.9k
245
10.9k
  return NULL;
246
18.8k
}
isl_constraint_list_free
Line
Count
Source
231
2.27k
{
232
2.27k
  int i;
233
2.27k
234
2.27k
  if (!list)
235
0
    return NULL;
236
2.27k
237
2.27k
  
if (2.27k
--list->ref > 02.27k
)
238
0
    return NULL;
239
2.27k
240
2.27k
  isl_ctx_deref(list->ctx);
241
4.29k
  for (i = 0; 
i < list->n4.29k
;
++i2.01k
)
242
2.01k
    
FN2.01k
(EL,free)(list->p[i])2.01k
;
243
2.27k
  free(list);
244
2.27k
245
2.27k
  return NULL;
246
2.27k
}
247
248
int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
249
904k
{
250
904k
  return list ? 
list->n890k
:
014.0k
;
251
904k
}
isl_aff_list_n_aff
Line
Count
Source
249
975
{
250
975
  return list ? 
list->n975
:
00
;
251
975
}
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
2.03k
{
250
2.03k
  return list ? 
list->n2.03k
:
00
;
251
2.03k
}
isl_set_list_n_set
Line
Count
Source
249
7.93k
{
250
7.93k
  return list ? 
list->n7.93k
:
00
;
251
7.93k
}
isl_basic_set_list_n_basic_set
Line
Count
Source
249
4.28k
{
250
4.28k
  return list ? 
list->n4.28k
:
00
;
251
4.28k
}
isl_schedule_tree_list_n_schedule_tree
Line
Count
Source
249
834k
{
250
834k
  return list ? 
list->n820k
:
014.0k
;
251
834k
}
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
738
{
250
738
  return list ? 
list->n738
:
00
;
251
738
}
isl_basic_map_list_n_basic_map
Line
Count
Source
249
2.95k
{
250
2.95k
  return list ? 
list->n2.95k
:
00
;
251
2.95k
}
isl_id_list_n_id
Line
Count
Source
249
1.06k
{
250
1.06k
  return list ? 
list->n1.06k
:
00
;
251
1.06k
}
isl_constraint_list_n_constraint
Line
Count
Source
249
3.66k
{
250
3.66k
  return list ? 
list->n3.66k
:
00
;
251
3.66k
}
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
26.9k
{
250
26.9k
  return list ? 
list->n26.9k
:
00
;
251
26.9k
}
isl_ast_node_list_n_ast_node
Line
Count
Source
249
4.73k
{
250
4.73k
  return list ? 
list->n4.73k
:
00
;
251
4.73k
}
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
15.2k
{
250
15.2k
  return list ? 
list->n15.2k
:
00
;
251
15.2k
}
252
253
__isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
254
608k
{
255
608k
  if (
FN608k
(LIST(EL),check_index)(list, index) < 0608k
)
256
0
    return NULL;
257
608k
  
return 608k
FN608k
(EL,copy)(list->p[index]);
258
608k
}
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.7k
{
255
11.7k
  if (
FN11.7k
(LIST(EL),check_index)(list, index) < 011.7k
)
256
0
    return NULL;
257
11.7k
  
return 11.7k
FN11.7k
(EL,copy)(list->p[index]);
258
11.7k
}
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
4.33k
{
255
4.33k
  if (
FN4.33k
(LIST(EL),check_index)(list, index) < 04.33k
)
256
0
    return NULL;
257
4.33k
  
return 4.33k
FN4.33k
(EL,copy)(list->p[index]);
258
4.33k
}
isl_ast_graft_list_get_ast_graft
Line
Count
Source
254
33.2k
{
255
33.2k
  if (
FN33.2k
(LIST(EL),check_index)(list, index) < 033.2k
)
256
0
    return NULL;
257
33.2k
  
return 33.2k
FN33.2k
(EL,copy)(list->p[index]);
258
33.2k
}
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
2.01k
{
255
2.01k
  if (
FN2.01k
(LIST(EL),check_index)(list, index) < 02.01k
)
256
0
    return NULL;
257
2.01k
  
return 2.01k
FN2.01k
(EL,copy)(list->p[index]);
258
2.01k
}
isl_id_list_get_id
Line
Count
Source
254
23.0k
{
255
23.0k
  if (
FN23.0k
(LIST(EL),check_index)(list, index) < 023.0k
)
256
0
    return NULL;
257
23.0k
  
return 23.0k
FN23.0k
(EL,copy)(list->p[index]);
258
23.0k
}
isl_basic_map_list_get_basic_map
Line
Count
Source
254
10.4k
{
255
10.4k
  if (
FN10.4k
(LIST(EL),check_index)(list, index) < 010.4k
)
256
0
    return NULL;
257
10.4k
  
return 10.4k
FN10.4k
(EL,copy)(list->p[index]);
258
10.4k
}
isl_map_list_get_map
Line
Count
Source
254
1.67k
{
255
1.67k
  if (
FN1.67k
(LIST(EL),check_index)(list, index) < 01.67k
)
256
0
    return NULL;
257
1.67k
  
return 1.67k
FN1.67k
(EL,copy)(list->p[index]);
258
1.67k
}
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
487k
{
255
487k
  if (
FN487k
(LIST(EL),check_index)(list, index) < 0487k
)
256
0
    return NULL;
257
487k
  
return 487k
FN487k
(EL,copy)(list->p[index]);
258
487k
}
isl_basic_set_list_get_basic_set
Line
Count
Source
254
8.42k
{
255
8.42k
  if (
FN8.42k
(LIST(EL),check_index)(list, index) < 08.42k
)
256
0
    return NULL;
257
8.42k
  
return 8.42k
FN8.42k
(EL,copy)(list->p[index]);
258
8.42k
}
isl_set_list_get_set
Line
Count
Source
254
15.3k
{
255
15.3k
  if (
FN15.3k
(LIST(EL),check_index)(list, index) < 015.3k
)
256
0
    return NULL;
257
15.3k
  
return 15.3k
FN15.3k
(EL,copy)(list->p[index]);
258
15.3k
}
isl_union_set_list_get_union_set
Line
Count
Source
254
2.12k
{
255
2.12k
  if (
FN2.12k
(LIST(EL),check_index)(list, index) < 02.12k
)
256
0
    return NULL;
257
2.12k
  
return 2.12k
FN2.12k
(EL,copy)(list->p[index]);
258
2.12k
}
isl_aff_list_get_aff
Line
Count
Source
254
8.89k
{
255
8.89k
  if (
FN8.89k
(LIST(EL),check_index)(list, index) < 08.89k
)
256
0
    return NULL;
257
8.89k
  
return 8.89k
FN8.89k
(EL,copy)(list->p[index]);
258
8.89k
}
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
41.1k
{
265
41.1k
  if (
!list || 41.1k
!el41.1k
)
266
0
    goto error;
267
41.1k
  
if (41.1k
FN41.1k
(LIST(EL),check_index)(list, index) < 041.1k
)
268
0
    goto error;
269
41.1k
  
if (41.1k
list->p[index] == el41.1k
) {
270
10.5k
    FN(EL,free)(el);
271
10.5k
    return list;
272
10.5k
  }
273
30.5k
  
list = 30.5k
FN30.5k
(LIST(EL),cow)(list);
274
30.5k
  if (!list)
275
0
    goto error;
276
30.5k
  
FN30.5k
(EL,free)(list->p[index]);
277
30.5k
  list->p[index] = el;
278
30.5k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
41.1k
}
isl_pw_aff_list_set_pw_aff
Line
Count
Source
264
3.01k
{
265
3.01k
  if (
!list || 3.01k
!el3.01k
)
266
0
    goto error;
267
3.01k
  
if (3.01k
FN3.01k
(LIST(EL),check_index)(list, index) < 03.01k
)
268
0
    goto error;
269
3.01k
  
if (3.01k
list->p[index] == el3.01k
) {
270
0
    FN(EL,free)(el);
271
0
    return list;
272
0
  }
273
3.01k
  
list = 3.01k
FN3.01k
(LIST(EL),cow)(list);
274
3.01k
  if (!list)
275
0
    goto error;
276
3.01k
  
FN3.01k
(EL,free)(list->p[index]);
277
3.01k
  list->p[index] = el;
278
3.01k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
3.01k
}
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
3.06k
{
265
3.06k
  if (
!list || 3.06k
!el3.06k
)
266
0
    goto error;
267
3.06k
  
if (3.06k
FN3.06k
(LIST(EL),check_index)(list, index) < 03.06k
)
268
0
    goto error;
269
3.06k
  
if (3.06k
list->p[index] == el3.06k
) {
270
1.21k
    FN(EL,free)(el);
271
1.21k
    return list;
272
1.21k
  }
273
1.85k
  
list = 1.85k
FN1.85k
(LIST(EL),cow)(list);
274
1.85k
  if (!list)
275
0
    goto error;
276
1.85k
  
FN1.85k
(EL,free)(list->p[index]);
277
1.85k
  list->p[index] = el;
278
1.85k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
3.06k
}
isl_basic_set_list_set_basic_set
Line
Count
Source
264
3.31k
{
265
3.31k
  if (
!list || 3.31k
!el3.31k
)
266
0
    goto error;
267
3.31k
  
if (3.31k
FN3.31k
(LIST(EL),check_index)(list, index) < 03.31k
)
268
0
    goto error;
269
3.31k
  
if (3.31k
list->p[index] == el3.31k
) {
270
0
    FN(EL,free)(el);
271
0
    return list;
272
0
  }
273
3.31k
  
list = 3.31k
FN3.31k
(LIST(EL),cow)(list);
274
3.31k
  if (!list)
275
0
    goto error;
276
3.31k
  
FN3.31k
(EL,free)(list->p[index]);
277
3.31k
  list->p[index] = el;
278
3.31k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
3.31k
}
isl_schedule_tree_list_set_schedule_tree
Line
Count
Source
264
21.9k
{
265
21.9k
  if (
!list || 21.9k
!el21.9k
)
266
0
    goto error;
267
21.9k
  
if (21.9k
FN21.9k
(LIST(EL),check_index)(list, index) < 021.9k
)
268
0
    goto error;
269
21.9k
  
if (21.9k
list->p[index] == el21.9k
) {
270
3
    FN(EL,free)(el);
271
3
    return list;
272
3
  }
273
21.9k
  
list = 21.9k
FN21.9k
(LIST(EL),cow)(list);
274
21.9k
  if (!list)
275
0
    goto error;
276
21.9k
  
FN21.9k
(EL,free)(list->p[index]);
277
21.9k
  list->p[index] = el;
278
21.9k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
21.9k
}
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
) {
270
0
    FN(EL,free)(el);
271
0
    return list;
272
0
  }
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]);
277
2
  list->p[index] = el;
278
2
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
2
}
Unexecuted instantiation: isl_map_list_set_map
isl_basic_map_list_set_basic_map
Line
Count
Source
264
3.25k
{
265
3.25k
  if (
!list || 3.25k
!el3.25k
)
266
0
    goto error;
267
3.25k
  
if (3.25k
FN3.25k
(LIST(EL),check_index)(list, index) < 03.25k
)
268
0
    goto error;
269
3.25k
  
if (3.25k
list->p[index] == el3.25k
) {
270
2.81k
    FN(EL,free)(el);
271
2.81k
    return list;
272
2.81k
  }
273
435
  
list = 435
FN435
(LIST(EL),cow)(list);
274
435
  if (!list)
275
0
    goto error;
276
435
  
FN435
(EL,free)(list->p[index]);
277
435
  list->p[index] = el;
278
435
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
3.25k
}
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
) {
270
0
    FN(EL,free)(el);
271
0
    return list;
272
0
  }
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]);
277
2
  list->p[index] = el;
278
2
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  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
6.52k
{
265
6.52k
  if (
!list || 6.52k
!el6.52k
)
266
0
    goto error;
267
6.52k
  
if (6.52k
FN6.52k
(LIST(EL),check_index)(list, index) < 06.52k
)
268
0
    goto error;
269
6.52k
  
if (6.52k
list->p[index] == el6.52k
) {
270
6.50k
    FN(EL,free)(el);
271
6.50k
    return list;
272
6.50k
  }
273
19
  
list = 19
FN19
(LIST(EL),cow)(list);
274
19
  if (!list)
275
0
    goto error;
276
19
  
FN19
(EL,free)(list->p[index]);
277
19
  list->p[index] = el;
278
19
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
6.52k
}
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
64
{
298
64
  EL *el;
299
64
300
64
  if (
FN64
(LIST(EL),check_index)(list, index) < 064
)
301
0
    return NULL;
302
64
  
if (64
list->ref != 164
)
303
0
    
return 0
FN0
(FN(LIST(EL),get),BASE)(list, index);
304
64
  el = list->p[index];
305
64
  list->p[index] = NULL;
306
64
  return el;
307
64
}
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
64
{
298
64
  EL *el;
299
64
300
64
  if (
FN64
(LIST(EL),check_index)(list, index) < 064
)
301
0
    return NULL;
302
64
  
if (64
list->ref != 164
)
303
0
    
return 0
FN0
(FN(LIST(EL),get),BASE)(list, index);
304
64
  el = list->p[index];
305
64
  list->p[index] = NULL;
306
64
  return el;
307
64
}
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
64
{
316
64
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
317
64
}
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
64
{
316
64
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
317
64
}
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.51k
{
322
1.51k
  int i;
323
1.51k
324
1.51k
  if (!list)
325
0
    return isl_stat_error;
326
1.51k
327
3.34k
  
for (i = 0; 1.51k
i < list->n3.34k
;
++i1.82k
) {
328
2.35k
    
EL2.35k
*el =
FN2.35k
(EL,copy)(list->p[i]);
329
2.35k
    if (!el)
330
0
      return isl_stat_error;
331
2.35k
    
if (2.35k
fn(el, user) < 02.35k
)
332
532
      return isl_stat_error;
333
2.35k
  }
334
1.51k
335
986
  return isl_stat_ok;
336
1.51k
}
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
128
{
322
128
  int i;
323
128
324
128
  if (!list)
325
0
    return isl_stat_error;
326
128
327
256
  
for (i = 0; 128
i < list->n256
;
++i128
) {
328
128
    
EL128
*el =
FN128
(EL,copy)(list->p[i]);
329
128
    if (!el)
330
0
      return isl_stat_error;
331
128
    
if (128
fn(el, user) < 0128
)
332
0
      return isl_stat_error;
333
128
  }
334
128
335
128
  return isl_stat_ok;
336
128
}
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
695
{
322
695
  int i;
323
695
324
695
  if (!list)
325
0
    return isl_stat_error;
326
695
327
867
  
for (i = 0; 695
i < list->n867
;
++i172
) {
328
704
    
EL704
*el =
FN704
(EL,copy)(list->p[i]);
329
704
    if (!el)
330
0
      return isl_stat_error;
331
704
    
if (704
fn(el, user) < 0704
)
332
532
      return isl_stat_error;
333
704
  }
334
695
335
163
  return isl_stat_ok;
336
695
}
isl_constraint_list_foreach
Line
Count
Source
321
695
{
322
695
  int i;
323
695
324
695
  if (!list)
325
0
    return isl_stat_error;
326
695
327
2.21k
  
for (i = 0; 695
i < list->n2.21k
;
++i1.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
695
335
695
  return isl_stat_ok;
336
695
}
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
64
{
344
64
  int i, n;
345
64
346
64
  if (!list)
347
0
    return NULL;
348
64
349
64
  n = list->n;
350
128
  for (i = 0; 
i < n128
;
++i64
) {
351
64
    
EL64
*el =
FN64
(FN(LIST(EL),take),BASE)(list, i);
352
64
    if (!el)
353
0
      
return 0
FN0
(LIST(EL),free)(list);
354
64
    el = fn(el, user);
355
64
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
356
64
  }
357
64
358
64
  return list;
359
64
}
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
64
{
344
64
  int i, n;
345
64
346
64
  if (!list)
347
0
    return NULL;
348
64
349
64
  n = list->n;
350
128
  for (i = 0; 
i < n128
;
++i64
) {
351
64
    
EL64
*el =
FN64
(FN(LIST(EL),take),BASE)(list, i);
352
64
    if (!el)
353
0
      
return 0
FN0
(LIST(EL),free)(list);
354
64
    el = fn(el, user);
355
64
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
356
64
  }
357
64
358
64
  return list;
359
64
}
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
20
{
376
20
  S(LIST(EL),sort_data) *data = user;
377
20
  EL * const *el1 = a;
378
20
  EL * const *el2 = b;
379
20
380
20
  return data->cmp(*el1, *el2, data->user);
381
20
}
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
82
{
376
82
  S(LIST(EL),sort_data) *data = user;
377
82
  EL * const *el1 = a;
378
82
  EL * const *el2 = b;
379
82
380
82
  return data->cmp(*el1, *el2, data->user);
381
82
}
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.69k
{
389
1.69k
  S(LIST(EL),sort_data) data = { cmp, user };
390
1.69k
391
1.69k
  if (!list)
392
0
    return NULL;
393
1.69k
  
if (1.69k
list->n <= 11.69k
)
394
840
    return list;
395
853
  
list = 853
FN853
(LIST(EL),cow)(list);
396
853
  if (!list)
397
0
    return NULL;
398
853
399
853
  
if (853
isl_sort(list->p, list->n, sizeof(list->p[0]),
400
853
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
853
403
853
  return list;
404
1.69k
}
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.58k
{
389
1.58k
  S(LIST(EL),sort_data) data = { cmp, user };
390
1.58k
391
1.58k
  if (!list)
392
0
    return NULL;
393
1.58k
  
if (1.58k
list->n <= 11.58k
)
394
821
    return list;
395
761
  
list = 761
FN761
(LIST(EL),cow)(list);
396
761
  if (!list)
397
0
    return NULL;
398
761
399
761
  
if (761
isl_sort(list->p, list->n, sizeof(list->p[0]),
400
761
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
761
403
761
  return list;
404
1.58k
}
Unexecuted instantiation: isl_band_list_sort
isl_ast_graft_list_sort
Line
Count
Source
388
28
{
389
28
  S(LIST(EL),sort_data) data = { cmp, user };
390
28
391
28
  if (!list)
392
0
    return NULL;
393
28
  
if (28
list->n <= 128
)
394
8
    return list;
395
20
  
list = 20
FN20
(LIST(EL),cow)(list);
396
20
  if (!list)
397
0
    return NULL;
398
20
399
20
  
if (20
isl_sort(list->p, list->n, sizeof(list->p[0]),
400
20
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
20
403
20
  return list;
404
28
}
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
83
{
389
83
  S(LIST(EL),sort_data) data = { cmp, user };
390
83
391
83
  if (!list)
392
0
    return NULL;
393
83
  
if (83
list->n <= 183
)
394
11
    return list;
395
72
  
list = 72
FN72
(LIST(EL),cow)(list);
396
72
  if (!list)
397
0
    return NULL;
398
72
399
72
  
if (72
isl_sort(list->p, list->n, sizeof(list->p[0]),
400
72
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
72
403
72
  return list;
404
83
}
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
120
{
423
120
  S(LIST(EL),foreach_scc_data) *data = user;
424
120
425
120
  return data->follows(data->list->p[i], data->list->p[j],
426
120
        data->follows_user);
427
120
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_follows
isl_set_list.c:isl_basic_set_list_follows
Line
Count
Source
422
120
{
423
120
  S(LIST(EL),foreach_scc_data) *data = user;
424
120
425
120
  return data->follows(data->list->p[i], data->list->p[j],
426
120
        data->follows_user);
427
120
}
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
90
{
435
90
  int i;
436
90
  isl_ctx *ctx;
437
90
  LIST(EL) *slice;
438
90
439
90
  ctx = FN(LIST(EL),get_ctx)(list);
440
90
  slice = FN(LIST(EL),alloc)(ctx, n);
441
180
  for (i = 0; 
i < n180
;
++i90
) {
442
90
    EL *el;
443
90
444
90
    el = FN(EL,copy)(list->p[pos[i]]);
445
90
    slice = FN(LIST(EL),add)(slice, el);
446
90
  }
447
90
448
90
  return fn(slice, user);
449
90
}
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
90
{
435
90
  int i;
436
90
  isl_ctx *ctx;
437
90
  LIST(EL) *slice;
438
90
439
90
  ctx = FN(LIST(EL),get_ctx)(list);
440
90
  slice = FN(LIST(EL),alloc)(ctx, n);
441
180
  for (i = 0; 
i < n180
;
++i90
) {
442
90
    EL *el;
443
90
444
90
    el = FN(EL,copy)(list->p[pos[i]]);
445
90
    slice = FN(LIST(EL),add)(slice, el);
446
90
  }
447
90
448
90
  return fn(slice, user);
449
90
}
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
54
{
468
54
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
469
54
  int i, n;
470
54
  isl_ctx *ctx;
471
54
  struct isl_tarjan_graph *g;
472
54
473
54
  if (!list)
474
0
    return isl_stat_error;
475
54
  
if (54
list->n == 054
)
476
0
    return isl_stat_ok;
477
54
  
if (54
list->n == 154
)
478
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
479
54
480
54
  
ctx = 54
FN54
(LIST(EL),get_ctx)(list);
481
54
  n = list->n;
482
54
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
483
54
  if (!g)
484
0
    return isl_stat_error;
485
54
486
54
  i = 0;
487
103
  do {
488
103
    int first;
489
103
490
103
    if (g->order[i] == -1)
491
0
      isl_die(ctx, isl_error_internal, "cannot happen",
492
103
        break);
493
103
    first = i;
494
225
    while (
g->order[i] != -1225
) {
495
122
      ++i; --n;
496
122
    }
497
103
    if (
first == 0 && 103
n == 054
) {
498
13
      isl_tarjan_graph_free(g);
499
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
500
13
    }
501
90
    
if (90
FN90
(LIST(EL),call_on_scc)(list, g->order + first, i - first,
502
90
              fn, fn_user) < 0)
503
0
      break;
504
90
    ++i;
505
90
  } while (n);
506
54
507
41
  isl_tarjan_graph_free(g);
508
41
509
41
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok41
;
510
54
}
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
54
{
468
54
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
469
54
  int i, n;
470
54
  isl_ctx *ctx;
471
54
  struct isl_tarjan_graph *g;
472
54
473
54
  if (!list)
474
0
    return isl_stat_error;
475
54
  
if (54
list->n == 054
)
476
0
    return isl_stat_ok;
477
54
  
if (54
list->n == 154
)
478
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
479
54
480
54
  
ctx = 54
FN54
(LIST(EL),get_ctx)(list);
481
54
  n = list->n;
482
54
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
483
54
  if (!g)
484
0
    return isl_stat_error;
485
54
486
54
  i = 0;
487
103
  do {
488
103
    int first;
489
103
490
103
    if (g->order[i] == -1)
491
0
      isl_die(ctx, isl_error_internal, "cannot happen",
492
103
        break);
493
103
    first = i;
494
225
    while (
g->order[i] != -1225
) {
495
122
      ++i; --n;
496
122
    }
497
103
    if (
first == 0 && 103
n == 054
) {
498
13
      isl_tarjan_graph_free(g);
499
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
500
13
    }
501
90
    
if (90
FN90
(LIST(EL),call_on_scc)(list, g->order + first, i - first,
502
90
              fn, fn_user) < 0)
503
0
      break;
504
90
    ++i;
505
90
  } while (n);
506
54
507
41
  isl_tarjan_graph_free(g);
508
41
509
41
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok41
;
510
54
}
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
29.9k
{
514
29.9k
  isl_ctx *ctx;
515
29.9k
  LIST(EL) *list;
516
29.9k
517
29.9k
  if (!el)
518
1
    return NULL;
519
29.9k
  
ctx = 29.9k
FN29.9k
(EL,get_ctx)(el);
520
29.9k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
29.9k
  if (!list)
522
0
    goto error;
523
29.9k
  
list = 29.9k
FN29.9k
(LIST(EL),add)(list, el);
524
29.9k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
29.9k
}
isl_union_set_list_from_union_set
Line
Count
Source
513
342
{
514
342
  isl_ctx *ctx;
515
342
  LIST(EL) *list;
516
342
517
342
  if (!el)
518
0
    return NULL;
519
342
  
ctx = 342
FN342
(EL,get_ctx)(el);
520
342
  list = FN(LIST(EL),alloc)(ctx, 1);
521
342
  if (!list)
522
0
    goto error;
523
342
  
list = 342
FN342
(LIST(EL),add)(list, el);
524
342
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
342
}
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
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
6
}
isl_set_list_from_set
Line
Count
Source
513
7.87k
{
514
7.87k
  isl_ctx *ctx;
515
7.87k
  LIST(EL) *list;
516
7.87k
517
7.87k
  if (!el)
518
0
    return NULL;
519
7.87k
  
ctx = 7.87k
FN7.87k
(EL,get_ctx)(el);
520
7.87k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
7.87k
  if (!list)
522
0
    goto error;
523
7.87k
  
list = 7.87k
FN7.87k
(LIST(EL),add)(list, el);
524
7.87k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
7.87k
}
isl_basic_set_list_from_basic_set
Line
Count
Source
513
15
{
514
15
  isl_ctx *ctx;
515
15
  LIST(EL) *list;
516
15
517
15
  if (!el)
518
0
    return NULL;
519
15
  
ctx = 15
FN15
(EL,get_ctx)(el);
520
15
  list = FN(LIST(EL),alloc)(ctx, 1);
521
15
  if (!list)
522
0
    goto error;
523
15
  
list = 15
FN15
(LIST(EL),add)(list, el);
524
15
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
15
}
isl_schedule_tree_list_from_schedule_tree
Line
Count
Source
513
3.62k
{
514
3.62k
  isl_ctx *ctx;
515
3.62k
  LIST(EL) *list;
516
3.62k
517
3.62k
  if (!el)
518
0
    return NULL;
519
3.62k
  
ctx = 3.62k
FN3.62k
(EL,get_ctx)(el);
520
3.62k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
3.62k
  if (!list)
522
0
    goto error;
523
3.62k
  
list = 3.62k
FN3.62k
(LIST(EL),add)(list, el);
524
3.62k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
3.62k
}
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
0
error:
526
0
  FN(EL,free)(el);
527
0
  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
2.12k
{
514
2.12k
  isl_ctx *ctx;
515
2.12k
  LIST(EL) *list;
516
2.12k
517
2.12k
  if (!el)
518
0
    return NULL;
519
2.12k
  
ctx = 2.12k
FN2.12k
(EL,get_ctx)(el);
520
2.12k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
2.12k
  if (!list)
522
0
    goto error;
523
2.12k
  
list = 2.12k
FN2.12k
(LIST(EL),add)(list, el);
524
2.12k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
2.12k
}
isl_ast_node_list_from_ast_node
Line
Count
Source
513
60
{
514
60
  isl_ctx *ctx;
515
60
  LIST(EL) *list;
516
60
517
60
  if (!el)
518
0
    return NULL;
519
60
  
ctx = 60
FN60
(EL,get_ctx)(el);
520
60
  list = FN(LIST(EL),alloc)(ctx, 1);
521
60
  if (!list)
522
0
    goto error;
523
60
  
list = 60
FN60
(LIST(EL),add)(list, el);
524
60
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
60
}
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
0
error:
526
0
  FN(EL,free)(el);
527
0
  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
8.01k
{
514
8.01k
  isl_ctx *ctx;
515
8.01k
  LIST(EL) *list;
516
8.01k
517
8.01k
  if (!el)
518
1
    return NULL;
519
8.01k
  
ctx = 8.01k
FN8.01k
(EL,get_ctx)(el);
520
8.01k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
8.01k
  if (!list)
522
0
    goto error;
523
8.01k
  
list = 8.01k
FN8.01k
(LIST(EL),add)(list, el);
524
8.01k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
8.01k
}
isl_aff_list_from_aff
Line
Count
Source
513
7.87k
{
514
7.87k
  isl_ctx *ctx;
515
7.87k
  LIST(EL) *list;
516
7.87k
517
7.87k
  if (!el)
518
0
    return NULL;
519
7.87k
  
ctx = 7.87k
FN7.87k
(EL,get_ctx)(el);
520
7.87k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
7.87k
  if (!list)
522
0
    goto error;
523
7.87k
  
list = 7.87k
FN7.87k
(LIST(EL),add)(list, el);
524
7.87k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
7.87k
}
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
0
error:
526
0
  FN(EL,free)(el);
527
0
  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.98k
{
537
1.98k
  int i;
538
1.98k
539
2.05k
  for (i = 0; 
i < list2->n2.05k
;
++i64
)
540
64
    
list1 = 64
FN64
(LIST(EL),add)(list1,
FN64
(EL,copy)(list2->p[i]));
541
1.98k
  FN(LIST(EL),free)(list2);
542
1.98k
  return list1;
543
1.98k
}
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
44
{
537
44
  int i;
538
44
539
108
  for (i = 0; 
i < list2->n108
;
++i64
)
540
64
    
list1 = 64
FN64
(LIST(EL),add)(list1,
FN64
(EL,copy)(list2->p[i]));
541
44
  FN(LIST(EL),free)(list2);
542
44
  return list1;
543
44
}
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
46
{
537
46
  int i;
538
46
539
46
  for (i = 0; 
i < list2->n46
;
++i0
)
540
0
    
list1 = 0
FN0
(LIST(EL),add)(list1,
FN0
(EL,copy)(list2->p[i]));
541
46
  FN(LIST(EL),free)(list2);
542
46
  return list1;
543
46
}
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.89k
{
537
1.89k
  int i;
538
1.89k
539
1.89k
  for (i = 0; 
i < list2->n1.89k
;
++i0
)
540
0
    
list1 = 0
FN0
(LIST(EL),add)(list1,
FN0
(EL,copy)(list2->p[i]));
541
1.89k
  FN(LIST(EL),free)(list2);
542
1.89k
  return list1;
543
1.89k
}
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
7.86k
{
553
7.86k
  int i;
554
7.86k
  isl_ctx *ctx;
555
7.86k
  LIST(EL) *res;
556
7.86k
557
7.86k
  if (
!list1 || 7.86k
!list27.86k
)
558
0
    goto error;
559
7.86k
560
7.86k
  
if (7.86k
list1->ref == 1 && 7.86k
list1->n + list2->n <= list1->size7.24k
)
561
1.98k
    
return 1.98k
FN1.98k
(LIST(EL),concat_inplace)(list1, list2);
562
7.86k
563
5.87k
  
ctx = 5.87k
FN5.87k
(LIST(EL),get_ctx)(list1);
564
5.87k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
17.1k
  for (i = 0; 
i < list1->n17.1k
;
++i11.3k
)
566
11.3k
    
res = 11.3k
FN11.3k
(LIST(EL),add)(res,
FN11.3k
(EL,copy)(list1->p[i]));
567
14.4k
  for (i = 0; 
i < list2->n14.4k
;
++i8.55k
)
568
8.55k
    
res = 8.55k
FN8.55k
(LIST(EL),add)(res,
FN8.55k
(EL,copy)(list2->p[i]));
569
5.87k
570
5.87k
  FN(LIST(EL),free)(list1);
571
5.87k
  FN(LIST(EL),free)(list2);
572
5.87k
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
7.86k
}
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
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  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
5.30k
{
553
5.30k
  int i;
554
5.30k
  isl_ctx *ctx;
555
5.30k
  LIST(EL) *res;
556
5.30k
557
5.30k
  if (
!list1 || 5.30k
!list25.30k
)
558
0
    goto error;
559
5.30k
560
5.30k
  
if (5.30k
list1->ref == 1 && 5.30k
list1->n + list2->n <= list1->size5.30k
)
561
1.89k
    
return 1.89k
FN1.89k
(LIST(EL),concat_inplace)(list1, list2);
562
5.30k
563
3.40k
  
ctx = 3.40k
FN3.40k
(LIST(EL),get_ctx)(list1);
564
3.40k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
3.65k
  for (i = 0; 
i < list1->n3.65k
;
++i247
)
566
247
    
res = 247
FN247
(LIST(EL),add)(res,
FN247
(EL,copy)(list1->p[i]));
567
7.60k
  for (i = 0; 
i < list2->n7.60k
;
++i4.20k
)
568
4.20k
    
res = 4.20k
FN4.20k
(LIST(EL),add)(res,
FN4.20k
(EL,copy)(list2->p[i]));
569
3.40k
570
3.40k
  FN(LIST(EL),free)(list1);
571
3.40k
  FN(LIST(EL),free)(list2);
572
3.40k
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
5.30k
}
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
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
4
}
Unexecuted instantiation: isl_constraint_list_concat
Unexecuted instantiation: isl_val_list_concat
isl_id_list_concat
Line
Count
Source
552
615
{
553
615
  int i;
554
615
  isl_ctx *ctx;
555
615
  LIST(EL) *res;
556
615
557
615
  if (
!list1 || 615
!list2615
)
558
0
    goto error;
559
615
560
615
  
if (615
list1->ref == 1 && 615
list1->n + list2->n <= list1->size0
)
561
0
    
return 0
FN0
(LIST(EL),concat_inplace)(list1, list2);
562
615
563
615
  
ctx = 615
FN615
(LIST(EL),get_ctx)(list1);
564
615
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
1.13k
  for (i = 0; 
i < list1->n1.13k
;
++i515
)
566
515
    
res = 515
FN515
(LIST(EL),add)(res,
FN515
(EL,copy)(list1->p[i]));
567
1.48k
  for (i = 0; 
i < list2->n1.48k
;
++i866
)
568
866
    
res = 866
FN866
(LIST(EL),add)(res,
FN866
(EL,copy)(list2->p[i]));
569
615
570
615
  FN(LIST(EL),free)(list1);
571
615
  FN(LIST(EL),free)(list2);
572
615
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
615
}
isl_basic_map_list_concat
Line
Count
Source
552
1.67k
{
553
1.67k
  int i;
554
1.67k
  isl_ctx *ctx;
555
1.67k
  LIST(EL) *res;
556
1.67k
557
1.67k
  if (
!list1 || 1.67k
!list21.67k
)
558
0
    goto error;
559
1.67k
560
1.67k
  
if (1.67k
list1->ref == 1 && 1.67k
list1->n + list2->n <= list1->size1.67k
)
561
46
    
return 46
FN46
(LIST(EL),concat_inplace)(list1, list2);
562
1.67k
563
1.62k
  
ctx = 1.62k
FN1.62k
(LIST(EL),get_ctx)(list1);
564
1.62k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
11.9k
  for (i = 0; 
i < list1->n11.9k
;
++i10.3k
)
566
10.3k
    
res = 10.3k
FN10.3k
(LIST(EL),add)(res,
FN10.3k
(EL,copy)(list1->p[i]));
567
4.87k
  for (i = 0; 
i < list2->n4.87k
;
++i3.25k
)
568
3.25k
    
res = 3.25k
FN3.25k
(LIST(EL),add)(res,
FN3.25k
(EL,copy)(list2->p[i]));
569
1.62k
570
1.62k
  FN(LIST(EL),free)(list1);
571
1.62k
  FN(LIST(EL),free)(list2);
572
1.62k
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
1.67k
}
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
135
{
553
135
  int i;
554
135
  isl_ctx *ctx;
555
135
  LIST(EL) *res;
556
135
557
135
  if (
!list1 || 135
!list2135
)
558
0
    goto error;
559
135
560
135
  
if (135
list1->ref == 1 && 135
list1->n + list2->n <= list1->size135
)
561
44
    
return 44
FN44
(LIST(EL),concat_inplace)(list1, list2);
562
135
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
91
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
135
}
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
) {
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