##// END OF EJS Templates
More tweaking to rawcommit for repo conversion...
mpm@selenic.com -
r314:3402cb9a default
parent child Browse files
Show More
@@ -1,1302 +1,1306 b''
1 # hg.py - repository classes for mercurial
1 # hg.py - repository classes for mercurial
2 #
2 #
3 # Copyright 2005 Matt Mackall <mpm@selenic.com>
3 # Copyright 2005 Matt Mackall <mpm@selenic.com>
4 #
4 #
5 # This software may be used and distributed according to the terms
5 # This software may be used and distributed according to the terms
6 # of the GNU General Public License, incorporated herein by reference.
6 # of the GNU General Public License, incorporated herein by reference.
7
7
8 import sys, struct, os
8 import sys, struct, os
9 from revlog import *
9 from revlog import *
10 from demandload import *
10 from demandload import *
11 demandload(globals(), "re lock urllib urllib2 transaction time socket")
11 demandload(globals(), "re lock urllib urllib2 transaction time socket")
12 demandload(globals(), "tempfile byterange difflib")
12 demandload(globals(), "tempfile byterange difflib")
13
13
14 def is_exec(f):
14 def is_exec(f):
15 return (os.stat(f).st_mode & 0100 != 0)
15 return (os.stat(f).st_mode & 0100 != 0)
16
16
17 def set_exec(f, mode):
17 def set_exec(f, mode):
18 s = os.stat(f).st_mode
18 s = os.stat(f).st_mode
19 if (s & 0100 != 0) == mode:
19 if (s & 0100 != 0) == mode:
20 return
20 return
21 if mode:
21 if mode:
22 # Turn on +x for every +r bit when making a file executable
22 # Turn on +x for every +r bit when making a file executable
23 # and obey umask.
23 # and obey umask.
24 umask = os.umask(0)
24 umask = os.umask(0)
25 os.umask(umask)
25 os.umask(umask)
26 os.chmod(f, s | (s & 0444) >> 2 & ~umask)
26 os.chmod(f, s | (s & 0444) >> 2 & ~umask)
27 else:
27 else:
28 os.chmod(f, s & 0666)
28 os.chmod(f, s & 0666)
29
29
30 class filelog(revlog):
30 class filelog(revlog):
31 def __init__(self, opener, path):
31 def __init__(self, opener, path):
32 revlog.__init__(self, opener,
32 revlog.__init__(self, opener,
33 os.path.join("data", path + ".i"),
33 os.path.join("data", path + ".i"),
34 os.path.join("data", path + ".d"))
34 os.path.join("data", path + ".d"))
35
35
36 def read(self, node):
36 def read(self, node):
37 return self.revision(node)
37 return self.revision(node)
38 def add(self, text, transaction, link, p1=None, p2=None):
38 def add(self, text, transaction, link, p1=None, p2=None):
39 return self.addrevision(text, transaction, link, p1, p2)
39 return self.addrevision(text, transaction, link, p1, p2)
40
40
41 def annotate(self, node):
41 def annotate(self, node):
42
42
43 def decorate(text, rev):
43 def decorate(text, rev):
44 return [(rev, l) for l in text.splitlines(1)]
44 return [(rev, l) for l in text.splitlines(1)]
45
45
46 def strip(annotation):
46 def strip(annotation):
47 return [e[1] for e in annotation]
47 return [e[1] for e in annotation]
48
48
49 def pair(parent, child):
49 def pair(parent, child):
50 new = []
50 new = []
51 sm = difflib.SequenceMatcher(None, strip(parent), strip(child))
51 sm = difflib.SequenceMatcher(None, strip(parent), strip(child))
52 for o, m, n, s, t in sm.get_opcodes():
52 for o, m, n, s, t in sm.get_opcodes():
53 if o == 'equal':
53 if o == 'equal':
54 new += parent[m:n]
54 new += parent[m:n]
55 else:
55 else:
56 new += child[s:t]
56 new += child[s:t]
57 return new
57 return new
58
58
59 # find all ancestors
59 # find all ancestors
60 needed = {node:1}
60 needed = {node:1}
61 visit = [node]
61 visit = [node]
62 while visit:
62 while visit:
63 n = visit.pop(0)
63 n = visit.pop(0)
64 for p in self.parents(n):
64 for p in self.parents(n):
65 if p not in needed:
65 if p not in needed:
66 needed[p] = 1
66 needed[p] = 1
67 visit.append(p)
67 visit.append(p)
68 else:
68 else:
69 # count how many times we'll use this
69 # count how many times we'll use this
70 needed[p] += 1
70 needed[p] += 1
71
71
72 # sort by revision which is a topological order
72 # sort by revision which is a topological order
73 visit = needed.keys()
73 visit = needed.keys()
74 visit = [ (self.rev(n), n) for n in visit ]
74 visit = [ (self.rev(n), n) for n in visit ]
75 visit.sort()
75 visit.sort()
76 visit = [ p[1] for p in visit ]
76 visit = [ p[1] for p in visit ]
77 hist = {}
77 hist = {}
78
78
79 for n in visit:
79 for n in visit:
80 curr = decorate(self.read(n), self.linkrev(n))
80 curr = decorate(self.read(n), self.linkrev(n))
81 for p in self.parents(n):
81 for p in self.parents(n):
82 if p != nullid:
82 if p != nullid:
83 curr = pair(hist[p], curr)
83 curr = pair(hist[p], curr)
84 # trim the history of unneeded revs
84 # trim the history of unneeded revs
85 needed[p] -= 1
85 needed[p] -= 1
86 if not needed[p]:
86 if not needed[p]:
87 del hist[p]
87 del hist[p]
88 hist[n] = curr
88 hist[n] = curr
89
89
90 return hist[n]
90 return hist[n]
91
91
92 class manifest(revlog):
92 class manifest(revlog):
93 def __init__(self, opener):
93 def __init__(self, opener):
94 self.mapcache = None
94 self.mapcache = None
95 self.listcache = None
95 self.listcache = None
96 self.addlist = None
96 self.addlist = None
97 revlog.__init__(self, opener, "00manifest.i", "00manifest.d")
97 revlog.__init__(self, opener, "00manifest.i", "00manifest.d")
98
98
99 def read(self, node):
99 def read(self, node):
100 if node == nullid: return {} # don't upset local cache
100 if node == nullid: return {} # don't upset local cache
101 if self.mapcache and self.mapcache[0] == node:
101 if self.mapcache and self.mapcache[0] == node:
102 return self.mapcache[1].copy()
102 return self.mapcache[1].copy()
103 text = self.revision(node)
103 text = self.revision(node)
104 map = {}
104 map = {}
105 flag = {}
105 flag = {}
106 self.listcache = (text, text.splitlines(1))
106 self.listcache = (text, text.splitlines(1))
107 for l in self.listcache[1]:
107 for l in self.listcache[1]:
108 (f, n) = l.split('\0')
108 (f, n) = l.split('\0')
109 map[f] = bin(n[:40])
109 map[f] = bin(n[:40])
110 flag[f] = (n[40:-1] == "x")
110 flag[f] = (n[40:-1] == "x")
111 self.mapcache = (node, map, flag)
111 self.mapcache = (node, map, flag)
112 return map
112 return map
113
113
114 def readflags(self, node):
114 def readflags(self, node):
115 if node == nullid: return {} # don't upset local cache
115 if node == nullid: return {} # don't upset local cache
116 if self.mapcache or self.mapcache[0] != node:
116 if self.mapcache or self.mapcache[0] != node:
117 self.read(node)
117 self.read(node)
118 return self.mapcache[2]
118 return self.mapcache[2]
119
119
120 def diff(self, a, b):
120 def diff(self, a, b):
121 # this is sneaky, as we're not actually using a and b
121 # this is sneaky, as we're not actually using a and b
122 if self.listcache and self.addlist and self.listcache[0] == a:
122 if self.listcache and self.addlist and self.listcache[0] == a:
123 d = mdiff.diff(self.listcache[1], self.addlist, 1)
123 d = mdiff.diff(self.listcache[1], self.addlist, 1)
124 if mdiff.patch(a, d) != b:
124 if mdiff.patch(a, d) != b:
125 sys.stderr.write("*** sortdiff failed, falling back ***\n")
125 sys.stderr.write("*** sortdiff failed, falling back ***\n")
126 return mdiff.textdiff(a, b)
126 return mdiff.textdiff(a, b)
127 return d
127 return d
128 else:
128 else:
129 return mdiff.textdiff(a, b)
129 return mdiff.textdiff(a, b)
130
130
131 def add(self, map, flags, transaction, link, p1=None, p2=None):
131 def add(self, map, flags, transaction, link, p1=None, p2=None):
132 files = map.keys()
132 files = map.keys()
133 files.sort()
133 files.sort()
134
134
135 self.addlist = ["%s\000%s%s\n" %
135 self.addlist = ["%s\000%s%s\n" %
136 (f, hex(map[f]), flags[f] and "x" or '')
136 (f, hex(map[f]), flags[f] and "x" or '')
137 for f in files]
137 for f in files]
138 text = "".join(self.addlist)
138 text = "".join(self.addlist)
139
139
140 n = self.addrevision(text, transaction, link, p1, p2)
140 n = self.addrevision(text, transaction, link, p1, p2)
141 self.mapcache = (n, map, flags)
141 self.mapcache = (n, map, flags)
142 self.listcache = (text, self.addlist)
142 self.listcache = (text, self.addlist)
143 self.addlist = None
143 self.addlist = None
144
144
145 return n
145 return n
146
146
147 class changelog(revlog):
147 class changelog(revlog):
148 def __init__(self, opener):
148 def __init__(self, opener):
149 revlog.__init__(self, opener, "00changelog.i", "00changelog.d")
149 revlog.__init__(self, opener, "00changelog.i", "00changelog.d")
150
150
151 def extract(self, text):
151 def extract(self, text):
152 if not text:
152 if not text:
153 return (nullid, "", "0", [], "")
153 return (nullid, "", "0", [], "")
154 last = text.index("\n\n")
154 last = text.index("\n\n")
155 desc = text[last + 2:]
155 desc = text[last + 2:]
156 l = text[:last].splitlines()
156 l = text[:last].splitlines()
157 manifest = bin(l[0])
157 manifest = bin(l[0])
158 user = l[1]
158 user = l[1]
159 date = l[2]
159 date = l[2]
160 files = l[3:]
160 files = l[3:]
161 return (manifest, user, date, files, desc)
161 return (manifest, user, date, files, desc)
162
162
163 def read(self, node):
163 def read(self, node):
164 return self.extract(self.revision(node))
164 return self.extract(self.revision(node))
165
165
166 def add(self, manifest, list, desc, transaction, p1=None, p2=None,
166 def add(self, manifest, list, desc, transaction, p1=None, p2=None,
167 user=None, date=None):
167 user=None, date=None):
168 user = (user or
168 user = (user or
169 os.environ.get("HGUSER") or
169 os.environ.get("HGUSER") or
170 os.environ.get("EMAIL") or
170 os.environ.get("EMAIL") or
171 os.environ.get("LOGNAME", "unknown") + '@' + socket.getfqdn())
171 os.environ.get("LOGNAME", "unknown") + '@' + socket.getfqdn())
172 date = date or "%d %d" % (time.time(), time.timezone)
172 date = date or "%d %d" % (time.time(), time.timezone)
173 list.sort()
173 list.sort()
174 l = [hex(manifest), user, date] + list + ["", desc]
174 l = [hex(manifest), user, date] + list + ["", desc]
175 text = "\n".join(l)
175 text = "\n".join(l)
176 return self.addrevision(text, transaction, self.count(), p1, p2)
176 return self.addrevision(text, transaction, self.count(), p1, p2)
177
177
178 class dirstate:
178 class dirstate:
179 def __init__(self, opener, ui, root):
179 def __init__(self, opener, ui, root):
180 self.opener = opener
180 self.opener = opener
181 self.root = root
181 self.root = root
182 self.dirty = 0
182 self.dirty = 0
183 self.ui = ui
183 self.ui = ui
184 self.map = None
184 self.map = None
185 self.pl = None
185 self.pl = None
186
186
187 def __del__(self):
187 def __del__(self):
188 if self.dirty:
188 if self.dirty:
189 self.write()
189 self.write()
190
190
191 def __getitem__(self, key):
191 def __getitem__(self, key):
192 try:
192 try:
193 return self.map[key]
193 return self.map[key]
194 except TypeError:
194 except TypeError:
195 self.read()
195 self.read()
196 return self[key]
196 return self[key]
197
197
198 def __contains__(self, key):
198 def __contains__(self, key):
199 if not self.map: self.read()
199 if not self.map: self.read()
200 return key in self.map
200 return key in self.map
201
201
202 def parents(self):
202 def parents(self):
203 if not self.pl:
203 if not self.pl:
204 self.read()
204 self.read()
205 return self.pl
205 return self.pl
206
206
207 def setparents(self, p1, p2 = nullid):
207 def setparents(self, p1, p2 = nullid):
208 self.dirty = 1
208 self.dirty = 1
209 self.pl = p1, p2
209 self.pl = p1, p2
210
210
211 def state(self, key):
211 def state(self, key):
212 try:
212 try:
213 return self[key][0]
213 return self[key][0]
214 except KeyError:
214 except KeyError:
215 return "?"
215 return "?"
216
216
217 def read(self):
217 def read(self):
218 if self.map is not None: return self.map
218 if self.map is not None: return self.map
219
219
220 self.map = {}
220 self.map = {}
221 self.pl = [nullid, nullid]
221 self.pl = [nullid, nullid]
222 try:
222 try:
223 st = self.opener("dirstate").read()
223 st = self.opener("dirstate").read()
224 if not st: return
224 if not st: return
225 except: return
225 except: return
226
226
227 self.pl = [st[:20], st[20: 40]]
227 self.pl = [st[:20], st[20: 40]]
228
228
229 pos = 40
229 pos = 40
230 while pos < len(st):
230 while pos < len(st):
231 e = struct.unpack(">cllll", st[pos:pos+17])
231 e = struct.unpack(">cllll", st[pos:pos+17])
232 l = e[4]
232 l = e[4]
233 pos += 17
233 pos += 17
234 f = st[pos:pos + l]
234 f = st[pos:pos + l]
235 self.map[f] = e[:4]
235 self.map[f] = e[:4]
236 pos += l
236 pos += l
237
237
238 def update(self, files, state):
238 def update(self, files, state):
239 ''' current states:
239 ''' current states:
240 n normal
240 n normal
241 m needs merging
241 m needs merging
242 r marked for removal
242 r marked for removal
243 a marked for addition'''
243 a marked for addition'''
244
244
245 if not files: return
245 if not files: return
246 self.read()
246 self.read()
247 self.dirty = 1
247 self.dirty = 1
248 for f in files:
248 for f in files:
249 if state == "r":
249 if state == "r":
250 self.map[f] = ('r', 0, 0, 0)
250 self.map[f] = ('r', 0, 0, 0)
251 else:
251 else:
252 s = os.stat(os.path.join(self.root, f))
252 s = os.stat(os.path.join(self.root, f))
253 self.map[f] = (state, s.st_mode, s.st_size, s.st_mtime)
253 self.map[f] = (state, s.st_mode, s.st_size, s.st_mtime)
254
254
255 def forget(self, files):
255 def forget(self, files):
256 if not files: return
256 if not files: return
257 self.read()
257 self.read()
258 self.dirty = 1
258 self.dirty = 1
259 for f in files:
259 for f in files:
260 try:
260 try:
261 del self.map[f]
261 del self.map[f]
262 except KeyError:
262 except KeyError:
263 self.ui.warn("not in dirstate: %s!\n" % f)
263 self.ui.warn("not in dirstate: %s!\n" % f)
264 pass
264 pass
265
265
266 def clear(self):
266 def clear(self):
267 self.map = {}
267 self.map = {}
268 self.dirty = 1
268 self.dirty = 1
269
269
270 def write(self):
270 def write(self):
271 st = self.opener("dirstate", "w")
271 st = self.opener("dirstate", "w")
272 st.write("".join(self.pl))
272 st.write("".join(self.pl))
273 for f, e in self.map.items():
273 for f, e in self.map.items():
274 e = struct.pack(">cllll", e[0], e[1], e[2], e[3], len(f))
274 e = struct.pack(">cllll", e[0], e[1], e[2], e[3], len(f))
275 st.write(e + f)
275 st.write(e + f)
276 self.dirty = 0
276 self.dirty = 0
277
277
278 def copy(self):
278 def copy(self):
279 self.read()
279 self.read()
280 return self.map.copy()
280 return self.map.copy()
281
281
282 # used to avoid circular references so destructors work
282 # used to avoid circular references so destructors work
283 def opener(base):
283 def opener(base):
284 p = base
284 p = base
285 def o(path, mode="r"):
285 def o(path, mode="r"):
286 if p[:7] == "http://":
286 if p[:7] == "http://":
287 f = os.path.join(p, urllib.quote(path))
287 f = os.path.join(p, urllib.quote(path))
288 return httprangereader(f)
288 return httprangereader(f)
289
289
290 f = os.path.join(p, path)
290 f = os.path.join(p, path)
291
291
292 mode += "b" # for that other OS
292 mode += "b" # for that other OS
293
293
294 if mode[0] != "r":
294 if mode[0] != "r":
295 try:
295 try:
296 s = os.stat(f)
296 s = os.stat(f)
297 except OSError:
297 except OSError:
298 d = os.path.dirname(f)
298 d = os.path.dirname(f)
299 if not os.path.isdir(d):
299 if not os.path.isdir(d):
300 os.makedirs(d)
300 os.makedirs(d)
301 else:
301 else:
302 if s.st_nlink > 1:
302 if s.st_nlink > 1:
303 file(f + ".tmp", "w").write(file(f).read())
303 file(f + ".tmp", "w").write(file(f).read())
304 os.rename(f+".tmp", f)
304 os.rename(f+".tmp", f)
305
305
306 return file(f, mode)
306 return file(f, mode)
307
307
308 return o
308 return o
309
309
310 class localrepository:
310 class localrepository:
311 def __init__(self, ui, path=None, create=0):
311 def __init__(self, ui, path=None, create=0):
312 self.remote = 0
312 self.remote = 0
313 if path and path[:7] == "http://":
313 if path and path[:7] == "http://":
314 self.remote = 1
314 self.remote = 1
315 self.path = path
315 self.path = path
316 else:
316 else:
317 if not path:
317 if not path:
318 p = os.getcwd()
318 p = os.getcwd()
319 while not os.path.isdir(os.path.join(p, ".hg")):
319 while not os.path.isdir(os.path.join(p, ".hg")):
320 p = os.path.dirname(p)
320 p = os.path.dirname(p)
321 if p == "/": raise "No repo found"
321 if p == "/": raise "No repo found"
322 path = p
322 path = p
323 self.path = os.path.join(path, ".hg")
323 self.path = os.path.join(path, ".hg")
324
324
325 self.root = path
325 self.root = path
326 self.ui = ui
326 self.ui = ui
327
327
328 if create:
328 if create:
329 os.mkdir(self.path)
329 os.mkdir(self.path)
330 os.mkdir(self.join("data"))
330 os.mkdir(self.join("data"))
331
331
332 self.opener = opener(self.path)
332 self.opener = opener(self.path)
333 self.wopener = opener(self.root)
333 self.wopener = opener(self.root)
334 self.manifest = manifest(self.opener)
334 self.manifest = manifest(self.opener)
335 self.changelog = changelog(self.opener)
335 self.changelog = changelog(self.opener)
336 self.ignorelist = None
336 self.ignorelist = None
337 self.tags = None
337 self.tags = None
338
338
339 if not self.remote:
339 if not self.remote:
340 self.dirstate = dirstate(self.opener, ui, self.root)
340 self.dirstate = dirstate(self.opener, ui, self.root)
341
341
342 def ignore(self, f):
342 def ignore(self, f):
343 if self.ignorelist is None:
343 if self.ignorelist is None:
344 self.ignorelist = []
344 self.ignorelist = []
345 try:
345 try:
346 l = self.wfile(".hgignore")
346 l = self.wfile(".hgignore")
347 for pat in l:
347 for pat in l:
348 if pat != "\n":
348 if pat != "\n":
349 self.ignorelist.append(re.compile(pat[:-1]))
349 self.ignorelist.append(re.compile(pat[:-1]))
350 except IOError: pass
350 except IOError: pass
351 for pat in self.ignorelist:
351 for pat in self.ignorelist:
352 if pat.search(f): return True
352 if pat.search(f): return True
353 return False
353 return False
354
354
355 def lookup(self, key):
355 def lookup(self, key):
356 if self.tags is None:
356 if self.tags is None:
357 self.tags = {}
357 self.tags = {}
358 try:
358 try:
359 # read each head of the tags file, ending with the tip
359 # read each head of the tags file, ending with the tip
360 # and add each tag found to the map, with "newer" ones
360 # and add each tag found to the map, with "newer" ones
361 # taking precedence
361 # taking precedence
362 fl = self.file(".hgtags")
362 fl = self.file(".hgtags")
363 h = fl.heads()
363 h = fl.heads()
364 h.reverse()
364 h.reverse()
365 for r in h:
365 for r in h:
366 for l in fl.revision(r).splitlines():
366 for l in fl.revision(r).splitlines():
367 if l:
367 if l:
368 n, k = l.split(" ")
368 n, k = l.split(" ")
369 self.tags[k] = bin(n)
369 self.tags[k] = bin(n)
370 except KeyError: pass
370 except KeyError: pass
371 self.tags['tip'] = self.changelog.tip()
371 self.tags['tip'] = self.changelog.tip()
372 try:
372 try:
373 return self.tags[key]
373 return self.tags[key]
374 except KeyError:
374 except KeyError:
375 return self.changelog.lookup(key)
375 return self.changelog.lookup(key)
376
376
377 def join(self, f):
377 def join(self, f):
378 return os.path.join(self.path, f)
378 return os.path.join(self.path, f)
379
379
380 def wjoin(self, f):
380 def wjoin(self, f):
381 return os.path.join(self.root, f)
381 return os.path.join(self.root, f)
382
382
383 def file(self, f):
383 def file(self, f):
384 if f[0] == '/': f = f[1:]
384 if f[0] == '/': f = f[1:]
385 return filelog(self.opener, f)
385 return filelog(self.opener, f)
386
386
387 def wfile(self, f, mode='r'):
387 def wfile(self, f, mode='r'):
388 return self.wopener(f, mode)
388 return self.wopener(f, mode)
389
389
390 def transaction(self):
390 def transaction(self):
391 # save dirstate for undo
391 # save dirstate for undo
392 try:
392 try:
393 ds = self.opener("dirstate").read()
393 ds = self.opener("dirstate").read()
394 except IOError:
394 except IOError:
395 ds = ""
395 ds = ""
396 self.opener("undo.dirstate", "w").write(ds)
396 self.opener("undo.dirstate", "w").write(ds)
397
397
398 return transaction.transaction(self.opener, self.join("journal"),
398 return transaction.transaction(self.opener, self.join("journal"),
399 self.join("undo"))
399 self.join("undo"))
400
400
401 def recover(self):
401 def recover(self):
402 lock = self.lock()
402 lock = self.lock()
403 if os.path.exists(self.join("recover")):
403 if os.path.exists(self.join("recover")):
404 self.ui.status("attempting to rollback interrupted transaction\n")
404 self.ui.status("attempting to rollback interrupted transaction\n")
405 return transaction.rollback(self.opener, self.join("recover"))
405 return transaction.rollback(self.opener, self.join("recover"))
406 else:
406 else:
407 self.ui.warn("no interrupted transaction available\n")
407 self.ui.warn("no interrupted transaction available\n")
408
408
409 def undo(self):
409 def undo(self):
410 lock = self.lock()
410 lock = self.lock()
411 if os.path.exists(self.join("undo")):
411 if os.path.exists(self.join("undo")):
412 self.ui.status("attempting to rollback last transaction\n")
412 self.ui.status("attempting to rollback last transaction\n")
413 transaction.rollback(self.opener, self.join("undo"))
413 transaction.rollback(self.opener, self.join("undo"))
414 self.dirstate = None
414 self.dirstate = None
415 os.rename(self.join("undo.dirstate"), self.join("dirstate"))
415 os.rename(self.join("undo.dirstate"), self.join("dirstate"))
416 self.dirstate = dirstate(self.opener, self.ui, self.root)
416 self.dirstate = dirstate(self.opener, self.ui, self.root)
417 else:
417 else:
418 self.ui.warn("no undo information available\n")
418 self.ui.warn("no undo information available\n")
419
419
420 def lock(self, wait = 1):
420 def lock(self, wait = 1):
421 try:
421 try:
422 return lock.lock(self.join("lock"), 0)
422 return lock.lock(self.join("lock"), 0)
423 except lock.LockHeld, inst:
423 except lock.LockHeld, inst:
424 if wait:
424 if wait:
425 self.ui.warn("waiting for lock held by %s\n" % inst.args[0])
425 self.ui.warn("waiting for lock held by %s\n" % inst.args[0])
426 return lock.lock(self.join("lock"), wait)
426 return lock.lock(self.join("lock"), wait)
427 raise inst
427 raise inst
428
428
429 def rawcommit(self, files, text, user, date, p1=None, p2=None):
429 def rawcommit(self, files, text, user, date, p1=None, p2=None):
430 p1 = p1 or self.dirstate.parents()[0] or nullid
430 p1 = p1 or self.dirstate.parents()[0] or nullid
431 p2 = p2 or self.dirstate.parents()[1] or nullid
431 p2 = p2 or self.dirstate.parents()[1] or nullid
432 c1 = self.changelog.read(p1)
432 c1 = self.changelog.read(p1)
433 c2 = self.changelog.read(p2)
433 c2 = self.changelog.read(p2)
434 m1 = self.manifest.read(c1[0])
434 m1 = self.manifest.read(c1[0])
435 mf1 = self.manifest.readflags(c1[0])
435 mf1 = self.manifest.readflags(c1[0])
436 m2 = self.manifest.read(c2[0])
436 m2 = self.manifest.read(c2[0])
437
437
438 tr = self.transaction()
438 tr = self.transaction()
439 mm = m1.copy()
439 mm = m1.copy()
440 mfm = mf1.copy()
440 mfm = mf1.copy()
441 linkrev = self.changelog.count()
441 linkrev = self.changelog.count()
442 self.dirstate.setparents(p1, p2)
442 for f in files:
443 for f in files:
443 try:
444 try:
444 t = self.wfile(f).read()
445 t = self.wfile(f).read()
445 tm = is_exec(self.wjoin(f))
446 tm = is_exec(self.wjoin(f))
446 r = self.file(f)
447 r = self.file(f)
447 mfm[f] = tm
448 mfm[f] = tm
448 mm[f] = r.add(t, tr, linkrev,
449 mm[f] = r.add(t, tr, linkrev,
449 m1.get(f, nullid), m2.get(f, nullid))
450 m1.get(f, nullid), m2.get(f, nullid))
451 self.dirstate.update([f], "n")
450 except IOError:
452 except IOError:
453 try:
451 del mm[f]
454 del mm[f]
452 del mfm[f]
455 del mfm[f]
456 self.dirstate.forget([f])
457 except:
458 # deleted from p2?
459 pass
453
460
454 mnode = self.manifest.add(mm, mfm, tr, linkrev, c1[0], c2[0])
461 mnode = self.manifest.add(mm, mfm, tr, linkrev, c1[0], c2[0])
455 n = self.changelog.add(mnode, files, text, tr, p1, p2, user, date)
462 n = self.changelog.add(mnode, files, text, tr, p1, p2, user, date)
456 tr.close()
463 tr.close()
457 self.dirstate.setparents(p1, p2)
458 self.dirstate.clear()
459 self.dirstate.update(files, "n")
460
464
461 def commit(self, files = None, text = ""):
465 def commit(self, files = None, text = ""):
462 commit = []
466 commit = []
463 remove = []
467 remove = []
464 if files:
468 if files:
465 for f in files:
469 for f in files:
466 s = self.dirstate.state(f)
470 s = self.dirstate.state(f)
467 if s in 'nmai':
471 if s in 'nmai':
468 commit.append(f)
472 commit.append(f)
469 elif s == 'r':
473 elif s == 'r':
470 remove.append(f)
474 remove.append(f)
471 else:
475 else:
472 self.ui.warn("%s not tracked!\n" % f)
476 self.ui.warn("%s not tracked!\n" % f)
473 else:
477 else:
474 (c, a, d, u) = self.diffdir(self.root)
478 (c, a, d, u) = self.diffdir(self.root)
475 commit = c + a
479 commit = c + a
476 remove = d
480 remove = d
477
481
478 if not commit and not remove:
482 if not commit and not remove:
479 self.ui.status("nothing changed\n")
483 self.ui.status("nothing changed\n")
480 return
484 return
481
485
482 p1, p2 = self.dirstate.parents()
486 p1, p2 = self.dirstate.parents()
483 c1 = self.changelog.read(p1)
487 c1 = self.changelog.read(p1)
484 c2 = self.changelog.read(p2)
488 c2 = self.changelog.read(p2)
485 m1 = self.manifest.read(c1[0])
489 m1 = self.manifest.read(c1[0])
486 mf1 = self.manifest.readflags(c1[0])
490 mf1 = self.manifest.readflags(c1[0])
487 m2 = self.manifest.read(c2[0])
491 m2 = self.manifest.read(c2[0])
488 lock = self.lock()
492 lock = self.lock()
489 tr = self.transaction()
493 tr = self.transaction()
490
494
491 # check in files
495 # check in files
492 new = {}
496 new = {}
493 linkrev = self.changelog.count()
497 linkrev = self.changelog.count()
494 commit.sort()
498 commit.sort()
495 for f in commit:
499 for f in commit:
496 self.ui.note(f + "\n")
500 self.ui.note(f + "\n")
497 try:
501 try:
498 fp = self.wjoin(f)
502 fp = self.wjoin(f)
499 mf1[f] = is_exec(fp)
503 mf1[f] = is_exec(fp)
500 t = file(fp).read()
504 t = file(fp).read()
501 except IOError:
505 except IOError:
502 self.warn("trouble committing %s!\n" % f)
506 self.warn("trouble committing %s!\n" % f)
503 raise
507 raise
504
508
505 r = self.file(f)
509 r = self.file(f)
506 fp1 = m1.get(f, nullid)
510 fp1 = m1.get(f, nullid)
507 fp2 = m2.get(f, nullid)
511 fp2 = m2.get(f, nullid)
508 new[f] = r.add(t, tr, linkrev, fp1, fp2)
512 new[f] = r.add(t, tr, linkrev, fp1, fp2)
509
513
510 # update manifest
514 # update manifest
511 m1.update(new)
515 m1.update(new)
512 for f in remove: del m1[f]
516 for f in remove: del m1[f]
513 mn = self.manifest.add(m1, mf1, tr, linkrev, c1[0], c2[0])
517 mn = self.manifest.add(m1, mf1, tr, linkrev, c1[0], c2[0])
514
518
515 # add changeset
519 # add changeset
516 new = new.keys()
520 new = new.keys()
517 new.sort()
521 new.sort()
518
522
519 if not text:
523 if not text:
520 edittext = "\n" + "HG: manifest hash %s\n" % hex(mn)
524 edittext = "\n" + "HG: manifest hash %s\n" % hex(mn)
521 edittext += "".join(["HG: changed %s\n" % f for f in new])
525 edittext += "".join(["HG: changed %s\n" % f for f in new])
522 edittext += "".join(["HG: removed %s\n" % f for f in remove])
526 edittext += "".join(["HG: removed %s\n" % f for f in remove])
523 edittext = self.ui.edit(edittext)
527 edittext = self.ui.edit(edittext)
524 if not edittext.rstrip():
528 if not edittext.rstrip():
525 return 1
529 return 1
526 text = edittext
530 text = edittext
527
531
528 n = self.changelog.add(mn, new, text, tr, p1, p2)
532 n = self.changelog.add(mn, new, text, tr, p1, p2)
529 tr.close()
533 tr.close()
530
534
531 self.dirstate.setparents(n)
535 self.dirstate.setparents(n)
532 self.dirstate.update(new, "n")
536 self.dirstate.update(new, "n")
533 self.dirstate.forget(remove)
537 self.dirstate.forget(remove)
534
538
535 def diffdir(self, path, changeset = None):
539 def diffdir(self, path, changeset = None):
536 changed = []
540 changed = []
537 added = []
541 added = []
538 unknown = []
542 unknown = []
539 mf = {}
543 mf = {}
540
544
541 if changeset:
545 if changeset:
542 change = self.changelog.read(changeset)
546 change = self.changelog.read(changeset)
543 mf = self.manifest.read(change[0])
547 mf = self.manifest.read(change[0])
544 dc = dict.fromkeys(mf)
548 dc = dict.fromkeys(mf)
545 else:
549 else:
546 changeset = self.dirstate.parents()[0]
550 changeset = self.dirstate.parents()[0]
547 change = self.changelog.read(changeset)
551 change = self.changelog.read(changeset)
548 mf = self.manifest.read(change[0])
552 mf = self.manifest.read(change[0])
549 dc = self.dirstate.copy()
553 dc = self.dirstate.copy()
550
554
551 def fcmp(fn):
555 def fcmp(fn):
552 t1 = self.wfile(fn).read()
556 t1 = self.wfile(fn).read()
553 t2 = self.file(fn).revision(mf[fn])
557 t2 = self.file(fn).revision(mf[fn])
554 return cmp(t1, t2)
558 return cmp(t1, t2)
555
559
556 for dir, subdirs, files in os.walk(path):
560 for dir, subdirs, files in os.walk(path):
557 d = dir[len(self.root)+1:]
561 d = dir[len(self.root)+1:]
558 if ".hg" in subdirs: subdirs.remove(".hg")
562 if ".hg" in subdirs: subdirs.remove(".hg")
559
563
560 for f in files:
564 for f in files:
561 fn = os.path.join(d, f)
565 fn = os.path.join(d, f)
562 try: s = os.stat(os.path.join(self.root, fn))
566 try: s = os.stat(os.path.join(self.root, fn))
563 except: continue
567 except: continue
564 if fn in dc:
568 if fn in dc:
565 c = dc[fn]
569 c = dc[fn]
566 del dc[fn]
570 del dc[fn]
567 if not c:
571 if not c:
568 if fcmp(fn):
572 if fcmp(fn):
569 changed.append(fn)
573 changed.append(fn)
570 elif c[0] == 'm':
574 elif c[0] == 'm':
571 changed.append(fn)
575 changed.append(fn)
572 elif c[0] == 'a':
576 elif c[0] == 'a':
573 added.append(fn)
577 added.append(fn)
574 elif c[0] == 'r':
578 elif c[0] == 'r':
575 unknown.append(fn)
579 unknown.append(fn)
576 elif c[2] != s.st_size or (c[1] ^ s.st_mode) & 0100:
580 elif c[2] != s.st_size or (c[1] ^ s.st_mode) & 0100:
577 changed.append(fn)
581 changed.append(fn)
578 elif c[1] != s.st_mode or c[3] != s.st_mtime:
582 elif c[1] != s.st_mode or c[3] != s.st_mtime:
579 if fcmp(fn):
583 if fcmp(fn):
580 changed.append(fn)
584 changed.append(fn)
581 else:
585 else:
582 if self.ignore(fn): continue
586 if self.ignore(fn): continue
583 unknown.append(fn)
587 unknown.append(fn)
584
588
585 deleted = dc.keys()
589 deleted = dc.keys()
586 deleted.sort()
590 deleted.sort()
587
591
588 return (changed, added, deleted, unknown)
592 return (changed, added, deleted, unknown)
589
593
590 def diffrevs(self, node1, node2):
594 def diffrevs(self, node1, node2):
591 changed, added = [], []
595 changed, added = [], []
592
596
593 change = self.changelog.read(node1)
597 change = self.changelog.read(node1)
594 mf1 = self.manifest.read(change[0])
598 mf1 = self.manifest.read(change[0])
595 change = self.changelog.read(node2)
599 change = self.changelog.read(node2)
596 mf2 = self.manifest.read(change[0])
600 mf2 = self.manifest.read(change[0])
597
601
598 for fn in mf2:
602 for fn in mf2:
599 if mf1.has_key(fn):
603 if mf1.has_key(fn):
600 if mf1[fn] != mf2[fn]:
604 if mf1[fn] != mf2[fn]:
601 changed.append(fn)
605 changed.append(fn)
602 del mf1[fn]
606 del mf1[fn]
603 else:
607 else:
604 added.append(fn)
608 added.append(fn)
605
609
606 deleted = mf1.keys()
610 deleted = mf1.keys()
607 deleted.sort()
611 deleted.sort()
608
612
609 return (changed, added, deleted)
613 return (changed, added, deleted)
610
614
611 def add(self, list):
615 def add(self, list):
612 for f in list:
616 for f in list:
613 p = self.wjoin(f)
617 p = self.wjoin(f)
614 if not os.path.isfile(p):
618 if not os.path.isfile(p):
615 self.ui.warn("%s does not exist!\n" % f)
619 self.ui.warn("%s does not exist!\n" % f)
616 elif self.dirstate.state(f) == 'n':
620 elif self.dirstate.state(f) == 'n':
617 self.ui.warn("%s already tracked!\n" % f)
621 self.ui.warn("%s already tracked!\n" % f)
618 else:
622 else:
619 self.dirstate.update([f], "a")
623 self.dirstate.update([f], "a")
620
624
621 def forget(self, list):
625 def forget(self, list):
622 for f in list:
626 for f in list:
623 if self.dirstate.state(f) not in 'ai':
627 if self.dirstate.state(f) not in 'ai':
624 self.ui.warn("%s not added!\n" % f)
628 self.ui.warn("%s not added!\n" % f)
625 else:
629 else:
626 self.dirstate.forget([f])
630 self.dirstate.forget([f])
627
631
628 def remove(self, list):
632 def remove(self, list):
629 for f in list:
633 for f in list:
630 p = self.wjoin(f)
634 p = self.wjoin(f)
631 if os.path.isfile(p):
635 if os.path.isfile(p):
632 self.ui.warn("%s still exists!\n" % f)
636 self.ui.warn("%s still exists!\n" % f)
633 elif f not in self.dirstate:
637 elif f not in self.dirstate:
634 self.ui.warn("%s not tracked!\n" % f)
638 self.ui.warn("%s not tracked!\n" % f)
635 else:
639 else:
636 self.dirstate.update([f], "r")
640 self.dirstate.update([f], "r")
637
641
638 def heads(self):
642 def heads(self):
639 return self.changelog.heads()
643 return self.changelog.heads()
640
644
641 def branches(self, nodes):
645 def branches(self, nodes):
642 if not nodes: nodes = [self.changelog.tip()]
646 if not nodes: nodes = [self.changelog.tip()]
643 b = []
647 b = []
644 for n in nodes:
648 for n in nodes:
645 t = n
649 t = n
646 while n:
650 while n:
647 p = self.changelog.parents(n)
651 p = self.changelog.parents(n)
648 if p[1] != nullid or p[0] == nullid:
652 if p[1] != nullid or p[0] == nullid:
649 b.append((t, n, p[0], p[1]))
653 b.append((t, n, p[0], p[1]))
650 break
654 break
651 n = p[0]
655 n = p[0]
652 return b
656 return b
653
657
654 def between(self, pairs):
658 def between(self, pairs):
655 r = []
659 r = []
656
660
657 for top, bottom in pairs:
661 for top, bottom in pairs:
658 n, l, i = top, [], 0
662 n, l, i = top, [], 0
659 f = 1
663 f = 1
660
664
661 while n != bottom:
665 while n != bottom:
662 p = self.changelog.parents(n)[0]
666 p = self.changelog.parents(n)[0]
663 if i == f:
667 if i == f:
664 l.append(n)
668 l.append(n)
665 f = f * 2
669 f = f * 2
666 n = p
670 n = p
667 i += 1
671 i += 1
668
672
669 r.append(l)
673 r.append(l)
670
674
671 return r
675 return r
672
676
673 def newer(self, nodes):
677 def newer(self, nodes):
674 m = {}
678 m = {}
675 nl = []
679 nl = []
676 pm = {}
680 pm = {}
677 cl = self.changelog
681 cl = self.changelog
678 t = l = cl.count()
682 t = l = cl.count()
679
683
680 # find the lowest numbered node
684 # find the lowest numbered node
681 for n in nodes:
685 for n in nodes:
682 l = min(l, cl.rev(n))
686 l = min(l, cl.rev(n))
683 m[n] = 1
687 m[n] = 1
684
688
685 for i in xrange(l, t):
689 for i in xrange(l, t):
686 n = cl.node(i)
690 n = cl.node(i)
687 if n in m: # explicitly listed
691 if n in m: # explicitly listed
688 pm[n] = 1
692 pm[n] = 1
689 nl.append(n)
693 nl.append(n)
690 continue
694 continue
691 for p in cl.parents(n):
695 for p in cl.parents(n):
692 if p in pm: # parent listed
696 if p in pm: # parent listed
693 pm[n] = 1
697 pm[n] = 1
694 nl.append(n)
698 nl.append(n)
695 break
699 break
696
700
697 return nl
701 return nl
698
702
699 def getchangegroup(self, remote):
703 def getchangegroup(self, remote):
700 m = self.changelog.nodemap
704 m = self.changelog.nodemap
701 search = []
705 search = []
702 fetch = []
706 fetch = []
703 seen = {}
707 seen = {}
704 seenbranch = {}
708 seenbranch = {}
705
709
706 # if we have an empty repo, fetch everything
710 # if we have an empty repo, fetch everything
707 if self.changelog.tip() == nullid:
711 if self.changelog.tip() == nullid:
708 self.ui.status("requesting all changes\n")
712 self.ui.status("requesting all changes\n")
709 return remote.changegroup([nullid])
713 return remote.changegroup([nullid])
710
714
711 # otherwise, assume we're closer to the tip than the root
715 # otherwise, assume we're closer to the tip than the root
712 self.ui.status("searching for changes\n")
716 self.ui.status("searching for changes\n")
713 heads = remote.heads()
717 heads = remote.heads()
714 unknown = []
718 unknown = []
715 for h in heads:
719 for h in heads:
716 if h not in m:
720 if h not in m:
717 unknown.append(h)
721 unknown.append(h)
718
722
719 if not unknown:
723 if not unknown:
720 self.ui.status("nothing to do!\n")
724 self.ui.status("nothing to do!\n")
721 return None
725 return None
722
726
723 unknown = remote.branches(unknown)
727 unknown = remote.branches(unknown)
724 while unknown:
728 while unknown:
725 n = unknown.pop(0)
729 n = unknown.pop(0)
726 seen[n[0]] = 1
730 seen[n[0]] = 1
727
731
728 self.ui.debug("examining %s:%s\n" % (short(n[0]), short(n[1])))
732 self.ui.debug("examining %s:%s\n" % (short(n[0]), short(n[1])))
729 if n == nullid: break
733 if n == nullid: break
730 if n in seenbranch:
734 if n in seenbranch:
731 self.ui.debug("branch already found\n")
735 self.ui.debug("branch already found\n")
732 continue
736 continue
733 if n[1] and n[1] in m: # do we know the base?
737 if n[1] and n[1] in m: # do we know the base?
734 self.ui.debug("found incomplete branch %s:%s\n"
738 self.ui.debug("found incomplete branch %s:%s\n"
735 % (short(n[0]), short(n[1])))
739 % (short(n[0]), short(n[1])))
736 search.append(n) # schedule branch range for scanning
740 search.append(n) # schedule branch range for scanning
737 seenbranch[n] = 1
741 seenbranch[n] = 1
738 else:
742 else:
739 if n[2] in m and n[3] in m:
743 if n[2] in m and n[3] in m:
740 if n[1] not in fetch:
744 if n[1] not in fetch:
741 self.ui.debug("found new changeset %s\n" %
745 self.ui.debug("found new changeset %s\n" %
742 short(n[1]))
746 short(n[1]))
743 fetch.append(n[1]) # earliest unknown
747 fetch.append(n[1]) # earliest unknown
744 continue
748 continue
745
749
746 r = []
750 r = []
747 for a in n[2:4]:
751 for a in n[2:4]:
748 if a not in seen: r.append(a)
752 if a not in seen: r.append(a)
749
753
750 if r:
754 if r:
751 self.ui.debug("requesting %s\n" %
755 self.ui.debug("requesting %s\n" %
752 " ".join(map(short, r)))
756 " ".join(map(short, r)))
753 for b in remote.branches(r):
757 for b in remote.branches(r):
754 self.ui.debug("received %s:%s\n" %
758 self.ui.debug("received %s:%s\n" %
755 (short(b[0]), short(b[1])))
759 (short(b[0]), short(b[1])))
756 if b[0] not in m and b[0] not in seen:
760 if b[0] not in m and b[0] not in seen:
757 unknown.append(b)
761 unknown.append(b)
758
762
759 while search:
763 while search:
760 n = search.pop(0)
764 n = search.pop(0)
761 l = remote.between([(n[0], n[1])])[0]
765 l = remote.between([(n[0], n[1])])[0]
762 p = n[0]
766 p = n[0]
763 f = 1
767 f = 1
764 for i in l + [n[1]]:
768 for i in l + [n[1]]:
765 if i in m:
769 if i in m:
766 if f <= 2:
770 if f <= 2:
767 self.ui.debug("found new branch changeset %s\n" %
771 self.ui.debug("found new branch changeset %s\n" %
768 short(p))
772 short(p))
769 fetch.append(p)
773 fetch.append(p)
770 else:
774 else:
771 self.ui.debug("narrowed branch search to %s:%s\n"
775 self.ui.debug("narrowed branch search to %s:%s\n"
772 % (short(p), short(i)))
776 % (short(p), short(i)))
773 search.append((p, i))
777 search.append((p, i))
774 break
778 break
775 p, f = i, f * 2
779 p, f = i, f * 2
776
780
777 for f in fetch:
781 for f in fetch:
778 if f in m:
782 if f in m:
779 raise "already have", short(f[:4])
783 raise "already have", short(f[:4])
780
784
781 self.ui.note("adding new changesets starting at " +
785 self.ui.note("adding new changesets starting at " +
782 " ".join([short(f) for f in fetch]) + "\n")
786 " ".join([short(f) for f in fetch]) + "\n")
783
787
784 return remote.changegroup(fetch)
788 return remote.changegroup(fetch)
785
789
786 def changegroup(self, basenodes):
790 def changegroup(self, basenodes):
787 nodes = self.newer(basenodes)
791 nodes = self.newer(basenodes)
788
792
789 # construct the link map
793 # construct the link map
790 linkmap = {}
794 linkmap = {}
791 for n in nodes:
795 for n in nodes:
792 linkmap[self.changelog.rev(n)] = n
796 linkmap[self.changelog.rev(n)] = n
793
797
794 # construct a list of all changed files
798 # construct a list of all changed files
795 changed = {}
799 changed = {}
796 for n in nodes:
800 for n in nodes:
797 c = self.changelog.read(n)
801 c = self.changelog.read(n)
798 for f in c[3]:
802 for f in c[3]:
799 changed[f] = 1
803 changed[f] = 1
800 changed = changed.keys()
804 changed = changed.keys()
801 changed.sort()
805 changed.sort()
802
806
803 # the changegroup is changesets + manifests + all file revs
807 # the changegroup is changesets + manifests + all file revs
804 revs = [ self.changelog.rev(n) for n in nodes ]
808 revs = [ self.changelog.rev(n) for n in nodes ]
805
809
806 for y in self.changelog.group(linkmap): yield y
810 for y in self.changelog.group(linkmap): yield y
807 for y in self.manifest.group(linkmap): yield y
811 for y in self.manifest.group(linkmap): yield y
808 for f in changed:
812 for f in changed:
809 yield struct.pack(">l", len(f) + 4) + f
813 yield struct.pack(">l", len(f) + 4) + f
810 g = self.file(f).group(linkmap)
814 g = self.file(f).group(linkmap)
811 for y in g:
815 for y in g:
812 yield y
816 yield y
813
817
814 def addchangegroup(self, generator):
818 def addchangegroup(self, generator):
815
819
816 class genread:
820 class genread:
817 def __init__(self, generator):
821 def __init__(self, generator):
818 self.g = generator
822 self.g = generator
819 self.buf = ""
823 self.buf = ""
820 def read(self, l):
824 def read(self, l):
821 while l > len(self.buf):
825 while l > len(self.buf):
822 try:
826 try:
823 self.buf += self.g.next()
827 self.buf += self.g.next()
824 except StopIteration:
828 except StopIteration:
825 break
829 break
826 d, self.buf = self.buf[:l], self.buf[l:]
830 d, self.buf = self.buf[:l], self.buf[l:]
827 return d
831 return d
828
832
829 def getchunk():
833 def getchunk():
830 d = source.read(4)
834 d = source.read(4)
831 if not d: return ""
835 if not d: return ""
832 l = struct.unpack(">l", d)[0]
836 l = struct.unpack(">l", d)[0]
833 if l <= 4: return ""
837 if l <= 4: return ""
834 return source.read(l - 4)
838 return source.read(l - 4)
835
839
836 def getgroup():
840 def getgroup():
837 while 1:
841 while 1:
838 c = getchunk()
842 c = getchunk()
839 if not c: break
843 if not c: break
840 yield c
844 yield c
841
845
842 def csmap(x):
846 def csmap(x):
843 self.ui.debug("add changeset %s\n" % short(x))
847 self.ui.debug("add changeset %s\n" % short(x))
844 return self.changelog.count()
848 return self.changelog.count()
845
849
846 def revmap(x):
850 def revmap(x):
847 return self.changelog.rev(x)
851 return self.changelog.rev(x)
848
852
849 if not generator: return
853 if not generator: return
850 changesets = files = revisions = 0
854 changesets = files = revisions = 0
851
855
852 source = genread(generator)
856 source = genread(generator)
853 lock = self.lock()
857 lock = self.lock()
854 tr = self.transaction()
858 tr = self.transaction()
855
859
856 # pull off the changeset group
860 # pull off the changeset group
857 self.ui.status("adding changesets\n")
861 self.ui.status("adding changesets\n")
858 co = self.changelog.tip()
862 co = self.changelog.tip()
859 cn = self.changelog.addgroup(getgroup(), csmap, tr, 1) # unique
863 cn = self.changelog.addgroup(getgroup(), csmap, tr, 1) # unique
860 changesets = self.changelog.rev(cn) - self.changelog.rev(co)
864 changesets = self.changelog.rev(cn) - self.changelog.rev(co)
861
865
862 # pull off the manifest group
866 # pull off the manifest group
863 self.ui.status("adding manifests\n")
867 self.ui.status("adding manifests\n")
864 mm = self.manifest.tip()
868 mm = self.manifest.tip()
865 mo = self.manifest.addgroup(getgroup(), revmap, tr)
869 mo = self.manifest.addgroup(getgroup(), revmap, tr)
866
870
867 # process the files
871 # process the files
868 self.ui.status("adding file revisions\n")
872 self.ui.status("adding file revisions\n")
869 while 1:
873 while 1:
870 f = getchunk()
874 f = getchunk()
871 if not f: break
875 if not f: break
872 self.ui.debug("adding %s revisions\n" % f)
876 self.ui.debug("adding %s revisions\n" % f)
873 fl = self.file(f)
877 fl = self.file(f)
874 o = fl.tip()
878 o = fl.tip()
875 n = fl.addgroup(getgroup(), revmap, tr)
879 n = fl.addgroup(getgroup(), revmap, tr)
876 revisions += fl.rev(n) - fl.rev(o)
880 revisions += fl.rev(n) - fl.rev(o)
877 files += 1
881 files += 1
878
882
879 self.ui.status(("modified %d files, added %d changesets" +
883 self.ui.status(("modified %d files, added %d changesets" +
880 " and %d new revisions\n")
884 " and %d new revisions\n")
881 % (files, changesets, revisions))
885 % (files, changesets, revisions))
882
886
883 tr.close()
887 tr.close()
884 return
888 return
885
889
886 def update(self, node, allow=False, force=False):
890 def update(self, node, allow=False, force=False):
887 pl = self.dirstate.parents()
891 pl = self.dirstate.parents()
888 if not force and pl[1] != nullid:
892 if not force and pl[1] != nullid:
889 self.ui.warn("aborting: outstanding uncommitted merges\n")
893 self.ui.warn("aborting: outstanding uncommitted merges\n")
890 return
894 return
891
895
892 p1, p2 = pl[0], node
896 p1, p2 = pl[0], node
893 pa = self.changelog.ancestor(p1, p2)
897 pa = self.changelog.ancestor(p1, p2)
894 m1n = self.changelog.read(p1)[0]
898 m1n = self.changelog.read(p1)[0]
895 m2n = self.changelog.read(p2)[0]
899 m2n = self.changelog.read(p2)[0]
896 man = self.manifest.ancestor(m1n, m2n)
900 man = self.manifest.ancestor(m1n, m2n)
897 m1 = self.manifest.read(m1n)
901 m1 = self.manifest.read(m1n)
898 mf1 = self.manifest.readflags(m1n)
902 mf1 = self.manifest.readflags(m1n)
899 m2 = self.manifest.read(m2n)
903 m2 = self.manifest.read(m2n)
900 mf2 = self.manifest.readflags(m2n)
904 mf2 = self.manifest.readflags(m2n)
901 ma = self.manifest.read(man)
905 ma = self.manifest.read(man)
902 mfa = self.manifest.readflags(m2n)
906 mfa = self.manifest.readflags(m2n)
903
907
904 (c, a, d, u) = self.diffdir(self.root)
908 (c, a, d, u) = self.diffdir(self.root)
905
909
906 # resolve the manifest to determine which files
910 # resolve the manifest to determine which files
907 # we care about merging
911 # we care about merging
908 self.ui.note("resolving manifests\n")
912 self.ui.note("resolving manifests\n")
909 self.ui.debug(" ancestor %s local %s remote %s\n" %
913 self.ui.debug(" ancestor %s local %s remote %s\n" %
910 (short(man), short(m1n), short(m2n)))
914 (short(man), short(m1n), short(m2n)))
911
915
912 merge = {}
916 merge = {}
913 get = {}
917 get = {}
914 remove = []
918 remove = []
915 mark = {}
919 mark = {}
916
920
917 # construct a working dir manifest
921 # construct a working dir manifest
918 mw = m1.copy()
922 mw = m1.copy()
919 mfw = mf1.copy()
923 mfw = mf1.copy()
920 for f in a + c + u:
924 for f in a + c + u:
921 mw[f] = ""
925 mw[f] = ""
922 mfw[f] = is_exec(self.wjoin(f))
926 mfw[f] = is_exec(self.wjoin(f))
923 for f in d:
927 for f in d:
924 if f in mw: del mw[f]
928 if f in mw: del mw[f]
925
929
926 for f, n in mw.iteritems():
930 for f, n in mw.iteritems():
927 if f in m2:
931 if f in m2:
928 s = 0
932 s = 0
929
933
930 # are files different?
934 # are files different?
931 if n != m2[f]:
935 if n != m2[f]:
932 a = ma.get(f, nullid)
936 a = ma.get(f, nullid)
933 # are both different from the ancestor?
937 # are both different from the ancestor?
934 if n != a and m2[f] != a:
938 if n != a and m2[f] != a:
935 self.ui.debug(" %s versions differ, resolve\n" % f)
939 self.ui.debug(" %s versions differ, resolve\n" % f)
936 merge[f] = (m1.get(f, nullid), m2[f])
940 merge[f] = (m1.get(f, nullid), m2[f])
937 # merge executable bits
941 # merge executable bits
938 # "if we changed or they changed, change in merge"
942 # "if we changed or they changed, change in merge"
939 a, b, c = mfa.get(f, 0), mfw[f], mf2[f]
943 a, b, c = mfa.get(f, 0), mfw[f], mf2[f]
940 mode = ((a^b) | (a^c)) ^ a
944 mode = ((a^b) | (a^c)) ^ a
941 merge[f] = (m1.get(f, nullid), m2[f], mode)
945 merge[f] = (m1.get(f, nullid), m2[f], mode)
942 s = 1
946 s = 1
943 # are we clobbering?
947 # are we clobbering?
944 # is remote's version newer?
948 # is remote's version newer?
945 # or are we going back in time?
949 # or are we going back in time?
946 elif force or m2[f] != a or (p2 == pa and mw[f] == m1[f]):
950 elif force or m2[f] != a or (p2 == pa and mw[f] == m1[f]):
947 self.ui.debug(" remote %s is newer, get\n" % f)
951 self.ui.debug(" remote %s is newer, get\n" % f)
948 get[f] = m2[f]
952 get[f] = m2[f]
949 s = 1
953 s = 1
950 else:
954 else:
951 mark[f] = 1
955 mark[f] = 1
952
956
953 if not s and mfw[f] != mf2[f]:
957 if not s and mfw[f] != mf2[f]:
954 if force:
958 if force:
955 self.ui.debug(" updating permissions for %s\n" % f)
959 self.ui.debug(" updating permissions for %s\n" % f)
956 set_exec(self.wjoin(f), mf2[f])
960 set_exec(self.wjoin(f), mf2[f])
957 else:
961 else:
958 a, b, c = mfa.get(f, 0), mfw[f], mf2[f]
962 a, b, c = mfa.get(f, 0), mfw[f], mf2[f]
959 mode = ((a^b) | (a^c)) ^ a
963 mode = ((a^b) | (a^c)) ^ a
960 if mode != b:
964 if mode != b:
961 self.ui.debug(" updating permissions for %s\n" % f)
965 self.ui.debug(" updating permissions for %s\n" % f)
962 set_exec(self.wjoin(f), mode)
966 set_exec(self.wjoin(f), mode)
963 mark[f] = 1
967 mark[f] = 1
964 del m2[f]
968 del m2[f]
965 elif f in ma:
969 elif f in ma:
966 if not force and n != ma[f]:
970 if not force and n != ma[f]:
967 r = self.ui.prompt(
971 r = self.ui.prompt(
968 (" local changed %s which remote deleted\n" % f) +
972 (" local changed %s which remote deleted\n" % f) +
969 "(k)eep or (d)elete?", "[kd]", "k")
973 "(k)eep or (d)elete?", "[kd]", "k")
970 if r == "d":
974 if r == "d":
971 remove.append(f)
975 remove.append(f)
972 else:
976 else:
973 self.ui.debug("other deleted %s\n" % f)
977 self.ui.debug("other deleted %s\n" % f)
974 remove.append(f) # other deleted it
978 remove.append(f) # other deleted it
975 else:
979 else:
976 if n == m1.get(f, nullid): # same as parent
980 if n == m1.get(f, nullid): # same as parent
977 self.ui.debug("remote deleted %s\n" % f)
981 self.ui.debug("remote deleted %s\n" % f)
978 remove.append(f)
982 remove.append(f)
979 else:
983 else:
980 self.ui.debug("working dir created %s, keeping\n" % f)
984 self.ui.debug("working dir created %s, keeping\n" % f)
981
985
982 for f, n in m2.iteritems():
986 for f, n in m2.iteritems():
983 if f[0] == "/": continue
987 if f[0] == "/": continue
984 if not force and f in ma and n != ma[f]:
988 if not force and f in ma and n != ma[f]:
985 r = self.ui.prompt(
989 r = self.ui.prompt(
986 ("remote changed %s which local deleted\n" % f) +
990 ("remote changed %s which local deleted\n" % f) +
987 "(k)eep or (d)elete?", "[kd]", "k")
991 "(k)eep or (d)elete?", "[kd]", "k")
988 if r == "d": remove.append(f)
992 if r == "d": remove.append(f)
989 else:
993 else:
990 self.ui.debug("remote created %s\n" % f)
994 self.ui.debug("remote created %s\n" % f)
991 get[f] = n
995 get[f] = n
992
996
993 del mw, m1, m2, ma
997 del mw, m1, m2, ma
994
998
995 if force:
999 if force:
996 for f in merge:
1000 for f in merge:
997 get[f] = merge[f][1]
1001 get[f] = merge[f][1]
998 merge = {}
1002 merge = {}
999
1003
1000 if pa == p1 or pa == p2:
1004 if pa == p1 or pa == p2:
1001 # we don't need to do any magic, just jump to the new rev
1005 # we don't need to do any magic, just jump to the new rev
1002 mode = 'n'
1006 mode = 'n'
1003 p1, p2 = p2, nullid
1007 p1, p2 = p2, nullid
1004 else:
1008 else:
1005 if not allow:
1009 if not allow:
1006 self.ui.status("this update spans a branch" +
1010 self.ui.status("this update spans a branch" +
1007 " affecting the following files:\n")
1011 " affecting the following files:\n")
1008 fl = merge.keys() + get.keys()
1012 fl = merge.keys() + get.keys()
1009 fl.sort()
1013 fl.sort()
1010 for f in fl:
1014 for f in fl:
1011 cf = ""
1015 cf = ""
1012 if f in merge: cf = " (resolve)"
1016 if f in merge: cf = " (resolve)"
1013 self.ui.status(" %s%s\n" % (f, cf))
1017 self.ui.status(" %s%s\n" % (f, cf))
1014 self.ui.warn("aborting update spanning branches!\n")
1018 self.ui.warn("aborting update spanning branches!\n")
1015 self.ui.status("(use update -m to perform a branch merge)\n")
1019 self.ui.status("(use update -m to perform a branch merge)\n")
1016 return 1
1020 return 1
1017 # we have to remember what files we needed to get/change
1021 # we have to remember what files we needed to get/change
1018 # because any file that's different from either one of its
1022 # because any file that's different from either one of its
1019 # parents must be in the changeset
1023 # parents must be in the changeset
1020 mode = 'm'
1024 mode = 'm'
1021 self.dirstate.update(mark.keys(), "m")
1025 self.dirstate.update(mark.keys(), "m")
1022
1026
1023 self.dirstate.setparents(p1, p2)
1027 self.dirstate.setparents(p1, p2)
1024
1028
1025 # get the files we don't need to change
1029 # get the files we don't need to change
1026 files = get.keys()
1030 files = get.keys()
1027 files.sort()
1031 files.sort()
1028 for f in files:
1032 for f in files:
1029 if f[0] == "/": continue
1033 if f[0] == "/": continue
1030 self.ui.note("getting %s\n" % f)
1034 self.ui.note("getting %s\n" % f)
1031 t = self.file(f).read(get[f])
1035 t = self.file(f).read(get[f])
1032 try:
1036 try:
1033 self.wfile(f, "w").write(t)
1037 self.wfile(f, "w").write(t)
1034 except IOError:
1038 except IOError:
1035 os.makedirs(os.path.dirname(self.wjoin(f)))
1039 os.makedirs(os.path.dirname(self.wjoin(f)))
1036 self.wfile(f, "w").write(t)
1040 self.wfile(f, "w").write(t)
1037 set_exec(self.wjoin(f), mf2[f])
1041 set_exec(self.wjoin(f), mf2[f])
1038 self.dirstate.update([f], mode)
1042 self.dirstate.update([f], mode)
1039
1043
1040 # merge the tricky bits
1044 # merge the tricky bits
1041 files = merge.keys()
1045 files = merge.keys()
1042 files.sort()
1046 files.sort()
1043 for f in files:
1047 for f in files:
1044 self.ui.status("merging %s\n" % f)
1048 self.ui.status("merging %s\n" % f)
1045 m, o, flag = merge[f]
1049 m, o, flag = merge[f]
1046 self.merge3(f, m, o)
1050 self.merge3(f, m, o)
1047 set_exec(self.wjoin(f), flag)
1051 set_exec(self.wjoin(f), flag)
1048 self.dirstate.update([f], 'm')
1052 self.dirstate.update([f], 'm')
1049
1053
1050 for f in remove:
1054 for f in remove:
1051 self.ui.note("removing %s\n" % f)
1055 self.ui.note("removing %s\n" % f)
1052 os.unlink(f)
1056 os.unlink(f)
1053 if mode == 'n':
1057 if mode == 'n':
1054 self.dirstate.forget(remove)
1058 self.dirstate.forget(remove)
1055 else:
1059 else:
1056 self.dirstate.update(remove, 'r')
1060 self.dirstate.update(remove, 'r')
1057
1061
1058 def merge3(self, fn, my, other):
1062 def merge3(self, fn, my, other):
1059 """perform a 3-way merge in the working directory"""
1063 """perform a 3-way merge in the working directory"""
1060
1064
1061 def temp(prefix, node):
1065 def temp(prefix, node):
1062 pre = "%s~%s." % (os.path.basename(fn), prefix)
1066 pre = "%s~%s." % (os.path.basename(fn), prefix)
1063 (fd, name) = tempfile.mkstemp("", pre)
1067 (fd, name) = tempfile.mkstemp("", pre)
1064 f = os.fdopen(fd, "w")
1068 f = os.fdopen(fd, "w")
1065 f.write(fl.revision(node))
1069 f.write(fl.revision(node))
1066 f.close()
1070 f.close()
1067 return name
1071 return name
1068
1072
1069 fl = self.file(fn)
1073 fl = self.file(fn)
1070 base = fl.ancestor(my, other)
1074 base = fl.ancestor(my, other)
1071 a = self.wjoin(fn)
1075 a = self.wjoin(fn)
1072 b = temp("other", other)
1076 b = temp("other", other)
1073 c = temp("base", base)
1077 c = temp("base", base)
1074
1078
1075 self.ui.note("resolving %s\n" % fn)
1079 self.ui.note("resolving %s\n" % fn)
1076 self.ui.debug("file %s: other %s ancestor %s\n" %
1080 self.ui.debug("file %s: other %s ancestor %s\n" %
1077 (fn, short(other), short(base)))
1081 (fn, short(other), short(base)))
1078
1082
1079 cmd = os.environ.get("HGMERGE", "hgmerge")
1083 cmd = os.environ.get("HGMERGE", "hgmerge")
1080 r = os.system("%s %s %s %s" % (cmd, a, b, c))
1084 r = os.system("%s %s %s %s" % (cmd, a, b, c))
1081 if r:
1085 if r:
1082 self.ui.warn("merging %s failed!\n" % fn)
1086 self.ui.warn("merging %s failed!\n" % fn)
1083
1087
1084 os.unlink(b)
1088 os.unlink(b)
1085 os.unlink(c)
1089 os.unlink(c)
1086
1090
1087 def verify(self):
1091 def verify(self):
1088 filelinkrevs = {}
1092 filelinkrevs = {}
1089 filenodes = {}
1093 filenodes = {}
1090 changesets = revisions = files = 0
1094 changesets = revisions = files = 0
1091 errors = 0
1095 errors = 0
1092
1096
1093 seen = {}
1097 seen = {}
1094 self.ui.status("checking changesets\n")
1098 self.ui.status("checking changesets\n")
1095 for i in range(self.changelog.count()):
1099 for i in range(self.changelog.count()):
1096 changesets += 1
1100 changesets += 1
1097 n = self.changelog.node(i)
1101 n = self.changelog.node(i)
1098 if n in seen:
1102 if n in seen:
1099 self.ui.warn("duplicate changeset at revision %d\n" % i)
1103 self.ui.warn("duplicate changeset at revision %d\n" % i)
1100 errors += 1
1104 errors += 1
1101 seen[n] = 1
1105 seen[n] = 1
1102
1106
1103 for p in self.changelog.parents(n):
1107 for p in self.changelog.parents(n):
1104 if p not in self.changelog.nodemap:
1108 if p not in self.changelog.nodemap:
1105 self.ui.warn("changeset %s has unknown parent %s\n" %
1109 self.ui.warn("changeset %s has unknown parent %s\n" %
1106 (short(n), short(p)))
1110 (short(n), short(p)))
1107 errors += 1
1111 errors += 1
1108 try:
1112 try:
1109 changes = self.changelog.read(n)
1113 changes = self.changelog.read(n)
1110 except Exception, inst:
1114 except Exception, inst:
1111 self.ui.warn("unpacking changeset %s: %s\n" % (short(n), inst))
1115 self.ui.warn("unpacking changeset %s: %s\n" % (short(n), inst))
1112 errors += 1
1116 errors += 1
1113
1117
1114 for f in changes[3]:
1118 for f in changes[3]:
1115 filelinkrevs.setdefault(f, []).append(i)
1119 filelinkrevs.setdefault(f, []).append(i)
1116
1120
1117 seen = {}
1121 seen = {}
1118 self.ui.status("checking manifests\n")
1122 self.ui.status("checking manifests\n")
1119 for i in range(self.manifest.count()):
1123 for i in range(self.manifest.count()):
1120 n = self.manifest.node(i)
1124 n = self.manifest.node(i)
1121 if n in seen:
1125 if n in seen:
1122 self.ui.warn("duplicate manifest at revision %d\n" % i)
1126 self.ui.warn("duplicate manifest at revision %d\n" % i)
1123 errors += 1
1127 errors += 1
1124 seen[n] = 1
1128 seen[n] = 1
1125
1129
1126 for p in self.manifest.parents(n):
1130 for p in self.manifest.parents(n):
1127 if p not in self.manifest.nodemap:
1131 if p not in self.manifest.nodemap:
1128 self.ui.warn("manifest %s has unknown parent %s\n" %
1132 self.ui.warn("manifest %s has unknown parent %s\n" %
1129 (short(n), short(p)))
1133 (short(n), short(p)))
1130 errors += 1
1134 errors += 1
1131
1135
1132 try:
1136 try:
1133 delta = mdiff.patchtext(self.manifest.delta(n))
1137 delta = mdiff.patchtext(self.manifest.delta(n))
1134 except KeyboardInterrupt:
1138 except KeyboardInterrupt:
1135 print "aborted"
1139 print "aborted"
1136 sys.exit(0)
1140 sys.exit(0)
1137 except Exception, inst:
1141 except Exception, inst:
1138 self.ui.warn("unpacking manifest %s: %s\n"
1142 self.ui.warn("unpacking manifest %s: %s\n"
1139 % (short(n), inst))
1143 % (short(n), inst))
1140 errors += 1
1144 errors += 1
1141
1145
1142 ff = [ l.split('\0') for l in delta.splitlines() ]
1146 ff = [ l.split('\0') for l in delta.splitlines() ]
1143 for f, fn in ff:
1147 for f, fn in ff:
1144 filenodes.setdefault(f, {})[bin(fn[:40])] = 1
1148 filenodes.setdefault(f, {})[bin(fn[:40])] = 1
1145
1149
1146 self.ui.status("crosschecking files in changesets and manifests\n")
1150 self.ui.status("crosschecking files in changesets and manifests\n")
1147 for f in filenodes:
1151 for f in filenodes:
1148 if f not in filelinkrevs:
1152 if f not in filelinkrevs:
1149 self.ui.warn("file %s in manifest but not in changesets\n" % f)
1153 self.ui.warn("file %s in manifest but not in changesets\n" % f)
1150 errors += 1
1154 errors += 1
1151
1155
1152 for f in filelinkrevs:
1156 for f in filelinkrevs:
1153 if f not in filenodes:
1157 if f not in filenodes:
1154 self.ui.warn("file %s in changeset but not in manifest\n" % f)
1158 self.ui.warn("file %s in changeset but not in manifest\n" % f)
1155 errors += 1
1159 errors += 1
1156
1160
1157 self.ui.status("checking files\n")
1161 self.ui.status("checking files\n")
1158 ff = filenodes.keys()
1162 ff = filenodes.keys()
1159 ff.sort()
1163 ff.sort()
1160 for f in ff:
1164 for f in ff:
1161 if f == "/dev/null": continue
1165 if f == "/dev/null": continue
1162 files += 1
1166 files += 1
1163 fl = self.file(f)
1167 fl = self.file(f)
1164 nodes = { nullid: 1 }
1168 nodes = { nullid: 1 }
1165 seen = {}
1169 seen = {}
1166 for i in range(fl.count()):
1170 for i in range(fl.count()):
1167 revisions += 1
1171 revisions += 1
1168 n = fl.node(i)
1172 n = fl.node(i)
1169
1173
1170 if n in seen:
1174 if n in seen:
1171 self.ui.warn("%s: duplicate revision %d\n" % (f, i))
1175 self.ui.warn("%s: duplicate revision %d\n" % (f, i))
1172 errors += 1
1176 errors += 1
1173
1177
1174 if n not in filenodes[f]:
1178 if n not in filenodes[f]:
1175 self.ui.warn("%s: %d:%s not in manifests\n"
1179 self.ui.warn("%s: %d:%s not in manifests\n"
1176 % (f, i, short(n)))
1180 % (f, i, short(n)))
1177 print len(filenodes[f].keys()), fl.count(), f
1181 print len(filenodes[f].keys()), fl.count(), f
1178 errors += 1
1182 errors += 1
1179 else:
1183 else:
1180 del filenodes[f][n]
1184 del filenodes[f][n]
1181
1185
1182 flr = fl.linkrev(n)
1186 flr = fl.linkrev(n)
1183 if flr not in filelinkrevs[f]:
1187 if flr not in filelinkrevs[f]:
1184 self.ui.warn("%s:%s points to unexpected changeset %d\n"
1188 self.ui.warn("%s:%s points to unexpected changeset %d\n"
1185 % (f, short(n), fl.linkrev(n)))
1189 % (f, short(n), fl.linkrev(n)))
1186 errors += 1
1190 errors += 1
1187 else:
1191 else:
1188 filelinkrevs[f].remove(flr)
1192 filelinkrevs[f].remove(flr)
1189
1193
1190 # verify contents
1194 # verify contents
1191 try:
1195 try:
1192 t = fl.read(n)
1196 t = fl.read(n)
1193 except Exception, inst:
1197 except Exception, inst:
1194 self.ui.warn("unpacking file %s %s: %s\n"
1198 self.ui.warn("unpacking file %s %s: %s\n"
1195 % (f, short(n), inst))
1199 % (f, short(n), inst))
1196 errors += 1
1200 errors += 1
1197
1201
1198 # verify parents
1202 # verify parents
1199 (p1, p2) = fl.parents(n)
1203 (p1, p2) = fl.parents(n)
1200 if p1 not in nodes:
1204 if p1 not in nodes:
1201 self.ui.warn("file %s:%s unknown parent 1 %s" %
1205 self.ui.warn("file %s:%s unknown parent 1 %s" %
1202 (f, short(n), short(p1)))
1206 (f, short(n), short(p1)))
1203 errors += 1
1207 errors += 1
1204 if p2 not in nodes:
1208 if p2 not in nodes:
1205 self.ui.warn("file %s:%s unknown parent 2 %s" %
1209 self.ui.warn("file %s:%s unknown parent 2 %s" %
1206 (f, short(n), short(p1)))
1210 (f, short(n), short(p1)))
1207 errors += 1
1211 errors += 1
1208 nodes[n] = 1
1212 nodes[n] = 1
1209
1213
1210 # cross-check
1214 # cross-check
1211 for node in filenodes[f]:
1215 for node in filenodes[f]:
1212 self.ui.warn("node %s in manifests not in %s\n"
1216 self.ui.warn("node %s in manifests not in %s\n"
1213 % (hex(n), f))
1217 % (hex(n), f))
1214 errors += 1
1218 errors += 1
1215
1219
1216 self.ui.status("%d files, %d changesets, %d total revisions\n" %
1220 self.ui.status("%d files, %d changesets, %d total revisions\n" %
1217 (files, changesets, revisions))
1221 (files, changesets, revisions))
1218
1222
1219 if errors:
1223 if errors:
1220 self.ui.warn("%d integrity errors encountered!\n" % errors)
1224 self.ui.warn("%d integrity errors encountered!\n" % errors)
1221 return 1
1225 return 1
1222
1226
1223 class remoterepository:
1227 class remoterepository:
1224 def __init__(self, ui, path):
1228 def __init__(self, ui, path):
1225 self.url = path
1229 self.url = path
1226 self.ui = ui
1230 self.ui = ui
1227
1231
1228 def do_cmd(self, cmd, **args):
1232 def do_cmd(self, cmd, **args):
1229 self.ui.debug("sending %s command\n" % cmd)
1233 self.ui.debug("sending %s command\n" % cmd)
1230 q = {"cmd": cmd}
1234 q = {"cmd": cmd}
1231 q.update(args)
1235 q.update(args)
1232 qs = urllib.urlencode(q)
1236 qs = urllib.urlencode(q)
1233 cu = "%s?%s" % (self.url, qs)
1237 cu = "%s?%s" % (self.url, qs)
1234 return urllib.urlopen(cu)
1238 return urllib.urlopen(cu)
1235
1239
1236 def heads(self):
1240 def heads(self):
1237 d = self.do_cmd("heads").read()
1241 d = self.do_cmd("heads").read()
1238 try:
1242 try:
1239 return map(bin, d[:-1].split(" "))
1243 return map(bin, d[:-1].split(" "))
1240 except:
1244 except:
1241 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1245 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1242 raise
1246 raise
1243
1247
1244 def branches(self, nodes):
1248 def branches(self, nodes):
1245 n = " ".join(map(hex, nodes))
1249 n = " ".join(map(hex, nodes))
1246 d = self.do_cmd("branches", nodes=n).read()
1250 d = self.do_cmd("branches", nodes=n).read()
1247 try:
1251 try:
1248 br = [ tuple(map(bin, b.split(" "))) for b in d.splitlines() ]
1252 br = [ tuple(map(bin, b.split(" "))) for b in d.splitlines() ]
1249 return br
1253 return br
1250 except:
1254 except:
1251 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1255 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1252 raise
1256 raise
1253
1257
1254 def between(self, pairs):
1258 def between(self, pairs):
1255 n = "\n".join(["-".join(map(hex, p)) for p in pairs])
1259 n = "\n".join(["-".join(map(hex, p)) for p in pairs])
1256 d = self.do_cmd("between", pairs=n).read()
1260 d = self.do_cmd("between", pairs=n).read()
1257 try:
1261 try:
1258 p = [ l and map(bin, l.split(" ")) or [] for l in d.splitlines() ]
1262 p = [ l and map(bin, l.split(" ")) or [] for l in d.splitlines() ]
1259 return p
1263 return p
1260 except:
1264 except:
1261 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1265 self.ui.warn("unexpected response:\n" + d[:400] + "\n...\n")
1262 raise
1266 raise
1263
1267
1264 def changegroup(self, nodes):
1268 def changegroup(self, nodes):
1265 n = " ".join(map(hex, nodes))
1269 n = " ".join(map(hex, nodes))
1266 zd = zlib.decompressobj()
1270 zd = zlib.decompressobj()
1267 f = self.do_cmd("changegroup", roots=n)
1271 f = self.do_cmd("changegroup", roots=n)
1268 bytes = 0
1272 bytes = 0
1269 while 1:
1273 while 1:
1270 d = f.read(4096)
1274 d = f.read(4096)
1271 bytes += len(d)
1275 bytes += len(d)
1272 if not d:
1276 if not d:
1273 yield zd.flush()
1277 yield zd.flush()
1274 break
1278 break
1275 yield zd.decompress(d)
1279 yield zd.decompress(d)
1276 self.ui.note("%d bytes of data transfered\n" % bytes)
1280 self.ui.note("%d bytes of data transfered\n" % bytes)
1277
1281
1278 def repository(ui, path=None, create=0):
1282 def repository(ui, path=None, create=0):
1279 if path and path[:7] == "http://":
1283 if path and path[:7] == "http://":
1280 return remoterepository(ui, path)
1284 return remoterepository(ui, path)
1281 if path and path[:5] == "hg://":
1285 if path and path[:5] == "hg://":
1282 return remoterepository(ui, path.replace("hg://", "http://"))
1286 return remoterepository(ui, path.replace("hg://", "http://"))
1283 if path and path[:11] == "old-http://":
1287 if path and path[:11] == "old-http://":
1284 return localrepository(ui, path.replace("old-http://", "http://"))
1288 return localrepository(ui, path.replace("old-http://", "http://"))
1285 else:
1289 else:
1286 return localrepository(ui, path, create)
1290 return localrepository(ui, path, create)
1287
1291
1288 class httprangereader:
1292 class httprangereader:
1289 def __init__(self, url):
1293 def __init__(self, url):
1290 self.url = url
1294 self.url = url
1291 self.pos = 0
1295 self.pos = 0
1292 def seek(self, pos):
1296 def seek(self, pos):
1293 self.pos = pos
1297 self.pos = pos
1294 def read(self, bytes=None):
1298 def read(self, bytes=None):
1295 opener = urllib2.build_opener(byterange.HTTPRangeHandler())
1299 opener = urllib2.build_opener(byterange.HTTPRangeHandler())
1296 urllib2.install_opener(opener)
1300 urllib2.install_opener(opener)
1297 req = urllib2.Request(self.url)
1301 req = urllib2.Request(self.url)
1298 end = ''
1302 end = ''
1299 if bytes: end = self.pos + bytes
1303 if bytes: end = self.pos + bytes
1300 req.add_header('Range', 'bytes=%d-%s' % (self.pos, end))
1304 req.add_header('Range', 'bytes=%d-%s' % (self.pos, end))
1301 f = urllib2.urlopen(req)
1305 f = urllib2.urlopen(req)
1302 return f.read()
1306 return f.read()
General Comments 0
You need to be logged in to leave comments. Login now