Search Options

Results per page
Sort
Preferred Languages
Advance

Results 201 - 210 of 1,661 for volumes (0.07 sec)

  1. buildscripts/minio-upgrade.sh

    		-f "buildscripts/upgrade-tests/compose.yml" \
    		rm || true
    
    	for volume in $(docker volume ls -q | grep upgrade); do
    		docker volume rm ${volume} || true
    	done
    
    	docker volume prune -f
    	docker system prune -f || true
    	docker volume prune -f || true
    	docker volume rm $(docker volume ls -q -f dangling=true) || true
    }
    
    verify_checksum_after_heal() {
    	local sum1
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jun 13 05:08:11 UTC 2024
    - 2.6K bytes
    - Viewed (0)
  2. cmd/storage-datatypes.go

    }
    
    // VolsInfo is a collection of volume(bucket) information
    type VolsInfo []VolInfo
    
    // VolInfo - represents volume stat information.
    // The above means that any added/deleted fields are incompatible.
    //
    // The above means that any added/deleted fields are incompatible.
    //
    //msgp:tuple VolInfo
    type VolInfo struct {
    	// Name of the volume.
    	Name string
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 17.3K bytes
    - Viewed (0)
  3. cmd/namespace-lock_test.go

    	for i := 0; i < 10000; i++ {
    		nsLk := newNSLock(false)
    
    		// lk1; ref=1
    		if !nsLk.lock(ctx, "volume", "path", "source", "opsID", false, time.Second) {
    			t.Fatal("failed to acquire lock")
    		}
    
    		// lk2
    		lk2ch := make(chan struct{})
    		go func() {
    			defer close(lk2ch)
    			nsLk.lock(ctx, "volume", "path", "source", "opsID", false, 1*time.Millisecond)
    		}()
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 3.1K bytes
    - Viewed (0)
  4. cmd/xl-storage_test.go

    	}
    	ctx := context.Background()
    
    	volume := "myvol-vol"
    	object := "my-object"
    	if err := xl.MakeVol(ctx, volume); err != nil {
    		t.Fatalf("Unable to create volume, %s", err)
    	}
    	var versions [50]string
    	for i := range versions {
    		versions[i] = uuid.New().String()
    		fi := FileInfo{
    			Name: object, Volume: volume, VersionID: versions[i], ModTime: UTCNow(), DataDir: "", Size: 10000,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Aug 14 17:11:51 UTC 2024
    - 66.7K bytes
    - Viewed (0)
  5. cmd/xl-storage-free-version_test.go

    	freeVersions, err = xl.listFreeVersions(newtierfi.Volume, newtierfi.Name)
    	if err != nil {
    		t.Fatalf("failed to list free versions %v", err)
    	}
    	if len(freeVersions) != 0 {
    		t.Fatalf("Expected zero free version but got %d", len(freeVersions))
    	}
    }
    
    func TestSkipFreeVersion(t *testing.T) {
    	fi := FileInfo{
    		Volume:           "volume",
    		Name:             "object-name",
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Mar 02 05:11:03 UTC 2024
    - 7.8K bytes
    - Viewed (0)
  6. cmd/peer-s3-server.go

    				return nil
    			}, index)
    		}
    
    		g.Wait()
    	}
    
    	// Create the lost volume only if its not marked for delete
    	if !opts.Remove {
    		// Initialize sync waitgroup.
    		g = errgroup.WithNErrs(len(localDrives))
    
    		// Make a volume entry on all underlying storage disks.
    		for index := range localDrives {
    			index := index
    			g.Go(func() error {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 22 21:57:20 UTC 2024
    - 8.1K bytes
    - Viewed (0)
  7. .github/workflows/run-mint.sh

    export MINT_MODE="full"
    
    docker system prune -f || true
    docker volume prune -f || true
    docker volume rm $(docker volume ls -f dangling=true) || true
    
    ## change working directory
    cd .github/workflows/mint
    
    docker-compose -f minio-${MODE}.yaml up -d
    sleep 1m
    
    docker system prune -f || true
    docker volume prune -f || true
    docker volume rm $(docker volume ls -q -f dangling=true) || true
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed May 22 23:07:14 UTC 2024
    - 1.9K bytes
    - Viewed (0)
  8. migrator/migrator.go

    			return err
    		}
    	}
    	return nil
    }
    
    // DropTable drop table for values
    func (m Migrator) DropTable(values ...interface{}) error {
    	values = m.ReorderModels(values, false)
    	for i := len(values) - 1; i >= 0; i-- {
    		tx := m.DB.Session(&gorm.Session{})
    		if err := m.RunWithValue(values[i], func(stmt *gorm.Statement) error {
    			return tx.Exec("DROP TABLE IF EXISTS ?", m.CurrentTable(stmt)).Error
    		}); err != nil {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Fri Apr 26 07:15:49 UTC 2024
    - 29K bytes
    - Viewed (0)
  9. internal/s3select/parquet/reader.go

    	nextRow, err := pr.r.NextRow()
    	if err != nil {
    		if err == io.EOF {
    			return nil, err
    		}
    		return nil, errParquetParsingError(err)
    	}
    
    	kvs := jstream.KVS{}
    	for _, col := range pr.r.Columns() {
    
    		var value interface{}
    		if v, ok := nextRow[col.FlatName()]; ok {
    			value, err = convertFromAnnotation(col.Element(), v)
    			if err != nil {
    				return nil, errParquetParsingError(err)
    			}
    		}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 23 19:35:41 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  10. cmd/bitrot-whole.go

    }
    
    // Returns whole-file bitrot writer.
    func newWholeBitrotWriter(disk StorageAPI, volume, filePath string, algo BitrotAlgorithm, shardSize int64) io.WriteCloser {
    	return &wholeBitrotWriter{disk, volume, filePath, shardSize, algo.New()}
    }
    
    // Implementation to verify bitrot for the whole file.
    type wholeBitrotReader struct {
    	disk       StorageAPI
    	volume     string
    	filePath   string
    	verifier   *BitrotVerifier // Holds the bit-rot info
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jan 31 02:11:45 UTC 2024
    - 2.7K bytes
    - Viewed (0)
Back to top