Merge lp:~ian-clatworthy/bzr/faster-dirstate-saving into lp:~bzr/bzr/trunk-old

[Ian Clatworthy]

[Ian Clatworthy (ian-clatworthy)]

Many commonly used commands like status, add and commit update the dirstate, triggering a dirstate serialisation & save. On huge trees like OpenOffice, this is slower than it needs to be. In particular, 'xxx status file' takes 0.4 seconds in hg and 1.0 seconds in bzr and a good percentage of the difference is due to the time we take to serialise the new dirstate.

This branch is an experiment/RFC in fixing that. It drops the time for 'bzr status file' by 30-35% down to 0.65-0.70 seconds. It does that by remembering the serialised form of entries and only re-serialising entries that are known to be changed. Right now, this smart remembering of what's changed is only effectively implemented for status, though the internal API is in place for extending that to other use cases.

Of course, there are other ways of skinning this cat. One option is to write a pyrex serialiser. That ought to be fast but it still doesn't solve the root problem: serialisation time is O(size-of-tree) currently because we only keep a modified vs unmodified flag at the whole-of-dirstate level. Another option is to append 'overlays' to the dirstate file, i.e. entries which have been added or changed vs the base entries. Deletes or renames would trigger a full clean write but the common cases of add and/or change would just append entries. That's non-trivial but potentially very fast.

More broadly, I think the important thing to be begin recording the changes as this patch allows. So my current thoughts are that we ought to start with this patch, make the changes to enable smarter recording for add and commit, and built from there. At any point, we can separately do a pyrex serialiser and it will complement this work.

Having said all that, dirstate is my least favourite part of the Bazaar code base: indexing into tuples using magic integers may be fast but it sucks from an understandability perspective (vs objects + attributes). There are people far more qualified than I to say how this ought to proceed and to write the code, but they're rather busy tackling other things. Regardless, it's been a good exercise for me in getting dirstate paged into my head for other work I'm doing. It's a step forward but I can't definitively say it's in the right direction.

Thoughts?

[Andrew Bennetts (spiv)]

Brief thought: perhaps simply don't bother updating the dirstate file if the number of changes is very small? (Or do we already do this?)

[Ian Clatworthy (ian-clatworthy)]

> Brief thought: perhaps simply don't bother updating the dirstate file if the
> number of changes is very small? (Or do we already do this?)

Poolie has agreed with this so I'll go ahead and resubmit accordingly. The updated benchmark time for 'bzr status file' on OOo is 0.5 seconds, down from 1.0 second.

We just need to agree on a # of changes below which it's not worth saving. I suggest we should save for 3 or more changes - so we skip iff 2 or less files are changed. If someone has a better number, let me know.

[John A Meinel (jameinel)]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Ian Clatworthy wrote:
>> Brief thought: perhaps simply don't bother updating the dirstate file if the
>> number of changes is very small? (Or do we already do this?)
>
> Poolie has agreed with this so I'll go ahead and resubmit accordingly. The updated benchmark time for 'bzr status file' on OOo is 0.5 seconds, down from 1.0 second.
>
> We just need to agree on a # of changes below which it's not worth saving. I suggest we should save for 3 or more changes - so we skip iff 2 or less files are changed. If someone has a better number, let me know.

A guideline is: "Don't save if it would cost as much data as you avoid
reading".

The cost of not updating the dirstate is having to re-read the file
who's sha is now different. So if the dirstate is 1MB, and the file is
10k, then you should not update if there are 10 files that are changed.

If you *want* to look at text_size and compare it to len(lines) we could
do that. Otherwise I'm fine with a heuristic of < 1% of the tree, or
something like that.

John
=:->
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (Cygwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAkoepA4ACgkQJdeBCYSNAANrVwCgwjbMhA60vNrtlpbciGdFw9pp
Y6MAn1FfgUIcKOSm5BjgXP5EjKJtbaVS
=i1ML
-----END PGP SIGNATURE-----

[Martin Pool (mbp)]

2009/5/28 John A Meinel <email address hidden>:
> A guideline is: "Don't save if it would cost as much data as you avoid
> reading".
>
> The cost of not updating the dirstate is having to re-read the file
> who's sha is now different. So if the dirstate is 1MB, and the file is
> 10k, then you should not update if there are 10 files that are changed.
>
> If you *want* to look at text_size and compare it to len(lines) we could
> do that. Otherwise I'm fine with a heuristic of < 1% of the tree, or
> something like that.

It's possibly a bit more work, but as I commented on the bug, I'd
actually like to try turning off writing it altogether for logical
readonly operations.

--
Martin <http://launchpad.net/~mbp/>

[Ian Clatworthy (ian-clatworthy)]

This updated merge proposal makes it configurable as to how many changes are ok before the dirstate should be saved. As Martin requested, there's the ability to turn off saving altogether. After this lands, we can use that to implement various policies (e.g. don't save on a logical read-only operation) as we see fit.

This drops 'bzr st [file]' down by 0.5+ seconds on OOo. Nice. It doesn't yet make a difference for add or commit. Those are small follow-on patches after we're happy with this one.

[Andrew Bennetts (spiv)]

I'm no dirstate expert, so depending on how confident you are with this patch you might like to wait for another review before merging.

Overall, I this change seems ok to me. It deserves careful benchmarking of course, but I know you've been doing that :)

It's interesting to me that _build_line_cache actually re-reads the lines from the file. I had expected that maybe we'd keep the lines around from the original read, but perhaps this is just as good. If we mmap'ed the dirstate then certainly re-reading from the mmap rather than keeping a copy would clearly make sense.

+ :param worth_saving_limit: when the exact number of changed entries
+ is known, only bother saving the dirstate if more than this
+ count of entries have changed. -1 means never save.

I'd personally prefer "None means never save", but that's not a big deal.

I believe the dirstate can record changes to tree state, not just cache stat info... so is there a risk with this patch that e.g. "bzr mv foo bar" will go unrecorded because it's under the _worth_saving_limit? I understand the value in not updating the cache for only a small number of changes, but AFAIK we always want to update the dirstate file when actual state is changed. I think the header_too=True flag is used to make sure this works, but that seems like a pretty indirect way of expressing the concept that this is a non-optional update.

I wonder: if you unconditionally set _worth_saving_limit to something very high (e.g. 1000000) does the test suite still pass? My guess is that except perhaps for one or two hyper-sensitive tests it ought to, and it might make for an interesting sanity check.

+ # We only enable smart saving is it hasn't already been disabled

"is" -> "if"

+ if self._use_smart_saving is not False:
+ self._use_smart_saving = True

So if _use_smart_saving is True, set it to True? Is that right? Perhaps you mean "is not None"?

(If you really are just testing for True/False, it's generally a bad idea to test for True or False with "is". Use "if [not] self._use_smart_saving:" instead, which is also easier to read.)

review: Approve

[John A Meinel (jameinel)]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Andrew Bennetts wrote:
> Review: Approve
> I'm no dirstate expert, so depending on how confident you are with this patch you might like to wait for another review before merging.
>
> Overall, I this change seems ok to me. It deserves careful benchmarking of course, but I know you've been doing that :)
>
> It's interesting to me that _build_line_cache actually re-reads the lines from the file.

I'm a bit surprised that re-reading the file is significantly faster
than converting a tuple of strings back into a serialized string. If it
is significant, than I'd certainly rather a pyrex extension than reading
from disk...

>
> + :param worth_saving_limit: when the exact number of changed entries
> + is known, only bother saving the dirstate if more than this
> + count of entries have changed. -1 means never save.
>
> I'd personally prefer "None means never save", but that's not a big deal.
>
> I believe the dirstate can record changes to tree state, not just cache stat info...
> so is there a risk with this patch that e.g. "bzr mv foo bar" will go
unrecorded because it's under the _worth_saving_limit? I understand the
value in not updating the cache for only a small number of changes, but
AFAIK we always want to update the dirstate file when actual state is
changed. I think the header_too=True flag is used to make sure this
works, but that seems like a pretty indirect way of expressing the
concept that this is a non-optional update.

The *big* think to watch out for is that there is "IN_MEMORY_MODIFIED"
that happens from a stat cache update, which can be trivially ignored.
And there is "IN_MEMORY_MODIFIED" that happens from "bzr add" which
*must* be written out.

I didn't look at the code to see if Ian clearly distinguished them, if
he has, then we are fine.

John
=:->
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (Cygwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAkoogDcACgkQJdeBCYSNAAPFWQCfeAnQLM2UPq6K+BVsleEy+szw
UIsAoKeT7L7Jybvz8vHUZI32kw9XSmNP
=SWQG
-----END PGP SIGNATURE-----

[Ian Clatworthy (ian-clatworthy)]

Andrew Bennetts wrote:
> Review: Approve
>
> It's interesting to me that _build_line_cache actually re-reads the lines from the file. I had expected that maybe we'd keep the lines around from the original read, but perhaps this is just as good. If we mmap'ed the dirstate then certainly re-reading from the mmap rather than keeping a copy would clearly make sense.
>
>
Andrew,

Thanks for the review!

I did carefully benchmark a few approaches here and, as discussed on
IRC, not doing anything unless we absolutely have to gives the best
result for status. For other operations (that don't leverage the ability
to track some changes yet), the best time to read is probably just
before we mutate the dirstate. FWIW, profiling showed file reading time
to be a small factor - it was rebuilding the keys in the right order
that mattered. Before mutation, we simply grab them straight out of the
dirstate. After then, we need to rebuild them from the file content.

> I believe the dirstate can record changes to tree state, not just cache stat info... so is there a risk with this patch that e.g. "bzr mv foo bar" will go unrecorded because it's under the _worth_saving_limit? I understand the value in not updating the cache for only a small number of changes, but AFAIK we always want to update the dirstate file when actual state is changed. I think the header_too=True flag is used to make sure this works, but that seems like a pretty indirect way of expressing the concept that this is a non-optional update.
>
>
With this patch, there's no risk here. When follow-on patches arrive for
operations other than status, I'll need to handle those sorts of cases.

> I wonder: if you unconditionally set _worth_saving_limit to something very high (e.g. 1000000) does the test suite still pass? My guess is that except perhaps for one or two hyper-sensitive tests it ought to, and it might make for an interesting sanity check.
>
>
I tried this during development. Some low level tests fail that "make
change then read disk content". Otherwise, it looked ok to me.

> + # We only enable smart saving is it hasn't already been disabled
>
> "is" -> "if"
>
> + if self._use_smart_saving is not False:
> + self._use_smart_saving = True
>
> So if _use_smart_saving is True, set it to True? Is that right? Perhaps you mean "is not None"?
>
>
As discussed on IRC, I'll make this "if xxx is None".

Once again, thanks for the review.

Ian C.

[John A Meinel (jameinel)]

I'd just like to make it clear that I'm "hesitant" on this patch. I'll admit I haven't looked at it closely, but it seems a bit along the lines of a band-aid for now sort of thing.

Especially given the complexity of keeping multiple inventories in sync...

221 + if self._dirblock_state == DirState.IN_MEMORY_UNMODIFIED:
222 + keys = []
223 + for directory in self._dirblocks:
224 + keys.extend([e[0] for e in directory[1]])
225 + else:

What is the use case for calling _build_line_cache when the current state is IN_MEMORY_UNMODIFIED? Certainly save() is already defined as a no-op in that case. I'd rather avoid having extra code paths that aren't really being used.
I guess maybe it is if the header changes and the blocks don't...

I'll just mention that if you look over the code, the only time _header_state = ...MODIFIED is when _dirblock_state = ... MODIFIED

The only reason it has a separate state flag, is because you can read the header without reading the rest of the dirblocks. (At least to date, certainly the knob exists for that to not be true.)
Though if you consider what is in the header:

1) num parents / parent ids (if this changes, the dirblock state certainly should)
2) ghost parents (see 1)
3) crc (Also indicative of actual content changes)
4) num_entries (if this changes, we better have dirblock changes)

review: Needs Information

[Robert Collins (lifeless)]

re: safety.

Can I propose that we have an explicit API for just updating the hash
cache (we may already). And that the current state of MODIFIED *always*
refer to having semantic changes rather than hash cache updates.

Then, the hash cache updating code should not alter the dirstate state.
Rather it should just accumulate into a 'hash cache changes counter'.
And save can check that.

This may be very similar to the code. The key thing is that I hope this
will structure things so as to avoid needing to be careful in commands.

-Rob

=== modified file 'bzrlib/_dirstate_helpers_c.pyx'
--- bzrlib/_dirstate_helpers_c.pyx	2009-06-09 01:52:10 +0000
+++ bzrlib/_dirstate_helpers_c.pyx	2009-06-16 02:37:03 +0000
@@ -909,7 +909,7 @@
         else:
             entry[1][0] = ('l', '', stat_value.st_size,
                            False, DirState.NULLSTAT)
-    self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+    self._mark_modified([entry])
     return link_or_sha1
 
 
 
=== modified file 'bzrlib/dirstate.py'
--- bzrlib/dirstate.py	2009-06-01 08:55:17 +0000
+++ bzrlib/dirstate.py	2009-06-16 02:37:03 +0000
@@ -362,11 +362,14 @@
     HEADER_FORMAT_2 = '#bazaar dirstate flat format 2\n'
     HEADER_FORMAT_3 = '#bazaar dirstate flat format 3\n'
 
-    def __init__(self, path, sha1_provider):
+    def __init__(self, path, sha1_provider, worth_saving_limit=0):
         """Create a  DirState object.
 
         :param path: The path at which the dirstate file on disk should live.
         :param sha1_provider: an object meeting the SHA1Provider interface.
+        :param worth_saving_limit: when the exact number of changed entries
+            is known, only bother saving the dirstate if more than this
+            count of entries have changed. -1 means never save.
         """
         # _header_state and _dirblock_state represent the current state
         # of the dirstate metadata and the per-row data respectiely.
@@ -409,11 +412,48 @@
         # during commit.
         self._last_block_index = None
         self._last_entry_index = None
+        # If True, use the per-entry field cache for faster serialisation.
+        # If False, disable it. If None, it is not used but may be enabled.
+        self._use_smart_saving = None
+        # The set of known changes
+        self._known_changes = set()
+        # The cache of serialised lines. When built, this is a tuple of
+        # 2 sorted lists that we "walk" while serialising.
+        self._line_cache = None
+        # How many changed entries can we have without saving
+        self._worth_saving_limit = worth_saving_limit
 
     def __repr__(self):
         return "%s(%r)" % \
             (self.__class__.__name__, self._filename)
 
+    def _mark_modified(self, entries=None, header_too=False):
+        """Mark this dirstate as modified.
+
+        :param entries: if non-None, mark just these entries as modified.
+        :param header_too: mark the header modified as well, not just the
+          dirblocks.
+        """
+        #trace.mutter_callsite(3, "modified entries: %s", entries)
+        if entries:
+            self._known_changes.update([e[0] for e in entries])
+            # We only enable smart saving is it hasn't already been disabled
+            if self._use_smart_saving is not False:
+                self._use_smart_saving = True
+        else:
+            # We don't know exactly what changed so disable smart saving
+            self._use_smart_saving = False
+        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        if header_too:
+            self._header_state = DirState.IN_MEMORY_MODIFIED
+
+    def _mark_unmodified(self):
+        """Mark this dirstate as unmodified."""
+        self._header_state = DirState.IN_MEMORY_UNMODIFIED
+        self._dirblock_state = DirState.IN_MEMORY_UNMODIFIED
+        self._use_smart_saving = None
+        self._known_changes = set()
+
     def add(self, path, file_id, kind, stat, fingerprint):
         """Add a path to be tracked.
 
@@ -545,7 +585,7 @@
         if kind == 'directory':
            # insert a new dirblock
            self._ensure_block(block_index, entry_index, utf8path)
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified()
         if self._id_index:
             self._id_index.setdefault(entry_key[2], set()).add(entry_key)
 
@@ -1017,8 +1057,7 @@
 
         self._ghosts = []
         self._parents = [parents[0]]
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
-        self._header_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified(header_too=True)
 
     def _empty_parent_info(self):
         return [DirState.NULL_PARENT_DETAILS] * (len(self._parents) -
@@ -1460,8 +1499,7 @@
         # Apply in-situ changes.
         self._update_basis_apply_changes(changes)
 
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
-        self._header_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified(header_too=True)
         self._id_index = None
         return
 
@@ -1594,7 +1632,7 @@
                 and stat_value.st_ctime < self._cutoff_time):
                 entry[1][0] = ('f', sha1, entry[1][0][2], entry[1][0][3],
                     packed_stat)
-                self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+                self._mark_modified()
 
     def _sha_cutoff_time(self):
         """Return cutoff time.
@@ -1658,14 +1696,13 @@
         """Serialise the entire dirstate to a sequence of lines."""
         if (self._header_state == DirState.IN_MEMORY_UNMODIFIED and
             self._dirblock_state == DirState.IN_MEMORY_UNMODIFIED):
-            # read whats on disk.
+            # read what's on disk.
             self._state_file.seek(0)
             return self._state_file.readlines()
         lines = []
         lines.append(self._get_parents_line(self.get_parent_ids()))
         lines.append(self._get_ghosts_line(self._ghosts))
-        # append the root line which is special cased
-        lines.extend(map(self._entry_to_line, self._iter_entries()))
+        lines.extend(self._get_entry_lines())
         return self._get_output_lines(lines)
 
     def _get_ghosts_line(self, ghost_ids):
@@ -1676,6 +1713,37 @@
         """Create a line for the state file for parents information."""
         return '\0'.join([str(len(parent_ids))] + parent_ids)
 
+    def _get_entry_lines(self):
+        """Create lines for entries."""
+        if self._use_smart_saving:
+            # Build the line cache if it hasn't already been built
+            self._build_line_cache()
+            # We unroll this case for better performance ...
+            # The line cache is a tuple of 2 ordered lists: keys and lines.
+            # We keep track of successful matches and only search from there
+            # on next time.
+            entry_to_line = self._entry_to_line
+            known_changes = self._known_changes
+            index = 0
+            keys, serialised = self._line_cache
+            result = []
+            for entry in self._iter_entries():
+                key = entry[0]
+                if key in known_changes:
+                    result.append(entry_to_line(entry))
+                else:
+                    if keys[index] != key:
+                        try:
+                            index = keys.index(key, index + 1)
+                        except ValueError:
+                            result.append(entry_to_line(entry))
+                            continue
+                    result.append(serialised[index])
+                    index += 1
+            return result
+        else:
+            return map(self._entry_to_line, self._iter_entries())
+
     def _get_fields_to_entry(self):
         """Get a function which converts entry fields into a entry record.
 
@@ -2034,17 +2102,21 @@
         return len(self._parents) - len(self._ghosts)
 
     @staticmethod
-    def on_file(path, sha1_provider=None):
+    def on_file(path, sha1_provider=None, worth_saving_limit=0):
         """Construct a DirState on the file at path "path".
 
         :param path: The path at which the dirstate file on disk should live.
         :param sha1_provider: an object meeting the SHA1Provider interface.
             If None, a DefaultSHA1Provider is used.
+        :param worth_saving_limit: when the exact number of changed entries
+            is known, only bother saving the dirstate if more than this
+            count of entries have changed. -1 means never save.
         :return: An unlocked DirState object, associated with the given path.
         """
         if sha1_provider is None:
             sha1_provider = DefaultSHA1Provider()
-        result = DirState(path, sha1_provider)
+        result = DirState(path, sha1_provider,
+            worth_saving_limit=worth_saving_limit)
         return result
 
     def _read_dirblocks_if_needed(self):
@@ -2058,6 +2130,36 @@
         if self._dirblock_state == DirState.NOT_IN_MEMORY:
             _read_dirblocks(self)
 
+    def _build_line_cache(self):
+        """Build the line cache.
+
+        The line cache maps entry keys to serialised lines via
+        a tuple of 2 sorted lists.
+        """
+        if self._line_cache is not None:
+            # already built
+            return
+        self._state_file.seek(0)
+        lines = self._state_file.readlines()
+        # There are 5 header lines: 3 in the prelude, a line for
+        # parents and a line for ghosts. There is also a trailing
+        # empty line. We skip over those.
+        # Each line starts with a null and ends with a null and
+        # newline. We don't keep those because the serialisation
+        # process adds them.
+        values = [l[1:-2] for l in lines[5:-1]]
+        if self._dirblock_state == DirState.IN_MEMORY_UNMODIFIED:
+            keys = []
+            for directory in self._dirblocks:
+                keys.extend([e[0] for e in directory[1]])
+        else:
+            # Be safe and calculate the keys from the lines
+            keys = []
+            for v in values:
+                fields = v.split('\0', 3)
+                keys.append((fields[0], fields[1], fields[2]))
+        self._line_cache = (keys, values)
+
     def _read_header(self):
         """This reads in the metadata header, and the parent ids.
 
@@ -2142,9 +2244,7 @@
             trace.mutter('Not saving DirState because '
                     '_changes_aborted is set.')
             return
-        if (self._header_state == DirState.IN_MEMORY_MODIFIED or
-            self._dirblock_state == DirState.IN_MEMORY_MODIFIED):
-
+        if self._worth_saving():
             grabbed_write_lock = False
             if self._lock_state != 'w':
                 grabbed_write_lock, new_lock = self._lock_token.temporary_write_lock()
@@ -2158,12 +2258,12 @@
                     # We couldn't grab a write lock, so we switch back to a read one
                     return
             try:
+                lines = self.get_lines()
                 self._state_file.seek(0)
-                self._state_file.writelines(self.get_lines())
+                self._state_file.writelines(lines)
                 self._state_file.truncate()
                 self._state_file.flush()
-                self._header_state = DirState.IN_MEMORY_UNMODIFIED
-                self._dirblock_state = DirState.IN_MEMORY_UNMODIFIED
+                self._mark_unmodified()
             finally:
                 if grabbed_write_lock:
                     self._lock_token = self._lock_token.restore_read_lock()
@@ -2172,6 +2272,26 @@
                     #       not changed contents. Since restore_read_lock may
                     #       not be an atomic operation.
 
+    def _worth_saving(self):
+        """Is it worth saving the dirstate or not?"""
+        # Header changes are probably important enough to always save
+        if self._header_state == DirState.IN_MEMORY_MODIFIED:
+            return True
+        if (self._dirblock_state == DirState.IN_MEMORY_MODIFIED and
+            self._worth_saving_limit != -1):
+            # If we're using smart saving and only a small number of
+            # entries have changed, don't bother saving. John has
+            # suggested using a heuristic here based on the size of the
+            # changed files and/or tree. For now, we go with a configurable
+            # number of changes, keeping the calculation time
+            # as low overhead as possible. (This also keeps all existing
+            # tests passing as the default is 0, i.e. always save.)
+            if self._use_smart_saving:
+                return len(self._known_changes) > self._worth_saving_limit
+            else:
+                return True
+        return False
+
     def _set_data(self, parent_ids, dirblocks):
         """Set the full dirstate data in memory.
 
@@ -2185,8 +2305,7 @@
         """
         # our memory copy is now authoritative.
         self._dirblocks = dirblocks
-        self._header_state = DirState.IN_MEMORY_MODIFIED
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified(header_too=True)
         self._parents = list(parent_ids)
         self._id_index = None
         self._packed_stat_index = None
@@ -2212,7 +2331,7 @@
         self._make_absent(entry)
         self.update_minimal(('', '', new_id), 'd',
             path_utf8='', packed_stat=entry[1][0][4])
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified()
         if self._id_index is not None:
             self._id_index.setdefault(new_id, set()).add(entry[0])
 
@@ -2352,8 +2471,7 @@
         self._entries_to_current_state(new_entries)
         self._parents = [rev_id for rev_id, tree in trees]
         self._ghosts = list(ghosts)
-        self._header_state = DirState.IN_MEMORY_MODIFIED
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified(header_too=True)
         self._id_index = id_index
 
     def _sort_entries(self, entry_list):
@@ -2471,7 +2589,7 @@
                 # without seeing it in the new list.  so it must be gone.
                 self._make_absent(current_old)
                 current_old = advance(old_iterator)
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified()
         self._id_index = None
         self._packed_stat_index = None
 
@@ -2524,7 +2642,7 @@
             if update_tree_details[0][0] == 'a': # absent
                 raise AssertionError('bad row %r' % (update_tree_details,))
             update_tree_details[0] = DirState.NULL_PARENT_DETAILS
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified()
         return last_reference
 
     def update_minimal(self, key, minikind, executable=False, fingerprint='',
@@ -2650,7 +2768,7 @@
             if not present:
                 self._dirblocks.insert(block_index, (subdir_key[0], []))
 
-        self._dirblock_state = DirState.IN_MEMORY_MODIFIED
+        self._mark_modified()
 
     def _validate(self):
         """Check that invariants on the dirblock are correct.
@@ -2936,7 +3054,7 @@
         else:
             entry[1][0] = ('l', '', stat_value.st_size,
                            False, DirState.NULLSTAT)
-    state._dirblock_state = DirState.IN_MEMORY_MODIFIED
+    state._mark_modified([entry])
     return link_or_sha1
 update_entry = py_update_entry
 
 
=== modified file 'bzrlib/workingtree_4.py'
--- bzrlib/workingtree_4.py	2009-06-11 04:23:53 +0000
+++ bzrlib/workingtree_4.py	2009-06-16 02:37:03 +0000
@@ -248,7 +248,7 @@
         local_path = self.bzrdir.get_workingtree_transport(None
             ).local_abspath('dirstate')
         self._dirstate = dirstate.DirState.on_file(local_path,
-            self._sha1_provider())
+            self._sha1_provider(), self._worth_saving_limit())
         return self._dirstate
 
     def _sha1_provider(self):
@@ -263,6 +263,15 @@
         else:
             return None
 
+    def _worth_saving_limit(self):
+        """How many changes are ok before we must save the dirstate.
+
+        :return: an integer. -1 means never save.
+        """
+        # XXX: In the future, we could return -1 for logical read-only
+        # operations like status. For now, just use a small number.
+        return 10
+
     def filter_unversioned_files(self, paths):
         """Filter out paths that are versioned.
 
@@ -863,7 +872,7 @@
                 rollback_rename()
                 raise
             result.append((from_rel, to_rel))
-            state._dirblock_state = dirstate.DirState.IN_MEMORY_MODIFIED
+            state._mark_modified()
             self._make_dirty(reset_inventory=False)
 
         return result