You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

400 lines
12 KiB

6 years ago
6 years ago
6 years ago
6 years ago
6 years ago
9 years ago
6 years ago
6 years ago
  1. package storage
  2. import (
  3. "fmt"
  4. "os"
  5. "time"
  6. "github.com/joeslay/seaweedfs/weed/glog"
  7. "github.com/joeslay/seaweedfs/weed/stats"
  8. idx2 "github.com/joeslay/seaweedfs/weed/storage/idx"
  9. "github.com/joeslay/seaweedfs/weed/storage/memory_map"
  10. "github.com/joeslay/seaweedfs/weed/storage/needle"
  11. "github.com/joeslay/seaweedfs/weed/storage/needle_map"
  12. . "github.com/joeslay/seaweedfs/weed/storage/types"
  13. "github.com/joeslay/seaweedfs/weed/util"
  14. )
  15. func (v *Volume) garbageLevel() float64 {
  16. if v.ContentSize() == 0 {
  17. return 0
  18. }
  19. return float64(v.DeletedSize()) / float64(v.ContentSize())
  20. }
  21. func (v *Volume) Compact(preallocate int64, compactionBytePerSecond int64) error {
  22. _, exists := memory_map.FileMemoryMap[v.dataFile.Name()]
  23. if !exists { //it makes no sense to compact in memory
  24. glog.V(3).Infof("Compacting volume %d ...", v.Id)
  25. //no need to lock for copy on write
  26. //v.accessLock.Lock()
  27. //defer v.accessLock.Unlock()
  28. //glog.V(3).Infof("Got Compaction lock...")
  29. v.isCompacting = true
  30. defer func() {
  31. v.isCompacting = false
  32. }()
  33. filePath := v.FileName()
  34. v.lastCompactIndexOffset = v.IndexFileSize()
  35. v.lastCompactRevision = v.SuperBlock.CompactionRevision
  36. glog.V(3).Infof("creating copies for volume %d ,last offset %d...", v.Id, v.lastCompactIndexOffset)
  37. return v.copyDataAndGenerateIndexFile(filePath+".cpd", filePath+".cpx", preallocate, compactionBytePerSecond)
  38. } else {
  39. return nil
  40. }
  41. }
  42. func (v *Volume) Compact2() error {
  43. _, exists := memory_map.FileMemoryMap[v.dataFile.Name()]
  44. if !exists { //it makes no sense to compact in memory
  45. glog.V(3).Infof("Compact2 volume %d ...", v.Id)
  46. v.isCompacting = true
  47. defer func() {
  48. v.isCompacting = false
  49. }()
  50. filePath := v.FileName()
  51. glog.V(3).Infof("creating copies for volume %d ...", v.Id)
  52. return v.copyDataBasedOnIndexFile(filePath+".cpd", filePath+".cpx")
  53. } else {
  54. return nil
  55. }
  56. }
  57. func (v *Volume) CommitCompact() error {
  58. _, exists := memory_map.FileMemoryMap[v.dataFile.Name()]
  59. if !exists { //it makes no sense to compact in memory
  60. glog.V(0).Infof("Committing volume %d vacuuming...", v.Id)
  61. v.isCompacting = true
  62. defer func() {
  63. v.isCompacting = false
  64. }()
  65. v.dataFileAccessLock.Lock()
  66. defer v.dataFileAccessLock.Unlock()
  67. glog.V(3).Infof("Got volume %d committing lock...", v.Id)
  68. v.nm.Close()
  69. if err := v.dataFile.Close(); err != nil {
  70. glog.V(0).Infof("fail to close volume %d", v.Id)
  71. }
  72. v.dataFile = nil
  73. stats.VolumeServerVolumeCounter.WithLabelValues(v.Collection, "volume").Dec()
  74. var e error
  75. if e = v.makeupDiff(v.FileName()+".cpd", v.FileName()+".cpx", v.FileName()+".dat", v.FileName()+".idx"); e != nil {
  76. glog.V(0).Infof("makeupDiff in CommitCompact volume %d failed %v", v.Id, e)
  77. e = os.Remove(v.FileName() + ".cpd")
  78. if e != nil {
  79. return e
  80. }
  81. e = os.Remove(v.FileName() + ".cpx")
  82. if e != nil {
  83. return e
  84. }
  85. } else {
  86. var e error
  87. if e = os.Rename(v.FileName()+".cpd", v.FileName()+".dat"); e != nil {
  88. return fmt.Errorf("rename %s: %v", v.FileName()+".cpd", e)
  89. }
  90. if e = os.Rename(v.FileName()+".cpx", v.FileName()+".idx"); e != nil {
  91. return fmt.Errorf("rename %s: %v", v.FileName()+".cpx", e)
  92. }
  93. }
  94. //glog.V(3).Infof("Pretending to be vacuuming...")
  95. //time.Sleep(20 * time.Second)
  96. os.RemoveAll(v.FileName() + ".ldb")
  97. os.RemoveAll(v.FileName() + ".bdb")
  98. glog.V(3).Infof("Loading volume %d commit file...", v.Id)
  99. if e = v.load(true, false, v.needleMapKind, 0); e != nil {
  100. return e
  101. }
  102. }
  103. return nil
  104. }
  105. func (v *Volume) cleanupCompact() error {
  106. glog.V(0).Infof("Cleaning up volume %d vacuuming...", v.Id)
  107. e1 := os.Remove(v.FileName() + ".cpd")
  108. e2 := os.Remove(v.FileName() + ".cpx")
  109. if e1 != nil {
  110. return e1
  111. }
  112. if e2 != nil {
  113. return e2
  114. }
  115. return nil
  116. }
  117. func fetchCompactRevisionFromDatFile(file *os.File) (compactRevision uint16, err error) {
  118. superBlock, err := ReadSuperBlock(file)
  119. if err != nil {
  120. return 0, err
  121. }
  122. return superBlock.CompactionRevision, nil
  123. }
  124. func (v *Volume) makeupDiff(newDatFileName, newIdxFileName, oldDatFileName, oldIdxFileName string) (err error) {
  125. var indexSize int64
  126. oldIdxFile, err := os.Open(oldIdxFileName)
  127. defer oldIdxFile.Close()
  128. oldDatFile, err := os.Open(oldDatFileName)
  129. defer oldDatFile.Close()
  130. if indexSize, err = verifyIndexFileIntegrity(oldIdxFile); err != nil {
  131. return fmt.Errorf("verifyIndexFileIntegrity %s failed: %v", oldIdxFileName, err)
  132. }
  133. if indexSize == 0 || uint64(indexSize) <= v.lastCompactIndexOffset {
  134. return nil
  135. }
  136. oldDatCompactRevision, err := fetchCompactRevisionFromDatFile(oldDatFile)
  137. if err != nil {
  138. return fmt.Errorf("fetchCompactRevisionFromDatFile src %s failed: %v", oldDatFile.Name(), err)
  139. }
  140. if oldDatCompactRevision != v.lastCompactRevision {
  141. return fmt.Errorf("current old dat file's compact revision %d is not the expected one %d", oldDatCompactRevision, v.lastCompactRevision)
  142. }
  143. type keyField struct {
  144. offset Offset
  145. size uint32
  146. }
  147. incrementedHasUpdatedIndexEntry := make(map[NeedleId]keyField)
  148. for idxOffset := indexSize - NeedleMapEntrySize; uint64(idxOffset) >= v.lastCompactIndexOffset; idxOffset -= NeedleMapEntrySize {
  149. var IdxEntry []byte
  150. if IdxEntry, err = readIndexEntryAtOffset(oldIdxFile, idxOffset); err != nil {
  151. return fmt.Errorf("readIndexEntry %s at offset %d failed: %v", oldIdxFileName, idxOffset, err)
  152. }
  153. key, offset, size := idx2.IdxFileEntry(IdxEntry)
  154. glog.V(4).Infof("key %d offset %d size %d", key, offset, size)
  155. if _, found := incrementedHasUpdatedIndexEntry[key]; !found {
  156. incrementedHasUpdatedIndexEntry[key] = keyField{
  157. offset: offset,
  158. size: size,
  159. }
  160. }
  161. }
  162. // no updates during commit step
  163. if len(incrementedHasUpdatedIndexEntry) == 0 {
  164. return nil
  165. }
  166. // deal with updates during commit step
  167. var (
  168. dst, idx *os.File
  169. )
  170. if dst, err = os.OpenFile(newDatFileName, os.O_RDWR, 0644); err != nil {
  171. return fmt.Errorf("open dat file %s failed: %v", newDatFileName, err)
  172. }
  173. defer dst.Close()
  174. if idx, err = os.OpenFile(newIdxFileName, os.O_RDWR, 0644); err != nil {
  175. return fmt.Errorf("open idx file %s failed: %v", newIdxFileName, err)
  176. }
  177. defer idx.Close()
  178. var newDatCompactRevision uint16
  179. newDatCompactRevision, err = fetchCompactRevisionFromDatFile(dst)
  180. if err != nil {
  181. return fmt.Errorf("fetchCompactRevisionFromDatFile dst %s failed: %v", dst.Name(), err)
  182. }
  183. if oldDatCompactRevision+1 != newDatCompactRevision {
  184. return fmt.Errorf("oldDatFile %s 's compact revision is %d while newDatFile %s 's compact revision is %d", oldDatFileName, oldDatCompactRevision, newDatFileName, newDatCompactRevision)
  185. }
  186. for key, increIdxEntry := range incrementedHasUpdatedIndexEntry {
  187. idxEntryBytes := needle_map.ToBytes(key, increIdxEntry.offset, increIdxEntry.size)
  188. var offset int64
  189. if offset, err = dst.Seek(0, 2); err != nil {
  190. glog.V(0).Infof("failed to seek the end of file: %v", err)
  191. return
  192. }
  193. //ensure file writing starting from aligned positions
  194. if offset%NeedlePaddingSize != 0 {
  195. offset = offset + (NeedlePaddingSize - offset%NeedlePaddingSize)
  196. if offset, err = dst.Seek(offset, 0); err != nil {
  197. glog.V(0).Infof("failed to align in datafile %s: %v", dst.Name(), err)
  198. return
  199. }
  200. }
  201. //updated needle
  202. if !increIdxEntry.offset.IsZero() && increIdxEntry.size != 0 && increIdxEntry.size != TombstoneFileSize {
  203. //even the needle cache in memory is hit, the need_bytes is correct
  204. glog.V(4).Infof("file %d offset %d size %d", key, increIdxEntry.offset.ToAcutalOffset(), increIdxEntry.size)
  205. var needleBytes []byte
  206. needleBytes, err = needle.ReadNeedleBlob(oldDatFile, increIdxEntry.offset.ToAcutalOffset(), increIdxEntry.size, v.Version())
  207. if err != nil {
  208. return fmt.Errorf("ReadNeedleBlob %s key %d offset %d size %d failed: %v", oldDatFile.Name(), key, increIdxEntry.offset.ToAcutalOffset(), increIdxEntry.size, err)
  209. }
  210. dst.Write(needleBytes)
  211. util.Uint32toBytes(idxEntryBytes[8:12], uint32(offset/NeedlePaddingSize))
  212. } else { //deleted needle
  213. //fakeDelNeedle 's default Data field is nil
  214. fakeDelNeedle := new(needle.Needle)
  215. fakeDelNeedle.Id = key
  216. fakeDelNeedle.Cookie = 0x12345678
  217. fakeDelNeedle.AppendAtNs = uint64(time.Now().UnixNano())
  218. _, _, _, err = fakeDelNeedle.Append(dst, v.Version())
  219. if err != nil {
  220. return fmt.Errorf("append deleted %d failed: %v", key, err)
  221. }
  222. util.Uint32toBytes(idxEntryBytes[8:12], uint32(0))
  223. }
  224. if _, err := idx.Seek(0, 2); err != nil {
  225. return fmt.Errorf("cannot seek end of indexfile %s: %v",
  226. newIdxFileName, err)
  227. }
  228. _, err = idx.Write(idxEntryBytes)
  229. }
  230. return nil
  231. }
  232. type VolumeFileScanner4Vacuum struct {
  233. version needle.Version
  234. v *Volume
  235. dst *os.File
  236. nm *NeedleMap
  237. newOffset int64
  238. now uint64
  239. writeThrottler *util.WriteThrottler
  240. }
  241. func (scanner *VolumeFileScanner4Vacuum) VisitSuperBlock(superBlock SuperBlock) error {
  242. scanner.version = superBlock.Version()
  243. superBlock.CompactionRevision++
  244. _, err := scanner.dst.Write(superBlock.Bytes())
  245. scanner.newOffset = int64(superBlock.BlockSize())
  246. return err
  247. }
  248. func (scanner *VolumeFileScanner4Vacuum) ReadNeedleBody() bool {
  249. return true
  250. }
  251. func (scanner *VolumeFileScanner4Vacuum) VisitNeedle(n *needle.Needle, offset int64) error {
  252. if n.HasTtl() && scanner.now >= n.LastModified+uint64(scanner.v.Ttl.Minutes()*60) {
  253. return nil
  254. }
  255. nv, ok := scanner.v.nm.Get(n.Id)
  256. glog.V(4).Infoln("needle expected offset ", offset, "ok", ok, "nv", nv)
  257. if ok && nv.Offset.ToAcutalOffset() == offset && nv.Size > 0 && nv.Size != TombstoneFileSize {
  258. if err := scanner.nm.Put(n.Id, ToOffset(scanner.newOffset), n.Size); err != nil {
  259. return fmt.Errorf("cannot put needle: %s", err)
  260. }
  261. if _, _, _, err := n.Append(scanner.dst, scanner.v.Version()); err != nil {
  262. return fmt.Errorf("cannot append needle: %s", err)
  263. }
  264. delta := n.DiskSize(scanner.version)
  265. scanner.newOffset += delta
  266. scanner.writeThrottler.MaybeSlowdown(delta)
  267. glog.V(4).Infoln("saving key", n.Id, "volume offset", offset, "=>", scanner.newOffset, "data_size", n.Size)
  268. }
  269. return nil
  270. }
  271. func (v *Volume) copyDataAndGenerateIndexFile(dstName, idxName string, preallocate int64, compactionBytePerSecond int64) (err error) {
  272. var (
  273. dst, idx *os.File
  274. )
  275. if dst, err = createVolumeFile(dstName, preallocate); err != nil {
  276. return
  277. }
  278. defer dst.Close()
  279. if idx, err = os.OpenFile(idxName, os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644); err != nil {
  280. return
  281. }
  282. defer idx.Close()
  283. scanner := &VolumeFileScanner4Vacuum{
  284. v: v,
  285. now: uint64(time.Now().Unix()),
  286. nm: NewBtreeNeedleMap(idx),
  287. dst: dst,
  288. writeThrottler: util.NewWriteThrottler(compactionBytePerSecond),
  289. }
  290. err = ScanVolumeFile(v.dir, v.Collection, v.Id, v.needleMapKind, scanner)
  291. return
  292. }
  293. func (v *Volume) copyDataBasedOnIndexFile(dstName, idxName string) (err error) {
  294. var (
  295. dst, idx, oldIndexFile *os.File
  296. )
  297. if dst, err = os.OpenFile(dstName, os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644); err != nil {
  298. return
  299. }
  300. defer dst.Close()
  301. if idx, err = os.OpenFile(idxName, os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644); err != nil {
  302. return
  303. }
  304. defer idx.Close()
  305. if oldIndexFile, err = os.OpenFile(v.FileName()+".idx", os.O_RDONLY, 0644); err != nil {
  306. return
  307. }
  308. defer oldIndexFile.Close()
  309. nm := NewBtreeNeedleMap(idx)
  310. now := uint64(time.Now().Unix())
  311. v.SuperBlock.CompactionRevision++
  312. dst.Write(v.SuperBlock.Bytes())
  313. newOffset := int64(v.SuperBlock.BlockSize())
  314. idx2.WalkIndexFile(oldIndexFile, func(key NeedleId, offset Offset, size uint32) error {
  315. if offset.IsZero() || size == TombstoneFileSize {
  316. return nil
  317. }
  318. nv, ok := v.nm.Get(key)
  319. if !ok {
  320. return nil
  321. }
  322. n := new(needle.Needle)
  323. err := n.ReadData(v.dataFile, offset.ToAcutalOffset(), size, v.Version())
  324. if err != nil {
  325. return nil
  326. }
  327. if n.HasTtl() && now >= n.LastModified+uint64(v.Ttl.Minutes()*60) {
  328. return nil
  329. }
  330. glog.V(4).Infoln("needle expected offset ", offset, "ok", ok, "nv", nv)
  331. if nv.Offset == offset && nv.Size > 0 {
  332. if err = nm.Put(n.Id, ToOffset(newOffset), n.Size); err != nil {
  333. return fmt.Errorf("cannot put needle: %s", err)
  334. }
  335. if _, _, _, err = n.Append(dst, v.Version()); err != nil {
  336. return fmt.Errorf("cannot append needle: %s", err)
  337. }
  338. newOffset += n.DiskSize(v.Version())
  339. glog.V(3).Infoln("saving key", n.Id, "volume offset", offset, "=>", newOffset, "data_size", n.Size)
  340. }
  341. return nil
  342. })
  343. return
  344. }