Coverage Report

Created: 2017-06-23 12:40

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/llvm/tools/polly/lib/External/isl/isl_id.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2008-2009 Katholieke Universiteit Leuven
3
 *
4
 * Use of this software is governed by the MIT license
5
 *
6
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
8
 */
9
10
#include <string.h>
11
#include <isl_ctx_private.h>
12
#include <isl_id_private.h>
13
14
#undef BASE
15
#define BASE id
16
17
#include <isl_list_templ.c>
18
19
/* A special, static isl_id to use as domains (and ranges)
20
 * of sets and parameters domains.
21
 * The user should never get a hold on this isl_id.
22
 */
23
isl_id isl_id_none = {
24
  .ref = -1,
25
  .ctx = NULL,
26
  .name = "#none",
27
  .user = NULL
28
};
29
30
isl_ctx *isl_id_get_ctx(__isl_keep isl_id *id)
31
17.0k
{
32
17.0k
  return id ? id->ctx : NULL;
33
17.0k
}
34
35
void *isl_id_get_user(__isl_keep isl_id *id)
36
22.7k
{
37
22.7k
  return id ? id->user : NULL;
38
22.7k
}
39
40
const char *isl_id_get_name(__isl_keep isl_id *id)
41
9.24k
{
42
9.24k
  return id ? id->name : NULL;
43
9.24k
}
44
45
static __isl_give isl_id *id_alloc(isl_ctx *ctx, const char *name, void *user)
46
63.2k
{
47
61.7k
  const char *copy = name ? strdup(name) : NULL;
48
63.2k
  isl_id *id;
49
63.2k
50
63.2k
  if (
name && 63.2k
!copy61.7k
)
51
0
    return NULL;
52
63.2k
  
id = 63.2k
isl_calloc_type63.2k
(ctx, struct isl_id);
53
63.2k
  if (!id)
54
1
    goto error;
55
63.2k
56
63.2k
  id->ctx = ctx;
57
63.2k
  isl_ctx_ref(id->ctx);
58
63.2k
  id->ref = 1;
59
63.2k
  id->name = copy;
60
63.2k
  id->user = user;
61
63.2k
62
63.2k
  id->hash = isl_hash_init();
63
63.2k
  if (name)
64
61.7k
    id->hash = isl_hash_string(id->hash, name);
65
63.2k
  else
66
1.45k
    
id->hash = 1.45k
isl_hash_builtin1.45k
(id->hash, user);
67
63.2k
68
63.2k
  return id;
69
1
error:
70
1
  free((char *)copy);
71
1
  return NULL;
72
63.2k
}
73
74
uint32_t isl_id_get_hash(__isl_keep isl_id *id)
75
678
{
76
678
  return id ? 
id->hash678
:
00
;
77
678
}
78
79
struct isl_name_and_user {
80
  const char *name;
81
  void *user;
82
};
83
84
static int isl_id_has_name_and_user(const void *entry, const void *val)
85
55.6k
{
86
55.6k
  isl_id *id = (isl_id *)entry;
87
55.6k
  struct isl_name_and_user *nu = (struct isl_name_and_user *) val;
88
55.6k
89
55.6k
  if (id->user != nu->user)
90
49.2k
    return 0;
91
6.35k
  
if (6.35k
id->name == nu->name6.35k
)
92
646
    return 1;
93
5.70k
  
if (5.70k
!id->name || 5.70k
!nu->name5.70k
)
94
0
    return 0;
95
5.70k
96
5.70k
  return !strcmp(id->name, nu->name);
97
5.70k
}
98
99
__isl_give isl_id *isl_id_alloc(isl_ctx *ctx, const char *name, void *user)
100
69.6k
{
101
69.6k
  struct isl_hash_table_entry *entry;
102
69.6k
  uint32_t id_hash;
103
69.6k
  struct isl_name_and_user nu = { name, user };
104
69.6k
105
69.6k
  if (!ctx)
106
0
    return NULL;
107
69.6k
108
69.6k
  
id_hash = 69.6k
isl_hash_init69.6k
();
109
69.6k
  if (name)
110
67.4k
    id_hash = isl_hash_string(id_hash, name);
111
69.6k
  else
112
2.10k
    
id_hash = 2.10k
isl_hash_builtin2.10k
(id_hash, user);
113
69.6k
  entry = isl_hash_table_find(ctx, &ctx->id_table, id_hash,
114
69.6k
          isl_id_has_name_and_user, &nu, 1);
115
69.6k
  if (!entry)
116
0
    return NULL;
117
69.6k
  
if (69.6k
entry->data69.6k
)
118
6.35k
    return isl_id_copy(entry->data);
119
63.2k
  entry->data = id_alloc(ctx, name, user);
120
63.2k
  if (!entry->data)
121
1
    ctx->id_table.n--;
122
63.2k
  return entry->data;
123
69.6k
}
124
125
/* If the id has a negative refcount, then it is a static isl_id
126
 * which should not be changed.
127
 */
128
__isl_give isl_id *isl_id_copy(isl_id *id)
129
11.0M
{
130
11.0M
  if (!id)
131
18.3k
    return NULL;
132
11.0M
133
11.0M
  
if (11.0M
id->ref < 011.0M
)
134
1.34M
    return id;
135
11.0M
136
9.70M
  id->ref++;
137
9.70M
  return id;
138
11.0M
}
139
140
/* Compare two isl_ids.
141
 *
142
 * The order is fairly arbitrary.  We do keep the comparison of
143
 * the user pointers as a last resort since these pointer values
144
 * may not be stable across different systems or even different runs.
145
 */
146
int isl_id_cmp(__isl_keep isl_id *id1, __isl_keep isl_id *id2)
147
4.18M
{
148
4.18M
  if (id1 == id2)
149
4.18M
    return 0;
150
0
  
if (0
!id10
)
151
0
    return -1;
152
0
  
if (0
!id20
)
153
0
    return 1;
154
0
  
if (0
!id1->name != !id2->name0
)
155
0
    return !id1->name - !id2->name;
156
0
  
if (0
id1->name0
)
{0
157
0
    int cmp = strcmp(id1->name, id2->name);
158
0
    if (cmp != 0)
159
0
      return cmp;
160
0
  }
161
0
  
if (0
id1->user < id2->user0
)
162
0
    return -1;
163
0
  else
164
0
    return 1;
165
0
}
166
167
static int isl_id_eq(const void *entry, const void *name)
168
66.0k
{
169
66.0k
  return entry == name;
170
66.0k
}
171
172
uint32_t isl_hash_id(uint32_t hash, __isl_keep isl_id *id)
173
1.78M
{
174
1.78M
  if (id)
175
1.39M
    isl_hash_hash(hash, id->hash);
176
1.78M
177
1.78M
  return hash;
178
1.78M
}
179
180
/* Replace the free_user callback by "free_user".
181
 */
182
__isl_give isl_id *isl_id_set_free_user(__isl_take isl_id *id,
183
  void (*free_user)(void *user))
184
1.56k
{
185
1.56k
  if (!id)
186
0
    return NULL;
187
1.56k
188
1.56k
  id->free_user = free_user;
189
1.56k
190
1.56k
  return id;
191
1.56k
}
192
193
/* If the id has a negative refcount, then it is a static isl_id
194
 * and should not be freed.
195
 */
196
__isl_null isl_id *isl_id_free(__isl_take isl_id *id)
197
21.9M
{
198
21.9M
  struct isl_hash_table_entry *entry;
199
21.9M
200
21.9M
  if (!id)
201
9.50M
    return NULL;
202
21.9M
203
12.4M
  
if (12.4M
id->ref < 012.4M
)
204
2.64M
    return NULL;
205
12.4M
206
9.76M
  
if (9.76M
--id->ref > 09.76M
)
207
9.70M
    return NULL;
208
9.76M
209
63.2k
  entry = isl_hash_table_find(id->ctx, &id->ctx->id_table, id->hash,
210
63.2k
          isl_id_eq, id, 0);
211
63.2k
  if (!entry)
212
0
    isl_die(id->ctx, isl_error_unknown,
213
63.2k
      "unable to find id", (void)0);
214
63.2k
  else
215
63.2k
    isl_hash_table_remove(id->ctx, &id->ctx->id_table, entry);
216
63.2k
217
63.2k
  if (id->free_user)
218
1.56k
    id->free_user(id->user);
219
63.2k
220
63.2k
  free((char *)id->name);
221
63.2k
  isl_ctx_deref(id->ctx);
222
63.2k
  free(id);
223
63.2k
224
63.2k
  return NULL;
225
9.76M
}
226
227
__isl_give isl_printer *isl_printer_print_id(__isl_take isl_printer *p,
228
  __isl_keep isl_id *id)
229
0
{
230
0
  if (!id)
231
0
    goto error;
232
0
233
0
  
if (0
id->name0
)
234
0
    p = isl_printer_print_str(p, id->name);
235
0
  if (
id->user0
)
{0
236
0
    char buffer[50];
237
0
    snprintf(buffer, sizeof(buffer), "@%p", id->user);
238
0
    p = isl_printer_print_str(p, buffer);
239
0
  }
240
0
  return p;
241
0
error:
242
0
  isl_printer_free(p);
243
0
  return NULL;
244
0
}