Coverage Report

Created: 2017-04-29 12:21

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/llvm/tools/polly/lib/External/isl/isl_list_templ.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2008-2009 Katholieke Universiteit Leuven
3
 * Copyright 2011      INRIA Saclay
4
 * Copyright 2012-2013 Ecole Normale Superieure
5
 *
6
 * Use of this software is governed by the MIT license
7
 *
8
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10
 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11
 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12
 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13
 */
14
15
#include <isl_sort.h>
16
#include <isl_tarjan.h>
17
18
4.16k
#define xCAT(A,B) A ## B
19
4.16k
#define CAT(A,B) xCAT(A,B)
20
#undef EL
21
4.16k
#define EL CAT(isl_,BASE)
22
1.69M
#define xFN(TYPE,NAME) TYPE ## _ ## NAME
23
1.69M
#define FN(TYPE,NAME) xFN(TYPE,NAME)
24
439k
#define xLIST(EL) EL ## _list
25
439k
#define LIST(EL) xLIST(EL)
26
2.67k
#define xS(TYPE,NAME) struct TYPE ## _ ## NAME
27
2.67k
#define S(TYPE,NAME) xS(TYPE,NAME)
28
29
isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
30
73.3k
{
31
73.3k
  return list ? list->ctx : NULL;
32
73.3k
}
isl_aff_list_get_ctx
Line
Count
Source
30
20
{
31
20
  return list ? list->ctx : NULL;
32
20
}
isl_pw_aff_list_get_ctx
Line
Count
Source
30
9.12k
{
31
9.12k
  return list ? list->ctx : NULL;
32
9.12k
}
isl_union_pw_aff_list_get_ctx
Line
Count
Source
30
15
{
31
15
  return list ? list->ctx : NULL;
32
15
}
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
30
316
{
31
316
  return list ? list->ctx : NULL;
32
316
}
isl_ast_graft_list_get_ctx
Line
Count
Source
30
8.15k
{
31
8.15k
  return list ? list->ctx : NULL;
32
8.15k
}
isl_band_list_get_ctx
Line
Count
Source
30
12
{
31
12
  return list ? list->ctx : NULL;
32
12
}
isl_constraint_list_get_ctx
Line
Count
Source
30
1.03k
{
31
1.03k
  return list ? list->ctx : NULL;
32
1.03k
}
isl_id_list_get_ctx
Line
Count
Source
30
564
{
31
564
  return list ? list->ctx : NULL;
32
564
}
isl_basic_map_list_get_ctx
Line
Count
Source
30
1.00k
{
31
1.00k
  return list ? list->ctx : NULL;
32
1.00k
}
isl_map_list_get_ctx
Line
Count
Source
30
429
{
31
429
  return list ? list->ctx : NULL;
32
429
}
isl_union_map_list_get_ctx
Line
Count
Source
30
1
{
31
1
  return list ? list->ctx : NULL;
32
1
}
isl_schedule_tree_list_get_ctx
Line
Count
Source
30
51.0k
{
31
51.0k
  return list ? list->ctx : NULL;
32
51.0k
}
isl_basic_set_list_get_ctx
Line
Count
Source
30
1.49k
{
31
1.49k
  return list ? list->ctx : NULL;
32
1.49k
}
isl_set_list_get_ctx
Line
Count
Source
30
20
{
31
20
  return list ? list->ctx : NULL;
32
20
}
isl_union_set_list_get_ctx
Line
Count
Source
30
167
{
31
167
  return list ? list->ctx : NULL;
32
167
}
isl_val_list_get_ctx
Line
Count
Source
30
8
{
31
8
  return list ? list->ctx : NULL;
32
8
}
33
34
__isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n)
35
108k
{
36
108k
  LIST(EL) *list;
37
108k
38
108k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
108k
      "cannot create list of negative length",
41
108k
      return NULL);
42
108k
  
list = 108k
isl_alloc108k
(ctx, LIST(EL),
43
108k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
108k
  if (!list)
45
0
    return NULL;
46
108k
47
108k
  list->ctx = ctx;
48
108k
  isl_ctx_ref(ctx);
49
108k
  list->ref = 1;
50
108k
  list->size = n;
51
108k
  list->n = 0;
52
108k
  return list;
53
108k
}
isl_id_list_alloc
Line
Count
Source
35
1.67k
{
36
1.67k
  LIST(EL) *list;
37
1.67k
38
1.67k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
1.67k
      "cannot create list of negative length",
41
1.67k
      return NULL);
42
1.67k
  
list = 1.67k
isl_alloc1.67k
(ctx, LIST(EL),
43
1.67k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
1.67k
  if (!list)
45
0
    return NULL;
46
1.67k
47
1.67k
  list->ctx = ctx;
48
1.67k
  isl_ctx_ref(ctx);
49
1.67k
  list->ref = 1;
50
1.67k
  list->size = n;
51
1.67k
  list->n = 0;
52
1.67k
  return list;
53
1.67k
}
isl_val_list_alloc
Line
Count
Source
35
11
{
36
11
  LIST(EL) *list;
37
11
38
11
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
11
      "cannot create list of negative length",
41
11
      return NULL);
42
11
  
list = 11
isl_alloc11
(ctx, LIST(EL),
43
11
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
11
  if (!list)
45
0
    return NULL;
46
11
47
11
  list->ctx = ctx;
48
11
  isl_ctx_ref(ctx);
49
11
  list->ref = 1;
50
11
  list->size = n;
51
11
  list->n = 0;
52
11
  return list;
53
11
}
isl_aff_list_alloc
Line
Count
Source
35
5.17k
{
36
5.17k
  LIST(EL) *list;
37
5.17k
38
5.17k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
5.17k
      "cannot create list of negative length",
41
5.17k
      return NULL);
42
5.17k
  
list = 5.17k
isl_alloc5.17k
(ctx, LIST(EL),
43
5.17k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
5.17k
  if (!list)
45
0
    return NULL;
46
5.17k
47
5.17k
  list->ctx = ctx;
48
5.17k
  isl_ctx_ref(ctx);
49
5.17k
  list->ref = 1;
50
5.17k
  list->size = n;
51
5.17k
  list->n = 0;
52
5.17k
  return list;
53
5.17k
}
isl_pw_aff_list_alloc
Line
Count
Source
35
13.7k
{
36
13.7k
  LIST(EL) *list;
37
13.7k
38
13.7k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
13.7k
      "cannot create list of negative length",
41
13.7k
      return NULL);
42
13.7k
  
list = 13.7k
isl_alloc13.7k
(ctx, LIST(EL),
43
13.7k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
13.7k
  if (!list)
45
0
    return NULL;
46
13.7k
47
13.7k
  list->ctx = ctx;
48
13.7k
  isl_ctx_ref(ctx);
49
13.7k
  list->ref = 1;
50
13.7k
  list->size = n;
51
13.7k
  list->n = 0;
52
13.7k
  return list;
53
13.7k
}
isl_union_pw_aff_list_alloc
Line
Count
Source
35
15
{
36
15
  LIST(EL) *list;
37
15
38
15
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
15
      "cannot create list of negative length",
41
15
      return NULL);
42
15
  
list = 15
isl_alloc15
(ctx, LIST(EL),
43
15
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
15
  if (!list)
45
0
    return NULL;
46
15
47
15
  list->ctx = ctx;
48
15
  isl_ctx_ref(ctx);
49
15
  list->ref = 1;
50
15
  list->size = n;
51
15
  list->n = 0;
52
15
  return list;
53
15
}
isl_union_pw_multi_aff_list_alloc
Line
Count
Source
35
7
{
36
7
  LIST(EL) *list;
37
7
38
7
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
7
      "cannot create list of negative length",
41
7
      return NULL);
42
7
  
list = 7
isl_alloc7
(ctx, LIST(EL),
43
7
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
7
  if (!list)
45
0
    return NULL;
46
7
47
7
  list->ctx = ctx;
48
7
  isl_ctx_ref(ctx);
49
7
  list->ref = 1;
50
7
  list->size = n;
51
7
  list->n = 0;
52
7
  return list;
53
7
}
Unexecuted instantiation: isl_ast_expr_list_alloc
isl_ast_node_list_alloc
Line
Count
Source
35
2.63k
{
36
2.63k
  LIST(EL) *list;
37
2.63k
38
2.63k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
2.63k
      "cannot create list of negative length",
41
2.63k
      return NULL);
42
2.63k
  
list = 2.63k
isl_alloc2.63k
(ctx, LIST(EL),
43
2.63k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
2.63k
  if (!list)
45
0
    return NULL;
46
2.63k
47
2.63k
  list->ctx = ctx;
48
2.63k
  isl_ctx_ref(ctx);
49
2.63k
  list->ref = 1;
50
2.63k
  list->size = n;
51
2.63k
  list->n = 0;
52
2.63k
  return list;
53
2.63k
}
isl_ast_graft_list_alloc
Line
Count
Source
35
12.0k
{
36
12.0k
  LIST(EL) *list;
37
12.0k
38
12.0k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
12.0k
      "cannot create list of negative length",
41
12.0k
      return NULL);
42
12.0k
  
list = 12.0k
isl_alloc12.0k
(ctx, LIST(EL),
43
12.0k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
12.0k
  if (!list)
45
0
    return NULL;
46
12.0k
47
12.0k
  list->ctx = ctx;
48
12.0k
  isl_ctx_ref(ctx);
49
12.0k
  list->ref = 1;
50
12.0k
  list->size = n;
51
12.0k
  list->n = 0;
52
12.0k
  return list;
53
12.0k
}
isl_band_list_alloc
Line
Count
Source
35
16
{
36
16
  LIST(EL) *list;
37
16
38
16
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
16
      "cannot create list of negative length",
41
16
      return NULL);
42
16
  
list = 16
isl_alloc16
(ctx, LIST(EL),
43
16
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
16
  if (!list)
45
0
    return NULL;
46
16
47
16
  list->ctx = ctx;
48
16
  isl_ctx_ref(ctx);
49
16
  list->ref = 1;
50
16
  list->size = n;
51
16
  list->n = 0;
52
16
  return list;
53
16
}
isl_constraint_list_alloc
Line
Count
Source
35
2.12k
{
36
2.12k
  LIST(EL) *list;
37
2.12k
38
2.12k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
2.12k
      "cannot create list of negative length",
41
2.12k
      return NULL);
42
2.12k
  
list = 2.12k
isl_alloc2.12k
(ctx, LIST(EL),
43
2.12k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
2.12k
  if (!list)
45
0
    return NULL;
46
2.12k
47
2.12k
  list->ctx = ctx;
48
2.12k
  isl_ctx_ref(ctx);
49
2.12k
  list->ref = 1;
50
2.12k
  list->size = n;
51
2.12k
  list->n = 0;
52
2.12k
  return list;
53
2.12k
}
isl_basic_map_list_alloc
Line
Count
Source
35
2.43k
{
36
2.43k
  LIST(EL) *list;
37
2.43k
38
2.43k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
2.43k
      "cannot create list of negative length",
41
2.43k
      return NULL);
42
2.43k
  
list = 2.43k
isl_alloc2.43k
(ctx, LIST(EL),
43
2.43k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
2.43k
  if (!list)
45
0
    return NULL;
46
2.43k
47
2.43k
  list->ctx = ctx;
48
2.43k
  isl_ctx_ref(ctx);
49
2.43k
  list->ref = 1;
50
2.43k
  list->size = n;
51
2.43k
  list->n = 0;
52
2.43k
  return list;
53
2.43k
}
isl_map_list_alloc
Line
Count
Source
35
396
{
36
396
  LIST(EL) *list;
37
396
38
396
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
396
      "cannot create list of negative length",
41
396
      return NULL);
42
396
  
list = 396
isl_alloc396
(ctx, LIST(EL),
43
396
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
396
  if (!list)
45
0
    return NULL;
46
396
47
396
  list->ctx = ctx;
48
396
  isl_ctx_ref(ctx);
49
396
  list->ref = 1;
50
396
  list->size = n;
51
396
  list->n = 0;
52
396
  return list;
53
396
}
isl_union_map_list_alloc
Line
Count
Source
35
1
{
36
1
  LIST(EL) *list;
37
1
38
1
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
1
      "cannot create list of negative length",
41
1
      return NULL);
42
1
  
list = 1
isl_alloc1
(ctx, LIST(EL),
43
1
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
1
  if (!list)
45
0
    return NULL;
46
1
47
1
  list->ctx = ctx;
48
1
  isl_ctx_ref(ctx);
49
1
  list->ref = 1;
50
1
  list->size = n;
51
1
  list->n = 0;
52
1
  return list;
53
1
}
isl_schedule_tree_list_alloc
Line
Count
Source
35
59.1k
{
36
59.1k
  LIST(EL) *list;
37
59.1k
38
59.1k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
59.1k
      "cannot create list of negative length",
41
59.1k
      return NULL);
42
59.1k
  
list = 59.1k
isl_alloc59.1k
(ctx, LIST(EL),
43
59.1k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
59.1k
  if (!list)
45
0
    return NULL;
46
59.1k
47
59.1k
  list->ctx = ctx;
48
59.1k
  isl_ctx_ref(ctx);
49
59.1k
  list->ref = 1;
50
59.1k
  list->size = n;
51
59.1k
  list->n = 0;
52
59.1k
  return list;
53
59.1k
}
isl_basic_set_list_alloc
Line
Count
Source
35
2.21k
{
36
2.21k
  LIST(EL) *list;
37
2.21k
38
2.21k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
2.21k
      "cannot create list of negative length",
41
2.21k
      return NULL);
42
2.21k
  
list = 2.21k
isl_alloc2.21k
(ctx, LIST(EL),
43
2.21k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
2.21k
  if (!list)
45
0
    return NULL;
46
2.21k
47
2.21k
  list->ctx = ctx;
48
2.21k
  isl_ctx_ref(ctx);
49
2.21k
  list->ref = 1;
50
2.21k
  list->size = n;
51
2.21k
  list->n = 0;
52
2.21k
  return list;
53
2.21k
}
isl_set_list_alloc
Line
Count
Source
35
6.34k
{
36
6.34k
  LIST(EL) *list;
37
6.34k
38
6.34k
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
6.34k
      "cannot create list of negative length",
41
6.34k
      return NULL);
42
6.34k
  
list = 6.34k
isl_alloc6.34k
(ctx, LIST(EL),
43
6.34k
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
6.34k
  if (!list)
45
0
    return NULL;
46
6.34k
47
6.34k
  list->ctx = ctx;
48
6.34k
  isl_ctx_ref(ctx);
49
6.34k
  list->ref = 1;
50
6.34k
  list->size = n;
51
6.34k
  list->n = 0;
52
6.34k
  return list;
53
6.34k
}
isl_union_set_list_alloc
Line
Count
Source
35
396
{
36
396
  LIST(EL) *list;
37
396
38
396
  if (n < 0)
39
0
    isl_die(ctx, isl_error_invalid,
40
396
      "cannot create list of negative length",
41
396
      return NULL);
42
396
  
list = 396
isl_alloc396
(ctx, LIST(EL),
43
396
       sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
44
396
  if (!list)
45
0
    return NULL;
46
396
47
396
  list->ctx = ctx;
48
396
  isl_ctx_ref(ctx);
49
396
  list->ref = 1;
50
396
  list->size = n;
51
396
  list->n = 0;
52
396
  return list;
53
396
}
54
55
__isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list)
56
78.6k
{
57
78.6k
  if (!list)
58
0
    return NULL;
59
78.6k
60
78.6k
  list->ref++;
61
78.6k
  return list;
62
78.6k
}
Unexecuted instantiation: isl_val_list_copy
Unexecuted instantiation: isl_aff_list_copy
isl_pw_aff_list_copy
Line
Count
Source
56
10.1k
{
57
10.1k
  if (!list)
58
0
    return NULL;
59
10.1k
60
10.1k
  list->ref++;
61
10.1k
  return list;
62
10.1k
}
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
56
166
{
57
166
  if (!list)
58
0
    return NULL;
59
166
60
166
  list->ref++;
61
166
  return list;
62
166
}
Unexecuted instantiation: isl_ast_graft_list_copy
Unexecuted instantiation: isl_band_list_copy
isl_constraint_list_copy
Line
Count
Source
56
637
{
57
637
  if (!list)
58
0
    return NULL;
59
637
60
637
  list->ref++;
61
637
  return list;
62
637
}
isl_id_list_copy
Line
Count
Source
56
20.8k
{
57
20.8k
  if (!list)
58
0
    return NULL;
59
20.8k
60
20.8k
  list->ref++;
61
20.8k
  return list;
62
20.8k
}
Unexecuted instantiation: isl_basic_map_list_copy
Unexecuted instantiation: isl_map_list_copy
Unexecuted instantiation: isl_union_map_list_copy
isl_schedule_tree_list_copy
Line
Count
Source
56
46.8k
{
57
46.8k
  if (!list)
58
0
    return NULL;
59
46.8k
60
46.8k
  list->ref++;
61
46.8k
  return list;
62
46.8k
}
isl_basic_set_list_copy
Line
Count
Source
56
13
{
57
13
  if (!list)
58
0
    return NULL;
59
13
60
13
  list->ref++;
61
13
  return list;
62
13
}
Unexecuted instantiation: isl_set_list_copy
Unexecuted instantiation: isl_union_set_list_copy
63
64
__isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list)
65
38.7k
{
66
38.7k
  int i;
67
38.7k
  LIST(EL) *dup;
68
38.7k
69
38.7k
  if (!list)
70
0
    return NULL;
71
38.7k
72
38.7k
  
dup = 38.7k
FN38.7k
(LIST(EL),alloc)(
FN38.7k
(LIST(EL),get_ctx)(list), list->n);
73
38.7k
  if (!dup)
74
0
    return NULL;
75
192k
  
for (i = 0; 38.7k
i < list->n192k
;
++i154k
)
76
154k
    
dup = 154k
FN154k
(LIST(EL),add)(dup,
FN154k
(EL,copy)(list->p[i]));
77
38.7k
  return dup;
78
38.7k
}
isl_pw_aff_list_dup
Line
Count
Source
65
255
{
66
255
  int i;
67
255
  LIST(EL) *dup;
68
255
69
255
  if (!list)
70
0
    return NULL;
71
255
72
255
  
dup = 255
FN255
(LIST(EL),alloc)(
FN255
(LIST(EL),get_ctx)(list), list->n);
73
255
  if (!dup)
74
0
    return NULL;
75
575
  
for (i = 0; 255
i < list->n575
;
++i320
)
76
320
    
dup = 320
FN320
(LIST(EL),add)(dup,
FN320
(EL,copy)(list->p[i]));
77
255
  return dup;
78
255
}
Unexecuted instantiation: isl_val_list_dup
Unexecuted instantiation: isl_union_set_list_dup
Unexecuted instantiation: isl_set_list_dup
Unexecuted instantiation: isl_basic_set_list_dup
isl_schedule_tree_list_dup
Line
Count
Source
65
37.8k
{
66
37.8k
  int i;
67
37.8k
  LIST(EL) *dup;
68
37.8k
69
37.8k
  if (!list)
70
0
    return NULL;
71
37.8k
72
37.8k
  
dup = 37.8k
FN37.8k
(LIST(EL),alloc)(
FN37.8k
(LIST(EL),get_ctx)(list), list->n);
73
37.8k
  if (!dup)
74
0
    return NULL;
75
190k
  
for (i = 0; 37.8k
i < list->n190k
;
++i152k
)
76
152k
    
dup = 152k
FN152k
(LIST(EL),add)(dup,
FN152k
(EL,copy)(list->p[i]));
77
37.8k
  return dup;
78
37.8k
}
Unexecuted instantiation: isl_union_map_list_dup
Unexecuted instantiation: isl_map_list_dup
Unexecuted instantiation: isl_basic_map_list_dup
Unexecuted instantiation: isl_id_list_dup
isl_constraint_list_dup
Line
Count
Source
65
637
{
66
637
  int i;
67
637
  LIST(EL) *dup;
68
637
69
637
  if (!list)
70
0
    return NULL;
71
637
72
637
  
dup = 637
FN637
(LIST(EL),alloc)(
FN637
(LIST(EL),get_ctx)(list), list->n);
73
637
  if (!dup)
74
0
    return NULL;
75
1.97k
  
for (i = 0; 637
i < list->n1.97k
;
++i1.33k
)
76
1.33k
    
dup = 1.33k
FN1.33k
(LIST(EL),add)(dup,
FN1.33k
(EL,copy)(list->p[i]));
77
637
  return dup;
78
637
}
isl_band_list_dup
Line
Count
Source
65
4
{
66
4
  int i;
67
4
  LIST(EL) *dup;
68
4
69
4
  if (!list)
70
0
    return NULL;
71
4
72
4
  
dup = 4
FN4
(LIST(EL),alloc)(
FN4
(LIST(EL),get_ctx)(list), list->n);
73
4
  if (!dup)
74
0
    return NULL;
75
10
  
for (i = 0; 4
i < list->n10
;
++i6
)
76
6
    
dup = 6
FN6
(LIST(EL),add)(dup,
FN6
(EL,copy)(list->p[i]));
77
4
  return dup;
78
4
}
Unexecuted instantiation: isl_ast_graft_list_dup
Unexecuted instantiation: isl_ast_node_list_dup
Unexecuted instantiation: isl_ast_expr_list_dup
Unexecuted instantiation: isl_union_pw_multi_aff_list_dup
Unexecuted instantiation: isl_union_pw_aff_list_dup
Unexecuted instantiation: isl_aff_list_dup
79
80
__isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list)
81
78.7k
{
82
78.7k
  if (!list)
83
0
    return NULL;
84
78.7k
85
78.7k
  
if (78.7k
list->ref == 178.7k
)
86
40.0k
    return list;
87
38.7k
  list->ref--;
88
38.7k
  return FN(LIST(EL),dup)(list);
89
78.7k
}
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
81
34
{
82
34
  if (!list)
83
0
    return NULL;
84
34
85
34
  
if (34
list->ref == 134
)
86
34
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
34
}
Unexecuted instantiation: isl_band_list_cow
isl_constraint_list_cow
Line
Count
Source
81
2.02k
{
82
2.02k
  if (!list)
83
0
    return NULL;
84
2.02k
85
2.02k
  
if (2.02k
list->ref == 12.02k
)
86
1.38k
    return list;
87
637
  list->ref--;
88
637
  return FN(LIST(EL),dup)(list);
89
2.02k
}
isl_id_list_cow
Line
Count
Source
81
1
{
82
1
  if (!list)
83
0
    return NULL;
84
1
85
1
  
if (1
list->ref == 11
)
86
1
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
1
}
isl_basic_map_list_cow
Line
Count
Source
81
55
{
82
55
  if (!list)
83
0
    return NULL;
84
55
85
55
  
if (55
list->ref == 155
)
86
55
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
55
}
isl_aff_list_cow
Line
Count
Source
81
2
{
82
2
  if (!list)
83
0
    return NULL;
84
2
85
2
  
if (2
list->ref == 12
)
86
2
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
2
}
Unexecuted instantiation: isl_map_list_cow
isl_union_map_list_cow
Line
Count
Source
81
6
{
82
6
  if (!list)
83
0
    return NULL;
84
6
85
6
  
if (6
list->ref == 16
)
86
6
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
6
}
isl_schedule_tree_list_cow
Line
Count
Source
81
69.6k
{
82
69.6k
  if (!list)
83
0
    return NULL;
84
69.6k
85
69.6k
  
if (69.6k
list->ref == 169.6k
)
86
31.8k
    return list;
87
37.8k
  list->ref--;
88
37.8k
  return FN(LIST(EL),dup)(list);
89
69.6k
}
isl_basic_set_list_cow
Line
Count
Source
81
2.26k
{
82
2.26k
  if (!list)
83
0
    return NULL;
84
2.26k
85
2.26k
  
if (2.26k
list->ref == 12.26k
)
86
2.26k
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
2.26k
}
isl_set_list_cow
Line
Count
Source
81
966
{
82
966
  if (!list)
83
0
    return NULL;
84
966
85
966
  
if (966
list->ref == 1966
)
86
966
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
966
}
isl_union_set_list_cow
Line
Count
Source
81
1.00k
{
82
1.00k
  if (!list)
83
0
    return NULL;
84
1.00k
85
1.00k
  
if (1.00k
list->ref == 11.00k
)
86
1.00k
    return list;
87
0
  list->ref--;
88
0
  return FN(LIST(EL),dup)(list);
89
1.00k
}
Unexecuted instantiation: isl_val_list_cow
isl_pw_aff_list_cow
Line
Count
Source
81
2.80k
{
82
2.80k
  if (!list)
83
0
    return NULL;
84
2.80k
85
2.80k
  
if (2.80k
list->ref == 12.80k
)
86
2.54k
    return list;
87
255
  list->ref--;
88
255
  return FN(LIST(EL),dup)(list);
89
2.80k
}
90
91
/* Make sure "list" has room for at least "n" more pieces.
92
 * Always return a list with a single reference.
93
 *
94
 * If there is only one reference to list, we extend it in place.
95
 * Otherwise, we create a new LIST(EL) and copy the elements.
96
 */
97
static __isl_give LIST(EL) *FN(LIST(EL),grow)(__isl_take LIST(EL) *list, int n)
98
265k
{
99
265k
  isl_ctx *ctx;
100
265k
  int i, new_size;
101
265k
  LIST(EL) *res;
102
265k
103
265k
  if (!list)
104
0
    return NULL;
105
265k
  
if (265k
list->ref == 1 && 265k
list->n + n <= list->size258k
)
106
248k
    return list;
107
265k
108
16.6k
  
ctx = 16.6k
FN16.6k
(LIST(EL),get_ctx)(list);
109
16.6k
  new_size = ((list->n + n + 1) * 3) / 2;
110
16.6k
  if (
list->ref == 116.6k
)
{9.88k
111
9.88k
    res = isl_realloc(ctx, list, LIST(EL),
112
9.88k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
9.88k
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
9.88k
    res->size = new_size;
116
9.88k
    return res;
117
9.88k
  }
118
16.6k
119
6.78k
  
if (6.78k
list->n + n <= list->size && 6.78k
list->size < new_size1.51k
)
120
1.46k
    new_size = list->size;
121
6.78k
122
6.78k
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
6.78k
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
6.78k
126
18.2k
  
for (i = 0; 6.78k
i < list->n18.2k
;
++i11.5k
)
127
11.5k
    
res = 11.5k
FN11.5k
(LIST(EL),add)(res,
FN11.5k
(EL,copy)(list->p[i]));
128
6.78k
129
6.78k
  FN(LIST(EL),free)(list);
130
6.78k
  return res;
131
6.78k
}
isl_val.c:isl_val_list_grow
Line
Count
Source
98
21
{
99
21
  isl_ctx *ctx;
100
21
  int i, new_size;
101
21
  LIST(EL) *res;
102
21
103
21
  if (!list)
104
0
    return NULL;
105
21
  
if (21
list->ref == 1 && 21
list->n + n <= list->size21
)
106
13
    return list;
107
21
108
8
  
ctx = 8
FN8
(LIST(EL),get_ctx)(list);
109
8
  new_size = ((list->n + n + 1) * 3) / 2;
110
8
  if (
list->ref == 18
)
{8
111
8
    res = isl_realloc(ctx, list, LIST(EL),
112
8
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
8
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
8
    res->size = new_size;
116
8
    return res;
117
8
  }
118
8
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_aff.c:isl_aff_list_grow
Line
Count
Source
98
5.17k
{
99
5.17k
  isl_ctx *ctx;
100
5.17k
  int i, new_size;
101
5.17k
  LIST(EL) *res;
102
5.17k
103
5.17k
  if (!list)
104
0
    return NULL;
105
5.17k
  
if (5.17k
list->ref == 1 && 5.17k
list->n + n <= list->size5.17k
)
106
5.15k
    return list;
107
5.17k
108
20
  
ctx = 20
FN20
(LIST(EL),get_ctx)(list);
109
20
  new_size = ((list->n + n + 1) * 3) / 2;
110
20
  if (
list->ref == 120
)
{20
111
20
    res = isl_realloc(ctx, list, LIST(EL),
112
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
20
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
20
    res->size = new_size;
116
20
    return res;
117
20
  }
118
20
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_set_list.c:isl_union_set_list_grow
Line
Count
Source
98
1.48k
{
99
1.48k
  isl_ctx *ctx;
100
1.48k
  int i, new_size;
101
1.48k
  LIST(EL) *res;
102
1.48k
103
1.48k
  if (!list)
104
0
    return NULL;
105
1.48k
  
if (1.48k
list->ref == 1 && 1.48k
list->n + n <= list->size1.48k
)
106
1.32k
    return list;
107
1.48k
108
167
  
ctx = 167
FN167
(LIST(EL),get_ctx)(list);
109
167
  new_size = ((list->n + n + 1) * 3) / 2;
110
167
  if (
list->ref == 1167
)
{167
111
167
    res = isl_realloc(ctx, list, LIST(EL),
112
167
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
167
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
167
    res->size = new_size;
116
167
    return res;
117
167
  }
118
167
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_set_list.c:isl_set_list_grow
Line
Count
Source
98
7.13k
{
99
7.13k
  isl_ctx *ctx;
100
7.13k
  int i, new_size;
101
7.13k
  LIST(EL) *res;
102
7.13k
103
7.13k
  if (!list)
104
0
    return NULL;
105
7.13k
  
if (7.13k
list->ref == 1 && 7.13k
list->n + n <= list->size7.13k
)
106
7.11k
    return list;
107
7.13k
108
20
  
ctx = 20
FN20
(LIST(EL),get_ctx)(list);
109
20
  new_size = ((list->n + n + 1) * 3) / 2;
110
20
  if (
list->ref == 120
)
{20
111
20
    res = isl_realloc(ctx, list, LIST(EL),
112
20
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
20
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
20
    res->size = new_size;
116
20
    return res;
117
20
  }
118
20
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_set_list.c:isl_basic_set_list_grow
Line
Count
Source
98
2.31k
{
99
2.31k
  isl_ctx *ctx;
100
2.31k
  int i, new_size;
101
2.31k
  LIST(EL) *res;
102
2.31k
103
2.31k
  if (!list)
104
0
    return NULL;
105
2.31k
  
if (2.31k
list->ref == 1 && 2.31k
list->n + n <= list->size2.31k
)
106
2.31k
    return list;
107
2.31k
108
2
  
ctx = 2
FN2
(LIST(EL),get_ctx)(list);
109
2
  new_size = ((list->n + n + 1) * 3) / 2;
110
2
  if (
list->ref == 12
)
{2
111
2
    res = isl_realloc(ctx, list, LIST(EL),
112
2
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
2
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
2
    res->size = new_size;
116
2
    return res;
117
2
  }
118
2
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_schedule_tree.c:isl_schedule_tree_list_grow
Line
Count
Source
98
197k
{
99
197k
  isl_ctx *ctx;
100
197k
  int i, new_size;
101
197k
  LIST(EL) *res;
102
197k
103
197k
  if (!list)
104
0
    return NULL;
105
197k
  
if (197k
list->ref == 1 && 197k
list->n + n <= list->size190k
)
106
184k
    return list;
107
197k
108
12.4k
  
ctx = 12.4k
FN12.4k
(LIST(EL),get_ctx)(list);
109
12.4k
  new_size = ((list->n + n + 1) * 3) / 2;
110
12.4k
  if (
list->ref == 112.4k
)
{5.67k
111
5.67k
    res = isl_realloc(ctx, list, LIST(EL),
112
5.67k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
5.67k
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
5.67k
    res->size = new_size;
116
5.67k
    return res;
117
5.67k
  }
118
12.4k
119
6.78k
  
if (6.78k
list->n + n <= list->size && 6.78k
list->size < new_size1.51k
)
120
1.46k
    new_size = list->size;
121
6.78k
122
6.78k
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
6.78k
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
6.78k
126
18.2k
  
for (i = 0; 6.78k
i < list->n18.2k
;
++i11.5k
)
127
11.5k
    
res = 11.5k
FN11.5k
(LIST(EL),add)(res,
FN11.5k
(EL,copy)(list->p[i]));
128
6.78k
129
6.78k
  FN(LIST(EL),free)(list);
130
6.78k
  return res;
131
6.78k
}
isl_map_list.c:isl_union_map_list_grow
Line
Count
Source
98
5
{
99
5
  isl_ctx *ctx;
100
5
  int i, new_size;
101
5
  LIST(EL) *res;
102
5
103
5
  if (!list)
104
0
    return NULL;
105
5
  
if (5
list->ref == 1 && 5
list->n + n <= list->size5
)
106
4
    return list;
107
5
108
1
  
ctx = 1
FN1
(LIST(EL),get_ctx)(list);
109
1
  new_size = ((list->n + n + 1) * 3) / 2;
110
1
  if (
list->ref == 11
)
{1
111
1
    res = isl_realloc(ctx, list, LIST(EL),
112
1
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
1
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
1
    res->size = new_size;
116
1
    return res;
117
1
  }
118
1
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_map_list.c:isl_map_list_grow
Line
Count
Source
98
792
{
99
792
  isl_ctx *ctx;
100
792
  int i, new_size;
101
792
  LIST(EL) *res;
102
792
103
792
  if (!list)
104
0
    return NULL;
105
792
  
if (792
list->ref == 1 && 792
list->n + n <= list->size792
)
106
792
    return list;
107
792
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_map_list.c:isl_basic_map_list_grow
Line
Count
Source
98
14.2k
{
99
14.2k
  isl_ctx *ctx;
100
14.2k
  int i, new_size;
101
14.2k
  LIST(EL) *res;
102
14.2k
103
14.2k
  if (!list)
104
0
    return NULL;
105
14.2k
  
if (14.2k
list->ref == 1 && 14.2k
list->n + n <= list->size14.2k
)
106
14.2k
    return list;
107
14.2k
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_id.c:isl_id_list_grow
Line
Count
Source
98
1.98k
{
99
1.98k
  isl_ctx *ctx;
100
1.98k
  int i, new_size;
101
1.98k
  LIST(EL) *res;
102
1.98k
103
1.98k
  if (!list)
104
0
    return NULL;
105
1.98k
  
if (1.98k
list->ref == 1 && 1.98k
list->n + n <= list->size1.98k
)
106
1.98k
    return list;
107
1.98k
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_constraint.c:isl_constraint_list_grow
Line
Count
Source
98
3.34k
{
99
3.34k
  isl_ctx *ctx;
100
3.34k
  int i, new_size;
101
3.34k
  LIST(EL) *res;
102
3.34k
103
3.34k
  if (!list)
104
0
    return NULL;
105
3.34k
  
if (3.34k
list->ref == 1 && 3.34k
list->n + n <= list->size3.34k
)
106
3.34k
    return list;
107
3.34k
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_band.c:isl_band_list_grow
Line
Count
Source
98
18
{
99
18
  isl_ctx *ctx;
100
18
  int i, new_size;
101
18
  LIST(EL) *res;
102
18
103
18
  if (!list)
104
0
    return NULL;
105
18
  
if (18
list->ref == 1 && 18
list->n + n <= list->size18
)
106
18
    return list;
107
18
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_ast_graft.c:isl_ast_graft_list_grow
Line
Count
Source
98
11.8k
{
99
11.8k
  isl_ctx *ctx;
100
11.8k
  int i, new_size;
101
11.8k
  LIST(EL) *res;
102
11.8k
103
11.8k
  if (!list)
104
0
    return NULL;
105
11.8k
  
if (11.8k
list->ref == 1 && 11.8k
list->n + n <= list->size11.8k
)
106
11.8k
    return list;
107
11.8k
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_ast.c:isl_ast_node_list_grow
Line
Count
Source
98
3.45k
{
99
3.45k
  isl_ctx *ctx;
100
3.45k
  int i, new_size;
101
3.45k
  LIST(EL) *res;
102
3.45k
103
3.45k
  if (!list)
104
0
    return NULL;
105
3.45k
  
if (3.45k
list->ref == 1 && 3.45k
list->n + n <= list->size3.45k
)
106
3.43k
    return list;
107
3.45k
108
25
  
ctx = 25
FN25
(LIST(EL),get_ctx)(list);
109
25
  new_size = ((list->n + n + 1) * 3) / 2;
110
25
  if (
list->ref == 125
)
{25
111
25
    res = isl_realloc(ctx, list, LIST(EL),
112
25
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
25
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
25
    res->size = new_size;
116
25
    return res;
117
25
  }
118
25
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_grow
isl_aff.c:isl_union_pw_multi_aff_list_grow
Line
Count
Source
98
7
{
99
7
  isl_ctx *ctx;
100
7
  int i, new_size;
101
7
  LIST(EL) *res;
102
7
103
7
  if (!list)
104
0
    return NULL;
105
7
  
if (7
list->ref == 1 && 7
list->n + n <= list->size7
)
106
7
    return list;
107
7
108
0
  
ctx = 0
FN0
(LIST(EL),get_ctx)(list);
109
0
  new_size = ((list->n + n + 1) * 3) / 2;
110
0
  if (
list->ref == 10
)
{0
111
0
    res = isl_realloc(ctx, list, LIST(EL),
112
0
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
0
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
0
    res->size = new_size;
116
0
    return res;
117
0
  }
118
0
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_aff.c:isl_union_pw_aff_list_grow
Line
Count
Source
98
27
{
99
27
  isl_ctx *ctx;
100
27
  int i, new_size;
101
27
  LIST(EL) *res;
102
27
103
27
  if (!list)
104
0
    return NULL;
105
27
  
if (27
list->ref == 1 && 27
list->n + n <= list->size27
)
106
12
    return list;
107
27
108
15
  
ctx = 15
FN15
(LIST(EL),get_ctx)(list);
109
15
  new_size = ((list->n + n + 1) * 3) / 2;
110
15
  if (
list->ref == 115
)
{15
111
15
    res = isl_realloc(ctx, list, LIST(EL),
112
15
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
15
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
15
    res->size = new_size;
116
15
    return res;
117
15
  }
118
15
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
isl_aff.c:isl_pw_aff_list_grow
Line
Count
Source
98
15.8k
{
99
15.8k
  isl_ctx *ctx;
100
15.8k
  int i, new_size;
101
15.8k
  LIST(EL) *res;
102
15.8k
103
15.8k
  if (!list)
104
0
    return NULL;
105
15.8k
  
if (15.8k
list->ref == 1 && 15.8k
list->n + n <= list->size15.8k
)
106
11.9k
    return list;
107
15.8k
108
3.95k
  
ctx = 3.95k
FN3.95k
(LIST(EL),get_ctx)(list);
109
3.95k
  new_size = ((list->n + n + 1) * 3) / 2;
110
3.95k
  if (
list->ref == 13.95k
)
{3.95k
111
3.95k
    res = isl_realloc(ctx, list, LIST(EL),
112
3.95k
          sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
113
3.95k
    if (!res)
114
0
      
return 0
FN0
(LIST(EL),free)(list);
115
3.95k
    res->size = new_size;
116
3.95k
    return res;
117
3.95k
  }
118
3.95k
119
0
  
if (0
list->n + n <= list->size && 0
list->size < new_size0
)
120
0
    new_size = list->size;
121
0
122
0
  res = FN(LIST(EL),alloc)(ctx, new_size);
123
0
  if (!res)
124
0
    
return 0
FN0
(LIST(EL),free)(list);
125
0
126
0
  
for (i = 0; 0
i < list->n0
;
++i0
)
127
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
128
0
129
0
  FN(LIST(EL),free)(list);
130
0
  return res;
131
0
}
132
133
__isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
134
  __isl_take struct EL *el)
135
265k
{
136
265k
  list = FN(LIST(EL),grow)(list, 1);
137
265k
  if (
!list || 265k
!el265k
)
138
0
    goto error;
139
265k
  list->p[list->n] = el;
140
265k
  list->n++;
141
265k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
265k
}
isl_constraint_list_add
Line
Count
Source
135
3.34k
{
136
3.34k
  list = FN(LIST(EL),grow)(list, 1);
137
3.34k
  if (
!list || 3.34k
!el3.34k
)
138
0
    goto error;
139
3.34k
  list->p[list->n] = el;
140
3.34k
  list->n++;
141
3.34k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
3.34k
}
isl_aff_list_add
Line
Count
Source
135
5.17k
{
136
5.17k
  list = FN(LIST(EL),grow)(list, 1);
137
5.17k
  if (
!list || 5.17k
!el5.17k
)
138
0
    goto error;
139
5.17k
  list->p[list->n] = el;
140
5.17k
  list->n++;
141
5.17k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
5.17k
}
isl_pw_aff_list_add
Line
Count
Source
135
15.8k
{
136
15.8k
  list = FN(LIST(EL),grow)(list, 1);
137
15.8k
  if (
!list || 15.8k
!el15.8k
)
138
0
    goto error;
139
15.8k
  list->p[list->n] = el;
140
15.8k
  list->n++;
141
15.8k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
15.8k
}
isl_union_pw_aff_list_add
Line
Count
Source
135
27
{
136
27
  list = FN(LIST(EL),grow)(list, 1);
137
27
  if (
!list || 27
!el27
)
138
0
    goto error;
139
27
  list->p[list->n] = el;
140
27
  list->n++;
141
27
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
27
}
isl_union_pw_multi_aff_list_add
Line
Count
Source
135
7
{
136
7
  list = FN(LIST(EL),grow)(list, 1);
137
7
  if (
!list || 7
!el7
)
138
0
    goto error;
139
7
  list->p[list->n] = el;
140
7
  list->n++;
141
7
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
7
}
Unexecuted instantiation: isl_ast_expr_list_add
isl_ast_node_list_add
Line
Count
Source
135
3.45k
{
136
3.45k
  list = FN(LIST(EL),grow)(list, 1);
137
3.45k
  if (
!list || 3.45k
!el3.45k
)
138
0
    goto error;
139
3.45k
  list->p[list->n] = el;
140
3.45k
  list->n++;
141
3.45k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
3.45k
}
isl_ast_graft_list_add
Line
Count
Source
135
11.8k
{
136
11.8k
  list = FN(LIST(EL),grow)(list, 1);
137
11.8k
  if (
!list || 11.8k
!el11.8k
)
138
0
    goto error;
139
11.8k
  list->p[list->n] = el;
140
11.8k
  list->n++;
141
11.8k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
11.8k
}
isl_band_list_add
Line
Count
Source
135
18
{
136
18
  list = FN(LIST(EL),grow)(list, 1);
137
18
  if (
!list || 18
!el18
)
138
0
    goto error;
139
18
  list->p[list->n] = el;
140
18
  list->n++;
141
18
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
18
}
isl_id_list_add
Line
Count
Source
135
1.98k
{
136
1.98k
  list = FN(LIST(EL),grow)(list, 1);
137
1.98k
  if (
!list || 1.98k
!el1.98k
)
138
0
    goto error;
139
1.98k
  list->p[list->n] = el;
140
1.98k
  list->n++;
141
1.98k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
1.98k
}
isl_basic_map_list_add
Line
Count
Source
135
14.2k
{
136
14.2k
  list = FN(LIST(EL),grow)(list, 1);
137
14.2k
  if (
!list || 14.2k
!el14.2k
)
138
0
    goto error;
139
14.2k
  list->p[list->n] = el;
140
14.2k
  list->n++;
141
14.2k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
14.2k
}
isl_map_list_add
Line
Count
Source
135
792
{
136
792
  list = FN(LIST(EL),grow)(list, 1);
137
792
  if (
!list || 792
!el792
)
138
0
    goto error;
139
792
  list->p[list->n] = el;
140
792
  list->n++;
141
792
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
792
}
isl_union_map_list_add
Line
Count
Source
135
5
{
136
5
  list = FN(LIST(EL),grow)(list, 1);
137
5
  if (
!list || 5
!el5
)
138
0
    goto error;
139
5
  list->p[list->n] = el;
140
5
  list->n++;
141
5
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
5
}
isl_schedule_tree_list_add
Line
Count
Source
135
197k
{
136
197k
  list = FN(LIST(EL),grow)(list, 1);
137
197k
  if (
!list || 197k
!el197k
)
138
0
    goto error;
139
197k
  list->p[list->n] = el;
140
197k
  list->n++;
141
197k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
197k
}
isl_basic_set_list_add
Line
Count
Source
135
2.31k
{
136
2.31k
  list = FN(LIST(EL),grow)(list, 1);
137
2.31k
  if (
!list || 2.31k
!el2.31k
)
138
0
    goto error;
139
2.31k
  list->p[list->n] = el;
140
2.31k
  list->n++;
141
2.31k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
2.31k
}
isl_set_list_add
Line
Count
Source
135
7.13k
{
136
7.13k
  list = FN(LIST(EL),grow)(list, 1);
137
7.13k
  if (
!list || 7.13k
!el7.13k
)
138
0
    goto error;
139
7.13k
  list->p[list->n] = el;
140
7.13k
  list->n++;
141
7.13k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
7.13k
}
isl_union_set_list_add
Line
Count
Source
135
1.48k
{
136
1.48k
  list = FN(LIST(EL),grow)(list, 1);
137
1.48k
  if (
!list || 1.48k
!el1.48k
)
138
0
    goto error;
139
1.48k
  list->p[list->n] = el;
140
1.48k
  list->n++;
141
1.48k
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
1.48k
}
isl_val_list_add
Line
Count
Source
135
21
{
136
21
  list = FN(LIST(EL),grow)(list, 1);
137
21
  if (
!list || 21
!el21
)
138
0
    goto error;
139
21
  list->p[list->n] = el;
140
21
  list->n++;
141
21
  return list;
142
0
error:
143
0
  FN(EL,free)(el);
144
0
  FN(LIST(EL),free)(list);
145
0
  return NULL;
146
21
}
147
148
/* Remove the "n" elements starting at "first" from "list".
149
 */
150
__isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list,
151
  unsigned first, unsigned n)
152
53.7k
{
153
53.7k
  int i;
154
53.7k
155
53.7k
  if (!list)
156
0
    return NULL;
157
53.7k
  
if (53.7k
first + n > list->n || 53.7k
first + n < first53.7k
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
53.7k
      "index out of bounds", return FN(LIST(EL),free)(list));
160
53.7k
  
if (53.7k
n == 053.7k
)
161
594
    return list;
162
53.1k
  
list = 53.1k
FN53.1k
(LIST(EL),cow)(list);
163
53.1k
  if (!list)
164
0
    return NULL;
165
163k
  
for (i = 0; 53.1k
i < n163k
;
++i110k
)
166
110k
    
FN110k
(EL,free)(list->p[first + i])110k
;
167
54.6k
  for (i = first; 
i + n < list->n54.6k
;
++i1.54k
)
168
1.54k
    list->p[i] = list->p[i + n];
169
53.1k
  list->n -= n;
170
53.1k
  return list;
171
53.1k
}
Unexecuted instantiation: isl_aff_list_drop
Unexecuted instantiation: isl_pw_aff_list_drop
Unexecuted instantiation: isl_union_pw_aff_list_drop
Unexecuted instantiation: isl_union_pw_multi_aff_list_drop
Unexecuted instantiation: isl_ast_expr_list_drop
Unexecuted instantiation: isl_ast_node_list_drop
Unexecuted instantiation: isl_ast_graft_list_drop
Unexecuted instantiation: isl_band_list_drop
isl_constraint_list_drop
Line
Count
Source
152
1.91k
{
153
1.91k
  int i;
154
1.91k
155
1.91k
  if (!list)
156
0
    return NULL;
157
1.91k
  
if (1.91k
first + n > list->n || 1.91k
first + n < first1.91k
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
1.91k
      "index out of bounds", return FN(LIST(EL),free)(list));
160
1.91k
  
if (1.91k
n == 01.91k
)
161
594
    return list;
162
1.31k
  
list = 1.31k
FN1.31k
(LIST(EL),cow)(list);
163
1.31k
  if (!list)
164
0
    return NULL;
165
2.70k
  
for (i = 0; 1.31k
i < n2.70k
;
++i1.38k
)
166
1.38k
    
FN1.38k
(EL,free)(list->p[first + i])1.38k
;
167
2.09k
  for (i = first; 
i + n < list->n2.09k
;
++i780
)
168
780
    list->p[i] = list->p[i + n];
169
1.31k
  list->n -= n;
170
1.31k
  return list;
171
1.31k
}
isl_id_list_drop
Line
Count
Source
152
1
{
153
1
  int i;
154
1
155
1
  if (!list)
156
0
    return NULL;
157
1
  
if (1
first + n > list->n || 1
first + n < first1
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
1
      "index out of bounds", return FN(LIST(EL),free)(list));
160
1
  
if (1
n == 01
)
161
0
    return list;
162
1
  
list = 1
FN1
(LIST(EL),cow)(list);
163
1
  if (!list)
164
0
    return NULL;
165
2
  
for (i = 0; 1
i < n2
;
++i1
)
166
1
    
FN1
(EL,free)(list->p[first + i])1
;
167
3
  for (i = first; 
i + n < list->n3
;
++i2
)
168
2
    list->p[i] = list->p[i + n];
169
1
  list->n -= n;
170
1
  return list;
171
1
}
Unexecuted instantiation: isl_basic_map_list_drop
Unexecuted instantiation: isl_map_list_drop
isl_union_map_list_drop
Line
Count
Source
152
4
{
153
4
  int i;
154
4
155
4
  if (!list)
156
0
    return NULL;
157
4
  
if (4
first + n > list->n || 4
first + n < first4
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
4
      "index out of bounds", return FN(LIST(EL),free)(list));
160
4
  
if (4
n == 04
)
161
0
    return list;
162
4
  
list = 4
FN4
(LIST(EL),cow)(list);
163
4
  if (!list)
164
0
    return NULL;
165
8
  
for (i = 0; 4
i < n8
;
++i4
)
166
4
    
FN4
(EL,free)(list->p[first + i])4
;
167
4
  for (i = first; 
i + n < list->n4
;
++i0
)
168
0
    list->p[i] = list->p[i + n];
169
4
  list->n -= n;
170
4
  return list;
171
4
}
isl_schedule_tree_list_drop
Line
Count
Source
152
50.7k
{
153
50.7k
  int i;
154
50.7k
155
50.7k
  if (!list)
156
0
    return NULL;
157
50.7k
  
if (50.7k
first + n > list->n || 50.7k
first + n < first50.7k
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
50.7k
      "index out of bounds", return FN(LIST(EL),free)(list));
160
50.7k
  
if (50.7k
n == 050.7k
)
161
0
    return list;
162
50.7k
  
list = 50.7k
FN50.7k
(LIST(EL),cow)(list);
163
50.7k
  if (!list)
164
0
    return NULL;
165
158k
  
for (i = 0; 50.7k
i < n158k
;
++i107k
)
166
107k
    
FN107k
(EL,free)(list->p[first + i])107k
;
167
51.5k
  for (i = first; 
i + n < list->n51.5k
;
++i760
)
168
760
    list->p[i] = list->p[i + n];
169
50.7k
  list->n -= n;
170
50.7k
  return list;
171
50.7k
}
isl_basic_set_list_drop
Line
Count
Source
152
4
{
153
4
  int i;
154
4
155
4
  if (!list)
156
0
    return NULL;
157
4
  
if (4
first + n > list->n || 4
first + n < first4
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
4
      "index out of bounds", return FN(LIST(EL),free)(list));
160
4
  
if (4
n == 04
)
161
0
    return list;
162
4
  
list = 4
FN4
(LIST(EL),cow)(list);
163
4
  if (!list)
164
0
    return NULL;
165
12
  
for (i = 0; 4
i < n12
;
++i8
)
166
8
    
FN8
(EL,free)(list->p[first + i])8
;
167
4
  for (i = first; 
i + n < list->n4
;
++i0
)
168
0
    list->p[i] = list->p[i + n];
169
4
  list->n -= n;
170
4
  return list;
171
4
}
Unexecuted instantiation: isl_set_list_drop
isl_union_set_list_drop
Line
Count
Source
152
1.00k
{
153
1.00k
  int i;
154
1.00k
155
1.00k
  if (!list)
156
0
    return NULL;
157
1.00k
  
if (1.00k
first + n > list->n || 1.00k
first + n < first1.00k
)
158
0
    isl_die(list->ctx, isl_error_invalid,
159
1.00k
      "index out of bounds", return FN(LIST(EL),free)(list));
160
1.00k
  
if (1.00k
n == 01.00k
)
161
0
    return list;
162
1.00k
  
list = 1.00k
FN1.00k
(LIST(EL),cow)(list);
163
1.00k
  if (!list)
164
0
    return NULL;
165
2.01k
  
for (i = 0; 1.00k
i < n2.01k
;
++i1.00k
)
166
1.00k
    
FN1.00k
(EL,free)(list->p[first + i])1.00k
;
167
1.00k
  for (i = first; 
i + n < list->n1.00k
;
++i0
)
168
0
    list->p[i] = list->p[i + n];
169
1.00k
  list->n -= n;
170
1.00k
  return list;
171
1.00k
}
Unexecuted instantiation: isl_val_list_drop
172
173
/* Insert "el" at position "pos" in "list".
174
 *
175
 * If there is only one reference to "list" and if it already has space
176
 * for one extra element, we insert it directly into "list".
177
 * Otherwise, we create a new list consisting of "el" and copied
178
 * elements from "list".
179
 */
180
__isl_give LIST(EL) *FN(LIST(EL),insert)(__isl_take LIST(EL) *list,
181
  unsigned pos, __isl_take struct EL *el)
182
19
{
183
19
  int i;
184
19
  isl_ctx *ctx;
185
19
  LIST(EL) *res;
186
19
187
19
  if (
!list || 19
!el19
)
188
0
    goto error;
189
19
  
ctx = 19
FN19
(LIST(EL),get_ctx)(list);
190
19
  if (pos > list->n)
191
0
    isl_die(ctx, isl_error_invalid,
192
19
      "index out of bounds", goto error);
193
19
194
19
  
if (19
list->ref == 1 && 19
list->size > list->n16
)
{1
195
2
    for (i = list->n; 
i > pos2
;
--i1
)
196
1
      list->p[i] = list->p[i - 1];
197
1
    list->n++;
198
1
    list->p[pos] = el;
199
1
    return list;
200
1
  }
201
19
202
18
  
res = 18
FN18
(LIST(EL),alloc)(ctx, list->n + 1);
203
41
  for (i = 0; 
i < pos41
;
++i23
)
204
23
    
res = 23
FN23
(LIST(EL),add)(res,
FN23
(EL,copy)(list->p[i]));
205
18
  res = FN(LIST(EL),add)(res, el);
206
21
  for (i = pos; 
i < list->n21
;
++i3
)
207
3
    
res = 3
FN3
(LIST(EL),add)(res,
FN3
(EL,copy)(list->p[i]));
208
18
  FN(LIST(EL),free)(list);
209
18
210
18
  return res;
211
0
error:
212
0
  FN(EL,free)(el);
213
0
  FN(LIST(EL),free)(list);
214
0
  return NULL;
215
19
}
Unexecuted instantiation: isl_pw_aff_list_insert
Unexecuted instantiation: isl_val_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
182
15
{
183
15
  int i;
184
15
  isl_ctx *ctx;
185
15
  LIST(EL) *res;
186
15
187
15
  if (
!list || 15
!el15
)
188
0
    goto error;
189
15
  
ctx = 15
FN15
(LIST(EL),get_ctx)(list);
190
15
  if (pos > list->n)
191
0
    isl_die(ctx, isl_error_invalid,
192
15
      "index out of bounds", goto error);
193
15
194
15
  
if (15
list->ref == 1 && 15
list->size > list->n15
)
{0
195
0
    for (i = list->n; 
i > pos0
;
--i0
)
196
0
      list->p[i] = list->p[i - 1];
197
0
    list->n++;
198
0
    list->p[pos] = el;
199
0
    return list;
200
0
  }
201
15
202
15
  
res = 15
FN15
(LIST(EL),alloc)(ctx, list->n + 1);
203
35
  for (i = 0; 
i < pos35
;
++i20
)
204
20
    
res = 20
FN20
(LIST(EL),add)(res,
FN20
(EL,copy)(list->p[i]));
205
15
  res = FN(LIST(EL),add)(res, el);
206
18
  for (i = pos; 
i < list->n18
;
++i3
)
207
3
    
res = 3
FN3
(LIST(EL),add)(res,
FN3
(EL,copy)(list->p[i]));
208
15
  FN(LIST(EL),free)(list);
209
15
210
15
  return res;
211
0
error:
212
0
  FN(EL,free)(el);
213
0
  FN(LIST(EL),free)(list);
214
0
  return NULL;
215
15
}
Unexecuted instantiation: isl_band_list_insert
Unexecuted instantiation: isl_aff_list_insert
Unexecuted instantiation: isl_constraint_list_insert
isl_id_list_insert
Line
Count
Source
182
4
{
183
4
  int i;
184
4
  isl_ctx *ctx;
185
4
  LIST(EL) *res;
186
4
187
4
  if (
!list || 4
!el4
)
188
0
    goto error;
189
4
  
ctx = 4
FN4
(LIST(EL),get_ctx)(list);
190
4
  if (pos > list->n)
191
0
    isl_die(ctx, isl_error_invalid,
192
4
      "index out of bounds", goto error);
193
4
194
4
  
if (4
list->ref == 1 && 4
list->size > list->n1
)
{1
195
2
    for (i = list->n; 
i > pos2
;
--i1
)
196
1
      list->p[i] = list->p[i - 1];
197
1
    list->n++;
198
1
    list->p[pos] = el;
199
1
    return list;
200
1
  }
201
4
202
3
  
res = 3
FN3
(LIST(EL),alloc)(ctx, list->n + 1);
203
6
  for (i = 0; 
i < pos6
;
++i3
)
204
3
    
res = 3
FN3
(LIST(EL),add)(res,
FN3
(EL,copy)(list->p[i]));
205
3
  res = FN(LIST(EL),add)(res, el);
206
3
  for (i = pos; 
i < list->n3
;
++i0
)
207
0
    
res = 0
FN0
(LIST(EL),add)(res,
FN0
(EL,copy)(list->p[i]));
208
3
  FN(LIST(EL),free)(list);
209
3
210
3
  return res;
211
0
error:
212
0
  FN(EL,free)(el);
213
0
  FN(LIST(EL),free)(list);
214
0
  return NULL;
215
4
}
Unexecuted instantiation: isl_basic_map_list_insert
Unexecuted instantiation: isl_map_list_insert
Unexecuted instantiation: isl_union_map_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
216
217
__isl_null LIST(EL) *FN(LIST(EL),free)(__isl_take LIST(EL) *list)
218
176k
{
219
176k
  int i;
220
176k
221
176k
  if (!list)
222
27.8k
    return NULL;
223
176k
224
148k
  
if (148k
--list->ref > 0148k
)
225
39.9k
    return NULL;
226
148k
227
108k
  isl_ctx_deref(list->ctx);
228
263k
  for (i = 0; 
i < list->n263k
;
++i154k
)
229
154k
    
FN154k
(EL,free)(list->p[i])154k
;
230
108k
  free(list);
231
108k
232
108k
  return NULL;
233
148k
}
isl_val_list_free
Line
Count
Source
218
11
{
219
11
  int i;
220
11
221
11
  if (!list)
222
0
    return NULL;
223
11
224
11
  
if (11
--list->ref > 011
)
225
0
    return NULL;
226
11
227
11
  isl_ctx_deref(list->ctx);
228
32
  for (i = 0; 
i < list->n32
;
++i21
)
229
21
    
FN21
(EL,free)(list->p[i])21
;
230
11
  free(list);
231
11
232
11
  return NULL;
233
11
}
isl_aff_list_free
Line
Count
Source
218
10.1k
{
219
10.1k
  int i;
220
10.1k
221
10.1k
  if (!list)
222
4.95k
    return NULL;
223
10.1k
224
5.17k
  
if (5.17k
--list->ref > 05.17k
)
225
0
    return NULL;
226
5.17k
227
5.17k
  isl_ctx_deref(list->ctx);
228
10.3k
  for (i = 0; 
i < list->n10.3k
;
++i5.17k
)
229
5.17k
    
FN5.17k
(EL,free)(list->p[i])5.17k
;
230
5.17k
  free(list);
231
5.17k
232
5.17k
  return NULL;
233
5.17k
}
isl_pw_aff_list_free
Line
Count
Source
218
23.6k
{
219
23.6k
  int i;
220
23.6k
221
23.6k
  if (!list)
222
0
    return NULL;
223
23.6k
224
23.6k
  
if (23.6k
--list->ref > 023.6k
)
225
9.89k
    return NULL;
226
23.6k
227
13.7k
  isl_ctx_deref(list->ctx);
228
29.6k
  for (i = 0; 
i < list->n29.6k
;
++i15.8k
)
229
15.8k
    
FN15.8k
(EL,free)(list->p[i])15.8k
;
230
13.7k
  free(list);
231
13.7k
232
13.7k
  return NULL;
233
23.6k
}
isl_union_pw_aff_list_free
Line
Count
Source
218
15
{
219
15
  int i;
220
15
221
15
  if (!list)
222
0
    return NULL;
223
15
224
15
  
if (15
--list->ref > 015
)
225
0
    return NULL;
226
15
227
15
  isl_ctx_deref(list->ctx);
228
42
  for (i = 0; 
i < list->n42
;
++i27
)
229
27
    
FN27
(EL,free)(list->p[i])27
;
230
15
  free(list);
231
15
232
15
  return NULL;
233
15
}
isl_union_pw_multi_aff_list_free
Line
Count
Source
218
7
{
219
7
  int i;
220
7
221
7
  if (!list)
222
0
    return NULL;
223
7
224
7
  
if (7
--list->ref > 07
)
225
0
    return NULL;
226
7
227
7
  isl_ctx_deref(list->ctx);
228
14
  for (i = 0; 
i < list->n14
;
++i7
)
229
7
    
FN7
(EL,free)(list->p[i])7
;
230
7
  free(list);
231
7
232
7
  return NULL;
233
7
}
Unexecuted instantiation: isl_ast_expr_list_free
isl_ast_node_list_free
Line
Count
Source
218
2.79k
{
219
2.79k
  int i;
220
2.79k
221
2.79k
  if (!list)
222
0
    return NULL;
223
2.79k
224
2.79k
  
if (2.79k
--list->ref > 02.79k
)
225
166
    return NULL;
226
2.79k
227
2.63k
  isl_ctx_deref(list->ctx);
228
6.08k
  for (i = 0; 
i < list->n6.08k
;
++i3.45k
)
229
3.45k
    
FN3.45k
(EL,free)(list->p[i])3.45k
;
230
2.63k
  free(list);
231
2.63k
232
2.63k
  return NULL;
233
2.79k
}
isl_ast_graft_list_free
Line
Count
Source
218
12.0k
{
219
12.0k
  int i;
220
12.0k
221
12.0k
  if (!list)
222
0
    return NULL;
223
12.0k
224
12.0k
  
if (12.0k
--list->ref > 012.0k
)
225
0
    return NULL;
226
12.0k
227
12.0k
  isl_ctx_deref(list->ctx);
228
23.9k
  for (i = 0; 
i < list->n23.9k
;
++i11.8k
)
229
11.8k
    
FN11.8k
(EL,free)(list->p[i])11.8k
;
230
12.0k
  free(list);
231
12.0k
232
12.0k
  return NULL;
233
12.0k
}
isl_band_list_free
Line
Count
Source
218
4.76k
{
219
4.76k
  int i;
220
4.76k
221
4.76k
  if (!list)
222
4.75k
    return NULL;
223
4.76k
224
16
  
if (16
--list->ref > 016
)
225
0
    return NULL;
226
16
227
16
  isl_ctx_deref(list->ctx);
228
34
  for (i = 0; 
i < list->n34
;
++i18
)
229
18
    
FN18
(EL,free)(list->p[i])18
;
230
16
  free(list);
231
16
232
16
  return NULL;
233
16
}
isl_constraint_list_free
Line
Count
Source
218
2.12k
{
219
2.12k
  int i;
220
2.12k
221
2.12k
  if (!list)
222
0
    return NULL;
223
2.12k
224
2.12k
  
if (2.12k
--list->ref > 02.12k
)
225
0
    return NULL;
226
2.12k
227
2.12k
  isl_ctx_deref(list->ctx);
228
4.07k
  for (i = 0; 
i < list->n4.07k
;
++i1.95k
)
229
1.95k
    
FN1.95k
(EL,free)(list->p[i])1.95k
;
230
2.12k
  free(list);
231
2.12k
232
2.12k
  return NULL;
233
2.12k
}
isl_id_list_free
Line
Count
Source
218
22.5k
{
219
22.5k
  int i;
220
22.5k
221
22.5k
  if (!list)
222
0
    return NULL;
223
22.5k
224
22.5k
  
if (22.5k
--list->ref > 022.5k
)
225
20.8k
    return NULL;
226
22.5k
227
1.67k
  isl_ctx_deref(list->ctx);
228
3.66k
  for (i = 0; 
i < list->n3.66k
;
++i1.98k
)
229
1.98k
    
FN1.98k
(EL,free)(list->p[i])1.98k
;
230
1.67k
  free(list);
231
1.67k
232
1.67k
  return NULL;
233
22.5k
}
isl_basic_map_list_free
Line
Count
Source
218
2.00k
{
219
2.00k
  int i;
220
2.00k
221
2.00k
  if (!list)
222
0
    return NULL;
223
2.00k
224
2.00k
  
if (2.00k
--list->ref > 02.00k
)
225
0
    return NULL;
226
2.00k
227
2.00k
  isl_ctx_deref(list->ctx);
228
13.9k
  for (i = 0; 
i < list->n13.9k
;
++i11.9k
)
229
11.9k
    
FN11.9k
(EL,free)(list->p[i])11.9k
;
230
2.00k
  free(list);
231
2.00k
232
2.00k
  return NULL;
233
2.00k
}
isl_map_list_free
Line
Count
Source
218
439
{
219
439
  int i;
220
439
221
439
  if (!list)
222
0
    return NULL;
223
439
224
439
  
if (439
--list->ref > 0439
)
225
0
    return NULL;
226
439
227
439
  isl_ctx_deref(list->ctx);
228
1.47k
  for (i = 0; 
i < list->n1.47k
;
++i1.03k
)
229
1.03k
    
FN1.03k
(EL,free)(list->p[i])1.03k
;
230
439
  free(list);
231
439
232
439
  return NULL;
233
439
}
isl_union_map_list_free
Line
Count
Source
218
1
{
219
1
  int i;
220
1
221
1
  if (!list)
222
0
    return NULL;
223
1
224
1
  
if (1
--list->ref > 01
)
225
0
    return NULL;
226
1
227
1
  isl_ctx_deref(list->ctx);
228
2
  for (i = 0; 
i < list->n2
;
++i1
)
229
1
    
FN1
(EL,free)(list->p[i])1
;
230
1
  free(list);
231
1
232
1
  return NULL;
233
1
}
isl_schedule_tree_list_free
Line
Count
Source
218
81.4k
{
219
81.4k
  int i;
220
81.4k
221
81.4k
  if (!list)
222
13.1k
    return NULL;
223
81.4k
224
68.2k
  
if (68.2k
--list->ref > 068.2k
)
225
9.03k
    return NULL;
226
68.2k
227
59.1k
  isl_ctx_deref(list->ctx);
228
148k
  for (i = 0; 
i < list->n148k
;
++i89.4k
)
229
89.4k
    
FN89.4k
(EL,free)(list->p[i])89.4k
;
230
59.1k
  free(list);
231
59.1k
232
59.1k
  return NULL;
233
68.2k
}
isl_basic_set_list_free
Line
Count
Source
218
2.65k
{
219
2.65k
  int i;
220
2.65k
221
2.65k
  if (!list)
222
0
    return NULL;
223
2.65k
224
2.65k
  
if (2.65k
--list->ref > 02.65k
)
225
13
    return NULL;
226
2.65k
227
2.63k
  isl_ctx_deref(list->ctx);
228
7.20k
  for (i = 0; 
i < list->n7.20k
;
++i4.56k
)
229
4.56k
    
FN4.56k
(EL,free)(list->p[i])4.56k
;
230
2.63k
  free(list);
231
2.63k
232
2.63k
  return NULL;
233
2.65k
}
isl_set_list_free
Line
Count
Source
218
11.2k
{
219
11.2k
  int i;
220
11.2k
221
11.2k
  if (!list)
222
4.95k
    return NULL;
223
11.2k
224
6.30k
  
if (6.30k
--list->ref > 06.30k
)
225
0
    return NULL;
226
6.30k
227
6.30k
  isl_ctx_deref(list->ctx);
228
13.1k
  for (i = 0; 
i < list->n13.1k
;
++i6.89k
)
229
6.89k
    
FN6.89k
(EL,free)(list->p[i])6.89k
;
230
6.30k
  free(list);
231
6.30k
232
6.30k
  return NULL;
233
6.30k
}
isl_union_set_list_free
Line
Count
Source
218
396
{
219
396
  int i;
220
396
221
396
  if (!list)
222
0
    return NULL;
223
396
224
396
  
if (396
--list->ref > 0396
)
225
0
    return NULL;
226
396
227
396
  isl_ctx_deref(list->ctx);
228
879
  for (i = 0; 
i < list->n879
;
++i483
)
229
483
    
FN483
(EL,free)(list->p[i])483
;
230
396
  free(list);
231
396
232
396
  return NULL;
233
396
}
234
235
int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
236
715k
{
237
705k
  return list ? 
list->n705k
:
010.5k
;
238
715k
}
isl_val_list_n_val
Line
Count
Source
236
11
{
237
11
  return list ? 
list->n11
:
00
;
238
11
}
isl_union_set_list_n_union_set
Line
Count
Source
236
2.05k
{
237
2.05k
  return list ? 
list->n2.05k
:
00
;
238
2.05k
}
isl_set_list_n_set
Line
Count
Source
236
4.98k
{
237
4.98k
  return list ? 
list->n4.98k
:
00
;
238
4.98k
}
isl_basic_set_list_n_basic_set
Line
Count
Source
236
4.23k
{
237
4.23k
  return list ? 
list->n4.23k
:
00
;
238
4.23k
}
isl_schedule_tree_list_n_schedule_tree
Line
Count
Source
236
664k
{
237
654k
  return list ? 
list->n654k
:
010.5k
;
238
664k
}
isl_union_map_list_n_union_map
Line
Count
Source
236
13
{
237
13
  return list ? 
list->n13
:
00
;
238
13
}
isl_map_list_n_map
Line
Count
Source
236
429
{
237
429
  return list ? 
list->n429
:
00
;
238
429
}
isl_basic_map_list_n_basic_map
Line
Count
Source
236
1.71k
{
237
1.71k
  return list ? 
list->n1.71k
:
00
;
238
1.71k
}
isl_id_list_n_id
Line
Count
Source
236
974
{
237
974
  return list ? 
list->n974
:
00
;
238
974
}
isl_constraint_list_n_constraint
Line
Count
Source
236
3.39k
{
237
3.39k
  return list ? 
list->n3.39k
:
00
;
238
3.39k
}
isl_band_list_n_band
Line
Count
Source
236
4
{
237
4
  return list ? 
list->n4
:
00
;
238
4
}
isl_ast_graft_list_n_ast_graft
Line
Count
Source
236
15.9k
{
237
15.9k
  return list ? 
list->n15.9k
:
00
;
238
15.9k
}
isl_ast_node_list_n_ast_node
Line
Count
Source
236
2.90k
{
237
2.90k
  return list ? 
list->n2.90k
:
00
;
238
2.90k
}
Unexecuted instantiation: isl_ast_expr_list_n_ast_expr
isl_union_pw_multi_aff_list_n_union_pw_multi_aff
Line
Count
Source
236
7
{
237
7
  return list ? 
list->n7
:
00
;
238
7
}
isl_union_pw_aff_list_n_union_pw_aff
Line
Count
Source
236
15
{
237
15
  return list ? 
list->n15
:
00
;
238
15
}
isl_pw_aff_list_n_pw_aff
Line
Count
Source
236
14.0k
{
237
14.0k
  return list ? 
list->n14.0k
:
00
;
238
14.0k
}
isl_aff_list_n_aff
Line
Count
Source
236
361
{
237
361
  return list ? 
list->n361
:
00
;
238
361
}
239
240
__isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
241
447k
{
242
447k
  if (!list)
243
0
    return NULL;
244
447k
  
if (447k
index < 0 || 447k
index >= list->n447k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
447k
      "index out of bounds", return NULL);
247
447k
  
return 447k
FN447k
(EL,copy)(list->p[index]);
248
447k
}
isl_union_set_list_get_union_set
Line
Count
Source
241
2.14k
{
242
2.14k
  if (!list)
243
0
    return NULL;
244
2.14k
  
if (2.14k
index < 0 || 2.14k
index >= list->n2.14k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
2.14k
      "index out of bounds", return NULL);
247
2.14k
  
return 2.14k
FN2.14k
(EL,copy)(list->p[index]);
248
2.14k
}
isl_id_list_get_id
Line
Count
Source
241
11.0k
{
242
11.0k
  if (!list)
243
0
    return NULL;
244
11.0k
  
if (11.0k
index < 0 || 11.0k
index >= list->n11.0k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
11.0k
      "index out of bounds", return NULL);
247
11.0k
  
return 11.0k
FN11.0k
(EL,copy)(list->p[index]);
248
11.0k
}
isl_set_list_get_set
Line
Count
Source
241
8.48k
{
242
8.48k
  if (!list)
243
0
    return NULL;
244
8.48k
  
if (8.48k
index < 0 || 8.48k
index >= list->n8.48k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
8.48k
      "index out of bounds", return NULL);
247
8.48k
  
return 8.48k
FN8.48k
(EL,copy)(list->p[index]);
248
8.48k
}
isl_basic_set_list_get_basic_set
Line
Count
Source
241
6.69k
{
242
6.69k
  if (!list)
243
0
    return NULL;
244
6.69k
  
if (6.69k
index < 0 || 6.69k
index >= list->n6.69k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
6.69k
      "index out of bounds", return NULL);
247
6.69k
  
return 6.69k
FN6.69k
(EL,copy)(list->p[index]);
248
6.69k
}
isl_schedule_tree_list_get_schedule_tree
Line
Count
Source
241
371k
{
242
371k
  if (!list)
243
0
    return NULL;
244
371k
  
if (371k
index < 0 || 371k
index >= list->n371k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
371k
      "index out of bounds", return NULL);
247
371k
  
return 371k
FN371k
(EL,copy)(list->p[index]);
248
371k
}
isl_union_map_list_get_union_map
Line
Count
Source
241
9
{
242
9
  if (!list)
243
0
    return NULL;
244
9
  
if (9
index < 0 || 9
index >= list->n9
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
9
      "index out of bounds", return NULL);
247
9
  
return 9
FN9
(EL,copy)(list->p[index]);
248
9
}
isl_map_list_get_map
Line
Count
Source
241
1.00k
{
242
1.00k
  if (!list)
243
0
    return NULL;
244
1.00k
  
if (1.00k
index < 0 || 1.00k
index >= list->n1.00k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
1.00k
      "index out of bounds", return NULL);
247
1.00k
  
return 1.00k
FN1.00k
(EL,copy)(list->p[index]);
248
1.00k
}
isl_basic_map_list_get_basic_map
Line
Count
Source
241
7.19k
{
242
7.19k
  if (!list)
243
0
    return NULL;
244
7.19k
  
if (7.19k
index < 0 || 7.19k
index >= list->n7.19k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
7.19k
      "index out of bounds", return NULL);
247
7.19k
  
return 7.19k
FN7.19k
(EL,copy)(list->p[index]);
248
7.19k
}
isl_constraint_list_get_constraint
Line
Count
Source
241
1.93k
{
242
1.93k
  if (!list)
243
0
    return NULL;
244
1.93k
  
if (1.93k
index < 0 || 1.93k
index >= list->n1.93k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
1.93k
      "index out of bounds", return NULL);
247
1.93k
  
return 1.93k
FN1.93k
(EL,copy)(list->p[index]);
248
1.93k
}
isl_val_list_get_val
Line
Count
Source
241
21
{
242
21
  if (!list)
243
0
    return NULL;
244
21
  
if (21
index < 0 || 21
index >= list->n21
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
21
      "index out of bounds", return NULL);
247
21
  
return 21
FN21
(EL,copy)(list->p[index]);
248
21
}
isl_band_list_get_band
Line
Count
Source
241
6
{
242
6
  if (!list)
243
0
    return NULL;
244
6
  
if (6
index < 0 || 6
index >= list->n6
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
6
      "index out of bounds", return NULL);
247
6
  
return 6
FN6
(EL,copy)(list->p[index]);
248
6
}
isl_ast_graft_list_get_ast_graft
Line
Count
Source
241
18.8k
{
242
18.8k
  if (!list)
243
0
    return NULL;
244
18.8k
  
if (18.8k
index < 0 || 18.8k
index >= list->n18.8k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
18.8k
      "index out of bounds", return NULL);
247
18.8k
  
return 18.8k
FN18.8k
(EL,copy)(list->p[index]);
248
18.8k
}
isl_ast_node_list_get_ast_node
Line
Count
Source
241
2.61k
{
242
2.61k
  if (!list)
243
0
    return NULL;
244
2.61k
  
if (2.61k
index < 0 || 2.61k
index >= list->n2.61k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
2.61k
      "index out of bounds", return NULL);
247
2.61k
  
return 2.61k
FN2.61k
(EL,copy)(list->p[index]);
248
2.61k
}
Unexecuted instantiation: isl_ast_expr_list_get_ast_expr
isl_union_pw_multi_aff_list_get_union_pw_multi_aff
Line
Count
Source
241
7
{
242
7
  if (!list)
243
0
    return NULL;
244
7
  
if (7
index < 0 || 7
index >= list->n7
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
7
      "index out of bounds", return NULL);
247
7
  
return 7
FN7
(EL,copy)(list->p[index]);
248
7
}
isl_union_pw_aff_list_get_union_pw_aff
Line
Count
Source
241
27
{
242
27
  if (!list)
243
0
    return NULL;
244
27
  
if (27
index < 0 || 27
index >= list->n27
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
27
      "index out of bounds", return NULL);
247
27
  
return 27
FN27
(EL,copy)(list->p[index]);
248
27
}
isl_pw_aff_list_get_pw_aff
Line
Count
Source
241
10.3k
{
242
10.3k
  if (!list)
243
0
    return NULL;
244
10.3k
  
if (10.3k
index < 0 || 10.3k
index >= list->n10.3k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
10.3k
      "index out of bounds", return NULL);
247
10.3k
  
return 10.3k
FN10.3k
(EL,copy)(list->p[index]);
248
10.3k
}
isl_aff_list_get_aff
Line
Count
Source
241
5.37k
{
242
5.37k
  if (!list)
243
0
    return NULL;
244
5.37k
  
if (5.37k
index < 0 || 5.37k
index >= list->n5.37k
)
245
0
    isl_die(list->ctx, isl_error_invalid,
246
5.37k
      "index out of bounds", return NULL);
247
5.37k
  
return 5.37k
FN5.37k
(EL,copy)(list->p[index]);
248
5.37k
}
249
250
/* Replace the element at position "index" in "list" by "el".
251
 */
252
__isl_give LIST(EL) *FN(FN(LIST(EL),set),BASE)(__isl_take LIST(EL) *list,
253
  int index, __isl_take EL *el)
254
31.4k
{
255
31.4k
  if (
!list || 31.4k
!el31.4k
)
256
0
    goto error;
257
31.4k
  
if (31.4k
index < 0 || 31.4k
index >= list->n31.4k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
31.4k
      "index out of bounds", goto error);
260
31.4k
  
if (31.4k
list->p[index] == el31.4k
)
{6.57k
261
6.57k
    FN(EL,free)(el);
262
6.57k
    return list;
263
6.57k
  }
264
24.8k
  
list = 24.8k
FN24.8k
(LIST(EL),cow)(list);
265
24.8k
  if (!list)
266
0
    goto error;
267
24.8k
  
FN24.8k
(EL,free)(list->p[index]);24.8k
268
24.8k
  list->p[index] = el;
269
24.8k
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
24.8k
}
isl_pw_aff_list_set_pw_aff
Line
Count
Source
254
2.74k
{
255
2.74k
  if (
!list || 2.74k
!el2.74k
)
256
0
    goto error;
257
2.74k
  
if (2.74k
index < 0 || 2.74k
index >= list->n2.74k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
2.74k
      "index out of bounds", goto error);
260
2.74k
  
if (2.74k
list->p[index] == el2.74k
)
{0
261
0
    FN(EL,free)(el);
262
0
    return list;
263
0
  }
264
2.74k
  
list = 2.74k
FN2.74k
(LIST(EL),cow)(list);
265
2.74k
  if (!list)
266
0
    goto error;
267
2.74k
  
FN2.74k
(EL,free)(list->p[index]);2.74k
268
2.74k
  list->p[index] = el;
269
2.74k
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
2.74k
}
isl_aff_list_set_aff
Line
Count
Source
254
2
{
255
2
  if (
!list || 2
!el2
)
256
0
    goto error;
257
2
  
if (2
index < 0 || 2
index >= list->n2
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
2
      "index out of bounds", goto error);
260
2
  
if (2
list->p[index] == el2
)
{0
261
0
    FN(EL,free)(el);
262
0
    return list;
263
0
  }
264
2
  
list = 2
FN2
(LIST(EL),cow)(list);
265
2
  if (!list)
266
0
    goto error;
267
2
  
FN2
(EL,free)(list->p[index]);2
268
2
  list->p[index] = el;
269
2
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
2
}
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
254
3.85k
{
255
3.85k
  if (
!list || 3.85k
!el3.85k
)
256
0
    goto error;
257
3.85k
  
if (3.85k
index < 0 || 3.85k
index >= list->n3.85k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
3.85k
      "index out of bounds", goto error);
260
3.85k
  
if (3.85k
list->p[index] == el3.85k
)
{3.83k
261
3.83k
    FN(EL,free)(el);
262
3.83k
    return list;
263
3.83k
  }
264
16
  
list = 16
FN16
(LIST(EL),cow)(list);
265
16
  if (!list)
266
0
    goto error;
267
16
  
FN16
(EL,free)(list->p[index]);16
268
16
  list->p[index] = el;
269
16
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
16
}
Unexecuted instantiation: isl_band_list_set_band
Unexecuted instantiation: isl_constraint_list_set_constraint
Unexecuted instantiation: isl_id_list_set_id
isl_basic_map_list_set_basic_map
Line
Count
Source
254
2.25k
{
255
2.25k
  if (
!list || 2.25k
!el2.25k
)
256
0
    goto error;
257
2.25k
  
if (2.25k
index < 0 || 2.25k
index >= list->n2.25k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
2.25k
      "index out of bounds", goto error);
260
2.25k
  
if (2.25k
list->p[index] == el2.25k
)
{2.20k
261
2.20k
    FN(EL,free)(el);
262
2.20k
    return list;
263
2.20k
  }
264
55
  
list = 55
FN55
(LIST(EL),cow)(list);
265
55
  if (!list)
266
0
    goto error;
267
55
  
FN55
(EL,free)(list->p[index]);55
268
55
  list->p[index] = el;
269
55
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
55
}
Unexecuted instantiation: isl_map_list_set_map
isl_union_map_list_set_union_map
Line
Count
Source
254
2
{
255
2
  if (
!list || 2
!el2
)
256
0
    goto error;
257
2
  
if (2
index < 0 || 2
index >= list->n2
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
2
      "index out of bounds", goto error);
260
2
  
if (2
list->p[index] == el2
)
{0
261
0
    FN(EL,free)(el);
262
0
    return list;
263
0
  }
264
2
  
list = 2
FN2
(LIST(EL),cow)(list);
265
2
  if (!list)
266
0
    goto error;
267
2
  
FN2
(EL,free)(list->p[index]);2
268
2
  list->p[index] = el;
269
2
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
2
}
isl_schedule_tree_list_set_schedule_tree
Line
Count
Source
254
18.8k
{
255
18.8k
  if (
!list || 18.8k
!el18.8k
)
256
0
    goto error;
257
18.8k
  
if (18.8k
index < 0 || 18.8k
index >= list->n18.8k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
18.8k
      "index out of bounds", goto error);
260
18.8k
  
if (18.8k
list->p[index] == el18.8k
)
{3
261
3
    FN(EL,free)(el);
262
3
    return list;
263
3
  }
264
18.8k
  
list = 18.8k
FN18.8k
(LIST(EL),cow)(list);
265
18.8k
  if (!list)
266
0
    goto error;
267
18.8k
  
FN18.8k
(EL,free)(list->p[index]);18.8k
268
18.8k
  list->p[index] = el;
269
18.8k
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
18.8k
}
isl_basic_set_list_set_basic_set
Line
Count
Source
254
2.25k
{
255
2.25k
  if (
!list || 2.25k
!el2.25k
)
256
0
    goto error;
257
2.25k
  
if (2.25k
index < 0 || 2.25k
index >= list->n2.25k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
2.25k
      "index out of bounds", goto error);
260
2.25k
  
if (2.25k
list->p[index] == el2.25k
)
{0
261
0
    FN(EL,free)(el);
262
0
    return list;
263
0
  }
264
2.25k
  
list = 2.25k
FN2.25k
(LIST(EL),cow)(list);
265
2.25k
  if (!list)
266
0
    goto error;
267
2.25k
  
FN2.25k
(EL,free)(list->p[index]);2.25k
268
2.25k
  list->p[index] = el;
269
2.25k
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
2.25k
}
isl_set_list_set_set
Line
Count
Source
254
1.50k
{
255
1.50k
  if (
!list || 1.50k
!el1.50k
)
256
0
    goto error;
257
1.50k
  
if (1.50k
index < 0 || 1.50k
index >= list->n1.50k
)
258
0
    isl_die(list->ctx, isl_error_invalid,
259
1.50k
      "index out of bounds", goto error);
260
1.50k
  
if (1.50k
list->p[index] == el1.50k
)
{536
261
536
    FN(EL,free)(el);
262
536
    return list;
263
536
  }
264
966
  
list = 966
FN966
(LIST(EL),cow)(list);
265
966
  if (!list)
266
0
    goto error;
267
966
  
FN966
(EL,free)(list->p[index]);966
268
966
  list->p[index] = el;
269
966
  return list;
270
0
error:
271
0
  FN(EL,free)(el);
272
0
  FN(LIST(EL),free)(list);
273
0
  return NULL;
274
966
}
Unexecuted instantiation: isl_union_set_list_set_union_set
Unexecuted instantiation: isl_val_list_set_val
275
276
isl_stat FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list,
277
  isl_stat (*fn)(__isl_take EL *el, void *user), void *user)
278
1.27k
{
279
1.27k
  int i;
280
1.27k
281
1.27k
  if (!list)
282
0
    return isl_stat_error;
283
1.27k
284
2.82k
  
for (i = 0; 1.27k
i < list->n2.82k
;
++i1.54k
)
{2.03k
285
2.03k
    
EL2.03k
*el =
FN2.03k
(EL,copy(list->p[i]));
286
2.03k
    if (!el)
287
0
      return isl_stat_error;
288
2.03k
    
if (2.03k
fn(el, user) < 02.03k
)
289
487
      return isl_stat_error;
290
2.03k
  }
291
1.27k
292
787
  return isl_stat_ok;
293
1.27k
}
isl_pw_aff_list_foreach
Line
Count
Source
278
637
{
279
637
  int i;
280
637
281
637
  if (!list)
282
0
    return isl_stat_error;
283
637
284
797
  
for (i = 0; 637
i < list->n797
;
++i160
)
{647
285
647
    
EL647
*el =
FN647
(EL,copy(list->p[i]));
286
647
    if (!el)
287
0
      return isl_stat_error;
288
647
    
if (647
fn(el, user) < 0647
)
289
487
      return isl_stat_error;
290
647
  }
291
637
292
150
  return isl_stat_ok;
293
637
}
Unexecuted instantiation: isl_val_list_foreach
Unexecuted instantiation: isl_union_set_list_foreach
Unexecuted instantiation: isl_set_list_foreach
Unexecuted instantiation: isl_basic_set_list_foreach
Unexecuted instantiation: isl_schedule_tree_list_foreach
Unexecuted instantiation: isl_union_map_list_foreach
Unexecuted instantiation: isl_map_list_foreach
Unexecuted instantiation: isl_basic_map_list_foreach
Unexecuted instantiation: isl_aff_list_foreach
isl_constraint_list_foreach
Line
Count
Source
278
637
{
279
637
  int i;
280
637
281
637
  if (!list)
282
0
    return isl_stat_error;
283
637
284
2.02k
  
for (i = 0; 637
i < list->n2.02k
;
++i1.38k
)
{1.38k
285
1.38k
    
EL1.38k
*el =
FN1.38k
(EL,copy(list->p[i]));
286
1.38k
    if (!el)
287
0
      return isl_stat_error;
288
1.38k
    
if (1.38k
fn(el, user) < 01.38k
)
289
0
      return isl_stat_error;
290
1.38k
  }
291
637
292
637
  return isl_stat_ok;
293
637
}
Unexecuted instantiation: isl_band_list_foreach
Unexecuted instantiation: isl_ast_graft_list_foreach
Unexecuted instantiation: isl_ast_node_list_foreach
Unexecuted instantiation: isl_ast_expr_list_foreach
Unexecuted instantiation: isl_union_pw_multi_aff_list_foreach
Unexecuted instantiation: isl_union_pw_aff_list_foreach
Unexecuted instantiation: isl_id_list_foreach
294
295
/* Internal data structure for isl_*_list_sort.
296
 *
297
 * "cmp" is the original comparison function.
298
 * "user" is a user provided pointer that should be passed to "cmp".
299
 */
300
S(LIST(EL),sort_data) {
301
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user);
302
  void *user;
303
};
304
305
/* Compare two entries of an isl_*_list based on the user provided
306
 * comparison function on pairs of isl_* objects.
307
 */
308
static int FN(LIST(EL),cmp)(const void *a, const void *b, void *user)
309
1.03k
{
310
1.03k
  S(LIST(EL),sort_data) *data = user;
311
1.03k
  EL * const *el1 = a;
312
1.03k
  EL * const *el2 = b;
313
1.03k
314
1.03k
  return data->cmp(*el1, *el2, data->user);
315
1.03k
}
Unexecuted instantiation: isl_val.c:isl_val_list_cmp
Unexecuted instantiation: isl_aff.c:isl_aff_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_union_set_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_set_list_cmp
Unexecuted instantiation: isl_set_list.c:isl_basic_set_list_cmp
Unexecuted instantiation: isl_schedule_tree.c:isl_schedule_tree_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_union_map_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_map_list_cmp
Unexecuted instantiation: isl_map_list.c:isl_basic_map_list_cmp
Unexecuted instantiation: isl_id.c:isl_id_list_cmp
isl_constraint.c:isl_constraint_list_cmp
Line
Count
Source
309
946
{
310
946
  S(LIST(EL),sort_data) *data = user;
311
946
  EL * const *el1 = a;
312
946
  EL * const *el2 = b;
313
946
314
946
  return data->cmp(*el1, *el2, data->user);
315
946
}
Unexecuted instantiation: isl_band.c:isl_band_list_cmp
isl_ast_graft.c:isl_ast_graft_list_cmp
Line
Count
Source
309
18
{
310
18
  S(LIST(EL),sort_data) *data = user;
311
18
  EL * const *el1 = a;
312
18
  EL * const *el2 = b;
313
18
314
18
  return data->cmp(*el1, *el2, data->user);
315
18
}
Unexecuted instantiation: isl_ast.c:isl_ast_node_list_cmp
Unexecuted instantiation: isl_ast.c:isl_ast_expr_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_multi_aff_list_cmp
Unexecuted instantiation: isl_aff.c:isl_union_pw_aff_list_cmp
isl_aff.c:isl_pw_aff_list_cmp
Line
Count
Source
309
67
{
310
67
  S(LIST(EL),sort_data) *data = user;
311
67
  EL * const *el1 = a;
312
67
  EL * const *el2 = b;
313
67
314
67
  return data->cmp(*el1, *el2, data->user);
315
67
}
316
317
/* Sort the elements of "list" in ascending order according to
318
 * comparison function "cmp".
319
 */
320
__isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list,
321
  int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *user)
322
1.49k
{
323
1.49k
  S(LIST(EL),sort_data) data = { cmp, user };
324
1.49k
325
1.49k
  if (!list)
326
0
    return NULL;
327
1.49k
  
if (1.49k
list->n <= 11.49k
)
328
711
    return list;
329
781
  
list = 781
FN781
(LIST(EL),cow)(list);
330
781
  if (!list)
331
0
    return NULL;
332
781
333
781
  
if (781
isl_sort(list->p, list->n, sizeof(list->p[0]),781
334
781
      &FN(LIST(EL),cmp), &data) < 0)
335
0
    
return 0
FN0
(LIST(EL),free)(list);
336
781
337
781
  return list;
338
781
}
Unexecuted instantiation: isl_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
322
18
{
323
18
  S(LIST(EL),sort_data) data = { cmp, user };
324
18
325
18
  if (!list)
326
0
    return NULL;
327
18
  
if (18
list->n <= 118
)
328
0
    return list;
329
18
  
list = 18
FN18
(LIST(EL),cow)(list);
330
18
  if (!list)
331
0
    return NULL;
332
18
333
18
  
if (18
isl_sort(list->p, list->n, sizeof(list->p[0]),18
334
18
      &FN(LIST(EL),cmp), &data) < 0)
335
0
    
return 0
FN0
(LIST(EL),free)(list);
336
18
337
18
  return list;
338
18
}
Unexecuted instantiation: isl_band_list_sort
isl_constraint_list_sort
Line
Count
Source
322
1.40k
{
323
1.40k
  S(LIST(EL),sort_data) data = { cmp, user };
324
1.40k
325
1.40k
  if (!list)
326
0
    return NULL;
327
1.40k
  
if (1.40k
list->n <= 11.40k
)
328
700
    return list;
329
706
  
list = 706
FN706
(LIST(EL),cow)(list);
330
706
  if (!list)
331
0
    return NULL;
332
706
333
706
  
if (706
isl_sort(list->p, list->n, sizeof(list->p[0]),706
334
706
      &FN(LIST(EL),cmp), &data) < 0)
335
0
    
return 0
FN0
(LIST(EL),free)(list);
336
706
337
706
  return list;
338
706
}
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_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
isl_pw_aff_list_sort
Line
Count
Source
322
68
{
323
68
  S(LIST(EL),sort_data) data = { cmp, user };
324
68
325
68
  if (!list)
326
0
    return NULL;
327
68
  
if (68
list->n <= 168
)
328
11
    return list;
329
57
  
list = 57
FN57
(LIST(EL),cow)(list);
330
57
  if (!list)
331
0
    return NULL;
332
57
333
57
  
if (57
isl_sort(list->p, list->n, sizeof(list->p[0]),57
334
57
      &FN(LIST(EL),cmp), &data) < 0)
335
0
    
return 0
FN0
(LIST(EL),free)(list);
336
57
337
57
  return list;
338
57
}
339
340
/* Internal data structure for isl_*_list_foreach_scc.
341
 *
342
 * "list" is the original list.
343
 * "follows" is the user provided callback that defines the edges of the graph.
344
 */
345
S(LIST(EL),foreach_scc_data) {
346
  LIST(EL) *list;
347
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user);
348
  void *follows_user;
349
};
350
351
/* Does element i of data->list follow element j?
352
 *
353
 * Use the user provided callback to find out.
354
 */
355
static isl_bool FN(LIST(EL),follows)(int i, int j, void *user)
356
106
{
357
106
  S(LIST(EL),foreach_scc_data) *data = user;
358
106
359
106
  return data->follows(data->list->p[i], data->list->p[j],
360
106
        data->follows_user);
361
106
}
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_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_band.c:isl_band_list_follows
Unexecuted instantiation: isl_constraint.c:isl_constraint_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_schedule_tree.c:isl_schedule_tree_list_follows
isl_set_list.c:isl_basic_set_list_follows
Line
Count
Source
356
106
{
357
106
  S(LIST(EL),foreach_scc_data) *data = user;
358
106
359
106
  return data->follows(data->list->p[i], data->list->p[j],
360
106
        data->follows_user);
361
106
}
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
Unexecuted instantiation: isl_id.c:isl_id_list_follows
362
363
/* Call "fn" on the sublist of "list" that consists of the elements
364
 * with indices specified by the "n" elements of "pos".
365
 */
366
static isl_stat FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos,
367
  int n, isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *user)
368
68
{
369
68
  int i;
370
68
  isl_ctx *ctx;
371
68
  LIST(EL) *slice;
372
68
373
68
  ctx = FN(LIST(EL),get_ctx)(list);
374
68
  slice = FN(LIST(EL),alloc)(ctx, n);
375
136
  for (i = 0; 
i < n136
;
++i68
)
{68
376
68
    EL *el;
377
68
378
68
    el = FN(EL,copy)(list->p[pos[i]]);
379
68
    slice = FN(LIST(EL),add)(slice, el);
380
68
  }
381
68
382
68
  return fn(slice, user);
383
68
}
Unexecuted instantiation: isl_val.c:isl_val_list_call_on_scc
Unexecuted instantiation: isl_aff.c:isl_pw_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_band.c:isl_band_list_call_on_scc
Unexecuted instantiation: isl_constraint.c:isl_constraint_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_schedule_tree.c:isl_schedule_tree_list_call_on_scc
isl_set_list.c:isl_basic_set_list_call_on_scc
Line
Count
Source
368
68
{
369
68
  int i;
370
68
  isl_ctx *ctx;
371
68
  LIST(EL) *slice;
372
68
373
68
  ctx = FN(LIST(EL),get_ctx)(list);
374
68
  slice = FN(LIST(EL),alloc)(ctx, n);
375
136
  for (i = 0; 
i < n136
;
++i68
)
{68
376
68
    EL *el;
377
68
378
68
    el = FN(EL,copy)(list->p[pos[i]]);
379
68
    slice = FN(LIST(EL),add)(slice, el);
380
68
  }
381
68
382
68
  return fn(slice, user);
383
68
}
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_aff.c:isl_aff_list_call_on_scc
384
385
/* Call "fn" on each of the strongly connected components (SCCs) of
386
 * the graph with as vertices the elements of "list" and
387
 * a directed edge from node b to node a iff follows(a, b)
388
 * returns 1.  follows should return -1 on error.
389
 *
390
 * If SCC a contains a node i that follows a node j in another SCC b
391
 * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a
392
 * after being called on SCC b.
393
 *
394
 * We simply call isl_tarjan_graph_init, extract the SCCs from the result and
395
 * call fn on each of them.
396
 */
397
isl_stat FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list,
398
  isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user),
399
  void *follows_user,
400
  isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user)
401
44
{
402
44
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
403
44
  int i, n;
404
44
  isl_ctx *ctx;
405
44
  struct isl_tarjan_graph *g;
406
44
407
44
  if (!list)
408
0
    return isl_stat_error;
409
44
  
if (44
list->n == 044
)
410
0
    return isl_stat_ok;
411
44
  
if (44
list->n == 144
)
412
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
413
44
414
44
  
ctx = 44
FN44
(LIST(EL),get_ctx)(list);
415
44
  n = list->n;
416
44
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
417
44
  if (!g)
418
0
    return isl_stat_error;
419
44
420
44
  i = 0;
421
81
  do {
422
81
    int first;
423
81
424
81
    if (g->order[i] == -1)
425
0
      isl_die(ctx, isl_error_internal, "cannot happen",
426
81
        break);
427
81
    first = i;
428
181
    while (
g->order[i] != -1181
)
{100
429
100
      ++i; --n;
430
100
    }
431
81
    if (
first == 0 && 81
n == 044
)
{13
432
13
      isl_tarjan_graph_free(g);
433
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
434
13
    }
435
68
    
if (68
FN68
(LIST(EL),call_on_scc)(list, g->order + first, i - first,68
436
68
              fn, fn_user) < 0)
437
0
      break;
438
68
    ++i;
439
68
  } while (n);
440
44
441
31
  isl_tarjan_graph_free(g);
442
31
443
31
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok31
;
444
44
}
Unexecuted instantiation: isl_val_list_foreach_scc
Unexecuted instantiation: isl_aff_list_foreach_scc
Unexecuted instantiation: isl_pw_aff_list_foreach_scc
Unexecuted instantiation: isl_union_pw_aff_list_foreach_scc
Unexecuted instantiation: isl_union_pw_multi_aff_list_foreach_scc
Unexecuted instantiation: isl_ast_expr_list_foreach_scc
Unexecuted instantiation: isl_ast_node_list_foreach_scc
Unexecuted instantiation: isl_ast_graft_list_foreach_scc
Unexecuted instantiation: isl_band_list_foreach_scc
Unexecuted instantiation: isl_constraint_list_foreach_scc
Unexecuted instantiation: isl_id_list_foreach_scc
Unexecuted instantiation: isl_basic_map_list_foreach_scc
Unexecuted instantiation: isl_map_list_foreach_scc
Unexecuted instantiation: isl_union_map_list_foreach_scc
Unexecuted instantiation: isl_schedule_tree_list_foreach_scc
isl_basic_set_list_foreach_scc
Line
Count
Source
401
44
{
402
44
  S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
403
44
  int i, n;
404
44
  isl_ctx *ctx;
405
44
  struct isl_tarjan_graph *g;
406
44
407
44
  if (!list)
408
0
    return isl_stat_error;
409
44
  
if (44
list->n == 044
)
410
0
    return isl_stat_ok;
411
44
  
if (44
list->n == 144
)
412
0
    
return fn(0
FN0
(LIST(EL),copy)(list), fn_user);
413
44
414
44
  
ctx = 44
FN44
(LIST(EL),get_ctx)(list);
415
44
  n = list->n;
416
44
  g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
417
44
  if (!g)
418
0
    return isl_stat_error;
419
44
420
44
  i = 0;
421
81
  do {
422
81
    int first;
423
81
424
81
    if (g->order[i] == -1)
425
0
      isl_die(ctx, isl_error_internal, "cannot happen",
426
81
        break);
427
81
    first = i;
428
181
    while (
g->order[i] != -1181
)
{100
429
100
      ++i; --n;
430
100
    }
431
81
    if (
first == 0 && 81
n == 044
)
{13
432
13
      isl_tarjan_graph_free(g);
433
13
      return fn(FN(LIST(EL),copy)(list), fn_user);
434
13
    }
435
68
    
if (68
FN68
(LIST(EL),call_on_scc)(list, g->order + first, i - first,68
436
68
              fn, fn_user) < 0)
437
0
      break;
438
68
    ++i;
439
68
  } while (n);
440
44
441
31
  isl_tarjan_graph_free(g);
442
31
443
31
  return n > 0 ? 
isl_stat_error0
:
isl_stat_ok31
;
444
44
}
Unexecuted instantiation: isl_set_list_foreach_scc
Unexecuted instantiation: isl_union_set_list_foreach_scc
445
446
__isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el)
447
22.5k
{
448
22.5k
  isl_ctx *ctx;
449
22.5k
  LIST(EL) *list;
450
22.5k
451
22.5k
  if (!el)
452
0
    return NULL;
453
22.5k
  
ctx = 22.5k
FN22.5k
(EL,get_ctx)(el);
454
22.5k
  list = FN(LIST(EL),alloc)(ctx, 1);
455
22.5k
  if (!list)
456
0
    goto error;
457
22.5k
  
list = 22.5k
FN22.5k
(LIST(EL),add)(list, el);
458
22.5k
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
22.5k
}
isl_val_list_from_val
Line
Count
Source
447
4
{
448
4
  isl_ctx *ctx;
449
4
  LIST(EL) *list;
450
4
451
4
  if (!el)
452
0
    return NULL;
453
4
  
ctx = 4
FN4
(EL,get_ctx)(el);
454
4
  list = FN(LIST(EL),alloc)(ctx, 1);
455
4
  if (!list)
456
0
    goto error;
457
4
  
list = 4
FN4
(LIST(EL),add)(list, el);
458
4
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
4
}
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
447
7
{
448
7
  isl_ctx *ctx;
449
7
  LIST(EL) *list;
450
7
451
7
  if (!el)
452
0
    return NULL;
453
7
  
ctx = 7
FN7
(EL,get_ctx)(el);
454
7
  list = FN(LIST(EL),alloc)(ctx, 1);
455
7
  if (!list)
456
0
    goto error;
457
7
  
list = 7
FN7
(LIST(EL),add)(list, el);
458
7
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
7
}
Unexecuted instantiation: isl_ast_expr_list_from_ast_expr
isl_ast_node_list_from_ast_node
Line
Count
Source
447
19
{
448
19
  isl_ctx *ctx;
449
19
  LIST(EL) *list;
450
19
451
19
  if (!el)
452
0
    return NULL;
453
19
  
ctx = 19
FN19
(EL,get_ctx)(el);
454
19
  list = FN(LIST(EL),alloc)(ctx, 1);
455
19
  if (!list)
456
0
    goto error;
457
19
  
list = 19
FN19
(LIST(EL),add)(list, el);
458
19
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
19
}
isl_ast_graft_list_from_ast_graft
Line
Count
Source
447
1.28k
{
448
1.28k
  isl_ctx *ctx;
449
1.28k
  LIST(EL) *list;
450
1.28k
451
1.28k
  if (!el)
452
0
    return NULL;
453
1.28k
  
ctx = 1.28k
FN1.28k
(EL,get_ctx)(el);
454
1.28k
  list = FN(LIST(EL),alloc)(ctx, 1);
455
1.28k
  if (!list)
456
0
    goto error;
457
1.28k
  
list = 1.28k
FN1.28k
(LIST(EL),add)(list, el);
458
1.28k
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
1.28k
}
isl_band_list_from_band
Line
Count
Source
447
6
{
448
6
  isl_ctx *ctx;
449
6
  LIST(EL) *list;
450
6
451
6
  if (!el)
452
0
    return NULL;
453
6
  
ctx = 6
FN6
(EL,get_ctx)(el);
454
6
  list = FN(LIST(EL),alloc)(ctx, 1);
455
6
  if (!list)
456
0
    goto error;
457
6
  
list = 6
FN6
(LIST(EL),add)(list, el);
458
6
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
6
}
Unexecuted instantiation: isl_constraint_list_from_constraint
Unexecuted instantiation: isl_id_list_from_id
isl_aff_list_from_aff
Line
Count
Source
447
4.92k
{
448
4.92k
  isl_ctx *ctx;
449
4.92k
  LIST(EL) *list;
450
4.92k
451
4.92k
  if (!el)
452
0
    return NULL;
453
4.92k
  
ctx = 4.92k
FN4.92k
(EL,get_ctx)(el);
454
4.92k
  list = FN(LIST(EL),alloc)(ctx, 1);
455
4.92k
  if (!list)
456
0
    goto error;
457
4.92k
  
list = 4.92k
FN4.92k
(LIST(EL),add)(list, el);
458
4.92k
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
4.92k
}
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
447
1
{
448
1
  isl_ctx *ctx;
449
1
  LIST(EL) *list;
450
1
451
1
  if (!el)
452
0
    return NULL;
453
1
  
ctx = 1
FN1
(EL,get_ctx)(el);
454
1
  list = FN(LIST(EL),alloc)(ctx, 1);
455
1
  if (!list)
456
0
    goto error;
457
1
  
list = 1
FN1
(LIST(EL),add)(list, el);
458
1
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
1
}
isl_schedule_tree_list_from_schedule_tree
Line
Count
Source
447
2.84k
{
448
2.84k
  isl_ctx *ctx;
449
2.84k
  LIST(EL) *list;
450
2.84k
451
2.84k
  if (!el)
452
0
    return NULL;
453
2.84k
  
ctx = 2.84k
FN2.84k
(EL,get_ctx)(el);
454
2.84k
  list = FN(LIST(EL),alloc)(ctx, 1);
455
2.84k
  if (!list)
456
0
    goto error;
457
2.84k
  
list = 2.84k
FN2.84k
(LIST(EL),add)(list, el);
458
2.84k
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
2.84k
}
isl_basic_set_list_from_basic_set
Line
Count
Source
447
517
{
448
517
  isl_ctx *ctx;
449
517
  LIST(EL) *list;
450
517
451
517
  if (!el)
452
0
    return NULL;
453
517
  
ctx = 517
FN517
(EL,get_ctx)(el);
454
517
  list = FN(LIST(EL),alloc)(ctx, 1);
455
517
  if (!list)
456
0
    goto error;
457
517
  
list = 517
FN517
(LIST(EL),add)(list, el);
458
517
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
517
}
isl_set_list_from_set
Line
Count
Source
447
4.92k
{
448
4.92k
  isl_ctx *ctx;
449
4.92k
  LIST(EL) *list;
450
4.92k
451
4.92k
  if (!el)
452
0
    return NULL;
453
4.92k
  
ctx = 4.92k
FN4.92k
(EL,get_ctx)(el);
454
4.92k
  list = FN(LIST(EL),alloc)(ctx, 1);
455
4.92k
  if (!list)
456
0
    goto error;
457
4.92k
  
list = 4.92k
FN4.92k
(LIST(EL),add)(list, el);
458
4.92k
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
4.92k
}
isl_union_set_list_from_union_set
Line
Count
Source
447
326
{
448
326
  isl_ctx *ctx;
449
326
  LIST(EL) *list;
450
326
451
326
  if (!el)
452
0
    return NULL;
453
326
  
ctx = 326
FN326
(EL,get_ctx)(el);
454
326
  list = FN(LIST(EL),alloc)(ctx, 1);
455
326
  if (!list)
456
0
    goto error;
457
326
  
list = 326
FN326
(LIST(EL),add)(list, el);
458
326
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
326
}
isl_pw_aff_list_from_pw_aff
Line
Count
Source
447
7.69k
{
448
7.69k
  isl_ctx *ctx;
449
7.69k
  LIST(EL) *list;
450
7.69k
451
7.69k
  if (!el)
452
0
    return NULL;
453
7.69k
  
ctx = 7.69k
FN7.69k
(EL,get_ctx)(el);
454
7.69k
  list = FN(LIST(EL),alloc)(ctx, 1);
455
7.69k
  if (!list)
456
0
    goto error;
457
7.69k
  
list = 7.69k
FN7.69k
(LIST(EL),add)(list, el);
458
7.69k
  return list;
459
0
error:
460
0
  FN(EL,free)(el);
461
0
  return NULL;
462
7.69k
}
463
464
__isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1,
465
  __isl_take LIST(EL) *list2)
466
5.12k
{
467
5.12k
  int i;
468
5.12k
  isl_ctx *ctx;
469
5.12k
  LIST(EL) *res;
470
5.12k
471
5.12k
  if (
!list1 || 5.12k
!list25.12k
)
472
0
    goto error;
473
5.12k
474
5.12k
  
ctx = 5.12k
FN5.12k
(LIST(EL),get_ctx)(list1);
475
5.12k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
17.7k
  for (i = 0; 
i < list1->n17.7k
;
++i12.6k
)
477
12.6k
    
res = 12.6k
FN12.6k
(LIST(EL),add)(res,
FN12.6k
(EL,copy)(list1->p[i]));
478
10.9k
  for (i = 0; 
i < list2->n10.9k
;
++i5.87k
)
479
5.87k
    
res = 5.87k
FN5.87k
(LIST(EL),add)(res,
FN5.87k
(EL,copy)(list2->p[i]));
480
5.12k
481
5.12k
  FN(LIST(EL),free)(list1);
482
5.12k
  FN(LIST(EL),free)(list2);
483
5.12k
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
5.12k
}
Unexecuted instantiation: isl_union_set_list_concat
Unexecuted instantiation: isl_set_list_concat
isl_basic_set_list_concat
Line
Count
Source
466
75
{
467
75
  int i;
468
75
  isl_ctx *ctx;
469
75
  LIST(EL) *res;
470
75
471
75
  if (
!list1 || 75
!list275
)
472
0
    goto error;
473
75
474
75
  
ctx = 75
FN75
(LIST(EL),get_ctx)(list1);
475
75
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
95
  for (i = 0; 
i < list1->n95
;
++i20
)
477
20
    
res = 20
FN20
(LIST(EL),add)(res,
FN20
(EL,copy)(list1->p[i]));
478
149
  for (i = 0; 
i < list2->n149
;
++i74
)
479
74
    
res = 74
FN74
(LIST(EL),add)(res,
FN74
(EL,copy)(list2->p[i]));
480
75
481
75
  FN(LIST(EL),free)(list1);
482
75
  FN(LIST(EL),free)(list2);
483
75
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
75
}
Unexecuted instantiation: isl_schedule_tree_list_concat
Unexecuted instantiation: isl_union_map_list_concat
Unexecuted instantiation: isl_map_list_concat
isl_basic_map_list_concat
Line
Count
Source
466
1.00k
{
467
1.00k
  int i;
468
1.00k
  isl_ctx *ctx;
469
1.00k
  LIST(EL) *res;
470
1.00k
471
1.00k
  if (
!list1 || 1.00k
!list21.00k
)
472
0
    goto error;
473
1.00k
474
1.00k
  
ctx = 1.00k
FN1.00k
(LIST(EL),get_ctx)(list1);
475
1.00k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
10.7k
  for (i = 0; 
i < list1->n10.7k
;
++i9.73k
)
477
9.73k
    
res = 9.73k
FN9.73k
(LIST(EL),add)(res,
FN9.73k
(EL,copy)(list1->p[i]));
478
3.26k
  for (i = 0; 
i < list2->n3.26k
;
++i2.25k
)
479
2.25k
    
res = 2.25k
FN2.25k
(LIST(EL),add)(res,
FN2.25k
(EL,copy)(list2->p[i]));
480
1.00k
481
1.00k
  FN(LIST(EL),free)(list1);
482
1.00k
  FN(LIST(EL),free)(list2);
483
1.00k
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
1.00k
}
isl_id_list_concat
Line
Count
Source
466
560
{
467
560
  int i;
468
560
  isl_ctx *ctx;
469
560
  LIST(EL) *res;
470
560
471
560
  if (
!list1 || 560
!list2560
)
472
0
    goto error;
473
560
474
560
  
ctx = 560
FN560
(LIST(EL),get_ctx)(list1);
475
560
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
1.00k
  for (i = 0; 
i < list1->n1.00k
;
++i440
)
477
440
    
res = 440
FN440
(LIST(EL),add)(res,
FN440
(EL,copy)(list1->p[i]));
478
1.32k
  for (i = 0; 
i < list2->n1.32k
;
++i769
)
479
769
    
res = 769
FN769
(LIST(EL),add)(res,
FN769
(EL,copy)(list2->p[i]));
480
560
481
560
  FN(LIST(EL),free)(list1);
482
560
  FN(LIST(EL),free)(list2);
483
560
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
560
}
Unexecuted instantiation: isl_constraint_list_concat
isl_band_list_concat
Line
Count
Source
466
4
{
467
4
  int i;
468
4
  isl_ctx *ctx;
469
4
  LIST(EL) *res;
470
4
471
4
  if (
!list1 || 4
!list24
)
472
0
    goto error;
473
4
474
4
  
ctx = 4
FN4
(LIST(EL),get_ctx)(list1);
475
4
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
6
  for (i = 0; 
i < list1->n6
;
++i2
)
477
2
    
res = 2
FN2
(LIST(EL),add)(res,
FN2
(EL,copy)(list1->p[i]));
478
8
  for (i = 0; 
i < list2->n8
;
++i4
)
479
4
    
res = 4
FN4
(LIST(EL),add)(res,
FN4
(EL,copy)(list2->p[i]));
480
4
481
4
  FN(LIST(EL),free)(list1);
482
4
  FN(LIST(EL),free)(list2);
483
4
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
4
}
isl_ast_graft_list_concat
Line
Count
Source
466
3.36k
{
467
3.36k
  int i;
468
3.36k
  isl_ctx *ctx;
469
3.36k
  LIST(EL) *res;
470
3.36k
471
3.36k
  if (
!list1 || 3.36k
!list23.36k
)
472
0
    goto error;
473
3.36k
474
3.36k
  
ctx = 3.36k
FN3.36k
(LIST(EL),get_ctx)(list1);
475
3.36k
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
5.70k
  for (i = 0; 
i < list1->n5.70k
;
++i2.34k
)
477
2.34k
    
res = 2.34k
FN2.34k
(LIST(EL),add)(res,
FN2.34k
(EL,copy)(list1->p[i]));
478
6.01k
  for (i = 0; 
i < list2->n6.01k
;
++i2.65k
)
479
2.65k
    
res = 2.65k
FN2.65k
(LIST(EL),add)(res,
FN2.65k
(EL,copy)(list2->p[i]));
480
3.36k
481
3.36k
  FN(LIST(EL),free)(list1);
482
3.36k
  FN(LIST(EL),free)(list2);
483
3.36k
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
3.36k
}
Unexecuted instantiation: isl_ast_node_list_concat
Unexecuted instantiation: isl_ast_expr_list_concat
Unexecuted instantiation: isl_union_pw_multi_aff_list_concat
Unexecuted instantiation: isl_union_pw_aff_list_concat
isl_pw_aff_list_concat
Line
Count
Source
466
119
{
467
119
  int i;
468
119
  isl_ctx *ctx;
469
119
  LIST(EL) *res;
470
119
471
119
  if (
!list1 || 119
!list2119
)
472
0
    goto error;
473
119
474
119
  
ctx = 119
FN119
(LIST(EL),get_ctx)(list1);
475
119
  res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476
249
  for (i = 0; 
i < list1->n249
;
++i130
)
477
130
    
res = 130
FN130
(LIST(EL),add)(res,
FN130
(EL,copy)(list1->p[i]));
478
238
  for (i = 0; 
i < list2->n238
;
++i119
)
479
119
    
res = 119
FN119
(LIST(EL),add)(res,
FN119
(EL,copy)(list2->p[i]));
480
119
481
119
  FN(LIST(EL),free)(list1);
482
119
  FN(LIST(EL),free)(list2);
483
119
  return res;
484
0
error:
485
0
  FN(LIST(EL),free)(list1);
486
0
  FN(LIST(EL),free)(list2);
487
0
  return NULL;
488
119
}
Unexecuted instantiation: isl_aff_list_concat
Unexecuted instantiation: isl_val_list_concat
489
490
__isl_give isl_printer *CAT(isl_printer_print_,LIST(BASE))(
491
  __isl_take isl_printer *p, __isl_keep LIST(EL) *list)
492
0
{
493
0
  int i;
494
0
495
0
  if (
!p || 0
!list0
)
496
0
    goto error;
497
0
  p = isl_printer_print_str(p, "(");
498
0
  for (i = 0; 
i < list->n0
;
++i0
)
{0
499
0
    if (i)
500
0
      p = isl_printer_print_str(p, ",");
501
0
    p = CAT(isl_printer_print_,BASE)(p, list->p[i]);
502
0
  }
503
0
  p = isl_printer_print_str(p, ")");
504
0
  return p;
505
0
error:
506
0
  isl_printer_free(p);
507
0
  return NULL;
508
0
}
Unexecuted instantiation: isl_printer_print_aff_list
Unexecuted instantiation: isl_printer_print_val_list
Unexecuted instantiation: isl_printer_print_union_set_list
Unexecuted instantiation: isl_printer_print_set_list
Unexecuted instantiation: isl_printer_print_basic_set_list
Unexecuted instantiation: isl_printer_print_schedule_tree_list
Unexecuted instantiation: isl_printer_print_union_map_list
Unexecuted instantiation: isl_printer_print_map_list
Unexecuted instantiation: isl_printer_print_basic_map_list
Unexecuted instantiation: isl_printer_print_id_list
Unexecuted instantiation: isl_printer_print_constraint_list
Unexecuted instantiation: isl_printer_print_band_list
Unexecuted instantiation: isl_printer_print_ast_graft_list
Unexecuted instantiation: isl_printer_print_ast_node_list
Unexecuted instantiation: isl_printer_print_ast_expr_list
Unexecuted instantiation: isl_printer_print_union_pw_multi_aff_list
Unexecuted instantiation: isl_printer_print_union_pw_aff_list
Unexecuted instantiation: isl_printer_print_pw_aff_list
509
510
void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list)
511
0
{
512
0
  isl_printer *printer;
513
0
514
0
  if (!list)
515
0
    return;
516
0
517
0
  
printer = isl_printer_to_file(0
FN0
(LIST(EL),get_ctx)(list), stderr);
518
0
  printer = CAT(isl_printer_print_,LIST(BASE))(printer, list);
519
0
  printer = isl_printer_end_line(printer);
520
0
521
0
  isl_printer_free(printer);
522
0
}
Unexecuted instantiation: isl_union_set_list_dump
Unexecuted instantiation: isl_val_list_dump
Unexecuted instantiation: isl_pw_aff_list_dump
Unexecuted instantiation: isl_union_pw_aff_list_dump
Unexecuted instantiation: isl_union_pw_multi_aff_list_dump
Unexecuted instantiation: isl_ast_expr_list_dump
Unexecuted instantiation: isl_ast_node_list_dump
Unexecuted instantiation: isl_ast_graft_list_dump
Unexecuted instantiation: isl_band_list_dump
Unexecuted instantiation: isl_constraint_list_dump
Unexecuted instantiation: isl_id_list_dump
Unexecuted instantiation: isl_basic_map_list_dump
Unexecuted instantiation: isl_map_list_dump
Unexecuted instantiation: isl_union_map_list_dump
Unexecuted instantiation: isl_schedule_tree_list_dump
Unexecuted instantiation: isl_basic_set_list_dump
Unexecuted instantiation: isl_set_list_dump
Unexecuted instantiation: isl_aff_list_dump