isl_ast_build_ast_from_schedule: coalesce input schedule
[isl.git] / isl_id.c
blob59d58189d68abc2fe42b64f3519195fe1e331365
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
8 */
10 #include <string.h>
11 #include <isl_ctx_private.h>
12 #include <isl_id_private.h>
14 #undef BASE
15 #define BASE id
17 #include <isl_list_templ.c>
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.
23 isl_id isl_id_none = {
24 .ref = -1,
25 .ctx = NULL,
26 .name = "#none",
27 .user = NULL
30 isl_ctx *isl_id_get_ctx(__isl_keep isl_id *id)
32 return id ? id->ctx : NULL;
35 void *isl_id_get_user(__isl_keep isl_id *id)
37 return id ? id->user : NULL;
40 const char *isl_id_get_name(__isl_keep isl_id *id)
42 return id ? id->name : NULL;
45 static __isl_give isl_id *id_alloc(isl_ctx *ctx, const char *name, void *user)
47 const char *copy = name ? strdup(name) : NULL;
48 isl_id *id;
50 if (name && !copy)
51 return NULL;
52 id = isl_calloc_type(ctx, struct isl_id);
53 if (!id)
54 goto error;
56 id->ctx = ctx;
57 isl_ctx_ref(id->ctx);
58 id->ref = 1;
59 id->name = copy;
60 id->user = user;
62 id->hash = isl_hash_init();
63 if (name)
64 id->hash = isl_hash_string(id->hash, name);
65 else
66 id->hash = isl_hash_builtin(id->hash, user);
68 return id;
69 error:
70 free((char *)copy);
71 return NULL;
74 uint32_t isl_id_get_hash(__isl_keep isl_id *id)
76 return id ? id->hash : 0;
79 struct isl_name_and_user {
80 const char *name;
81 void *user;
84 static int isl_id_has_name_and_user(const void *entry, const void *val)
86 isl_id *id = (isl_id *)entry;
87 struct isl_name_and_user *nu = (struct isl_name_and_user *) val;
89 if (id->user != nu->user)
90 return 0;
91 if (!id->name && !nu->name)
92 return 1;
94 return !strcmp(id->name, nu->name);
97 __isl_give isl_id *isl_id_alloc(isl_ctx *ctx, const char *name, void *user)
99 struct isl_hash_table_entry *entry;
100 uint32_t id_hash;
101 struct isl_name_and_user nu = { name, user };
103 id_hash = isl_hash_init();
104 if (name)
105 id_hash = isl_hash_string(id_hash, name);
106 else
107 id_hash = isl_hash_builtin(id_hash, user);
108 entry = isl_hash_table_find(ctx, &ctx->id_table, id_hash,
109 isl_id_has_name_and_user, &nu, 1);
110 if (!entry)
111 return NULL;
112 if (entry->data)
113 return isl_id_copy(entry->data);
114 entry->data = id_alloc(ctx, name, user);
115 if (!entry->data)
116 ctx->id_table.n--;
117 return entry->data;
120 /* If the id has a negative refcount, then it is a static isl_id
121 * which should not be changed.
123 __isl_give isl_id *isl_id_copy(isl_id *id)
125 if (!id)
126 return NULL;
128 if (id->ref < 0)
129 return id;
131 id->ref++;
132 return id;
135 /* Compare two isl_ids.
137 * The order is fairly arbitrary. We do keep the comparison of
138 * the user pointers as a last resort since these pointer values
139 * may not be stable across different systems or even different runs.
141 int isl_id_cmp(__isl_keep isl_id *id1, __isl_keep isl_id *id2)
143 if (id1 == id2)
144 return 0;
145 if (!id1)
146 return -1;
147 if (!id2)
148 return 1;
149 if (!id1->name != !id2->name)
150 return !id1->name - !id2->name;
151 if (id1->name) {
152 int cmp = strcmp(id1->name, id2->name);
153 if (cmp != 0)
154 return cmp;
156 if (id1->user < id2->user)
157 return -1;
158 else
159 return 1;
162 static int isl_id_eq(const void *entry, const void *name)
164 return entry == name;
167 uint32_t isl_hash_id(uint32_t hash, __isl_keep isl_id *id)
169 if (id)
170 isl_hash_hash(hash, id->hash);
172 return hash;
175 /* Replace the free_user callback by "free_user".
177 __isl_give isl_id *isl_id_set_free_user(__isl_take isl_id *id,
178 __isl_give void (*free_user)(void *user))
180 if (!id)
181 return NULL;
183 id->free_user = free_user;
185 return id;
188 /* If the id has a negative refcount, then it is a static isl_id
189 * and should not be freed.
191 __isl_null isl_id *isl_id_free(__isl_take isl_id *id)
193 struct isl_hash_table_entry *entry;
195 if (!id)
196 return NULL;
198 if (id->ref < 0)
199 return NULL;
201 if (--id->ref > 0)
202 return NULL;
204 entry = isl_hash_table_find(id->ctx, &id->ctx->id_table, id->hash,
205 isl_id_eq, id, 0);
206 if (!entry)
207 isl_die(id->ctx, isl_error_unknown,
208 "unable to find id", (void)0);
209 else
210 isl_hash_table_remove(id->ctx, &id->ctx->id_table, entry);
212 if (id->free_user)
213 id->free_user(id->user);
215 free((char *)id->name);
216 isl_ctx_deref(id->ctx);
217 free(id);
219 return NULL;
222 __isl_give isl_printer *isl_printer_print_id(__isl_take isl_printer *p,
223 __isl_keep isl_id *id)
225 if (!id)
226 goto error;
228 if (id->name)
229 p = isl_printer_print_str(p, id->name);
230 if (id->user) {
231 char buffer[50];
232 snprintf(buffer, sizeof(buffer), "@%p", id->user);
233 p = isl_printer_print_str(p, buffer);
235 return p;
236 error:
237 isl_printer_free(p);
238 return NULL;