Re: [PATCH 37/38] pack v4: introduce "escape hatches" in the name and path indexes

2013-09-05 Thread Duy Nguyen
On Fri, Sep 6, 2013 at 2:02 AM, Nicolas Pitre wrote: > I think that we've found a way to better support thin packs. > > You said: > >> What if the sender prepares the sha-1 table to contain missing objects >> in advance? The sender should know what base objects are missing. Then >> we only need to

Re: [PATCH 37/38] pack v4: introduce "escape hatches" in the name and path indexes

2013-09-05 Thread Nicolas Pitre
On Thu, 5 Sep 2013, Nicolas Pitre wrote: > On Thu, 5 Sep 2013, Nicolas Pitre wrote: > > > If the path or name index is zero, this means the entry data is to be > > found inline rather than being located in the dictionary table. This is > > there to allow easy completion of thin packs without havi

Re: [PATCH 37/38] pack v4: introduce "escape hatches" in the name and path indexes

2013-09-05 Thread Nicolas Pitre
On Thu, 5 Sep 2013, Nicolas Pitre wrote: > If the path or name index is zero, this means the entry data is to be > found inline rather than being located in the dictionary table. This is > there to allow easy completion of thin packs without having to add new > table entries which would have requi

[PATCH 37/38] pack v4: introduce "escape hatches" in the name and path indexes

2013-09-04 Thread Nicolas Pitre
If the path or name index is zero, this means the entry data is to be found inline rather than being located in the dictionary table. This is there to allow easy completion of thin packs without having to add new table entries which would have required a full rewrite of the pack data. Signed-off-b