3006 VERIFY[S,U,P] and ASSERT[S,U,P] frequently check if first argument is zero

*** 279,289 ****
  static void
  vdev_raidz_map_free_vsd(zio_t *zio)
  {
          raidz_map_t *rm = zio->io_vsd;
  
!         ASSERT3U(rm->rm_freed, ==, 0);
          rm->rm_freed = 1;
  
          if (rm->rm_reports == 0)
                  vdev_raidz_map_free(rm);
  }
--- 279,289 ----
  static void
  vdev_raidz_map_free_vsd(zio_t *zio)
  {
          raidz_map_t *rm = zio->io_vsd;
  
!         ASSERT0(rm->rm_freed);
          rm->rm_freed = 1;
  
          if (rm->rm_reports == 0)
                  vdev_raidz_map_free(rm);
  }
*** 1132,1142 ****
           * For each of the rows of interest, we must normalize it and subtract
           * a multiple of it from the other rows.
           */
          for (i = 0; i < nmissing; i++) {
                  for (j = 0; j < missing[i]; j++) {
!                         ASSERT3U(rows[i][j], ==, 0);
                  }
                  ASSERT3U(rows[i][missing[i]], !=, 0);
  
                  /*
                   * Compute the inverse of the first element and multiply each
--- 1132,1142 ----
           * For each of the rows of interest, we must normalize it and subtract
           * a multiple of it from the other rows.
           */
          for (i = 0; i < nmissing; i++) {
                  for (j = 0; j < missing[i]; j++) {
!                         ASSERT0(rows[i][j]);
                  }
                  ASSERT3U(rows[i][missing[i]], !=, 0);
  
                  /*
                   * Compute the inverse of the first element and multiply each
*** 1173,1183 ****
          for (i = 0; i < nmissing; i++) {
                  for (j = 0; j < n; j++) {
                          if (j == missing[i]) {
                                  ASSERT3U(rows[i][j], ==, 1);
                          } else {
!                                 ASSERT3U(rows[i][j], ==, 0);
                          }
                  }
          }
  }
  
--- 1173,1183 ----
          for (i = 0; i < nmissing; i++) {
                  for (j = 0; j < n; j++) {
                          if (j == missing[i]) {
                                  ASSERT3U(rows[i][j], ==, 1);
                          } else {
!                                 ASSERT0(rows[i][j]);
                          }
                  }
          }
  }