sdk/go/arvados/fs_collection.go

   1 // Copyright (C) The Arvados Authors. All rights reserved.
   2 //
   3 // SPDX-License-Identifier: Apache-2.0
   4
   5 package arvados
   6
   7 import (
   8         "encoding/json"
   9         "fmt"
  10         "io"
  11         "os"
  12         "path"
  13         "regexp"
  14         "sort"
  15         "strconv"
  16         "strings"
  17         "sync"
  18         "time"
  19 )
  20
  21 var maxBlockSize = 1 << 26
  22
  23 // A CollectionFileSystem is a FileSystem that can be serialized as a
  24 // manifest and stored as a collection.
  25 type CollectionFileSystem interface {
  26         FileSystem
  27
  28         // Flush all file data to Keep and return a snapshot of the
  29         // filesystem suitable for saving as (Collection)ManifestText.
  30         // Prefix (normally ".") is a top level directory, effectively
  31         // prepended to all paths in the returned manifest.
  32         MarshalManifest(prefix string) (string, error)
  33
  34         // Total data bytes in all files.
  35         Size() int64
  36 }
  37
  38 type collectionFileSystem struct {
  39         fileSystem
  40         uuid string
  41 }
  42
  43 // FileSystem returns a CollectionFileSystem for the collection.
  44 func (c *Collection) FileSystem(client apiClient, kc keepClient) (CollectionFileSystem, error) {
  45         var modTime time.Time
  46         if c.ModifiedAt == nil {
  47                 modTime = time.Now()
  48         } else {
  49                 modTime = *c.ModifiedAt
  50         }
  51         fs := &collectionFileSystem{
  52                 uuid: c.UUID,
  53                 fileSystem: fileSystem{
  54                         fsBackend: keepBackend{apiClient: client, keepClient: kc},
  55                 },
  56         }
  57         root := &dirnode{
  58                 fs: fs,
  59                 treenode: treenode{
  60                         fileinfo: fileinfo{
  61                                 name:    ".",
  62                                 mode:    os.ModeDir | 0755,
  63                                 modTime: modTime,
  64                         },
  65                         inodes: make(map[string]inode),
  66                 },
  67         }
  68         root.SetParent(root, ".")
  69         if err := root.loadManifest(c.ManifestText); err != nil {
  70                 return nil, err
  71         }
  72         backdateTree(root, modTime)
  73         fs.root = root
  74         return fs, nil
  75 }
  76
  77 func backdateTree(n inode, modTime time.Time) {
  78         switch n := n.(type) {
  79         case *filenode:
  80                 n.fileinfo.modTime = modTime
  81         case *dirnode:
  82                 n.fileinfo.modTime = modTime
  83                 for _, n := range n.inodes {
  84                         backdateTree(n, modTime)
  85                 }
  86         }
  87 }
  88
  89 func (fs *collectionFileSystem) newNode(name string, perm os.FileMode, modTime time.Time) (node inode, err error) {
  90         if name == "" || name == "." || name == ".." {
  91                 return nil, ErrInvalidArgument
  92         }
  93         if perm.IsDir() {
  94                 return &dirnode{
  95                         fs: fs,
  96                         treenode: treenode{
  97                                 fileinfo: fileinfo{
  98                                         name:    name,
  99                                         mode:    perm | os.ModeDir,
 100                                         modTime: modTime,
 101                                 },
 102                                 inodes: make(map[string]inode),
 103                         },
 104                 }, nil
 105         } else {
 106                 return &filenode{
 107                         fs: fs,
 108                         fileinfo: fileinfo{
 109                                 name:    name,
 110                                 mode:    perm & ^os.ModeDir,
 111                                 modTime: modTime,
 112                         },
 113                 }, nil
 114         }
 115 }
 116
 117 func (fs *collectionFileSystem) Sync() error {
 118         if fs.uuid == "" {
 119                 return nil
 120         }
 121         txt, err := fs.MarshalManifest(".")
 122         if err != nil {
 123                 return fmt.Errorf("sync failed: %s", err)
 124         }
 125         coll := &Collection{
 126                 UUID:         fs.uuid,
 127                 ManifestText: txt,
 128         }
 129         err = fs.RequestAndDecode(nil, "PUT", "arvados/v1/collections/"+fs.uuid, fs.UpdateBody(coll), map[string]interface{}{"select": []string{"uuid"}})
 130         if err != nil {
 131                 return fmt.Errorf("sync failed: update %s: %s", fs.uuid, err)
 132         }
 133         return nil
 134 }
 135
 136 func (fs *collectionFileSystem) MarshalManifest(prefix string) (string, error) {
 137         fs.fileSystem.root.Lock()
 138         defer fs.fileSystem.root.Unlock()
 139         return fs.fileSystem.root.(*dirnode).marshalManifest(prefix)
 140 }
 141
 142 func (fs *collectionFileSystem) Size() int64 {
 143         return fs.fileSystem.root.(*dirnode).TreeSize()
 144 }
 145
 146 // filenodePtr is an offset into a file that is (usually) efficient to
 147 // seek to. Specifically, if filenode.repacked==filenodePtr.repacked
 148 // then
 149 // filenode.segments[filenodePtr.segmentIdx][filenodePtr.segmentOff]
 150 // corresponds to file offset filenodePtr.off. Otherwise, it is
 151 // necessary to reexamine len(filenode.segments[0]) etc. to find the
 152 // correct segment and offset.
 153 type filenodePtr struct {
 154         off        int64
 155         segmentIdx int
 156         segmentOff int
 157         repacked   int64
 158 }
 159
 160 // seek returns a ptr that is consistent with both startPtr.off and
 161 // the current state of fn. The caller must already hold fn.RLock() or
 162 // fn.Lock().
 163 //
 164 // If startPtr is beyond EOF, ptr.segment* will indicate precisely
 165 // EOF.
 166 //
 167 // After seeking:
 168 //
 169 //     ptr.segmentIdx == len(filenode.segments) // i.e., at EOF
 170 //     ||
 171 //     filenode.segments[ptr.segmentIdx].Len() > ptr.segmentOff
 172 func (fn *filenode) seek(startPtr filenodePtr) (ptr filenodePtr) {
 173         ptr = startPtr
 174         if ptr.off < 0 {
 175                 // meaningless anyway
 176                 return
 177         } else if ptr.off >= fn.fileinfo.size {
 178                 ptr.segmentIdx = len(fn.segments)
 179                 ptr.segmentOff = 0
 180                 ptr.repacked = fn.repacked
 181                 return
 182         } else if ptr.repacked == fn.repacked {
 183                 // segmentIdx and segmentOff accurately reflect
 184                 // ptr.off, but might have fallen off the end of a
 185                 // segment
 186                 if ptr.segmentOff >= fn.segments[ptr.segmentIdx].Len() {
 187                         ptr.segmentIdx++
 188                         ptr.segmentOff = 0
 189                 }
 190                 return
 191         }
 192         defer func() {
 193                 ptr.repacked = fn.repacked
 194         }()
 195         if ptr.off >= fn.fileinfo.size {
 196                 ptr.segmentIdx, ptr.segmentOff = len(fn.segments), 0
 197                 return
 198         }
 199         // Recompute segmentIdx and segmentOff.  We have already
 200         // established fn.fileinfo.size > ptr.off >= 0, so we don't
 201         // have to deal with edge cases here.
 202         var off int64
 203         for ptr.segmentIdx, ptr.segmentOff = 0, 0; off < ptr.off; ptr.segmentIdx++ {
 204                 // This would panic (index out of range) if
 205                 // fn.fileinfo.size were larger than
 206                 // sum(fn.segments[i].Len()) -- but that can't happen
 207                 // because we have ensured fn.fileinfo.size is always
 208                 // accurate.
 209                 segLen := int64(fn.segments[ptr.segmentIdx].Len())
 210                 if off+segLen > ptr.off {
 211                         ptr.segmentOff = int(ptr.off - off)
 212                         break
 213                 }
 214                 off += segLen
 215         }
 216         return
 217 }
 218
 219 // filenode implements inode.
 220 type filenode struct {
 221         parent   inode
 222         fs       FileSystem
 223         fileinfo fileinfo
 224         segments []segment
 225         // number of times `segments` has changed in a
 226         // way that might invalidate a filenodePtr
 227         repacked int64
 228         memsize  int64 // bytes in memSegments
 229         sync.RWMutex
 230         nullnode
 231 }
 232
 233 // caller must have lock
 234 func (fn *filenode) appendSegment(e segment) {
 235         fn.segments = append(fn.segments, e)
 236         fn.fileinfo.size += int64(e.Len())
 237 }
 238
 239 func (fn *filenode) SetParent(p inode, name string) {
 240         fn.Lock()
 241         defer fn.Unlock()
 242         fn.parent = p
 243         fn.fileinfo.name = name
 244 }
 245
 246 func (fn *filenode) Parent() inode {
 247         fn.RLock()
 248         defer fn.RUnlock()
 249         return fn.parent
 250 }
 251
 252 func (fn *filenode) FS() FileSystem {
 253         return fn.fs
 254 }
 255
 256 // Read reads file data from a single segment, starting at startPtr,
 257 // into p. startPtr is assumed not to be up-to-date. Caller must have
 258 // RLock or Lock.
 259 func (fn *filenode) Read(p []byte, startPtr filenodePtr) (n int, ptr filenodePtr, err error) {
 260         ptr = fn.seek(startPtr)
 261         if ptr.off < 0 {
 262                 err = ErrNegativeOffset
 263                 return
 264         }
 265         if ptr.segmentIdx >= len(fn.segments) {
 266                 err = io.EOF
 267                 return
 268         }
 269         n, err = fn.segments[ptr.segmentIdx].ReadAt(p, int64(ptr.segmentOff))
 270         if n > 0 {
 271                 ptr.off += int64(n)
 272                 ptr.segmentOff += n
 273                 if ptr.segmentOff == fn.segments[ptr.segmentIdx].Len() {
 274                         ptr.segmentIdx++
 275                         ptr.segmentOff = 0
 276                         if ptr.segmentIdx < len(fn.segments) && err == io.EOF {
 277                                 err = nil
 278                         }
 279                 }
 280         }
 281         return
 282 }
 283
 284 func (fn *filenode) Size() int64 {
 285         fn.RLock()
 286         defer fn.RUnlock()
 287         return fn.fileinfo.Size()
 288 }
 289
 290 func (fn *filenode) FileInfo() os.FileInfo {
 291         fn.RLock()
 292         defer fn.RUnlock()
 293         return fn.fileinfo
 294 }
 295
 296 func (fn *filenode) Truncate(size int64) error {
 297         fn.Lock()
 298         defer fn.Unlock()
 299         return fn.truncate(size)
 300 }
 301
 302 func (fn *filenode) truncate(size int64) error {
 303         if size == fn.fileinfo.size {
 304                 return nil
 305         }
 306         fn.repacked++
 307         if size < fn.fileinfo.size {
 308                 ptr := fn.seek(filenodePtr{off: size})
 309                 for i := ptr.segmentIdx; i < len(fn.segments); i++ {
 310                         if seg, ok := fn.segments[i].(*memSegment); ok {
 311                                 fn.memsize -= int64(seg.Len())
 312                         }
 313                 }
 314                 if ptr.segmentOff == 0 {
 315                         fn.segments = fn.segments[:ptr.segmentIdx]
 316                 } else {
 317                         fn.segments = fn.segments[:ptr.segmentIdx+1]
 318                         switch seg := fn.segments[ptr.segmentIdx].(type) {
 319                         case *memSegment:
 320                                 seg.Truncate(ptr.segmentOff)
 321                                 fn.memsize += int64(seg.Len())
 322                         default:
 323                                 fn.segments[ptr.segmentIdx] = seg.Slice(0, ptr.segmentOff)
 324                         }
 325                 }
 326                 fn.fileinfo.size = size
 327                 return nil
 328         }
 329         for size > fn.fileinfo.size {
 330                 grow := size - fn.fileinfo.size
 331                 var seg *memSegment
 332                 var ok bool
 333                 if len(fn.segments) == 0 {
 334                         seg = &memSegment{}
 335                         fn.segments = append(fn.segments, seg)
 336                 } else if seg, ok = fn.segments[len(fn.segments)-1].(*memSegment); !ok || seg.Len() >= maxBlockSize {
 337                         seg = &memSegment{}
 338                         fn.segments = append(fn.segments, seg)
 339                 }
 340                 if maxgrow := int64(maxBlockSize - seg.Len()); maxgrow < grow {
 341                         grow = maxgrow
 342                 }
 343                 seg.Truncate(seg.Len() + int(grow))
 344                 fn.fileinfo.size += grow
 345                 fn.memsize += grow
 346         }
 347         return nil
 348 }
 349
 350 // Write writes data from p to the file, starting at startPtr,
 351 // extending the file size if necessary. Caller must have Lock.
 352 func (fn *filenode) Write(p []byte, startPtr filenodePtr) (n int, ptr filenodePtr, err error) {
 353         if startPtr.off > fn.fileinfo.size {
 354                 if err = fn.truncate(startPtr.off); err != nil {
 355                         return 0, startPtr, err
 356                 }
 357         }
 358         ptr = fn.seek(startPtr)
 359         if ptr.off < 0 {
 360                 err = ErrNegativeOffset
 361                 return
 362         }
 363         for len(p) > 0 && err == nil {
 364                 cando := p
 365                 if len(cando) > maxBlockSize {
 366                         cando = cando[:maxBlockSize]
 367                 }
 368                 // Rearrange/grow fn.segments (and shrink cando if
 369                 // needed) such that cando can be copied to
 370                 // fn.segments[ptr.segmentIdx] at offset
 371                 // ptr.segmentOff.
 372                 cur := ptr.segmentIdx
 373                 prev := ptr.segmentIdx - 1
 374                 var curWritable bool
 375                 if cur < len(fn.segments) {
 376                         _, curWritable = fn.segments[cur].(*memSegment)
 377                 }
 378                 var prevAppendable bool
 379                 if prev >= 0 && fn.segments[prev].Len() < maxBlockSize {
 380                         _, prevAppendable = fn.segments[prev].(*memSegment)
 381                 }
 382                 if ptr.segmentOff > 0 && !curWritable {
 383                         // Split a non-writable block.
 384                         if max := fn.segments[cur].Len() - ptr.segmentOff; max <= len(cando) {
 385                                 // Truncate cur, and insert a new
 386                                 // segment after it.
 387                                 cando = cando[:max]
 388                                 fn.segments = append(fn.segments, nil)
 389                                 copy(fn.segments[cur+1:], fn.segments[cur:])
 390                         } else {
 391                                 // Split cur into two copies, truncate
 392                                 // the one on the left, shift the one
 393                                 // on the right, and insert a new
 394                                 // segment between them.
 395                                 fn.segments = append(fn.segments, nil, nil)
 396                                 copy(fn.segments[cur+2:], fn.segments[cur:])
 397                                 fn.segments[cur+2] = fn.segments[cur+2].Slice(ptr.segmentOff+len(cando), -1)
 398                         }
 399                         cur++
 400                         prev++
 401                         seg := &memSegment{}
 402                         seg.Truncate(len(cando))
 403                         fn.memsize += int64(len(cando))
 404                         fn.segments[cur] = seg
 405                         fn.segments[prev] = fn.segments[prev].Slice(0, ptr.segmentOff)
 406                         ptr.segmentIdx++
 407                         ptr.segmentOff = 0
 408                         fn.repacked++
 409                         ptr.repacked++
 410                 } else if curWritable {
 411                         if fit := int(fn.segments[cur].Len()) - ptr.segmentOff; fit < len(cando) {
 412                                 cando = cando[:fit]
 413                         }
 414                 } else {
 415                         if prevAppendable {
 416                                 // Shrink cando if needed to fit in
 417                                 // prev segment.
 418                                 if cangrow := maxBlockSize - fn.segments[prev].Len(); cangrow < len(cando) {
 419                                         cando = cando[:cangrow]
 420                                 }
 421                         }
 422
 423                         if cur == len(fn.segments) {
 424                                 // ptr is at EOF, filesize is changing.
 425                                 fn.fileinfo.size += int64(len(cando))
 426                         } else if el := fn.segments[cur].Len(); el <= len(cando) {
 427                                 // cando is long enough that we won't
 428                                 // need cur any more. shrink cando to
 429                                 // be exactly as long as cur
 430                                 // (otherwise we'd accidentally shift
 431                                 // the effective position of all
 432                                 // segments after cur).
 433                                 cando = cando[:el]
 434                                 copy(fn.segments[cur:], fn.segments[cur+1:])
 435                                 fn.segments = fn.segments[:len(fn.segments)-1]
 436                         } else {
 437                                 // shrink cur by the same #bytes we're growing prev
 438                                 fn.segments[cur] = fn.segments[cur].Slice(len(cando), -1)
 439                         }
 440
 441                         if prevAppendable {
 442                                 // Grow prev.
 443                                 ptr.segmentIdx--
 444                                 ptr.segmentOff = fn.segments[prev].Len()
 445                                 fn.segments[prev].(*memSegment).Truncate(ptr.segmentOff + len(cando))
 446                                 fn.memsize += int64(len(cando))
 447                                 ptr.repacked++
 448                                 fn.repacked++
 449                         } else {
 450                                 // Insert a segment between prev and
 451                                 // cur, and advance prev/cur.
 452                                 fn.segments = append(fn.segments, nil)
 453                                 if cur < len(fn.segments) {
 454                                         copy(fn.segments[cur+1:], fn.segments[cur:])
 455                                         ptr.repacked++
 456                                         fn.repacked++
 457                                 } else {
 458                                         // appending a new segment does
 459                                         // not invalidate any ptrs
 460                                 }
 461                                 seg := &memSegment{}
 462                                 seg.Truncate(len(cando))
 463                                 fn.memsize += int64(len(cando))
 464                                 fn.segments[cur] = seg
 465                                 cur++
 466                                 prev++
 467                         }
 468                 }
 469
 470                 // Finally we can copy bytes from cando to the current segment.
 471                 fn.segments[ptr.segmentIdx].(*memSegment).WriteAt(cando, ptr.segmentOff)
 472                 n += len(cando)
 473                 p = p[len(cando):]
 474
 475                 ptr.off += int64(len(cando))
 476                 ptr.segmentOff += len(cando)
 477                 if ptr.segmentOff >= maxBlockSize {
 478                         fn.pruneMemSegments()
 479                 }
 480                 if fn.segments[ptr.segmentIdx].Len() == ptr.segmentOff {
 481                         ptr.segmentOff = 0
 482                         ptr.segmentIdx++
 483                 }
 484
 485                 fn.fileinfo.modTime = time.Now()
 486         }
 487         return
 488 }
 489
 490 // Write some data out to disk to reduce memory use. Caller must have
 491 // write lock.
 492 func (fn *filenode) pruneMemSegments() {
 493         // TODO: async (don't hold Lock() while waiting for Keep)
 494         // TODO: share code with (*dirnode)sync()
 495         // TODO: pack/flush small blocks too, when fragmented
 496         for idx, seg := range fn.segments {
 497                 seg, ok := seg.(*memSegment)
 498                 if !ok || seg.Len() < maxBlockSize {
 499                         continue
 500                 }
 501                 locator, _, err := fn.FS().PutB(seg.buf)
 502                 if err != nil {
 503                         // TODO: stall (or return errors from)
 504                         // subsequent writes until flushing
 505                         // starts to succeed
 506                         continue
 507                 }
 508                 fn.memsize -= int64(seg.Len())
 509                 fn.segments[idx] = storedSegment{
 510                         kc:      fn.FS(),
 511                         locator: locator,
 512                         size:    seg.Len(),
 513                         offset:  0,
 514                         length:  seg.Len(),
 515                 }
 516         }
 517 }
 518
 519 type dirnode struct {
 520         fs *collectionFileSystem
 521         treenode
 522 }
 523
 524 func (dn *dirnode) FS() FileSystem {
 525         return dn.fs
 526 }
 527
 528 func (dn *dirnode) Child(name string, replace func(inode) (inode, error)) (inode, error) {
 529         if dn == dn.fs.rootnode() && name == ".arvados#collection" {
 530                 gn := &getternode{Getter: func() ([]byte, error) {
 531                         var coll Collection
 532                         var err error
 533                         coll.ManifestText, err = dn.fs.MarshalManifest(".")
 534                         if err != nil {
 535                                 return nil, err
 536                         }
 537                         data, err := json.Marshal(&coll)
 538                         if err == nil {
 539                                 data = append(data, '\n')
 540                         }
 541                         return data, err
 542                 }}
 543                 gn.SetParent(dn, name)
 544                 return gn, nil
 545         }
 546         return dn.treenode.Child(name, replace)
 547 }
 548
 549 // sync flushes in-memory data and remote block references (for the
 550 // children with the given names, which must be children of dn) to
 551 // local persistent storage. Caller must have write lock on dn and the
 552 // named children.
 553 func (dn *dirnode) sync(names []string) error {
 554         type shortBlock struct {
 555                 fn  *filenode
 556                 idx int
 557         }
 558         var pending []shortBlock
 559         var pendingLen int
 560
 561         flush := func(sbs []shortBlock) error {
 562                 if len(sbs) == 0 {
 563                         return nil
 564                 }
 565                 block := make([]byte, 0, maxBlockSize)
 566                 for _, sb := range sbs {
 567                         block = append(block, sb.fn.segments[sb.idx].(*memSegment).buf...)
 568                 }
 569                 locator, _, err := dn.fs.PutB(block)
 570                 if err != nil {
 571                         return err
 572                 }
 573                 off := 0
 574                 for _, sb := range sbs {
 575                         data := sb.fn.segments[sb.idx].(*memSegment).buf
 576                         sb.fn.segments[sb.idx] = storedSegment{
 577                                 kc:      dn.fs,
 578                                 locator: locator,
 579                                 size:    len(block),
 580                                 offset:  off,
 581                                 length:  len(data),
 582                         }
 583                         off += len(data)
 584                         sb.fn.memsize -= int64(len(data))
 585                 }
 586                 return nil
 587         }
 588
 589         localLocator := map[string]string{}
 590         for _, name := range names {
 591                 fn, ok := dn.inodes[name].(*filenode)
 592                 if !ok {
 593                         continue
 594                 }
 595                 for idx, seg := range fn.segments {
 596                         switch seg := seg.(type) {
 597                         case storedSegment:
 598                                 loc, ok := localLocator[seg.locator]
 599                                 if !ok {
 600                                         var err error
 601                                         loc, err = dn.fs.LocalLocator(seg.locator)
 602                                         if err != nil {
 603                                                 return err
 604                                         }
 605                                         localLocator[seg.locator] = loc
 606                                 }
 607                                 seg.locator = loc
 608                                 fn.segments[idx] = seg
 609                         case *memSegment:
 610                                 if seg.Len() > maxBlockSize/2 {
 611                                         if err := flush([]shortBlock{{fn, idx}}); err != nil {
 612                                                 return err
 613                                         }
 614                                         continue
 615                                 }
 616                                 if pendingLen+seg.Len() > maxBlockSize {
 617                                         if err := flush(pending); err != nil {
 618                                                 return err
 619                                         }
 620                                         pending = nil
 621                                         pendingLen = 0
 622                                 }
 623                                 pending = append(pending, shortBlock{fn, idx})
 624                                 pendingLen += seg.Len()
 625                         default:
 626                                 panic(fmt.Sprintf("can't sync segment type %T", seg))
 627                         }
 628                 }
 629         }
 630         return flush(pending)
 631 }
 632
 633 // caller must have write lock.
 634 func (dn *dirnode) marshalManifest(prefix string) (string, error) {
 635         var streamLen int64
 636         type filepart struct {
 637                 name   string
 638                 offset int64
 639                 length int64
 640         }
 641         var fileparts []filepart
 642         var subdirs string
 643         var blocks []string
 644
 645         names := make([]string, 0, len(dn.inodes))
 646         for name := range dn.inodes {
 647                 names = append(names, name)
 648         }
 649         sort.Strings(names)
 650         for _, name := range names {
 651                 node := dn.inodes[name]
 652                 node.Lock()
 653                 defer node.Unlock()
 654         }
 655         if err := dn.sync(names); err != nil {
 656                 return "", err
 657         }
 658         for _, name := range names {
 659                 switch node := dn.inodes[name].(type) {
 660                 case *dirnode:
 661                         subdir, err := node.marshalManifest(prefix + "/" + name)
 662                         if err != nil {
 663                                 return "", err
 664                         }
 665                         subdirs = subdirs + subdir
 666                 case *filenode:
 667                         if len(node.segments) == 0 {
 668                                 fileparts = append(fileparts, filepart{name: name})
 669                                 break
 670                         }
 671                         for _, seg := range node.segments {
 672                                 switch seg := seg.(type) {
 673                                 case storedSegment:
 674                                         if len(blocks) > 0 && blocks[len(blocks)-1] == seg.locator {
 675                                                 streamLen -= int64(seg.size)
 676                                         } else {
 677                                                 blocks = append(blocks, seg.locator)
 678                                         }
 679                                         next := filepart{
 680                                                 name:   name,
 681                                                 offset: streamLen + int64(seg.offset),
 682                                                 length: int64(seg.length),
 683                                         }
 684                                         if prev := len(fileparts) - 1; prev >= 0 &&
 685                                                 fileparts[prev].name == name &&
 686                                                 fileparts[prev].offset+fileparts[prev].length == next.offset {
 687                                                 fileparts[prev].length += next.length
 688                                         } else {
 689                                                 fileparts = append(fileparts, next)
 690                                         }
 691                                         streamLen += int64(seg.size)
 692                                 default:
 693                                         // This can't happen: we
 694                                         // haven't unlocked since
 695                                         // calling sync().
 696                                         panic(fmt.Sprintf("can't marshal segment type %T", seg))
 697                                 }
 698                         }
 699                 default:
 700                         panic(fmt.Sprintf("can't marshal inode type %T", node))
 701                 }
 702         }
 703         var filetokens []string
 704         for _, s := range fileparts {
 705                 filetokens = append(filetokens, fmt.Sprintf("%d:%d:%s", s.offset, s.length, manifestEscape(s.name)))
 706         }
 707         if len(filetokens) == 0 {
 708                 return subdirs, nil
 709         } else if len(blocks) == 0 {
 710                 blocks = []string{"d41d8cd98f00b204e9800998ecf8427e+0"}
 711         }
 712         return manifestEscape(prefix) + " " + strings.Join(blocks, " ") + " " + strings.Join(filetokens, " ") + "\n" + subdirs, nil
 713 }
 714
 715 func (dn *dirnode) loadManifest(txt string) error {
 716         var dirname string
 717         streams := strings.Split(txt, "\n")
 718         if streams[len(streams)-1] != "" {
 719                 return fmt.Errorf("line %d: no trailing newline", len(streams))
 720         }
 721         streams = streams[:len(streams)-1]
 722         segments := []storedSegment{}
 723         for i, stream := range streams {
 724                 lineno := i + 1
 725                 var anyFileTokens bool
 726                 var pos int64
 727                 var segIdx int
 728                 segments = segments[:0]
 729                 for i, token := range strings.Split(stream, " ") {
 730                         if i == 0 {
 731                                 dirname = manifestUnescape(token)
 732                                 continue
 733                         }
 734                         if !strings.Contains(token, ":") {
 735                                 if anyFileTokens {
 736                                         return fmt.Errorf("line %d: bad file segment %q", lineno, token)
 737                                 }
 738                                 toks := strings.SplitN(token, "+", 3)
 739                                 if len(toks) < 2 {
 740                                         return fmt.Errorf("line %d: bad locator %q", lineno, token)
 741                                 }
 742                                 length, err := strconv.ParseInt(toks[1], 10, 32)
 743                                 if err != nil || length < 0 {
 744                                         return fmt.Errorf("line %d: bad locator %q", lineno, token)
 745                                 }
 746                                 segments = append(segments, storedSegment{
 747                                         locator: token,
 748                                         size:    int(length),
 749                                         offset:  0,
 750                                         length:  int(length),
 751                                 })
 752                                 continue
 753                         } else if len(segments) == 0 {
 754                                 return fmt.Errorf("line %d: bad locator %q", lineno, token)
 755                         }
 756
 757                         toks := strings.SplitN(token, ":", 3)
 758                         if len(toks) != 3 {
 759                                 return fmt.Errorf("line %d: bad file segment %q", lineno, token)
 760                         }
 761                         anyFileTokens = true
 762
 763                         offset, err := strconv.ParseInt(toks[0], 10, 64)
 764                         if err != nil || offset < 0 {
 765                                 return fmt.Errorf("line %d: bad file segment %q", lineno, token)
 766                         }
 767                         length, err := strconv.ParseInt(toks[1], 10, 64)
 768                         if err != nil || length < 0 {
 769                                 return fmt.Errorf("line %d: bad file segment %q", lineno, token)
 770                         }
 771                         name := dirname + "/" + manifestUnescape(toks[2])
 772                         fnode, err := dn.createFileAndParents(name)
 773                         if err != nil {
 774                                 return fmt.Errorf("line %d: cannot use path %q: %s", lineno, name, err)
 775                         }
 776                         // Map the stream offset/range coordinates to
 777                         // block/offset/range coordinates and add
 778                         // corresponding storedSegments to the filenode
 779                         if pos > offset {
 780                                 // Can't continue where we left off.
 781                                 // TODO: binary search instead of
 782                                 // rewinding all the way (but this
 783                                 // situation might be rare anyway)
 784                                 segIdx, pos = 0, 0
 785                         }
 786                         for next := int64(0); segIdx < len(segments); segIdx++ {
 787                                 seg := segments[segIdx]
 788                                 next = pos + int64(seg.Len())
 789                                 if next <= offset || seg.Len() == 0 {
 790                                         pos = next
 791                                         continue
 792                                 }
 793                                 if pos >= offset+length {
 794                                         break
 795                                 }
 796                                 var blkOff int
 797                                 if pos < offset {
 798                                         blkOff = int(offset - pos)
 799                                 }
 800                                 blkLen := seg.Len() - blkOff
 801                                 if pos+int64(blkOff+blkLen) > offset+length {
 802                                         blkLen = int(offset + length - pos - int64(blkOff))
 803                                 }
 804                                 fnode.appendSegment(storedSegment{
 805                                         kc:      dn.fs,
 806                                         locator: seg.locator,
 807                                         size:    seg.size,
 808                                         offset:  blkOff,
 809                                         length:  blkLen,
 810                                 })
 811                                 if next > offset+length {
 812                                         break
 813                                 } else {
 814                                         pos = next
 815                                 }
 816                         }
 817                         if segIdx == len(segments) && pos < offset+length {
 818                                 return fmt.Errorf("line %d: invalid segment in %d-byte stream: %q", lineno, pos, token)
 819                         }
 820                 }
 821                 if !anyFileTokens {
 822                         return fmt.Errorf("line %d: no file segments", lineno)
 823                 } else if len(segments) == 0 {
 824                         return fmt.Errorf("line %d: no locators", lineno)
 825                 } else if dirname == "" {
 826                         return fmt.Errorf("line %d: no stream name", lineno)
 827                 }
 828         }
 829         return nil
 830 }
 831
 832 // only safe to call from loadManifest -- no locking
 833 func (dn *dirnode) createFileAndParents(path string) (fn *filenode, err error) {
 834         var node inode = dn
 835         names := strings.Split(path, "/")
 836         basename := names[len(names)-1]
 837         if !permittedName(basename) {
 838                 err = fmt.Errorf("invalid file part %q in path %q", basename, path)
 839                 return
 840         }
 841         for _, name := range names[:len(names)-1] {
 842                 switch name {
 843                 case "", ".":
 844                         continue
 845                 case "..":
 846                         if node == dn {
 847                                 // can't be sure parent will be a *dirnode
 848                                 return nil, ErrInvalidArgument
 849                         }
 850                         node = node.Parent()
 851                         continue
 852                 }
 853                 node, err = node.Child(name, func(child inode) (inode, error) {
 854                         if child == nil {
 855                                 child, err := node.FS().newNode(name, 0755|os.ModeDir, node.Parent().FileInfo().ModTime())
 856                                 if err != nil {
 857                                         return nil, err
 858                                 }
 859                                 child.SetParent(node, name)
 860                                 return child, nil
 861                         } else if !child.IsDir() {
 862                                 return child, ErrFileExists
 863                         } else {
 864                                 return child, nil
 865                         }
 866                 })
 867                 if err != nil {
 868                         return
 869                 }
 870         }
 871         _, err = node.Child(basename, func(child inode) (inode, error) {
 872                 switch child := child.(type) {
 873                 case nil:
 874                         child, err = node.FS().newNode(basename, 0755, node.FileInfo().ModTime())
 875                         if err != nil {
 876                                 return nil, err
 877                         }
 878                         child.SetParent(node, basename)
 879                         fn = child.(*filenode)
 880                         return child, nil
 881                 case *filenode:
 882                         fn = child
 883                         return child, nil
 884                 case *dirnode:
 885                         return child, ErrIsDirectory
 886                 default:
 887                         return child, ErrInvalidArgument
 888                 }
 889         })
 890         return
 891 }
 892
 893 func (dn *dirnode) TreeSize() (bytes int64) {
 894         dn.RLock()
 895         defer dn.RUnlock()
 896         for _, i := range dn.inodes {
 897                 switch i := i.(type) {
 898                 case *filenode:
 899                         bytes += i.Size()
 900                 case *dirnode:
 901                         bytes += i.TreeSize()
 902                 }
 903         }
 904         return
 905 }
 906
 907 type segment interface {
 908         io.ReaderAt
 909         Len() int
 910         // Return a new segment with a subsection of the data from this
 911         // one. length<0 means length=Len()-off.
 912         Slice(off int, length int) segment
 913 }
 914
 915 type memSegment struct {
 916         buf []byte
 917 }
 918
 919 func (me *memSegment) Len() int {
 920         return len(me.buf)
 921 }
 922
 923 func (me *memSegment) Slice(off, length int) segment {
 924         if length < 0 {
 925                 length = len(me.buf) - off
 926         }
 927         buf := make([]byte, length)
 928         copy(buf, me.buf[off:])
 929         return &memSegment{buf: buf}
 930 }
 931
 932 func (me *memSegment) Truncate(n int) {
 933         if n > cap(me.buf) {
 934                 newsize := 1024
 935                 for newsize < n {
 936                         newsize = newsize << 2
 937                 }
 938                 newbuf := make([]byte, n, newsize)
 939                 copy(newbuf, me.buf)
 940                 me.buf = newbuf
 941         } else {
 942                 // Zero unused part when shrinking, in case we grow
 943                 // and start using it again later.
 944                 for i := n; i < len(me.buf); i++ {
 945                         me.buf[i] = 0
 946                 }
 947         }
 948         me.buf = me.buf[:n]
 949 }
 950
 951 func (me *memSegment) WriteAt(p []byte, off int) {
 952         if off+len(p) > len(me.buf) {
 953                 panic("overflowed segment")
 954         }
 955         copy(me.buf[off:], p)
 956 }
 957
 958 func (me *memSegment) ReadAt(p []byte, off int64) (n int, err error) {
 959         if off > int64(me.Len()) {
 960                 err = io.EOF
 961                 return
 962         }
 963         n = copy(p, me.buf[int(off):])
 964         if n < len(p) {
 965                 err = io.EOF
 966         }
 967         return
 968 }
 969
 970 type storedSegment struct {
 971         kc      fsBackend
 972         locator string
 973         size    int // size of stored block (also encoded in locator)
 974         offset  int // position of segment within the stored block
 975         length  int // bytes in this segment (offset + length <= size)
 976 }
 977
 978 func (se storedSegment) Len() int {
 979         return se.length
 980 }
 981
 982 func (se storedSegment) Slice(n, size int) segment {
 983         se.offset += n
 984         se.length -= n
 985         if size >= 0 && se.length > size {
 986                 se.length = size
 987         }
 988         return se
 989 }
 990
 991 func (se storedSegment) ReadAt(p []byte, off int64) (n int, err error) {
 992         if off > int64(se.length) {
 993                 return 0, io.EOF
 994         }
 995         maxlen := se.length - int(off)
 996         if len(p) > maxlen {
 997                 p = p[:maxlen]
 998                 n, err = se.kc.ReadAt(se.locator, p, int(off)+se.offset)
 999                 if err == nil {
1000                         err = io.EOF
1001                 }
1002                 return
1003         }
1004         return se.kc.ReadAt(se.locator, p, int(off)+se.offset)
1005 }
1006
1007 func canonicalName(name string) string {
1008         name = path.Clean("/" + name)
1009         if name == "/" || name == "./" {
1010                 name = "."
1011         } else if strings.HasPrefix(name, "/") {
1012                 name = "." + name
1013         }
1014         return name
1015 }
1016
1017 var manifestEscapeSeq = regexp.MustCompile(`\\([0-7]{3}|\\)`)
1018
1019 func manifestUnescapeFunc(seq string) string {
1020         if seq == `\\` {
1021                 return `\`
1022         }
1023         i, err := strconv.ParseUint(seq[1:], 8, 8)
1024         if err != nil {
1025                 // Invalid escape sequence: can't unescape.
1026                 return seq
1027         }
1028         return string([]byte{byte(i)})
1029 }
1030
1031 func manifestUnescape(s string) string {
1032         return manifestEscapeSeq.ReplaceAllStringFunc(s, manifestUnescapeFunc)
1033 }
1034
1035 var manifestEscapedChar = regexp.MustCompile(`[\000-\040:\s\\]`)
1036
1037 func manifestEscapeFunc(seq string) string {
1038         return fmt.Sprintf("\\%03o", byte(seq[0]))
1039 }
1040
1041 func manifestEscape(s string) string {
1042         return manifestEscapedChar.ReplaceAllStringFunc(s, manifestEscapeFunc)
1043 }