Show More
@@ -1,198 +1,196 b'' | |||
|
1 | 1 | # changelog.py - changelog class for mercurial |
|
2 | 2 | # |
|
3 | 3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> |
|
4 | 4 | # |
|
5 | 5 | # This software may be used and distributed according to the terms |
|
6 | 6 | # of the GNU General Public License, incorporated herein by reference. |
|
7 | 7 | |
|
8 | 8 | from revlog import * |
|
9 | 9 | from i18n import _ |
|
10 | 10 | import os, time, util |
|
11 | 11 | |
|
12 | 12 | def _string_escape(text): |
|
13 | 13 | """ |
|
14 | 14 | >>> d = {'nl': chr(10), 'bs': chr(92), 'cr': chr(13), 'nul': chr(0)} |
|
15 | 15 | >>> s = "ab%(nl)scd%(bs)s%(bs)sn%(nul)sab%(cr)scd%(bs)s%(nl)s" % d |
|
16 | 16 | >>> s |
|
17 | 17 | 'ab\\ncd\\\\\\\\n\\x00ab\\rcd\\\\\\n' |
|
18 | 18 | >>> res = _string_escape(s) |
|
19 | 19 | >>> s == _string_unescape(res) |
|
20 | 20 | True |
|
21 | 21 | """ |
|
22 | 22 | # subset of the string_escape codec |
|
23 | 23 | text = text.replace('\\', '\\\\').replace('\n', '\\n').replace('\r', '\\r') |
|
24 | 24 | return text.replace('\0', '\\0') |
|
25 | 25 | |
|
26 | 26 | def _string_unescape(text): |
|
27 | 27 | return text.decode('string_escape') |
|
28 | 28 | |
|
29 | 29 | class appender: |
|
30 | 30 | '''the changelog index must be update last on disk, so we use this class |
|
31 | 31 | to delay writes to it''' |
|
32 | 32 | def __init__(self, fp, buf): |
|
33 | 33 | self.data = buf |
|
34 | 34 | self.fp = fp |
|
35 | 35 | self.offset = fp.tell() |
|
36 | 36 | self.size = util.fstat(fp).st_size |
|
37 | 37 | |
|
38 | 38 | def end(self): |
|
39 | 39 | return self.size + len("".join(self.data)) |
|
40 | 40 | def tell(self): |
|
41 | 41 | return self.offset |
|
42 | 42 | def flush(self): |
|
43 | 43 | pass |
|
44 | 44 | def close(self): |
|
45 | 45 | self.fp.close() |
|
46 | 46 | |
|
47 | 47 | def seek(self, offset, whence=0): |
|
48 | 48 | '''virtual file offset spans real file and data''' |
|
49 | 49 | if whence == 0: |
|
50 | 50 | self.offset = offset |
|
51 | 51 | elif whence == 1: |
|
52 | 52 | self.offset += offset |
|
53 | 53 | elif whence == 2: |
|
54 | 54 | self.offset = self.end() + offset |
|
55 | 55 | if self.offset < self.size: |
|
56 | 56 | self.fp.seek(self.offset) |
|
57 | 57 | |
|
58 | 58 | def read(self, count=-1): |
|
59 | 59 | '''only trick here is reads that span real file and data''' |
|
60 | 60 | ret = "" |
|
61 | 61 | if self.offset < self.size: |
|
62 | 62 | s = self.fp.read(count) |
|
63 | 63 | ret = s |
|
64 | 64 | self.offset += len(s) |
|
65 | 65 | if count > 0: |
|
66 | 66 | count -= len(s) |
|
67 | 67 | if count != 0: |
|
68 | 68 | doff = self.offset - self.size |
|
69 | 69 | self.data.insert(0, "".join(self.data)) |
|
70 | 70 | del self.data[1:] |
|
71 | 71 | s = self.data[0][doff:doff+count] |
|
72 | 72 | self.offset += len(s) |
|
73 | 73 | ret += s |
|
74 | 74 | return ret |
|
75 | 75 | |
|
76 | 76 | def write(self, s): |
|
77 | 77 | self.data.append(str(s)) |
|
78 | 78 | self.offset += len(s) |
|
79 | 79 | |
|
80 | 80 | class changelog(revlog): |
|
81 | 81 | def __init__(self, opener): |
|
82 | 82 | revlog.__init__(self, opener, "00changelog.i") |
|
83 | 83 | |
|
84 | 84 | def delayupdate(self): |
|
85 | 85 | "delay visibility of index updates to other readers" |
|
86 | 86 | self._realopener = self.opener |
|
87 | 87 | self.opener = self._delayopener |
|
88 | 88 | self._delaycount = self.count() |
|
89 | 89 | self._delaybuf = [] |
|
90 | 90 | self._delayname = None |
|
91 | 91 | |
|
92 | 92 | def finalize(self, tr): |
|
93 | 93 | "finalize index updates" |
|
94 | 94 | self.opener = self._realopener |
|
95 | 95 | # move redirected index data back into place |
|
96 | 96 | if self._delayname: |
|
97 | 97 | util.rename(self._delayname + ".a", self._delayname) |
|
98 | 98 | elif self._delaybuf: |
|
99 | 99 | fp = self.opener(self.indexfile, 'a') |
|
100 | 100 | fp.write("".join(self._delaybuf)) |
|
101 | 101 | fp.close() |
|
102 | 102 | del self._delaybuf |
|
103 | 103 | # split when we're done |
|
104 | 104 | self.checkinlinesize(tr) |
|
105 | 105 | |
|
106 | 106 | def _delayopener(self, name, mode='r'): |
|
107 | 107 | fp = self._realopener(name, mode) |
|
108 | 108 | # only divert the index |
|
109 | 109 | if not name == self.indexfile: |
|
110 | 110 | return fp |
|
111 | 111 | # if we're doing an initial clone, divert to another file |
|
112 | 112 | if self._delaycount == 0: |
|
113 | 113 | self._delayname = fp.name |
|
114 | 114 | return self._realopener(name + ".a", mode) |
|
115 | 115 | # otherwise, divert to memory |
|
116 | 116 | return appender(fp, self._delaybuf) |
|
117 | 117 | |
|
118 | 118 | def checkinlinesize(self, tr, fp=None): |
|
119 | 119 | if self.opener == self._delayopener: |
|
120 | 120 | return |
|
121 | 121 | return revlog.checkinlinesize(self, tr, fp) |
|
122 | 122 | |
|
123 | 123 | def decode_extra(self, text): |
|
124 | 124 | extra = {} |
|
125 | 125 | for l in text.split('\0'): |
|
126 | 126 | if not l: |
|
127 | 127 | continue |
|
128 | 128 | k, v = _string_unescape(l).split(':', 1) |
|
129 | 129 | extra[k] = v |
|
130 | 130 | return extra |
|
131 | 131 | |
|
132 | 132 | def encode_extra(self, d): |
|
133 | 133 | # keys must be sorted to produce a deterministic changelog entry |
|
134 | 134 | keys = d.keys() |
|
135 | 135 | keys.sort() |
|
136 | 136 | items = [_string_escape('%s:%s' % (k, d[k])) for k in keys] |
|
137 | 137 | return "\0".join(items) |
|
138 | 138 | |
|
139 |
def |
|
|
139 | def read(self, node): | |
|
140 | 140 | """ |
|
141 | 141 | format used: |
|
142 | 142 | nodeid\n : manifest node in ascii |
|
143 | 143 | user\n : user, no \n or \r allowed |
|
144 | 144 | time tz extra\n : date (time is int or float, timezone is int) |
|
145 | 145 | : extra is metadatas, encoded and separated by '\0' |
|
146 | 146 | : older versions ignore it |
|
147 | 147 | files\n\n : files modified by the cset, no \n or \r allowed |
|
148 | 148 | (.*) : comment (free text, ideally utf-8) |
|
149 | 149 | |
|
150 | 150 | changelog v0 doesn't use extra |
|
151 | 151 | """ |
|
152 | text = self.revision(node) | |
|
152 | 153 | if not text: |
|
153 | 154 | return (nullid, "", (0, 0), [], "", {'branch': 'default'}) |
|
154 | 155 | last = text.index("\n\n") |
|
155 | 156 | desc = util.tolocal(text[last + 2:]) |
|
156 | 157 | l = text[:last].split('\n') |
|
157 | 158 | manifest = bin(l[0]) |
|
158 | 159 | user = util.tolocal(l[1]) |
|
159 | 160 | |
|
160 | 161 | extra_data = l[2].split(' ', 2) |
|
161 | 162 | if len(extra_data) != 3: |
|
162 | 163 | time = float(extra_data.pop(0)) |
|
163 | 164 | try: |
|
164 | 165 | # various tools did silly things with the time zone field. |
|
165 | 166 | timezone = int(extra_data[0]) |
|
166 | 167 | except: |
|
167 | 168 | timezone = 0 |
|
168 | 169 | extra = {} |
|
169 | 170 | else: |
|
170 | 171 | time, timezone, extra = extra_data |
|
171 | 172 | time, timezone = float(time), int(timezone) |
|
172 | 173 | extra = self.decode_extra(extra) |
|
173 | 174 | if not extra.get('branch'): |
|
174 | 175 | extra['branch'] = 'default' |
|
175 | 176 | files = l[3:] |
|
176 | 177 | return (manifest, user, (time, timezone), files, desc, extra) |
|
177 | 178 | |
|
178 | def read(self, node): | |
|
179 | return self.extract(self.revision(node)) | |
|
180 | ||
|
181 | 179 | def add(self, manifest, list, desc, transaction, p1=None, p2=None, |
|
182 | 180 | user=None, date=None, extra={}): |
|
183 | 181 | |
|
184 | 182 | user, desc = util.fromlocal(user), util.fromlocal(desc) |
|
185 | 183 | |
|
186 | 184 | if date: |
|
187 | 185 | parseddate = "%d %d" % util.parsedate(date) |
|
188 | 186 | else: |
|
189 | 187 | parseddate = "%d %d" % util.makedate() |
|
190 | 188 | if extra and extra.get("branch") in ("default", ""): |
|
191 | 189 | del extra["branch"] |
|
192 | 190 | if extra: |
|
193 | 191 | extra = self.encode_extra(extra) |
|
194 | 192 | parseddate = "%s %s" % (parseddate, extra) |
|
195 | 193 | list.sort() |
|
196 | 194 | l = [hex(manifest), user, parseddate] + list + ["", desc] |
|
197 | 195 | text = "\n".join(l) |
|
198 | 196 | return self.addrevision(text, transaction, self.count(), p1, p2) |
General Comments 0
You need to be logged in to leave comments.
Login now