Searched refs:isl_hash_table_find (Results 1 - 11 of 11) sorted by relevance

/haiku-buildtools/isl/
H A Disl_hmap_map_basic_set.c47 return !!isl_hash_table_find(ctx, &hmap->table, hash, &has_key, key, 0);
58 entry = isl_hash_table_find(ctx, &hmap->table, hash, &has_key, key, 0);
78 entry = isl_hash_table_find(ctx, &hmap->table, hash, &has_key, key, 1);
H A Disl_id.c103 entry = isl_hash_table_find(ctx, &ctx->id_table, id_hash,
172 entry = isl_hash_table_find(id->ctx, &id->ctx->id_table, id->hash,
H A Disl_hash.c75 * We reuse isl_hash_table_find to create entries in the extended table.
106 entry = isl_hash_table_find(ctx, table, entries[h].hash,
152 struct isl_hash_table_entry *isl_hash_table_find(struct isl_ctx *ctx, function
174 return isl_hash_table_find(ctx, table, key_hash, eq, val, 1);
H A Disl_union_templ.c137 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
175 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
399 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
590 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
693 entry = isl_hash_table_find(u->dim->ctx, &u->table,
888 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
H A Disl_union_map.c300 entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
448 entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
477 entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
531 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
686 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
875 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
926 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
977 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1025 entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1069 entry2 = isl_hash_table_find(dat
[all...]
H A Disl_stream.c47 entry = isl_hash_table_find(s->ctx, s->keywords, name_hash,
337 entry = isl_hash_table_find(s->ctx, s->keywords, name_hash, same_name,
H A Disl_convex_hull.c1586 entry = isl_hash_table_find(ctx, table, c_hash, max_constraint_equal,
1619 entry = isl_hash_table_find(ctx, table, c_hash, max_constraint_equal,
1686 entry = isl_hash_table_find(hull->ctx, table, c_hash,
2046 entry = isl_hash_table_find(ctx, table, c_hash, has_ineq, &v, 1);
2178 entry = isl_hash_table_find(hull->ctx, data->hull_table, c_hash,
2184 entry = isl_hash_table_find(hull->ctx, data->p[j].table,
2213 entry = isl_hash_table_find(hull->ctx, data->p[j].table,
2238 entry = isl_hash_table_find(hull->ctx, data->hull_table, c_hash,
H A Disl_fold.c900 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
1363 entry = isl_hash_table_find(ctx, &(*upwf)->table,
H A Disl_schedule.c222 entry = isl_hash_table_find(ctx, graph->node_table, hash,
243 entry = isl_hash_table_find(ctx, graph->node_table, hash,
268 entry = isl_hash_table_find(ctx, graph->edge_table[type], hash,
310 return isl_hash_table_find(ctx, graph->edge_table[type], hash,
H A Disl_tab_pip.c4207 entry = isl_hash_table_find(ctx, table, hash,
/haiku-buildtools/isl/include/isl/
H A Dhash.h63 struct isl_hash_table_entry *isl_hash_table_find(struct isl_ctx *ctx,

Completed in 64 milliseconds