Lines Matching defs:map
1830 struct hashmap *str_off_map; /* map string offsets from src to dst */
3286 * `btf_dedup->map` array. This map is also used to record STRUCT/UNION that
3378 * This is a map from any type's signature hash to a list of possible
3385 /* Canonical types map */
3386 __u32 *map;
3450 free(d->map);
3451 d->map = NULL;
3500 d->map = malloc(sizeof(__u32) * type_cnt);
3501 if (!d->map) {
3506 d->map[0] = 0;
3512 d->map[i] = i;
3514 d->map[i] = BTF_UNPROCESSED_ID;
3951 d->map[type_id] = type_id;
4060 d->map[cand_id] = type_id;
4082 d->map[type_id] = new_id;
4106 return d->map[type_id] <= BTF_MAX_NR_TYPES;
4116 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id)
4117 type_id = d->map[type_id];
4132 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id)
4133 type_id = d->map[type_id];
4209 * already have some mapping in hypothetical map, we check for two possible
4253 * map. To handle this problem, we allow to follow FWD -> STRUCT/UNION
4501 d->map[c_id] = t_id;
4512 d->map[t_id] = c_id;
4519 * as a perf optimization, we can map struct/union
4524 d->map[t_id] = c_id;
4543 * potentially map other structs/unions to their canonical representatives,
4548 * as canonical for itself and is added into btf_dedup->dedup_table hash map
4561 if (d->map[type_id] <= BTF_MAX_NR_TYPES)
4602 d->map[type_id] = new_id;
4654 if (d->map[type_id] == BTF_IN_PROGRESS_ID)
4656 if (d->map[type_id] <= BTF_MAX_NR_TYPES)
4660 d->map[type_id] = BTF_IN_PROGRESS_ID;
4764 d->map[type_id] = new_id;
4787 * Collect a map from type names to type ids for all canonical structs
4801 * available structs in the map.
4811 if (type_id != d->map[type_id])
4837 if (type_id != d->map[type_id])
4853 d->map[type_id] = cand_id;
4921 * a map from original type ID to a new compacted type ID, which will be used
4944 if (d->map[id] != id)
4997 * differ from original ones. The map from original to a corresponding