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)
13 class Error(Exception):
17 def _encode(dev, ctime, mtime, uid, gi8d, size, mode, gitmode, sha, flags):
18 return struct.pack(INDEX_SIG,
19 dev, ctime, mtime, uid, gid, size, mode,
23 def __init__(self, name):
29 return ("(%s,0x%04x,%d,%d,%d,%d,%d,0x%04x)"
30 % (self.name, self.dev,
31 self.ctime, self.mtime, self.uid, self.gid,
32 self.size, self.flags))
35 return struct.pack(INDEX_SIG,
36 self.dev, self.ctime, self.mtime,
37 self.uid, self.gid, self.size, self.mode,
38 self.gitmode, self.sha, self.flags,
39 self.children_ofs, self.children_n)
41 def from_stat(self, st, tstart):
42 old = (self.dev, self.ctime, self.mtime,
43 self.uid, self.gid, self.size, self.flags & IX_EXISTS)
44 new = (st.st_dev, int(st.st_ctime), int(st.st_mtime),
45 st.st_uid, st.st_gid, st.st_size, IX_EXISTS)
47 self.ctime = int(st.st_ctime)
48 self.mtime = int(st.st_mtime)
51 self.size = st.st_size
52 self.mode = st.st_mode
53 self.flags |= IX_EXISTS
54 if int(st.st_ctime) >= tstart or old != new:
55 self.flags &= ~IX_HASHVALID
58 def validate(self, sha):
61 self.flags |= IX_HASHVALID
63 def set_deleted(self):
64 self.flags &= ~(IX_EXISTS | IX_HASHVALID)
71 return cmp(a.name, b.name)
74 class NewEntry(Entry):
75 def __init__(self, name, dev, ctime, mtime, uid, gid,
76 size, mode, gitmode, sha, flags, children_ofs, children_n):
77 Entry.__init__(self, name)
78 (self.dev, self.ctime, self.mtime, self.uid, self.gid,
79 self.size, self.mode, self.gitmode, self.sha,
80 self.flags, self.children_ofs, self.children_n
81 ) = (dev, int(ctime), int(mtime), uid, gid,
82 size, mode, gitmode, sha, flags, children_ofs, children_n)
85 class ExistingEntry(Entry):
86 def __init__(self, name, m, ofs):
87 Entry.__init__(self, name)
90 (self.dev, self.ctime, self.mtime, self.uid, self.gid,
91 self.size, self.mode, self.gitmode, self.sha,
92 self.flags, self.children_ofs, self.children_n
93 ) = struct.unpack(INDEX_SIG, str(buffer(m, ofs, ENTLEN)))
96 self._m[self._ofs:self._ofs+ENTLEN] = self.packed()
98 def iter(self, name=None):
100 if dname and not dname.endswith('/'):
102 ofs = self.children_ofs
103 #log('myname=%r\n' % self.name)
104 assert(ofs <= len(self._m))
105 for i in range(self.children_n):
106 eon = self._m.find('\0', ofs)
107 #log('eon=0x%x ofs=0x%x i=%d cn=%d\n' % (eon, ofs, i, self.children_n))
111 child = ExistingEntry(self.name + str(buffer(self._m, ofs, eon-ofs)),
114 or child.name.startswith(dname)
115 or child.name.endswith('/') and dname.startswith(child.name)):
116 for e in child.iter(name=name):
118 if not name or child.name == name or child.name.startswith(dname):
120 ofs = eon + 1 + ENTLEN
127 def __init__(self, filename):
128 self.filename = filename
130 self.writable = False
133 f = open(filename, 'r+')
135 if e.errno == errno.ENOENT:
140 b = f.read(len(INDEX_HDR))
142 log('warning: %s: header: expected %r, got %r'
143 % (filename, INDEX_HDR, b))
145 st = os.fstat(f.fileno())
147 self.m = mmap_readwrite(f)
153 def iter(self, name=None):
154 if len(self.m) > len(INDEX_HDR)+ENTLEN:
156 if dname and not dname.endswith('/'):
158 root = ExistingEntry('/', self.m, len(self.m)-ENTLEN)
159 for sub in root.iter(name=name):
161 if not dname or dname == root.name:
171 if self.writable and self.m:
176 if self.writable and self.m:
178 self.writable = False
180 def filter(self, prefixes):
181 for (rp, path) in reduce_paths(prefixes):
182 for e in self.iter(rp):
183 assert(e.name.startswith(rp))
184 name = path + e.name[len(rp):]
188 # Read all the iters in order; when more than one iter has the same entry,
189 # the *later* iter in the list wins. (ie. more recent iter entries replace
191 def _last_writer_wins_iter(iters):
196 l.append([it.next(), it])
197 except StopIteration:
199 del iters # to avoid accidents
204 for (i,(v,it)) in enumerate(l):
205 #log('(%d) considering %d: %r\n' % (len(l), i, v))
214 l[i][0] = l[i][1].next()
215 except StopIteration:
221 def __init__(self, filename):
227 self.filename = filename = realpath(filename)
228 (dir,name) = os.path.split(filename)
229 (ffd,self.tmpname) = tempfile.mkstemp('.tmp', filename, dir)
230 self.f = os.fdopen(ffd, 'wb', 65536)
231 self.f.write(INDEX_HDR)
241 os.unlink(self.tmpname)
245 self.add(''.join(self.stack[-1][0]), None)
246 self._pop_to(None, [])
255 os.rename(self.tmpname, self.filename)
257 # FIXME: this function modifies 'entry' and can only pop a single level.
258 # That means its semantics are basically crazy.
259 def _pop_to(self, entry, edir):
260 assert(len(self.stack) - len(edir) <= 1)
261 while self.stack and self.stack[-1][0] > edir:
262 #log('popping %r with %d entries (%d)\n'
263 # % (''.join(self.stack[-1][0]), len(self.stack[-1][1]),
266 entry.children_ofs = self.f.tell()
267 entry.children_n = len(p[1])
271 def _write(self, entry):
272 #log(' writing %r\n' % entry.name)
273 es = pathsplit(entry.name)
274 self.f.write(es[-1] + '\0' + entry.packed())
277 def _add(self, entry):
278 es = pathsplit(entry.name)
280 self._pop_to(entry, edir)
281 while len(self.stack) < len(edir):
282 self.stack.append([es[:len(self.stack)+1], [], ()])
283 if entry.name != '/':
284 self.stack[-1][1].append(entry)
288 def add(self, name, st, hashgen = None):
290 assert(cmp(self.lastfile, name) > 0) # reverse order only
291 endswith = name.endswith('/')
295 (gitmode, sha) = hashgen(name)
296 flags |= IX_HASHVALID
298 (gitmode, sha) = (0, EMPTY_SHA)
300 isdir = stat.S_ISDIR(st.st_mode)
301 assert(isdir == endswith)
302 e = NewEntry(name, st.st_dev, int(st.st_ctime),
303 int(st.st_mtime), st.st_uid, st.st_gid,
304 st.st_size, st.st_mode, gitmode, sha, flags,
308 e = NewEntry(name, 0, 0, 0, 0, 0, 0, 0, gitmode, sha, flags, 0, 0)
312 def add_ixentry(self, e):
313 if self.lastfile and self.lastfile <= e.name:
314 raise Error('%r must come before %r'
315 % (e.name, self.lastfile))
316 self.lastfile = e.name
319 def new_reader(self):
321 return Reader(self.tmpname)
324 def reduce_paths(paths):
330 if stat.S_ISDIR(st.st_mode):
334 if e.errno != errno.ENOENT:
336 xpaths.append((rp, p))
341 for (rp, p) in xpaths:
342 if prev and (prev == rp
343 or (prev.endswith('/') and rp.startswith(prev))):
344 continue # already superceded by previous path
345 paths.append((rp, p))
347 paths.sort(reverse=True)