summaryrefslogtreecommitdiffstats
path: root/meta-hob/COPYING.MIT
diff options
context:
space:
mode:
authorRichard Purdie <richard.purdie@linuxfoundation.org>2012-03-01 23:38:00 +0000
committerRichard Purdie <richard.purdie@linuxfoundation.org>2012-03-02 16:22:48 +0000
commitd1168cc12a7640b509aa3b49a4e25be794c61875 (patch)
tree555f96c86a35251fd89e38d0c004d2e745711232 /meta-hob/COPYING.MIT
parent01954b9c65c979e03b7f07ab30889ceb20ed0d05 (diff)
downloadpoky-d1168cc12a7640b509aa3b49a4e25be794c61875.tar.gz
lib/oe/patch.py: Fix and improve PatchTree() resolver logic
Currently, if PATCHRESOLVE is user and and PatchTree() is being used, you can get backtraces if patch application fails. This is because even in the failure case, self._current is incremented, meaning second time around, there are array range issues. This patch changes the code so _current is only incremented upon successful patch application, thereby resolving this failure. Secondly, if you bitbake -c patch -f a recipe using PatchTree(), the clean method was unimplemented leading to patch failures. The other part of this patch changes the logic so a series file and set of applied patches are maintained in a quilt like fashion. This means a the Clean method can be implemented correctly and rerunning the patch task of an existing patches source now works reliably. [YOCTO #2043 partially] (From OE-Core rev: f0fc47aea37793a62c43f10eea27ca014c420924) Signed-off-by: Richard Purdie <richard.purdie@linuxfoundation.org>
Diffstat (limited to 'meta-hob/COPYING.MIT')
0 files changed, 0 insertions, 0 deletions