155 olddata = ctx[path].data() |
155 olddata = ctx[path].data() |
156 newdata = fixfile(ui, opts, fixers, ctx, path, basectxs[rev]) |
156 newdata = fixfile(ui, opts, fixers, ctx, path, basectxs[rev]) |
157 # Don't waste memory/time passing unchanged content back, but |
157 # Don't waste memory/time passing unchanged content back, but |
158 # produce one result per item either way. |
158 # produce one result per item either way. |
159 yield (rev, path, newdata if newdata != olddata else None) |
159 yield (rev, path, newdata if newdata != olddata else None) |
160 results = worker.worker(ui, 1.0, getfixes, tuple(), workqueue) |
160 results = worker.worker(ui, 1.0, getfixes, tuple(), workqueue, |
|
161 threadsafe=False) |
161 |
162 |
162 # We have to hold on to the data for each successor revision in memory |
163 # We have to hold on to the data for each successor revision in memory |
163 # until all its parents are committed. We ensure this by committing and |
164 # until all its parents are committed. We ensure this by committing and |
164 # freeing memory for the revisions in some topological order. This |
165 # freeing memory for the revisions in some topological order. This |
165 # leaves a little bit of memory efficiency on the table, but also makes |
166 # leaves a little bit of memory efficiency on the table, but also makes |