Thanks Junio for reading the progress report, this is just
corrected version without the errors that he pointed out.
== Work done in the previous 12 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. 
== Work done int the last week ==
- Polished the patch for the ce_namelen field. The thread for the
patch can be found at . Again thanks to Junio, Duy and Thomas
for reviewing it and giving me suggestions for improving it.
- Implemented the cache-tree and conflict data writing to the
== Outlook for the next week ==
- There are still a few bugs in the conflict writing, which will
be fixed, to make the test suite pass with index-v5.
- Once the test suite passes, the code still needs to be refactored
- If the two points above go well, I'll continue working on the api
that Duy suggested.
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