Coverage Report

Created: 2017-06-23 12:40

/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.62k
#define xCAT(A,B) A ## B
20
4.62k
#define CAT(A,B) xCAT(A,B)
21
#undef EL
22
4.62k
#define EL CAT(isl_,BASE)
23
2.33M
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
24
2.33M
#define FN(TYPE,NAME) xFN(TYPE,NAME)
25
464k
#define xLIST(EL) EL ## _list
26
464k
#define LIST(EL) xLIST(EL)
27
2.84k
#define xS(TYPE,NAME) struct TYPE ## _ ## NAME
28
2.84k
#define S(TYPE,NAME) xS(TYPE,NAME)
29
30
isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
31
76.6k
{
32
76.6k
  return list ? list->ctx : NULL;
33
76.6k
}
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
167
{
32
167
  return list ? list->ctx : NULL;
33
167
}
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.56k
{
32
1.56k
  return list ? list->ctx : NULL;
33
1.56k
}
isl_schedule_tree_list_get_ctx
Line
Count
Source
31
54.6k
{
32
54.6k
  return list ? list->ctx : NULL;
33
54.6k
}
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
445
{
32
445
  return list ? list->ctx : NULL;
33
445
}
isl_basic_map_list_get_ctx
Line
Count
Source
31
1.00k
{
32
1.00k
  return list ? list->ctx : NULL;
33
1.00k
}
isl_id_list_get_ctx
Line
Count
Source
31
605
{
32
605
  return list ? list->ctx : NULL;
33
605
}
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
7.25k
{
32
7.25k
  return list ? list->ctx : NULL;
33
7.25k
}
isl_ast_node_list_get_ctx
Line
Count
Source
31
340
{
32
340
  return list ? list->ctx : NULL;
33
340
}
Unexecuted instantiation: isl_ast_expr_list_get_ctx
Unexecuted instantiation: isl_union_pw_multi_aff_list_get_ctx
isl_union_pw_aff_list_get_ctx
Line
Count
Source
31
15
{
32
15
  return list ? list->ctx : NULL;
33
15
}
isl_pw_aff_list_get_ctx
Line
Count
Source
31
9.48k
{
32
9.48k
  return list ? list->ctx : NULL;
33
9.48k
}
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
115k
{
37
115k
  LIST(EL) *list;
38
115k
39
115k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
115k
      "cannot create list of negative length",
42
115k
      return NULL);
43
115k
  
list = 115k
isl_alloc115k
(ctx, LIST(EL),
44
115k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
115k
  if (!list)
46
0
    return NULL;
47
115k
48
115k
  list->ctx = ctx;
49
115k
  isl_ctx_ref(ctx);
50
115k
  list->ref = 1;
51
115k
  list->size = n;
52
115k
  list->n = 0;
53
115k
  return list;
54
115k
}
isl_aff_list_alloc
Line
Count
Source
36
5.81k
{
37
5.81k
  LIST(EL) *list;
38
5.81k
39
5.81k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
5.81k
      "cannot create list of negative length",
42
5.81k
      return NULL);
43
5.81k
  
list = 5.81k
isl_alloc5.81k
(ctx, LIST(EL),
44
5.81k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
5.81k
  if (!list)
46
0
    return NULL;
47
5.81k
48
5.81k
  list->ctx = ctx;
49
5.81k
  isl_ctx_ref(ctx);
50
5.81k
  list->ref = 1;
51
5.81k
  list->size = n;
52
5.81k
  list->n = 0;
53
5.81k
  return list;
54
5.81k
}
isl_pw_aff_list_alloc
Line
Count
Source
36
14.1k
{
37
14.1k
  LIST(EL) *list;
38
14.1k
39
14.1k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
14.1k
      "cannot create list of negative length",
42
14.1k
      return NULL);
43
14.1k
  
list = 14.1k
isl_alloc14.1k
(ctx, LIST(EL),
44
14.1k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
14.1k
  if (!list)
46
0
    return NULL;
47
14.1k
48
14.1k
  list->ctx = ctx;
49
14.1k
  isl_ctx_ref(ctx);
50
14.1k
  list->ref = 1;
51
14.1k
  list->size = n;
52
14.1k
  list->n = 0;
53
14.1k
  return list;
54
14.1k
}
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
2.75k
{
37
2.75k
  LIST(EL) *list;
38
2.75k
39
2.75k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.75k
      "cannot create list of negative length",
42
2.75k
      return NULL);
43
2.75k
  
list = 2.75k
isl_alloc2.75k
(ctx, LIST(EL),
44
2.75k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.75k
  if (!list)
46
0
    return NULL;
47
2.75k
48
2.75k
  list->ctx = ctx;
49
2.75k
  isl_ctx_ref(ctx);
50
2.75k
  list->ref = 1;
51
2.75k
  list->size = n;
52
2.75k
  list->n = 0;
53
2.75k
  return list;
54
2.75k
}
isl_ast_graft_list_alloc
Line
Count
Source
36
11.3k
{
37
11.3k
  LIST(EL) *list;
38
11.3k
39
11.3k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
11.3k
      "cannot create list of negative length",
42
11.3k
      return NULL);
43
11.3k
  
list = 11.3k
isl_alloc11.3k
(ctx, LIST(EL),
44
11.3k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
11.3k
  if (!list)
46
0
    return NULL;
47
11.3k
48
11.3k
  list->ctx = ctx;
49
11.3k
  isl_ctx_ref(ctx);
50
11.3k
  list->ref = 1;
51
11.3k
  list->size = n;
52
11.3k
  list->n = 0;
53
11.3k
  return list;
54
11.3k
}
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.29k
{
37
2.29k
  LIST(EL) *list;
38
2.29k
39
2.29k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.29k
      "cannot create list of negative length",
42
2.29k
      return NULL);
43
2.29k
  
list = 2.29k
isl_alloc2.29k
(ctx, LIST(EL),
44
2.29k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.29k
  if (!list)
46
0
    return NULL;
47
2.29k
48
2.29k
  list->ctx = ctx;
49
2.29k
  isl_ctx_ref(ctx);
50
2.29k
  list->ref = 1;
51
2.29k
  list->size = n;
52
2.29k
  list->n = 0;
53
2.29k
  return list;
54
2.29k
}
isl_id_list_alloc
Line
Count
Source
36
1.79k
{
37
1.79k
  LIST(EL) *list;
38
1.79k
39
1.79k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
1.79k
      "cannot create list of negative length",
42
1.79k
      return NULL);
43
1.79k
  
list = 1.79k
isl_alloc1.79k
(ctx, LIST(EL),
44
1.79k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
1.79k
  if (!list)
46
0
    return NULL;
47
1.79k
48
1.79k
  list->ctx = ctx;
49
1.79k
  isl_ctx_ref(ctx);
50
1.79k
  list->ref = 1;
51
1.79k
  list->size = n;
52
1.79k
  list->n = 0;
53
1.79k
  return list;
54
1.79k
}
isl_basic_map_list_alloc
Line
Count
Source
36
2.48k
{
37
2.48k
  LIST(EL) *list;
38
2.48k
39
2.48k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.48k
      "cannot create list of negative length",
42
2.48k
      return NULL);
43
2.48k
  
list = 2.48k
isl_alloc2.48k
(ctx, LIST(EL),
44
2.48k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.48k
  if (!list)
46
0
    return NULL;
47
2.48k
48
2.48k
  list->ctx = ctx;
49
2.48k
  isl_ctx_ref(ctx);
50
2.48k
  list->ref = 1;
51
2.48k
  list->size = n;
52
2.48k
  list->n = 0;
53
2.48k
  return list;
54
2.48k
}
isl_map_list_alloc
Line
Count
Source
36
409
{
37
409
  LIST(EL) *list;
38
409
39
409
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
409
      "cannot create list of negative length",
42
409
      return NULL);
43
409
  
list = 409
isl_alloc409
(ctx, LIST(EL),
44
409
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
409
  if (!list)
46
0
    return NULL;
47
409
48
409
  list->ctx = ctx;
49
409
  isl_ctx_ref(ctx);
50
409
  list->ref = 1;
51
409
  list->size = n;
52
409
  list->n = 0;
53
409
  return list;
54
409
}
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
63.5k
{
37
63.5k
  LIST(EL) *list;
38
63.5k
39
63.5k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
63.5k
      "cannot create list of negative length",
42
63.5k
      return NULL);
43
63.5k
  
list = 63.5k
isl_alloc63.5k
(ctx, LIST(EL),
44
63.5k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
63.5k
  if (!list)
46
0
    return NULL;
47
63.5k
48
63.5k
  list->ctx = ctx;
49
63.5k
  isl_ctx_ref(ctx);
50
63.5k
  list->ref = 1;
51
63.5k
  list->size = n;
52
63.5k
  list->n = 0;
53
63.5k
  return list;
54
63.5k
}
isl_basic_set_list_alloc
Line
Count
Source
36
2.45k
{
37
2.45k
  LIST(EL) *list;
38
2.45k
39
2.45k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
2.45k
      "cannot create list of negative length",
42
2.45k
      return NULL);
43
2.45k
  
list = 2.45k
isl_alloc2.45k
(ctx, LIST(EL),
44
2.45k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
2.45k
  if (!list)
46
0
    return NULL;
47
2.45k
48
2.45k
  list->ctx = ctx;
49
2.45k
  isl_ctx_ref(ctx);
50
2.45k
  list->ref = 1;
51
2.45k
  list->size = n;
52
2.45k
  list->n = 0;
53
2.45k
  return list;
54
2.45k
}
isl_set_list_alloc
Line
Count
Source
36
7.55k
{
37
7.55k
  LIST(EL) *list;
38
7.55k
39
7.55k
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
7.55k
      "cannot create list of negative length",
42
7.55k
      return NULL);
43
7.55k
  
list = 7.55k
isl_alloc7.55k
(ctx, LIST(EL),
44
7.55k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
7.55k
  if (!list)
46
0
    return NULL;
47
7.55k
48
7.55k
  list->ctx = ctx;
49
7.55k
  isl_ctx_ref(ctx);
50
7.55k
  list->ref = 1;
51
7.55k
  list->size = n;
52
7.55k
  list->n = 0;
53
7.55k
  return list;
54
7.55k
}
isl_union_set_list_alloc
Line
Count
Source
36
399
{
37
399
  LIST(EL) *list;
38
399
39
399
  if (n < 0)
40
0
    isl_die(ctx, isl_error_invalid,
41
399
      "cannot create list of negative length",
42
399
      return NULL);
43
399
  
list = 399
isl_alloc399
(ctx, LIST(EL),
44
399
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
45
399
  if (!list)
46
0
    return NULL;
47
399
48
399
  list->ctx = ctx;
49
399
  isl_ctx_ref(ctx);
50
399
  list->ref = 1;
51
399
  list->size = n;
52
399
  list->n = 0;
53
399
  return list;
54
399
}
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
82.7k
{
58
82.7k
  if (!list)
59
0
    return NULL;
60
82.7k
61
82.7k
  list->ref++;
62
82.7k
  return list;
63
82.7k
}
Unexecuted instantiation: isl_aff_list_copy
isl_pw_aff_list_copy
Line
Count
Source
57
10.3k
{
58
10.3k
  if (!list)
59
0
    return NULL;
60
10.3k
61
10.3k
  list->ref++;
62
10.3k
  return list;
63
10.3k
}
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
174
{
58
174
  if (!list)
59
0
    return NULL;
60
174
61
174
  list->ref++;
62
174
  return list;
63
174
}
Unexecuted instantiation: isl_ast_graft_list_copy
Unexecuted instantiation: isl_band_list_copy
isl_constraint_list_copy
Line
Count
Source
57
683
{
58
683
  if (!list)
59
0
    return NULL;
60
683
61
683
  list->ref++;
62
683
  return list;
63
683
}
isl_id_list_copy
Line
Count
Source
57
21.7k
{
58
21.7k
  if (!list)
59
0
    return NULL;
60
21.7k
61
21.7k
  list->ref++;
62
21.7k
  return list;
63
21.7k
}
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
49.7k
{
58
49.7k
  if (!list)
59
0
    return NULL;
60
49.7k
61
49.7k
  list->ref++;
62
49.7k
  return list;
63
49.7k
}
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
40.8k
{
67
40.8k
  int i;
68
40.8k
  LIST(EL) *dup;
69
40.8k
70
40.8k
  if (!list)
71
0
    return NULL;
72
40.8k
73
40.8k
  
dup = 40.8k
FN40.8k
(LIST(EL),alloc)(
FN40.8k
(LIST(EL),get_ctx)(list), list->n);
74
40.8k
  if (!dup)
75
0
    return NULL;
76
202k
  
for (i = 0; 40.8k
i < list->n202k
;
++i162k
)
77
162k
    
dup = 162k
FN162k
(LIST(EL),add)(dup,
FN162k
(EL,copy)(list->p[i]));
78
40.8k
  return dup;
79
40.8k
}
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
39.8k
{
67
39.8k
  int i;
68
39.8k
  LIST(EL) *dup;
69
39.8k
70
39.8k
  if (!list)
71
0
    return NULL;
72
39.8k
73
39.8k
  
dup = 39.8k
FN39.8k
(LIST(EL),alloc)(
FN39.8k
(LIST(EL),get_ctx)(list), list->n);
74
39.8k
  if (!dup)
75
0
    return NULL;
76
200k
  
for (i = 0; 39.8k
i < list->n200k
;
++i160k
)
77
160k
    
dup = 160k
FN160k
(LIST(EL),add)(dup,
FN160k
(EL,copy)(list->p[i]));
78
39.8k
  return dup;
79
39.8k
}
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
683
{
67
683
  int i;
68
683
  LIST(EL) *dup;
69
683
70
683
  if (!list)
71
0
    return NULL;
72
683
73
683
  
dup = 683
FN683
(LIST(EL),alloc)(
FN683
(LIST(EL),get_ctx)(list), list->n);
74
683
  if (!dup)
75
0
    return NULL;
76
2.11k
  
for (i = 0; 683
i < list->n2.11k
;
++i1.42k
)
77
1.42k
    
dup = 1.42k
FN1.42k
(LIST(EL),add)(dup,
FN1.42k
(EL,copy)(list->p[i]));
78
683
  return dup;
79
683
}
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
631
  
for (i = 0; 283
i < list->n631
;
++i348
)
77
348
    
dup = 348
FN348
(LIST(EL),add)(dup,
FN348
(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
85.6k
{
83
85.6k
  if (!list)
84
0
    return NULL;
85
85.6k
86
85.6k
  
if (85.6k
list->ref == 185.6k
)
87
44.7k
    return list;
88
40.8k
  list->ref--;
89
40.8k
  return FN(LIST(EL),dup)(list);
90
85.6k
}
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
1.00k
{
83
1.00k
  if (!list)
84
0
    return NULL;
85
1.00k
86
1.00k
  
if (1.00k
list->ref == 11.00k
)
87
1.00k
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1.00k
}
isl_set_list_cow
Line
Count
Source
82
1.44k
{
83
1.44k
  if (!list)
84
0
    return NULL;
85
1.44k
86
1.44k
  
if (1.44k
list->ref == 11.44k
)
87
1.44k
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1.44k
}
isl_basic_set_list_cow
Line
Count
Source
82
2.39k
{
83
2.39k
  if (!list)
84
0
    return NULL;
85
2.39k
86
2.39k
  
if (2.39k
list->ref == 12.39k
)
87
2.39k
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
2.39k
}
isl_schedule_tree_list_cow
Line
Count
Source
82
75.6k
{
83
75.6k
  if (!list)
84
0
    return NULL;
85
75.6k
86
75.6k
  
if (75.6k
list->ref == 175.6k
)
87
35.7k
    return list;
88
39.8k
  list->ref--;
89
39.8k
  return FN(LIST(EL),dup)(list);
90
75.6k
}
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
55
{
83
55
  if (!list)
84
0
    return NULL;
85
55
86
55
  
if (55
list->ref == 155
)
87
55
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
55
}
isl_id_list_cow
Line
Count
Source
82
1
{
83
1
  if (!list)
84
0
    return NULL;
85
1
86
1
  
if (1
list->ref == 11
)
87
1
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
1
}
isl_constraint_list_cow
Line
Count
Source
82
2.16k
{
83
2.16k
  if (!list)
84
0
    return NULL;
85
2.16k
86
2.16k
  
if (2.16k
list->ref == 12.16k
)
87
1.47k
    return list;
88
683
  list->ref--;
89
683
  return FN(LIST(EL),dup)(list);
90
2.16k
}
Unexecuted instantiation: isl_band_list_cow
isl_ast_graft_list_cow
Line
Count
Source
82
41
{
83
41
  if (!list)
84
0
    return NULL;
85
41
86
41
  
if (41
list->ref == 141
)
87
41
    return list;
88
0
  list->ref--;
89
0
  return FN(LIST(EL),dup)(list);
90
41
}
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
2.89k
{
83
2.89k
  if (!list)
84
0
    return NULL;
85
2.89k
86
2.89k
  
if (2.89k
list->ref == 12.89k
)
87
2.61k
    return list;
88
283
  list->ref--;
89
283
  return FN(LIST(EL),dup)(list);
90
2.89k
}
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
279k
{
100
279k
  isl_ctx *ctx;
101
279k
  int i, new_size;
102
279k
  LIST(EL) *res;
103
279k
104
279k
  if (!list)
105
0
    return NULL;
106
279k
  
if (279k
list->ref == 1 && 279k
list->n + n <= list->size272k
)
107
261k
    return list;
108
279k
109
18.3k
  
ctx = 18.3k
FN18.3k
(LIST(EL),get_ctx)(list);
110
18.3k
  new_size = ((list->n + n + 1) * 3) / 2;
111
18.3k
  if (
list->ref == 118.3k
)
{10.9k
112
10.9k
    res = isl_realloc(ctx, list, LIST(EL),
113
10.9k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
10.9k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
10.9k
    res->size = new_size;
117
10.9k
    return res;
118
10.9k
  }
119
18.3k
120
7.42k
  
if (7.42k
list->n + n <= list->size && 7.42k
list->size < new_size1.60k
)
121
1.54k
    new_size = list->size;
122
7.42k
123
7.42k
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
7.42k
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
7.42k
127
19.3k
  
for (i = 0; 7.42k
i < list->n19.3k
;
++i11.9k
)
128
11.9k
    
res = 11.9k
FN11.9k
(LIST(EL),add)(res,
FN11.9k
(EL,copy)(list->p[i]));
129
7.42k
130
7.42k
  FN(LIST(EL),free)(list);
131
7.42k
  return res;
132
7.42k
}
isl_aff.c:isl_aff_list_grow
Line
Count
Source
99
5.79k
{
100
5.79k
  isl_ctx *ctx;
101
5.79k
  int i, new_size;
102
5.79k
  LIST(EL) *res;
103
5.79k
104
5.79k
  if (!list)
105
0
    return NULL;
106
5.79k
  
if (5.79k
list->ref == 1 && 5.79k
list->n + n <= list->size5.79k
)
107
5.77k
    return list;
108
5.79k
109
20
  
ctx = 20
FN20
(LIST(EL),get_ctx)(list);
110
20
  new_size = ((list->n + n + 1) * 3) / 2;
111
20
  if (
list->ref == 120
)
{20
112
20
    res = isl_realloc(ctx, list, LIST(EL),
113
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
20
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
20
    res->size = new_size;
117
20
    return res;
118
20
  }
119
20
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_set_list.c:isl_set_list_grow
Line
Count
Source
99
8.74k
{
100
8.74k
  isl_ctx *ctx;
101
8.74k
  int i, new_size;
102
8.74k
  LIST(EL) *res;
103
8.74k
104
8.74k
  if (!list)
105
0
    return NULL;
106
8.74k
  
if (8.74k
list->ref == 1 && 8.74k
list->n + n <= list->size8.74k
)
107
8.72k
    return list;
108
8.74k
109
20
  
ctx = 20
FN20
(LIST(EL),get_ctx)(list);
110
20
  new_size = ((list->n + n + 1) * 3) / 2;
111
20
  if (
list->ref == 120
)
{20
112
20
    res = isl_realloc(ctx, list, LIST(EL),
113
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
20
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
20
    res->size = new_size;
117
20
    return res;
118
20
  }
119
20
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_set_list.c:isl_basic_set_list_grow
Line
Count
Source
99
2.59k
{
100
2.59k
  isl_ctx *ctx;
101
2.59k
  int i, new_size;
102
2.59k
  LIST(EL) *res;
103
2.59k
104
2.59k
  if (!list)
105
0
    return NULL;
106
2.59k
  
if (2.59k
list->ref == 1 && 2.59k
list->n + n <= list->size2.59k
)
107
2.59k
    return list;
108
2.59k
109
2
  
ctx = 2
FN2
(LIST(EL),get_ctx)(list);
110
2
  new_size = ((list->n + n + 1) * 3) / 2;
111
2
  if (
list->ref == 12
)
{2
112
2
    res = isl_realloc(ctx, list, LIST(EL),
113
2
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
2
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
2
    res->size = new_size;
117
2
    return res;
118
2
  }
119
2
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_schedule_tree.c:isl_schedule_tree_list_grow
Line
Count
Source
99
209k
{
100
209k
  isl_ctx *ctx;
101
209k
  int i, new_size;
102
209k
  LIST(EL) *res;
103
209k
104
209k
  if (!list)
105
0
    return NULL;
106
209k
  
if (209k
list->ref == 1 && 209k
list->n + n <= list->size202k
)
107
196k
    return list;
108
209k
109
13.8k
  
ctx = 13.8k
FN13.8k
(LIST(EL),get_ctx)(list);
110
13.8k
  new_size = ((list->n + n + 1) * 3) / 2;
111
13.8k
  if (
list->ref == 113.8k
)
{6.44k
112
6.44k
    res = isl_realloc(ctx, list, LIST(EL),
113
6.44k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
6.44k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
6.44k
    res->size = new_size;
117
6.44k
    return res;
118
6.44k
  }
119
13.8k
120
7.42k
  
if (7.42k
list->n + n <= list->size && 7.42k
list->size < new_size1.60k
)
121
1.54k
    new_size = list->size;
122
7.42k
123
7.42k
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
7.42k
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
7.42k
127
19.3k
  
for (i = 0; 7.42k
i < list->n19.3k
;
++i11.9k
)
128
11.9k
    
res = 11.9k
FN11.9k
(LIST(EL),add)(res,
FN11.9k
(EL,copy)(list->p[i]));
129
7.42k
130
7.42k
  FN(LIST(EL),free)(list);
131
7.42k
  return res;
132
7.42k
}
isl_map_list.c:isl_union_map_list_grow
Line
Count
Source
99
5
{
100
5
  isl_ctx *ctx;
101
5
  int i, new_size;
102
5
  LIST(EL) *res;
103
5
104
5
  if (!list)
105
0
    return NULL;
106
5
  
if (5
list->ref == 1 && 5
list->n + n <= list->size5
)
107
4
    return list;
108
5
109
1
  
ctx = 1
FN1
(LIST(EL),get_ctx)(list);
110
1
  new_size = ((list->n + n + 1) * 3) / 2;
111
1
  if (
list->ref == 11
)
{1
112
1
    res = isl_realloc(ctx, list, LIST(EL),
113
1
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
1
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
1
    res->size = new_size;
117
1
    return res;
118
1
  }
119
1
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_map_list.c:isl_map_list_grow
Line
Count
Source
99
818
{
100
818
  isl_ctx *ctx;
101
818
  int i, new_size;
102
818
  LIST(EL) *res;
103
818
104
818
  if (!list)
105
0
    return NULL;
106
818
  
if (818
list->ref == 1 && 818
list->n + n <= list->size818
)
107
818
    return list;
108
818
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_map_list.c:isl_basic_map_list_grow
Line
Count
Source
99
14.2k
{
100
14.2k
  isl_ctx *ctx;
101
14.2k
  int i, new_size;
102
14.2k
  LIST(EL) *res;
103
14.2k
104
14.2k
  if (!list)
105
0
    return NULL;
106
14.2k
  
if (14.2k
list->ref == 1 && 14.2k
list->n + n <= list->size14.2k
)
107
14.2k
    return list;
108
14.2k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_id.c:isl_id_list_grow
Line
Count
Source
99
2.10k
{
100
2.10k
  isl_ctx *ctx;
101
2.10k
  int i, new_size;
102
2.10k
  LIST(EL) *res;
103
2.10k
104
2.10k
  if (!list)
105
0
    return NULL;
106
2.10k
  
if (2.10k
list->ref == 1 && 2.10k
list->n + n <= list->size2.10k
)
107
2.10k
    return list;
108
2.10k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_constraint.c:isl_constraint_list_grow
Line
Count
Source
99
3.57k
{
100
3.57k
  isl_ctx *ctx;
101
3.57k
  int i, new_size;
102
3.57k
  LIST(EL) *res;
103
3.57k
104
3.57k
  if (!list)
105
0
    return NULL;
106
3.57k
  
if (3.57k
list->ref == 1 && 3.57k
list->n + n <= list->size3.57k
)
107
3.57k
    return list;
108
3.57k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_val.c:isl_val_list_grow
Line
Count
Source
99
21
{
100
21
  isl_ctx *ctx;
101
21
  int i, new_size;
102
21
  LIST(EL) *res;
103
21
104
21
  if (!list)
105
0
    return NULL;
106
21
  
if (21
list->ref == 1 && 21
list->n + n <= list->size21
)
107
13
    return list;
108
21
109
8
  
ctx = 8
FN8
(LIST(EL),get_ctx)(list);
110
8
  new_size = ((list->n + n + 1) * 3) / 2;
111
8
  if (
list->ref == 18
)
{8
112
8
    res = isl_realloc(ctx, list, LIST(EL),
113
8
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
8
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
8
    res->size = new_size;
117
8
    return res;
118
8
  }
119
8
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_band.c:isl_band_list_grow
Line
Count
Source
99
18
{
100
18
  isl_ctx *ctx;
101
18
  int i, new_size;
102
18
  LIST(EL) *res;
103
18
104
18
  if (!list)
105
0
    return NULL;
106
18
  
if (18
list->ref == 1 && 18
list->n + n <= list->size18
)
107
18
    return list;
108
18
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_ast_graft.c:isl_ast_graft_list_grow
Line
Count
Source
99
10.1k
{
100
10.1k
  isl_ctx *ctx;
101
10.1k
  int i, new_size;
102
10.1k
  LIST(EL) *res;
103
10.1k
104
10.1k
  if (!list)
105
0
    return NULL;
106
10.1k
  
if (10.1k
list->ref == 1 && 10.1k
list->n + n <= list->size10.1k
)
107
10.1k
    return list;
108
10.1k
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_ast.c:isl_ast_node_list_grow
Line
Count
Source
99
3.60k
{
100
3.60k
  isl_ctx *ctx;
101
3.60k
  int i, new_size;
102
3.60k
  LIST(EL) *res;
103
3.60k
104
3.60k
  if (!list)
105
0
    return NULL;
106
3.60k
  
if (3.60k
list->ref == 1 && 3.60k
list->n + n <= list->size3.60k
)
107
3.57k
    return list;
108
3.60k
109
25
  
ctx = 25
FN25
(LIST(EL),get_ctx)(list);
110
25
  new_size = ((list->n + n + 1) * 3) / 2;
111
25
  if (
list->ref == 125
)
{25
112
25
    res = isl_realloc(ctx, list, LIST(EL),
113
25
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
25
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
25
    res->size = new_size;
117
25
    return res;
118
25
  }
119
25
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
0
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_grow
isl_aff.c:isl_union_pw_multi_aff_list_grow
Line
Count
Source
99
7
{
100
7
  isl_ctx *ctx;
101
7
  int i, new_size;
102
7
  LIST(EL) *res;
103
7
104
7
  if (!list)
105
0
    return NULL;
106
7
  
if (7
list->ref == 1 && 7
list->n + n <= list->size7
)
107
7
    return list;
108
7
109
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
110
0
  new_size = ((list->n + n + 1) * 3) / 2;
111
0
  if (
list->ref == 10
)
{0
112
0
    res = isl_realloc(ctx, list, LIST(EL),
113
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
0
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
0
    res->size = new_size;
117
0
    return res;
118
0
  }
119
0
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_aff.c:isl_union_pw_aff_list_grow
Line
Count
Source
99
27
{
100
27
  isl_ctx *ctx;
101
27
  int i, new_size;
102
27
  LIST(EL) *res;
103
27
104
27
  if (!list)
105
0
    return NULL;
106
27
  
if (27
list->ref == 1 && 27
list->n + n <= list->size27
)
107
12
    return list;
108
27
109
15
  
ctx = 15
FN15
(LIST(EL),get_ctx)(list);
110
15
  new_size = ((list->n + n + 1) * 3) / 2;
111
15
  if (
list->ref == 115
)
{15
112
15
    res = isl_realloc(ctx, list, LIST(EL),
113
15
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
15
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
15
    res->size = new_size;
117
15
    return res;
118
15
  }
119
15
120
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
121
0
    new_size = list->size;
122
0
123
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
124
0
  if (!res)
125
0
    
return 0
FN0
(LIST(EL),free)(list);
126
0
127
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
128
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
129
0
130
0
  FN(LIST(EL),free)(list);
131
0
  return res;
132
0
}
isl_aff.c:isl_pw_aff_list_grow
Line
Count
Source
99
16.4k
{
100
16.4k
  isl_ctx *ctx;
101
16.4k
  int i, new_size;
102
16.4k
  LIST(EL) *res;
103
16.4k
104
16.4k
  if (!list)
105
0
    return NULL;
106
16.4k
  
if (16.4k
list->ref == 1 && 16.4k
list->n + n <= list->size16.4k
)
107
12.2k
    return list;
108
16.4k
109
4.19k
  
ctx = 4.19k
FN4.19k
(LIST(EL),get_ctx)(list);
110
4.19k
  new_size = ((list->n + n + 1) * 3) / 2;
111
4.19k
  if (
list->ref == 14.19k
)
{4.19k
112
4.19k
    res = isl_realloc(ctx, list, LIST(EL),
113
4.19k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
4.19k
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
4.19k
    res->size = new_size;
117
4.19k
    return res;
118
4.19k
  }
119
4.19k
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
0
}
isl_set_list.c:isl_union_set_list_grow
Line
Count
Source
99
1.49k
{
100
1.49k
  isl_ctx *ctx;
101
1.49k
  int i, new_size;
102
1.49k
  LIST(EL) *res;
103
1.49k
104
1.49k
  if (!list)
105
0
    return NULL;
106
1.49k
  
if (1.49k
list->ref == 1 && 1.49k
list->n + n <= list->size1.49k
)
107
1.32k
    return list;
108
1.49k
109
167
  
ctx = 167
FN167
(LIST(EL),get_ctx)(list);
110
167
  new_size = ((list->n + n + 1) * 3) / 2;
111
167
  if (
list->ref == 1167
)
{167
112
167
    res = isl_realloc(ctx, list, LIST(EL),
113
167
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
114
167
    if (!res)
115
0
      
return 0
FN0
(LIST(EL),free)(list);
116
167
    res->size = new_size;
117
167
    return res;
118
167
  }
119
167
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
0
}
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
530k
{
138
530k
  if (!list)
139
0
    return isl_stat_error;
140
530k
  
if (530k
index < 0 || 530k
index >= list->n530k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
530k
      "index out of bounds", return isl_stat_error);
143
530k
  return isl_stat_ok;
144
530k
}
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.14k
{
138
2.14k
  if (!list)
139
0
    return isl_stat_error;
140
2.14k
  
if (2.14k
index < 0 || 2.14k
index >= list->n2.14k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
2.14k
      "index out of bounds", return isl_stat_error);
143
2.14k
  return isl_stat_ok;
144
2.14k
}
isl_set_list.c:isl_set_list_check_index
Line
Count
Source
137
13.4k
{
138
13.4k
  if (!list)
139
0
    return isl_stat_error;
140
13.4k
  
if (13.4k
index < 0 || 13.4k
index >= list->n13.4k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
13.4k
      "index out of bounds", return isl_stat_error);
143
13.4k
  return isl_stat_ok;
144
13.4k
}
isl_set_list.c:isl_basic_set_list_check_index
Line
Count
Source
137
9.44k
{
138
9.44k
  if (!list)
139
0
    return isl_stat_error;
140
9.44k
  
if (9.44k
index < 0 || 9.44k
index >= list->n9.44k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
9.44k
      "index out of bounds", return isl_stat_error);
143
9.44k
  return isl_stat_ok;
144
9.44k
}
isl_schedule_tree.c:isl_schedule_tree_list_check_index
Line
Count
Source
137
435k
{
138
435k
  if (!list)
139
0
    return isl_stat_error;
140
435k
  
if (435k
index < 0 || 435k
index >= list->n435k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
435k
      "index out of bounds", return isl_stat_error);
143
435k
  return isl_stat_ok;
144
435k
}
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.03k
{
138
1.03k
  if (!list)
139
0
    return isl_stat_error;
140
1.03k
  
if (1.03k
index < 0 || 1.03k
index >= list->n1.03k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
1.03k
      "index out of bounds", return isl_stat_error);
143
1.03k
  return isl_stat_ok;
144
1.03k
}
isl_map_list.c:isl_basic_map_list_check_index
Line
Count
Source
137
9.75k
{
138
9.75k
  if (!list)
139
0
    return isl_stat_error;
140
9.75k
  
if (9.75k
index < 0 || 9.75k
index >= list->n9.75k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
9.75k
      "index out of bounds", return isl_stat_error);
143
9.75k
  return isl_stat_ok;
144
9.75k
}
isl_id.c:isl_id_list_check_index
Line
Count
Source
137
11.2k
{
138
11.2k
  if (!list)
139
0
    return isl_stat_error;
140
11.2k
  
if (11.2k
index < 0 || 11.2k
index >= list->n11.2k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
11.2k
      "index out of bounds", return isl_stat_error);
143
11.2k
  return isl_stat_ok;
144
11.2k
}
isl_constraint.c:isl_constraint_list_check_index
Line
Count
Source
137
2.07k
{
138
2.07k
  if (!list)
139
0
    return isl_stat_error;
140
2.07k
  
if (2.07k
index < 0 || 2.07k
index >= list->n2.07k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
2.07k
      "index out of bounds", return isl_stat_error);
143
2.07k
  return isl_stat_ok;
144
2.07k
}
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
23.6k
{
138
23.6k
  if (!list)
139
0
    return isl_stat_error;
140
23.6k
  
if (23.6k
index < 0 || 23.6k
index >= list->n23.6k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
23.6k
      "index out of bounds", return isl_stat_error);
143
23.6k
  return isl_stat_ok;
144
23.6k
}
isl_ast.c:isl_ast_node_list_check_index
Line
Count
Source
137
2.72k
{
138
2.72k
  if (!list)
139
0
    return isl_stat_error;
140
2.72k
  
if (2.72k
index < 0 || 2.72k
index >= list->n2.72k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
2.72k
      "index out of bounds", return isl_stat_error);
143
2.72k
  return isl_stat_ok;
144
2.72k
}
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
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_aff.c:isl_aff_list_check_index
Line
Count
Source
137
6.01k
{
138
6.01k
  if (!list)
139
0
    return isl_stat_error;
140
6.01k
  
if (6.01k
index < 0 || 6.01k
index >= list->n6.01k
)
141
0
    isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
142
6.01k
      "index out of bounds", return isl_stat_error);
143
6.01k
  return isl_stat_ok;
144
6.01k
}
145
146
__isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
147
  __isl_take struct EL *el)
148
279k
{
149
279k
  list = FN(LIST(EL),grow)(list, 1);
150
279k
  if (
!list || 279k
!el279k
)
151
0
    goto error;
152
279k
  list->p[list->n] = el;
153
279k
  list->n++;
154
279k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
279k
}
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.49k
{
149
1.49k
  list = FN(LIST(EL),grow)(list, 1);
150
1.49k
  if (
!list || 1.49k
!el1.49k
)
151
0
    goto error;
152
1.49k
  list->p[list->n] = el;
153
1.49k
  list->n++;
154
1.49k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
1.49k
}
isl_set_list_add
Line
Count
Source
148
8.74k
{
149
8.74k
  list = FN(LIST(EL),grow)(list, 1);
150
8.74k
  if (
!list || 8.74k
!el8.74k
)
151
0
    goto error;
152
8.74k
  list->p[list->n] = el;
153
8.74k
  list->n++;
154
8.74k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
8.74k
}
isl_basic_set_list_add
Line
Count
Source
148
2.59k
{
149
2.59k
  list = FN(LIST(EL),grow)(list, 1);
150
2.59k
  if (
!list || 2.59k
!el2.59k
)
151
0
    goto error;
152
2.59k
  list->p[list->n] = el;
153
2.59k
  list->n++;
154
2.59k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
2.59k
}
isl_schedule_tree_list_add
Line
Count
Source
148
209k
{
149
209k
  list = FN(LIST(EL),grow)(list, 1);
150
209k
  if (
!list || 209k
!el209k
)
151
0
    goto error;
152
209k
  list->p[list->n] = el;
153
209k
  list->n++;
154
209k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
209k
}
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
818
{
149
818
  list = FN(LIST(EL),grow)(list, 1);
150
818
  if (
!list || 818
!el818
)
151
0
    goto error;
152
818
  list->p[list->n] = el;
153
818
  list->n++;
154
818
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
818
}
isl_basic_map_list_add
Line
Count
Source
148
14.2k
{
149
14.2k
  list = FN(LIST(EL),grow)(list, 1);
150
14.2k
  if (
!list || 14.2k
!el14.2k
)
151
0
    goto error;
152
14.2k
  list->p[list->n] = el;
153
14.2k
  list->n++;
154
14.2k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
14.2k
}
isl_id_list_add
Line
Count
Source
148
2.10k
{
149
2.10k
  list = FN(LIST(EL),grow)(list, 1);
150
2.10k
  if (
!list || 2.10k
!el2.10k
)
151
0
    goto error;
152
2.10k
  list->p[list->n] = el;
153
2.10k
  list->n++;
154
2.10k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
2.10k
}
isl_constraint_list_add
Line
Count
Source
148
3.57k
{
149
3.57k
  list = FN(LIST(EL),grow)(list, 1);
150
3.57k
  if (
!list || 3.57k
!el3.57k
)
151
0
    goto error;
152
3.57k
  list->p[list->n] = el;
153
3.57k
  list->n++;
154
3.57k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
3.57k
}
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
10.1k
{
149
10.1k
  list = FN(LIST(EL),grow)(list, 1);
150
10.1k
  if (
!list || 10.1k
!el10.1k
)
151
0
    goto error;
152
10.1k
  list->p[list->n] = el;
153
10.1k
  list->n++;
154
10.1k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
10.1k
}
isl_ast_node_list_add
Line
Count
Source
148
3.60k
{
149
3.60k
  list = FN(LIST(EL),grow)(list, 1);
150
3.60k
  if (
!list || 3.60k
!el3.60k
)
151
0
    goto error;
152
3.60k
  list->p[list->n] = el;
153
3.60k
  list->n++;
154
3.60k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
3.60k
}
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
16.4k
{
149
16.4k
  list = FN(LIST(EL),grow)(list, 1);
150
16.4k
  if (
!list || 16.4k
!el16.4k
)
151
0
    goto error;
152
16.4k
  list->p[list->n] = el;
153
16.4k
  list->n++;
154
16.4k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
16.4k
}
isl_aff_list_add
Line
Count
Source
148
5.79k
{
149
5.79k
  list = FN(LIST(EL),grow)(list, 1);
150
5.79k
  if (
!list || 5.79k
!el5.79k
)
151
0
    goto error;
152
5.79k
  list->p[list->n] = el;
153
5.79k
  list->n++;
154
5.79k
  return list;
155
0
error:
156
0
  FN(EL,free)(el);
157
0
  FN(LIST(EL),free)(list);
158
0
  return NULL;
159
5.79k
}
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
58.7k
{
166
58.7k
  int i;
167
58.7k
168
58.7k
  if (!list)
169
0
    return NULL;
170
58.7k
  
if (58.7k
first + n > list->n || 58.7k
first + n < first58.7k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
58.7k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
58.7k
  
if (58.7k
n == 058.7k
)
174
640
    return list;
175
58.0k
  
list = 58.0k
FN58.0k
(LIST(EL),cow)(list);
176
58.0k
  if (!list)
177
0
    return NULL;
178
175k
  
for (i = 0; 58.0k
i < n175k
;
++i117k
)
179
117k
    
FN117k
(EL,free)(list->p[first + i])117k
;
180
59.6k
  for (i = first; 
i + n < list->n59.6k
;
++i1.58k
)
181
1.58k
    list->p[i] = list->p[i + n];
182
58.0k
  list->n -= n;
183
58.0k
  return list;
184
58.0k
}
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.04k
{
166
2.04k
  int i;
167
2.04k
168
2.04k
  if (!list)
169
0
    return NULL;
170
2.04k
  
if (2.04k
first + n > list->n || 2.04k
first + n < first2.04k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
2.04k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
2.04k
  
if (2.04k
n == 02.04k
)
174
640
    return list;
175
1.40k
  
list = 1.40k
FN1.40k
(LIST(EL),cow)(list);
176
1.40k
  if (!list)
177
0
    return NULL;
178
2.88k
  
for (i = 0; 1.40k
i < n2.88k
;
++i1.47k
)
179
1.47k
    
FN1.47k
(EL,free)(list->p[first + i])1.47k
;
180
2.23k
  for (i = first; 
i + n < list->n2.23k
;
++i826
)
181
826
    list->p[i] = list->p[i + n];
182
1.40k
  list->n -= n;
183
1.40k
  return list;
184
1.40k
}
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
55.6k
{
166
55.6k
  int i;
167
55.6k
168
55.6k
  if (!list)
169
0
    return NULL;
170
55.6k
  
if (55.6k
first + n > list->n || 55.6k
first + n < first55.6k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
55.6k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
55.6k
  
if (55.6k
n == 055.6k
)
174
0
    return list;
175
55.6k
  
list = 55.6k
FN55.6k
(LIST(EL),cow)(list);
176
55.6k
  if (!list)
177
0
    return NULL;
178
170k
  
for (i = 0; 55.6k
i < n170k
;
++i115k
)
179
115k
    
FN115k
(EL,free)(list->p[first + i])115k
;
180
56.4k
  for (i = first; 
i + n < list->n56.4k
;
++i760
)
181
760
    list->p[i] = list->p[i + n];
182
55.6k
  list->n -= n;
183
55.6k
  return list;
184
55.6k
}
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
1.00k
{
166
1.00k
  int i;
167
1.00k
168
1.00k
  if (!list)
169
0
    return NULL;
170
1.00k
  
if (1.00k
first + n > list->n || 1.00k
first + n < first1.00k
)
171
0
    isl_die(list->ctx, isl_error_invalid,
172
1.00k
      "index out of bounds", return FN(LIST(EL),free)(list));
173
1.00k
  
if (1.00k
n == 01.00k
)
174
0
    return list;
175
1.00k
  
list = 1.00k
FN1.00k
(LIST(EL),cow)(list);
176
1.00k
  if (!list)
177
0
    return NULL;
178
2.01k
  
for (i = 0; 1.00k
i < n2.01k
;
++i1.00k
)
179
1.00k
    
FN1.00k
(EL,free)(list->p[first + i])1.00k
;
180
1.00k
  for (i = first; 
i + n < list->n1.00k
;
++i0
)
181
0
    list->p[i] = list->p[i + n];
182
1.00k
  list->n -= n;
183
1.00k
  return list;
184
1.00k
}
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
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->n20
)
{1
208
2
    for (i = list->n; 
i > pos2
;
--i1
)
209
1
      list->p[i] = list->p[i - 1];
210
1
    list->n++;
211
1
    list->p[pos] = el;
212
1
    return list;
213
1
  }
214
23
215
22
  
res = 22
FN22
(LIST(EL),alloc)(ctx, list->n + 1);
216
50
  for (i = 0; 
i < pos50
;
++i28
)
217
28
    
res = 28
FN28
(LIST(EL),add)(res,
FN28
(EL,copy)(list->p[i]));
218
22
  res = FN(LIST(EL),add)(res, el);
219
24
  for (i = pos; 
i < list->n24
;
++i2
)
220
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list->p[i]));
221
22
  FN(LIST(EL),free)(list);
222
22
223
22
  return res;
224
0
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
0
  return NULL;
228
23
}
isl_id_list_insert
Line
Count
Source
195
4
{
196
4
  int i;
197
4
  isl_ctx *ctx;
198
4
  LIST(EL) *res;
199
4
200
4
  if (
!list || 4
!el4
)
201
0
    goto error;
202
4
  
ctx = 4
FN4
(LIST(EL),get_ctx)(list);
203
4
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
4
      "index out of bounds", goto error);
206
4
207
4
  
if (4
list->ref == 1 && 4
list->size > list->n1
)
{1
208
2
    for (i = list->n; 
i > pos2
;
--i1
)
209
1
      list->p[i] = list->p[i - 1];
210
1
    list->n++;
211
1
    list->p[pos] = el;
212
1
    return list;
213
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
19
{
196
19
  int i;
197
19
  isl_ctx *ctx;
198
19
  LIST(EL) *res;
199
19
200
19
  if (
!list || 19
!el19
)
201
0
    goto error;
202
19
  
ctx = 19
FN19
(LIST(EL),get_ctx)(list);
203
19
  if (pos > list->n)
204
0
    isl_die(ctx, isl_error_invalid,
205
19
      "index out of bounds", goto error);
206
19
207
19
  
if (19
list->ref == 1 && 19
list->size > list->n19
)
{0
208
0
    for (i = list->n; 
i > pos0
;
--i0
)
209
0
      list->p[i] = list->p[i - 1];
210
0
    list->n++;
211
0
    list->p[pos] = el;
212
0
    return list;
213
0
  }
214
19
215
19
  
res = 19
FN19
(LIST(EL),alloc)(ctx, list->n + 1);
216
44
  for (i = 0; 
i < pos44
;
++i25
)
217
25
    
res = 25
FN25
(LIST(EL),add)(res,
FN25
(EL,copy)(list->p[i]));
218
19
  res = FN(LIST(EL),add)(res, el);
219
21
  for (i = pos; 
i < list->n21
;
++i2
)
220
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list->p[i]));
221
19
  FN(LIST(EL),free)(list);
222
19
223
19
  return res;
224
0
error:
225
0
  FN(EL,free)(el);
226
0
  FN(LIST(EL),free)(list);
227
0
  return NULL;
228
19
}
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
187k
{
232
187k
  int i;
233
187k
234
187k
  if (!list)
235
30.6k
    return NULL;
236
187k
237
156k
  
if (156k
--list->ref > 0156k
)
238
41.9k
    return NULL;
239
156k
240
115k
  isl_ctx_deref(list->ctx);
241
276k
  for (i = 0; 
i < list->n276k
;
++i161k
)
242
161k
    
FN161k
(EL,free)(list->p[i])161k
;
243
115k
  free(list);
244
115k
245
115k
  return NULL;
246
156k
}
isl_union_set_list_free
Line
Count
Source
231
399
{
232
399
  int i;
233
399
234
399
  if (!list)
235
0
    return NULL;
236
399
237
399
  
if (399
--list->ref > 0399
)
238
0
    return NULL;
239
399
240
399
  isl_ctx_deref(list->ctx);
241
886
  for (i = 0; 
i < list->n886
;
++i487
)
242
487
    
FN487
(EL,free)(list->p[i])487
;
243
399
  free(list);
244
399
245
399
  return NULL;
246
399
}
isl_aff_list_free
Line
Count
Source
231
10.9k
{
232
10.9k
  int i;
233
10.9k
234
10.9k
  if (!list)
235
5.14k
    return NULL;
236
10.9k
237
5.81k
  
if (5.81k
--list->ref > 05.81k
)
238
0
    return NULL;
239
5.81k
240
5.81k
  isl_ctx_deref(list->ctx);
241
11.6k
  for (i = 0; 
i < list->n11.6k
;
++i5.79k
)
242
5.79k
    
FN5.79k
(EL,free)(list->p[i])5.79k
;
243
5.81k
  free(list);
244
5.81k
245
5.81k
  return NULL;
246
5.81k
}
isl_pw_aff_list_free
Line
Count
Source
231
24.2k
{
232
24.2k
  int i;
233
24.2k
234
24.2k
  if (!list)
235
3
    return NULL;
236
24.2k
237
24.2k
  
if (24.2k
--list->ref > 024.2k
)
238
10.1k
    return NULL;
239
24.2k
240
14.1k
  isl_ctx_deref(list->ctx);
241
30.5k
  for (i = 0; 
i < list->n30.5k
;
++i16.4k
)
242
16.4k
    
FN16.4k
(EL,free)(list->p[i])16.4k
;
243
14.1k
  free(list);
244
14.1k
245
14.1k
  return NULL;
246
24.2k
}
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
2.92k
{
232
2.92k
  int i;
233
2.92k
234
2.92k
  if (!list)
235
0
    return NULL;
236
2.92k
237
2.92k
  
if (2.92k
--list->ref > 02.92k
)
238
174
    return NULL;
239
2.92k
240
2.75k
  isl_ctx_deref(list->ctx);
241
6.35k
  for (i = 0; 
i < list->n6.35k
;
++i3.60k
)
242
3.60k
    
FN3.60k
(EL,free)(list->p[i])3.60k
;
243
2.75k
  free(list);
244
2.75k
245
2.75k
  return NULL;
246
2.92k
}
isl_ast_graft_list_free
Line
Count
Source
231
11.3k
{
232
11.3k
  int i;
233
11.3k
234
11.3k
  if (!list)
235
0
    return NULL;
236
11.3k
237
11.3k
  
if (11.3k
--list->ref > 011.3k
)
238
0
    return NULL;
239
11.3k
240
11.3k
  isl_ctx_deref(list->ctx);
241
21.4k
  for (i = 0; 
i < list->n21.4k
;
++i10.1k
)
242
10.1k
    
FN10.1k
(EL,free)(list->p[i])10.1k
;
243
11.3k
  free(list);
244
11.3k
245
11.3k
  return NULL;
246
11.3k
}
isl_band_list_free
Line
Count
Source
231
5.36k
{
232
5.36k
  int i;
233
5.36k
234
5.36k
  if (!list)
235
5.34k
    return NULL;
236
5.36k
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
16
}
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
23.5k
{
232
23.5k
  int i;
233
23.5k
234
23.5k
  if (!list)
235
0
    return NULL;
236
23.5k
237
23.5k
  
if (23.5k
--list->ref > 023.5k
)
238
21.7k
    return NULL;
239
23.5k
240
1.79k
  isl_ctx_deref(list->ctx);
241
3.89k
  for (i = 0; 
i < list->n3.89k
;
++i2.10k
)
242
2.10k
    
FN2.10k
(EL,free)(list->p[i])2.10k
;
243
1.79k
  free(list);
244
1.79k
245
1.79k
  return NULL;
246
23.5k
}
isl_basic_map_list_free
Line
Count
Source
231
2.03k
{
232
2.03k
  int i;
233
2.03k
234
2.03k
  if (!list)
235
0
    return NULL;
236
2.03k
237
2.03k
  
if (2.03k
--list->ref > 02.03k
)
238
0
    return NULL;
239
2.03k
240
2.03k
  isl_ctx_deref(list->ctx);
241
13.9k
  for (i = 0; 
i < list->n13.9k
;
++i11.9k
)
242
11.9k
    
FN11.9k
(EL,free)(list->p[i])11.9k
;
243
2.03k
  free(list);
244
2.03k
245
2.03k
  return NULL;
246
2.03k
}
isl_map_list_free
Line
Count
Source
231
456
{
232
456
  int i;
233
456
234
456
  if (!list)
235
0
    return NULL;
236
456
237
456
  
if (456
--list->ref > 0456
)
238
0
    return NULL;
239
456
240
456
  isl_ctx_deref(list->ctx);
241
1.52k
  for (i = 0; 
i < list->n1.52k
;
++i1.06k
)
242
1.06k
    
FN1.06k
(EL,free)(list->p[i])1.06k
;
243
456
  free(list);
244
456
245
456
  return NULL;
246
456
}
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
88.4k
{
232
88.4k
  int i;
233
88.4k
234
88.4k
  if (!list)
235
14.9k
    return NULL;
236
88.4k
237
73.4k
  
if (73.4k
--list->ref > 073.4k
)
238
9.88k
    return NULL;
239
73.4k
240
63.5k
  isl_ctx_deref(list->ctx);
241
158k
  for (i = 0; 
i < list->n158k
;
++i94.6k
)
242
94.6k
    
FN94.6k
(EL,free)(list->p[i])94.6k
;
243
63.5k
  free(list);
244
63.5k
245
63.5k
  return NULL;
246
73.4k
}
isl_basic_set_list_free
Line
Count
Source
231
2.90k
{
232
2.90k
  int i;
233
2.90k
234
2.90k
  if (!list)
235
0
    return NULL;
236
2.90k
237
2.90k
  
if (2.90k
--list->ref > 02.90k
)
238
13
    return NULL;
239
2.90k
240
2.89k
  isl_ctx_deref(list->ctx);
241
7.80k
  for (i = 0; 
i < list->n7.80k
;
++i4.91k
)
242
4.91k
    
FN4.91k
(EL,free)(list->p[i])4.91k
;
243
2.89k
  free(list);
244
2.89k
245
2.89k
  return NULL;
246
2.90k
}
isl_set_list_free
Line
Count
Source
231
12.6k
{
232
12.6k
  int i;
233
12.6k
234
12.6k
  if (!list)
235
5.14k
    return NULL;
236
12.6k
237
7.51k
  
if (7.51k
--list->ref > 07.51k
)
238
0
    return NULL;
239
7.51k
240
7.51k
  isl_ctx_deref(list->ctx);
241
16.0k
  for (i = 0; 
i < list->n16.0k
;
++i8.49k
)
242
8.49k
    
FN8.49k
(EL,free)(list->p[i])8.49k
;
243
7.51k
  free(list);
244
7.51k
245
7.51k
  return NULL;
246
7.51k
}
isl_constraint_list_free
Line
Count
Source
231
2.29k
{
232
2.29k
  int i;
233
2.29k
234
2.29k
  if (!list)
235
0
    return NULL;
236
2.29k
237
2.29k
  
if (2.29k
--list->ref > 02.29k
)
238
0
    return NULL;
239
2.29k
240
2.29k
  isl_ctx_deref(list->ctx);
241
4.39k
  for (i = 0; 
i < list->n4.39k
;
++i2.09k
)
242
2.09k
    
FN2.09k
(EL,free)(list->p[i])2.09k
;
243
2.29k
  free(list);
244
2.29k
245
2.29k
  return NULL;
246
2.29k
}
247
248
int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
249
784k
{
250
772k
  return list ? 
list->n772k
:
012.3k
;
251
784k
}
isl_aff_list_n_aff
Line
Count
Source
249
881
{
250
881
  return list ? 
list->n881
:
00
;
251
881
}
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.05k
{
250
2.05k
  return list ? 
list->n2.05k
:
00
;
251
2.05k
}
isl_set_list_n_set
Line
Count
Source
249
5.17k
{
250
5.17k
  return list ? 
list->n5.17k
:
00
;
251
5.17k
}
isl_basic_set_list_n_basic_set
Line
Count
Source
249
4.55k
{
250
4.55k
  return list ? 
list->n4.55k
:
00
;
251
4.55k
}
isl_schedule_tree_list_n_schedule_tree
Line
Count
Source
249
731k
{
250
718k
  return list ? 
list->n718k
:
012.3k
;
251
731k
}
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
445
{
250
445
  return list ? 
list->n445
:
00
;
251
445
}
isl_basic_map_list_n_basic_map
Line
Count
Source
249
1.78k
{
250
1.78k
  return list ? 
list->n1.78k
:
00
;
251
1.78k
}
isl_id_list_n_id
Line
Count
Source
249
1.04k
{
250
1.04k
  return list ? 
list->n1.04k
:
00
;
251
1.04k
}
isl_constraint_list_n_constraint
Line
Count
Source
249
3.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
16.5k
{
250
16.5k
  return list ? 
list->n16.5k
:
00
;
251
16.5k
}
isl_ast_node_list_n_ast_node
Line
Count
Source
249
3.04k
{
250
3.04k
  return list ? 
list->n3.04k
:
00
;
251
3.04k
}
Unexecuted instantiation: isl_ast_expr_list_n_ast_expr
isl_union_pw_multi_aff_list_n_union_pw_multi_aff
Line
Count
Source
249
7
{
250
7
  return list ? 
list->n7
:
00
;
251
7
}
isl_union_pw_aff_list_n_union_pw_aff
Line
Count
Source
249
15
{
250
15
  return list ? 
list->n15
:
00
;
251
15
}
isl_pw_aff_list_n_pw_aff
Line
Count
Source
249
14.4k
{
250
14.4k
  return list ? 
list->n14.4k
:
00
;
251
14.4k
}
252
253
__isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
254
496k
{
255
496k
  if (
FN496k
(LIST(EL),check_index)(list, index) < 0496k
)
256
0
    return NULL;
257
496k
  
return 496k
FN496k
(EL,copy)(list->p[index]);
258
496k
}
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
10.8k
{
255
10.8k
  if (
FN10.8k
(LIST(EL),check_index)(list, index) < 010.8k
)
256
0
    return NULL;
257
10.8k
  
return 10.8k
FN10.8k
(EL,copy)(list->p[index]);
258
10.8k
}
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
2.72k
{
255
2.72k
  if (
FN2.72k
(LIST(EL),check_index)(list, index) < 02.72k
)
256
0
    return NULL;
257
2.72k
  
return 2.72k
FN2.72k
(EL,copy)(list->p[index]);
258
2.72k
}
isl_ast_graft_list_get_ast_graft
Line
Count
Source
254
19.6k
{
255
19.6k
  if (
FN19.6k
(LIST(EL),check_index)(list, index) < 019.6k
)
256
0
    return NULL;
257
19.6k
  
return 19.6k
FN19.6k
(EL,copy)(list->p[index]);
258
19.6k
}
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.07k
{
255
2.07k
  if (
FN2.07k
(LIST(EL),check_index)(list, index) < 02.07k
)
256
0
    return NULL;
257
2.07k
  
return 2.07k
FN2.07k
(EL,copy)(list->p[index]);
258
2.07k
}
isl_id_list_get_id
Line
Count
Source
254
11.2k
{
255
11.2k
  if (
FN11.2k
(LIST(EL),check_index)(list, index) < 011.2k
)
256
0
    return NULL;
257
11.2k
  
return 11.2k
FN11.2k
(EL,copy)(list->p[index]);
258
11.2k
}
isl_basic_map_list_get_basic_map
Line
Count
Source
254
7.42k
{
255
7.42k
  if (
FN7.42k
(LIST(EL),check_index)(list, index) < 07.42k
)
256
0
    return NULL;
257
7.42k
  
return 7.42k
FN7.42k
(EL,copy)(list->p[index]);
258
7.42k
}
isl_map_list_get_map
Line
Count
Source
254
1.03k
{
255
1.03k
  if (
FN1.03k
(LIST(EL),check_index)(list, index) < 01.03k
)
256
0
    return NULL;
257
1.03k
  
return 1.03k
FN1.03k
(EL,copy)(list->p[index]);
258
1.03k
}
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
415k
{
255
415k
  if (
FN415k
(LIST(EL),check_index)(list, index) < 0415k
)
256
0
    return NULL;
257
415k
  
return 415k
FN415k
(EL,copy)(list->p[index]);
258
415k
}
isl_basic_set_list_get_basic_set
Line
Count
Source
254
6.99k
{
255
6.99k
  if (
FN6.99k
(LIST(EL),check_index)(list, index) < 06.99k
)
256
0
    return NULL;
257
6.99k
  
return 6.99k
FN6.99k
(EL,copy)(list->p[index]);
258
6.99k
}
isl_set_list_get_set
Line
Count
Source
254
11.0k
{
255
11.0k
  if (
FN11.0k
(LIST(EL),check_index)(list, index) < 011.0k
)
256
0
    return NULL;
257
11.0k
  
return 11.0k
FN11.0k
(EL,copy)(list->p[index]);
258
11.0k
}
isl_union_set_list_get_union_set
Line
Count
Source
254
2.14k
{
255
2.14k
  if (
FN2.14k
(LIST(EL),check_index)(list, index) < 02.14k
)
256
0
    return NULL;
257
2.14k
  
return 2.14k
FN2.14k
(EL,copy)(list->p[index]);
258
2.14k
}
isl_aff_list_get_aff
Line
Count
Source
254
6.01k
{
255
6.01k
  if (
FN6.01k
(LIST(EL),check_index)(list, index) < 06.01k
)
256
0
    return NULL;
257
6.01k
  
return 6.01k
FN6.01k
(EL,copy)(list->p[index]);
258
6.01k
}
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
33.9k
{
265
33.9k
  if (
!list || 33.9k
!el33.9k
)
266
1
    goto error;
267
33.9k
  
if (33.9k
FN33.9k
(LIST(EL),check_index)(list, index) < 033.9k
)
268
0
    goto error;
269
33.9k
  
if (33.9k
list->p[index] == el33.9k
)
{7.24k
270
7.24k
    FN(EL,free)(el);
271
7.24k
    return list;
272
7.24k
  }
273
26.7k
  
list = 26.7k
FN26.7k
(LIST(EL),cow)(list);
274
26.7k
  if (!list)
275
0
    goto error;
276
26.7k
  
FN26.7k
(EL,free)(list->p[index]);26.7k
277
26.7k
  list->p[index] = el;
278
26.7k
  return list;
279
1
error:
280
1
  FN(EL,free)(el);
281
1
  FN(LIST(EL),free)(list);
282
1
  return NULL;
283
26.7k
}
isl_pw_aff_list_set_pw_aff
Line
Count
Source
264
2.83k
{
265
2.83k
  if (
!list || 2.83k
!el2.83k
)
266
0
    goto error;
267
2.83k
  
if (2.83k
FN2.83k
(LIST(EL),check_index)(list, index) < 02.83k
)
268
0
    goto error;
269
2.83k
  
if (2.83k
list->p[index] == el2.83k
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
0
  }
273
2.83k
  
list = 2.83k
FN2.83k
(LIST(EL),cow)(list);
274
2.83k
  if (!list)
275
0
    goto error;
276
2.83k
  
FN2.83k
(EL,free)(list->p[index]);2.83k
277
2.83k
  list->p[index] = el;
278
2.83k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
2.83k
}
Unexecuted instantiation: isl_val_list_set_val
Unexecuted instantiation: isl_union_set_list_set_union_set
isl_set_list_set_set
Line
Count
Source
264
2.44k
{
265
2.44k
  if (
!list || 2.44k
!el2.44k
)
266
1
    goto error;
267
2.44k
  
if (2.44k
FN2.44k
(LIST(EL),check_index)(list, index) < 02.44k
)
268
0
    goto error;
269
2.44k
  
if (2.44k
list->p[index] == el2.44k
)
{995
270
995
    FN(EL,free)(el);
271
995
    return list;
272
995
  }
273
1.44k
  
list = 1.44k
FN1.44k
(LIST(EL),cow)(list);
274
1.44k
  if (!list)
275
0
    goto error;
276
1.44k
  
FN1.44k
(EL,free)(list->p[index]);1.44k
277
1.44k
  list->p[index] = el;
278
1.44k
  return list;
279
1
error:
280
1
  FN(EL,free)(el);
281
1
  FN(LIST(EL),free)(list);
282
1
  return NULL;
283
1.44k
}
isl_basic_set_list_set_basic_set
Line
Count
Source
264
2.38k
{
265
2.38k
  if (
!list || 2.38k
!el2.38k
)
266
0
    goto error;
267
2.38k
  
if (2.38k
FN2.38k
(LIST(EL),check_index)(list, index) < 02.38k
)
268
0
    goto error;
269
2.38k
  
if (2.38k
list->p[index] == el2.38k
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
0
  }
273
2.38k
  
list = 2.38k
FN2.38k
(LIST(EL),cow)(list);
274
2.38k
  if (!list)
275
0
    goto error;
276
2.38k
  
FN2.38k
(EL,free)(list->p[index]);2.38k
277
2.38k
  list->p[index] = el;
278
2.38k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
2.38k
}
isl_schedule_tree_list_set_schedule_tree
Line
Count
Source
264
19.9k
{
265
19.9k
  if (
!list || 19.9k
!el19.9k
)
266
0
    goto error;
267
19.9k
  
if (19.9k
FN19.9k
(LIST(EL),check_index)(list, index) < 019.9k
)
268
0
    goto error;
269
19.9k
  
if (19.9k
list->p[index] == el19.9k
)
{3
270
3
    FN(EL,free)(el);
271
3
    return list;
272
3
  }
273
19.9k
  
list = 19.9k
FN19.9k
(LIST(EL),cow)(list);
274
19.9k
  if (!list)
275
0
    goto error;
276
19.9k
  
FN19.9k
(EL,free)(list->p[index]);19.9k
277
19.9k
  list->p[index] = el;
278
19.9k
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
19.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
)
{0
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]);2
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
2.32k
{
265
2.32k
  if (
!list || 2.32k
!el2.32k
)
266
0
    goto error;
267
2.32k
  
if (2.32k
FN2.32k
(LIST(EL),check_index)(list, index) < 02.32k
)
268
0
    goto error;
269
2.32k
  
if (2.32k
list->p[index] == el2.32k
)
{2.27k
270
2.27k
    FN(EL,free)(el);
271
2.27k
    return list;
272
2.27k
  }
273
55
  
list = 55
FN55
(LIST(EL),cow)(list);
274
55
  if (!list)
275
0
    goto error;
276
55
  
FN55
(EL,free)(list->p[index]);55
277
55
  list->p[index] = el;
278
55
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
55
}
isl_aff_list_set_aff
Line
Count
Source
264
2
{
265
2
  if (
!list || 2
!el2
)
266
0
    goto error;
267
2
  
if (2
FN2
(LIST(EL),check_index)(list, index) < 02
)
268
0
    goto error;
269
2
  
if (2
list->p[index] == el2
)
{0
270
0
    FN(EL,free)(el);
271
0
    return list;
272
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]);2
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
4.00k
{
265
4.00k
  if (
!list || 4.00k
!el4.00k
)
266
0
    goto error;
267
4.00k
  
if (4.00k
FN4.00k
(LIST(EL),check_index)(list, index) < 04.00k
)
268
0
    goto error;
269
4.00k
  
if (4.00k
list->p[index] == el4.00k
)
{3.97k
270
3.97k
    FN(EL,free)(el);
271
3.97k
    return list;
272
3.97k
  }
273
23
  
list = 23
FN23
(LIST(EL),cow)(list);
274
23
  if (!list)
275
0
    goto error;
276
23
  
FN23
(EL,free)(list->p[index]);23
277
23
  list->p[index] = el;
278
23
  return list;
279
0
error:
280
0
  FN(EL,free)(el);
281
0
  FN(LIST(EL),free)(list);
282
0
  return NULL;
283
23
}
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
59
{
298
59
  EL *el;
299
59
300
59
  if (
FN59
(LIST(EL),check_index)(list, index) < 059
)
301
0
    return NULL;
302
59
  
if (59
list->ref != 159
)
303
0
    
return 0
FN0
(FN(LIST(EL),get),BASE)(list, index);
304
59
  el = list->p[index];
305
59
  list->p[index] = NULL;
306
59
  return el;
307
59
}
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
59
{
298
59
  EL *el;
299
59
300
59
  if (
FN59
(LIST(EL),check_index)(list, index) < 059
)
301
0
    return NULL;
302
59
  
if (59
list->ref != 159
)
303
0
    
return 0
FN0
(FN(LIST(EL),get),BASE)(list, index);
304
59
  el = list->p[index];
305
59
  list->p[index] = NULL;
306
59
  return el;
307
59
}
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
59
{
316
59
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
317
59
}
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
59
{
316
59
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
317
59
}
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.48k
{
322
1.48k
  int i;
323
1.48k
324
1.48k
  if (!list)
325
0
    return isl_stat_error;
326
1.48k
327
3.26k
  
for (i = 0; 1.48k
i < list->n3.26k
;
++i1.78k
)
{2.28k
328
2.28k
    
EL2.28k
*el =
FN2.28k
(EL,copy)(list->p[i]);
329
2.28k
    if (!el)
330
0
      return isl_stat_error;
331
2.28k
    
if (2.28k
fn(el, user) < 02.28k
)
332
505
      return isl_stat_error;
333
2.28k
  }
334
1.48k
335
977
  return isl_stat_ok;
336
1.48k
}
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
116
{
322
116
  int i;
323
116
324
116
  if (!list)
325
0
    return isl_stat_error;
326
116
327
234
  
for (i = 0; 116
i < list->n234
;
++i118
)
{118
328
118
    
EL118
*el =
FN118
(EL,copy)(list->p[i]);
329
118
    if (!el)
330
0
      return isl_stat_error;
331
118
    
if (118
fn(el, user) < 0118
)
332
0
      return isl_stat_error;
333
118
  }
334
116
335
116
  return isl_stat_ok;
336
116
}
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
683
{
322
683
  int i;
323
683
324
683
  if (!list)
325
0
    return isl_stat_error;
326
683
327
871
  
for (i = 0; 683
i < list->n871
;
++i188
)
{693
328
693
    
EL693
*el =
FN693
(EL,copy)(list->p[i]);
329
693
    if (!el)
330
0
      return isl_stat_error;
331
693
    
if (693
fn(el, user) < 0693
)
332
505
      return isl_stat_error;
333
693
  }
334
683
335
178
  return isl_stat_ok;
336
683
}
isl_constraint_list_foreach
Line
Count
Source
321
683
{
322
683
  int i;
323
683
324
683
  if (!list)
325
0
    return isl_stat_error;
326
683
327
2.16k
  
for (i = 0; 683
i < list->n2.16k
;
++i1.47k
)
{1.47k
328
1.47k
    
EL1.47k
*el =
FN1.47k
(EL,copy)(list->p[i]);
329
1.47k
    if (!el)
330
0
      return isl_stat_error;
331
1.47k
    
if (1.47k
fn(el, user) < 01.47k
)
332
0
      return isl_stat_error;
333
1.47k
  }
334
683
335
683
  return isl_stat_ok;
336
683
}
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
60
{
344
60
  int i, n;
345
60
346
60
  if (!list)
347
0
    return NULL;
348
60
349
60
  n = list->n;
350
119
  for (i = 0; 
i < n119
;
++i59
)
{59
351
59
    
EL59
*el =
FN59
(FN(LIST(EL),take),BASE)(list, i);
352
59
    if (!el)
353
0
      
return 0
FN0
(LIST(EL),free)(list);
354
59
    el = fn(el, user);
355
59
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
356
59
  }
357
60
358
60
  return list;
359
60
}
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
60
{
344
60
  int i, n;
345
60
346
60
  if (!list)
347
0
    return NULL;
348
60
349
60
  n = list->n;
350
119
  for (i = 0; 
i < n119
;
++i59
)
{59
351
59
    
EL59
*el =
FN59
(FN(LIST(EL),take),BASE)(list, i);
352
59
    if (!el)
353
0
      
return 0
FN0
(LIST(EL),free)(list);
354
59
    el = fn(el, user);
355
59
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
356
59
  }
357
60
358
60
  return list;
359
60
}
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.07k
{
376
1.07k
  S(LIST(EL),sort_data) *data = user;
377
1.07k
  EL * const *el1 = a;
378
1.07k
  EL * const *el2 = b;
379
1.07k
380
1.07k
  return data->cmp(*el1, *el2, data->user);
381
1.07k
}
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
992
{
376
992
  S(LIST(EL),sort_data) *data = user;
377
992
  EL * const *el1 = a;
378
992
  EL * const *el2 = b;
379
992
380
992
  return data->cmp(*el1, *el2, data->user);
381
992
}
Unexecuted instantiation: isl_band.c:isl_band_list_cmp
isl_ast_graft.c:isl_ast_graft_list_cmp
Line
Count
Source
375
18
{
376
18
  S(LIST(EL),sort_data) *data = user;
377
18
  EL * const *el1 = a;
378
18
  EL * const *el2 = b;
379
18
380
18
  return data->cmp(*el1, *el2, data->user);
381
18
}
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_cmp
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_cmp
isl_aff.c:isl_pw_aff_list_cmp
Line
Count
Source
375
67
{
376
67
  S(LIST(EL),sort_data) *data = user;
377
67
  EL * const *el1 = a;
378
67
  EL * const *el2 = b;
379
67
380
67
  return data->cmp(*el1, *el2, data->user);
381
67
}
382
383
/* Sort the elements of "list" in ascending order according to
384
 * comparison function "cmp".
385
 */
386
__isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list,
387
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *user)
388
1.62k
{
389
1.62k
  S(LIST(EL),sort_data) data = { cmp, user };
390
1.62k
391
1.62k
  if (!list)
392
0
    return NULL;
393
1.62k
  
if (1.62k
list->n <= 11.62k
)
394
795
    return list;
395
827
  
list = 827
FN827
(LIST(EL),cow)(list);
396
827
  if (!list)
397
0
    return NULL;
398
827
399
827
  
if (827
isl_sort(list->p, list->n, sizeof(list->p[0]),827
400
827
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
827
403
827
  return list;
404
827
}
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.53k
{
389
1.53k
  S(LIST(EL),sort_data) data = { cmp, user };
390
1.53k
391
1.53k
  if (!list)
392
0
    return NULL;
393
1.53k
  
if (1.53k
list->n <= 11.53k
)
394
784
    return list;
395
752
  
list = 752
FN752
(LIST(EL),cow)(list);
396
752
  if (!list)
397
0
    return NULL;
398
752
399
752
  
if (752
isl_sort(list->p, list->n, sizeof(list->p[0]),752
400
752
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
752
403
752
  return list;
404
752
}
Unexecuted instantiation: isl_band_list_sort
isl_ast_graft_list_sort
Line
Count
Source
388
18
{
389
18
  S(LIST(EL),sort_data) data = { cmp, user };
390
18
391
18
  if (!list)
392
0
    return NULL;
393
18
  
if (18
list->n <= 118
)
394
0
    return list;
395
18
  
list = 18
FN18
(LIST(EL),cow)(list);
396
18
  if (!list)
397
0
    return NULL;
398
18
399
18
  
if (18
isl_sort(list->p, list->n, sizeof(list->p[0]),18
400
18
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
18
403
18
  return list;
404
18
}
Unexecuted instantiation: isl_ast_node_list_sort
Unexecuted instantiation: isl_ast_expr_list_sort
Unexecuted instantiation: isl_union_pw_multi_aff_list_sort
Unexecuted instantiation: isl_union_pw_aff_list_sort
isl_pw_aff_list_sort
Line
Count
Source
388
68
{
389
68
  S(LIST(EL),sort_data) data = { cmp, user };
390
68
391
68
  if (!list)
392
0
    return NULL;
393
68
  
if (68
list->n <= 168
)
394
11
    return list;
395
57
  
list = 57
FN57
(LIST(EL),cow)(list);
396
57
  if (!list)
397
0
    return NULL;
398
57
399
57
  
if (57
isl_sort(list->p, list->n, sizeof(list->p[0]),57
400
57
      &FN(LIST(EL),cmp), &data) < 0)
401
0
    
return 0
FN0
(LIST(EL),free)(list);
402
57
403
57
  return list;
404
57
}
Unexecuted instantiation: isl_aff_list_sort
405
406
/* Internal data structure for isl_*_list_foreach_scc.
407
 *
408
 * "list" is the original list.
409
 * "follows" is the user provided callback that defines the edges of the graph.
410
 */
411
S(LIST(EL),foreach_scc_data) {
412
  LIST(EL) *list;
413
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user);
414
  void *follows_user;
415
};
416
417
/* Does element i of data->list follow element j?
418
 *
419
 * Use the user provided callback to find out.
420
 */
421
static isl_bool FN(LIST(EL),follows)(int i, int j, void *user)
422
106
{
423
106
  S(LIST(EL),foreach_scc_data) *data = user;
424
106
425
106
  return data->follows(data->list->p[i], data->list->p[j],
426
106
        data->follows_user);
427
106
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_follows
isl_set_list.c:isl_basic_set_list_follows
Line
Count
Source
422
106
{
423
106
  S(LIST(EL),foreach_scc_data) *data = user;
424
106
425
106
  return data->follows(data->list->p[i], data->list->p[j],
426
106
        data->follows_user);
427
106
}
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_follows
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_follows
Unexecuted instantiation: isl_map_list.c:isl_map_list_follows
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_follows
Unexecuted instantiation: isl_id.c:isl_id_list_follows
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_follows
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_follows
Unexecuted instantiation: isl_val.c:isl_val_list_follows
Unexecuted instantiation: isl_band.c:isl_band_list_follows
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_follows
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_follows
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_follows
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_aff_list_follows
428
429
/* Call "fn" on the sublist of "list" that consists of the elements
430
 * with indices specified by the "n" elements of "pos".
431
 */
432
static isl_stat FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos,
433
  int n, isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *user)
434
68
{
435
68
  int i;
436
68
  isl_ctx *ctx;
437
68
  LIST(EL) *slice;
438
68
439
68
  ctx = FN(LIST(EL),get_ctx)(list);
440
68
  slice = FN(LIST(EL),alloc)(ctx, n);
441
136
  for (i = 0; 
i < n136
;
++i68
)
{68
442
68
    EL *el;
443
68
444
68
    el = FN(EL,copy)(list->p[pos[i]]);
445
68
    slice = FN(LIST(EL),add)(slice, el);
446
68
  }
447
68
448
68
  return fn(slice, user);
449
68
}
Unexecuted instantiation: isl_id.c:isl_id_list_call_on_scc
Unexecuted instantiation: isl_val.c:isl_val_list_call_on_scc
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_call_on_scc
Unexecuted instantiation: isl_set_list.c:isl_set_list_call_on_scc
isl_set_list.c:isl_basic_set_list_call_on_scc
Line
Count
Source
434
68
{
435
68
  int i;
436
68
  isl_ctx *ctx;
437
68
  LIST(EL) *slice;
438
68
439
68
  ctx = FN(LIST(EL),get_ctx)(list);
440
68
  slice = FN(LIST(EL),alloc)(ctx, n);
441
136
  for (i = 0; 
i < n136
;
++i68
)
{68
442
68
    EL *el;
443
68
444
68
    el = FN(EL,copy)(list->p[pos[i]]);
445
68
    slice = FN(LIST(EL),add)(slice, el);
446
68
  }
447
68
448
68
  return fn(slice, user);
449
68
}
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_map_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_aff_list_call_on_scc
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_call_on_scc
Unexecuted instantiation: isl_band.c:isl_band_list_call_on_scc
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_call_on_scc
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_call_on_scc
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_call_on_scc
450
451
/* Call "fn" on each of the strongly connected components (SCCs) of
452
 * the graph with as vertices the elements of "list" and
453
 * a directed edge from node b to node a iff follows(a, b)
454
 * returns 1.  follows should return -1 on error.
455
 *
456
 * If SCC a contains a node i that follows a node j in another SCC b
457
 * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a
458
 * after being called on SCC b.
459
 *
460
 * We simply call isl_tarjan_graph_init, extract the SCCs from the result and
461
 * call fn on each of them.
462
 */
463
isl_stat FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list,
464
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user),
465
  void *follows_user,
466
  isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user)
467
44
{
468
44
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
469
44
  int i, n;
470
44
  isl_ctx *ctx;
471
44
  struct isl_tarjan_graph *g;
472
44
473
44
  if (!list)
474
0
    return isl_stat_error;
475
44
  
if (44
list->n == 044
)
476
0
    return isl_stat_ok;
477
44
  
if (44
list->n == 144
)
478
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
479
44
480
44
  
ctx = 44
FN44
(LIST(EL),get_ctx)(list);
481
44
  n = list->n;
482
44
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
483
44
  if (!g)
484
0
    return isl_stat_error;
485
44
486
44
  i = 0;
487
81
  do {
488
81
    int first;
489
81
490
81
    if (g->order[i] == -1)
491
0
      isl_die(ctx, isl_error_internal, "cannot happen",
492
81
        break);
493
81
    first = i;
494
181
    while (
g->order[i] != -1181
)
{100
495
100
      ++i; --n;
496
100
    }
497
81
    if (
first == 0 && 81
n == 044
)
{13
498
13
      isl_tarjan_graph_free(g);
499
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
500
13
    }
501
68
    
if (68
FN68
(LIST(EL),call_on_scc)(list, g->order + first, i - first,68
502
68
              fn, fn_user) < 0)
503
0
      break;
504
68
    ++i;
505
68
  } while (n);
506
44
507
31
  isl_tarjan_graph_free(g);
508
31
509
31
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok31
;
510
44
}
Unexecuted instantiation: isl_aff_list_foreach_scc
Unexecuted instantiation: isl_union_pw_aff_list_foreach_scc
Unexecuted instantiation: isl_union_pw_multi_aff_list_foreach_scc
Unexecuted instantiation: isl_ast_expr_list_foreach_scc
Unexecuted instantiation: isl_ast_node_list_foreach_scc
Unexecuted instantiation: isl_ast_graft_list_foreach_scc
Unexecuted instantiation: isl_band_list_foreach_scc
Unexecuted instantiation: isl_constraint_list_foreach_scc
Unexecuted instantiation: isl_id_list_foreach_scc
Unexecuted instantiation: isl_basic_map_list_foreach_scc
Unexecuted instantiation: isl_map_list_foreach_scc
Unexecuted instantiation: isl_union_map_list_foreach_scc
Unexecuted instantiation: isl_schedule_tree_list_foreach_scc
isl_basic_set_list_foreach_scc
Line
Count
Source
467
44
{
468
44
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
469
44
  int i, n;
470
44
  isl_ctx *ctx;
471
44
  struct isl_tarjan_graph *g;
472
44
473
44
  if (!list)
474
0
    return isl_stat_error;
475
44
  
if (44
list->n == 044
)
476
0
    return isl_stat_ok;
477
44
  
if (44
list->n == 144
)
478
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
479
44
480
44
  
ctx = 44
FN44
(LIST(EL),get_ctx)(list);
481
44
  n = list->n;
482
44
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
483
44
  if (!g)
484
0
    return isl_stat_error;
485
44
486
44
  i = 0;
487
81
  do {
488
81
    int first;
489
81
490
81
    if (g->order[i] == -1)
491
0
      isl_die(ctx, isl_error_internal, "cannot happen",
492
81
        break);
493
81
    first = i;
494
181
    while (
g->order[i] != -1181
)
{100
495
100
      ++i; --n;
496
100
    }
497
81
    if (
first == 0 && 81
n == 044
)
{13
498
13
      isl_tarjan_graph_free(g);
499
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
500
13
    }
501
68
    
if (68
FN68
(LIST(EL),call_on_scc)(list, g->order + first, i - first,68
502
68
              fn, fn_user) < 0)
503
0
      break;
504
68
    ++i;
505
68
  } while (n);
506
44
507
31
  isl_tarjan_graph_free(g);
508
31
509
31
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok31
;
510
44
}
Unexecuted instantiation: isl_set_list_foreach_scc
Unexecuted instantiation: isl_union_set_list_foreach_scc
Unexecuted instantiation: isl_val_list_foreach_scc
Unexecuted instantiation: isl_pw_aff_list_foreach_scc
511
512
__isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el)
513
23.4k
{
514
23.4k
  isl_ctx *ctx;
515
23.4k
  LIST(EL) *list;
516
23.4k
517
23.4k
  if (!el)
518
1
    return NULL;
519
23.4k
  
ctx = 23.4k
FN23.4k
(EL,get_ctx)(el);
520
23.4k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
23.4k
  if (!list)
522
0
    goto error;
523
23.4k
  
list = 23.4k
FN23.4k
(LIST(EL),add)(list, el);
524
23.4k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
23.4k
}
isl_union_set_list_from_union_set
Line
Count
Source
513
328
{
514
328
  isl_ctx *ctx;
515
328
  LIST(EL) *list;
516
328
517
328
  if (!el)
518
0
    return NULL;
519
328
  
ctx = 328
FN328
(EL,get_ctx)(el);
520
328
  list = FN(LIST(EL),alloc)(ctx, 1);
521
328
  if (!list)
522
0
    goto error;
523
328
  
list = 328
FN328
(LIST(EL),add)(list, el);
524
328
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
328
}
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
5.12k
{
514
5.12k
  isl_ctx *ctx;
515
5.12k
  LIST(EL) *list;
516
5.12k
517
5.12k
  if (!el)
518
0
    return NULL;
519
5.12k
  
ctx = 5.12k
FN5.12k
(EL,get_ctx)(el);
520
5.12k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
5.12k
  if (!list)
522
0
    goto error;
523
5.12k
  
list = 5.12k
FN5.12k
(LIST(EL),add)(list, el);
524
5.12k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
5.12k
}
isl_basic_set_list_from_basic_set
Line
Count
Source
513
517
{
514
517
  isl_ctx *ctx;
515
517
  LIST(EL) *list;
516
517
517
517
  if (!el)
518
0
    return NULL;
519
517
  
ctx = 517
FN517
(EL,get_ctx)(el);
520
517
  list = FN(LIST(EL),alloc)(ctx, 1);
521
517
  if (!list)
522
0
    goto error;
523
517
  
list = 517
FN517
(LIST(EL),add)(list, el);
524
517
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
517
}
isl_schedule_tree_list_from_schedule_tree
Line
Count
Source
513
3.18k
{
514
3.18k
  isl_ctx *ctx;
515
3.18k
  LIST(EL) *list;
516
3.18k
517
3.18k
  if (!el)
518
0
    return NULL;
519
3.18k
  
ctx = 3.18k
FN3.18k
(EL,get_ctx)(el);
520
3.18k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
3.18k
  if (!list)
522
0
    goto error;
523
3.18k
  
list = 3.18k
FN3.18k
(LIST(EL),add)(list, el);
524
3.18k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
3.18k
}
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
1.33k
{
514
1.33k
  isl_ctx *ctx;
515
1.33k
  LIST(EL) *list;
516
1.33k
517
1.33k
  if (!el)
518
0
    return NULL;
519
1.33k
  
ctx = 1.33k
FN1.33k
(EL,get_ctx)(el);
520
1.33k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
1.33k
  if (!list)
522
0
    goto error;
523
1.33k
  
list = 1.33k
FN1.33k
(LIST(EL),add)(list, el);
524
1.33k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
1.33k
}
isl_ast_node_list_from_ast_node
Line
Count
Source
513
19
{
514
19
  isl_ctx *ctx;
515
19
  LIST(EL) *list;
516
19
517
19
  if (!el)
518
0
    return NULL;
519
19
  
ctx = 19
FN19
(EL,get_ctx)(el);
520
19
  list = FN(LIST(EL),alloc)(ctx, 1);
521
19
  if (!list)
522
0
    goto error;
523
19
  
list = 19
FN19
(LIST(EL),add)(list, el);
524
19
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
19
}
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
7.78k
{
514
7.78k
  isl_ctx *ctx;
515
7.78k
  LIST(EL) *list;
516
7.78k
517
7.78k
  if (!el)
518
1
    return NULL;
519
7.78k
  
ctx = 7.78k
FN7.78k
(EL,get_ctx)(el);
520
7.78k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
7.78k
  if (!list)
522
0
    goto error;
523
7.78k
  
list = 7.78k
FN7.78k
(LIST(EL),add)(list, el);
524
7.78k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
7.78k
}
isl_aff_list_from_aff
Line
Count
Source
513
5.12k
{
514
5.12k
  isl_ctx *ctx;
515
5.12k
  LIST(EL) *list;
516
5.12k
517
5.12k
  if (!el)
518
0
    return NULL;
519
5.12k
  
ctx = 5.12k
FN5.12k
(EL,get_ctx)(el);
520
5.12k
  list = FN(LIST(EL),alloc)(ctx, 1);
521
5.12k
  if (!list)
522
0
    goto error;
523
5.12k
  
list = 5.12k
FN5.12k
(LIST(EL),add)(list, el);
524
5.12k
  return list;
525
0
error:
526
0
  FN(EL,free)(el);
527
0
  return NULL;
528
5.12k
}
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.26k
{
537
1.26k
  int i;
538
1.26k
539
1.32k
  for (i = 0; 
i < list2->n1.32k
;
++i59
)
540
59
    
list1 = 59
FN59
(LIST(EL),add)(list1,
FN59
(EL,copy)(list2->p[i]));
541
1.26k
  FN(LIST(EL),free)(list2);
542
1.26k
  return list1;
543
1.26k
}
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
39
{
537
39
  int i;
538
39
539
98
  for (i = 0; 
i < list2->n98
;
++i59
)
540
59
    
list1 = 59
FN59
(LIST(EL),add)(list1,
FN59
(EL,copy)(list2->p[i]));
541
39
  FN(LIST(EL),free)(list2);
542
39
  return list1;
543
39
}
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
34
{
537
34
  int i;
538
34
539
34
  for (i = 0; 
i < list2->n34
;
++i0
)
540
0
    
list1 = 0
FN0
(LIST(EL),add)(list1,
FN0
(EL,copy)(list2->p[i]));
541
34
  FN(LIST(EL),free)(list2);
542
34
  return list1;
543
34
}
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.19k
{
537
1.19k
  int i;
538
1.19k
539
1.19k
  for (i = 0; 
i < list2->n1.19k
;
++i0
)
540
0
    
list1 = 0
FN0
(LIST(EL),add)(list1,
FN0
(EL,copy)(list2->p[i]));
541
1.19k
  FN(LIST(EL),free)(list2);
542
1.19k
  return list1;
543
1.19k
}
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
5.32k
{
553
5.32k
  int i;
554
5.32k
  isl_ctx *ctx;
555
5.32k
  LIST(EL) *res;
556
5.32k
557
5.32k
  if (
!list1 || 5.32k
!list25.32k
)
558
0
    goto error;
559
5.32k
560
5.32k
  
if (5.32k
list1->ref == 1 && 5.32k
list1->n + list2->n <= list1->size4.72k
)
561
1.26k
    
return 1.26k
FN1.26k
(LIST(EL),concat_inplace)(list1, list2);
562
5.32k
563
4.05k
  
ctx = 4.05k
FN4.05k
(LIST(EL),get_ctx)(list1);
564
4.05k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
14.4k
  for (i = 0; 
i < list1->n14.4k
;
++i10.4k
)
566
10.4k
    
res = 10.4k
FN10.4k
(LIST(EL),add)(res,
FN10.4k
(EL,copy)(list1->p[i]));
567
10.1k
  for (i = 0; 
i < list2->n10.1k
;
++i6.08k
)
568
6.08k
    
res = 6.08k
FN6.08k
(LIST(EL),add)(res,
FN6.08k
(EL,copy)(list2->p[i]));
569
4.05k
570
4.05k
  FN(LIST(EL),free)(list1);
571
4.05k
  FN(LIST(EL),free)(list2);
572
4.05k
  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.32k
}
Unexecuted instantiation: isl_aff_list_concat
isl_pw_aff_list_concat
Line
Count
Source
552
119
{
553
119
  int i;
554
119
  isl_ctx *ctx;
555
119
  LIST(EL) *res;
556
119
557
119
  if (
!list1 || 119
!list2119
)
558
0
    goto error;
559
119
560
119
  
if (119
list1->ref == 1 && 119
list1->n + list2->n <= list1->size119
)
561
0
    
return 0
FN0
(LIST(EL),concat_inplace)(list1, list2);
562
119
563
119
  
ctx = 119
FN119
(LIST(EL),get_ctx)(list1);
564
119
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
249
  for (i = 0; 
i < list1->n249
;
++i130
)
566
130
    
res = 130
FN130
(LIST(EL),add)(res,
FN130
(EL,copy)(list1->p[i]));
567
238
  for (i = 0; 
i < list2->n238
;
++i119
)
568
119
    
res = 119
FN119
(LIST(EL),add)(res,
FN119
(EL,copy)(list2->p[i]));
569
119
570
119
  FN(LIST(EL),free)(list1);
571
119
  FN(LIST(EL),free)(list2);
572
119
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
119
}
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
3.45k
{
553
3.45k
  int i;
554
3.45k
  isl_ctx *ctx;
555
3.45k
  LIST(EL) *res;
556
3.45k
557
3.45k
  if (
!list1 || 3.45k
!list23.45k
)
558
0
    goto error;
559
3.45k
560
3.45k
  
if (3.45k
list1->ref == 1 && 3.45k
list1->n + list2->n <= list1->size3.45k
)
561
1.19k
    
return 1.19k
FN1.19k
(LIST(EL),concat_inplace)(list1, list2);
562
3.45k
563
2.25k
  
ctx = 2.25k
FN2.25k
(LIST(EL),get_ctx)(list1);
564
2.25k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
2.49k
  for (i = 0; 
i < list1->n2.49k
;
++i235
)
566
235
    
res = 235
FN235
(LIST(EL),add)(res,
FN235
(EL,copy)(list1->p[i]));
567
4.99k
  for (i = 0; 
i < list2->n4.99k
;
++i2.73k
)
568
2.73k
    
res = 2.73k
FN2.73k
(LIST(EL),add)(res,
FN2.73k
(EL,copy)(list2->p[i]));
569
2.25k
570
2.25k
  FN(LIST(EL),free)(list1);
571
2.25k
  FN(LIST(EL),free)(list2);
572
2.25k
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
3.45k
}
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
601
{
553
601
  int i;
554
601
  isl_ctx *ctx;
555
601
  LIST(EL) *res;
556
601
557
601
  if (
!list1 || 601
!list2601
)
558
0
    goto error;
559
601
560
601
  
if (601
list1->ref == 1 && 601
list1->n + list2->n <= list1->size0
)
561
0
    
return 0
FN0
(LIST(EL),concat_inplace)(list1, list2);
562
601
563
601
  
ctx = 601
FN601
(LIST(EL),get_ctx)(list1);
564
601
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
1.04k
  for (i = 0; 
i < list1->n1.04k
;
++i440
)
566
440
    
res = 440
FN440
(LIST(EL),add)(res,
FN440
(EL,copy)(list1->p[i]));
567
1.42k
  for (i = 0; 
i < list2->n1.42k
;
++i826
)
568
826
    
res = 826
FN826
(LIST(EL),add)(res,
FN826
(EL,copy)(list2->p[i]));
569
601
570
601
  FN(LIST(EL),free)(list1);
571
601
  FN(LIST(EL),free)(list2);
572
601
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
601
}
isl_basic_map_list_concat
Line
Count
Source
552
1.03k
{
553
1.03k
  int i;
554
1.03k
  isl_ctx *ctx;
555
1.03k
  LIST(EL) *res;
556
1.03k
557
1.03k
  if (
!list1 || 1.03k
!list21.03k
)
558
0
    goto error;
559
1.03k
560
1.03k
  
if (1.03k
list1->ref == 1 && 1.03k
list1->n + list2->n <= list1->size1.03k
)
561
34
    
return 34
FN34
(LIST(EL),concat_inplace)(list1, list2);
562
1.03k
563
1.00k
  
ctx = 1.00k
FN1.00k
(LIST(EL),get_ctx)(list1);
564
1.00k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
10.5k
  for (i = 0; 
i < list1->n10.5k
;
++i9.59k
)
566
9.59k
    
res = 9.59k
FN9.59k
(LIST(EL),add)(res,
FN9.59k
(EL,copy)(list1->p[i]));
567
3.32k
  for (i = 0; 
i < list2->n3.32k
;
++i2.32k
)
568
2.32k
    
res = 2.32k
FN2.32k
(LIST(EL),add)(res,
FN2.32k
(EL,copy)(list2->p[i]));
569
1.00k
570
1.00k
  FN(LIST(EL),free)(list1);
571
1.00k
  FN(LIST(EL),free)(list2);
572
1.00k
  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.03k
}
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
112
{
553
112
  int i;
554
112
  isl_ctx *ctx;
555
112
  LIST(EL) *res;
556
112
557
112
  if (
!list1 || 112
!list2112
)
558
0
    goto error;
559
112
560
112
  
if (112
list1->ref == 1 && 112
list1->n + list2->n <= list1->size112
)
561
39
    
return 39
FN39
(LIST(EL),concat_inplace)(list1, list2);
562
112
563
73
  
ctx = 73
FN73
(LIST(EL),get_ctx)(list1);
564
73
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
565
87
  for (i = 0; 
i < list1->n87
;
++i14
)
566
14
    
res = 14
FN14
(LIST(EL),add)(res,
FN14
(EL,copy)(list1->p[i]));
567
147
  for (i = 0; 
i < list2->n147
;
++i74
)
568
74
    
res = 74
FN74
(LIST(EL),add)(res,
FN74
(EL,copy)(list2->p[i]));
569
73
570
73
  FN(LIST(EL),free)(list1);
571
73
  FN(LIST(EL),free)(list2);
572
73
  return res;
573
0
error:
574
0
  FN(LIST(EL),free)(list1);
575
0
  FN(LIST(EL),free)(list2);
576
0
  return NULL;
577
112
}
Unexecuted instantiation: isl_set_list_concat
Unexecuted instantiation: isl_union_set_list_concat
578
579
__isl_give isl_printer *CAT(isl_printer_print_,LIST(BASE))(
580
  __isl_take isl_printer *p, __isl_keep LIST(EL) *list)
581
0
{
582
0
  int i;
583
0
584
0
  if (
!p || 0
!list0
)
585
0
    goto error;
586
0
  p = isl_printer_print_str(p, "(");
587
0
  for (i = 0; 
i < list->n0
;
++i0
)
{0
588
0
    if (i)
589
0
      p = isl_printer_print_str(p, ",");
590
0
    p = CAT(isl_printer_print_,BASE)(p, list->p[i]);
591
0
  }
592
0
  p = isl_printer_print_str(p, ")");
593
0
  return p;
594
0
error:
595
0
  isl_printer_free(p);
596
0
  return NULL;
597
0
}
Unexecuted instantiation: isl_printer_print_val_list
Unexecuted instantiation: isl_printer_print_aff_list
Unexecuted instantiation: isl_printer_print_union_set_list
Unexecuted instantiation: isl_printer_print_set_list
Unexecuted instantiation: isl_printer_print_basic_set_list
Unexecuted instantiation: isl_printer_print_schedule_tree_list
Unexecuted instantiation: isl_printer_print_union_map_list
Unexecuted instantiation: isl_printer_print_map_list
Unexecuted instantiation: isl_printer_print_basic_map_list
Unexecuted instantiation: isl_printer_print_id_list
Unexecuted instantiation: isl_printer_print_constraint_list
Unexecuted instantiation: isl_printer_print_band_list
Unexecuted instantiation: isl_printer_print_ast_graft_list
Unexecuted instantiation: isl_printer_print_ast_node_list
Unexecuted instantiation: isl_printer_print_ast_expr_list
Unexecuted instantiation: isl_printer_print_union_pw_multi_aff_list
Unexecuted instantiation: isl_printer_print_union_pw_aff_list
Unexecuted instantiation: isl_printer_print_pw_aff_list
598
599
void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list)
600
0
{
601
0
  isl_printer *printer;
602
0
603
0
  if (!list)
604
0
    return;
605
0
606
0
  
printer = isl_printer_to_file(0
FN0
(LIST(EL),get_ctx)(list), stderr);
607
0
  printer = CAT(isl_printer_print_,LIST(BASE))(printer, list);
608
0
  printer = isl_printer_end_line(printer);
609
0
610
0
  isl_printer_free(printer);
611
0
}
Unexecuted instantiation: isl_union_set_list_dump
Unexecuted instantiation: isl_aff_list_dump
Unexecuted instantiation: isl_pw_aff_list_dump
Unexecuted instantiation: isl_union_pw_aff_list_dump
Unexecuted instantiation: isl_union_pw_multi_aff_list_dump
Unexecuted instantiation: isl_ast_expr_list_dump
Unexecuted instantiation: isl_ast_node_list_dump
Unexecuted instantiation: isl_ast_graft_list_dump
Unexecuted instantiation: isl_band_list_dump
Unexecuted instantiation: isl_val_list_dump
Unexecuted instantiation: isl_id_list_dump
Unexecuted instantiation: isl_basic_map_list_dump
Unexecuted instantiation: isl_map_list_dump
Unexecuted instantiation: isl_union_map_list_dump
Unexecuted instantiation: isl_schedule_tree_list_dump
Unexecuted instantiation: isl_basic_set_list_dump
Unexecuted instantiation: isl_set_list_dump
Unexecuted instantiation: isl_constraint_list_dump