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):
33 self._file = open(filename, 'rb')
43 def metadata_at(self, ofs):
45 return metadata.Metadata.read(self._file)
48 class MetaStoreWriter:
49 # For now, we just append to the file, and try to handle any
50 # truncation or corruption somewhat sensibly.
52 def __init__(self, filename):
53 # Map metadata hashes to bupindex.meta offsets.
55 self._filename = filename
57 # FIXME: see how slow this is; does it matter?
58 m_file = open(filename, 'ab+')
63 m = metadata.Metadata.read(m_file)
65 m_encoded = m.encode()
66 self._offsets[m_encoded] = m_off
68 m = metadata.Metadata.read(m_file)
72 log('index metadata in %r appears to be corrupt' % filename)
76 self._file = open(filename, 'ab')
87 def store(self, metadata):
88 meta_encoded = metadata.encode(include_path=False)
89 ofs = self._offsets.get(meta_encoded)
92 ofs = self._file.tell()
93 self._file.write(meta_encoded)
94 self._offsets[meta_encoded] = ofs
99 def __init__(self, ename, parent):
106 (ofs,n) = (f.tell(), len(self.list))
108 count = len(self.list)
109 #log('popping %r with %d entries\n'
110 # % (''.join(self.ename), count))
114 self.parent.count += count + self.count
118 def _golevel(level, f, ename, newentry, metastore, tmax):
119 # close nodes back up the tree
121 default_meta_ofs = metastore.store(metadata.Metadata())
122 while ename[:len(level.ename)] != level.ename:
123 n = BlankNewEntry(level.ename[-1], default_meta_ofs, tmax)
125 (n.children_ofs,n.children_n) = level.write(f)
126 level.parent.list.append(n)
129 # create nodes down the tree
130 while len(level.ename) < len(ename):
131 level = Level(ename[:len(level.ename)+1], level)
133 # are we in precisely the right place?
134 assert(ename == level.ename)
136 BlankNewEntry(ename and level.ename[-1] or None, default_meta_ofs, tmax)
137 (n.children_ofs,n.children_n) = level.write(f)
139 level.parent.list.append(n)
146 def __init__(self, basename, name, meta_ofs, tmax):
147 self.basename = str(basename)
148 self.name = str(name)
149 self.meta_ofs = meta_ofs
151 self.children_ofs = 0
155 return ("(%s,0x%04x,%d,%d,%d,%d,%d,%d,%d,%d,%s/%s,0x%04x,%d,0x%08x/%d)"
156 % (self.name, self.dev, self.ino, self.nlink,
157 self.ctime, self.mtime, self.atime, self.uid, self.gid,
158 self.size, self.mode, self.gitmode,
159 self.flags, self.meta_ofs,
160 self.children_ofs, self.children_n))
164 ctime = xstat.nsecs_to_timespec(self.ctime)
165 mtime = xstat.nsecs_to_timespec(self.mtime)
166 atime = xstat.nsecs_to_timespec(self.atime)
167 return struct.pack(INDEX_SIG,
168 self.dev, self.ino, self.nlink,
172 self.uid, self.gid, self.size, self.mode,
173 self.gitmode, self.sha, self.flags,
174 self.children_ofs, self.children_n,
176 except (DeprecationWarning, struct.error), e:
177 log('pack error: %s (%r)\n' % (e, self))
180 def from_stat(self, st, meta_ofs, tstart, check_device=True):
181 old = (self.dev if check_device else 0,
182 self.ino, self.nlink, self.ctime, self.mtime,
183 self.uid, self.gid, self.size, self.flags & IX_EXISTS)
184 new = (st.st_dev if check_device else 0,
185 st.st_ino, st.st_nlink, st.st_ctime, st.st_mtime,
186 st.st_uid, st.st_gid, st.st_size, IX_EXISTS)
189 self.nlink = st.st_nlink
190 self.ctime = st.st_ctime
191 self.mtime = st.st_mtime
192 self.atime = st.st_atime
195 self.size = st.st_size
196 self.mode = st.st_mode
197 self.flags |= IX_EXISTS
198 self.meta_ofs = meta_ofs
199 # Check that the ctime's "second" is at or after tstart's.
200 ctime_sec_in_ns = xstat.fstime_floor_secs(st.st_ctime) * 10**9
201 if ctime_sec_in_ns >= tstart or old != new \
202 or self.sha == EMPTY_SHA or not self.gitmode:
208 self.uid += 0x100000000
210 self.gid += 0x100000000
211 assert(self.uid >= 0)
212 assert(self.gid >= 0)
213 self.mtime = self._fixup_time(self.mtime)
214 self.ctime = self._fixup_time(self.ctime)
216 def _fixup_time(self, t):
217 if self.tmax != None and t > self.tmax:
223 f = IX_HASHVALID|IX_EXISTS
224 return (self.flags & f) == f
226 def invalidate(self):
227 self.flags &= ~IX_HASHVALID
229 def validate(self, gitmode, sha):
232 assert(gitmode+0 == gitmode)
233 self.gitmode = gitmode
235 self.flags |= IX_HASHVALID|IX_EXISTS
238 return not self.is_deleted()
240 def sha_missing(self):
241 return (self.flags & IX_SHAMISSING) or not (self.flags & IX_HASHVALID)
243 def is_deleted(self):
244 return (self.flags & IX_EXISTS) == 0
246 def set_deleted(self):
247 if self.flags & IX_EXISTS:
248 self.flags &= ~(IX_EXISTS | IX_HASHVALID)
251 return not self.is_fake()
254 return not self.ctime
257 return (cmp(b.name, a.name)
258 or cmp(a.is_valid(), b.is_valid())
259 or cmp(a.is_fake(), b.is_fake()))
262 f.write(self.basename + '\0' + self.packed())
265 class NewEntry(Entry):
266 def __init__(self, basename, name, tmax, dev, ino, nlink,
268 uid, gid, size, mode, gitmode, sha, flags, meta_ofs,
269 children_ofs, children_n):
270 Entry.__init__(self, basename, name, meta_ofs, tmax)
271 (self.dev, self.ino, self.nlink, self.ctime, self.mtime, self.atime,
272 self.uid, self.gid, self.size, self.mode, self.gitmode, self.sha,
273 self.flags, self.children_ofs, self.children_n
274 ) = (dev, ino, nlink, ctime, mtime, atime, uid, gid,
275 size, mode, gitmode, sha, flags, children_ofs, children_n)
279 class BlankNewEntry(NewEntry):
280 def __init__(self, basename, meta_ofs, tmax):
281 NewEntry.__init__(self, basename, basename, tmax,
282 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
283 0, EMPTY_SHA, 0, meta_ofs, 0, 0)
286 class ExistingEntry(Entry):
287 def __init__(self, parent, basename, name, m, ofs):
288 Entry.__init__(self, basename, name, None, None)
292 (self.dev, self.ino, self.nlink,
293 self.ctime, ctime_ns, self.mtime, mtime_ns, self.atime, atime_ns,
294 self.uid, self.gid, self.size, self.mode, self.gitmode, self.sha,
295 self.flags, self.children_ofs, self.children_n, self.meta_ofs
296 ) = struct.unpack(INDEX_SIG, str(buffer(m, ofs, ENTLEN)))
297 self.atime = xstat.timespec_to_nsecs((self.atime, atime_ns))
298 self.mtime = xstat.timespec_to_nsecs((self.mtime, mtime_ns))
299 self.ctime = xstat.timespec_to_nsecs((self.ctime, ctime_ns))
301 # effectively, we don't bother messing with IX_SHAMISSING if
302 # not IX_HASHVALID, since it's redundant, and repacking is more
303 # expensive than not repacking.
304 # This is implemented by having sha_missing() check IX_HASHVALID too.
305 def set_sha_missing(self, val):
307 oldval = self.sha_missing() and 1 or 0
309 flag = val and IX_SHAMISSING or 0
310 newflags = (self.flags & (~IX_SHAMISSING)) | flag
311 self.flags = newflags
314 def unset_sha_missing(self, flag):
315 if self.flags & IX_SHAMISSING:
316 self.flags &= ~IX_SHAMISSING
320 self._m[self._ofs:self._ofs+ENTLEN] = self.packed()
321 if self.parent and not self.is_valid():
322 self.parent.invalidate()
325 def iter(self, name=None, wantrecurse=None):
327 if dname and not dname.endswith('/'):
329 ofs = self.children_ofs
330 assert(ofs <= len(self._m))
331 assert(self.children_n < 1000000)
332 for i in xrange(self.children_n):
333 eon = self._m.find('\0', ofs)
337 basename = str(buffer(self._m, ofs, eon-ofs))
338 child = ExistingEntry(self, basename, self.name + basename,
341 or child.name.startswith(dname)
342 or child.name.endswith('/') and dname.startswith(child.name)):
343 if not wantrecurse or wantrecurse(child):
344 for e in child.iter(name=name, wantrecurse=wantrecurse):
346 if not name or child.name == name or child.name.startswith(dname):
348 ofs = eon + 1 + ENTLEN
355 def __init__(self, filename):
356 self.filename = filename
358 self.writable = False
362 f = open(filename, 'r+')
364 if e.errno == errno.ENOENT:
369 b = f.read(len(INDEX_HDR))
371 log('warning: %s: header: expected %r, got %r\n'
372 % (filename, INDEX_HDR, b))
374 st = os.fstat(f.fileno())
376 self.m = mmap_readwrite(f)
378 self.count = struct.unpack(FOOTER_SIG,
379 str(buffer(self.m, st.st_size-FOOTLEN, FOOTLEN)))[0]
385 return int(self.count)
387 def forward_iter(self):
389 while ofs+ENTLEN <= len(self.m)-FOOTLEN:
390 eon = self.m.find('\0', ofs)
394 basename = str(buffer(self.m, ofs, eon-ofs))
395 yield ExistingEntry(None, basename, basename, self.m, eon+1)
396 ofs = eon + 1 + ENTLEN
398 def iter(self, name=None, wantrecurse=None):
399 if len(self.m) > len(INDEX_HDR)+ENTLEN:
401 if dname and not dname.endswith('/'):
403 root = ExistingEntry(None, '/', '/',
404 self.m, len(self.m)-FOOTLEN-ENTLEN)
405 for sub in root.iter(name=name, wantrecurse=wantrecurse):
407 if not dname or dname == root.name:
417 if self.writable and self.m:
422 if self.writable and self.m:
425 self.writable = False
427 def filter(self, prefixes, wantrecurse=None):
428 for (rp, path) in reduce_paths(prefixes):
429 for e in self.iter(rp, wantrecurse=wantrecurse):
430 assert(e.name.startswith(rp))
431 name = path + e.name[len(rp):]
435 # FIXME: this function isn't very generic, because it splits the filename
436 # in an odd way and depends on a terminating '/' to indicate directories.
438 """Split a path into a list of elements of the file system hierarchy."""
440 l = [i+'/' for i in l[:-1]] + l[-1:]
442 l.pop() # extra blank caused by terminating '/'
447 def __init__(self, filename, metastore, tmax):
448 self.rootlevel = self.level = Level([], None)
453 self.filename = filename = realpath(filename)
454 self.metastore = metastore
456 (dir,name) = os.path.split(filename)
457 (ffd,self.tmpname) = tempfile.mkstemp('.tmp', filename, dir)
458 self.f = os.fdopen(ffd, 'wb', 65536)
459 self.f.write(INDEX_HDR)
469 os.unlink(self.tmpname)
473 self.level = _golevel(self.level, self.f, [], None,
474 self.metastore, self.tmax)
475 self.count = self.rootlevel.count
478 self.f.write(struct.pack(FOOTER_SIG, self.count))
480 assert(self.level == None)
488 os.rename(self.tmpname, self.filename)
490 def _add(self, ename, entry):
491 if self.lastfile and self.lastfile <= ename:
492 raise Error('%r must come before %r'
493 % (''.join(ename), ''.join(self.lastfile)))
494 self.lastfile = ename
495 self.level = _golevel(self.level, self.f, ename, entry,
496 self.metastore, self.tmax)
498 def add(self, name, st, meta_ofs, hashgen = None):
499 endswith = name.endswith('/')
500 ename = pathsplit(name)
502 #log('add: %r %r\n' % (basename, name))
506 (gitmode, sha) = hashgen(name)
507 flags |= IX_HASHVALID
509 (gitmode, sha) = (0, EMPTY_SHA)
511 isdir = stat.S_ISDIR(st.st_mode)
512 assert(isdir == endswith)
513 e = NewEntry(basename, name, self.tmax,
514 st.st_dev, st.st_ino, st.st_nlink,
515 st.st_ctime, st.st_mtime, st.st_atime,
516 st.st_uid, st.st_gid,
517 st.st_size, st.st_mode, gitmode, sha, flags,
521 meta_ofs = self.metastore.store(metadata.Metadata())
522 e = BlankNewEntry(basename, meta_ofs, self.tmax)
528 def add_ixentry(self, e):
529 e.children_ofs = e.children_n = 0
530 self._add(pathsplit(e.name), e)
532 def new_reader(self):
534 return Reader(self.tmpname)
537 def reduce_paths(paths):
543 if stat.S_ISDIR(st.st_mode):
546 xpaths.append((rp, p))
548 add_error('reduce_paths: %s' % e)
553 for (rp, p) in xpaths:
554 if prev and (prev == rp
555 or (prev.endswith('/') and rp.startswith(prev))):
556 continue # already superceded by previous path
557 paths.append((rp, p))
559 paths.sort(reverse=True)
563 def pfunc(count, total):
564 qprogress('bup: merging indexes (%d/%d)\r' % (count, total))
565 def pfinal(count, total):
566 progress('bup: merging indexes (%d/%d), done.\n' % (count, total))
567 return merge_iter(iters, 1024, pfunc, pfinal, key='name')