Lines Matching refs:row
175 uint_t row;
177 for (row = 0; (row < stripep->rows.rows_len); ++row) {
178 md_row_t *rp = &stripep->rows.rows_val[row];
208 uint_t row;
259 for (row = 0; (row < ms->un_nrows); ++row) {
260 struct ms_row *mdr = &ms->un_row[row];
262 md_row_t *rp = &stripep->rows.rows_val[row];
312 ! ((row == 0) && (comp == 0)))
342 ! ((row == 0) && (comp == 0)))
405 uint_t row;
415 for (row = 0; (row < stripep->rows.rows_len); ++row) {
416 md_row_t *rp = &stripep->rows.rows_val[row];
560 uint_t row;
583 for (row = 0; (row < stripep->rows.rows_len); ++row) {
584 md_row_t *rp = &stripep->rows.rows_val[row];
607 if (row != (stripep->rows.rows_len - 1))
667 * print subdevice stripe row
833 * print toplevel stripe row
980 uint_t row;
1057 for (row = 0; (row < stripep->rows.rows_len); ++row) {
1058 md_row_t *rp = &stripep->rows.rows_val[row];
1064 row, rp->interlace) == EOF) {
1070 row) == EOF) {
1118 int row, comp;
1174 for (row = 0; (row < stripep->rows.rows_len); ++row) {
1175 md_row_t *rp = &stripep->rows.rows_val[row];
1208 uint_t row;
1220 for (row = 0; (row < stripep->rows.rows_len); ++row) {
1221 md_row_t *rp = &stripep->rows.rows_val[row];
1234 for (row = 0; (row < stripep->rows.rows_len); ++row) {
1235 md_row_t *rp = &stripep->rows.rows_val[row];
1270 uint_t row;
1274 for (row = 0; (row < stripep->rows.rows_len); ++row) {
1275 md_row_t *rp = &stripep->rows.rows_val[row];
1305 uint_t row;
1375 for (row = 0; (row < old_un->un_nrows); row++)
1376 ncomps += mdr[row].un_ncomp;
1632 uint_t row,
1641 thisnp = stripep->rows.rows_val[row].comps.comps_val[comp].compnamep;
1642 for (r = 0; (r <= row); ++r) {
1644 uint_t e = ((r == row) ? comp : rp->comps.comps_len);
1708 uint_t row;
1715 for (row = 0; (row < stripep->rows.rows_len); ++row) {
1716 md_row_t *rp = &stripep->rows.rows_val[row];
1764 if (check_twice(stripep, row, comp, ep) != 0)
1795 uint_t row;
1802 for (row = 0; (row < nrow); ++row) {
1803 md_row_t *rp = &stripep->rows.rows_val[row];
1862 * arrangements where in the sum of the lengths of each row
1864 * only component in the first row.
1932 uint_t row;
1948 for (row = 0; (row < nrow); ++row) {
1949 md_row_t *rp = &stripep->rows.rows_val[row];
1962 for (row = 0; (row < nrow); ++row) {
1963 md_row_t *rp = &stripep->rows.rows_val[row];
1965 struct ms_row *mdr = &ms->un_row[row];
1990 if ((row == 0) && (comp == 0)) {
2013 * if this row is a stripe, as indicated by
2026 * row with only one component), this will
2050 /* setup row */
2077 for (row = 0; (row < nrow); ++row) {
2078 stripep->rows.rows_val[row].row_size =
2079 ms->un_row[row].un_blocks;
2169 uint_t nrow, row;
2234 for (row = 0; (row < nrow); ++row) {
2235 md_row_t *mdr = &stripep->rows.rows_val[row];
2280 /* parse row options */
2386 int row, comp;
2465 for (row = 0; (row < stripep->rows.rows_len); ++row) {
2466 md_row_t *rp = &stripep->rows.rows_val[row];
2499 int row;
2506 for (row = 0; row < stripep->rows.rows_len; ++row) {
2507 md_row_t *rp = &stripep->rows.rows_val[row];