Lines Matching defs:tgts
750 vdev_raidz_reconstruct_p(raidz_map_t *rm, int *tgts, int ntgts)
753 int x = tgts[0];
789 vdev_raidz_reconstruct_q(raidz_map_t *rm, int *tgts, int ntgts)
793 int x = tgts[0];
847 vdev_raidz_reconstruct_pq(raidz_map_t *rm, int *tgts, int ntgts)
852 int x = tgts[0];
853 int y = tgts[1];
1289 vdev_raidz_reconstruct_general(raidz_map_t *rm, int *tgts, int ntgts)
1313 if (tgts[t] >= rm->rm_firstdatacol) {
1315 tgts[t] - rm->rm_firstdatacol;
1330 if (c == tgts[tt]) {
1397 int tgts[VDEV_RAIDZ_MAXPARITY], *dt;
1405 * The tgts list must already be sorted.
1419 tgts[ntgts++] = c;
1422 tgts[ntgts++] = c;
1435 dt = &tgts[nbadparity];
1467 code = vdev_raidz_reconstruct_general(rm, tgts, ntgts);
1926 int *tgts = &tstore[1];
1935 tgts[-1] = -1;
1958 tgts[i] = c++;
1962 * Setting tgts[n] simplifies the other edge condition.
1964 tgts[n] = rm->rm_cols;
1976 next = tgts[current];
1979 tgts[current] = next;
1988 c = tgts[i];
1999 code = vdev_raidz_reconstruct(rm, tgts, n);
2004 c = tgts[i];
2021 c = tgts[i];
2031 for (next = tgts[current] + 1;
2036 ASSERT(next <= tgts[current + 1]);
2041 if (next != tgts[current + 1])
2048 for (c = tgts[current - 1] + 1;
2052 tgts[current] = c;
2101 int tgts[VDEV_RAIDZ_MAXPARITY];
2205 tgts[n++] = c;
2211 code = vdev_raidz_reconstruct(rm, tgts, n);