// Copyright (c) 2015-2021 MinIO, Inc. // // This file is part of MinIO Object Storage stack // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Affero General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU Affero General Public License for more details. // // You should have received a copy of the GNU Affero General Public License // along with this program. If not, see . package cmd import ( "fmt" jsoniter "github.com/json-iterator/go" "github.com/minio/minio/internal/logger" "github.com/zeebo/xxh3" ) func getFileInfoVersions(xlMetaBuf []byte, volume, path string) (FileInfoVersions, error) { if isXL2V1Format(xlMetaBuf) { var versions []FileInfo var err error if buf, _ := isIndexedMetaV2(xlMetaBuf); buf != nil { versions, err = buf.ListVersions(volume, path) } else { var xlMeta xlMetaV2 if err := xlMeta.Load(xlMetaBuf); err != nil { return FileInfoVersions{}, err } versions, err = xlMeta.ListVersions(volume, path) } if err != nil || len(versions) == 0 { return FileInfoVersions{}, err } var freeVersions []FileInfo n := 0 for _, fi := range versions { if fi.TierFreeVersion() { freeVersions = append(freeVersions, fi) continue } versions[n] = fi n++ } versions = versions[:n] for _, ver := range versions { ver.NumVersions = n } return FileInfoVersions{ Volume: volume, Name: path, Versions: versions, FreeVersions: freeVersions, LatestModTime: versions[0].ModTime, }, nil } xlMeta := &xlMetaV1Object{} var json = jsoniter.ConfigCompatibleWithStandardLibrary if err := json.Unmarshal(xlMetaBuf, xlMeta); err != nil { return FileInfoVersions{}, errFileCorrupt } fi, err := xlMeta.ToFileInfo(volume, path) if err != nil { return FileInfoVersions{}, err } fi.IsLatest = true // No versions so current version is latest. fi.NumVersions = 1 // just this version return FileInfoVersions{ Volume: volume, Name: path, Versions: []FileInfo{fi}, LatestModTime: fi.ModTime, }, nil } func getFileInfo(xlMetaBuf []byte, volume, path, versionID string, data bool) (FileInfo, error) { if isXL2V1Format(xlMetaBuf) { var fi FileInfo var err error var inData xlMetaInlineData if buf, data := isIndexedMetaV2(xlMetaBuf); buf != nil { inData = data fi, err = buf.ToFileInfo(volume, path, versionID) } else { var xlMeta xlMetaV2 if err := xlMeta.Load(xlMetaBuf); err != nil { return FileInfo{}, err } inData = xlMeta.data fi, err = xlMeta.ToFileInfo(volume, path, versionID) } if !data || err != nil { return fi, err } versionID := fi.VersionID if versionID == "" { versionID = nullVersionID } fi.Data = inData.find(versionID) if len(fi.Data) == 0 { // PR #11758 used DataDir, preserve it // for users who might have used master // branch fi.Data = inData.find(fi.DataDir) } return fi, nil } xlMeta := &xlMetaV1Object{} var json = jsoniter.ConfigCompatibleWithStandardLibrary if err := json.Unmarshal(xlMetaBuf, xlMeta); err != nil { logger.LogIf(GlobalContext, fmt.Errorf("unable to unmarshal json object: %v", err)) return FileInfo{}, errFileCorrupt } fi, err := xlMeta.ToFileInfo(volume, path) if err != nil { return FileInfo{}, err } fi.XLV1 = true // indicates older version fi.IsLatest = true // No versions so current version is latest. return fi, err } // getXLDiskLoc will return the pool/set/disk id if it can be located in the object layer. // Will return -1 for unknown values. func getXLDiskLoc(diskID string) (poolIdx, setIdx, diskIdx int) { if api := newObjectLayerFn(); api != nil { if ep, ok := api.(*erasureServerPools); ok { if pool, set, disk, err := ep.getPoolAndSet(diskID); err == nil { return pool, set, disk } } } return -1, -1, -1 } // hashDeterministicString will return a deterministic hash for the map values. // Trivial collisions are avoided, but this is by no means a strong hash. func hashDeterministicString(m map[string]string) uint64 { // Seed (random) var crc = uint64(0xc2b40bbac11a7295) // Xor each value to make order independent for k, v := range m { // Separate key and value with an individual xor with a random number. // Add values of each, so they cannot be trivially collided. crc ^= (xxh3.HashString(k) ^ 0x4ee3bbaf7ab2506b) + (xxh3.HashString(v) ^ 0x8da4c8da66194257) } return crc } // hashDeterministicBytes will return a deterministic (weak) hash for the map values. // Trivial collisions are avoided, but this is by no means a strong hash. func hashDeterministicBytes(m map[string][]byte) uint64 { var crc = uint64(0x1bbc7e1dde654743) for k, v := range m { crc ^= (xxh3.HashString(k) ^ 0x4ee3bbaf7ab2506b) + (xxh3.Hash(v) ^ 0x8da4c8da66194257) } return crc }