== Work done in the previous 14 weeks ==
- Definition of a tentative index file v5 format . This differs
from the proposal in making it possible to bisect the directory
entries and file entries, to do a binary search. The exact bits
for each section were also defined. To further compress the index,
along with prefix compression, the stat data is hashed, since
it's only used for equality comparison, but the plain data is
Thanks to Michael Haggerty, Nguyen Thai Ngoc Duy, Thomas Rast
and Robin Rosenberg for feedback.
- Prototype of a converter from the index format v2/v3 to the index
format v5.  The converter reads the index from a git repository,
can output parts of the index (header, index entries as in
git ls-files --debug, cache tree as in test-dump-cache-tree, or
the reuc data). Then it writes the v5 index file format to
.git/index-v5. Thanks to Michael Haggerty for the code review.
- Prototype of a reader for the new index file format.  The
reader has mainly the purpose to show the algorithm used to read
the index lexicographically sorted after the full name which is
required by the current internal memory format. Big thanks for
reviewing this code and giving me advice on refactoring goes
to Michael Haggerty.
- Read the on-disk index file format and translate it to the current
in memory format. This doesn't include reading any of the current
extensions, which are now part of the main index. The code again
is on github.  Thanks for reviewing the first steps to Thomas
- Read the cache-tree data (formerly an extension, now it's integrated
with the rest of the directory data) from the new ondisk format.
There are still a few optimizations to do in this algorithm.
- Started implementing the API (suggested by Duy), but it's still
in the very early stages. There is one commit for this on GitHub ,
but it's a very early work in progress.
- Started implementing the writer, which extracts the directories from
the in-memory format, and writes the header and the directories to
disk. The algorithm uses a hash-table instead of a simple list,
to avoid many corner cases.
- Implemented writing the file block to disk, and basic tests from the
test suite are running fine, not including tests that require
conflicted data or the cache-tree to work, which both are not
- Started implementing a patch to introduce a ce_namelen field in
struct cache_entry and drop the name length from the flags. 
Thanks to Junio, Duy and Thomas for reviews and suggestions for
- Implemented the cache-tree and conflict data writing to the
- Implemented the rest of the index-v5 code, so that it passes the
- Added a hack for partial loading of index-v5 for git ls-files and
git grep. For performance results of this hack see: 
== Work done in the last week ==
- Lots of refactoring of the index-v5 code
- Some slight optimizations of the code
- Brought the python reader up to date, and added the possibility to
update a single index entry, to test the re-reading code when updating
single index entry. (The updating of a single index entry is not
implemented in C yet)
- Make the reader re-read a single index entry, if the crc code is wrong.
- Implement the new racy code for git, along the lines of what Thomas
posted at . The code also addresses the concerns of Johannes and
Junio, by using the timestamp of the index, that is already written
instead of the time of the index file that will be written. The checking
if the index entry really changed will be left to the reader. If anyone
is interested in the code it's at .
== Outlook for the next week ==
- Fix some minor nits in the code, which are still remaining.
- Bring the history to release format, and send the patches to the list.
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html