1 """The L{StackTransaction} class makes it possible to make complex
2 updates to an StGit stack in a safe and convenient way."""
7 from stgit
import exception
, utils
8 from stgit
.utils
import any
, all
9 from stgit
.out
import *
10 from stgit
.lib
import git
, log
12 class TransactionException(exception
.StgException
):
13 """Exception raised when something goes wrong with a
14 L{StackTransaction}."""
16 class TransactionHalted(TransactionException
):
17 """Exception raised when a L{StackTransaction} stops part-way through.
18 Used to make a non-local jump from the transaction setup to the
19 part of the transaction code where the transaction is run."""
21 def _print_current_patch(old_applied
, new_applied
):
23 out
.info('Now at patch "%s"' % pn
)
24 if not old_applied
and not new_applied
:
27 now_at(new_applied
[-1])
29 out
.info('No patch applied')
30 elif old_applied
[-1] == new_applied
[-1]:
33 now_at(new_applied
[-1])
35 class _TransPatchMap(dict):
36 """Maps patch names to sha1 strings."""
37 def __init__(self
, stack
):
40 def __getitem__(self
, pn
):
42 return dict.__getitem__(self
, pn
)
44 return self
.__stack
.patches
.get(pn
).commit
46 class StackTransaction(object):
47 """A stack transaction, used for making complex updates to an StGit
48 stack in one single operation that will either succeed or fail
51 The basic theory of operation is the following:
53 1. Create a transaction object.
59 except TransactionHalted:
62 block, update the transaction with e.g. methods like
63 L{pop_patches} and L{push_patch}. This may create new git
64 objects such as commits, but will not write any refs; this means
65 that in case of a fatal error we can just walk away, no clean-up
68 (Some operations may need to touch your index and working tree,
69 though. But they are cleaned up when needed.)
71 3. After the C{try} block -- wheher or not the setup ran to
72 completion or halted part-way through by raising a
73 L{TransactionHalted} exception -- call the transaction's L{run}
74 method. This will either succeed in writing the updated state to
75 your refs and index+worktree, or fail without having done
77 def __init__(self
, stack
, msg
, discard_changes
= False,
78 allow_conflicts
= False, allow_bad_head
= False):
79 """Create a new L{StackTransaction}.
81 @param discard_changes: Discard any changes in index+worktree
82 @type discard_changes: bool
83 @param allow_conflicts: Whether to allow pre-existing conflicts
84 @type allow_conflicts: bool or function of L{StackTransaction}"""
87 self
.__patches
= _TransPatchMap(stack
)
88 self
.__applied
= list(self
.__stack
.patchorder
.applied
)
89 self
.__unapplied
= list(self
.__stack
.patchorder
.unapplied
)
90 self
.__hidden
= list(self
.__stack
.patchorder
.hidden
)
91 self
.__conflicting_push
= None
93 self
.__current_tree
= self
.__stack
.head
.data
.tree
94 self
.__base
= self
.__stack
.base
95 self
.__discard_changes
= discard_changes
96 self
.__bad_head
= None
97 self
.__conflicts
= None
98 if isinstance(allow_conflicts
, bool):
99 self
.__allow_conflicts
= lambda trans
: allow_conflicts
101 self
.__allow_conflicts
= allow_conflicts
102 self
.__temp_index
= self
.temp_index_tree
= None
103 if not allow_bad_head
:
104 self
.__assert_head_top_equal()
105 stack
= property(lambda self
: self
.__stack
)
106 patches
= property(lambda self
: self
.__patches
)
107 def __set_applied(self
, val
):
108 self
.__applied
= list(val
)
109 applied
= property(lambda self
: self
.__applied
, __set_applied
)
110 def __set_unapplied(self
, val
):
111 self
.__unapplied
= list(val
)
112 unapplied
= property(lambda self
: self
.__unapplied
, __set_unapplied
)
113 def __set_hidden(self
, val
):
114 self
.__hidden
= list(val
)
115 hidden
= property(lambda self
: self
.__hidden
, __set_hidden
)
116 all_patches
= property(lambda self
: (self
.__applied
+ self
.__unapplied
118 def __set_base(self
, val
):
119 assert (not self
.__applied
120 or self
.patches
[self
.applied
[0]].data
.parent
== val
)
122 base
= property(lambda self
: self
.__base
, __set_base
)
124 def temp_index(self
):
125 if not self
.__temp_index
:
126 self
.__temp_index
= self
.__stack
.repository
.temp_index()
127 atexit
.register(self
.__temp_index
.delete
)
128 return self
.__temp_index
132 return self
.__patches
[self
.__applied
[-1]]
135 def __get_head(self
):
137 return self
.__bad_head
140 def __set_head(self
, val
):
141 self
.__bad_head
= val
142 head
= property(__get_head
, __set_head
)
143 def __assert_head_top_equal(self
):
144 if not self
.__stack
.head_top_equal():
146 'HEAD and top are not the same.',
147 'This can happen if you modify a branch with git.',
148 '"stg repair --help" explains more about what to do next.')
150 def __checkout(self
, tree
, iw
, allow_bad_head
):
151 if not allow_bad_head
:
152 self
.__assert_head_top_equal()
153 if self
.__current_tree
== tree
and not self
.__discard_changes
:
154 # No tree change, but we still want to make sure that
155 # there are no unresolved conflicts. Conflicts
156 # conceptually "belong" to the topmost patch, and just
157 # carrying them along to another patch is confusing.
158 if (self
.__allow_conflicts(self
) or iw
== None
159 or not iw
.index
.conflicts()):
161 out
.error('Need to resolve conflicts first')
164 if self
.__discard_changes
:
165 iw
.checkout_hard(tree
)
167 iw
.checkout(self
.__current_tree
, tree
)
168 self
.__current_tree
= tree
171 raise TransactionException(
172 'Command aborted (all changes rolled back)')
173 def __check_consistency(self
):
174 remaining
= set(self
.all_patches
)
175 for pn
, commit
in self
.__patches
.iteritems():
177 assert self
.__stack
.patches
.exists(pn
)
179 assert pn
in remaining
180 def abort(self
, iw
= None):
181 # The only state we need to restore is index+worktree.
183 self
.__checkout(self
.__stack
.head
.data
.tree
, iw
,
184 allow_bad_head
= True)
185 def run(self
, iw
= None, set_head
= True, allow_bad_head
= False,
186 print_current_patch
= True):
187 """Execute the transaction. Will either succeed, or fail (with an
188 exception) and do nothing."""
189 self
.__check_consistency()
190 log
.log_external_mods(self
.__stack
)
197 self
.__checkout(new_head
.data
.tree
, iw
, allow_bad_head
)
198 except git
.CheckoutException
:
199 # We have to abort the transaction.
202 self
.__stack
.set_head(new_head
, self
.__msg
)
206 out
.error(*([self
.__error
] + self
.__conflicts
))
208 out
.error(self
.__error
)
212 for pn
, commit
in self
.__patches
.iteritems():
213 if self
.__stack
.patches
.exists(pn
):
214 p
= self
.__stack
.patches
.get(pn
)
218 p
.set_commit(commit
, msg
)
220 self
.__stack
.patches
.new(pn
, commit
, msg
)
221 self
.__stack
.patchorder
.applied
= self
.__applied
222 self
.__stack
.patchorder
.unapplied
= self
.__unapplied
223 self
.__stack
.patchorder
.hidden
= self
.__hidden
224 log
.log_entry(self
.__stack
, msg
)
225 old_applied
= self
.__stack
.patchorder
.applied
227 if self
.__conflicting_push
!= None:
228 self
.__patches
= _TransPatchMap(self
.__stack
)
229 self
.__conflicting_push()
230 write(self
.__msg
+ ' (CONFLICT)')
231 if print_current_patch
:
232 _print_current_patch(old_applied
, self
.__applied
)
235 return utils
.STGIT_CONFLICT
237 return utils
.STGIT_SUCCESS
239 def __halt(self
, msg
):
241 raise TransactionHalted(msg
)
244 def __print_popped(popped
):
247 elif len(popped
) == 1:
248 out
.info('Popped %s' % popped
[0])
250 out
.info('Popped %s -- %s' %
(popped
[-1], popped
[0]))
252 def pop_patches(self
, p
):
253 """Pop all patches pn for which p(pn) is true. Return the list of
254 other patches that had to be popped to accomplish this. Always
257 for i
in xrange(len(self
.applied
)):
258 if p(self
.applied
[i
]):
259 popped
= self
.applied
[i
:]
262 popped1
= [pn
for pn
in popped
if not p(pn
)]
263 popped2
= [pn
for pn
in popped
if p(pn
)]
264 self
.unapplied
= popped1
+ popped2
+ self
.unapplied
265 self
.__print_popped(popped
)
268 def delete_patches(self
, p
, quiet
= False):
269 """Delete all patches pn for which p(pn) is true. Return the list of
270 other patches that had to be popped to accomplish this. Always
273 all_patches
= self
.applied
+ self
.unapplied
+ self
.hidden
274 for i
in xrange(len(self
.applied
)):
275 if p(self
.applied
[i
]):
276 popped
= self
.applied
[i
:]
279 popped
= [pn
for pn
in popped
if not p(pn
)]
280 self
.unapplied
= popped
+ [pn
for pn
in self
.unapplied
if not p(pn
)]
281 self
.hidden
= [pn
for pn
in self
.hidden
if not p(pn
)]
282 self
.__print_popped(popped
)
283 for pn
in all_patches
:
285 s
= ['', ' (empty)'][self
.patches
[pn
].data
.is_nochange()]
286 self
.patches
[pn
] = None
288 out
.info('Deleted %s%s' %
(pn
, s
))
291 def push_patch(self
, pn
, iw
= None):
292 """Attempt to push the named patch. If this results in conflicts,
293 halts the transaction. If index+worktree are given, spill any
294 conflicts to them."""
295 orig_cd
= self
.patches
[pn
].data
296 cd
= orig_cd
.set_committer(None)
297 oldparent
= cd
.parent
298 cd
= cd
.set_parent(self
.top
)
299 base
= oldparent
.data
.tree
300 ours
= cd
.parent
.data
.tree
302 tree
, self
.temp_index_tree
= self
.temp_index
.merge(
303 base
, ours
, theirs
, self
.temp_index_tree
)
305 merge_conflict
= False
308 self
.__halt('%s does not apply cleanly' % pn
)
310 self
.__checkout(ours
, iw
, allow_bad_head
= False)
311 except git
.CheckoutException
:
312 self
.__halt('Index/worktree dirty')
314 iw
.merge(base
, ours
, theirs
)
315 tree
= iw
.index
.write_tree()
316 self
.__current_tree
= tree
318 except git
.MergeConflictException
, e
:
320 merge_conflict
= True
321 self
.__conflicts
= e
.conflicts
323 except git
.MergeException
, e
:
325 cd
= cd
.set_tree(tree
)
326 if any(getattr(cd
, a
) != getattr(orig_cd
, a
) for a
in
327 ['parent', 'tree', 'author', 'message']):
328 comm
= self
.__stack
.repository
.commit(cd
)
333 if not merge_conflict
and cd
.is_nochange():
335 out
.info('Pushed %s%s' %
(pn
, s
))
338 self
.patches
[pn
] = comm
339 if pn
in self
.hidden
:
344 self
.applied
.append(pn
)
346 # We've just caused conflicts, so we must allow them in
347 # the final checkout.
348 self
.__allow_conflicts
= lambda trans
: True
350 # Save this update so that we can run it a little later.
351 self
.__conflicting_push
= update
352 self
.__halt("%d merge conflict(s)" %
len(self
.__conflicts
))
354 # Update immediately.
357 def reorder_patches(self
, applied
, unapplied
, hidden
, iw
= None):
358 """Push and pop patches to attain the given ordering."""
359 common
= len(list(it
.takewhile(lambda (a
, b
): a
== b
,
360 zip(self
.applied
, applied
))))
361 to_pop
= set(self
.applied
[common
:])
362 self
.pop_patches(lambda pn
: pn
in to_pop
)
363 for pn
in applied
[common
:]:
364 self
.push_patch(pn
, iw
)
365 assert self
.applied
== applied
366 assert set(self
.unapplied
+ self
.hidden
) == set(unapplied
+ hidden
)
367 self
.unapplied
= unapplied