1 import metadata, os, stat, struct, tempfile
3 from bup.helpers import *
8 INDEX_HDR = 'BUPI\0\0\0\5'
10 # Time values are handled as integer nanoseconds since the epoch in
11 # memory, but are written as xstat/metadata timespecs. This behavior
12 # matches the existing metadata/xstat/.bupm code.
14 # Record times (mtime, ctime, atime) as xstat/metadata timespecs, and
15 # store all of the times in the index so they won't interfere with the
16 # forthcoming metadata cache.
17 INDEX_SIG = '!QQQqQqQqQIIQII20sHIIQ'
19 ENTLEN = struct.calcsize(INDEX_SIG)
21 FOOTLEN = struct.calcsize(FOOTER_SIG)
23 IX_EXISTS = 0x8000 # file exists on filesystem
24 IX_HASHVALID = 0x4000 # the stored sha1 matches the filesystem
25 IX_SHAMISSING = 0x2000 # the stored sha1 object doesn't seem to exist
27 class Error(Exception):
31 class MetaStoreReader:
32 def __init__(self, filename):
34 self._file = open(filename, 'rb')
44 def metadata_at(self, ofs):
46 return metadata.Metadata.read(self._file)
49 class MetaStoreWriter:
50 # For now, we just append to the file, and try to handle any
51 # truncation or corruption somewhat sensibly.
53 def __init__(self, filename):
54 # Map metadata hashes to bupindex.meta offsets.
56 self._filename = filename
58 # FIXME: see how slow this is; does it matter?
59 m_file = open(filename, 'ab+')
64 m = metadata.Metadata.read(m_file)
66 m_encoded = m.encode()
67 self._offsets[m_encoded] = m_off
69 m = metadata.Metadata.read(m_file)
73 log('index metadata in %r appears to be corrupt' % filename)
77 self._file = open(filename, 'ab')
88 def store(self, metadata):
89 meta_encoded = metadata.encode(include_path=False)
90 ofs = self._offsets.get(meta_encoded)
93 ofs = self._file.tell()
94 self._file.write(meta_encoded)
95 self._offsets[meta_encoded] = ofs
100 def __init__(self, ename, parent):
107 (ofs,n) = (f.tell(), len(self.list))
109 count = len(self.list)
110 #log('popping %r with %d entries\n'
111 # % (''.join(self.ename), count))
115 self.parent.count += count + self.count
119 def _golevel(level, f, ename, newentry, metastore, tmax):
120 # close nodes back up the tree
122 default_meta_ofs = metastore.store(metadata.Metadata())
123 while ename[:len(level.ename)] != level.ename:
124 n = BlankNewEntry(level.ename[-1], default_meta_ofs, tmax)
126 (n.children_ofs,n.children_n) = level.write(f)
127 level.parent.list.append(n)
130 # create nodes down the tree
131 while len(level.ename) < len(ename):
132 level = Level(ename[:len(level.ename)+1], level)
134 # are we in precisely the right place?
135 assert(ename == level.ename)
137 BlankNewEntry(ename and level.ename[-1] or None, default_meta_ofs, tmax)
138 (n.children_ofs,n.children_n) = level.write(f)
140 level.parent.list.append(n)
147 def __init__(self, basename, name, meta_ofs, tmax):
148 self.basename = str(basename)
149 self.name = str(name)
150 self.meta_ofs = meta_ofs
152 self.children_ofs = 0
156 return ("(%s,0x%04x,%d,%d,%d,%d,%d,%d,%d,%d,%s/%s,0x%04x,%d,0x%08x/%d)"
157 % (self.name, self.dev, self.ino, self.nlink,
158 self.ctime, self.mtime, self.atime, self.uid, self.gid,
159 self.size, self.mode, self.gitmode,
160 self.flags, self.meta_ofs,
161 self.children_ofs, self.children_n))
165 ctime = xstat.nsecs_to_timespec(self.ctime)
166 mtime = xstat.nsecs_to_timespec(self.mtime)
167 atime = xstat.nsecs_to_timespec(self.atime)
168 return struct.pack(INDEX_SIG,
169 self.dev, self.ino, self.nlink,
173 self.uid, self.gid, self.size, self.mode,
174 self.gitmode, self.sha, self.flags,
175 self.children_ofs, self.children_n,
177 except (DeprecationWarning, struct.error), e:
178 log('pack error: %s (%r)\n' % (e, self))
181 def from_stat(self, st, meta_ofs, tstart, check_device=True):
182 old = (self.dev if check_device else 0,
183 self.ino, self.nlink, self.ctime, self.mtime,
184 self.uid, self.gid, self.size, self.flags & IX_EXISTS)
185 new = (st.st_dev if check_device else 0,
186 st.st_ino, st.st_nlink, st.st_ctime, st.st_mtime,
187 st.st_uid, st.st_gid, st.st_size, IX_EXISTS)
190 self.nlink = st.st_nlink
191 self.ctime = st.st_ctime
192 self.mtime = st.st_mtime
193 self.atime = st.st_atime
196 self.size = st.st_size
197 self.mode = st.st_mode
198 self.flags |= IX_EXISTS
199 self.meta_ofs = meta_ofs
200 # Check that the ctime's "second" is at or after tstart's.
201 ctime_sec_in_ns = xstat.fstime_floor_secs(st.st_ctime) * 10**9
202 if ctime_sec_in_ns >= tstart or old != new \
203 or self.sha == EMPTY_SHA or not self.gitmode:
208 self.mtime = self._fixup_time(self.mtime)
209 self.ctime = self._fixup_time(self.ctime)
211 def _fixup_time(self, t):
212 if self.tmax != None and t > self.tmax:
218 f = IX_HASHVALID|IX_EXISTS
219 return (self.flags & f) == f
221 def invalidate(self):
222 self.flags &= ~IX_HASHVALID
224 def validate(self, gitmode, sha):
227 assert(gitmode+0 == gitmode)
228 self.gitmode = gitmode
230 self.flags |= IX_HASHVALID|IX_EXISTS
233 return not self.is_deleted()
235 def sha_missing(self):
236 return (self.flags & IX_SHAMISSING) or not (self.flags & IX_HASHVALID)
238 def is_deleted(self):
239 return (self.flags & IX_EXISTS) == 0
241 def set_deleted(self):
242 if self.flags & IX_EXISTS:
243 self.flags &= ~(IX_EXISTS | IX_HASHVALID)
246 return not self.is_fake()
249 return not self.ctime
252 return (cmp(b.name, a.name)
253 or cmp(a.is_valid(), b.is_valid())
254 or cmp(a.is_fake(), b.is_fake()))
257 f.write(self.basename + '\0' + self.packed())
260 class NewEntry(Entry):
261 def __init__(self, basename, name, tmax, dev, ino, nlink,
263 uid, gid, size, mode, gitmode, sha, flags, meta_ofs,
264 children_ofs, children_n):
265 Entry.__init__(self, basename, name, meta_ofs, tmax)
266 (self.dev, self.ino, self.nlink, self.ctime, self.mtime, self.atime,
267 self.uid, self.gid, self.size, self.mode, self.gitmode, self.sha,
268 self.flags, self.children_ofs, self.children_n
269 ) = (dev, ino, nlink, ctime, mtime, atime, uid, gid,
270 size, mode, gitmode, sha, flags, children_ofs, children_n)
274 class BlankNewEntry(NewEntry):
275 def __init__(self, basename, meta_ofs, tmax):
276 NewEntry.__init__(self, basename, basename, tmax,
277 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
278 0, EMPTY_SHA, 0, meta_ofs, 0, 0)
281 class ExistingEntry(Entry):
282 def __init__(self, parent, basename, name, m, ofs):
283 Entry.__init__(self, basename, name, None, None)
287 (self.dev, self.ino, self.nlink,
288 self.ctime, ctime_ns, self.mtime, mtime_ns, self.atime, atime_ns,
289 self.uid, self.gid, self.size, self.mode, self.gitmode, self.sha,
290 self.flags, self.children_ofs, self.children_n, self.meta_ofs
291 ) = struct.unpack(INDEX_SIG, str(buffer(m, ofs, ENTLEN)))
292 self.atime = xstat.timespec_to_nsecs((self.atime, atime_ns))
293 self.mtime = xstat.timespec_to_nsecs((self.mtime, mtime_ns))
294 self.ctime = xstat.timespec_to_nsecs((self.ctime, ctime_ns))
296 # effectively, we don't bother messing with IX_SHAMISSING if
297 # not IX_HASHVALID, since it's redundant, and repacking is more
298 # expensive than not repacking.
299 # This is implemented by having sha_missing() check IX_HASHVALID too.
300 def set_sha_missing(self, val):
302 oldval = self.sha_missing() and 1 or 0
304 flag = val and IX_SHAMISSING or 0
305 newflags = (self.flags & (~IX_SHAMISSING)) | flag
306 self.flags = newflags
309 def unset_sha_missing(self, flag):
310 if self.flags & IX_SHAMISSING:
311 self.flags &= ~IX_SHAMISSING
315 self._m[self._ofs:self._ofs+ENTLEN] = self.packed()
316 if self.parent and not self.is_valid():
317 self.parent.invalidate()
320 def iter(self, name=None, wantrecurse=None):
322 if dname and not dname.endswith('/'):
324 ofs = self.children_ofs
325 assert(ofs <= len(self._m))
326 assert(self.children_n < 1000000)
327 for i in xrange(self.children_n):
328 eon = self._m.find('\0', ofs)
332 basename = str(buffer(self._m, ofs, eon-ofs))
333 child = ExistingEntry(self, basename, self.name + basename,
336 or child.name.startswith(dname)
337 or child.name.endswith('/') and dname.startswith(child.name)):
338 if not wantrecurse or wantrecurse(child):
339 for e in child.iter(name=name, wantrecurse=wantrecurse):
341 if not name or child.name == name or child.name.startswith(dname):
343 ofs = eon + 1 + ENTLEN
350 def __init__(self, filename):
351 self.filename = filename
353 self.writable = False
357 f = open(filename, 'r+')
359 if e.errno == errno.ENOENT:
364 b = f.read(len(INDEX_HDR))
366 log('warning: %s: header: expected %r, got %r\n'
367 % (filename, INDEX_HDR, b))
369 st = os.fstat(f.fileno())
371 self.m = mmap_readwrite(f)
373 self.count = struct.unpack(FOOTER_SIG,
374 str(buffer(self.m, st.st_size-FOOTLEN, FOOTLEN)))[0]
380 return int(self.count)
382 def forward_iter(self):
384 while ofs+ENTLEN <= len(self.m)-FOOTLEN:
385 eon = self.m.find('\0', ofs)
389 basename = str(buffer(self.m, ofs, eon-ofs))
390 yield ExistingEntry(None, basename, basename, self.m, eon+1)
391 ofs = eon + 1 + ENTLEN
393 def iter(self, name=None, wantrecurse=None):
394 if len(self.m) > len(INDEX_HDR)+ENTLEN:
396 if dname and not dname.endswith('/'):
398 root = ExistingEntry(None, '/', '/',
399 self.m, len(self.m)-FOOTLEN-ENTLEN)
400 for sub in root.iter(name=name, wantrecurse=wantrecurse):
402 if not dname or dname == root.name:
412 if self.writable and self.m:
417 if self.writable and self.m:
420 self.writable = False
422 def filter(self, prefixes, wantrecurse=None):
423 for (rp, path) in reduce_paths(prefixes):
424 for e in self.iter(rp, wantrecurse=wantrecurse):
425 assert(e.name.startswith(rp))
426 name = path + e.name[len(rp):]
430 # FIXME: this function isn't very generic, because it splits the filename
431 # in an odd way and depends on a terminating '/' to indicate directories.
433 """Split a path into a list of elements of the file system hierarchy."""
435 l = [i+'/' for i in l[:-1]] + l[-1:]
437 l.pop() # extra blank caused by terminating '/'
442 def __init__(self, filename, metastore, tmax):
443 self.rootlevel = self.level = Level([], None)
448 self.filename = filename = realpath(filename)
449 self.metastore = metastore
451 (dir,name) = os.path.split(filename)
452 (ffd,self.tmpname) = tempfile.mkstemp('.tmp', filename, dir)
453 self.f = os.fdopen(ffd, 'wb', 65536)
454 self.f.write(INDEX_HDR)
464 os.unlink(self.tmpname)
468 self.level = _golevel(self.level, self.f, [], None,
469 self.metastore, self.tmax)
470 self.count = self.rootlevel.count
473 self.f.write(struct.pack(FOOTER_SIG, self.count))
475 assert(self.level == None)
483 os.rename(self.tmpname, self.filename)
485 def _add(self, ename, entry):
486 if self.lastfile and self.lastfile <= ename:
487 raise Error('%r must come before %r'
488 % (''.join(ename), ''.join(self.lastfile)))
489 self.lastfile = ename
490 self.level = _golevel(self.level, self.f, ename, entry,
491 self.metastore, self.tmax)
493 def add(self, name, st, meta_ofs, hashgen = None):
494 endswith = name.endswith('/')
495 ename = pathsplit(name)
497 #log('add: %r %r\n' % (basename, name))
501 (gitmode, sha) = hashgen(name)
502 flags |= IX_HASHVALID
504 (gitmode, sha) = (0, EMPTY_SHA)
506 isdir = stat.S_ISDIR(st.st_mode)
507 assert(isdir == endswith)
508 e = NewEntry(basename, name, self.tmax,
509 st.st_dev, st.st_ino, st.st_nlink,
510 st.st_ctime, st.st_mtime, st.st_atime,
511 st.st_uid, st.st_gid,
512 st.st_size, st.st_mode, gitmode, sha, flags,
516 meta_ofs = self.metastore.store(metadata.Metadata())
517 e = BlankNewEntry(basename, meta_ofs, self.tmax)
523 def add_ixentry(self, e):
524 e.children_ofs = e.children_n = 0
525 self._add(pathsplit(e.name), e)
527 def new_reader(self):
529 return Reader(self.tmpname)
532 def reduce_paths(paths):
538 if stat.S_ISDIR(st.st_mode):
541 xpaths.append((rp, p))
543 add_error('reduce_paths: %s' % e)
548 for (rp, p) in xpaths:
549 if prev and (prev == rp
550 or (prev.endswith('/') and rp.startswith(prev))):
551 continue # already superceded by previous path
552 paths.append((rp, p))
554 paths.sort(reverse=True)
558 def pfunc(count, total):
559 qprogress('bup: merging indexes (%d/%d)\r' % (count, total))
560 def pfinal(count, total):
561 progress('bup: merging indexes (%d/%d), done.\n' % (count, total))
562 return merge_iter(iters, 1024, pfunc, pfinal, key='name')