Coverage Report

Created: 2019-04-25 15:07

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/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
#include <isl/printer.h>
19
20
5.26k
#define xCAT(A,B) A ## B
21
5.26k
#define CAT(A,B) xCAT(A,B)
22
#undef EL
23
5.26k
#define EL CAT(isl_,BASE)
24
5.49M
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
25
5.45M
#define FN(TYPE,NAME) xFN(TYPE,NAME)
26
633k
#define xLIST(EL) EL ## _list
27
633k
#define LIST(EL) xLIST(EL)
28
3.29k
#define xS(TYPE,NAME) struct TYPE ## _ ## NAME
29
3.29k
#define S(TYPE,NAME) xS(TYPE,NAME)
30
31
isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
32
99.4k
{
33
99.4k
  return list ? list->ctx : NULL;
34
99.4k
}
isl_aff_list_get_ctx
Line
Count
Source
32
20
{
33
20
  return list ? list->ctx : NULL;
34
20
}
isl_pw_aff_list_get_ctx
Line
Count
Source
32
11.7k
{
33
11.7k
  return list ? list->ctx : NULL;
34
11.7k
}
Unexecuted instantiation: isl_pw_multi_aff_list_get_ctx
isl_union_pw_aff_list_get_ctx
Line
Count
Source
32
116
{
33
116
  return list ? list->ctx : NULL;
34
116
}
Unexecuted instantiation: isl_union_pw_multi_aff_list_get_ctx
Unexecuted instantiation: isl_ast_expr_list_get_ctx
isl_ast_node_list_get_ctx
Line
Count
Source
32
537
{
33
537
  return list ? list->ctx : NULL;
34
537
}
isl_ast_graft_list_get_ctx
Line
Count
Source
32
12.0k
{
33
12.0k
  return list ? list->ctx : NULL;
34
12.0k
}
isl_constraint_list_get_ctx
Line
Count
Source
32
1.18k
{
33
1.18k
  return list ? list->ctx : NULL;
34
1.18k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_get_ctx
isl_id_list_get_ctx
Line
Count
Source
32
682
{
33
682
  return list ? list->ctx : NULL;
34
682
}
isl_basic_map_list_get_ctx
Line
Count
Source
32
1.87k
{
33
1.87k
  return list ? list->ctx : NULL;
34
1.87k
}
isl_map_list_get_ctx
Line
Count
Source
32
870
{
33
870
  return list ? list->ctx : NULL;
34
870
}
isl_union_map_list_get_ctx
Line
Count
Source
32
1
{
33
1
  return list ? list->ctx : NULL;
34
1
}
Unexecuted instantiation: isl_pw_qpolynomial_list_get_ctx
isl_schedule_tree_list_get_ctx
Line
Count
Source
32
68.8k
{
33
68.8k
  return list ? list->ctx : NULL;
34
68.8k
}
isl_basic_set_list_get_ctx
Line
Count
Source
32
1.30k
{
33
1.30k
  return list ? list->ctx : NULL;
34
1.30k
}
isl_set_list_get_ctx
Line
Count
Source
32
20
{
33
20
  return list ? list->ctx : NULL;
34
20
}
isl_union_set_list_get_ctx
Line
Count
Source
32
269
{
33
269
  return list ? list->ctx : NULL;
34
269
}
isl_val_list_get_ctx
Line
Count
Source
32
8
{
33
8
  return list ? list->ctx : NULL;
34
8
}
35
36
__isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n)
37
161k
{
38
161k
  LIST(EL) *list;
39
161k
40
161k
  if (n < 0)
41
161k
    
isl_die0
(ctx, isl_error_invalid,
42
161k
      "cannot create list of negative length",
43
161k
      return NULL);
44
161k
  list = isl_alloc(ctx, LIST(EL),
45
161k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
161k
  if (!list)
47
9
    return NULL;
48
161k
49
161k
  list->ctx = ctx;
50
161k
  isl_ctx_ref(ctx);
51
161k
  list->ref = 1;
52
161k
  list->size = n;
53
161k
  list->n = 0;
54
161k
  return list;
55
161k
}
isl_aff_list_alloc
Line
Count
Source
37
8.58k
{
38
8.58k
  LIST(EL) *list;
39
8.58k
40
8.58k
  if (n < 0)
41
8.58k
    
isl_die0
(ctx, isl_error_invalid,
42
8.58k
      "cannot create list of negative length",
43
8.58k
      return NULL);
44
8.58k
  list = isl_alloc(ctx, LIST(EL),
45
8.58k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
8.58k
  if (!list)
47
0
    return NULL;
48
8.58k
49
8.58k
  list->ctx = ctx;
50
8.58k
  isl_ctx_ref(ctx);
51
8.58k
  list->ref = 1;
52
8.58k
  list->size = n;
53
8.58k
  list->n = 0;
54
8.58k
  return list;
55
8.58k
}
isl_pw_aff_list_alloc
Line
Count
Source
37
17.3k
{
38
17.3k
  LIST(EL) *list;
39
17.3k
40
17.3k
  if (n < 0)
41
17.3k
    
isl_die0
(ctx, isl_error_invalid,
42
17.3k
      "cannot create list of negative length",
43
17.3k
      return NULL);
44
17.3k
  list = isl_alloc(ctx, LIST(EL),
45
17.3k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
17.3k
  if (!list)
47
0
    return NULL;
48
17.3k
49
17.3k
  list->ctx = ctx;
50
17.3k
  isl_ctx_ref(ctx);
51
17.3k
  list->ref = 1;
52
17.3k
  list->size = n;
53
17.3k
  list->n = 0;
54
17.3k
  return list;
55
17.3k
}
Unexecuted instantiation: isl_pw_multi_aff_list_alloc
isl_union_pw_aff_list_alloc
Line
Count
Source
37
260
{
38
260
  LIST(EL) *list;
39
260
40
260
  if (n < 0)
41
260
    
isl_die0
(ctx, isl_error_invalid,
42
260
      "cannot create list of negative length",
43
260
      return NULL);
44
260
  list = isl_alloc(ctx, LIST(EL),
45
260
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
260
  if (!list)
47
0
    return NULL;
48
260
49
260
  list->ctx = ctx;
50
260
  isl_ctx_ref(ctx);
51
260
  list->ref = 1;
52
260
  list->size = n;
53
260
  list->n = 0;
54
260
  return list;
55
260
}
isl_union_pw_multi_aff_list_alloc
Line
Count
Source
37
8
{
38
8
  LIST(EL) *list;
39
8
40
8
  if (n < 0)
41
8
    
isl_die0
(ctx, isl_error_invalid,
42
8
      "cannot create list of negative length",
43
8
      return NULL);
44
8
  list = isl_alloc(ctx, LIST(EL),
45
8
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
8
  if (!list)
47
0
    return NULL;
48
8
49
8
  list->ctx = ctx;
50
8
  isl_ctx_ref(ctx);
51
8
  list->ref = 1;
52
8
  list->size = n;
53
8
  list->n = 0;
54
8
  return list;
55
8
}
Unexecuted instantiation: isl_ast_expr_list_alloc
isl_ast_node_list_alloc
Line
Count
Source
37
4.53k
{
38
4.53k
  LIST(EL) *list;
39
4.53k
40
4.53k
  if (n < 0)
41
4.53k
    
isl_die0
(ctx, isl_error_invalid,
42
4.53k
      "cannot create list of negative length",
43
4.53k
      return NULL);
44
4.53k
  list = isl_alloc(ctx, LIST(EL),
45
4.53k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
4.53k
  if (!list)
47
0
    return NULL;
48
4.53k
49
4.53k
  list->ctx = ctx;
50
4.53k
  isl_ctx_ref(ctx);
51
4.53k
  list->ref = 1;
52
4.53k
  list->size = n;
53
4.53k
  list->n = 0;
54
4.53k
  return list;
55
4.53k
}
isl_ast_graft_list_alloc
Line
Count
Source
37
18.2k
{
38
18.2k
  LIST(EL) *list;
39
18.2k
40
18.2k
  if (n < 0)
41
18.2k
    
isl_die0
(ctx, isl_error_invalid,
42
18.2k
      "cannot create list of negative length",
43
18.2k
      return NULL);
44
18.2k
  list = isl_alloc(ctx, LIST(EL),
45
18.2k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
18.2k
  if (!list)
47
0
    return NULL;
48
18.2k
49
18.2k
  list->ctx = ctx;
50
18.2k
  isl_ctx_ref(ctx);
51
18.2k
  list->ref = 1;
52
18.2k
  list->size = n;
53
18.2k
  list->n = 0;
54
18.2k
  return list;
55
18.2k
}
isl_constraint_list_alloc
Line
Count
Source
37
2.41k
{
38
2.41k
  LIST(EL) *list;
39
2.41k
40
2.41k
  if (n < 0)
41
2.41k
    
isl_die0
(ctx, isl_error_invalid,
42
2.41k
      "cannot create list of negative length",
43
2.41k
      return NULL);
44
2.41k
  list = isl_alloc(ctx, LIST(EL),
45
2.41k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
2.41k
  if (!list)
47
0
    return NULL;
48
2.41k
49
2.41k
  list->ctx = ctx;
50
2.41k
  isl_ctx_ref(ctx);
51
2.41k
  list->ref = 1;
52
2.41k
  list->size = n;
53
2.41k
  list->n = 0;
54
2.41k
  return list;
55
2.41k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_alloc
isl_id_list_alloc
Line
Count
Source
37
1.97k
{
38
1.97k
  LIST(EL) *list;
39
1.97k
40
1.97k
  if (n < 0)
41
1.97k
    
isl_die0
(ctx, isl_error_invalid,
42
1.97k
      "cannot create list of negative length",
43
1.97k
      return NULL);
44
1.97k
  list = isl_alloc(ctx, LIST(EL),
45
1.97k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
1.97k
  if (!list)
47
0
    return NULL;
48
1.97k
49
1.97k
  list->ctx = ctx;
50
1.97k
  isl_ctx_ref(ctx);
51
1.97k
  list->ref = 1;
52
1.97k
  list->size = n;
53
1.97k
  list->n = 0;
54
1.97k
  return list;
55
1.97k
}
isl_basic_map_list_alloc
Line
Count
Source
37
4.90k
{
38
4.90k
  LIST(EL) *list;
39
4.90k
40
4.90k
  if (n < 0)
41
4.90k
    
isl_die0
(ctx, isl_error_invalid,
42
4.90k
      "cannot create list of negative length",
43
4.90k
      return NULL);
44
4.90k
  list = isl_alloc(ctx, LIST(EL),
45
4.90k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
4.90k
  if (!list)
47
0
    return NULL;
48
4.90k
49
4.90k
  list->ctx = ctx;
50
4.90k
  isl_ctx_ref(ctx);
51
4.90k
  list->ref = 1;
52
4.90k
  list->size = n;
53
4.90k
  list->n = 0;
54
4.90k
  return list;
55
4.90k
}
isl_map_list_alloc
Line
Count
Source
37
7.78k
{
38
7.78k
  LIST(EL) *list;
39
7.78k
40
7.78k
  if (n < 0)
41
7.78k
    
isl_die0
(ctx, isl_error_invalid,
42
7.78k
      "cannot create list of negative length",
43
7.78k
      return NULL);
44
7.78k
  list = isl_alloc(ctx, LIST(EL),
45
7.78k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
7.78k
  if (!list)
47
9
    return NULL;
48
7.77k
49
7.77k
  list->ctx = ctx;
50
7.77k
  isl_ctx_ref(ctx);
51
7.77k
  list->ref = 1;
52
7.77k
  list->size = n;
53
7.77k
  list->n = 0;
54
7.77k
  return list;
55
7.77k
}
isl_union_map_list_alloc
Line
Count
Source
37
1
{
38
1
  LIST(EL) *list;
39
1
40
1
  if (n < 0)
41
1
    
isl_die0
(ctx, isl_error_invalid,
42
1
      "cannot create list of negative length",
43
1
      return NULL);
44
1
  list = isl_alloc(ctx, LIST(EL),
45
1
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
1
  if (!list)
47
0
    return NULL;
48
1
49
1
  list->ctx = ctx;
50
1
  isl_ctx_ref(ctx);
51
1
  list->ref = 1;
52
1
  list->size = n;
53
1
  list->n = 0;
54
1
  return list;
55
1
}
Unexecuted instantiation: isl_pw_qpolynomial_list_alloc
isl_schedule_tree_list_alloc
Line
Count
Source
37
78.5k
{
38
78.5k
  LIST(EL) *list;
39
78.5k
40
78.5k
  if (n < 0)
41
78.5k
    
isl_die0
(ctx, isl_error_invalid,
42
78.5k
      "cannot create list of negative length",
43
78.5k
      return NULL);
44
78.5k
  list = isl_alloc(ctx, LIST(EL),
45
78.5k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
78.5k
  if (!list)
47
0
    return NULL;
48
78.5k
49
78.5k
  list->ctx = ctx;
50
78.5k
  isl_ctx_ref(ctx);
51
78.5k
  list->ref = 1;
52
78.5k
  list->size = n;
53
78.5k
  list->n = 0;
54
78.5k
  return list;
55
78.5k
}
isl_basic_set_list_alloc
Line
Count
Source
37
4.33k
{
38
4.33k
  LIST(EL) *list;
39
4.33k
40
4.33k
  if (n < 0)
41
4.33k
    
isl_die0
(ctx, isl_error_invalid,
42
4.33k
      "cannot create list of negative length",
43
4.33k
      return NULL);
44
4.33k
  list = isl_alloc(ctx, LIST(EL),
45
4.33k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
4.33k
  if (!list)
47
0
    return NULL;
48
4.33k
49
4.33k
  list->ctx = ctx;
50
4.33k
  isl_ctx_ref(ctx);
51
4.33k
  list->ref = 1;
52
4.33k
  list->size = n;
53
4.33k
  list->n = 0;
54
4.33k
  return list;
55
4.33k
}
isl_set_list_alloc
Line
Count
Source
37
11.6k
{
38
11.6k
  LIST(EL) *list;
39
11.6k
40
11.6k
  if (n < 0)
41
11.6k
    
isl_die0
(ctx, isl_error_invalid,
42
11.6k
      "cannot create list of negative length",
43
11.6k
      return NULL);
44
11.6k
  list = isl_alloc(ctx, LIST(EL),
45
11.6k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
11.6k
  if (!list)
47
0
    return NULL;
48
11.6k
49
11.6k
  list->ctx = ctx;
50
11.6k
  isl_ctx_ref(ctx);
51
11.6k
  list->ref = 1;
52
11.6k
  list->size = n;
53
11.6k
  list->n = 0;
54
11.6k
  return list;
55
11.6k
}
isl_union_set_list_alloc
Line
Count
Source
37
497
{
38
497
  LIST(EL) *list;
39
497
40
497
  if (n < 0)
41
497
    
isl_die0
(ctx, isl_error_invalid,
42
497
      "cannot create list of negative length",
43
497
      return NULL);
44
497
  list = isl_alloc(ctx, LIST(EL),
45
497
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
497
  if (!list)
47
0
    return NULL;
48
497
49
497
  list->ctx = ctx;
50
497
  isl_ctx_ref(ctx);
51
497
  list->ref = 1;
52
497
  list->size = n;
53
497
  list->n = 0;
54
497
  return list;
55
497
}
isl_val_list_alloc
Line
Count
Source
37
7
{
38
7
  LIST(EL) *list;
39
7
40
7
  if (n < 0)
41
7
    
isl_die0
(ctx, isl_error_invalid,
42
7
      "cannot create list of negative length",
43
7
      return NULL);
44
7
  list = isl_alloc(ctx, LIST(EL),
45
7
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
7
  if (!list)
47
0
    return NULL;
48
7
49
7
  list->ctx = ctx;
50
7
  isl_ctx_ref(ctx);
51
7
  list->ref = 1;
52
7
  list->size = n;
53
7
  list->n = 0;
54
7
  return list;
55
7
}
56
57
__isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list)
58
110k
{
59
110k
  if (!list)
60
0
    return NULL;
61
110k
62
110k
  list->ref++;
63
110k
  return list;
64
110k
}
Unexecuted instantiation: isl_aff_list_copy
isl_pw_aff_list_copy
Line
Count
Source
58
11.9k
{
59
11.9k
  if (!list)
60
0
    return NULL;
61
11.9k
62
11.9k
  list->ref++;
63
11.9k
  return list;
64
11.9k
}
Unexecuted instantiation: isl_pw_multi_aff_list_copy
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
58
233
{
59
233
  if (!list)
60
0
    return NULL;
61
233
62
233
  list->ref++;
63
233
  return list;
64
233
}
Unexecuted instantiation: isl_ast_graft_list_copy
isl_constraint_list_copy
Line
Count
Source
58
745
{
59
745
  if (!list)
60
0
    return NULL;
61
745
62
745
  list->ref++;
63
745
  return list;
64
745
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_copy
isl_id_list_copy
Line
Count
Source
58
35.5k
{
59
35.5k
  if (!list)
60
0
    return NULL;
61
35.5k
62
35.5k
  list->ref++;
63
35.5k
  return list;
64
35.5k
}
Unexecuted instantiation: isl_basic_map_list_copy
Unexecuted instantiation: isl_map_list_copy
Unexecuted instantiation: isl_union_map_list_copy
Unexecuted instantiation: isl_pw_qpolynomial_list_copy
isl_schedule_tree_list_copy
Line
Count
Source
58
62.2k
{
59
62.2k
  if (!list)
60
0
    return NULL;
61
62.2k
62
62.2k
  list->ref++;
63
62.2k
  return list;
64
62.2k
}
isl_basic_set_list_copy
Line
Count
Source
58
21
{
59
21
  if (!list)
60
0
    return NULL;
61
21
62
21
  list->ref++;
63
21
  return list;
64
21
}
Unexecuted instantiation: isl_set_list_copy
Unexecuted instantiation: isl_union_set_list_copy
Unexecuted instantiation: isl_val_list_copy
65
66
__isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list)
67
50.0k
{
68
50.0k
  int i;
69
50.0k
  LIST(EL) *dup;
70
50.0k
71
50.0k
  if (!list)
72
0
    return NULL;
73
50.0k
74
50.0k
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
50.0k
  if (!dup)
76
0
    return NULL;
77
244k
  
for (i = 0; 50.0k
i < list->n;
++i194k
)
78
194k
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
50.0k
  return dup;
80
50.0k
}
Unexecuted instantiation: isl_aff_list_dup
isl_pw_aff_list_dup
Line
Count
Source
67
311
{
68
311
  int i;
69
311
  LIST(EL) *dup;
70
311
71
311
  if (!list)
72
0
    return NULL;
73
311
74
311
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
311
  if (!dup)
76
0
    return NULL;
77
719
  
for (i = 0; 311
i < list->n;
++i408
)
78
408
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
311
  return dup;
80
311
}
Unexecuted instantiation: isl_pw_multi_aff_list_dup
Unexecuted instantiation: isl_union_pw_aff_list_dup
Unexecuted instantiation: isl_union_pw_multi_aff_list_dup
Unexecuted instantiation: isl_ast_expr_list_dup
Unexecuted instantiation: isl_ast_node_list_dup
Unexecuted instantiation: isl_ast_graft_list_dup
isl_constraint_list_dup
Line
Count
Source
67
745
{
68
745
  int i;
69
745
  LIST(EL) *dup;
70
745
71
745
  if (!list)
72
0
    return NULL;
73
745
74
745
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
745
  if (!dup)
76
0
    return NULL;
77
2.33k
  
for (i = 0; 745
i < list->n;
++i1.58k
)
78
1.58k
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
745
  return dup;
80
745
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_dup
Unexecuted instantiation: isl_id_list_dup
Unexecuted instantiation: isl_basic_map_list_dup
Unexecuted instantiation: isl_map_list_dup
Unexecuted instantiation: isl_union_map_list_dup
Unexecuted instantiation: isl_pw_qpolynomial_list_dup
isl_schedule_tree_list_dup
Line
Count
Source
67
48.9k
{
68
48.9k
  int i;
69
48.9k
  LIST(EL) *dup;
70
48.9k
71
48.9k
  if (!list)
72
0
    return NULL;
73
48.9k
74
48.9k
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
48.9k
  if (!dup)
76
0
    return NULL;
77
241k
  
for (i = 0; 48.9k
i < list->n;
++i192k
)
78
192k
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
48.9k
  return dup;
80
48.9k
}
Unexecuted instantiation: isl_basic_set_list_dup
Unexecuted instantiation: isl_set_list_dup
Unexecuted instantiation: isl_union_set_list_dup
Unexecuted instantiation: isl_val_list_dup
81
82
__isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list)
83
108k
{
84
108k
  if (!list)
85
0
    return NULL;
86
108k
87
108k
  if (list->ref == 1)
88
58.3k
    return list;
89
50.0k
  list->ref--;
90
50.0k
  return FN(LIST(EL),dup)(list);
91
50.0k
}
isl_aff_list_cow
Line
Count
Source
83
2
{
84
2
  if (!list)
85
0
    return NULL;
86
2
87
2
  if (list->ref == 1)
88
2
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
isl_pw_aff_list_cow
Line
Count
Source
83
3.53k
{
84
3.53k
  if (!list)
85
0
    return NULL;
86
3.53k
87
3.53k
  if (list->ref == 1)
88
3.22k
    return list;
89
311
  list->ref--;
90
311
  return FN(LIST(EL),dup)(list);
91
311
}
Unexecuted instantiation: isl_pw_multi_aff_list_cow
Unexecuted instantiation: isl_union_pw_aff_list_cow
Unexecuted instantiation: isl_union_pw_multi_aff_list_cow
Unexecuted instantiation: isl_ast_expr_list_cow
Unexecuted instantiation: isl_ast_node_list_cow
isl_ast_graft_list_cow
Line
Count
Source
83
51
{
84
51
  if (!list)
85
0
    return NULL;
86
51
87
51
  if (list->ref == 1)
88
51
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
isl_constraint_list_cow
Line
Count
Source
83
2.36k
{
84
2.36k
  if (!list)
85
0
    return NULL;
86
2.36k
87
2.36k
  if (list->ref == 1)
88
1.62k
    return list;
89
745
  list->ref--;
90
745
  return FN(LIST(EL),dup)(list);
91
745
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_cow
isl_id_list_cow
Line
Count
Source
83
1
{
84
1
  if (!list)
85
0
    return NULL;
86
1
87
1
  if (list->ref == 1)
88
1
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
isl_basic_map_list_cow
Line
Count
Source
83
558
{
84
558
  if (!list)
85
0
    return NULL;
86
558
87
558
  if (list->ref == 1)
88
558
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
Unexecuted instantiation: isl_map_list_cow
isl_union_map_list_cow
Line
Count
Source
83
6
{
84
6
  if (!list)
85
0
    return NULL;
86
6
87
6
  if (list->ref == 1)
88
6
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
Unexecuted instantiation: isl_pw_qpolynomial_list_cow
isl_schedule_tree_list_cow
Line
Count
Source
83
94.8k
{
84
94.8k
  if (!list)
85
0
    return NULL;
86
94.8k
87
94.8k
  if (list->ref == 1)
88
45.8k
    return list;
89
48.9k
  list->ref--;
90
48.9k
  return FN(LIST(EL),dup)(list);
91
48.9k
}
isl_basic_set_list_cow
Line
Count
Source
83
3.77k
{
84
3.77k
  if (!list)
85
0
    return NULL;
86
3.77k
87
3.77k
  if (list->ref == 1)
88
3.77k
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
isl_set_list_cow
Line
Count
Source
83
1.88k
{
84
1.88k
  if (!list)
85
0
    return NULL;
86
1.88k
87
1.88k
  if (list->ref == 1)
88
1.88k
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
isl_union_set_list_cow
Line
Count
Source
83
1.28k
{
84
1.28k
  if (!list)
85
0
    return NULL;
86
1.28k
87
1.28k
  if (list->ref == 1)
88
1.28k
    return list;
89
0
  list->ref--;
90
0
  return FN(LIST(EL),dup)(list);
91
0
}
Unexecuted instantiation: isl_val_list_cow
92
93
/* Make sure "list" has room for at least "n" more pieces.
94
 * Always return a list with a single reference.
95
 *
96
 * If there is only one reference to list, we extend it in place.
97
 * Otherwise, we create a new LIST(EL) and copy the elements.
98
 */
99
static __isl_give LIST(EL) *FN(LIST(EL),grow)(__isl_take LIST(EL) *list, int n)
100
381k
{
101
381k
  isl_ctx *ctx;
102
381k
  int i, new_size;
103
381k
  LIST(EL) *res;
104
381k
105
381k
  if (!list)
106
9
    return NULL;
107
381k
  if (list->ref == 1 && 
list->n + n <= list->size371k
)
108
357k
    return list;
109
24.8k
110
24.8k
  ctx = FN(LIST(EL),get_ctx)(list);
111
24.8k
  new_size = ((list->n + n + 1) * 3) / 2;
112
24.8k
  if (list->ref == 1) {
113
14.7k
    res = isl_realloc(ctx, list, LIST(EL),
114
14.7k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
14.7k
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
14.7k
    res->size = new_size;
118
14.7k
    return res;
119
14.7k
  }
120
10.0k
121
10.0k
  if (list->n + n <= list->size && 
list->size < new_size2.82k
)
122
2.75k
    new_size = list->size;
123
10.0k
124
10.0k
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
10.0k
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
10.0k
128
38.7k
  
for (i = 0; 10.0k
i < list->n;
++i28.7k
)
129
28.7k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
10.0k
131
10.0k
  FN(LIST(EL),free)(list);
132
10.0k
  return res;
133
10.0k
}
isl_aff.c:isl_aff_list_grow
Line
Count
Source
100
8.50k
{
101
8.50k
  isl_ctx *ctx;
102
8.50k
  int i, new_size;
103
8.50k
  LIST(EL) *res;
104
8.50k
105
8.50k
  if (!list)
106
0
    return NULL;
107
8.50k
  if (list->ref == 1 && list->n + n <= list->size)
108
8.48k
    return list;
109
20
110
20
  ctx = FN(LIST(EL),get_ctx)(list);
111
20
  new_size = ((list->n + n + 1) * 3) / 2;
112
20
  if (list->ref == 1) {
113
20
    res = isl_realloc(ctx, list, LIST(EL),
114
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
20
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
20
    res->size = new_size;
118
20
    return res;
119
20
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_aff.c:isl_pw_aff_list_grow
Line
Count
Source
100
20.0k
{
101
20.0k
  isl_ctx *ctx;
102
20.0k
  int i, new_size;
103
20.0k
  LIST(EL) *res;
104
20.0k
105
20.0k
  if (!list)
106
0
    return NULL;
107
20.0k
  if (list->ref == 1 && list->n + n <= list->size)
108
14.3k
    return list;
109
5.62k
110
5.62k
  ctx = FN(LIST(EL),get_ctx)(list);
111
5.62k
  new_size = ((list->n + n + 1) * 3) / 2;
112
5.62k
  if (list->ref == 1) {
113
5.62k
    res = isl_realloc(ctx, list, LIST(EL),
114
5.62k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
5.62k
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
5.62k
    res->size = new_size;
118
5.62k
    return res;
119
5.62k
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
Unexecuted instantiation: isl_aff.c:isl_pw_multi_aff_list_grow
isl_aff.c:isl_union_pw_aff_list_grow
Line
Count
Source
100
144
{
101
144
  isl_ctx *ctx;
102
144
  int i, new_size;
103
144
  LIST(EL) *res;
104
144
105
144
  if (!list)
106
0
    return NULL;
107
144
  if (list->ref == 1 && list->n + n <= list->size)
108
28
    return list;
109
116
110
116
  ctx = FN(LIST(EL),get_ctx)(list);
111
116
  new_size = ((list->n + n + 1) * 3) / 2;
112
116
  if (list->ref == 1) {
113
116
    res = isl_realloc(ctx, list, LIST(EL),
114
116
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
116
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
116
    res->size = new_size;
118
116
    return res;
119
116
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_aff.c:isl_union_pw_multi_aff_list_grow
Line
Count
Source
100
8
{
101
8
  isl_ctx *ctx;
102
8
  int i, new_size;
103
8
  LIST(EL) *res;
104
8
105
8
  if (!list)
106
0
    return NULL;
107
8
  if (list->ref == 1 && list->n + n <= list->size)
108
8
    return list;
109
0
110
0
  ctx = FN(LIST(EL),get_ctx)(list);
111
0
  new_size = ((list->n + n + 1) * 3) / 2;
112
0
  if (list->ref == 1) {
113
0
    res = isl_realloc(ctx, list, LIST(EL),
114
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
0
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
0
    res->size = new_size;
118
0
    return res;
119
0
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_grow
isl_ast.c:isl_ast_node_list_grow
Line
Count
Source
100
6.22k
{
101
6.22k
  isl_ctx *ctx;
102
6.22k
  int i, new_size;
103
6.22k
  LIST(EL) *res;
104
6.22k
105
6.22k
  if (!list)
106
0
    return NULL;
107
6.22k
  if (list->ref == 1 && list->n + n <= list->size)
108
6.15k
    return list;
109
71
110
71
  ctx = FN(LIST(EL),get_ctx)(list);
111
71
  new_size = ((list->n + n + 1) * 3) / 2;
112
71
  if (list->ref == 1) {
113
71
    res = isl_realloc(ctx, list, LIST(EL),
114
71
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
71
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
71
    res->size = new_size;
118
71
    return res;
119
71
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_ast_graft.c:isl_ast_graft_list_grow
Line
Count
Source
100
17.0k
{
101
17.0k
  isl_ctx *ctx;
102
17.0k
  int i, new_size;
103
17.0k
  LIST(EL) *res;
104
17.0k
105
17.0k
  if (!list)
106
0
    return NULL;
107
17.0k
  if (list->ref == 1 && list->n + n <= list->size)
108
17.0k
    return list;
109
0
110
0
  ctx = FN(LIST(EL),get_ctx)(list);
111
0
  new_size = ((list->n + n + 1) * 3) / 2;
112
0
  if (list->ref == 1) {
113
0
    res = isl_realloc(ctx, list, LIST(EL),
114
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
0
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
0
    res->size = new_size;
118
0
    return res;
119
0
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_constraint.c:isl_constraint_list_grow
Line
Count
Source
100
3.81k
{
101
3.81k
  isl_ctx *ctx;
102
3.81k
  int i, new_size;
103
3.81k
  LIST(EL) *res;
104
3.81k
105
3.81k
  if (!list)
106
0
    return NULL;
107
3.81k
  if (list->ref == 1 && list->n + n <= list->size)
108
3.81k
    return list;
109
0
110
0
  ctx = FN(LIST(EL),get_ctx)(list);
111
0
  new_size = ((list->n + n + 1) * 3) / 2;
112
0
  if (list->ref == 1) {
113
0
    res = isl_realloc(ctx, list, LIST(EL),
114
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
0
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
0
    res->size = new_size;
118
0
    return res;
119
0
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_grow
isl_id.c:isl_id_list_grow
Line
Count
Source
100
2.58k
{
101
2.58k
  isl_ctx *ctx;
102
2.58k
  int i, new_size;
103
2.58k
  LIST(EL) *res;
104
2.58k
105
2.58k
  if (!list)
106
0
    return NULL;
107
2.58k
  if (list->ref == 1 && list->n + n <= list->size)
108
2.58k
    return list;
109
0
110
0
  ctx = FN(LIST(EL),get_ctx)(list);
111
0
  new_size = ((list->n + n + 1) * 3) / 2;
112
0
  if (list->ref == 1) {
113
0
    res = isl_realloc(ctx, list, LIST(EL),
114
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
0
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
0
    res->size = new_size;
118
0
    return res;
119
0
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_map_list.c:isl_basic_map_list_grow
Line
Count
Source
100
18.2k
{
101
18.2k
  isl_ctx *ctx;
102
18.2k
  int i, new_size;
103
18.2k
  LIST(EL) *res;
104
18.2k
105
18.2k
  if (!list)
106
0
    return NULL;
107
18.2k
  if (list->ref == 1 && list->n + n <= list->size)
108
18.2k
    return list;
109
0
110
0
  ctx = FN(LIST(EL),get_ctx)(list);
111
0
  new_size = ((list->n + n + 1) * 3) / 2;
112
0
  if (list->ref == 1) {
113
0
    res = isl_realloc(ctx, list, LIST(EL),
114
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
0
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
0
    res->size = new_size;
118
0
    return res;
119
0
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_map_list.c:isl_map_list_grow
Line
Count
Source
100
13.2k
{
101
13.2k
  isl_ctx *ctx;
102
13.2k
  int i, new_size;
103
13.2k
  LIST(EL) *res;
104
13.2k
105
13.2k
  if (!list)
106
9
    return NULL;
107
13.2k
  if (list->ref == 1 && list->n + n <= list->size)
108
13.2k
    return list;
109
0
110
0
  ctx = FN(LIST(EL),get_ctx)(list);
111
0
  new_size = ((list->n + n + 1) * 3) / 2;
112
0
  if (list->ref == 1) {
113
0
    res = isl_realloc(ctx, list, LIST(EL),
114
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
0
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
0
    res->size = new_size;
118
0
    return res;
119
0
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_map_list.c:isl_union_map_list_grow
Line
Count
Source
100
5
{
101
5
  isl_ctx *ctx;
102
5
  int i, new_size;
103
5
  LIST(EL) *res;
104
5
105
5
  if (!list)
106
0
    return NULL;
107
5
  if (list->ref == 1 && list->n + n <= list->size)
108
4
    return list;
109
1
110
1
  ctx = FN(LIST(EL),get_ctx)(list);
111
1
  new_size = ((list->n + n + 1) * 3) / 2;
112
1
  if (list->ref == 1) {
113
1
    res = isl_realloc(ctx, list, LIST(EL),
114
1
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
1
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
1
    res->size = new_size;
118
1
    return res;
119
1
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_grow
isl_schedule_tree.c:isl_schedule_tree_list_grow
Line
Count
Source
100
270k
{
101
270k
  isl_ctx *ctx;
102
270k
  int i, new_size;
103
270k
  LIST(EL) *res;
104
270k
105
270k
  if (!list)
106
0
    return NULL;
107
270k
  if (list->ref == 1 && 
list->n + n <= list->size260k
)
108
251k
    return list;
109
18.6k
110
18.6k
  ctx = FN(LIST(EL),get_ctx)(list);
111
18.6k
  new_size = ((list->n + n + 1) * 3) / 2;
112
18.6k
  if (list->ref == 1) {
113
8.64k
    res = isl_realloc(ctx, list, LIST(EL),
114
8.64k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
8.64k
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
8.64k
    res->size = new_size;
118
8.64k
    return res;
119
8.64k
  }
120
10.0k
121
10.0k
  if (list->n + n <= list->size && 
list->size < new_size2.82k
)
122
2.75k
    new_size = list->size;
123
10.0k
124
10.0k
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
10.0k
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
10.0k
128
38.7k
  
for (i = 0; 10.0k
i < list->n;
++i28.7k
)
129
28.7k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
10.0k
131
10.0k
  FN(LIST(EL),free)(list);
132
10.0k
  return res;
133
10.0k
}
isl_set_list.c:isl_basic_set_list_grow
Line
Count
Source
100
5.16k
{
101
5.16k
  isl_ctx *ctx;
102
5.16k
  int i, new_size;
103
5.16k
  LIST(EL) *res;
104
5.16k
105
5.16k
  if (!list)
106
0
    return NULL;
107
5.16k
  if (list->ref == 1 && list->n + n <= list->size)
108
5.16k
    return list;
109
2
110
2
  ctx = FN(LIST(EL),get_ctx)(list);
111
2
  new_size = ((list->n + n + 1) * 3) / 2;
112
2
  if (list->ref == 1) {
113
2
    res = isl_realloc(ctx, list, LIST(EL),
114
2
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
2
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
2
    res->size = new_size;
118
2
    return res;
119
2
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_set_list.c:isl_set_list_grow
Line
Count
Source
100
14.9k
{
101
14.9k
  isl_ctx *ctx;
102
14.9k
  int i, new_size;
103
14.9k
  LIST(EL) *res;
104
14.9k
105
14.9k
  if (!list)
106
0
    return NULL;
107
14.9k
  if (list->ref == 1 && list->n + n <= list->size)
108
14.9k
    return list;
109
20
110
20
  ctx = FN(LIST(EL),get_ctx)(list);
111
20
  new_size = ((list->n + n + 1) * 3) / 2;
112
20
  if (list->ref == 1) {
113
20
    res = isl_realloc(ctx, list, LIST(EL),
114
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
20
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
20
    res->size = new_size;
118
20
    return res;
119
20
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_set_list.c:isl_union_set_list_grow
Line
Count
Source
100
1.86k
{
101
1.86k
  isl_ctx *ctx;
102
1.86k
  int i, new_size;
103
1.86k
  LIST(EL) *res;
104
1.86k
105
1.86k
  if (!list)
106
0
    return NULL;
107
1.86k
  if (list->ref == 1 && list->n + n <= list->size)
108
1.59k
    return list;
109
269
110
269
  ctx = FN(LIST(EL),get_ctx)(list);
111
269
  new_size = ((list->n + n + 1) * 3) / 2;
112
269
  if (list->ref == 1) {
113
269
    res = isl_realloc(ctx, list, LIST(EL),
114
269
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
269
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
269
    res->size = new_size;
118
269
    return res;
119
269
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
isl_val.c:isl_val_list_grow
Line
Count
Source
100
17
{
101
17
  isl_ctx *ctx;
102
17
  int i, new_size;
103
17
  LIST(EL) *res;
104
17
105
17
  if (!list)
106
0
    return NULL;
107
17
  if (list->ref == 1 && list->n + n <= list->size)
108
9
    return list;
109
8
110
8
  ctx = FN(LIST(EL),get_ctx)(list);
111
8
  new_size = ((list->n + n + 1) * 3) / 2;
112
8
  if (list->ref == 1) {
113
8
    res = isl_realloc(ctx, list, LIST(EL),
114
8
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
8
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
8
    res->size = new_size;
118
8
    return res;
119
8
  }
120
0
121
0
  if (list->n + n <= list->size && list->size < new_size)
122
0
    new_size = list->size;
123
0
124
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
0
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
0
128
0
  for (i = 0; i < list->n; ++i)
129
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
0
131
0
  FN(LIST(EL),free)(list);
132
0
  return res;
133
0
}
134
135
/* Check that "index" is a valid position in "list".
136
 */
137
static isl_stat FN(LIST(EL),check_index)(__isl_keep LIST(EL) *list, int index)
138
735k
{
139
735k
  if (!list)
140
0
    return isl_stat_error;
141
735k
  if (index < 0 || index >= list->n)
142
735k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
735k
      "index out of bounds", return isl_stat_error);
144
735k
  return isl_stat_ok;
145
735k
}
isl_aff.c:isl_aff_list_check_index
Line
Count
Source
138
8.92k
{
139
8.92k
  if (!list)
140
0
    return isl_stat_error;
141
8.92k
  if (index < 0 || index >= list->n)
142
8.92k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
8.92k
      "index out of bounds", return isl_stat_error);
144
8.92k
  return isl_stat_ok;
145
8.92k
}
isl_aff.c:isl_pw_aff_list_check_index
Line
Count
Source
138
25.7k
{
139
25.7k
  if (!list)
140
0
    return isl_stat_error;
141
25.7k
  if (index < 0 || index >= list->n)
142
25.7k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
25.7k
      "index out of bounds", return isl_stat_error);
144
25.7k
  return isl_stat_ok;
145
25.7k
}
Unexecuted instantiation: isl_aff.c:isl_pw_multi_aff_list_check_index
isl_aff.c:isl_union_pw_aff_list_check_index
Line
Count
Source
138
288
{
139
288
  if (!list)
140
0
    return isl_stat_error;
141
288
  if (index < 0 || index >= list->n)
142
288
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
288
      "index out of bounds", return isl_stat_error);
144
288
  return isl_stat_ok;
145
288
}
isl_aff.c:isl_union_pw_multi_aff_list_check_index
Line
Count
Source
138
8
{
139
8
  if (!list)
140
0
    return isl_stat_error;
141
8
  if (index < 0 || index >= list->n)
142
8
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
8
      "index out of bounds", return isl_stat_error);
144
8
  return isl_stat_ok;
145
8
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_check_index
isl_ast.c:isl_ast_node_list_check_index
Line
Count
Source
138
4.51k
{
139
4.51k
  if (!list)
140
0
    return isl_stat_error;
141
4.51k
  if (index < 0 || index >= list->n)
142
4.51k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
4.51k
      "index out of bounds", return isl_stat_error);
144
4.51k
  return isl_stat_ok;
145
4.51k
}
isl_ast_graft.c:isl_ast_graft_list_check_index
Line
Count
Source
138
41.2k
{
139
41.2k
  if (!list)
140
0
    return isl_stat_error;
141
41.2k
  if (index < 0 || index >= list->n)
142
41.2k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
41.2k
      "index out of bounds", return isl_stat_error);
144
41.2k
  return isl_stat_ok;
145
41.2k
}
isl_constraint.c:isl_constraint_list_check_index
Line
Count
Source
138
2.17k
{
139
2.17k
  if (!list)
140
0
    return isl_stat_error;
141
2.17k
  if (index < 0 || index >= list->n)
142
2.17k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
2.17k
      "index out of bounds", return isl_stat_error);
144
2.17k
  return isl_stat_ok;
145
2.17k
}
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_check_index
isl_id.c:isl_id_list_check_index
Line
Count
Source
138
23.4k
{
139
23.4k
  if (!list)
140
0
    return isl_stat_error;
141
23.4k
  if (index < 0 || index >= list->n)
142
23.4k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
23.4k
      "index out of bounds", return isl_stat_error);
144
23.4k
  return isl_stat_ok;
145
23.4k
}
isl_map_list.c:isl_basic_map_list_check_index
Line
Count
Source
138
15.9k
{
139
15.9k
  if (!list)
140
0
    return isl_stat_error;
141
15.9k
  if (index < 0 || index >= list->n)
142
15.9k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
15.9k
      "index out of bounds", return isl_stat_error);
144
15.9k
  return isl_stat_ok;
145
15.9k
}
isl_map_list.c:isl_map_list_check_index
Line
Count
Source
138
9.48k
{
139
9.48k
  if (!list)
140
0
    return isl_stat_error;
141
9.48k
  if (index < 0 || index >= list->n)
142
9.48k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
9.48k
      "index out of bounds", return isl_stat_error);
144
9.48k
  return isl_stat_ok;
145
9.48k
}
isl_map_list.c:isl_union_map_list_check_index
Line
Count
Source
138
11
{
139
11
  if (!list)
140
0
    return isl_stat_error;
141
11
  if (index < 0 || index >= list->n)
142
11
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
11
      "index out of bounds", return isl_stat_error);
144
11
  return isl_stat_ok;
145
11
}
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_check_index
isl_schedule_tree.c:isl_schedule_tree_list_check_index
Line
Count
Source
138
559k
{
139
559k
  if (!list)
140
0
    return isl_stat_error;
141
559k
  if (index < 0 || index >= list->n)
142
559k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
559k
      "index out of bounds", return isl_stat_error);
144
559k
  return isl_stat_ok;
145
559k
}
isl_set_list.c:isl_basic_set_list_check_index
Line
Count
Source
138
16.1k
{
139
16.1k
  if (!list)
140
0
    return isl_stat_error;
141
16.1k
  if (index < 0 || index >= list->n)
142
16.1k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
16.1k
      "index out of bounds", return isl_stat_error);
144
16.1k
  return isl_stat_ok;
145
16.1k
}
isl_set_list.c:isl_set_list_check_index
Line
Count
Source
138
25.2k
{
139
25.2k
  if (!list)
140
0
    return isl_stat_error;
141
25.2k
  if (index < 0 || index >= list->n)
142
25.2k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
25.2k
      "index out of bounds", return isl_stat_error);
144
25.2k
  return isl_stat_ok;
145
25.2k
}
isl_set_list.c:isl_union_set_list_check_index
Line
Count
Source
138
2.92k
{
139
2.92k
  if (!list)
140
0
    return isl_stat_error;
141
2.92k
  if (index < 0 || index >= list->n)
142
2.92k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
2.92k
      "index out of bounds", return isl_stat_error);
144
2.92k
  return isl_stat_ok;
145
2.92k
}
isl_val.c:isl_val_list_check_index
Line
Count
Source
138
34
{
139
34
  if (!list)
140
0
    return isl_stat_error;
141
34
  if (index < 0 || index >= list->n)
142
34
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
34
      "index out of bounds", return isl_stat_error);
144
34
  return isl_stat_ok;
145
34
}
146
147
__isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
148
  __isl_take struct EL *el)
149
381k
{
150
381k
  list = FN(LIST(EL),grow)(list, 1);
151
381k
  if (!list || 
!el381k
)
152
9
    goto error;
153
381k
  list->p[list->n] = el;
154
381k
  list->n++;
155
381k
  return list;
156
381k
error:
157
9
  FN(EL,free)(el);
158
9
  FN(LIST(EL),free)(list);
159
9
  return NULL;
160
381k
}
isl_aff_list_add
Line
Count
Source
149
8.50k
{
150
8.50k
  list = FN(LIST(EL),grow)(list, 1);
151
8.50k
  if (!list || !el)
152
0
    goto error;
153
8.50k
  list->p[list->n] = el;
154
8.50k
  list->n++;
155
8.50k
  return list;
156
8.50k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
8.50k
}
isl_pw_aff_list_add
Line
Count
Source
149
20.0k
{
150
20.0k
  list = FN(LIST(EL),grow)(list, 1);
151
20.0k
  if (!list || !el)
152
0
    goto error;
153
20.0k
  list->p[list->n] = el;
154
20.0k
  list->n++;
155
20.0k
  return list;
156
20.0k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
20.0k
}
Unexecuted instantiation: isl_pw_multi_aff_list_add
isl_union_pw_aff_list_add
Line
Count
Source
149
144
{
150
144
  list = FN(LIST(EL),grow)(list, 1);
151
144
  if (!list || !el)
152
0
    goto error;
153
144
  list->p[list->n] = el;
154
144
  list->n++;
155
144
  return list;
156
144
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
144
}
isl_union_pw_multi_aff_list_add
Line
Count
Source
149
8
{
150
8
  list = FN(LIST(EL),grow)(list, 1);
151
8
  if (!list || !el)
152
0
    goto error;
153
8
  list->p[list->n] = el;
154
8
  list->n++;
155
8
  return list;
156
8
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
8
}
Unexecuted instantiation: isl_ast_expr_list_add
isl_ast_node_list_add
Line
Count
Source
149
6.22k
{
150
6.22k
  list = FN(LIST(EL),grow)(list, 1);
151
6.22k
  if (!list || !el)
152
0
    goto error;
153
6.22k
  list->p[list->n] = el;
154
6.22k
  list->n++;
155
6.22k
  return list;
156
6.22k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
6.22k
}
isl_ast_graft_list_add
Line
Count
Source
149
17.0k
{
150
17.0k
  list = FN(LIST(EL),grow)(list, 1);
151
17.0k
  if (!list || !el)
152
0
    goto error;
153
17.0k
  list->p[list->n] = el;
154
17.0k
  list->n++;
155
17.0k
  return list;
156
17.0k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
17.0k
}
isl_constraint_list_add
Line
Count
Source
149
3.81k
{
150
3.81k
  list = FN(LIST(EL),grow)(list, 1);
151
3.81k
  if (!list || !el)
152
0
    goto error;
153
3.81k
  list->p[list->n] = el;
154
3.81k
  list->n++;
155
3.81k
  return list;
156
3.81k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
3.81k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_add
isl_id_list_add
Line
Count
Source
149
2.58k
{
150
2.58k
  list = FN(LIST(EL),grow)(list, 1);
151
2.58k
  if (!list || !el)
152
0
    goto error;
153
2.58k
  list->p[list->n] = el;
154
2.58k
  list->n++;
155
2.58k
  return list;
156
2.58k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
2.58k
}
isl_basic_map_list_add
Line
Count
Source
149
18.2k
{
150
18.2k
  list = FN(LIST(EL),grow)(list, 1);
151
18.2k
  if (!list || !el)
152
0
    goto error;
153
18.2k
  list->p[list->n] = el;
154
18.2k
  list->n++;
155
18.2k
  return list;
156
18.2k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
18.2k
}
isl_map_list_add
Line
Count
Source
149
13.2k
{
150
13.2k
  list = FN(LIST(EL),grow)(list, 1);
151
13.2k
  if (!list || 
!el13.2k
)
152
9
    goto error;
153
13.2k
  list->p[list->n] = el;
154
13.2k
  list->n++;
155
13.2k
  return list;
156
13.2k
error:
157
9
  FN(EL,free)(el);
158
9
  FN(LIST(EL),free)(list);
159
9
  return NULL;
160
13.2k
}
isl_union_map_list_add
Line
Count
Source
149
5
{
150
5
  list = FN(LIST(EL),grow)(list, 1);
151
5
  if (!list || !el)
152
0
    goto error;
153
5
  list->p[list->n] = el;
154
5
  list->n++;
155
5
  return list;
156
5
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
5
}
Unexecuted instantiation: isl_pw_qpolynomial_list_add
isl_schedule_tree_list_add
Line
Count
Source
149
270k
{
150
270k
  list = FN(LIST(EL),grow)(list, 1);
151
270k
  if (!list || !el)
152
0
    goto error;
153
270k
  list->p[list->n] = el;
154
270k
  list->n++;
155
270k
  return list;
156
270k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
270k
}
isl_basic_set_list_add
Line
Count
Source
149
5.16k
{
150
5.16k
  list = FN(LIST(EL),grow)(list, 1);
151
5.16k
  if (!list || !el)
152
0
    goto error;
153
5.16k
  list->p[list->n] = el;
154
5.16k
  list->n++;
155
5.16k
  return list;
156
5.16k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
5.16k
}
isl_set_list_add
Line
Count
Source
149
14.9k
{
150
14.9k
  list = FN(LIST(EL),grow)(list, 1);
151
14.9k
  if (!list || !el)
152
0
    goto error;
153
14.9k
  list->p[list->n] = el;
154
14.9k
  list->n++;
155
14.9k
  return list;
156
14.9k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
14.9k
}
isl_union_set_list_add
Line
Count
Source
149
1.86k
{
150
1.86k
  list = FN(LIST(EL),grow)(list, 1);
151
1.86k
  if (!list || !el)
152
0
    goto error;
153
1.86k
  list->p[list->n] = el;
154
1.86k
  list->n++;
155
1.86k
  return list;
156
1.86k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
1.86k
}
isl_val_list_add
Line
Count
Source
149
17
{
150
17
  list = FN(LIST(EL),grow)(list, 1);
151
17
  if (!list || !el)
152
0
    goto error;
153
17
  list->p[list->n] = el;
154
17
  list->n++;
155
17
  return list;
156
17
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
17
}
161
162
/* Remove the "n" elements starting at "first" from "list".
163
 */
164
__isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list,
165
  unsigned first, unsigned n)
166
71.2k
{
167
71.2k
  int i;
168
71.2k
169
71.2k
  if (!list)
170
0
    return NULL;
171
71.2k
  if (first + n > list->n || first + n < first)
172
71.2k
    
isl_die0
(list->ctx, isl_error_invalid,
173
71.2k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
71.2k
  if (n == 0)
175
696
    return list;
176
70.5k
  list = FN(LIST(EL),cow)(list);
177
70.5k
  if (!list)
178
0
    return NULL;
179
205k
  
for (i = 0; 70.5k
i < n;
++i134k
)
180
134k
    FN(EL,free)(list->p[first + i]);
181
73.1k
  for (i = first; i + n < list->n; 
++i2.60k
)
182
2.60k
    list->p[i] = list->p[i + n];
183
70.5k
  list->n -= n;
184
70.5k
  return list;
185
70.5k
}
Unexecuted instantiation: isl_aff_list_drop
Unexecuted instantiation: isl_pw_aff_list_drop
Unexecuted instantiation: isl_pw_multi_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
isl_constraint_list_drop
Line
Count
Source
166
2.23k
{
167
2.23k
  int i;
168
2.23k
169
2.23k
  if (!list)
170
0
    return NULL;
171
2.23k
  if (first + n > list->n || first + n < first)
172
2.23k
    
isl_die0
(list->ctx, isl_error_invalid,
173
2.23k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
2.23k
  if (n == 0)
175
696
    return list;
176
1.53k
  list = FN(LIST(EL),cow)(list);
177
1.53k
  if (!list)
178
0
    return NULL;
179
3.17k
  
for (i = 0; 1.53k
i < n;
++i1.64k
)
180
1.64k
    FN(EL,free)(list->p[first + i]);
181
2.46k
  for (i = first; i + n < list->n; 
++i926
)
182
926
    list->p[i] = list->p[i + n];
183
1.53k
  list->n -= n;
184
1.53k
  return list;
185
1.53k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_drop
isl_id_list_drop
Line
Count
Source
166
1
{
167
1
  int i;
168
1
169
1
  if (!list)
170
0
    return NULL;
171
1
  if (first + n > list->n || first + n < first)
172
1
    
isl_die0
(list->ctx, isl_error_invalid,
173
1
      "index out of bounds", return FN(LIST(EL),free)(list));
174
1
  if (n == 0)
175
0
    return list;
176
1
  list = FN(LIST(EL),cow)(list);
177
1
  if (!list)
178
0
    return NULL;
179
2
  
for (i = 0; 1
i < n;
++i1
)
180
1
    FN(EL,free)(list->p[first + i]);
181
3
  for (i = first; i + n < list->n; 
++i2
)
182
2
    list->p[i] = list->p[i + n];
183
1
  list->n -= n;
184
1
  return list;
185
1
}
Unexecuted instantiation: isl_basic_map_list_drop
Unexecuted instantiation: isl_map_list_drop
isl_union_map_list_drop
Line
Count
Source
166
4
{
167
4
  int i;
168
4
169
4
  if (!list)
170
0
    return NULL;
171
4
  if (first + n > list->n || first + n < first)
172
4
    
isl_die0
(list->ctx, isl_error_invalid,
173
4
      "index out of bounds", return FN(LIST(EL),free)(list));
174
4
  if (n == 0)
175
0
    return list;
176
4
  list = FN(LIST(EL),cow)(list);
177
4
  if (!list)
178
0
    return NULL;
179
8
  
for (i = 0; 4
i < n;
++i4
)
180
4
    FN(EL,free)(list->p[first + i]);
181
4
  for (i = first; i + n < list->n; 
++i0
)
182
0
    list->p[i] = list->p[i + n];
183
4
  list->n -= n;
184
4
  return list;
185
4
}
Unexecuted instantiation: isl_pw_qpolynomial_list_drop
isl_schedule_tree_list_drop
Line
Count
Source
166
67.7k
{
167
67.7k
  int i;
168
67.7k
169
67.7k
  if (!list)
170
0
    return NULL;
171
67.7k
  if (first + n > list->n || first + n < first)
172
67.7k
    
isl_die0
(list->ctx, isl_error_invalid,
173
67.7k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
67.7k
  if (n == 0)
175
0
    return list;
176
67.7k
  list = FN(LIST(EL),cow)(list);
177
67.7k
  if (!list)
178
0
    return NULL;
179
199k
  
for (i = 0; 67.7k
i < n;
++i131k
)
180
131k
    FN(EL,free)(list->p[first + i]);
181
69.3k
  for (i = first; i + n < list->n; 
++i1.67k
)
182
1.67k
    list->p[i] = list->p[i + n];
183
67.7k
  list->n -= n;
184
67.7k
  return list;
185
67.7k
}
isl_basic_set_list_drop
Line
Count
Source
166
4
{
167
4
  int i;
168
4
169
4
  if (!list)
170
0
    return NULL;
171
4
  if (first + n > list->n || first + n < first)
172
4
    
isl_die0
(list->ctx, isl_error_invalid,
173
4
      "index out of bounds", return FN(LIST(EL),free)(list));
174
4
  if (n == 0)
175
0
    return list;
176
4
  list = FN(LIST(EL),cow)(list);
177
4
  if (!list)
178
0
    return NULL;
179
12
  
for (i = 0; 4
i < n;
++i8
)
180
8
    FN(EL,free)(list->p[first + i]);
181
4
  for (i = first; i + n < list->n; 
++i0
)
182
0
    list->p[i] = list->p[i + n];
183
4
  list->n -= n;
184
4
  return list;
185
4
}
Unexecuted instantiation: isl_set_list_drop
isl_union_set_list_drop
Line
Count
Source
166
1.28k
{
167
1.28k
  int i;
168
1.28k
169
1.28k
  if (!list)
170
0
    return NULL;
171
1.28k
  if (first + n > list->n || first + n < first)
172
1.28k
    
isl_die0
(list->ctx, isl_error_invalid,
173
1.28k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
1.28k
  if (n == 0)
175
0
    return list;
176
1.28k
  list = FN(LIST(EL),cow)(list);
177
1.28k
  if (!list)
178
0
    return NULL;
179
2.56k
  
for (i = 0; 1.28k
i < n;
++i1.28k
)
180
1.28k
    FN(EL,free)(list->p[first + i]);
181
1.28k
  for (i = first; i + n < list->n; 
++i0
)
182
0
    list->p[i] = list->p[i + n];
183
1.28k
  list->n -= n;
184
1.28k
  return list;
185
1.28k
}
Unexecuted instantiation: isl_val_list_drop
186
187
/* Insert "el" at position "pos" in "list".
188
 *
189
 * If there is only one reference to "list" and if it already has space
190
 * for one extra element, we insert it directly into "list".
191
 * Otherwise, we create a new list consisting of "el" and copied
192
 * elements from "list".
193
 */
194
__isl_give LIST(EL) *FN(LIST(EL),insert)(__isl_take LIST(EL) *list,
195
  unsigned pos, __isl_take struct EL *el)
196
30
{
197
30
  int i;
198
30
  isl_ctx *ctx;
199
30
  LIST(EL) *res;
200
30
201
30
  if (!list || !el)
202
0
    goto error;
203
30
  ctx = FN(LIST(EL),get_ctx)(list);
204
30
  if (pos > list->n)
205
30
    
isl_die0
(ctx, isl_error_invalid,
206
30
      "index out of bounds", goto error);
207
30
208
30
  if (list->ref == 1 && 
list->size > list->n27
) {
209
2
    for (i = list->n; i > pos; 
--i1
)
210
1
      list->p[i] = list->p[i - 1];
211
1
    list->n++;
212
1
    list->p[pos] = el;
213
1
    return list;
214
1
  }
215
29
216
29
  res = FN(LIST(EL),alloc)(ctx, list->n + 1);
217
68
  for (i = 0; i < pos; 
++i39
)
218
39
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
219
29
  res = FN(LIST(EL),add)(res, el);
220
31
  for (i = pos; i < list->n; 
++i2
)
221
2
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
222
29
  FN(LIST(EL),free)(list);
223
29
224
29
  return res;
225
29
error:
226
0
  FN(EL,free)(el);
227
0
  FN(LIST(EL),free)(list);
228
0
  return NULL;
229
29
}
Unexecuted instantiation: isl_aff_list_insert
Unexecuted instantiation: isl_pw_aff_list_insert
Unexecuted instantiation: isl_pw_multi_aff_list_insert
Unexecuted instantiation: isl_union_pw_aff_list_insert
Unexecuted instantiation: isl_union_pw_multi_aff_list_insert
Unexecuted instantiation: isl_ast_expr_list_insert
Unexecuted instantiation: isl_ast_node_list_insert
isl_ast_graft_list_insert
Line
Count
Source
196
26
{
197
26
  int i;
198
26
  isl_ctx *ctx;
199
26
  LIST(EL) *res;
200
26
201
26
  if (!list || !el)
202
0
    goto error;
203
26
  ctx = FN(LIST(EL),get_ctx)(list);
204
26
  if (pos > list->n)
205
26
    
isl_die0
(ctx, isl_error_invalid,
206
26
      "index out of bounds", goto error);
207
26
208
26
  if (list->ref == 1 && list->size > list->n) {
209
0
    for (i = list->n; i > pos; --i)
210
0
      list->p[i] = list->p[i - 1];
211
0
    list->n++;
212
0
    list->p[pos] = el;
213
0
    return list;
214
0
  }
215
26
216
26
  res = FN(LIST(EL),alloc)(ctx, list->n + 1);
217
62
  for (i = 0; i < pos; 
++i36
)
218
36
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
219
26
  res = FN(LIST(EL),add)(res, el);
220
28
  for (i = pos; i < list->n; 
++i2
)
221
2
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
222
26
  FN(LIST(EL),free)(list);
223
26
224
26
  return res;
225
26
error:
226
0
  FN(EL,free)(el);
227
0
  FN(LIST(EL),free)(list);
228
0
  return NULL;
229
26
}
Unexecuted instantiation: isl_constraint_list_insert
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_insert
isl_id_list_insert
Line
Count
Source
196
4
{
197
4
  int i;
198
4
  isl_ctx *ctx;
199
4
  LIST(EL) *res;
200
4
201
4
  if (!list || !el)
202
0
    goto error;
203
4
  ctx = FN(LIST(EL),get_ctx)(list);
204
4
  if (pos > list->n)
205
4
    
isl_die0
(ctx, isl_error_invalid,
206
4
      "index out of bounds", goto error);
207
4
208
4
  if (list->ref == 1 && 
list->size > list->n1
) {
209
2
    for (i = list->n; i > pos; 
--i1
)
210
1
      list->p[i] = list->p[i - 1];
211
1
    list->n++;
212
1
    list->p[pos] = el;
213
1
    return list;
214
1
  }
215
3
216
3
  res = FN(LIST(EL),alloc)(ctx, list->n + 1);
217
6
  for (i = 0; i < pos; 
++i3
)
218
3
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
219
3
  res = FN(LIST(EL),add)(res, el);
220
3
  for (i = pos; i < list->n; 
++i0
)
221
0
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
222
3
  FN(LIST(EL),free)(list);
223
3
224
3
  return res;
225
3
error:
226
0
  FN(EL,free)(el);
227
0
  FN(LIST(EL),free)(list);
228
0
  return NULL;
229
3
}
Unexecuted instantiation: isl_basic_map_list_insert
Unexecuted instantiation: isl_map_list_insert
Unexecuted instantiation: isl_union_map_list_insert
Unexecuted instantiation: isl_pw_qpolynomial_list_insert
Unexecuted instantiation: isl_schedule_tree_list_insert
Unexecuted instantiation: isl_basic_set_list_insert
Unexecuted instantiation: isl_set_list_insert
Unexecuted instantiation: isl_union_set_list_insert
Unexecuted instantiation: isl_val_list_insert
230
231
__isl_null LIST(EL) *FN(LIST(EL),free)(__isl_take LIST(EL) *list)
232
260k
{
233
260k
  int i;
234
260k
235
260k
  if (!list)
236
38.8k
    return NULL;
237
221k
238
221k
  if (--list->ref > 0)
239
60.7k
    return NULL;
240
160k
241
160k
  isl_ctx_deref(list->ctx);
242
408k
  for (i = 0; i < list->n; 
++i247k
)
243
247k
    FN(EL,free)(list->p[i]);
244
160k
  free(list);
245
160k
246
160k
  return NULL;
247
160k
}
isl_aff_list_free
Line
Count
Source
232
16.7k
{
233
16.7k
  int i;
234
16.7k
235
16.7k
  if (!list)
236
8.18k
    return NULL;
237
8.58k
238
8.58k
  if (--list->ref > 0)
239
0
    return NULL;
240
8.58k
241
8.58k
  isl_ctx_deref(list->ctx);
242
17.0k
  for (i = 0; i < list->n; 
++i8.50k
)
243
8.58k
    
FN8.50k
(EL,free)(list->p[i])8.50k
;
244
8.58k
  free(list);
245
8.58k
246
8.58k
  return NULL;
247
8.58k
}
isl_pw_aff_list_free
Line
Count
Source
232
28.9k
{
233
28.9k
  int i;
234
28.9k
235
28.9k
  if (!list)
236
3
    return NULL;
237
28.9k
238
28.9k
  if (--list->ref > 0)
239
11.6k
    return NULL;
240
17.3k
241
17.3k
  isl_ctx_deref(list->ctx);
242
37.3k
  for (i = 0; i < list->n; 
++i20.0k
)
243
20.0k
    FN(EL,free)(list->p[i]);
244
17.3k
  free(list);
245
17.3k
246
17.3k
  return NULL;
247
17.3k
}
Unexecuted instantiation: isl_pw_multi_aff_list_free
isl_union_pw_aff_list_free
Line
Count
Source
232
260
{
233
260
  int i;
234
260
235
260
  if (!list)
236
0
    return NULL;
237
260
238
260
  if (--list->ref > 0)
239
0
    return NULL;
240
260
241
260
  isl_ctx_deref(list->ctx);
242
404
  for (i = 0; i < list->n; 
++i144
)
243
260
    
FN144
(EL,free)(list->p[i])144
;
244
260
  free(list);
245
260
246
260
  return NULL;
247
260
}
isl_union_pw_multi_aff_list_free
Line
Count
Source
232
8
{
233
8
  int i;
234
8
235
8
  if (!list)
236
0
    return NULL;
237
8
238
8
  if (--list->ref > 0)
239
0
    return NULL;
240
8
241
8
  isl_ctx_deref(list->ctx);
242
16
  for (i = 0; i < list->n; 
++i8
)
243
8
    FN(EL,free)(list->p[i]);
244
8
  free(list);
245
8
246
8
  return NULL;
247
8
}
Unexecuted instantiation: isl_ast_expr_list_free
isl_ast_node_list_free
Line
Count
Source
232
4.76k
{
233
4.76k
  int i;
234
4.76k
235
4.76k
  if (!list)
236
0
    return NULL;
237
4.76k
238
4.76k
  if (--list->ref > 0)
239
233
    return NULL;
240
4.53k
241
4.53k
  isl_ctx_deref(list->ctx);
242
10.7k
  for (i = 0; i < list->n; 
++i6.22k
)
243
6.22k
    FN(EL,free)(list->p[i]);
244
4.53k
  free(list);
245
4.53k
246
4.53k
  return NULL;
247
4.53k
}
isl_ast_graft_list_free
Line
Count
Source
232
18.2k
{
233
18.2k
  int i;
234
18.2k
235
18.2k
  if (!list)
236
0
    return NULL;
237
18.2k
238
18.2k
  if (--list->ref > 0)
239
0
    return NULL;
240
18.2k
241
18.2k
  isl_ctx_deref(list->ctx);
242
35.2k
  for (i = 0; i < list->n; 
++i17.0k
)
243
18.2k
    
FN17.0k
(EL,free)(list->p[i])17.0k
;
244
18.2k
  free(list);
245
18.2k
246
18.2k
  return NULL;
247
18.2k
}
isl_constraint_list_free
Line
Count
Source
232
2.41k
{
233
2.41k
  int i;
234
2.41k
235
2.41k
  if (!list)
236
0
    return NULL;
237
2.41k
238
2.41k
  if (--list->ref > 0)
239
0
    return NULL;
240
2.41k
241
2.41k
  isl_ctx_deref(list->ctx);
242
4.58k
  for (i = 0; i < list->n; 
++i2.17k
)
243
2.41k
    
FN2.17k
(EL,free)(list->p[i])2.17k
;
244
2.41k
  free(list);
245
2.41k
246
2.41k
  return NULL;
247
2.41k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_free
isl_id_list_free
Line
Count
Source
232
37.5k
{
233
37.5k
  int i;
234
37.5k
235
37.5k
  if (!list)
236
0
    return NULL;
237
37.5k
238
37.5k
  if (--list->ref > 0)
239
35.5k
    return NULL;
240
1.97k
241
1.97k
  isl_ctx_deref(list->ctx);
242
4.55k
  for (i = 0; i < list->n; 
++i2.58k
)
243
2.58k
    FN(EL,free)(list->p[i]);
244
1.97k
  free(list);
245
1.97k
246
1.97k
  return NULL;
247
1.97k
}
isl_basic_map_list_free
Line
Count
Source
232
4.03k
{
233
4.03k
  int i;
234
4.03k
235
4.03k
  if (!list)
236
0
    return NULL;
237
4.03k
238
4.03k
  if (--list->ref > 0)
239
0
    return NULL;
240
4.03k
241
4.03k
  isl_ctx_deref(list->ctx);
242
18.6k
  for (i = 0; i < list->n; 
++i14.5k
)
243
14.5k
    FN(EL,free)(list->p[i]);
244
4.03k
  free(list);
245
4.03k
246
4.03k
  return NULL;
247
4.03k
}
isl_map_list_free
Line
Count
Source
232
5.00k
{
233
5.00k
  int i;
234
5.00k
235
5.00k
  if (!list)
236
18
    return NULL;
237
4.98k
238
4.98k
  if (--list->ref > 0)
239
0
    return NULL;
240
4.98k
241
4.98k
  isl_ctx_deref(list->ctx);
242
14.5k
  for (i = 0; i < list->n; 
++i9.59k
)
243
9.59k
    FN(EL,free)(list->p[i]);
244
4.98k
  free(list);
245
4.98k
246
4.98k
  return NULL;
247
4.98k
}
isl_union_map_list_free
Line
Count
Source
232
1
{
233
1
  int i;
234
1
235
1
  if (!list)
236
0
    return NULL;
237
1
238
1
  if (--list->ref > 0)
239
0
    return NULL;
240
1
241
1
  isl_ctx_deref(list->ctx);
242
2
  for (i = 0; i < list->n; 
++i1
)
243
1
    FN(EL,free)(list->p[i]);
244
1
  free(list);
245
1
246
1
  return NULL;
247
1
}
Unexecuted instantiation: isl_pw_qpolynomial_list_free
isl_schedule_tree_list_free
Line
Count
Source
232
114k
{
233
114k
  int i;
234
114k
235
114k
  if (!list)
236
22.4k
    return NULL;
237
91.7k
238
91.7k
  if (--list->ref > 0)
239
13.3k
    return NULL;
240
78.4k
241
78.4k
  isl_ctx_deref(list->ctx);
242
216k
  for (i = 0; i < list->n; 
++i138k
)
243
138k
    FN(EL,free)(list->p[i]);
244
78.4k
  free(list);
245
78.4k
246
78.4k
  return NULL;
247
78.4k
}
isl_basic_set_list_free
Line
Count
Source
232
5.22k
{
233
5.22k
  int i;
234
5.22k
235
5.22k
  if (!list)
236
0
    return NULL;
237
5.22k
238
5.22k
  if (--list->ref > 0)
239
21
    return NULL;
240
5.20k
241
5.20k
  isl_ctx_deref(list->ctx);
242
14.0k
  for (i = 0; i < list->n; 
++i8.87k
)
243
8.87k
    FN(EL,free)(list->p[i]);
244
5.20k
  free(list);
245
5.20k
246
5.20k
  return NULL;
247
5.20k
}
isl_set_list_free
Line
Count
Source
232
22.6k
{
233
22.6k
  int i;
234
22.6k
235
22.6k
  if (!list)
236
8.18k
    return NULL;
237
14.4k
238
14.4k
  if (--list->ref > 0)
239
0
    return NULL;
240
14.4k
241
14.4k
  isl_ctx_deref(list->ctx);
242
33.0k
  for (i = 0; i < list->n; 
++i18.6k
)
243
18.6k
    FN(EL,free)(list->p[i]);
244
14.4k
  free(list);
245
14.4k
246
14.4k
  return NULL;
247
14.4k
}
isl_union_set_list_free
Line
Count
Source
232
497
{
233
497
  int i;
234
497
235
497
  if (!list)
236
0
    return NULL;
237
497
238
497
  if (--list->ref > 0)
239
0
    return NULL;
240
497
241
497
  isl_ctx_deref(list->ctx);
242
1.07k
  for (i = 0; i < list->n; 
++i582
)
243
582
    FN(EL,free)(list->p[i]);
244
497
  free(list);
245
497
246
497
  return NULL;
247
497
}
isl_val_list_free
Line
Count
Source
232
7
{
233
7
  int i;
234
7
235
7
  if (!list)
236
0
    return NULL;
237
7
238
7
  if (--list->ref > 0)
239
0
    return NULL;
240
7
241
7
  isl_ctx_deref(list->ctx);
242
24
  for (i = 0; i < list->n; 
++i17
)
243
17
    FN(EL,free)(list->p[i]);
244
7
  free(list);
245
7
246
7
  return NULL;
247
7
}
248
249
/* Return the number of elements in "list".
250
 */
251
int FN(LIST(EL),size)(__isl_keep LIST(EL) *list)
252
972k
{
253
972k
  return list ? 
list->n957k
:
015.2k
;
254
972k
}
isl_aff_list_size
Line
Count
Source
252
1.17k
{
253
1.17k
  return list ? list->n : 
00
;
254
1.17k
}
isl_pw_aff_list_size
Line
Count
Source
252
17.6k
{
253
17.6k
  return list ? list->n : 
00
;
254
17.6k
}
Unexecuted instantiation: isl_pw_multi_aff_list_size
isl_union_pw_aff_list_size
Line
Count
Source
252
260
{
253
260
  return list ? list->n : 
00
;
254
260
}
isl_union_pw_multi_aff_list_size
Line
Count
Source
252
8
{
253
8
  return list ? list->n : 
00
;
254
8
}
Unexecuted instantiation: isl_ast_expr_list_size
isl_ast_node_list_size
Line
Count
Source
252
4.98k
{
253
4.98k
  return list ? list->n : 
00
;
254
4.98k
}
isl_ast_graft_list_size
Line
Count
Source
252
27.8k
{
253
27.8k
  return list ? list->n : 
00
;
254
27.8k
}
isl_constraint_list_size
Line
Count
Source
252
3.90k
{
253
3.90k
  return list ? list->n : 
00
;
254
3.90k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_size
isl_id_list_size
Line
Count
Source
252
1.13k
{
253
1.13k
  return list ? list->n : 
00
;
254
1.13k
}
isl_basic_map_list_size
Line
Count
Source
252
3.70k
{
253
3.70k
  return list ? list->n : 
00
;
254
3.70k
}
isl_map_list_size
Line
Count
Source
252
5.00k
{
253
5.00k
  return list ? 
list->n4.97k
:
025
;
254
5.00k
}
isl_union_map_list_size
Line
Count
Source
252
13
{
253
13
  return list ? list->n : 
00
;
254
13
}
Unexecuted instantiation: isl_pw_qpolynomial_list_size
isl_schedule_tree_list_size
Line
Count
Source
252
886k
{
253
886k
  return list ? 
list->n871k
:
015.2k
;
254
886k
}
isl_basic_set_list_size
Line
Count
Source
252
6.89k
{
253
6.89k
  return list ? list->n : 
00
;
254
6.89k
}
isl_set_list_size
Line
Count
Source
252
11.0k
{
253
11.0k
  return list ? 
list->n11.0k
:
03
;
254
11.0k
}
isl_union_set_list_size
Line
Count
Source
252
2.83k
{
253
2.83k
  return list ? list->n : 
00
;
254
2.83k
}
isl_val_list_size
Line
Count
Source
252
7
{
253
7
  return list ? list->n : 
00
;
254
7
}
255
256
/* This is an alternative name for the function above.
257
 */
258
int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
259
963k
{
260
963k
  return FN(LIST(EL),size)(list);
261
963k
}
isl_aff_list_n_aff
Line
Count
Source
259
1.17k
{
260
1.17k
  return FN(LIST(EL),size)(list);
261
1.17k
}
isl_pw_aff_list_n_pw_aff
Line
Count
Source
259
17.6k
{
260
17.6k
  return FN(LIST(EL),size)(list);
261
17.6k
}
Unexecuted instantiation: isl_pw_multi_aff_list_n_pw_multi_aff
isl_union_pw_aff_list_n_union_pw_aff
Line
Count
Source
259
260
{
260
260
  return FN(LIST(EL),size)(list);
261
260
}
isl_union_pw_multi_aff_list_n_union_pw_multi_aff
Line
Count
Source
259
8
{
260
8
  return FN(LIST(EL),size)(list);
261
8
}
Unexecuted instantiation: isl_ast_expr_list_n_ast_expr
isl_ast_node_list_n_ast_node
Line
Count
Source
259
4.98k
{
260
4.98k
  return FN(LIST(EL),size)(list);
261
4.98k
}
isl_ast_graft_list_n_ast_graft
Line
Count
Source
259
27.8k
{
260
27.8k
  return FN(LIST(EL),size)(list);
261
27.8k
}
isl_constraint_list_n_constraint
Line
Count
Source
259
3.90k
{
260
3.90k
  return FN(LIST(EL),size)(list);
261
3.90k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_n_pw_qpolynomial_fold
isl_id_list_n_id
Line
Count
Source
259
1.13k
{
260
1.13k
  return FN(LIST(EL),size)(list);
261
1.13k
}
isl_basic_map_list_n_basic_map
Line
Count
Source
259
3.48k
{
260
3.48k
  return FN(LIST(EL),size)(list);
261
3.48k
}
isl_map_list_n_map
Line
Count
Source
259
873
{
260
873
  return FN(LIST(EL),size)(list);
261
873
}
isl_union_map_list_n_union_map
Line
Count
Source
259
13
{
260
13
  return FN(LIST(EL),size)(list);
261
13
}
Unexecuted instantiation: isl_pw_qpolynomial_list_n_pw_qpolynomial
isl_schedule_tree_list_n_schedule_tree
Line
Count
Source
259
886k
{
260
886k
  return FN(LIST(EL),size)(list);
261
886k
}
isl_basic_set_list_n_basic_set
Line
Count
Source
259
4.79k
{
260
4.79k
  return FN(LIST(EL),size)(list);
261
4.79k
}
isl_set_list_n_set
Line
Count
Source
259
8.22k
{
260
8.22k
  return FN(LIST(EL),size)(list);
261
8.22k
}
isl_union_set_list_n_union_set
Line
Count
Source
259
2.83k
{
260
2.83k
  return FN(LIST(EL),size)(list);
261
2.83k
}
isl_val_list_n_val
Line
Count
Source
259
7
{
260
7
  return FN(LIST(EL),size)(list);
261
7
}
262
263
/* Return the element at position "index" in "list".
264
 */
265
static __isl_keep EL *FN(LIST(EL),peek)(__isl_keep LIST(EL) *list, int index)
266
687k
{
267
687k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
687k
  return list->p[index];
270
687k
}
isl_aff.c:isl_aff_list_peek
Line
Count
Source
266
8.92k
{
267
8.92k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
8.92k
  return list->p[index];
270
8.92k
}
isl_aff.c:isl_pw_aff_list_peek
Line
Count
Source
266
22.3k
{
267
22.3k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
22.3k
  return list->p[index];
270
22.3k
}
Unexecuted instantiation: isl_aff.c:isl_pw_multi_aff_list_peek
isl_aff.c:isl_union_pw_aff_list_peek
Line
Count
Source
266
288
{
267
288
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
288
  return list->p[index];
270
288
}
isl_aff.c:isl_union_pw_multi_aff_list_peek
Line
Count
Source
266
8
{
267
8
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
8
  return list->p[index];
270
8
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_peek
isl_ast.c:isl_ast_node_list_peek
Line
Count
Source
266
4.51k
{
267
4.51k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
4.51k
  return list->p[index];
270
4.51k
}
isl_ast_graft.c:isl_ast_graft_list_peek
Line
Count
Source
266
34.4k
{
267
34.4k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
34.4k
  return list->p[index];
270
34.4k
}
isl_constraint.c:isl_constraint_list_peek
Line
Count
Source
266
2.17k
{
267
2.17k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
2.17k
  return list->p[index];
270
2.17k
}
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_peek
isl_id.c:isl_id_list_peek
Line
Count
Source
266
23.4k
{
267
23.4k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
23.4k
  return list->p[index];
270
23.4k
}
isl_map_list.c:isl_basic_map_list_peek
Line
Count
Source
266
12.2k
{
267
12.2k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
12.2k
  return list->p[index];
270
12.2k
}
isl_map_list.c:isl_map_list_peek
Line
Count
Source
266
9.48k
{
267
9.48k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
9.48k
  return list->p[index];
270
9.48k
}
isl_map_list.c:isl_union_map_list_peek
Line
Count
Source
266
9
{
267
9
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
9
  return list->p[index];
270
9
}
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_peek
isl_schedule_tree.c:isl_schedule_tree_list_peek
Line
Count
Source
266
532k
{
267
532k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
532k
  return list->p[index];
270
532k
}
isl_set_list.c:isl_basic_set_list_peek
Line
Count
Source
266
12.2k
{
267
12.2k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
12.2k
  return list->p[index];
270
12.2k
}
isl_set_list.c:isl_set_list_peek
Line
Count
Source
266
21.9k
{
267
21.9k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
21.9k
  return list->p[index];
270
21.9k
}
isl_set_list.c:isl_union_set_list_peek
Line
Count
Source
266
2.92k
{
267
2.92k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
2.92k
  return list->p[index];
270
2.92k
}
isl_val.c:isl_val_list_peek
Line
Count
Source
266
34
{
267
34
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
34
  return list->p[index];
270
34
}
271
272
/* Return a copy of the element at position "index" in "list".
273
 */
274
__isl_give EL *FN(LIST(EL),get_at)(__isl_keep LIST(EL) *list, int index)
275
678k
{
276
678k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
678k
}
isl_aff_list_get_at
Line
Count
Source
275
8.91k
{
276
8.91k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
8.91k
}
isl_pw_aff_list_get_at
Line
Count
Source
275
13.6k
{
276
13.6k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
13.6k
}
Unexecuted instantiation: isl_pw_multi_aff_list_get_at
isl_union_pw_aff_list_get_at
Line
Count
Source
275
144
{
276
144
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
144
}
isl_union_pw_multi_aff_list_get_at
Line
Count
Source
275
8
{
276
8
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
8
}
Unexecuted instantiation: isl_ast_expr_list_get_at
isl_ast_node_list_get_at
Line
Count
Source
275
4.51k
{
276
4.51k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
4.51k
}
isl_ast_graft_list_get_at
Line
Count
Source
275
34.4k
{
276
34.4k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
34.4k
}
isl_constraint_list_get_at
Line
Count
Source
275
2.17k
{
276
2.17k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
2.17k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_get_at
isl_id_list_get_at
Line
Count
Source
275
23.4k
{
276
23.4k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
23.4k
}
isl_basic_map_list_get_at
Line
Count
Source
275
12.2k
{
276
12.2k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
12.2k
}
isl_map_list_get_at
Line
Count
Source
275
9.48k
{
276
9.48k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
9.48k
}
isl_union_map_list_get_at
Line
Count
Source
275
9
{
276
9
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
9
}
Unexecuted instantiation: isl_pw_qpolynomial_list_get_at
isl_schedule_tree_list_get_at
Line
Count
Source
275
532k
{
276
532k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
532k
}
isl_basic_set_list_get_at
Line
Count
Source
275
12.2k
{
276
12.2k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
12.2k
}
isl_set_list_get_at
Line
Count
Source
275
21.9k
{
276
21.9k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
21.9k
}
isl_union_set_list_get_at
Line
Count
Source
275
2.92k
{
276
2.92k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
2.92k
}
isl_val_list_get_at
Line
Count
Source
275
17
{
276
17
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
17
}
278
279
/* This is an alternative name for the function above.
280
 */
281
__isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
282
664k
{
283
664k
  return FN(LIST(EL),get_at)(list, index);
284
664k
}
isl_aff_list_get_aff
Line
Count
Source
282
8.91k
{
283
8.91k
  return FN(LIST(EL),get_at)(list, index);
284
8.91k
}
isl_pw_aff_list_get_pw_aff
Line
Count
Source
282
13.6k
{
283
13.6k
  return FN(LIST(EL),get_at)(list, index);
284
13.6k
}
Unexecuted instantiation: isl_pw_multi_aff_list_get_pw_multi_aff
isl_union_pw_aff_list_get_union_pw_aff
Line
Count
Source
282
144
{
283
144
  return FN(LIST(EL),get_at)(list, index);
284
144
}
isl_union_pw_multi_aff_list_get_union_pw_multi_aff
Line
Count
Source
282
8
{
283
8
  return FN(LIST(EL),get_at)(list, index);
284
8
}
Unexecuted instantiation: isl_ast_expr_list_get_ast_expr
isl_ast_node_list_get_ast_node
Line
Count
Source
282
4.51k
{
283
4.51k
  return FN(LIST(EL),get_at)(list, index);
284
4.51k
}
isl_ast_graft_list_get_ast_graft
Line
Count
Source
282
34.4k
{
283
34.4k
  return FN(LIST(EL),get_at)(list, index);
284
34.4k
}
isl_constraint_list_get_constraint
Line
Count
Source
282
2.17k
{
283
2.17k
  return FN(LIST(EL),get_at)(list, index);
284
2.17k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_get_pw_qpolynomial_fold
isl_id_list_get_id
Line
Count
Source
282
23.4k
{
283
23.4k
  return FN(LIST(EL),get_at)(list, index);
284
23.4k
}
isl_basic_map_list_get_basic_map
Line
Count
Source
282
12.0k
{
283
12.0k
  return FN(LIST(EL),get_at)(list, index);
284
12.0k
}
isl_map_list_get_map
Line
Count
Source
282
1.94k
{
283
1.94k
  return FN(LIST(EL),get_at)(list, index);
284
1.94k
}
isl_union_map_list_get_union_map
Line
Count
Source
282
9
{
283
9
  return FN(LIST(EL),get_at)(list, index);
284
9
}
Unexecuted instantiation: isl_pw_qpolynomial_list_get_pw_qpolynomial
isl_schedule_tree_list_get_schedule_tree
Line
Count
Source
282
532k
{
283
532k
  return FN(LIST(EL),get_at)(list, index);
284
532k
}
isl_basic_set_list_get_basic_set
Line
Count
Source
282
9.48k
{
283
9.48k
  return FN(LIST(EL),get_at)(list, index);
284
9.48k
}
isl_set_list_get_set
Line
Count
Source
282
18.0k
{
283
18.0k
  return FN(LIST(EL),get_at)(list, index);
284
18.0k
}
isl_union_set_list_get_union_set
Line
Count
Source
282
2.92k
{
283
2.92k
  return FN(LIST(EL),get_at)(list, index);
284
2.92k
}
isl_val_list_get_val
Line
Count
Source
282
17
{
283
17
  return FN(LIST(EL),get_at)(list, index);
284
17
}
285
286
/* Replace the element at position "index" in "list" by "el".
287
 */
288
__isl_give LIST(EL) *FN(FN(LIST(EL),set),BASE)(__isl_take LIST(EL) *list,
289
  int index, __isl_take EL *el)
290
48.1k
{
291
48.1k
  if (!list || !el)
292
0
    goto error;
293
48.1k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
48.1k
  if (list->p[index] == el) {
296
11.3k
    FN(EL,free)(el);
297
11.3k
    return list;
298
11.3k
  }
299
36.8k
  list = FN(LIST(EL),cow)(list);
300
36.8k
  if (!list)
301
0
    goto error;
302
36.8k
  FN(EL,free)(list->p[index]);
303
36.8k
  list->p[index] = el;
304
36.8k
  return list;
305
36.8k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
36.8k
}
isl_aff_list_set_aff
Line
Count
Source
290
2
{
291
2
  if (!list || !el)
292
0
    goto error;
293
2
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
2
  if (list->p[index] == el) {
296
0
    FN(EL,free)(el);
297
0
    return list;
298
0
  }
299
2
  list = FN(LIST(EL),cow)(list);
300
2
  if (!list)
301
0
    goto error;
302
2
  FN(EL,free)(list->p[index]);
303
2
  list->p[index] = el;
304
2
  return list;
305
2
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
2
}
isl_pw_aff_list_set_pw_aff
Line
Count
Source
290
3.44k
{
291
3.44k
  if (!list || !el)
292
0
    goto error;
293
3.44k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.44k
  if (list->p[index] == el) {
296
0
    FN(EL,free)(el);
297
0
    return list;
298
0
  }
299
3.44k
  list = FN(LIST(EL),cow)(list);
300
3.44k
  if (!list)
301
0
    goto error;
302
3.44k
  FN(EL,free)(list->p[index]);
303
3.44k
  list->p[index] = el;
304
3.44k
  return list;
305
3.44k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
3.44k
}
Unexecuted instantiation: isl_pw_multi_aff_list_set_pw_multi_aff
Unexecuted instantiation: isl_union_pw_aff_list_set_union_pw_aff
Unexecuted instantiation: isl_union_pw_multi_aff_list_set_union_pw_multi_aff
Unexecuted instantiation: isl_ast_expr_list_set_ast_expr
Unexecuted instantiation: isl_ast_node_list_set_ast_node
isl_ast_graft_list_set_ast_graft
Line
Count
Source
290
6.81k
{
291
6.81k
  if (!list || !el)
292
0
    goto error;
293
6.81k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
6.81k
  if (list->p[index] == el) {
296
6.78k
    FN(EL,free)(el);
297
6.78k
    return list;
298
6.78k
  }
299
24
  list = FN(LIST(EL),cow)(list);
300
24
  if (!list)
301
0
    goto error;
302
24
  FN(EL,free)(list->p[index]);
303
24
  list->p[index] = el;
304
24
  return list;
305
24
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
24
}
Unexecuted instantiation: isl_constraint_list_set_constraint
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_set_pw_qpolynomial_fold
Unexecuted instantiation: isl_id_list_set_id
isl_basic_map_list_set_basic_map
Line
Count
Source
290
3.71k
{
291
3.71k
  if (!list || !el)
292
0
    goto error;
293
3.71k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.71k
  if (list->p[index] == el) {
296
3.15k
    FN(EL,free)(el);
297
3.15k
    return list;
298
3.15k
  }
299
558
  list = FN(LIST(EL),cow)(list);
300
558
  if (!list)
301
0
    goto error;
302
558
  FN(EL,free)(list->p[index]);
303
558
  list->p[index] = el;
304
558
  return list;
305
558
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
558
}
Unexecuted instantiation: isl_map_list_set_map
isl_union_map_list_set_union_map
Line
Count
Source
290
2
{
291
2
  if (!list || !el)
292
0
    goto error;
293
2
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
2
  if (list->p[index] == el) {
296
0
    FN(EL,free)(el);
297
0
    return list;
298
0
  }
299
2
  list = FN(LIST(EL),cow)(list);
300
2
  if (!list)
301
0
    goto error;
302
2
  FN(EL,free)(list->p[index]);
303
2
  list->p[index] = el;
304
2
  return list;
305
2
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
2
}
Unexecuted instantiation: isl_pw_qpolynomial_list_set_pw_qpolynomial
isl_schedule_tree_list_set_schedule_tree
Line
Count
Source
290
27.1k
{
291
27.1k
  if (!list || !el)
292
0
    goto error;
293
27.1k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
27.1k
  if (list->p[index] == el) {
296
3
    FN(EL,free)(el);
297
3
    return list;
298
3
  }
299
27.1k
  list = FN(LIST(EL),cow)(list);
300
27.1k
  if (!list)
301
0
    goto error;
302
27.1k
  FN(EL,free)(list->p[index]);
303
27.1k
  list->p[index] = el;
304
27.1k
  return list;
305
27.1k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
27.1k
}
isl_basic_set_list_set_basic_set
Line
Count
Source
290
3.77k
{
291
3.77k
  if (!list || !el)
292
0
    goto error;
293
3.77k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.77k
  if (list->p[index] == el) {
296
0
    FN(EL,free)(el);
297
0
    return list;
298
0
  }
299
3.77k
  list = FN(LIST(EL),cow)(list);
300
3.77k
  if (!list)
301
0
    goto error;
302
3.77k
  FN(EL,free)(list->p[index]);
303
3.77k
  list->p[index] = el;
304
3.77k
  return list;
305
3.77k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
3.77k
}
isl_set_list_set_set
Line
Count
Source
290
3.30k
{
291
3.30k
  if (!list || !el)
292
0
    goto error;
293
3.30k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.30k
  if (list->p[index] == el) {
296
1.41k
    FN(EL,free)(el);
297
1.41k
    return list;
298
1.41k
  }
299
1.88k
  list = FN(LIST(EL),cow)(list);
300
1.88k
  if (!list)
301
0
    goto error;
302
1.88k
  FN(EL,free)(list->p[index]);
303
1.88k
  list->p[index] = el;
304
1.88k
  return list;
305
1.88k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
1.88k
}
Unexecuted instantiation: isl_union_set_list_set_union_set
Unexecuted instantiation: isl_val_list_set_val
310
311
/* Return the element at position "index" of "list".
312
 * This may be either a copy or the element itself
313
 * if there is only one reference to "list".
314
 * This allows the element to be modified inplace
315
 * if both the list and the element have only a single reference.
316
 * The caller is not allowed to modify "list" between
317
 * this call to isl_list_*_take_* and a subsequent call
318
 * to isl_list_*_restore_*.
319
 * The only exception is that isl_list_*_free can be called instead.
320
 */
321
static __isl_give EL *FN(FN(LIST(EL),take),BASE)(__isl_keep LIST(EL) *list,
322
  int index)
323
58
{
324
58
  EL *el;
325
58
326
58
  if (FN(LIST(EL),check_index)(list, index) < 0)
327
0
    return NULL;
328
58
  if (list->ref != 1)
329
0
    return FN(FN(LIST(EL),get),BASE)(list, index);
330
58
  el = list->p[index];
331
58
  list->p[index] = NULL;
332
58
  return el;
333
58
}
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_pw_multi_aff_list_take_pw_multi_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_constraint.c:isl_constraint_list_take_constraint
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_take_pw_qpolynomial_fold
Unexecuted instantiation: isl_id.c:isl_id_list_take_id
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_polynomial.c:isl_pw_qpolynomial_list_take_pw_qpolynomial
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
323
58
{
324
58
  EL *el;
325
58
326
58
  if (FN(LIST(EL),check_index)(list, index) < 0)
327
0
    return NULL;
328
58
  if (list->ref != 1)
329
0
    return FN(FN(LIST(EL),get),BASE)(list, index);
330
58
  el = list->p[index];
331
58
  list->p[index] = NULL;
332
58
  return el;
333
58
}
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
334
335
/* Set the element at position "index" of "list" to "el",
336
 * where the position may be empty due to a previous call
337
 * to isl_list_*_take_*.
338
 */
339
static __isl_give LIST(EL) *FN(FN(LIST(EL),restore),BASE)(
340
  __isl_take LIST(EL) *list, int index, __isl_take EL *el)
341
58
{
342
58
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
343
58
}
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_pw_multi_aff_list_restore_pw_multi_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_fold.c:isl_pw_qpolynomial_fold_list_restore_pw_qpolynomial_fold
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_polynomial.c:isl_pw_qpolynomial_list_restore_pw_qpolynomial
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
341
58
{
342
58
  return FN(FN(LIST(EL),set),BASE)(list, index, el);
343
58
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_restore_set
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_restore_union_set
Unexecuted instantiation: isl_val.c:isl_val_list_restore_val
344
345
/* Swap the elements of "list" in positions "pos1" and "pos2".
346
 */
347
__isl_give LIST(EL) *FN(LIST(EL),swap)(__isl_take LIST(EL) *list,
348
  unsigned pos1, unsigned pos2)
349
0
{
350
0
  EL *el1, *el2;
351
0
352
0
  if (pos1 == pos2)
353
0
    return list;
354
0
  el1 = FN(FN(LIST(EL),take),BASE)(list, pos1);
355
0
  el2 = FN(FN(LIST(EL),take),BASE)(list, pos2);
356
0
  list = FN(FN(LIST(EL),restore),BASE)(list, pos1, el2);
357
0
  list = FN(FN(LIST(EL),restore),BASE)(list, pos2, el1);
358
0
  return list;
359
0
}
Unexecuted instantiation: isl_aff_list_swap
Unexecuted instantiation: isl_pw_aff_list_swap
Unexecuted instantiation: isl_pw_multi_aff_list_swap
Unexecuted instantiation: isl_union_pw_aff_list_swap
Unexecuted instantiation: isl_union_pw_multi_aff_list_swap
Unexecuted instantiation: isl_ast_expr_list_swap
Unexecuted instantiation: isl_ast_node_list_swap
Unexecuted instantiation: isl_ast_graft_list_swap
Unexecuted instantiation: isl_constraint_list_swap
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_swap
Unexecuted instantiation: isl_id_list_swap
Unexecuted instantiation: isl_basic_map_list_swap
Unexecuted instantiation: isl_map_list_swap
Unexecuted instantiation: isl_union_map_list_swap
Unexecuted instantiation: isl_pw_qpolynomial_list_swap
Unexecuted instantiation: isl_schedule_tree_list_swap
Unexecuted instantiation: isl_basic_set_list_swap
Unexecuted instantiation: isl_set_list_swap
Unexecuted instantiation: isl_union_set_list_swap
Unexecuted instantiation: isl_val_list_swap
360
361
/* Reverse the elements of "list".
362
 */
363
__isl_give LIST(EL) *FN(LIST(EL),reverse)(__isl_take LIST(EL) *list)
364
0
{
365
0
  int i, n;
366
0
367
0
  n = FN(LIST(EL),size)(list);
368
0
  for (i = 0; i < n - 1 - i; ++i)
369
0
    list = FN(LIST(EL),swap)(list, i, n - 1 - i);
370
0
  return list;
371
0
}
Unexecuted instantiation: isl_aff_list_reverse
Unexecuted instantiation: isl_pw_aff_list_reverse
Unexecuted instantiation: isl_pw_multi_aff_list_reverse
Unexecuted instantiation: isl_union_pw_aff_list_reverse
Unexecuted instantiation: isl_union_pw_multi_aff_list_reverse
Unexecuted instantiation: isl_ast_expr_list_reverse
Unexecuted instantiation: isl_ast_node_list_reverse
Unexecuted instantiation: isl_ast_graft_list_reverse
Unexecuted instantiation: isl_constraint_list_reverse
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_reverse
Unexecuted instantiation: isl_id_list_reverse
Unexecuted instantiation: isl_basic_map_list_reverse
Unexecuted instantiation: isl_map_list_reverse
Unexecuted instantiation: isl_union_map_list_reverse
Unexecuted instantiation: isl_pw_qpolynomial_list_reverse
Unexecuted instantiation: isl_schedule_tree_list_reverse
Unexecuted instantiation: isl_basic_set_list_reverse
Unexecuted instantiation: isl_set_list_reverse
Unexecuted instantiation: isl_union_set_list_reverse
Unexecuted instantiation: isl_val_list_reverse
372
373
isl_stat FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list,
374
  isl_stat (*fn)(__isl_take EL *el, void *user), void *user)
375
1.60k
{
376
1.60k
  int i;
377
1.60k
378
1.60k
  if (!list)
379
0
    return isl_stat_error;
380
1.60k
381
3.54k
  
for (i = 0; 1.60k
i < list->n;
++i1.94k
) {
382
2.51k
    EL *el = FN(EL,copy)(list->p[i]);
383
2.51k
    if (!el)
384
0
      return isl_stat_error;
385
2.51k
    if (fn(el, user) < 0)
386
574
      return isl_stat_error;
387
2.51k
  }
388
1.60k
389
1.60k
  
return isl_stat_ok1.02k
;
390
1.60k
}
Unexecuted instantiation: isl_aff_list_foreach
isl_pw_aff_list_foreach
Line
Count
Source
375
745
{
376
745
  int i;
377
745
378
745
  if (!list)
379
0
    return isl_stat_error;
380
745
381
931
  
for (i = 0; 745
i < list->n;
++i186
) {
382
760
    EL *el = FN(EL,copy)(list->p[i]);
383
760
    if (!el)
384
0
      return isl_stat_error;
385
760
    if (fn(el, user) < 0)
386
574
      return isl_stat_error;
387
760
  }
388
745
389
745
  
return isl_stat_ok171
;
390
745
}
Unexecuted instantiation: isl_pw_multi_aff_list_foreach
Unexecuted instantiation: isl_union_pw_aff_list_foreach
Unexecuted instantiation: isl_union_pw_multi_aff_list_foreach
Unexecuted instantiation: isl_ast_expr_list_foreach
Unexecuted instantiation: isl_ast_node_list_foreach
Unexecuted instantiation: isl_ast_graft_list_foreach
isl_constraint_list_foreach
Line
Count
Source
375
745
{
376
745
  int i;
377
745
378
745
  if (!list)
379
0
    return isl_stat_error;
380
745
381
2.38k
  
for (i = 0; 745
i < list->n;
++i1.64k
) {
382
1.64k
    EL *el = FN(EL,copy)(list->p[i]);
383
1.64k
    if (!el)
384
0
      return isl_stat_error;
385
1.64k
    if (fn(el, user) < 0)
386
0
      return isl_stat_error;
387
1.64k
  }
388
745
389
745
  return isl_stat_ok;
390
745
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_foreach
Unexecuted instantiation: isl_id_list_foreach
Unexecuted instantiation: isl_basic_map_list_foreach
Unexecuted instantiation: isl_map_list_foreach
Unexecuted instantiation: isl_union_map_list_foreach
Unexecuted instantiation: isl_pw_qpolynomial_list_foreach
Unexecuted instantiation: isl_schedule_tree_list_foreach
isl_basic_set_list_foreach
Line
Count
Source
375
112
{
376
112
  int i;
377
112
378
112
  if (!list)
379
0
    return isl_stat_error;
380
112
381
228
  
for (i = 0; 112
i < list->n;
++i116
) {
382
116
    EL *el = FN(EL,copy)(list->p[i]);
383
116
    if (!el)
384
0
      return isl_stat_error;
385
116
    if (fn(el, user) < 0)
386
0
      return isl_stat_error;
387
116
  }
388
112
389
112
  return isl_stat_ok;
390
112
}
Unexecuted instantiation: isl_set_list_foreach
Unexecuted instantiation: isl_union_set_list_foreach
Unexecuted instantiation: isl_val_list_foreach
391
392
/* Replace each element in "list" by the result of calling "fn"
393
 * on the element.
394
 */
395
__isl_give LIST(EL) *FN(LIST(EL),map)(__isl_keep LIST(EL) *list,
396
  __isl_give EL *(*fn)(__isl_take EL *el, void *user), void *user)
397
56
{
398
56
  int i, n;
399
56
400
56
  if (!list)
401
0
    return NULL;
402
56
403
56
  n = list->n;
404
114
  for (i = 0; i < n; 
++i58
) {
405
58
    EL *el = FN(FN(LIST(EL),take),BASE)(list, i);
406
58
    if (!el)
407
0
      return FN(LIST(EL),free)(list);
408
58
    el = fn(el, user);
409
58
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
410
58
  }
411
56
412
56
  return list;
413
56
}
Unexecuted instantiation: isl_aff_list_map
Unexecuted instantiation: isl_pw_aff_list_map
Unexecuted instantiation: isl_pw_multi_aff_list_map
Unexecuted instantiation: isl_union_pw_aff_list_map
Unexecuted instantiation: isl_union_pw_multi_aff_list_map
Unexecuted instantiation: isl_ast_expr_list_map
Unexecuted instantiation: isl_ast_node_list_map
Unexecuted instantiation: isl_ast_graft_list_map
Unexecuted instantiation: isl_constraint_list_map
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_map
Unexecuted instantiation: isl_id_list_map
Unexecuted instantiation: isl_basic_map_list_map
Unexecuted instantiation: isl_map_list_map
Unexecuted instantiation: isl_union_map_list_map
Unexecuted instantiation: isl_pw_qpolynomial_list_map
Unexecuted instantiation: isl_schedule_tree_list_map
isl_basic_set_list_map
Line
Count
Source
397
56
{
398
56
  int i, n;
399
56
400
56
  if (!list)
401
0
    return NULL;
402
56
403
56
  n = list->n;
404
114
  for (i = 0; i < n; 
++i58
) {
405
58
    EL *el = FN(FN(LIST(EL),take),BASE)(list, i);
406
58
    if (!el)
407
0
      return FN(LIST(EL),free)(list);
408
58
    el = fn(el, user);
409
58
    list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
410
58
  }
411
56
412
56
  return list;
413
56
}
Unexecuted instantiation: isl_set_list_map
Unexecuted instantiation: isl_union_set_list_map
Unexecuted instantiation: isl_val_list_map
414
415
/* Internal data structure for isl_*_list_sort.
416
 *
417
 * "cmp" is the original comparison function.
418
 * "user" is a user provided pointer that should be passed to "cmp".
419
 */
420
S(LIST(EL),sort_data) {
421
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user);
422
  void *user;
423
};
424
425
/* Compare two entries of an isl_*_list based on the user provided
426
 * comparison function on pairs of isl_* objects.
427
 */
428
static int FN(LIST(EL),cmp)(const void *a, const void *b, void *user)
429
1.25k
{
430
1.25k
  S(LIST(EL),sort_data) *data = user;
431
1.25k
  EL * const *el1 = a;
432
1.25k
  EL * const *el2 = b;
433
1.25k
434
1.25k
  return data->cmp(*el1, *el2, data->user);
435
1.25k
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_cmp
isl_aff.c:isl_pw_aff_list_cmp
Line
Count
Source
429
97
{
430
97
  S(LIST(EL),sort_data) *data = user;
431
97
  EL * const *el1 = a;
432
97
  EL * const *el2 = b;
433
97
434
97
  return data->cmp(*el1, *el2, data->user);
435
97
}
Unexecuted instantiation: isl_aff.c:isl_pw_multi_aff_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_cmp
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_cmp
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_cmp
isl_ast_graft.c:isl_ast_graft_list_cmp
Line
Count
Source
429
27
{
430
27
  S(LIST(EL),sort_data) *data = user;
431
27
  EL * const *el1 = a;
432
27
  EL * const *el2 = b;
433
27
434
27
  return data->cmp(*el1, *el2, data->user);
435
27
}
isl_constraint.c:isl_constraint_list_cmp
Line
Count
Source
429
1.13k
{
430
1.13k
  S(LIST(EL),sort_data) *data = user;
431
1.13k
  EL * const *el1 = a;
432
1.13k
  EL * const *el2 = b;
433
1.13k
434
1.13k
  return data->cmp(*el1, *el2, data->user);
435
1.13k
}
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_cmp
Unexecuted instantiation: isl_id.c:isl_id_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_map_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_cmp
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_cmp
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_basic_set_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_set_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_cmp
Unexecuted instantiation: isl_val.c:isl_val_list_cmp
436
437
/* Sort the elements of "list" in ascending order according to
438
 * comparison function "cmp".
439
 */
440
__isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list,
441
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *user)
442
1.80k
{
443
1.80k
  S(LIST(EL),sort_data) data = { cmp, user };
444
1.80k
445
1.80k
  if (!list)
446
0
    return NULL;
447
1.80k
  if (list->n <= 1)
448
861
    return list;
449
948
  list = FN(LIST(EL),cow)(list);
450
948
  if (!list)
451
0
    return NULL;
452
948
453
948
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
948
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
948
457
948
  return list;
458
948
}
Unexecuted instantiation: isl_aff_list_sort
isl_pw_aff_list_sort
Line
Count
Source
442
104
{
443
104
  S(LIST(EL),sort_data) data = { cmp, user };
444
104
445
104
  if (!list)
446
0
    return NULL;
447
104
  if (list->n <= 1)
448
12
    return list;
449
92
  list = FN(LIST(EL),cow)(list);
450
92
  if (!list)
451
0
    return NULL;
452
92
453
92
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
92
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
92
457
92
  return list;
458
92
}
Unexecuted instantiation: isl_pw_multi_aff_list_sort
Unexecuted instantiation: isl_union_pw_aff_list_sort
Unexecuted instantiation: isl_union_pw_multi_aff_list_sort
Unexecuted instantiation: isl_ast_expr_list_sort
Unexecuted instantiation: isl_ast_node_list_sort
isl_ast_graft_list_sort
Line
Count
Source
442
35
{
443
35
  S(LIST(EL),sort_data) data = { cmp, user };
444
35
445
35
  if (!list)
446
0
    return NULL;
447
35
  if (list->n <= 1)
448
8
    return list;
449
27
  list = FN(LIST(EL),cow)(list);
450
27
  if (!list)
451
0
    return NULL;
452
27
453
27
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
27
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
27
457
27
  return list;
458
27
}
isl_constraint_list_sort
Line
Count
Source
442
1.67k
{
443
1.67k
  S(LIST(EL),sort_data) data = { cmp, user };
444
1.67k
445
1.67k
  if (!list)
446
0
    return NULL;
447
1.67k
  if (list->n <= 1)
448
841
    return list;
449
829
  list = FN(LIST(EL),cow)(list);
450
829
  if (!list)
451
0
    return NULL;
452
829
453
829
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
829
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
829
457
829
  return list;
458
829
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_sort
Unexecuted instantiation: isl_id_list_sort
Unexecuted instantiation: isl_basic_map_list_sort
Unexecuted instantiation: isl_map_list_sort
Unexecuted instantiation: isl_union_map_list_sort
Unexecuted instantiation: isl_pw_qpolynomial_list_sort
Unexecuted instantiation: isl_schedule_tree_list_sort
Unexecuted instantiation: isl_basic_set_list_sort
Unexecuted instantiation: isl_set_list_sort
Unexecuted instantiation: isl_union_set_list_sort
Unexecuted instantiation: isl_val_list_sort
459
460
/* Internal data structure for isl_*_list_foreach_scc.
461
 *
462
 * "list" is the original list.
463
 * "follows" is the user provided callback that defines the edges of the graph.
464
 */
465
S(LIST(EL),foreach_scc_data) {
466
  LIST(EL) *list;
467
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user);
468
  void *follows_user;
469
};
470
471
/* Does element i of data->list follow element j?
472
 *
473
 * Use the user provided callback to find out.
474
 */
475
static isl_bool FN(LIST(EL),follows)(int i, int j, void *user)
476
149
{
477
149
  S(LIST(EL),foreach_scc_data) *data = user;
478
149
479
149
  return data->follows(data->list->p[i], data->list->p[j],
480
149
        data->follows_user);
481
149
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_pw_multi_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_follows
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_follows
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_follows
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_follows
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_follows
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_follows
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_follows
Unexecuted instantiation: isl_id.c:isl_id_list_follows
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_follows
Unexecuted instantiation: isl_map_list.c:isl_map_list_follows
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_follows
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_follows
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_follows
isl_set_list.c:isl_basic_set_list_follows
Line
Count
Source
476
149
{
477
149
  S(LIST(EL),foreach_scc_data) *data = user;
478
149
479
149
  return data->follows(data->list->p[i], data->list->p[j],
480
149
        data->follows_user);
481
149
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_follows
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_follows
Unexecuted instantiation: isl_val.c:isl_val_list_follows
482
483
/* Call "fn" on the sublist of "list" that consists of the elements
484
 * with indices specified by the "n" elements of "pos".
485
 */
486
static isl_stat FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos,
487
  int n, isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *user)
488
120
{
489
120
  int i;
490
120
  isl_ctx *ctx;
491
120
  LIST(EL) *slice;
492
120
493
120
  ctx = FN(LIST(EL),get_ctx)(list);
494
120
  slice = FN(LIST(EL),alloc)(ctx, n);
495
240
  for (i = 0; i < n; 
++i120
) {
496
120
    EL *el;
497
120
498
120
    el = FN(EL,copy)(list->p[pos[i]]);
499
120
    slice = FN(LIST(EL),add)(slice, el);
500
120
  }
501
120
502
120
  return fn(slice, user);
503
120
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_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_union_pw_multi_aff_list_call_on_scc
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_call_on_scc
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_call_on_scc
Unexecuted instantiation: isl_ast_graft.c:isl_ast_graft_list_call_on_scc
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_call_on_scc
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_call_on_scc
Unexecuted instantiation: isl_id.c:isl_id_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_map_list_call_on_scc
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_call_on_scc
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_call_on_scc
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_call_on_scc
isl_set_list.c:isl_basic_set_list_call_on_scc
Line
Count
Source
488
120
{
489
120
  int i;
490
120
  isl_ctx *ctx;
491
120
  LIST(EL) *slice;
492
120
493
120
  ctx = FN(LIST(EL),get_ctx)(list);
494
120
  slice = FN(LIST(EL),alloc)(ctx, n);
495
240
  for (i = 0; i < n; 
++i120
) {
496
120
    EL *el;
497
120
498
120
    el = FN(EL,copy)(list->p[pos[i]]);
499
120
    slice = FN(LIST(EL),add)(slice, el);
500
120
  }
501
120
502
120
  return fn(slice, user);
503
120
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_call_on_scc
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_call_on_scc
Unexecuted instantiation: isl_val.c:isl_val_list_call_on_scc
504
505
/* Call "fn" on each of the strongly connected components (SCCs) of
506
 * the graph with as vertices the elements of "list" and
507
 * a directed edge from node b to node a iff follows(a, b)
508
 * returns 1.  follows should return -1 on error.
509
 *
510
 * If SCC a contains a node i that follows a node j in another SCC b
511
 * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a
512
 * after being called on SCC b.
513
 *
514
 * We simply call isl_tarjan_graph_init, extract the SCCs from the result and
515
 * call fn on each of them.
516
 */
517
isl_stat FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list,
518
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user),
519
  void *follows_user,
520
  isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user)
521
77
{
522
77
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
523
77
  int i, n;
524
77
  isl_ctx *ctx;
525
77
  struct isl_tarjan_graph *g;
526
77
527
77
  if (!list)
528
0
    return isl_stat_error;
529
77
  if (list->n == 0)
530
0
    return isl_stat_ok;
531
77
  if (list->n == 1)
532
0
    return fn(FN(LIST(EL),copy)(list), fn_user);
533
77
534
77
  ctx = FN(LIST(EL),get_ctx)(list);
535
77
  n = list->n;
536
77
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
537
77
  if (!g)
538
0
    return isl_stat_error;
539
77
540
77
  i = 0;
541
141
  do {
542
141
    int first;
543
141
544
141
    if (g->order[i] == -1)
545
141
      
isl_die0
(ctx, isl_error_internal, "cannot happen",
546
141
        break);
547
141
    first = i;
548
309
    while (g->order[i] != -1) {
549
168
      ++i; --n;
550
168
    }
551
141
    if (first == 0 && 
n == 077
) {
552
21
      isl_tarjan_graph_free(g);
553
21
      return fn(FN(LIST(EL),copy)(list), fn_user);
554
21
    }
555
120
    if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first,
556
120
              fn, fn_user) < 0)
557
0
      break;
558
120
    ++i;
559
120
  } while (n);
560
77
561
77
  isl_tarjan_graph_free(g);
562
56
563
56
  return n > 0 ? 
isl_stat_error0
: isl_stat_ok;
564
77
}
Unexecuted instantiation: isl_aff_list_foreach_scc
Unexecuted instantiation: isl_pw_aff_list_foreach_scc
Unexecuted instantiation: isl_pw_multi_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_constraint_list_foreach_scc
Unexecuted instantiation: isl_pw_qpolynomial_fold_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_pw_qpolynomial_list_foreach_scc
Unexecuted instantiation: isl_schedule_tree_list_foreach_scc
isl_basic_set_list_foreach_scc
Line
Count
Source
521
77
{
522
77
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
523
77
  int i, n;
524
77
  isl_ctx *ctx;
525
77
  struct isl_tarjan_graph *g;
526
77
527
77
  if (!list)
528
0
    return isl_stat_error;
529
77
  if (list->n == 0)
530
0
    return isl_stat_ok;
531
77
  if (list->n == 1)
532
0
    return fn(FN(LIST(EL),copy)(list), fn_user);
533
77
534
77
  ctx = FN(LIST(EL),get_ctx)(list);
535
77
  n = list->n;
536
77
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
537
77
  if (!g)
538
0
    return isl_stat_error;
539
77
540
77
  i = 0;
541
141
  do {
542
141
    int first;
543
141
544
141
    if (g->order[i] == -1)
545
141
      
isl_die0
(ctx, isl_error_internal, "cannot happen",
546
141
        break);
547
141
    first = i;
548
309
    while (g->order[i] != -1) {
549
168
      ++i; --n;
550
168
    }
551
141
    if (first == 0 && 
n == 077
) {
552
21
      isl_tarjan_graph_free(g);
553
21
      return fn(FN(LIST(EL),copy)(list), fn_user);
554
21
    }
555
120
    if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first,
556
120
              fn, fn_user) < 0)
557
0
      break;
558
120
    ++i;
559
120
  } while (n);
560
77
561
77
  isl_tarjan_graph_free(g);
562
56
563
56
  return n > 0 ? 
isl_stat_error0
: isl_stat_ok;
564
77
}
Unexecuted instantiation: isl_set_list_foreach_scc
Unexecuted instantiation: isl_union_set_list_foreach_scc
Unexecuted instantiation: isl_val_list_foreach_scc
565
566
__isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el)
567
32.0k
{
568
32.0k
  isl_ctx *ctx;
569
32.0k
  LIST(EL) *list;
570
32.0k
571
32.0k
  if (!el)
572
1
    return NULL;
573
32.0k
  ctx = FN(EL,get_ctx)(el);
574
32.0k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
32.0k
  if (!list)
576
0
    goto error;
577
32.0k
  list = FN(LIST(EL),add)(list, el);
578
32.0k
  return list;
579
32.0k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
32.0k
}
isl_aff_list_from_aff
Line
Count
Source
567
8.16k
{
568
8.16k
  isl_ctx *ctx;
569
8.16k
  LIST(EL) *list;
570
8.16k
571
8.16k
  if (!el)
572
0
    return NULL;
573
8.16k
  ctx = FN(EL,get_ctx)(el);
574
8.16k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
8.16k
  if (!list)
576
0
    goto error;
577
8.16k
  list = FN(LIST(EL),add)(list, el);
578
8.16k
  return list;
579
8.16k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
8.16k
}
isl_pw_aff_list_from_pw_aff
Line
Count
Source
567
9.04k
{
568
9.04k
  isl_ctx *ctx;
569
9.04k
  LIST(EL) *list;
570
9.04k
571
9.04k
  if (!el)
572
1
    return NULL;
573
9.04k
  ctx = FN(EL,get_ctx)(el);
574
9.04k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
9.04k
  if (!list)
576
0
    goto error;
577
9.04k
  list = FN(LIST(EL),add)(list, el);
578
9.04k
  return list;
579
9.04k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
9.04k
}
Unexecuted instantiation: isl_pw_multi_aff_list_from_pw_multi_aff
Unexecuted instantiation: isl_union_pw_aff_list_from_union_pw_aff
isl_union_pw_multi_aff_list_from_union_pw_multi_aff
Line
Count
Source
567
8
{
568
8
  isl_ctx *ctx;
569
8
  LIST(EL) *list;
570
8
571
8
  if (!el)
572
0
    return NULL;
573
8
  ctx = FN(EL,get_ctx)(el);
574
8
  list = FN(LIST(EL),alloc)(ctx, 1);
575
8
  if (!list)
576
0
    goto error;
577
8
  list = FN(LIST(EL),add)(list, el);
578
8
  return list;
579
8
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
8
}
Unexecuted instantiation: isl_ast_expr_list_from_ast_expr
isl_ast_node_list_from_ast_node
Line
Count
Source
567
60
{
568
60
  isl_ctx *ctx;
569
60
  LIST(EL) *list;
570
60
571
60
  if (!el)
572
0
    return NULL;
573
60
  ctx = FN(EL,get_ctx)(el);
574
60
  list = FN(LIST(EL),alloc)(ctx, 1);
575
60
  if (!list)
576
0
    goto error;
577
60
  list = FN(LIST(EL),add)(list, el);
578
60
  return list;
579
60
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
60
}
isl_ast_graft_list_from_ast_graft
Line
Count
Source
567
2.22k
{
568
2.22k
  isl_ctx *ctx;
569
2.22k
  LIST(EL) *list;
570
2.22k
571
2.22k
  if (!el)
572
0
    return NULL;
573
2.22k
  ctx = FN(EL,get_ctx)(el);
574
2.22k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
2.22k
  if (!list)
576
0
    goto error;
577
2.22k
  list = FN(LIST(EL),add)(list, el);
578
2.22k
  return list;
579
2.22k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
2.22k
}
Unexecuted instantiation: isl_constraint_list_from_constraint
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_from_pw_qpolynomial_fold
Unexecuted instantiation: isl_id_list_from_id
Unexecuted instantiation: isl_basic_map_list_from_basic_map
Unexecuted instantiation: isl_map_list_from_map
isl_union_map_list_from_union_map
Line
Count
Source
567
1
{
568
1
  isl_ctx *ctx;
569
1
  LIST(EL) *list;
570
1
571
1
  if (!el)
572
0
    return NULL;
573
1
  ctx = FN(EL,get_ctx)(el);
574
1
  list = FN(LIST(EL),alloc)(ctx, 1);
575
1
  if (!list)
576
0
    goto error;
577
1
  list = FN(LIST(EL),add)(list, el);
578
1
  return list;
579
1
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
1
}
Unexecuted instantiation: isl_pw_qpolynomial_list_from_pw_qpolynomial
isl_schedule_tree_list_from_schedule_tree
Line
Count
Source
567
3.95k
{
568
3.95k
  isl_ctx *ctx;
569
3.95k
  LIST(EL) *list;
570
3.95k
571
3.95k
  if (!el)
572
0
    return NULL;
573
3.95k
  ctx = FN(EL,get_ctx)(el);
574
3.95k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
3.95k
  if (!list)
576
0
    goto error;
577
3.95k
  list = FN(LIST(EL),add)(list, el);
578
3.95k
  return list;
579
3.95k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
3.95k
}
isl_basic_set_list_from_basic_set
Line
Count
Source
567
28
{
568
28
  isl_ctx *ctx;
569
28
  LIST(EL) *list;
570
28
571
28
  if (!el)
572
0
    return NULL;
573
28
  ctx = FN(EL,get_ctx)(el);
574
28
  list = FN(LIST(EL),alloc)(ctx, 1);
575
28
  if (!list)
576
0
    goto error;
577
28
  list = FN(LIST(EL),add)(list, el);
578
28
  return list;
579
28
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
28
}
isl_set_list_from_set
Line
Count
Source
567
8.16k
{
568
8.16k
  isl_ctx *ctx;
569
8.16k
  LIST(EL) *list;
570
8.16k
571
8.16k
  if (!el)
572
0
    return NULL;
573
8.16k
  ctx = FN(EL,get_ctx)(el);
574
8.16k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
8.16k
  if (!list)
576
0
    goto error;
577
8.16k
  list = FN(LIST(EL),add)(list, el);
578
8.16k
  return list;
579
8.16k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
8.16k
}
isl_union_set_list_from_union_set
Line
Count
Source
567
427
{
568
427
  isl_ctx *ctx;
569
427
  LIST(EL) *list;
570
427
571
427
  if (!el)
572
0
    return NULL;
573
427
  ctx = FN(EL,get_ctx)(el);
574
427
  list = FN(LIST(EL),alloc)(ctx, 1);
575
427
  if (!list)
576
0
    goto error;
577
427
  list = FN(LIST(EL),add)(list, el);
578
427
  return list;
579
427
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
427
}
Unexecuted instantiation: isl_val_list_from_val
583
584
/* Append the elements of "list2" to "list1", where "list1" is known
585
 * to have only a single reference and enough room to hold
586
 * the extra elements.
587
 */
588
static __isl_give LIST(EL) *FN(LIST(EL),concat_inplace)(
589
  __isl_take LIST(EL) *list1, __isl_take LIST(EL) *list2)
590
2.01k
{
591
2.01k
  int i;
592
2.01k
593
2.07k
  for (i = 0; i < list2->n; 
++i61
)
594
61
    list1 = FN(LIST(EL),add)(list1, FN(EL,copy)(list2->p[i]));
595
2.01k
  FN(LIST(EL),free)(list2);
596
2.01k
  return list1;
597
2.01k
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_pw_aff_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_pw_multi_aff_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_concat_inplace
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_concat_inplace
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_concat_inplace
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_concat_inplace
isl_ast_graft.c:isl_ast_graft_list_concat_inplace
Line
Count
Source
590
1.91k
{
591
1.91k
  int i;
592
1.91k
593
1.91k
  for (i = 0; i < list2->n; 
++i0
)
594
0
    list1 = FN(LIST(EL),add)(list1, FN(EL,copy)(list2->p[i]));
595
1.91k
  FN(LIST(EL),free)(list2);
596
1.91k
  return list1;
597
1.91k
}
Unexecuted instantiation: isl_constraint.c:isl_constraint_list_concat_inplace
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_concat_inplace
Unexecuted instantiation: isl_id.c:isl_id_list_concat_inplace
isl_map_list.c:isl_basic_map_list_concat_inplace
Line
Count
Source
590
62
{
591
62
  int i;
592
62
593
62
  for (i = 0; i < list2->n; 
++i0
)
594
0
    list1 = FN(LIST(EL),add)(list1, FN(EL,copy)(list2->p[i]));
595
62
  FN(LIST(EL),free)(list2);
596
62
  return list1;
597
62
}
Unexecuted instantiation: isl_map_list.c:isl_map_list_concat_inplace
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_concat_inplace
Unexecuted instantiation: isl_polynomial.c:isl_pw_qpolynomial_list_concat_inplace
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_concat_inplace
isl_set_list.c:isl_basic_set_list_concat_inplace
Line
Count
Source
590
42
{
591
42
  int i;
592
42
593
103
  for (i = 0; i < list2->n; 
++i61
)
594
61
    list1 = FN(LIST(EL),add)(list1, FN(EL,copy)(list2->p[i]));
595
42
  FN(LIST(EL),free)(list2);
596
42
  return list1;
597
42
}
Unexecuted instantiation: isl_set_list.c:isl_set_list_concat_inplace
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_concat_inplace
Unexecuted instantiation: isl_val.c:isl_val_list_concat_inplace
598
599
/* Concatenate "list1" and "list2".
600
 * If "list1" has only one reference and has enough room
601
 * for the elements of "list2", the add the elements to "list1" itself.
602
 * Otherwise, create a new list to store the result.
603
 */
604
__isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1,
605
  __isl_take LIST(EL) *list2)
606
8.39k
{
607
8.39k
  int i;
608
8.39k
  isl_ctx *ctx;
609
8.39k
  LIST(EL) *res;
610
8.39k
611
8.39k
  if (!list1 || !list2)
612
0
    goto error;
613
8.39k
614
8.39k
  if (list1->ref == 1 && 
list1->n + list2->n <= list1->size7.72k
)
615
2.01k
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
6.38k
617
6.38k
  ctx = FN(LIST(EL),get_ctx)(list1);
618
6.38k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
18.3k
  for (i = 0; i < list1->n; 
++i11.9k
)
620
11.9k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
15.6k
  for (i = 0; i < list2->n; 
++i9.26k
)
622
9.26k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
6.38k
624
6.38k
  FN(LIST(EL),free)(list1);
625
6.38k
  FN(LIST(EL),free)(list2);
626
6.38k
  return res;
627
6.38k
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
6.38k
}
Unexecuted instantiation: isl_aff_list_concat
isl_pw_aff_list_concat
Line
Count
Source
606
152
{
607
152
  int i;
608
152
  isl_ctx *ctx;
609
152
  LIST(EL) *res;
610
152
611
152
  if (!list1 || !list2)
612
0
    goto error;
613
152
614
152
  if (list1->ref == 1 && list1->n + list2->n <= list1->size)
615
0
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
152
617
152
  ctx = FN(LIST(EL),get_ctx)(list1);
618
152
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
351
  for (i = 0; i < list1->n; 
++i199
)
620
199
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
304
  for (i = 0; i < list2->n; 
++i152
)
622
152
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
152
624
152
  FN(LIST(EL),free)(list1);
625
152
  FN(LIST(EL),free)(list2);
626
152
  return res;
627
152
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
152
}
Unexecuted instantiation: isl_pw_multi_aff_list_concat
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
606
5.49k
{
607
5.49k
  int i;
608
5.49k
  isl_ctx *ctx;
609
5.49k
  LIST(EL) *res;
610
5.49k
611
5.49k
  if (!list1 || !list2)
612
0
    goto error;
613
5.49k
614
5.49k
  if (list1->ref == 1 && list1->n + list2->n <= list1->size)
615
1.91k
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
3.58k
617
3.58k
  ctx = FN(LIST(EL),get_ctx)(list1);
618
3.58k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
3.99k
  for (i = 0; i < list1->n; 
++i408
)
620
408
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
7.96k
  for (i = 0; i < list2->n; 
++i4.38k
)
622
4.38k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
3.58k
624
3.58k
  FN(LIST(EL),free)(list1);
625
3.58k
  FN(LIST(EL),free)(list2);
626
3.58k
  return res;
627
3.58k
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
3.58k
}
Unexecuted instantiation: isl_constraint_list_concat
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_concat
isl_id_list_concat
Line
Count
Source
606
678
{
607
678
  int i;
608
678
  isl_ctx *ctx;
609
678
  LIST(EL) *res;
610
678
611
678
  if (!list1 || !list2)
612
0
    goto error;
613
678
614
678
  if (list1->ref == 1 && 
list1->n + list2->n <= list1->size0
)
615
0
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
678
617
678
  ctx = FN(LIST(EL),get_ctx)(list1);
618
678
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
1.38k
  for (i = 0; i < list1->n; 
++i708
)
620
708
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
1.61k
  for (i = 0; i < list2->n; 
++i933
)
622
933
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
678
624
678
  FN(LIST(EL),free)(list1);
625
678
  FN(LIST(EL),free)(list2);
626
678
  return res;
627
678
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
678
}
isl_basic_map_list_concat
Line
Count
Source
606
1.93k
{
607
1.93k
  int i;
608
1.93k
  isl_ctx *ctx;
609
1.93k
  LIST(EL) *res;
610
1.93k
611
1.93k
  if (!list1 || !list2)
612
0
    goto error;
613
1.93k
614
1.93k
  if (list1->ref == 1 && list1->n + list2->n <= list1->size)
615
62
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
1.87k
617
1.87k
  ctx = FN(LIST(EL),get_ctx)(list1);
618
1.87k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
12.5k
  for (i = 0; i < list1->n; 
++i10.6k
)
620
10.6k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
5.58k
  for (i = 0; i < list2->n; 
++i3.71k
)
622
3.71k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
1.87k
624
1.87k
  FN(LIST(EL),free)(list1);
625
1.87k
  FN(LIST(EL),free)(list2);
626
1.87k
  return res;
627
1.87k
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
1.87k
}
Unexecuted instantiation: isl_map_list_concat
Unexecuted instantiation: isl_union_map_list_concat
Unexecuted instantiation: isl_pw_qpolynomial_list_concat
Unexecuted instantiation: isl_schedule_tree_list_concat
isl_basic_set_list_concat
Line
Count
Source
606
133
{
607
133
  int i;
608
133
  isl_ctx *ctx;
609
133
  LIST(EL) *res;
610
133
611
133
  if (!list1 || !list2)
612
0
    goto error;
613
133
614
133
  if (list1->ref == 1 && list1->n + list2->n <= list1->size)
615
42
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
91
617
91
  ctx = FN(LIST(EL),get_ctx)(list1);
618
91
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
105
  for (i = 0; i < list1->n; 
++i14
)
620
14
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
183
  for (i = 0; i < list2->n; 
++i92
)
622
92
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
91
624
91
  FN(LIST(EL),free)(list1);
625
91
  FN(LIST(EL),free)(list2);
626
91
  return res;
627
91
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
91
}
Unexecuted instantiation: isl_set_list_concat
Unexecuted instantiation: isl_union_set_list_concat
Unexecuted instantiation: isl_val_list_concat
632
633
__isl_give isl_printer *CAT(isl_printer_print_,LIST(BASE))(
634
  __isl_take isl_printer *p, __isl_keep LIST(EL) *list)
635
0
{
636
0
  int i;
637
0
638
0
  if (!p || !list)
639
0
    goto error;
640
0
  p = isl_printer_print_str(p, "(");
641
0
  for (i = 0; i < list->n; ++i) {
642
0
    if (i)
643
0
      p = isl_printer_print_str(p, ",");
644
0
    p = CAT(isl_printer_print_,BASE)(p, list->p[i]);
645
0
  }
646
0
  p = isl_printer_print_str(p, ")");
647
0
  return p;
648
0
error:
649
0
  isl_printer_free(p);
650
0
  return NULL;
651
0
}
Unexecuted instantiation: isl_printer_print_aff_list
Unexecuted instantiation: isl_printer_print_pw_aff_list
Unexecuted instantiation: isl_printer_print_pw_multi_aff_list
Unexecuted instantiation: isl_printer_print_union_pw_aff_list
Unexecuted instantiation: isl_printer_print_union_pw_multi_aff_list
Unexecuted instantiation: isl_printer_print_ast_expr_list
Unexecuted instantiation: isl_printer_print_ast_node_list
Unexecuted instantiation: isl_printer_print_ast_graft_list
Unexecuted instantiation: isl_printer_print_constraint_list
Unexecuted instantiation: isl_printer_print_pw_qpolynomial_fold_list
Unexecuted instantiation: isl_printer_print_id_list
Unexecuted instantiation: isl_printer_print_basic_map_list
Unexecuted instantiation: isl_printer_print_map_list
Unexecuted instantiation: isl_printer_print_union_map_list
Unexecuted instantiation: isl_printer_print_pw_qpolynomial_list
Unexecuted instantiation: isl_printer_print_schedule_tree_list
Unexecuted instantiation: isl_printer_print_basic_set_list
Unexecuted instantiation: isl_printer_print_set_list
Unexecuted instantiation: isl_printer_print_union_set_list
Unexecuted instantiation: isl_printer_print_val_list
652
653
void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list)
654
0
{
655
0
  isl_printer *printer;
656
0
657
0
  if (!list)
658
0
    return;
659
0
660
0
  printer = isl_printer_to_file(FN(LIST(EL),get_ctx)(list), stderr);
661
0
  printer = CAT(isl_printer_print_,LIST(BASE))(printer, list);
662
0
  printer = isl_printer_end_line(printer);
663
0
664
0
  isl_printer_free(printer);
665
0
}
Unexecuted instantiation: isl_aff_list_dump
Unexecuted instantiation: isl_pw_aff_list_dump
Unexecuted instantiation: isl_pw_multi_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_constraint_list_dump
Unexecuted instantiation: isl_pw_qpolynomial_fold_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_pw_qpolynomial_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_union_set_list_dump
Unexecuted instantiation: isl_val_list_dump