1 import os, stat, time, struct, tempfile
6 INDEX_HDR = 'BUPI\0\0\0\2'
7 INDEX_SIG = '!IIIIIQII20sHII'
8 ENTLEN = struct.calcsize(INDEX_SIG)
10 FOOTLEN = struct.calcsize(FOOTER_SIG)
15 class Error(Exception):
20 def __init__(self, ename, parent):
27 (ofs,n) = (f.tell(), len(self.list))
29 count = len(self.list)
30 #log('popping %r with %d entries\n'
31 # % (''.join(self.ename), count))
35 self.parent.count += count + self.count
39 def _golevel(level, f, ename, newentry):
40 # close nodes back up the tree
42 while ename[:len(level.ename)] != level.ename:
43 n = BlankNewEntry(level.ename[-1])
44 (n.children_ofs,n.children_n) = level.write(f)
45 level.parent.list.append(n)
48 # create nodes down the tree
49 while len(level.ename) < len(ename):
50 level = Level(ename[:len(level.ename)+1], level)
52 # are we in precisely the right place?
53 assert(ename == level.ename)
54 n = newentry or BlankNewEntry(ename and level.ename[-1] or None)
55 (n.children_ofs,n.children_n) = level.write(f)
57 level.parent.list.append(n)
64 def __init__(self, basename, name):
65 self.basename = str(basename)
71 return ("(%s,0x%04x,%d,%d,%d,%d,%d,0x%04x,0x%08x/%d)"
72 % (self.name, self.dev,
73 self.ctime, self.mtime, self.uid, self.gid,
74 self.size, self.flags, self.children_ofs, self.children_n))
77 return struct.pack(INDEX_SIG,
78 self.dev, self.ctime, self.mtime,
79 self.uid, self.gid, self.size, self.mode,
80 self.gitmode, self.sha, self.flags,
81 self.children_ofs, self.children_n)
83 def from_stat(self, st, tstart):
84 old = (self.dev, self.ctime, self.mtime,
85 self.uid, self.gid, self.size, self.flags & IX_EXISTS)
86 new = (st.st_dev, int(st.st_ctime), int(st.st_mtime),
87 st.st_uid, st.st_gid, st.st_size, IX_EXISTS)
89 self.ctime = int(st.st_ctime)
90 self.mtime = int(st.st_mtime)
93 self.size = st.st_size
94 self.mode = st.st_mode
95 self.flags |= IX_EXISTS
96 if int(st.st_ctime) >= tstart or old != new:
100 f = IX_HASHVALID|IX_EXISTS
101 return (self.flags & f) == f
103 def invalidate(self):
104 self.flags &= ~IX_HASHVALID
106 def validate(self, gitmode, sha):
108 self.gitmode = gitmode
110 self.flags |= IX_HASHVALID|IX_EXISTS
113 return not self.is_deleted()
115 def is_deleted(self):
116 return (self.flags & IX_EXISTS) == 0
118 def set_deleted(self):
119 if self.flags & IX_EXISTS:
120 self.flags &= ~(IX_EXISTS | IX_HASHVALID)
123 return not self.is_fake()
126 return not self.ctime
129 return (cmp(a.name, b.name)
130 or -cmp(a.is_valid(), b.is_valid())
131 or -cmp(a.is_fake(), b.is_fake()))
134 f.write(self.basename + '\0' + self.packed())
137 class NewEntry(Entry):
138 def __init__(self, basename, name, dev, ctime, mtime, uid, gid,
139 size, mode, gitmode, sha, flags, children_ofs, children_n):
140 Entry.__init__(self, basename, name)
141 (self.dev, self.ctime, self.mtime, self.uid, self.gid,
142 self.size, self.mode, self.gitmode, self.sha,
143 self.flags, self.children_ofs, self.children_n
144 ) = (dev, int(ctime), int(mtime), uid, gid,
145 size, mode, gitmode, sha, flags, children_ofs, children_n)
148 class BlankNewEntry(NewEntry):
149 def __init__(self, basename):
150 NewEntry.__init__(self, basename, basename,
152 0, EMPTY_SHA, 0, 0, 0)
155 class ExistingEntry(Entry):
156 def __init__(self, parent, basename, name, m, ofs):
157 Entry.__init__(self, basename, name)
161 (self.dev, self.ctime, self.mtime, self.uid, self.gid,
162 self.size, self.mode, self.gitmode, self.sha,
163 self.flags, self.children_ofs, self.children_n
164 ) = struct.unpack(INDEX_SIG, str(buffer(m, ofs, ENTLEN)))
167 self._m[self._ofs:self._ofs+ENTLEN] = self.packed()
168 if self.parent and not self.is_valid():
169 self.parent.invalidate()
172 def iter(self, name=None, wantrecurse=None):
174 if dname and not dname.endswith('/'):
176 ofs = self.children_ofs
177 assert(ofs <= len(self._m))
178 assert(self.children_n < 1000000)
179 for i in xrange(self.children_n):
180 eon = self._m.find('\0', ofs)
184 basename = str(buffer(self._m, ofs, eon-ofs))
185 child = ExistingEntry(self, basename, self.name + basename,
188 or child.name.startswith(dname)
189 or child.name.endswith('/') and dname.startswith(child.name)):
190 if not wantrecurse or wantrecurse(child):
191 for e in child.iter(name=name, wantrecurse=wantrecurse):
193 if not name or child.name == name or child.name.startswith(dname):
195 ofs = eon + 1 + ENTLEN
202 def __init__(self, filename):
203 self.filename = filename
205 self.writable = False
209 f = open(filename, 'r+')
211 if e.errno == errno.ENOENT:
216 b = f.read(len(INDEX_HDR))
218 log('warning: %s: header: expected %r, got %r'
219 % (filename, INDEX_HDR, b))
221 st = os.fstat(f.fileno())
223 self.m = mmap_readwrite(f)
225 self.count = struct.unpack(FOOTER_SIG,
226 str(buffer(self.m, st.st_size-FOOTLEN, FOOTLEN)))[0]
232 return int(self.count)
234 def forward_iter(self):
236 while ofs+ENTLEN <= len(self.m)-FOOTLEN:
237 eon = self.m.find('\0', ofs)
241 basename = str(buffer(self.m, ofs, eon-ofs))
242 yield ExistingEntry(None, basename, basename, self.m, eon+1)
243 ofs = eon + 1 + ENTLEN
245 def iter(self, name=None, wantrecurse=None):
246 if len(self.m) > len(INDEX_HDR)+ENTLEN:
248 if dname and not dname.endswith('/'):
250 root = ExistingEntry(None, '/', '/',
251 self.m, len(self.m)-FOOTLEN-ENTLEN)
252 for sub in root.iter(name=name, wantrecurse=wantrecurse):
254 if not dname or dname == root.name:
264 if self.writable and self.m:
269 if self.writable and self.m:
271 self.writable = False
273 def filter(self, prefixes, wantrecurse=None):
274 for (rp, path) in reduce_paths(prefixes):
275 for e in self.iter(rp, wantrecurse=wantrecurse):
276 assert(e.name.startswith(rp))
277 name = path + e.name[len(rp):]
282 def __init__(self, filename):
283 self.rootlevel = self.level = Level([], None)
288 self.filename = filename = realpath(filename)
289 (dir,name) = os.path.split(filename)
290 (ffd,self.tmpname) = tempfile.mkstemp('.tmp', filename, dir)
291 self.f = os.fdopen(ffd, 'wb', 65536)
292 self.f.write(INDEX_HDR)
302 os.unlink(self.tmpname)
306 self.level = _golevel(self.level, self.f, [], None)
307 self.count = self.rootlevel.count
310 self.f.write(struct.pack(FOOTER_SIG, self.count))
312 assert(self.level == None)
320 os.rename(self.tmpname, self.filename)
322 def _add(self, ename, entry):
323 if self.lastfile and self.lastfile <= ename:
324 raise Error('%r must come before %r'
325 % (''.join(e.name), ''.join(self.lastfile)))
326 self.lastfile = e.name
327 self.level = _golevel(self.level, self.f, ename, entry)
329 def add(self, name, st, hashgen = None):
330 endswith = name.endswith('/')
331 ename = pathsplit(name)
333 #log('add: %r %r\n' % (basename, name))
337 (gitmode, sha) = hashgen(name)
338 flags |= IX_HASHVALID
340 (gitmode, sha) = (0, EMPTY_SHA)
342 isdir = stat.S_ISDIR(st.st_mode)
343 assert(isdir == endswith)
344 e = NewEntry(basename, name, st.st_dev, int(st.st_ctime),
345 int(st.st_mtime), st.st_uid, st.st_gid,
346 st.st_size, st.st_mode, gitmode, sha, flags,
350 e = BlankNewEntry(basename)
356 def add_ixentry(self, e):
357 e.children_ofs = e.children_n = 0
358 self._add(pathsplit(e.name), e)
360 def new_reader(self):
362 return Reader(self.tmpname)
365 def reduce_paths(paths):
371 if stat.S_ISDIR(st.st_mode):
375 if e.errno != errno.ENOENT:
377 xpaths.append((rp, p))
382 for (rp, p) in xpaths:
383 if prev and (prev == rp
384 or (prev.endswith('/') and rp.startswith(prev))):
385 continue # already superceded by previous path
386 paths.append((rp, p))
388 paths.sort(reverse=True)
393 def __init__(self, iters):
397 # FIXME: doesn't remove duplicated entries between iters.
398 # That only happens for parent directories, but will mean the
399 # actual iteration returns fewer entries than this function counts.
400 return sum(len(it) for it in self.iters)
404 l = [iter(it) for it in self.iters]
405 l = [(next(it),it) for it in l]
406 l = filter(lambda x: x[0], l)
410 if not (count % 1024):
411 progress('bup: merging indexes (%d/%d)\r' % (count, total))
416 if e.name != lastname:
423 log('bup: merging indexes (%d/%d), done.\n' % (count, total))