| /kernel/liteos_a/kernel/extended/container/ |
| H A D | los_user_container.c | 86 userContainer->uidMap.extent[0].count = 4294967295U; in OsCreateUserContainer()
88 userContainer->gidMap.extent[0].count = 4294967295U; in OsCreateUserContainer()
116 first = map->extent[idx].lowerFirst; in MapIdUpBase()
117 last = first + map->extent[idx].count - 1; in MapIdUpBase()
119 return &map->extent[idx]; in MapIdUpBase()
132 UidGidExtent *extent = MapIdUpBase(extents, map, id); in MapIdUp() local
133 if (extent != NULL) { in MapIdUp()
134 return ((id - extent->lowerFirst) + extent->first); in MapIdUp()
177 first = map->extent[id in MapIdRangeDownBase()
193 UidGidExtent *extent = MapIdRangeDownBase(extents, map, id, count); MapIdRangeDown() local
216 InsertExtent(UidGidMap *idMap, UidGidExtent *extent) InsertExtent() argument
229 MappingsOverlap(UidGidMap *idMap, UidGidExtent *extent) MappingsOverlap() argument
296 ParsePosData(CHAR *pos, UidGidExtent *extent) ParsePosData() argument
324 ParseUserData(CHAR *kbuf, UidGidExtent *extent, UidGidMap *newMap) ParseUserData() argument
387 UidGidExtent *extent = &newMap->extent[idx]; ParentMapIdRange() local
402 UidGidExtent extent; OsUserContainerMapWrite() local
[all...] |
| /kernel/linux/linux-5.10/kernel/ |
| H A D | user_namespace.c | 268 * map_id_range_down_base - Find idmap via binary search in static extent array.
280 /* Find the matching extent */ in map_id_range_down_base()
282 first = map->extent[idx].first; in map_id_range_down_base()
283 last = first + map->extent[idx].count - 1; in map_id_range_down_base()
286 return &map->extent[idx]; in map_id_range_down_base()
293 struct uid_gid_extent *extent; in map_id_range_down() local
298 extent = map_id_range_down_base(extents, map, id, count); in map_id_range_down()
300 extent = map_id_range_down_max(extents, map, id, count); in map_id_range_down()
303 if (extent) in map_id_range_down()
304 id = (id - extent in map_id_range_down()
356 struct uid_gid_extent *extent; map_id_up() local
581 struct uid_gid_extent *extent = v; uid_m_show() local
602 struct uid_gid_extent *extent = v; gid_m_show() local
623 struct uid_gid_extent *extent = v; projid_m_show() local
710 mappings_overlap(struct uid_gid_map *new_map, struct uid_gid_extent *extent) mappings_overlap() argument
754 insert_extent(struct uid_gid_map *map, struct uid_gid_extent *extent) insert_extent() argument
909 struct uid_gid_extent extent; map_write() local
[all...] |
| H A D | user.c | 31 .extent[0] = {
41 .extent[0] = {
51 .extent[0] = {
|
| /kernel/linux/linux-6.6/kernel/ |
| H A D | user_namespace.c | 289 * map_id_range_down_base - Find idmap via binary search in static extent array.
301 /* Find the matching extent */ in map_id_range_down_base()
303 first = map->extent[idx].first; in map_id_range_down_base()
304 last = first + map->extent[idx].count - 1; in map_id_range_down_base()
307 return &map->extent[idx]; in map_id_range_down_base()
314 struct uid_gid_extent *extent; in map_id_range_down() local
319 extent = map_id_range_down_base(extents, map, id, count); in map_id_range_down()
321 extent = map_id_range_down_max(extents, map, id, count); in map_id_range_down()
324 if (extent) in map_id_range_down()
325 id = (id - extent in map_id_range_down()
377 struct uid_gid_extent *extent; map_id_up() local
602 struct uid_gid_extent *extent = v; uid_m_show() local
623 struct uid_gid_extent *extent = v; gid_m_show() local
644 struct uid_gid_extent *extent = v; projid_m_show() local
731 mappings_overlap(struct uid_gid_map *new_map, struct uid_gid_extent *extent) mappings_overlap() argument
775 insert_extent(struct uid_gid_map *map, struct uid_gid_extent *extent) insert_extent() argument
930 struct uid_gid_extent extent; map_write() local
[all...] |
| H A D | user.c | 31 .extent[0] = {
41 .extent[0] = {
51 .extent[0] = {
|
| /kernel/linux/linux-5.10/fs/hfs/ |
| H A D | extent.c | 2 * linux/fs/hfs/extent.c
34 * comparing extent B-tree entries, the file id is the most
72 * Find a block within an extent record
150 static inline int __hfs_ext_read_extent(struct hfs_find_data *fd, struct hfs_extent *extent, in __hfs_ext_read_extent() argument
165 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, sizeof(hfs_extent_rec)); in __hfs_ext_read_extent()
208 static void hfs_dump_extent(struct hfs_extent *extent) in hfs_dump_extent() argument
215 be16_to_cpu(extent[i].block), in hfs_dump_extent()
216 be16_to_cpu(extent[i].count)); in hfs_dump_extent()
220 static int hfs_add_extent(struct hfs_extent *extent, u16 offset, in hfs_add_extent() argument
226 hfs_dump_extent(extent); in hfs_add_extent()
248 hfs_free_extents(struct super_block *sb, struct hfs_extent *extent, u16 offset, u16 block_nr) hfs_free_extents() argument
292 struct hfs_extent *extent; hfs_free_fork() local
[all...] |
| /kernel/linux/linux-6.6/fs/hfs/ |
| H A D | extent.c | 2 * linux/fs/hfs/extent.c
34 * comparing extent B-tree entries, the file id is the most
72 * Find a block within an extent record
150 static inline int __hfs_ext_read_extent(struct hfs_find_data *fd, struct hfs_extent *extent, in __hfs_ext_read_extent() argument
165 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, sizeof(hfs_extent_rec)); in __hfs_ext_read_extent()
208 static void hfs_dump_extent(struct hfs_extent *extent) in hfs_dump_extent() argument
215 be16_to_cpu(extent[i].block), in hfs_dump_extent()
216 be16_to_cpu(extent[i].count)); in hfs_dump_extent()
220 static int hfs_add_extent(struct hfs_extent *extent, u16 offset, in hfs_add_extent() argument
226 hfs_dump_extent(extent); in hfs_add_extent()
248 hfs_free_extents(struct super_block *sb, struct hfs_extent *extent, u16 offset, u16 block_nr) hfs_free_extents() argument
292 struct hfs_extent *extent; hfs_free_fork() local
[all...] |
| /kernel/linux/linux-5.10/arch/parisc/math-emu/ |
| H A D | sfadd.c | 42 register unsigned int left, right, result, extent; in sgl_fadd() local
263 * beyond the extent of the extension. A further optimization in sgl_fadd()
274 /*and lower to*/extent); in sgl_fadd()
284 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fadd()
298 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fadd()
318 * was normalized, so extent (guard, round) was zero */ in sgl_fadd()
325 Ext_leftshiftby1(extent); in sgl_fadd()
331 * operand was normalized, so extent (guard, round) was zero */ in sgl_fadd()
337 Ext_leftshiftby1(extent); in sgl_fadd()
415 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fadd()
[all...] |
| H A D | sfsub.c | 42 register unsigned int left, right, result, extent; in sgl_fsub() local
266 * beyond the extent of the extension. A further optimization in sgl_fsub()
277 /*and lower to*/extent); in sgl_fsub()
287 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fsub()
301 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fsub()
321 * was normalized, so extent (guard, round) was zero */ in sgl_fsub()
328 Ext_leftshiftby1(extent); in sgl_fsub()
334 * operand was normalized, so extent (guard, round) was zero */ in sgl_fsub()
340 Ext_leftshiftby1(extent); in sgl_fsub()
418 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fsub()
[all...] |
| H A D | dfadd.c | 42 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fadd() local
267 * beyond the extent of the extension. A further optimization in dbl_fadd()
278 /*and lower to*/extent); in dbl_fadd()
289 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fadd()
303 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fadd()
323 * was normalized, so extent (guard, round) was zero */ in dbl_fadd()
330 Ext_leftshiftby1(extent); in dbl_fadd()
336 * operand was normalized, so extent (guard, round) was zero */ in dbl_fadd()
342 Ext_leftshiftby1(extent); in dbl_fadd()
420 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fadd()
[all...] |
| H A D | dfsub.c | 43 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fsub() local
270 * beyond the extent of the extension. A further optimization in dbl_fsub()
281 /*and lower to*/extent); in dbl_fsub()
292 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fsub()
306 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fsub()
326 * was normalized, so extent (guard, round) was zero */ in dbl_fsub()
333 Ext_leftshiftby1(extent); in dbl_fsub()
339 * operand was normalized, so extent (guard, round) was zero */ in dbl_fsub()
345 Ext_leftshiftby1(extent); in dbl_fsub()
423 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fsub()
[all...] |
| H A D | float.h | 530 #define Ext_isone_sign(extent) (Extsign(extent))
531 #define Ext_isnotzero(extent) \
532 (Extall(extent))
533 #define Ext_isnotzero_lower(extent) \
534 (Extlow31(extent))
535 #define Ext_leftshiftby1(extent) \
536 Extall(extent) <<= 1
537 #define Ext_negate(extent) \
538 (int )Extall(extent)
[all...] |
| /kernel/linux/linux-6.6/arch/parisc/math-emu/ |
| H A D | sfsub.c | 42 register unsigned int left, right, result, extent; in sgl_fsub() local
266 * beyond the extent of the extension. A further optimization in sgl_fsub()
277 /*and lower to*/extent); in sgl_fsub()
287 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fsub()
301 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fsub()
321 * was normalized, so extent (guard, round) was zero */ in sgl_fsub()
328 Ext_leftshiftby1(extent); in sgl_fsub()
334 * operand was normalized, so extent (guard, round) was zero */ in sgl_fsub()
340 Ext_leftshiftby1(extent); in sgl_fsub()
418 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fsub()
[all...] |
| H A D | sfadd.c | 42 register unsigned int left, right, result, extent; in sgl_fadd() local
263 * beyond the extent of the extension. A further optimization in sgl_fadd()
274 /*and lower to*/extent); in sgl_fadd()
284 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); in sgl_fadd()
298 Sgl_leftshiftby1_withextent(result,extent,result); in sgl_fadd()
318 * was normalized, so extent (guard, round) was zero */ in sgl_fadd()
325 Ext_leftshiftby1(extent); in sgl_fadd()
331 * operand was normalized, so extent (guard, round) was zero */ in sgl_fadd()
337 Ext_leftshiftby1(extent); in sgl_fadd()
415 Sgl_right_align(result,/*by*/(1-result_exponent),extent); in sgl_fadd()
[all...] |
| H A D | dfadd.c | 42 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fadd() local
267 * beyond the extent of the extension. A further optimization in dbl_fadd()
278 /*and lower to*/extent); in dbl_fadd()
289 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fadd()
303 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fadd()
323 * was normalized, so extent (guard, round) was zero */ in dbl_fadd()
330 Ext_leftshiftby1(extent); in dbl_fadd()
336 * operand was normalized, so extent (guard, round) was zero */ in dbl_fadd()
342 Ext_leftshiftby1(extent); in dbl_fadd()
420 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fadd()
[all...] |
| H A D | dfsub.c | 43 register unsigned int leftp1, leftp2, rightp1, rightp2, extent; in dbl_fsub() local
270 * beyond the extent of the extension. A further optimization in dbl_fsub()
281 /*and lower to*/extent); in dbl_fsub()
292 /*with*/extent,/*into*/resultp1,resultp2); in dbl_fsub()
306 Dbl_leftshiftby1_withextent(resultp1,resultp2,extent,resultp1,resultp2); in dbl_fsub()
326 * was normalized, so extent (guard, round) was zero */ in dbl_fsub()
333 Ext_leftshiftby1(extent); in dbl_fsub()
339 * operand was normalized, so extent (guard, round) was zero */ in dbl_fsub()
345 Ext_leftshiftby1(extent); in dbl_fsub()
423 Dbl_fix_overshift(resultp1,resultp2,(1-result_exponent),extent); in dbl_fsub()
[all...] |
| H A D | float.h | 530 #define Ext_isone_sign(extent) (Extsign(extent))
531 #define Ext_isnotzero(extent) \
532 (Extall(extent))
533 #define Ext_isnotzero_lower(extent) \
534 (Extlow31(extent))
535 #define Ext_leftshiftby1(extent) \
536 Extall(extent) <<= 1
537 #define Ext_negate(extent) \
538 (int )Extall(extent)
[all...] |
| /kernel/linux/linux-5.10/fs/hfsplus/ |
| H A D | extents.c | 157 struct hfsplus_extent *extent, in __hfsplus_ext_read_extent()
172 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, in __hfsplus_ext_read_extent()
263 * hfsplus_ext_read_extent will write out a cached extent into in hfsplus_get_block()
265 * dirty even for a pure read of an extent here. in hfsplus_get_block()
297 static void hfsplus_dump_extent(struct hfsplus_extent *extent) in hfsplus_dump_extent() argument
304 be32_to_cpu(extent[i].start_block), in hfsplus_dump_extent()
305 be32_to_cpu(extent[i].block_count)); in hfsplus_dump_extent()
309 static int hfsplus_add_extent(struct hfsplus_extent *extent, u32 offset, in hfsplus_add_extent() argument
315 hfsplus_dump_extent(extent); in hfsplus_add_extent()
316 for (i = 0; i < 8; extent in hfsplus_add_extent()
156 __hfsplus_ext_read_extent(struct hfs_find_data *fd, struct hfsplus_extent *extent, u32 cnid, u32 block, u8 type) __hfsplus_ext_read_extent() argument
337 hfsplus_free_extents(struct super_block *sb, struct hfsplus_extent *extent, u32 offset, u32 block_nr) hfsplus_free_extents() argument
[all...] |
| H A D | wrapper.c | 97 u32 extent; in hfsplus_read_mdb() local
120 extent = get_unaligned_be32(bufptr + HFSP_WRAPOFF_EMBEDEXT); in hfsplus_read_mdb()
121 wd->embed_start = (extent >> 16) & 0xFFFF; in hfsplus_read_mdb()
122 wd->embed_count = extent & 0xFFFF; in hfsplus_read_mdb()
|
| /kernel/linux/linux-6.6/fs/hfsplus/ |
| H A D | extents.c | 157 struct hfsplus_extent *extent, in __hfsplus_ext_read_extent()
172 hfs_bnode_read(fd->bnode, extent, fd->entryoffset, in __hfsplus_ext_read_extent()
263 * hfsplus_ext_read_extent will write out a cached extent into in hfsplus_get_block()
265 * dirty even for a pure read of an extent here. in hfsplus_get_block()
297 static void hfsplus_dump_extent(struct hfsplus_extent *extent) in hfsplus_dump_extent() argument
304 be32_to_cpu(extent[i].start_block), in hfsplus_dump_extent()
305 be32_to_cpu(extent[i].block_count)); in hfsplus_dump_extent()
309 static int hfsplus_add_extent(struct hfsplus_extent *extent, u32 offset, in hfsplus_add_extent() argument
315 hfsplus_dump_extent(extent); in hfsplus_add_extent()
316 for (i = 0; i < 8; extent in hfsplus_add_extent()
156 __hfsplus_ext_read_extent(struct hfs_find_data *fd, struct hfsplus_extent *extent, u32 cnid, u32 block, u8 type) __hfsplus_ext_read_extent() argument
337 hfsplus_free_extents(struct super_block *sb, struct hfsplus_extent *extent, u32 offset, u32 block_nr) hfsplus_free_extents() argument
[all...] |
| H A D | wrapper.c | 95 u32 extent; in hfsplus_read_mdb() local
118 extent = get_unaligned_be32(bufptr + HFSP_WRAPOFF_EMBEDEXT); in hfsplus_read_mdb()
119 wd->embed_start = (extent >> 16) & 0xFFFF; in hfsplus_read_mdb()
120 wd->embed_count = extent & 0xFFFF; in hfsplus_read_mdb()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | Makefile | 25 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
35 subpage.o tree-mod-log.o extent-io-tree.o fs.o messages.o bio.o \
45 tests/extent-buffer-tests.o tests/btrfs-tests.o \
46 tests/extent-io-tests.o tests/inode-tests.o tests/qgroup-tests.o \
47 tests/free-space-tree-tests.o tests/extent-map-tests.o
|
| /kernel/linux/linux-6.6/mm/ |
| H A D | mremap.c | 410 * Returns an extent of the corresponding size for the pgt_entry specified if
411 * valid. Else returns a smaller extent bounded by the end of the source and
418 unsigned long next, extent, mask, size; in get_extent() local
437 /* even if next overflowed, extent below will be ok */ in get_extent()
438 extent = next - old_addr; in get_extent()
439 if (extent > old_end - old_addr) in get_extent()
440 extent = old_end - old_addr; in get_extent()
442 if (extent > next - new_addr) in get_extent()
443 extent = next - new_addr; in get_extent()
444 return extent; in get_extent()
497 unsigned long extent, old_end; move_page_tables() local
[all...] |
| /kernel/linux/linux-5.10/mm/ |
| H A D | mremap.c | 259 unsigned long extent, next, old_end; in move_page_tables() local
273 for (; old_addr < old_end; old_addr += extent, new_addr += extent) { in move_page_tables()
276 /* even if next overflowed, extent below will be ok */ in move_page_tables()
277 extent = next - old_addr; in move_page_tables()
278 if (extent > old_end - old_addr) in move_page_tables()
279 extent = old_end - old_addr; in move_page_tables()
281 if (extent > next - new_addr) in move_page_tables()
282 extent = next - new_addr; in move_page_tables()
290 if (extent in move_page_tables()
[all...] |
| /kernel/linux/linux-5.10/fs/ |
| H A D | ioctl.c | 100 * @flags: FIEMAP_EXTENT flags that describe this extent
102 * Called from file system ->fiemap callback. Will populate extent
104 * success, extent count on fieinfo is incremented.
107 * extent that will fit in user array.
115 struct fiemap_extent extent; in fiemap_fill_next_extent() local
134 memset(&extent, 0, sizeof(extent)); in fiemap_fill_next_extent()
135 extent.fe_logical = logical; in fiemap_fill_next_extent()
136 extent.fe_physical = phys; in fiemap_fill_next_extent()
137 extent in fiemap_fill_next_extent()
[all...] |