vdev_raidz.c (236155) | vdev_raidz.c (240415) |
---|---|
1/* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE --- 267 unchanged lines hidden (view full) --- 276 kmem_free(rm, offsetof(raidz_map_t, rm_col[rm->rm_scols])); 277} 278 279static void 280vdev_raidz_map_free_vsd(zio_t *zio) 281{ 282 raidz_map_t *rm = zio->io_vsd; 283 | 1/* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE --- 267 unchanged lines hidden (view full) --- 276 kmem_free(rm, offsetof(raidz_map_t, rm_col[rm->rm_scols])); 277} 278 279static void 280vdev_raidz_map_free_vsd(zio_t *zio) 281{ 282 raidz_map_t *rm = zio->io_vsd; 283 |
284 ASSERT3U(rm->rm_freed, ==, 0); | 284 ASSERT0(rm->rm_freed); |
285 rm->rm_freed = 1; 286 287 if (rm->rm_reports == 0) 288 vdev_raidz_map_free(rm); 289} 290 291/*ARGSUSED*/ 292static void --- 836 unchanged lines hidden (view full) --- 1129 } 1130 1131 /* 1132 * For each of the rows of interest, we must normalize it and subtract 1133 * a multiple of it from the other rows. 1134 */ 1135 for (i = 0; i < nmissing; i++) { 1136 for (j = 0; j < missing[i]; j++) { | 285 rm->rm_freed = 1; 286 287 if (rm->rm_reports == 0) 288 vdev_raidz_map_free(rm); 289} 290 291/*ARGSUSED*/ 292static void --- 836 unchanged lines hidden (view full) --- 1129 } 1130 1131 /* 1132 * For each of the rows of interest, we must normalize it and subtract 1133 * a multiple of it from the other rows. 1134 */ 1135 for (i = 0; i < nmissing; i++) { 1136 for (j = 0; j < missing[i]; j++) { |
1137 ASSERT3U(rows[i][j], ==, 0); | 1137 ASSERT0(rows[i][j]); |
1138 } 1139 ASSERT3U(rows[i][missing[i]], !=, 0); 1140 1141 /* 1142 * Compute the inverse of the first element and multiply each 1143 * element in the row by that value. 1144 */ 1145 log = 255 - vdev_raidz_log2[rows[i][missing[i]]]; --- 24 unchanged lines hidden (view full) --- 1170 * Verify that the data that is left in the rows are properly part of 1171 * an identity matrix. 1172 */ 1173 for (i = 0; i < nmissing; i++) { 1174 for (j = 0; j < n; j++) { 1175 if (j == missing[i]) { 1176 ASSERT3U(rows[i][j], ==, 1); 1177 } else { | 1138 } 1139 ASSERT3U(rows[i][missing[i]], !=, 0); 1140 1141 /* 1142 * Compute the inverse of the first element and multiply each 1143 * element in the row by that value. 1144 */ 1145 log = 255 - vdev_raidz_log2[rows[i][missing[i]]]; --- 24 unchanged lines hidden (view full) --- 1170 * Verify that the data that is left in the rows are properly part of 1171 * an identity matrix. 1172 */ 1173 for (i = 0; i < nmissing; i++) { 1174 for (j = 0; j < n; j++) { 1175 if (j == missing[i]) { 1176 ASSERT3U(rows[i][j], ==, 1); 1177 } else { |
1178 ASSERT3U(rows[i][j], ==, 0); | 1178 ASSERT0(rows[i][j]); |
1179 } 1180 } 1181 } 1182} 1183 1184static void 1185vdev_raidz_matrix_reconstruct(raidz_map_t *rm, int n, int nmissing, 1186 int *missing, uint8_t **invrows, const uint8_t *used) --- 964 unchanged lines hidden --- | 1179 } 1180 } 1181 } 1182} 1183 1184static void 1185vdev_raidz_matrix_reconstruct(raidz_map_t *rm, int n, int nmissing, 1186 int *missing, uint8_t **invrows, const uint8_t *used) --- 964 unchanged lines hidden --- |