Lines Matching defs:map
1568 struct hashmap *str_off_map; /* map string offsets from src to dst */
3024 * `btf_dedup->map` array. This map is also used to record STRUCT/UNION that
3116 * This is a map from any type's signature hash to a list of possible
3123 /* Canonical types map */
3124 __u32 *map;
3188 free(d->map);
3189 d->map = NULL;
3238 d->map = malloc(sizeof(__u32) * type_cnt);
3239 if (!d->map) {
3244 d->map[0] = 0;
3250 d->map[i] = i;
3252 d->map[i] = BTF_UNPROCESSED_ID;
3689 d->map[type_id] = type_id;
3798 d->map[cand_id] = type_id;
3820 d->map[type_id] = new_id;
3844 return d->map[type_id] <= BTF_MAX_NR_TYPES;
3854 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id)
3855 type_id = d->map[type_id];
3870 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id)
3871 type_id = d->map[type_id];
3947 * already have some mapping in hypothetical map, we check for two possible
3991 * map. To handle this problem, we allow to follow FWD -> STRUCT/UNION
4239 d->map[c_id] = t_id;
4250 d->map[t_id] = c_id;
4257 * as a perf optimization, we can map struct/union
4262 d->map[t_id] = c_id;
4281 * potentially map other structs/unions to their canonical representatives,
4286 * as canonical for itself and is added into btf_dedup->dedup_table hash map
4299 if (d->map[type_id] <= BTF_MAX_NR_TYPES)
4340 d->map[type_id] = new_id;
4392 if (d->map[type_id] == BTF_IN_PROGRESS_ID)
4394 if (d->map[type_id] <= BTF_MAX_NR_TYPES)
4398 d->map[type_id] = BTF_IN_PROGRESS_ID;
4502 d->map[type_id] = new_id;
4525 * Collect a map from type names to type ids for all canonical structs
4539 * available structs in the map.
4549 if (type_id != d->map[type_id])
4575 if (type_id != d->map[type_id])
4591 d->map[type_id] = cand_id;
4659 * a map from original type ID to a new compacted type ID, which will be used
4682 if (d->map[id] != id)
4735 * differ from original ones. The map from original to a corresponding