Coverage Report

Created: 2018-08-14 02:14

/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
4.80k
#define xCAT(A,B) A ## B
21
4.80k
#define CAT(A,B) xCAT(A,B)
22
#undef EL
23
4.80k
#define EL CAT(isl_,BASE)
24
5.43M
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
25
5.39M
#define FN(TYPE,NAME) xFN(TYPE,NAME)
26
625k
#define xLIST(EL) EL ## _list
27
625k
#define LIST(EL) xLIST(EL)
28
2.99k
#define xS(TYPE,NAME) struct TYPE ## _ ## NAME
29
2.99k
#define S(TYPE,NAME) xS(TYPE,NAME)
30
31
isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
32
98.0k
{
33
98.0k
  return list ? list->ctx : NULL;
34
98.0k
}
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.6k
{
33
11.6k
  return list ? list->ctx : NULL;
34
11.6k
}
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
520
{
33
520
  return list ? list->ctx : NULL;
34
520
}
isl_ast_graft_list_get_ctx
Line
Count
Source
32
11.7k
{
33
11.7k
  return list ? list->ctx : NULL;
34
11.7k
}
isl_constraint_list_get_ctx
Line
Count
Source
32
1.12k
{
33
1.12k
  return list ? list->ctx : NULL;
34
1.12k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_get_ctx
isl_id_list_get_ctx
Line
Count
Source
32
627
{
33
627
  return list ? list->ctx : NULL;
34
627
}
isl_basic_map_list_get_ctx
Line
Count
Source
32
1.74k
{
33
1.74k
  return list ? list->ctx : NULL;
34
1.74k
}
isl_map_list_get_ctx
Line
Count
Source
32
803
{
33
803
  return list ? list->ctx : NULL;
34
803
}
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.1k
{
33
68.1k
  return list ? list->ctx : NULL;
34
68.1k
}
isl_basic_set_list_get_ctx
Line
Count
Source
32
1.17k
{
33
1.17k
  return list ? list->ctx : NULL;
34
1.17k
}
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
260
{
33
260
  return list ? list->ctx : NULL;
34
260
}
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
158k
{
38
158k
  LIST(EL) *list;
39
158k
40
158k
  if (n < 0)
41
158k
    
isl_die0
(ctx, isl_error_invalid,
42
158k
      "cannot create list of negative length",
43
158k
      return NULL);
44
158k
  list = isl_alloc(ctx, LIST(EL),
45
158k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
158k
  if (!list)
47
9
    return NULL;
48
158k
49
158k
  list->ctx = ctx;
50
158k
  isl_ctx_ref(ctx);
51
158k
  list->ref = 1;
52
158k
  list->size = n;
53
158k
  list->n = 0;
54
158k
  return list;
55
158k
}
isl_aff_list_alloc
Line
Count
Source
37
8.31k
{
38
8.31k
  LIST(EL) *list;
39
8.31k
40
8.31k
  if (n < 0)
41
8.31k
    
isl_die0
(ctx, isl_error_invalid,
42
8.31k
      "cannot create list of negative length",
43
8.31k
      return NULL);
44
8.31k
  list = isl_alloc(ctx, LIST(EL),
45
8.31k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
8.31k
  if (!list)
47
0
    return NULL;
48
8.31k
49
8.31k
  list->ctx = ctx;
50
8.31k
  isl_ctx_ref(ctx);
51
8.31k
  list->ref = 1;
52
8.31k
  list->size = n;
53
8.31k
  list->n = 0;
54
8.31k
  return list;
55
8.31k
}
isl_pw_aff_list_alloc
Line
Count
Source
37
17.2k
{
38
17.2k
  LIST(EL) *list;
39
17.2k
40
17.2k
  if (n < 0)
41
17.2k
    
isl_die0
(ctx, isl_error_invalid,
42
17.2k
      "cannot create list of negative length",
43
17.2k
      return NULL);
44
17.2k
  list = isl_alloc(ctx, LIST(EL),
45
17.2k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
17.2k
  if (!list)
47
0
    return NULL;
48
17.2k
49
17.2k
  list->ctx = ctx;
50
17.2k
  isl_ctx_ref(ctx);
51
17.2k
  list->ref = 1;
52
17.2k
  list->size = n;
53
17.2k
  list->n = 0;
54
17.2k
  return list;
55
17.2k
}
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
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
}
Unexecuted instantiation: isl_ast_expr_list_alloc
isl_ast_node_list_alloc
Line
Count
Source
37
4.42k
{
38
4.42k
  LIST(EL) *list;
39
4.42k
40
4.42k
  if (n < 0)
41
4.42k
    
isl_die0
(ctx, isl_error_invalid,
42
4.42k
      "cannot create list of negative length",
43
4.42k
      return NULL);
44
4.42k
  list = isl_alloc(ctx, LIST(EL),
45
4.42k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
4.42k
  if (!list)
47
0
    return NULL;
48
4.42k
49
4.42k
  list->ctx = ctx;
50
4.42k
  isl_ctx_ref(ctx);
51
4.42k
  list->ref = 1;
52
4.42k
  list->size = n;
53
4.42k
  list->n = 0;
54
4.42k
  return list;
55
4.42k
}
isl_ast_graft_list_alloc
Line
Count
Source
37
17.9k
{
38
17.9k
  LIST(EL) *list;
39
17.9k
40
17.9k
  if (n < 0)
41
17.9k
    
isl_die0
(ctx, isl_error_invalid,
42
17.9k
      "cannot create list of negative length",
43
17.9k
      return NULL);
44
17.9k
  list = isl_alloc(ctx, LIST(EL),
45
17.9k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
17.9k
  if (!list)
47
0
    return NULL;
48
17.9k
49
17.9k
  list->ctx = ctx;
50
17.9k
  isl_ctx_ref(ctx);
51
17.9k
  list->ref = 1;
52
17.9k
  list->size = n;
53
17.9k
  list->n = 0;
54
17.9k
  return list;
55
17.9k
}
isl_constraint_list_alloc
Line
Count
Source
37
2.29k
{
38
2.29k
  LIST(EL) *list;
39
2.29k
40
2.29k
  if (n < 0)
41
2.29k
    
isl_die0
(ctx, isl_error_invalid,
42
2.29k
      "cannot create list of negative length",
43
2.29k
      return NULL);
44
2.29k
  list = isl_alloc(ctx, LIST(EL),
45
2.29k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
2.29k
  if (!list)
47
0
    return NULL;
48
2.29k
49
2.29k
  list->ctx = ctx;
50
2.29k
  isl_ctx_ref(ctx);
51
2.29k
  list->ref = 1;
52
2.29k
  list->size = n;
53
2.29k
  list->n = 0;
54
2.29k
  return list;
55
2.29k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_alloc
isl_id_list_alloc
Line
Count
Source
37
1.83k
{
38
1.83k
  LIST(EL) *list;
39
1.83k
40
1.83k
  if (n < 0)
41
1.83k
    
isl_die0
(ctx, isl_error_invalid,
42
1.83k
      "cannot create list of negative length",
43
1.83k
      return NULL);
44
1.83k
  list = isl_alloc(ctx, LIST(EL),
45
1.83k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
1.83k
  if (!list)
47
0
    return NULL;
48
1.83k
49
1.83k
  list->ctx = ctx;
50
1.83k
  isl_ctx_ref(ctx);
51
1.83k
  list->ref = 1;
52
1.83k
  list->size = n;
53
1.83k
  list->n = 0;
54
1.83k
  return list;
55
1.83k
}
isl_basic_map_list_alloc
Line
Count
Source
37
4.56k
{
38
4.56k
  LIST(EL) *list;
39
4.56k
40
4.56k
  if (n < 0)
41
4.56k
    
isl_die0
(ctx, isl_error_invalid,
42
4.56k
      "cannot create list of negative length",
43
4.56k
      return NULL);
44
4.56k
  list = isl_alloc(ctx, LIST(EL),
45
4.56k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
4.56k
  if (!list)
47
0
    return NULL;
48
4.56k
49
4.56k
  list->ctx = ctx;
50
4.56k
  isl_ctx_ref(ctx);
51
4.56k
  list->ref = 1;
52
4.56k
  list->size = n;
53
4.56k
  list->n = 0;
54
4.56k
  return list;
55
4.56k
}
isl_map_list_alloc
Line
Count
Source
37
7.70k
{
38
7.70k
  LIST(EL) *list;
39
7.70k
40
7.70k
  if (n < 0)
41
7.70k
    
isl_die0
(ctx, isl_error_invalid,
42
7.70k
      "cannot create list of negative length",
43
7.70k
      return NULL);
44
7.70k
  list = isl_alloc(ctx, LIST(EL),
45
7.70k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
7.70k
  if (!list)
47
9
    return NULL;
48
7.69k
49
7.69k
  list->ctx = ctx;
50
7.69k
  isl_ctx_ref(ctx);
51
7.69k
  list->ref = 1;
52
7.69k
  list->size = n;
53
7.69k
  list->n = 0;
54
7.69k
  return list;
55
7.69k
}
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
77.7k
{
38
77.7k
  LIST(EL) *list;
39
77.7k
40
77.7k
  if (n < 0)
41
77.7k
    
isl_die0
(ctx, isl_error_invalid,
42
77.7k
      "cannot create list of negative length",
43
77.7k
      return NULL);
44
77.7k
  list = isl_alloc(ctx, LIST(EL),
45
77.7k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
77.7k
  if (!list)
47
0
    return NULL;
48
77.7k
49
77.7k
  list->ctx = ctx;
50
77.7k
  isl_ctx_ref(ctx);
51
77.7k
  list->ref = 1;
52
77.7k
  list->size = n;
53
77.7k
  list->n = 0;
54
77.7k
  return list;
55
77.7k
}
isl_basic_set_list_alloc
Line
Count
Source
37
4.19k
{
38
4.19k
  LIST(EL) *list;
39
4.19k
40
4.19k
  if (n < 0)
41
4.19k
    
isl_die0
(ctx, isl_error_invalid,
42
4.19k
      "cannot create list of negative length",
43
4.19k
      return NULL);
44
4.19k
  list = isl_alloc(ctx, LIST(EL),
45
4.19k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
4.19k
  if (!list)
47
0
    return NULL;
48
4.19k
49
4.19k
  list->ctx = ctx;
50
4.19k
  isl_ctx_ref(ctx);
51
4.19k
  list->ref = 1;
52
4.19k
  list->size = n;
53
4.19k
  list->n = 0;
54
4.19k
  return list;
55
4.19k
}
isl_set_list_alloc
Line
Count
Source
37
11.3k
{
38
11.3k
  LIST(EL) *list;
39
11.3k
40
11.3k
  if (n < 0)
41
11.3k
    
isl_die0
(ctx, isl_error_invalid,
42
11.3k
      "cannot create list of negative length",
43
11.3k
      return NULL);
44
11.3k
  list = isl_alloc(ctx, LIST(EL),
45
11.3k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
11.3k
  if (!list)
47
0
    return NULL;
48
11.3k
49
11.3k
  list->ctx = ctx;
50
11.3k
  isl_ctx_ref(ctx);
51
11.3k
  list->ref = 1;
52
11.3k
  list->size = n;
53
11.3k
  list->n = 0;
54
11.3k
  return list;
55
11.3k
}
isl_union_set_list_alloc
Line
Count
Source
37
485
{
38
485
  LIST(EL) *list;
39
485
40
485
  if (n < 0)
41
485
    
isl_die0
(ctx, isl_error_invalid,
42
485
      "cannot create list of negative length",
43
485
      return NULL);
44
485
  list = isl_alloc(ctx, LIST(EL),
45
485
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
46
485
  if (!list)
47
0
    return NULL;
48
485
49
485
  list->ctx = ctx;
50
485
  isl_ctx_ref(ctx);
51
485
  list->ref = 1;
52
485
  list->size = n;
53
485
  list->n = 0;
54
485
  return list;
55
485
}
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
109k
{
59
109k
  if (!list)
60
0
    return NULL;
61
109k
62
109k
  list->ref++;
63
109k
  return list;
64
109k
}
Unexecuted instantiation: isl_aff_list_copy
isl_pw_aff_list_copy
Line
Count
Source
58
11.7k
{
59
11.7k
  if (!list)
60
0
    return NULL;
61
11.7k
62
11.7k
  list->ref++;
63
11.7k
  return list;
64
11.7k
}
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
216
{
59
216
  if (!list)
60
0
    return NULL;
61
216
62
216
  list->ref++;
63
216
  return list;
64
216
}
Unexecuted instantiation: isl_ast_graft_list_copy
isl_constraint_list_copy
Line
Count
Source
58
701
{
59
701
  if (!list)
60
0
    return NULL;
61
701
62
701
  list->ref++;
63
701
  return list;
64
701
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_copy
isl_id_list_copy
Line
Count
Source
58
34.7k
{
59
34.7k
  if (!list)
60
0
    return NULL;
61
34.7k
62
34.7k
  list->ref++;
63
34.7k
  return list;
64
34.7k
}
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
61.6k
{
59
61.6k
  if (!list)
60
0
    return NULL;
61
61.6k
62
61.6k
  list->ref++;
63
61.6k
  return list;
64
61.6k
}
isl_basic_set_list_copy
Line
Count
Source
58
13
{
59
13
  if (!list)
60
0
    return NULL;
61
13
62
13
  list->ref++;
63
13
  return list;
64
13
}
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
49.5k
{
68
49.5k
  int i;
69
49.5k
  LIST(EL) *dup;
70
49.5k
71
49.5k
  if (!list)
72
0
    return NULL;
73
49.5k
74
49.5k
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
49.5k
  if (!dup)
76
0
    return NULL;
77
243k
  
for (i = 0; 49.5k
i < list->n;
++i194k
)
78
194k
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
49.5k
  return dup;
80
49.5k
}
Unexecuted instantiation: isl_aff_list_dup
isl_pw_aff_list_dup
Line
Count
Source
67
285
{
68
285
  int i;
69
285
  LIST(EL) *dup;
70
285
71
285
  if (!list)
72
0
    return NULL;
73
285
74
285
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
285
  if (!dup)
76
0
    return NULL;
77
645
  
for (i = 0; 285
i < list->n;
++i360
)
78
360
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
285
  return dup;
80
285
}
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
701
{
68
701
  int i;
69
701
  LIST(EL) *dup;
70
701
71
701
  if (!list)
72
0
    return NULL;
73
701
74
701
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
701
  if (!dup)
76
0
    return NULL;
77
2.17k
  
for (i = 0; 701
i < list->n;
++i1.47k
)
78
1.47k
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
701
  return dup;
80
701
}
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.5k
{
68
48.5k
  int i;
69
48.5k
  LIST(EL) *dup;
70
48.5k
71
48.5k
  if (!list)
72
0
    return NULL;
73
48.5k
74
48.5k
  dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
75
48.5k
  if (!dup)
76
0
    return NULL;
77
240k
  
for (i = 0; 48.5k
i < list->n;
++i192k
)
78
192k
    dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
79
48.5k
  return dup;
80
48.5k
}
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
106k
{
84
106k
  if (!list)
85
0
    return NULL;
86
106k
87
106k
  if (list->ref == 1)
88
57.0k
    return list;
89
49.5k
  list->ref--;
90
49.5k
  return FN(LIST(EL),dup)(list);
91
49.5k
}
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.50k
{
84
3.50k
  if (!list)
85
0
    return NULL;
86
3.50k
87
3.50k
  if (list->ref == 1)
88
3.22k
    return list;
89
285
  list->ref--;
90
285
  return FN(LIST(EL),dup)(list);
91
285
}
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
44
{
84
44
  if (!list)
85
0
    return NULL;
86
44
87
44
  if (list->ref == 1)
88
44
    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.21k
{
84
2.21k
  if (!list)
85
0
    return NULL;
86
2.21k
87
2.21k
  if (list->ref == 1)
88
1.51k
    return list;
89
701
  list->ref--;
90
701
  return FN(LIST(EL),dup)(list);
91
701
}
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
490
{
84
490
  if (!list)
85
0
    return NULL;
86
490
87
490
  if (list->ref == 1)
88
490
    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
93.7k
{
84
93.7k
  if (!list)
85
0
    return NULL;
86
93.7k
87
93.7k
  if (list->ref == 1)
88
45.1k
    return list;
89
48.5k
  list->ref--;
90
48.5k
  return FN(LIST(EL),dup)(list);
91
48.5k
}
isl_basic_set_list_cow
Line
Count
Source
83
3.50k
{
84
3.50k
  if (!list)
85
0
    return NULL;
86
3.50k
87
3.50k
  if (list->ref == 1)
88
3.50k
    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.25k
{
84
1.25k
  if (!list)
85
0
    return NULL;
86
1.25k
87
1.25k
  if (list->ref == 1)
88
1.25k
    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
377k
{
101
377k
  isl_ctx *ctx;
102
377k
  int i, new_size;
103
377k
  LIST(EL) *res;
104
377k
105
377k
  if (!list)
106
9
    return NULL;
107
377k
  if (list->ref == 1 && 
list->n + n <= list->size367k
)
108
353k
    return list;
109
24.5k
110
24.5k
  ctx = FN(LIST(EL),get_ctx)(list);
111
24.5k
  new_size = ((list->n + n + 1) * 3) / 2;
112
24.5k
  if (list->ref == 1) {
113
14.6k
    res = isl_realloc(ctx, list, LIST(EL),
114
14.6k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
14.6k
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
14.6k
    res->size = new_size;
118
14.6k
    return res;
119
14.6k
  }
120
9.83k
121
9.83k
  if (list->n + n <= list->size && 
list->size < new_size2.75k
)
122
2.69k
    new_size = list->size;
123
9.83k
124
9.83k
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
9.83k
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
9.83k
128
37.9k
  
for (i = 0; 9.83k
i < list->n;
++i28.1k
)
129
28.1k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
9.83k
131
9.83k
  FN(LIST(EL),free)(list);
132
9.83k
  return res;
133
9.83k
}
isl_aff.c:isl_aff_list_grow
Line
Count
Source
100
8.29k
{
101
8.29k
  isl_ctx *ctx;
102
8.29k
  int i, new_size;
103
8.29k
  LIST(EL) *res;
104
8.29k
105
8.29k
  if (!list)
106
0
    return NULL;
107
8.29k
  if (list->ref == 1 && list->n + n <= list->size)
108
8.27k
    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
19.8k
{
101
19.8k
  isl_ctx *ctx;
102
19.8k
  int i, new_size;
103
19.8k
  LIST(EL) *res;
104
19.8k
105
19.8k
  if (!list)
106
0
    return NULL;
107
19.8k
  if (list->ref == 1 && list->n + n <= list->size)
108
14.2k
    return list;
109
5.61k
110
5.61k
  ctx = FN(LIST(EL),get_ctx)(list);
111
5.61k
  new_size = ((list->n + n + 1) * 3) / 2;
112
5.61k
  if (list->ref == 1) {
113
5.61k
    res = isl_realloc(ctx, list, LIST(EL),
114
5.61k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
5.61k
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
5.61k
    res->size = new_size;
118
5.61k
    return res;
119
5.61k
  }
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
7
{
101
7
  isl_ctx *ctx;
102
7
  int i, new_size;
103
7
  LIST(EL) *res;
104
7
105
7
  if (!list)
106
0
    return NULL;
107
7
  if (list->ref == 1 && list->n + n <= list->size)
108
7
    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.10k
{
101
6.10k
  isl_ctx *ctx;
102
6.10k
  int i, new_size;
103
6.10k
  LIST(EL) *res;
104
6.10k
105
6.10k
  if (!list)
106
0
    return NULL;
107
6.10k
  if (list->ref == 1 && list->n + n <= list->size)
108
6.03k
    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
16.7k
{
101
16.7k
  isl_ctx *ctx;
102
16.7k
  int i, new_size;
103
16.7k
  LIST(EL) *res;
104
16.7k
105
16.7k
  if (!list)
106
0
    return NULL;
107
16.7k
  if (list->ref == 1 && list->n + n <= list->size)
108
16.7k
    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.54k
{
101
3.54k
  isl_ctx *ctx;
102
3.54k
  int i, new_size;
103
3.54k
  LIST(EL) *res;
104
3.54k
105
3.54k
  if (!list)
106
0
    return NULL;
107
3.54k
  if (list->ref == 1 && list->n + n <= list->size)
108
3.54k
    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.27k
{
101
2.27k
  isl_ctx *ctx;
102
2.27k
  int i, new_size;
103
2.27k
  LIST(EL) *res;
104
2.27k
105
2.27k
  if (!list)
106
0
    return NULL;
107
2.27k
  if (list->ref == 1 && list->n + n <= list->size)
108
2.27k
    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
17.5k
{
101
17.5k
  isl_ctx *ctx;
102
17.5k
  int i, new_size;
103
17.5k
  LIST(EL) *res;
104
17.5k
105
17.5k
  if (!list)
106
0
    return NULL;
107
17.5k
  if (list->ref == 1 && list->n + n <= list->size)
108
17.5k
    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.0k
{
101
13.0k
  isl_ctx *ctx;
102
13.0k
  int i, new_size;
103
13.0k
  LIST(EL) *res;
104
13.0k
105
13.0k
  if (!list)
106
9
    return NULL;
107
13.0k
  if (list->ref == 1 && list->n + n <= list->size)
108
13.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_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
268k
{
101
268k
  isl_ctx *ctx;
102
268k
  int i, new_size;
103
268k
  LIST(EL) *res;
104
268k
105
268k
  if (!list)
106
0
    return NULL;
107
268k
  if (list->ref == 1 && 
list->n + n <= list->size258k
)
108
249k
    return list;
109
18.3k
110
18.3k
  ctx = FN(LIST(EL),get_ctx)(list);
111
18.3k
  new_size = ((list->n + n + 1) * 3) / 2;
112
18.3k
  if (list->ref == 1) {
113
8.56k
    res = isl_realloc(ctx, list, LIST(EL),
114
8.56k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
8.56k
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
8.56k
    res->size = new_size;
118
8.56k
    return res;
119
8.56k
  }
120
9.83k
121
9.83k
  if (list->n + n <= list->size && 
list->size < new_size2.75k
)
122
2.69k
    new_size = list->size;
123
9.83k
124
9.83k
  res = FN(LIST(EL),alloc)(ctx, new_size);
125
9.83k
  if (!res)
126
0
    return FN(LIST(EL),free)(list);
127
9.83k
128
37.9k
  
for (i = 0; 9.83k
i < list->n;
++i28.1k
)
129
28.1k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
130
9.83k
131
9.83k
  FN(LIST(EL),free)(list);
132
9.83k
  return res;
133
9.83k
}
isl_set_list.c:isl_basic_set_list_grow
Line
Count
Source
100
4.98k
{
101
4.98k
  isl_ctx *ctx;
102
4.98k
  int i, new_size;
103
4.98k
  LIST(EL) *res;
104
4.98k
105
4.98k
  if (!list)
106
0
    return NULL;
107
4.98k
  if (list->ref == 1 && list->n + n <= list->size)
108
4.98k
    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.7k
{
101
14.7k
  isl_ctx *ctx;
102
14.7k
  int i, new_size;
103
14.7k
  LIST(EL) *res;
104
14.7k
105
14.7k
  if (!list)
106
0
    return NULL;
107
14.7k
  if (list->ref == 1 && list->n + n <= list->size)
108
14.7k
    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.82k
{
101
1.82k
  isl_ctx *ctx;
102
1.82k
  int i, new_size;
103
1.82k
  LIST(EL) *res;
104
1.82k
105
1.82k
  if (!list)
106
0
    return NULL;
107
1.82k
  if (list->ref == 1 && list->n + n <= list->size)
108
1.56k
    return list;
109
260
110
260
  ctx = FN(LIST(EL),get_ctx)(list);
111
260
  new_size = ((list->n + n + 1) * 3) / 2;
112
260
  if (list->ref == 1) {
113
260
    res = isl_realloc(ctx, list, LIST(EL),
114
260
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
115
260
    if (!res)
116
0
      return FN(LIST(EL),free)(list);
117
260
    res->size = new_size;
118
260
    return res;
119
260
  }
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
726k
{
139
726k
  if (!list)
140
0
    return isl_stat_error;
141
726k
  if (index < 0 || index >= list->n)
142
726k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
726k
      "index out of bounds", return isl_stat_error);
144
726k
  return isl_stat_ok;
145
726k
}
isl_aff.c:isl_aff_list_check_index
Line
Count
Source
138
8.71k
{
139
8.71k
  if (!list)
140
0
    return isl_stat_error;
141
8.71k
  if (index < 0 || index >= list->n)
142
8.71k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
8.71k
      "index out of bounds", return isl_stat_error);
144
8.71k
  return isl_stat_ok;
145
8.71k
}
isl_aff.c:isl_pw_aff_list_check_index
Line
Count
Source
138
25.6k
{
139
25.6k
  if (!list)
140
0
    return isl_stat_error;
141
25.6k
  if (index < 0 || index >= list->n)
142
25.6k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
25.6k
      "index out of bounds", return isl_stat_error);
144
25.6k
  return isl_stat_ok;
145
25.6k
}
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
7
{
139
7
  if (!list)
140
0
    return isl_stat_error;
141
7
  if (index < 0 || index >= list->n)
142
7
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
7
      "index out of bounds", return isl_stat_error);
144
7
  return isl_stat_ok;
145
7
}
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.39k
{
139
4.39k
  if (!list)
140
0
    return isl_stat_error;
141
4.39k
  if (index < 0 || index >= list->n)
142
4.39k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
4.39k
      "index out of bounds", return isl_stat_error);
144
4.39k
  return isl_stat_ok;
145
4.39k
}
isl_ast_graft.c:isl_ast_graft_list_check_index
Line
Count
Source
138
40.2k
{
139
40.2k
  if (!list)
140
0
    return isl_stat_error;
141
40.2k
  if (index < 0 || index >= list->n)
142
40.2k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
40.2k
      "index out of bounds", return isl_stat_error);
144
40.2k
  return isl_stat_ok;
145
40.2k
}
isl_constraint.c:isl_constraint_list_check_index
Line
Count
Source
138
2.02k
{
139
2.02k
  if (!list)
140
0
    return isl_stat_error;
141
2.02k
  if (index < 0 || index >= list->n)
142
2.02k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
2.02k
      "index out of bounds", return isl_stat_error);
144
2.02k
  return isl_stat_ok;
145
2.02k
}
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.1k
{
139
23.1k
  if (!list)
140
0
    return isl_stat_error;
141
23.1k
  if (index < 0 || index >= list->n)
142
23.1k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
23.1k
      "index out of bounds", return isl_stat_error);
144
23.1k
  return isl_stat_ok;
145
23.1k
}
isl_map_list.c:isl_basic_map_list_check_index
Line
Count
Source
138
14.8k
{
139
14.8k
  if (!list)
140
0
    return isl_stat_error;
141
14.8k
  if (index < 0 || index >= list->n)
142
14.8k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
14.8k
      "index out of bounds", return isl_stat_error);
144
14.8k
  return isl_stat_ok;
145
14.8k
}
isl_map_list.c:isl_map_list_check_index
Line
Count
Source
138
9.35k
{
139
9.35k
  if (!list)
140
0
    return isl_stat_error;
141
9.35k
  if (index < 0 || index >= list->n)
142
9.35k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
9.35k
      "index out of bounds", return isl_stat_error);
144
9.35k
  return isl_stat_ok;
145
9.35k
}
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
555k
{
139
555k
  if (!list)
140
0
    return isl_stat_error;
141
555k
  if (index < 0 || index >= list->n)
142
555k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
555k
      "index out of bounds", return isl_stat_error);
144
555k
  return isl_stat_ok;
145
555k
}
isl_set_list.c:isl_basic_set_list_check_index
Line
Count
Source
138
15.1k
{
139
15.1k
  if (!list)
140
0
    return isl_stat_error;
141
15.1k
  if (index < 0 || index >= list->n)
142
15.1k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
15.1k
      "index out of bounds", return isl_stat_error);
144
15.1k
  return isl_stat_ok;
145
15.1k
}
isl_set_list.c:isl_set_list_check_index
Line
Count
Source
138
25.0k
{
139
25.0k
  if (!list)
140
0
    return isl_stat_error;
141
25.0k
  if (index < 0 || index >= list->n)
142
25.0k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
25.0k
      "index out of bounds", return isl_stat_error);
144
25.0k
  return isl_stat_ok;
145
25.0k
}
isl_set_list.c:isl_union_set_list_check_index
Line
Count
Source
138
2.84k
{
139
2.84k
  if (!list)
140
0
    return isl_stat_error;
141
2.84k
  if (index < 0 || index >= list->n)
142
2.84k
    
isl_die0
(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
143
2.84k
      "index out of bounds", return isl_stat_error);
144
2.84k
  return isl_stat_ok;
145
2.84k
}
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
377k
{
150
377k
  list = FN(LIST(EL),grow)(list, 1);
151
377k
  if (!list || 
!el377k
)
152
9
    goto error;
153
377k
  list->p[list->n] = el;
154
377k
  list->n++;
155
377k
  return list;
156
377k
error:
157
9
  FN(EL,free)(el);
158
9
  FN(LIST(EL),free)(list);
159
9
  return NULL;
160
377k
}
isl_aff_list_add
Line
Count
Source
149
8.29k
{
150
8.29k
  list = FN(LIST(EL),grow)(list, 1);
151
8.29k
  if (!list || !el)
152
0
    goto error;
153
8.29k
  list->p[list->n] = el;
154
8.29k
  list->n++;
155
8.29k
  return list;
156
8.29k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
8.29k
}
isl_pw_aff_list_add
Line
Count
Source
149
19.8k
{
150
19.8k
  list = FN(LIST(EL),grow)(list, 1);
151
19.8k
  if (!list || !el)
152
0
    goto error;
153
19.8k
  list->p[list->n] = el;
154
19.8k
  list->n++;
155
19.8k
  return list;
156
19.8k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
19.8k
}
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
7
{
150
7
  list = FN(LIST(EL),grow)(list, 1);
151
7
  if (!list || !el)
152
0
    goto error;
153
7
  list->p[list->n] = el;
154
7
  list->n++;
155
7
  return list;
156
7
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
7
}
Unexecuted instantiation: isl_ast_expr_list_add
isl_ast_node_list_add
Line
Count
Source
149
6.10k
{
150
6.10k
  list = FN(LIST(EL),grow)(list, 1);
151
6.10k
  if (!list || !el)
152
0
    goto error;
153
6.10k
  list->p[list->n] = el;
154
6.10k
  list->n++;
155
6.10k
  return list;
156
6.10k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
6.10k
}
isl_ast_graft_list_add
Line
Count
Source
149
16.7k
{
150
16.7k
  list = FN(LIST(EL),grow)(list, 1);
151
16.7k
  if (!list || !el)
152
0
    goto error;
153
16.7k
  list->p[list->n] = el;
154
16.7k
  list->n++;
155
16.7k
  return list;
156
16.7k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
16.7k
}
isl_constraint_list_add
Line
Count
Source
149
3.54k
{
150
3.54k
  list = FN(LIST(EL),grow)(list, 1);
151
3.54k
  if (!list || !el)
152
0
    goto error;
153
3.54k
  list->p[list->n] = el;
154
3.54k
  list->n++;
155
3.54k
  return list;
156
3.54k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
3.54k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_add
isl_id_list_add
Line
Count
Source
149
2.27k
{
150
2.27k
  list = FN(LIST(EL),grow)(list, 1);
151
2.27k
  if (!list || !el)
152
0
    goto error;
153
2.27k
  list->p[list->n] = el;
154
2.27k
  list->n++;
155
2.27k
  return list;
156
2.27k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
2.27k
}
isl_basic_map_list_add
Line
Count
Source
149
17.5k
{
150
17.5k
  list = FN(LIST(EL),grow)(list, 1);
151
17.5k
  if (!list || !el)
152
0
    goto error;
153
17.5k
  list->p[list->n] = el;
154
17.5k
  list->n++;
155
17.5k
  return list;
156
17.5k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
17.5k
}
isl_map_list_add
Line
Count
Source
149
13.0k
{
150
13.0k
  list = FN(LIST(EL),grow)(list, 1);
151
13.0k
  if (!list || 
!el13.0k
)
152
9
    goto error;
153
13.0k
  list->p[list->n] = el;
154
13.0k
  list->n++;
155
13.0k
  return list;
156
13.0k
error:
157
9
  FN(EL,free)(el);
158
9
  FN(LIST(EL),free)(list);
159
9
  return NULL;
160
13.0k
}
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
268k
{
150
268k
  list = FN(LIST(EL),grow)(list, 1);
151
268k
  if (!list || !el)
152
0
    goto error;
153
268k
  list->p[list->n] = el;
154
268k
  list->n++;
155
268k
  return list;
156
268k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
268k
}
isl_basic_set_list_add
Line
Count
Source
149
4.98k
{
150
4.98k
  list = FN(LIST(EL),grow)(list, 1);
151
4.98k
  if (!list || !el)
152
0
    goto error;
153
4.98k
  list->p[list->n] = el;
154
4.98k
  list->n++;
155
4.98k
  return list;
156
4.98k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
4.98k
}
isl_set_list_add
Line
Count
Source
149
14.7k
{
150
14.7k
  list = FN(LIST(EL),grow)(list, 1);
151
14.7k
  if (!list || !el)
152
0
    goto error;
153
14.7k
  list->p[list->n] = el;
154
14.7k
  list->n++;
155
14.7k
  return list;
156
14.7k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
14.7k
}
isl_union_set_list_add
Line
Count
Source
149
1.82k
{
150
1.82k
  list = FN(LIST(EL),grow)(list, 1);
151
1.82k
  if (!list || !el)
152
0
    goto error;
153
1.82k
  list->p[list->n] = el;
154
1.82k
  list->n++;
155
1.82k
  return list;
156
1.82k
error:
157
0
  FN(EL,free)(el);
158
0
  FN(LIST(EL),free)(list);
159
0
  return NULL;
160
1.82k
}
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
70.6k
{
167
70.6k
  int i;
168
70.6k
169
70.6k
  if (!list)
170
0
    return NULL;
171
70.6k
  if (first + n > list->n || first + n < first)
172
70.6k
    
isl_die0
(list->ctx, isl_error_invalid,
173
70.6k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
70.6k
  if (n == 0)
175
654
    return list;
176
70.0k
  list = FN(LIST(EL),cow)(list);
177
70.0k
  if (!list)
178
0
    return NULL;
179
204k
  
for (i = 0; 70.0k
i < n;
++i134k
)
180
134k
    FN(EL,free)(list->p[first + i]);
181
72.5k
  for (i = first; i + n < list->n; 
++i2.53k
)
182
2.53k
    list->p[i] = list->p[i + n];
183
70.0k
  list->n -= n;
184
70.0k
  return list;
185
70.0k
}
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.10k
{
167
2.10k
  int i;
168
2.10k
169
2.10k
  if (!list)
170
0
    return NULL;
171
2.10k
  if (first + n > list->n || first + n < first)
172
2.10k
    
isl_die0
(list->ctx, isl_error_invalid,
173
2.10k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
2.10k
  if (n == 0)
175
654
    return list;
176
1.44k
  list = FN(LIST(EL),cow)(list);
177
1.44k
  if (!list)
178
0
    return NULL;
179
2.97k
  
for (i = 0; 1.44k
i < n;
++i1.52k
)
180
1.52k
    FN(EL,free)(list->p[first + i]);
181
2.31k
  for (i = first; i + n < list->n; 
++i864
)
182
864
    list->p[i] = list->p[i + n];
183
1.44k
  list->n -= n;
184
1.44k
  return list;
185
1.44k
}
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.2k
{
167
67.2k
  int i;
168
67.2k
169
67.2k
  if (!list)
170
0
    return NULL;
171
67.2k
  if (first + n > list->n || first + n < first)
172
67.2k
    
isl_die0
(list->ctx, isl_error_invalid,
173
67.2k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
67.2k
  if (n == 0)
175
0
    return list;
176
67.2k
  list = FN(LIST(EL),cow)(list);
177
67.2k
  if (!list)
178
0
    return NULL;
179
198k
  
for (i = 0; 67.2k
i < n;
++i131k
)
180
131k
    FN(EL,free)(list->p[first + i]);
181
68.9k
  for (i = first; i + n < list->n; 
++i1.66k
)
182
1.66k
    list->p[i] = list->p[i + n];
183
67.2k
  list->n -= n;
184
67.2k
  return list;
185
67.2k
}
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.25k
{
167
1.25k
  int i;
168
1.25k
169
1.25k
  if (!list)
170
0
    return NULL;
171
1.25k
  if (first + n > list->n || first + n < first)
172
1.25k
    
isl_die0
(list->ctx, isl_error_invalid,
173
1.25k
      "index out of bounds", return FN(LIST(EL),free)(list));
174
1.25k
  if (n == 0)
175
0
    return list;
176
1.25k
  list = FN(LIST(EL),cow)(list);
177
1.25k
  if (!list)
178
0
    return NULL;
179
2.50k
  
for (i = 0; 1.25k
i < n;
++i1.25k
)
180
1.25k
    FN(EL,free)(list->p[first + i]);
181
1.25k
  for (i = first; i + n < list->n; 
++i0
)
182
0
    list->p[i] = list->p[i + n];
183
1.25k
  list->n -= n;
184
1.25k
  return list;
185
1.25k
}
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
256k
{
233
256k
  int i;
234
256k
235
256k
  if (!list)
236
38.1k
    return NULL;
237
217k
238
217k
  if (--list->ref > 0)
239
59.5k
    return NULL;
240
158k
241
158k
  isl_ctx_deref(list->ctx);
242
401k
  for (i = 0; i < list->n; 
++i243k
)
243
243k
    FN(EL,free)(list->p[i]);
244
158k
  free(list);
245
158k
246
158k
  return NULL;
247
158k
}
isl_aff_list_free
Line
Count
Source
232
16.2k
{
233
16.2k
  int i;
234
16.2k
235
16.2k
  if (!list)
236
7.98k
    return NULL;
237
8.31k
238
8.31k
  if (--list->ref > 0)
239
0
    return NULL;
240
8.31k
241
8.31k
  isl_ctx_deref(list->ctx);
242
16.6k
  for (i = 0; i < list->n; 
++i8.29k
)
243
8.31k
    
FN8.29k
(EL,free)(list->p[i])8.29k
;
244
8.31k
  free(list);
245
8.31k
246
8.31k
  return NULL;
247
8.31k
}
isl_pw_aff_list_free
Line
Count
Source
232
28.7k
{
233
28.7k
  int i;
234
28.7k
235
28.7k
  if (!list)
236
3
    return NULL;
237
28.7k
238
28.7k
  if (--list->ref > 0)
239
11.4k
    return NULL;
240
17.2k
241
17.2k
  isl_ctx_deref(list->ctx);
242
37.0k
  for (i = 0; i < list->n; 
++i19.8k
)
243
19.8k
    FN(EL,free)(list->p[i]);
244
17.2k
  free(list);
245
17.2k
246
17.2k
  return NULL;
247
17.2k
}
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
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
14
  for (i = 0; i < list->n; 
++i7
)
243
7
    FN(EL,free)(list->p[i]);
244
7
  free(list);
245
7
246
7
  return NULL;
247
7
}
Unexecuted instantiation: isl_ast_expr_list_free
isl_ast_node_list_free
Line
Count
Source
232
4.64k
{
233
4.64k
  int i;
234
4.64k
235
4.64k
  if (!list)
236
0
    return NULL;
237
4.64k
238
4.64k
  if (--list->ref > 0)
239
216
    return NULL;
240
4.42k
241
4.42k
  isl_ctx_deref(list->ctx);
242
10.5k
  for (i = 0; i < list->n; 
++i6.10k
)
243
6.10k
    FN(EL,free)(list->p[i]);
244
4.42k
  free(list);
245
4.42k
246
4.42k
  return NULL;
247
4.42k
}
isl_ast_graft_list_free
Line
Count
Source
232
17.9k
{
233
17.9k
  int i;
234
17.9k
235
17.9k
  if (!list)
236
0
    return NULL;
237
17.9k
238
17.9k
  if (--list->ref > 0)
239
0
    return NULL;
240
17.9k
241
17.9k
  isl_ctx_deref(list->ctx);
242
34.6k
  for (i = 0; i < list->n; 
++i16.7k
)
243
17.9k
    
FN16.7k
(EL,free)(list->p[i])16.7k
;
244
17.9k
  free(list);
245
17.9k
246
17.9k
  return NULL;
247
17.9k
}
isl_constraint_list_free
Line
Count
Source
232
2.29k
{
233
2.29k
  int i;
234
2.29k
235
2.29k
  if (!list)
236
0
    return NULL;
237
2.29k
238
2.29k
  if (--list->ref > 0)
239
0
    return NULL;
240
2.29k
241
2.29k
  isl_ctx_deref(list->ctx);
242
4.31k
  for (i = 0; i < list->n; 
++i2.02k
)
243
2.29k
    
FN2.02k
(EL,free)(list->p[i])2.02k
;
244
2.29k
  free(list);
245
2.29k
246
2.29k
  return NULL;
247
2.29k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_free
isl_id_list_free
Line
Count
Source
232
36.6k
{
233
36.6k
  int i;
234
36.6k
235
36.6k
  if (!list)
236
0
    return NULL;
237
36.6k
238
36.6k
  if (--list->ref > 0)
239
34.7k
    return NULL;
240
1.83k
241
1.83k
  isl_ctx_deref(list->ctx);
242
4.11k
  for (i = 0; i < list->n; 
++i2.27k
)
243
2.27k
    FN(EL,free)(list->p[i]);
244
1.83k
  free(list);
245
1.83k
246
1.83k
  return NULL;
247
1.83k
}
isl_basic_map_list_free
Line
Count
Source
232
3.76k
{
233
3.76k
  int i;
234
3.76k
235
3.76k
  if (!list)
236
0
    return NULL;
237
3.76k
238
3.76k
  if (--list->ref > 0)
239
0
    return NULL;
240
3.76k
241
3.76k
  isl_ctx_deref(list->ctx);
242
17.9k
  for (i = 0; i < list->n; 
++i14.1k
)
243
14.1k
    FN(EL,free)(list->p[i]);
244
3.76k
  free(list);
245
3.76k
246
3.76k
  return NULL;
247
3.76k
}
isl_map_list_free
Line
Count
Source
232
4.93k
{
233
4.93k
  int i;
234
4.93k
235
4.93k
  if (!list)
236
18
    return NULL;
237
4.91k
238
4.91k
  if (--list->ref > 0)
239
0
    return NULL;
240
4.91k
241
4.91k
  isl_ctx_deref(list->ctx);
242
14.3k
  for (i = 0; i < list->n; 
++i9.46k
)
243
9.46k
    FN(EL,free)(list->p[i]);
244
4.91k
  free(list);
245
4.91k
246
4.91k
  return NULL;
247
4.91k
}
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
112k
{
233
112k
  int i;
234
112k
235
112k
  if (!list)
236
22.1k
    return NULL;
237
90.7k
238
90.7k
  if (--list->ref > 0)
239
13.0k
    return NULL;
240
77.6k
241
77.6k
  isl_ctx_deref(list->ctx);
242
214k
  for (i = 0; i < list->n; 
++i136k
)
243
136k
    FN(EL,free)(list->p[i]);
244
77.6k
  free(list);
245
77.6k
246
77.6k
  return NULL;
247
77.6k
}
isl_basic_set_list_free
Line
Count
Source
232
5.00k
{
233
5.00k
  int i;
234
5.00k
235
5.00k
  if (!list)
236
0
    return NULL;
237
5.00k
238
5.00k
  if (--list->ref > 0)
239
13
    return NULL;
240
4.99k
241
4.99k
  isl_ctx_deref(list->ctx);
242
13.4k
  for (i = 0; i < list->n; 
++i8.42k
)
243
8.42k
    FN(EL,free)(list->p[i]);
244
4.99k
  free(list);
245
4.99k
246
4.99k
  return NULL;
247
4.99k
}
isl_set_list_free
Line
Count
Source
232
22.1k
{
233
22.1k
  int i;
234
22.1k
235
22.1k
  if (!list)
236
7.98k
    return NULL;
237
14.1k
238
14.1k
  if (--list->ref > 0)
239
0
    return NULL;
240
14.1k
241
14.1k
  isl_ctx_deref(list->ctx);
242
32.5k
  for (i = 0; i < list->n; 
++i18.3k
)
243
18.3k
    FN(EL,free)(list->p[i]);
244
14.1k
  free(list);
245
14.1k
246
14.1k
  return NULL;
247
14.1k
}
isl_union_set_list_free
Line
Count
Source
232
485
{
233
485
  int i;
234
485
235
485
  if (!list)
236
0
    return NULL;
237
485
238
485
  if (--list->ref > 0)
239
0
    return NULL;
240
485
241
485
  isl_ctx_deref(list->ctx);
242
1.05k
  for (i = 0; i < list->n; 
++i569
)
243
569
    FN(EL,free)(list->p[i]);
244
485
  free(list);
245
485
246
485
  return NULL;
247
485
}
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
964k
{
253
964k
  return list ? 
list->n949k
:
015.1k
;
254
964k
}
isl_aff_list_size
Line
Count
Source
252
1.10k
{
253
1.10k
  return list ? list->n : 
00
;
254
1.10k
}
isl_pw_aff_list_size
Line
Count
Source
252
17.5k
{
253
17.5k
  return list ? list->n : 
00
;
254
17.5k
}
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
7
{
253
7
  return list ? list->n : 
00
;
254
7
}
Unexecuted instantiation: isl_ast_expr_list_size
isl_ast_node_list_size
Line
Count
Source
252
4.83k
{
253
4.83k
  return list ? list->n : 
00
;
254
4.83k
}
isl_ast_graft_list_size
Line
Count
Source
252
27.1k
{
253
27.1k
  return list ? list->n : 
00
;
254
27.1k
}
isl_constraint_list_size
Line
Count
Source
252
3.69k
{
253
3.69k
  return list ? list->n : 
00
;
254
3.69k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_size
isl_id_list_size
Line
Count
Source
252
1.07k
{
253
1.07k
  return list ? list->n : 
00
;
254
1.07k
}
isl_basic_map_list_size
Line
Count
Source
252
3.43k
{
253
3.43k
  return list ? list->n : 
00
;
254
3.43k
}
isl_map_list_size
Line
Count
Source
252
4.93k
{
253
4.93k
  return list ? 
list->n4.90k
:
025
;
254
4.93k
}
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
880k
{
253
880k
  return list ? 
list->n865k
:
015.0k
;
254
880k
}
isl_basic_set_list_size
Line
Count
Source
252
6.53k
{
253
6.53k
  return list ? list->n : 
00
;
254
6.53k
}
isl_set_list_size
Line
Count
Source
252
10.8k
{
253
10.8k
  return list ? 
list->n10.8k
:
03
;
254
10.8k
}
isl_union_set_list_size
Line
Count
Source
252
2.76k
{
253
2.76k
  return list ? list->n : 
00
;
254
2.76k
}
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
955k
{
260
955k
  return FN(LIST(EL),size)(list);
261
955k
}
isl_aff_list_n_aff
Line
Count
Source
259
1.10k
{
260
1.10k
  return FN(LIST(EL),size)(list);
261
1.10k
}
isl_pw_aff_list_n_pw_aff
Line
Count
Source
259
17.5k
{
260
17.5k
  return FN(LIST(EL),size)(list);
261
17.5k
}
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
7
{
260
7
  return FN(LIST(EL),size)(list);
261
7
}
Unexecuted instantiation: isl_ast_expr_list_n_ast_expr
isl_ast_node_list_n_ast_node
Line
Count
Source
259
4.83k
{
260
4.83k
  return FN(LIST(EL),size)(list);
261
4.83k
}
isl_ast_graft_list_n_ast_graft
Line
Count
Source
259
27.1k
{
260
27.1k
  return FN(LIST(EL),size)(list);
261
27.1k
}
isl_constraint_list_n_constraint
Line
Count
Source
259
3.69k
{
260
3.69k
  return FN(LIST(EL),size)(list);
261
3.69k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_n_pw_qpolynomial_fold
isl_id_list_n_id
Line
Count
Source
259
1.07k
{
260
1.07k
  return FN(LIST(EL),size)(list);
261
1.07k
}
isl_basic_map_list_n_basic_map
Line
Count
Source
259
3.21k
{
260
3.21k
  return FN(LIST(EL),size)(list);
261
3.21k
}
isl_map_list_n_map
Line
Count
Source
259
806
{
260
806
  return FN(LIST(EL),size)(list);
261
806
}
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
880k
{
260
880k
  return FN(LIST(EL),size)(list);
261
880k
}
isl_basic_set_list_n_basic_set
Line
Count
Source
259
4.45k
{
260
4.45k
  return FN(LIST(EL),size)(list);
261
4.45k
}
isl_set_list_n_set
Line
Count
Source
259
8.01k
{
260
8.01k
  return FN(LIST(EL),size)(list);
261
8.01k
}
isl_union_set_list_n_union_set
Line
Count
Source
259
2.76k
{
260
2.76k
  return FN(LIST(EL),size)(list);
261
2.76k
}
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
680k
{
267
680k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
680k
  return list->p[index];
270
680k
}
isl_aff.c:isl_aff_list_peek
Line
Count
Source
266
8.71k
{
267
8.71k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
8.71k
  return list->p[index];
270
8.71k
}
isl_aff.c:isl_pw_aff_list_peek
Line
Count
Source
266
22.2k
{
267
22.2k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
22.2k
  return list->p[index];
270
22.2k
}
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
7
{
267
7
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
7
  return list->p[index];
270
7
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_peek
isl_ast.c:isl_ast_node_list_peek
Line
Count
Source
266
4.39k
{
267
4.39k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
4.39k
  return list->p[index];
270
4.39k
}
isl_ast_graft.c:isl_ast_graft_list_peek
Line
Count
Source
266
33.6k
{
267
33.6k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
33.6k
  return list->p[index];
270
33.6k
}
isl_constraint.c:isl_constraint_list_peek
Line
Count
Source
266
2.02k
{
267
2.02k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
2.02k
  return list->p[index];
270
2.02k
}
Unexecuted instantiation: isl_fold.c:isl_pw_qpolynomial_fold_list_peek
isl_id.c:isl_id_list_peek
Line
Count
Source
266
23.1k
{
267
23.1k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
23.1k
  return list->p[index];
270
23.1k
}
isl_map_list.c:isl_basic_map_list_peek
Line
Count
Source
266
11.3k
{
267
11.3k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
11.3k
  return list->p[index];
270
11.3k
}
isl_map_list.c:isl_map_list_peek
Line
Count
Source
266
9.35k
{
267
9.35k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
9.35k
  return list->p[index];
270
9.35k
}
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
528k
{
267
528k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
528k
  return list->p[index];
270
528k
}
isl_set_list.c:isl_basic_set_list_peek
Line
Count
Source
266
11.5k
{
267
11.5k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
11.5k
  return list->p[index];
270
11.5k
}
isl_set_list.c:isl_set_list_peek
Line
Count
Source
266
21.7k
{
267
21.7k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
21.7k
  return list->p[index];
270
21.7k
}
isl_set_list.c:isl_union_set_list_peek
Line
Count
Source
266
2.84k
{
267
2.84k
  if (FN(LIST(EL),check_index)(list, index) < 0)
268
0
    return NULL;
269
2.84k
  return list->p[index];
270
2.84k
}
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
671k
{
276
671k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
671k
}
isl_aff_list_get_at
Line
Count
Source
275
8.71k
{
276
8.71k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
8.71k
}
isl_pw_aff_list_get_at
Line
Count
Source
275
13.5k
{
276
13.5k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
13.5k
}
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
7
{
276
7
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
7
}
Unexecuted instantiation: isl_ast_expr_list_get_at
isl_ast_node_list_get_at
Line
Count
Source
275
4.39k
{
276
4.39k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
4.39k
}
isl_ast_graft_list_get_at
Line
Count
Source
275
33.6k
{
276
33.6k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
33.6k
}
isl_constraint_list_get_at
Line
Count
Source
275
2.02k
{
276
2.02k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
2.02k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_get_at
isl_id_list_get_at
Line
Count
Source
275
23.1k
{
276
23.1k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
23.1k
}
isl_basic_map_list_get_at
Line
Count
Source
275
11.3k
{
276
11.3k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
11.3k
}
isl_map_list_get_at
Line
Count
Source
275
9.35k
{
276
9.35k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
9.35k
}
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
528k
{
276
528k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
528k
}
isl_basic_set_list_get_at
Line
Count
Source
275
11.5k
{
276
11.5k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
11.5k
}
isl_set_list_get_at
Line
Count
Source
275
21.7k
{
276
21.7k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
21.7k
}
isl_union_set_list_get_at
Line
Count
Source
275
2.84k
{
276
2.84k
  return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
277
2.84k
}
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
656k
{
283
656k
  return FN(LIST(EL),get_at)(list, index);
284
656k
}
isl_aff_list_get_aff
Line
Count
Source
282
8.71k
{
283
8.71k
  return FN(LIST(EL),get_at)(list, index);
284
8.71k
}
isl_pw_aff_list_get_pw_aff
Line
Count
Source
282
13.5k
{
283
13.5k
  return FN(LIST(EL),get_at)(list, index);
284
13.5k
}
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
7
{
283
7
  return FN(LIST(EL),get_at)(list, index);
284
7
}
Unexecuted instantiation: isl_ast_expr_list_get_ast_expr
isl_ast_node_list_get_ast_node
Line
Count
Source
282
4.39k
{
283
4.39k
  return FN(LIST(EL),get_at)(list, index);
284
4.39k
}
isl_ast_graft_list_get_ast_graft
Line
Count
Source
282
33.6k
{
283
33.6k
  return FN(LIST(EL),get_at)(list, index);
284
33.6k
}
isl_constraint_list_get_constraint
Line
Count
Source
282
2.02k
{
283
2.02k
  return FN(LIST(EL),get_at)(list, index);
284
2.02k
}
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_get_pw_qpolynomial_fold
isl_id_list_get_id
Line
Count
Source
282
23.1k
{
283
23.1k
  return FN(LIST(EL),get_at)(list, index);
284
23.1k
}
isl_basic_map_list_get_basic_map
Line
Count
Source
282
11.1k
{
283
11.1k
  return FN(LIST(EL),get_at)(list, index);
284
11.1k
}
isl_map_list_get_map
Line
Count
Source
282
1.80k
{
283
1.80k
  return FN(LIST(EL),get_at)(list, index);
284
1.80k
}
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
528k
{
283
528k
  return FN(LIST(EL),get_at)(list, index);
284
528k
}
isl_basic_set_list_get_basic_set
Line
Count
Source
282
8.83k
{
283
8.83k
  return FN(LIST(EL),get_at)(list, index);
284
8.83k
}
isl_set_list_get_set
Line
Count
Source
282
17.7k
{
283
17.7k
  return FN(LIST(EL),get_at)(list, index);
284
17.7k
}
isl_union_set_list_get_union_set
Line
Count
Source
282
2.84k
{
283
2.84k
  return FN(LIST(EL),get_at)(list, index);
284
2.84k
}
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
46.7k
{
291
46.7k
  if (!list || !el)
292
0
    goto error;
293
46.7k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
46.7k
  if (list->p[index] == el) {
296
10.9k
    FN(EL,free)(el);
297
10.9k
    return list;
298
10.9k
  }
299
35.7k
  list = FN(LIST(EL),cow)(list);
300
35.7k
  if (!list)
301
0
    goto error;
302
35.7k
  FN(EL,free)(list->p[index]);
303
35.7k
  list->p[index] = el;
304
35.7k
  return list;
305
35.7k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
35.7k
}
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.43k
{
291
3.43k
  if (!list || !el)
292
0
    goto error;
293
3.43k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.43k
  if (list->p[index] == el) {
296
0
    FN(EL,free)(el);
297
0
    return list;
298
0
  }
299
3.43k
  list = FN(LIST(EL),cow)(list);
300
3.43k
  if (!list)
301
0
    goto error;
302
3.43k
  FN(EL,free)(list->p[index]);
303
3.43k
  list->p[index] = el;
304
3.43k
  return list;
305
3.43k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
3.43k
}
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.60k
{
291
6.60k
  if (!list || !el)
292
0
    goto error;
293
6.60k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
6.60k
  if (list->p[index] == el) {
296
6.58k
    FN(EL,free)(el);
297
6.58k
    return list;
298
6.58k
  }
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.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
2.95k
    FN(EL,free)(el);
297
2.95k
    return list;
298
2.95k
  }
299
490
  list = FN(LIST(EL),cow)(list);
300
490
  if (!list)
301
0
    goto error;
302
490
  FN(EL,free)(list->p[index]);
303
490
  list->p[index] = el;
304
490
  return list;
305
490
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
490
}
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
26.4k
{
291
26.4k
  if (!list || !el)
292
0
    goto error;
293
26.4k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
26.4k
  if (list->p[index] == el) {
296
3
    FN(EL,free)(el);
297
3
    return list;
298
3
  }
299
26.4k
  list = FN(LIST(EL),cow)(list);
300
26.4k
  if (!list)
301
0
    goto error;
302
26.4k
  FN(EL,free)(list->p[index]);
303
26.4k
  list->p[index] = el;
304
26.4k
  return list;
305
26.4k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
26.4k
}
isl_basic_set_list_set_basic_set
Line
Count
Source
290
3.50k
{
291
3.50k
  if (!list || !el)
292
0
    goto error;
293
3.50k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.50k
  if (list->p[index] == el) {
296
0
    FN(EL,free)(el);
297
0
    return list;
298
0
  }
299
3.50k
  list = FN(LIST(EL),cow)(list);
300
3.50k
  if (!list)
301
0
    goto error;
302
3.50k
  FN(EL,free)(list->p[index]);
303
3.50k
  list->p[index] = el;
304
3.50k
  return list;
305
3.50k
error:
306
0
  FN(EL,free)(el);
307
0
  FN(LIST(EL),free)(list);
308
0
  return NULL;
309
3.50k
}
isl_set_list_set_set
Line
Count
Source
290
3.29k
{
291
3.29k
  if (!list || !el)
292
0
    goto error;
293
3.29k
  if (FN(LIST(EL),check_index)(list, index) < 0)
294
0
    goto error;
295
3.29k
  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.51k
{
376
1.51k
  int i;
377
1.51k
378
1.51k
  if (!list)
379
0
    return isl_stat_error;
380
1.51k
381
3.33k
  
for (i = 0; 1.51k
i < list->n;
++i1.82k
) {
382
2.35k
    EL *el = FN(EL,copy)(list->p[i]);
383
2.35k
    if (!el)
384
0
      return isl_stat_error;
385
2.35k
    if (fn(el, user) < 0)
386
534
      return isl_stat_error;
387
2.35k
  }
388
1.51k
389
1.51k
  
return isl_stat_ok980
;
390
1.51k
}
Unexecuted instantiation: isl_aff_list_foreach
isl_pw_aff_list_foreach
Line
Count
Source
375
701
{
376
701
  int i;
377
701
378
701
  if (!list)
379
0
    return isl_stat_error;
380
701
381
877
  
for (i = 0; 701
i < list->n;
++i176
) {
382
710
    EL *el = FN(EL,copy)(list->p[i]);
383
710
    if (!el)
384
0
      return isl_stat_error;
385
710
    if (fn(el, user) < 0)
386
534
      return isl_stat_error;
387
710
  }
388
701
389
701
  
return isl_stat_ok167
;
390
701
}
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
701
{
376
701
  int i;
377
701
378
701
  if (!list)
379
0
    return isl_stat_error;
380
701
381
2.22k
  
for (i = 0; 701
i < list->n;
++i1.52k
) {
382
1.52k
    EL *el = FN(EL,copy)(list->p[i]);
383
1.52k
    if (!el)
384
0
      return isl_stat_error;
385
1.52k
    if (fn(el, user) < 0)
386
0
      return isl_stat_error;
387
1.52k
  }
388
701
389
701
  return isl_stat_ok;
390
701
}
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.12k
{
430
1.12k
  S(LIST(EL),sort_data) *data = user;
431
1.12k
  EL * const *el1 = a;
432
1.12k
  EL * const *el2 = b;
433
1.12k
434
1.12k
  return data->cmp(*el1, *el2, data->user);
435
1.12k
}
Unexecuted instantiation: isl_aff.c:isl_aff_list_cmp
isl_aff.c:isl_pw_aff_list_cmp
Line
Count
Source
429
75
{
430
75
  S(LIST(EL),sort_data) *data = user;
431
75
  EL * const *el1 = a;
432
75
  EL * const *el2 = b;
433
75
434
75
  return data->cmp(*el1, *el2, data->user);
435
75
}
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
20
{
430
20
  S(LIST(EL),sort_data) *data = user;
431
20
  EL * const *el1 = a;
432
20
  EL * const *el2 = b;
433
20
434
20
  return data->cmp(*el1, *el2, data->user);
435
20
}
isl_constraint.c:isl_constraint_list_cmp
Line
Count
Source
429
1.02k
{
430
1.02k
  S(LIST(EL),sort_data) *data = user;
431
1.02k
  EL * const *el1 = a;
432
1.02k
  EL * const *el2 = b;
433
1.02k
434
1.02k
  return data->cmp(*el1, *el2, data->user);
435
1.02k
}
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.69k
{
443
1.69k
  S(LIST(EL),sort_data) data = { cmp, user };
444
1.69k
445
1.69k
  if (!list)
446
0
    return NULL;
447
1.69k
  if (list->n <= 1)
448
841
    return list;
449
858
  list = FN(LIST(EL),cow)(list);
450
858
  if (!list)
451
0
    return NULL;
452
858
453
858
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
858
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
858
457
858
  return list;
458
858
}
Unexecuted instantiation: isl_aff_list_sort
isl_pw_aff_list_sort
Line
Count
Source
442
81
{
443
81
  S(LIST(EL),sort_data) data = { cmp, user };
444
81
445
81
  if (!list)
446
0
    return NULL;
447
81
  if (list->n <= 1)
448
11
    return list;
449
70
  list = FN(LIST(EL),cow)(list);
450
70
  if (!list)
451
0
    return NULL;
452
70
453
70
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
70
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
70
457
70
  return list;
458
70
}
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
28
{
443
28
  S(LIST(EL),sort_data) data = { cmp, user };
444
28
445
28
  if (!list)
446
0
    return NULL;
447
28
  if (list->n <= 1)
448
8
    return list;
449
20
  list = FN(LIST(EL),cow)(list);
450
20
  if (!list)
451
0
    return NULL;
452
20
453
20
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
20
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
20
457
20
  return list;
458
20
}
isl_constraint_list_sort
Line
Count
Source
442
1.59k
{
443
1.59k
  S(LIST(EL),sort_data) data = { cmp, user };
444
1.59k
445
1.59k
  if (!list)
446
0
    return NULL;
447
1.59k
  if (list->n <= 1)
448
822
    return list;
449
768
  list = FN(LIST(EL),cow)(list);
450
768
  if (!list)
451
0
    return NULL;
452
768
453
768
  if (isl_sort(list->p, list->n, sizeof(list->p[0]),
454
768
      &FN(LIST(EL),cmp), &data) < 0)
455
0
    return FN(LIST(EL),free)(list);
456
768
457
768
  return list;
458
768
}
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
118
{
477
118
  S(LIST(EL),foreach_scc_data) *data = user;
478
118
479
118
  return data->follows(data->list->p[i], data->list->p[j],
480
118
        data->follows_user);
481
118
}
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
118
{
477
118
  S(LIST(EL),foreach_scc_data) *data = user;
478
118
479
118
  return data->follows(data->list->p[i], data->list->p[j],
480
118
        data->follows_user);
481
118
}
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
90
{
489
90
  int i;
490
90
  isl_ctx *ctx;
491
90
  LIST(EL) *slice;
492
90
493
90
  ctx = FN(LIST(EL),get_ctx)(list);
494
90
  slice = FN(LIST(EL),alloc)(ctx, n);
495
180
  for (i = 0; i < n; 
++i90
) {
496
90
    EL *el;
497
90
498
90
    el = FN(EL,copy)(list->p[pos[i]]);
499
90
    slice = FN(LIST(EL),add)(slice, el);
500
90
  }
501
90
502
90
  return fn(slice, user);
503
90
}
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
90
{
489
90
  int i;
490
90
  isl_ctx *ctx;
491
90
  LIST(EL) *slice;
492
90
493
90
  ctx = FN(LIST(EL),get_ctx)(list);
494
90
  slice = FN(LIST(EL),alloc)(ctx, n);
495
180
  for (i = 0; i < n; 
++i90
) {
496
90
    EL *el;
497
90
498
90
    el = FN(EL,copy)(list->p[pos[i]]);
499
90
    slice = FN(LIST(EL),add)(slice, el);
500
90
  }
501
90
502
90
  return fn(slice, user);
503
90
}
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
54
{
522
54
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
523
54
  int i, n;
524
54
  isl_ctx *ctx;
525
54
  struct isl_tarjan_graph *g;
526
54
527
54
  if (!list)
528
0
    return isl_stat_error;
529
54
  if (list->n == 0)
530
0
    return isl_stat_ok;
531
54
  if (list->n == 1)
532
0
    return fn(FN(LIST(EL),copy)(list), fn_user);
533
54
534
54
  ctx = FN(LIST(EL),get_ctx)(list);
535
54
  n = list->n;
536
54
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
537
54
  if (!g)
538
0
    return isl_stat_error;
539
54
540
54
  i = 0;
541
103
  do {
542
103
    int first;
543
103
544
103
    if (g->order[i] == -1)
545
103
      
isl_die0
(ctx, isl_error_internal, "cannot happen",
546
103
        break);
547
103
    first = i;
548
225
    while (g->order[i] != -1) {
549
122
      ++i; --n;
550
122
    }
551
103
    if (first == 0 && 
n == 054
) {
552
13
      isl_tarjan_graph_free(g);
553
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
554
13
    }
555
90
    if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first,
556
90
              fn, fn_user) < 0)
557
0
      break;
558
90
    ++i;
559
90
  } while (n);
560
54
561
54
  isl_tarjan_graph_free(g);
562
41
563
41
  return n > 0 ? 
isl_stat_error0
: isl_stat_ok;
564
54
}
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
54
{
522
54
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
523
54
  int i, n;
524
54
  isl_ctx *ctx;
525
54
  struct isl_tarjan_graph *g;
526
54
527
54
  if (!list)
528
0
    return isl_stat_error;
529
54
  if (list->n == 0)
530
0
    return isl_stat_ok;
531
54
  if (list->n == 1)
532
0
    return fn(FN(LIST(EL),copy)(list), fn_user);
533
54
534
54
  ctx = FN(LIST(EL),get_ctx)(list);
535
54
  n = list->n;
536
54
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
537
54
  if (!g)
538
0
    return isl_stat_error;
539
54
540
54
  i = 0;
541
103
  do {
542
103
    int first;
543
103
544
103
    if (g->order[i] == -1)
545
103
      
isl_die0
(ctx, isl_error_internal, "cannot happen",
546
103
        break);
547
103
    first = i;
548
225
    while (g->order[i] != -1) {
549
122
      ++i; --n;
550
122
    }
551
103
    if (first == 0 && 
n == 054
) {
552
13
      isl_tarjan_graph_free(g);
553
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
554
13
    }
555
90
    if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first,
556
90
              fn, fn_user) < 0)
557
0
      break;
558
90
    ++i;
559
90
  } while (n);
560
54
561
54
  isl_tarjan_graph_free(g);
562
41
563
41
  return n > 0 ? 
isl_stat_error0
: isl_stat_ok;
564
54
}
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
31.5k
{
568
31.5k
  isl_ctx *ctx;
569
31.5k
  LIST(EL) *list;
570
31.5k
571
31.5k
  if (!el)
572
1
    return NULL;
573
31.5k
  ctx = FN(EL,get_ctx)(el);
574
31.5k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
31.5k
  if (!list)
576
0
    goto error;
577
31.5k
  list = FN(LIST(EL),add)(list, el);
578
31.5k
  return list;
579
31.5k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
31.5k
}
isl_aff_list_from_aff
Line
Count
Source
567
7.96k
{
568
7.96k
  isl_ctx *ctx;
569
7.96k
  LIST(EL) *list;
570
7.96k
571
7.96k
  if (!el)
572
0
    return NULL;
573
7.96k
  ctx = FN(EL,get_ctx)(el);
574
7.96k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
7.96k
  if (!list)
576
0
    goto error;
577
7.96k
  list = FN(LIST(EL),add)(list, el);
578
7.96k
  return list;
579
7.96k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
7.96k
}
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
7
{
568
7
  isl_ctx *ctx;
569
7
  LIST(EL) *list;
570
7
571
7
  if (!el)
572
0
    return NULL;
573
7
  ctx = FN(EL,get_ctx)(el);
574
7
  list = FN(LIST(EL),alloc)(ctx, 1);
575
7
  if (!list)
576
0
    goto error;
577
7
  list = FN(LIST(EL),add)(list, el);
578
7
  return list;
579
7
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
7
}
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.18k
{
568
2.18k
  isl_ctx *ctx;
569
2.18k
  LIST(EL) *list;
570
2.18k
571
2.18k
  if (!el)
572
0
    return NULL;
573
2.18k
  ctx = FN(EL,get_ctx)(el);
574
2.18k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
2.18k
  if (!list)
576
0
    goto error;
577
2.18k
  list = FN(LIST(EL),add)(list, el);
578
2.18k
  return list;
579
2.18k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
2.18k
}
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.91k
{
568
3.91k
  isl_ctx *ctx;
569
3.91k
  LIST(EL) *list;
570
3.91k
571
3.91k
  if (!el)
572
0
    return NULL;
573
3.91k
  ctx = FN(EL,get_ctx)(el);
574
3.91k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
3.91k
  if (!list)
576
0
    goto error;
577
3.91k
  list = FN(LIST(EL),add)(list, el);
578
3.91k
  return list;
579
3.91k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
3.91k
}
isl_basic_set_list_from_basic_set
Line
Count
Source
567
16
{
568
16
  isl_ctx *ctx;
569
16
  LIST(EL) *list;
570
16
571
16
  if (!el)
572
0
    return NULL;
573
16
  ctx = FN(EL,get_ctx)(el);
574
16
  list = FN(LIST(EL),alloc)(ctx, 1);
575
16
  if (!list)
576
0
    goto error;
577
16
  list = FN(LIST(EL),add)(list, el);
578
16
  return list;
579
16
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
16
}
isl_set_list_from_set
Line
Count
Source
567
7.96k
{
568
7.96k
  isl_ctx *ctx;
569
7.96k
  LIST(EL) *list;
570
7.96k
571
7.96k
  if (!el)
572
0
    return NULL;
573
7.96k
  ctx = FN(EL,get_ctx)(el);
574
7.96k
  list = FN(LIST(EL),alloc)(ctx, 1);
575
7.96k
  if (!list)
576
0
    goto error;
577
7.96k
  list = FN(LIST(EL),add)(list, el);
578
7.96k
  return list;
579
7.96k
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
7.96k
}
isl_union_set_list_from_union_set
Line
Count
Source
567
416
{
568
416
  isl_ctx *ctx;
569
416
  LIST(EL) *list;
570
416
571
416
  if (!el)
572
0
    return NULL;
573
416
  ctx = FN(EL,get_ctx)(el);
574
416
  list = FN(LIST(EL),alloc)(ctx, 1);
575
416
  if (!list)
576
0
    goto error;
577
416
  list = FN(LIST(EL),add)(list, el);
578
416
  return list;
579
416
error:
580
0
  FN(EL,free)(el);
581
0
  return NULL;
582
416
}
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.90k
{
591
1.90k
  int i;
592
1.90k
593
1.90k
  for (i = 0; i < list2->n; 
++i0
)
594
0
    list1 = FN(LIST(EL),add)(list1, FN(EL,copy)(list2->p[i]));
595
1.90k
  FN(LIST(EL),free)(list2);
596
1.90k
  return list1;
597
1.90k
}
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.15k
{
607
8.15k
  int i;
608
8.15k
  isl_ctx *ctx;
609
8.15k
  LIST(EL) *res;
610
8.15k
611
8.15k
  if (!list1 || !list2)
612
0
    goto error;
613
8.15k
614
8.15k
  if (list1->ref == 1 && 
list1->n + list2->n <= list1->size7.53k
)
615
2.01k
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
6.14k
617
6.14k
  ctx = FN(LIST(EL),get_ctx)(list1);
618
6.14k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
17.7k
  for (i = 0; i < list1->n; 
++i11.5k
)
620
11.5k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
15.0k
  for (i = 0; i < list2->n; 
++i8.89k
)
622
8.89k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
6.14k
624
6.14k
  FN(LIST(EL),free)(list1);
625
6.14k
  FN(LIST(EL),free)(list2);
626
6.14k
  return res;
627
6.14k
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
6.14k
}
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.44k
{
607
5.44k
  int i;
608
5.44k
  isl_ctx *ctx;
609
5.44k
  LIST(EL) *res;
610
5.44k
611
5.44k
  if (!list1 || !list2)
612
0
    goto error;
613
5.44k
614
5.44k
  if (list1->ref == 1 && list1->n + list2->n <= list1->size)
615
1.90k
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
3.53k
617
3.53k
  ctx = FN(LIST(EL),get_ctx)(list1);
618
3.53k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
3.93k
  for (i = 0; i < list1->n; 
++i397
)
620
397
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
7.86k
  for (i = 0; i < list2->n; 
++i4.33k
)
622
4.33k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
3.53k
624
3.53k
  FN(LIST(EL),free)(list1);
625
3.53k
  FN(LIST(EL),free)(list2);
626
3.53k
  return res;
627
3.53k
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
3.53k
}
Unexecuted instantiation: isl_constraint_list_concat
Unexecuted instantiation: isl_pw_qpolynomial_fold_list_concat
isl_id_list_concat
Line
Count
Source
606
623
{
607
623
  int i;
608
623
  isl_ctx *ctx;
609
623
  LIST(EL) *res;
610
623
611
623
  if (!list1 || !list2)
612
0
    goto error;
613
623
614
623
  if (list1->ref == 1 && 
list1->n + list2->n <= list1->size0
)
615
0
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
623
617
623
  ctx = FN(LIST(EL),get_ctx)(list1);
618
623
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
1.14k
  for (i = 0; i < list1->n; 
++i517
)
620
517
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
1.49k
  for (i = 0; i < list2->n; 
++i875
)
622
875
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
623
624
623
  FN(LIST(EL),free)(list1);
625
623
  FN(LIST(EL),free)(list2);
626
623
  return res;
627
623
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
623
}
isl_basic_map_list_concat
Line
Count
Source
606
1.80k
{
607
1.80k
  int i;
608
1.80k
  isl_ctx *ctx;
609
1.80k
  LIST(EL) *res;
610
1.80k
611
1.80k
  if (!list1 || !list2)
612
0
    goto error;
613
1.80k
614
1.80k
  if (list1->ref == 1 && list1->n + list2->n <= list1->size)
615
62
    return FN(LIST(EL),concat_inplace)(list1, list2);
616
1.74k
617
1.74k
  ctx = FN(LIST(EL),get_ctx)(list1);
618
1.74k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
619
12.1k
  for (i = 0; i < list1->n; 
++i10.4k
)
620
10.4k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
621
5.18k
  for (i = 0; i < list2->n; 
++i3.44k
)
622
3.44k
    res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
623
1.74k
624
1.74k
  FN(LIST(EL),free)(list1);
625
1.74k
  FN(LIST(EL),free)(list2);
626
1.74k
  return res;
627
1.74k
error:
628
0
  FN(LIST(EL),free)(list1);
629
0
  FN(LIST(EL),free)(list2);
630
0
  return NULL;
631
1.74k
}
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