linux-master/kernel/user_namespace.c

292  * map_id_range_down_base - Find idmap via binary search in static extent array.
304 	/* Find the matching extent */
306 		first = map->extent[idx].first;
307 		last = first + map->extent[idx].count - 1;
310 			return &map->extent[idx];
317 	struct uid_gid_extent *extent;
322 		extent = map_id_range_down_base(extents, map, id, count);
324 		extent = map_id_range_down_max(extents, map, id, count);
327 	if (extent)
328 		id = (id - extent->first) + extent->lower_first;
341  * map_id_up_base - Find idmap via binary search in static extent array.
351 	/* Find the matching extent */
353 		first = map->extent[idx].lower_first;
354 		last = first + map->extent[idx].count - 1;
356 			return &map->extent[idx];
380 	struct uid_gid_extent *extent;
385 		extent = map_id_up_base(extents, map, id);
387 		extent = map_id_up_max(extents, map, id);
390 	if (extent)
391 		id = (id - extent->lower_first) + extent->first;
605 	struct uid_gid_extent *extent = v;
613 	lower = from_kuid(lower_ns, KUIDT_INIT(extent->lower_first));
616 		extent->first,
618 		extent->count);
626 	struct uid_gid_extent *extent = v;
634 	lower = from_kgid(lower_ns, KGIDT_INIT(extent->lower_first));
637 		extent->first,
639 		extent->count);
647 	struct uid_gid_extent *extent = v;
655 	lower = from_kprojid(lower_ns, KPROJIDT_INIT(extent->lower_first));
658 		extent->first,
660 		extent->count);
676 		return &map->extent[pos];
735 			     struct uid_gid_extent *extent)
740 	upper_first = extent->first;
741 	lower_first = extent->lower_first;
742 	upper_last = upper_first + extent->count - 1;
743 	lower_last = lower_first + extent->count - 1;
751 			prev = &new_map->extent[idx];
760 		/* Does the upper range intersect a previous extent? */
765 		/* Does the lower range intersect a previous extent? */
774  * insert_extent - Safely insert a new idmap extent into struct uid_gid_map.
778 static int insert_extent(struct uid_gid_map *map, struct uid_gid_extent *extent)
795 		memcpy(forward, map->extent,
796 		       map->nr_extents * sizeof(map->extent[0]));
803 		dest = &map->extent[map->nr_extents];
807 	*dest = *extent;
891 			extent0 = &new_map->extent[idx];
933 	struct uid_gid_extent extent;
995 		extent.first = simple_strtoul(pos, &pos, 10);
1000 		extent.lower_first = simple_strtoul(pos, &pos, 10);
1005 		extent.count = simple_strtoul(pos, &pos, 10);
1015 		if ((extent.first == (u32) -1) ||
1016 		    (extent.lower_first == (u32) -1))
1020 		 * extent to wrap
1022 		if ((extent.first + extent.count) <= extent.first)
1024 		if ((extent.lower_first + extent.count) <=
1025 		     extent.lower_first)
1028 		/* Do the ranges in extent overlap any previous extents? */
1029 		if (mappings_overlap(&new_map, &extent))
1036 		ret = insert_extent(&new_map, &extent);
1059 			e = &new_map.extent[idx];
1067 		/* Fail if we can not map the specified extent to
1077 	 * If we want to use binary search for lookup, this clones the extent
1086 		memcpy(map->extent, new_map.extent,
1087 		       new_map.nr_extents * sizeof(new_map.extent[0]));
1175 	if ((new_map->nr_extents == 1) && (new_map->extent[0].count == 1) &&
1177 		u32 id = new_map->extent[0].lower_first;