Searched refs:udf_npart (Results 1 – 4 of 4) sorted by relevance
439 for (index = 0; index < udf_vfsp->udf_npart; index++) { in udf_statvfs()1125 for (i = 0; i < udf_vfsp->udf_npart; i++) { in ud_validate_and_fill_superblock()1146 udf_vfsp->udf_npart++; in ud_validate_and_fill_superblock()1147 pnew = kmem_zalloc(udf_vfsp->udf_npart * in ud_validate_and_fill_superblock()1153 (udf_vfsp->udf_npart - 1)); in ud_validate_and_fill_superblock()1156 (udf_vfsp->udf_npart - 1)); in ud_validate_and_fill_superblock()1158 part = pnew + (udf_vfsp->udf_npart - 1); in ud_validate_and_fill_superblock()1257 for (index = 0; index < udf_vfsp->udf_npart; index ++) { in ud_validate_and_fill_superblock()1536 udf_vfsp->udf_npart * sizeof (*udf_vfsp->udf_parts)); in ud_destroy_fsp()1569 if (i >= udf_vfsp->udf_npart) { in ud_convert_to_superblock()[all …]
154 for (i = 0; i < udf_vfsp->udf_npart; i++) { in ud_alloc_space()161 if (i == udf_vfsp->udf_npart) { in ud_alloc_space()705 for (i = 0; i < udf_vfsp->udf_npart; i++) { in ud_free_space()712 if (i == udf_vfsp->udf_npart) { in ud_free_space()1408 for (i = 0; i < udf_vfsp->udf_npart; i++, part++) { in ud_release_cache()
251 for (i = 0; i < udf_vfsp->udf_npart; i++) { in ud_xlate_to_daddr()286 for (i = 0; i < udf_vfsp->udf_npart; i++) { in ud_xlate_to_addr()560 8 * udf_vfsp->udf_npart + in ud_sbwrite()
185 int32_t udf_npart; /* No. of partition's in the volume */ member