git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Re: Understanding version 4 packs

From
MCMarco Costalba <mcostalba@gmail.com>
Date
Mar 26, 2007, 17:10 UTC
Message-ID
<e5bfff550703261010u67aa1207j1c6f0200bb7744a@mail.gmail.com>
In-Reply-To
<alpine.LFD.0.83.0703261015110.3041@xanadu.home>
On 3/26/07, Nicolas Pitre <nico@cam.org> wrote:
Show 29 quoted lines
> On Mon, 26 Mar 2007, Marco Costalba wrote:
>
> > Experimenting with file names cache in qgit I have found a big saving
> > splitting the paths in base name and file name and indexing both:
> >
> > drivers\usb\host\ehci.h
> > drivers\usb\host\ehci-pci.c
> > drivers\usb\host\ohci-pci.c
> > kernel\sched.c
> >
> > became:
> >
> > dir names table
> >
> > 0 drivers\usb\host
> > 1 kernel
> >
> >
> > file name table
> >
> > 0 ehci.h
> > 1 ehci-pci.c
> > 2 ohci-pci.c
> >
> > In this way a big saving is achieved in case of directories deep in
> > the tree (long paths) and a lot of files.
>
> Sure, but if you also consider drivers/usb/Makefile and drivers/Kconfig
> for example then you start losing on space saving.
In your example you'd have:

drivers/usb/Makefile drivers/Kconfig

became

dir names table 0 drivers 1 drivers/usb

file name table 0 Makefile 1 Kconfig

I fail to see wher's the losing on space saving. More, you probably have many paths both under 'drivers' and 'drivers/usb' and for each added path it would be possible to avoid to store the prefix ('driver' or 'driver/usb').

To better clarify, OBJ_DICT_TREE data *currently* looks like:
+------------+-------+-------+-------+-------+----
| NR_ENTRIES | name1 | hash1 | name2 | hash2 | ...
+------------+-------+-------+-------+-------+----
  vint        2 bytes 4 bytes 2 bytes 4 bytes
where name1 is an index into the packfile's sole EXTOBJ_FILENAME_TABLE.
The possible improve is to define OBJ_DICT_TREE like
+------------+-------+-------+-------+-------+----
| NR_ENTRIES | dir1   | fiile1 | hash1| dir 2| fiile2|...
+------------+-------+-------+-------+-------+----
  vint        2 bytes 2 bytes 2 bytes 4 bytes

where dir1 is an index into a new EXTOBJ_DIRNAME_TABLE and file1 is an index in a new EXTOBJ_FILENAME_TABLE.

EXTOBJ_FILENAME_TABLE is defined as the currently (but much smaller in size!!) and keeps only the file names, not the full paths, while EXTOBJ_DIRNAME_TABLE is defined as EXTOBJ_FILENAME_TABLE but without MODE field (associated to files only) and is used to store the dir names.

Decopuling dir names from file names could improve saving space because the length of proposed EXTOBJ_FILENAME_TABLE + EXTOBJ_DIRNAME_TABLE < current EXTOBJ_FILENAME_TABLE.

  Marco

P.S: Of course now you'd save 2+2 bytes in OBJ_DICT_TREE instead of 2 for 'name' index. To avoid this and keep the idea of decopuling dir and file names an still use 2 bytes in OBJ_DICT_TREE a possible layout of EXTOBJ_FILENAME_TABLE could be:

 +------------+------+-------+-----------------+---
-+----------------+-------+------+----------+
 | NR_ENTRIES | dirA  |  file name1 | ofs1| file name2 | ofs 2|dirB
|file name3 | ofs3 | ....
 +------------+------+-------+-----------------+----
+---------------+--------+------+----------+

Where ofs1 and ofs2 are 2-bytes values pointing to dirA, ofs3 points to dirB and so on.

Where the tree layout of the above example is:

dirA \ file name1 dirA \ file name2 dirB \ file name3

With this approach you have both the saving in case of directories with many files and still 2 bytes per 'name' index in OBJ_DICT_TREE (that points to 'file name' field). This approach saves space as soon as directory names are longer then 2 chars.

Previous: Nicolas PitreNext: Nicolas Pitre
Message 13 of 19 in “Understanding version 4 packs”
  1. Peter EriksenMar 24, 2007
  2. Nicolas PitreMar 24, 2007
  3. Peter EriksenMar 25, 2007
  4. Shawn O. PearceMar 25, 2007
  5. Linus TorvaldsMar 25, 2007
  6. Shawn O. PearceMar 25, 2007
  7. Nicolas PitreMar 26, 2007
  8. Shawn O. PearceMar 26, 2007
  9. Jakub NarebskiMar 26, 2007
  10. Nicolas PitreMar 26, 2007
  11. Marco CostalbaMar 26, 2007
  12. Nicolas PitreMar 26, 2007
  13. Marco CostalbaMar 26, 2007
  14. Nicolas PitreMar 26, 2007
  15. Nicolas PitreMar 26, 2007
  16. Marco CostalbaMar 27, 2007
  17. Shawn O. PearceMar 27, 2007
  18. Shawn O. PearceMar 25, 2007
  19. Shawn O. PearceMar 25, 2007

Read the whole thread, see it on lore, or plain text.

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.