Re: Re: full kernel history, in patchset format

2005-04-16 Thread Petr Baudis
Dear diary, on Sat, Apr 16, 2005 at 09:23:40PM CEST, I got a letter
where Thomas Gleixner [EMAIL PROTECTED] told me that...
 One remark on the tree blob storage format. 
 The binary storage of the sha1sum of the refered object is a PITA for
 scripting. 
 Converting the ASCII - binary for the sha1sum comparision should not
 take much longer than the binary - ASCII conversion for the file
 reference. Can this be changed ?

Huh, you aren't supposed to peek into trees directly. What's wrong with
ls-tree?

-- 
Petr Pasky Baudis
Stuff: http://pasky.or.cz/
C++: an octopus made by nailing extra legs onto a dog. -- Steve Taylor
-
To unsubscribe from this list: send the line unsubscribe git in
the body of a message to [EMAIL PROTECTED]
More majordomo info at  http://vger.kernel.org/majordomo-info.html


Re: Re: Re: full kernel history, in patchset format

2005-04-16 Thread Petr Baudis
Dear diary, on Sat, Apr 16, 2005 at 08:32:32PM CEST, I got a letter
where Petr Baudis [EMAIL PROTECTED] told me that...
 Dear diary, on Sat, Apr 16, 2005 at 09:23:40PM CEST, I got a letter
 where Thomas Gleixner [EMAIL PROTECTED] told me that...
  One remark on the tree blob storage format. 
  The binary storage of the sha1sum of the refered object is a PITA for
  scripting. 
  Converting the ASCII - binary for the sha1sum comparision should not
  take much longer than the binary - ASCII conversion for the file
  reference. Can this be changed ?
 
 Huh, you aren't supposed to peek into trees directly. What's wrong with
 ls-tree?

(I meant, you aren't supposed to peek into trees from scripts. Or well,
not not supposed, but it does not make much sense when you have
ls-tree.)

-- 
Petr Pasky Baudis
Stuff: http://pasky.or.cz/
C++: an octopus made by nailing extra legs onto a dog. -- Steve Taylor
-
To unsubscribe from this list: send the line unsubscribe git in
the body of a message to [EMAIL PROTECTED]
More majordomo info at  http://vger.kernel.org/majordomo-info.html


Re: Re: full kernel history, in patchset format

2005-04-16 Thread Thomas Gleixner
On Sat, 2005-04-16 at 20:32 +0200, Petr Baudis wrote:
 Dear diary, on Sat, Apr 16, 2005 at 09:23:40PM CEST, I got a letter
 where Thomas Gleixner [EMAIL PROTECTED] told me that...
  One remark on the tree blob storage format. 
  The binary storage of the sha1sum of the refered object is a PITA for
  scripting. 
  Converting the ASCII - binary for the sha1sum comparision should not
  take much longer than the binary - ASCII conversion for the file
  reference. Can this be changed ?
 
 Huh, you aren't supposed to peek into trees directly. What's wrong with
 ls-tree?

Why I'm not supposed ? Is this evil ?

My export script has all the data available, so I write the tree refs
directly. The full export runs ~1 hour. Thats long enough :) I tried the
git way and it slows me down by factor BIG (I dont remember the
number)

Also for reference tracking all the information might be available e.g.
by a database. Why should the revtool then use some tool to retrieve
information which is already there ?

tglx


-
To unsubscribe from this list: send the line unsubscribe git in
the body of a message to [EMAIL PROTECTED]
More majordomo info at  http://vger.kernel.org/majordomo-info.html


Re: Re: full kernel history, in patchset format

2005-04-16 Thread Christopher Li
On Sat, Apr 16, 2005 at 07:43:27PM +0200, Petr Baudis wrote:
 Dear diary, on Sat, Apr 16, 2005 at 07:04:31PM CEST, I got a letter
 where Linus Torvalds [EMAIL PROTECTED] told me that...
  So I'd _almost_ suggest just starting from a clean slate after all.  
  Keeping the old history around, of course, but not necessarily putting it
  into git now. It would just force everybody who is getting used to git in 
  the first place to work with a 3GB archive from day one, rather than 
  getting into it a bit more gradually.
  
  Comments?
 
 FWIW, it looks pretty reasonable to me. Perhaps we should have a
 separate GIT repository with the previous history though, and in the
 first new commit the parent could point to the last commit from the
 other repository.
 
 Just if it isn't too much work, though. :-)

I think we can make the git using stackable repository. When it fail
to find an object, it will try it's to read from parent repository.
It is useful to slice the history.

I can have local repository that all the new object create by me will
store in my tree instead of the official one. Clean up the object in the
my local tree will be much easier it only need to work on a much smaller
repository. If all my change is merge to official tree, I just simply
empty my local repository.

About the kernel git repository. I think it is much easier just put
them in one tree.  So I don't need to worry about if I need to see
pre 2.6.12, I need to do this. And the full repository  need to
store in the server some where any way.

However I totally agree that people should not deal with unnecessary the history
when they start using the git tools. We should just make the tools
by default don't download all the histories. Only get it when user specific 
ask for it.

Why 2.6.12-rc2? When kernel grows to 2.6.15, a new user might not even need
pre 2.6.13 most of the time. If we make it very easier for people to get
history if they need, it will make them less motivate to store unnecessary
history locally (just in case I need it).

I think we should not advise using rsync to sync the whole git tree as
way to get update. We need to get use to only have a slice of the history
and get more if we needed.
The server should should provide some small metadata file like the
the rev-tool cache, so the SCM tools can download it to figure out what file
is needed to download to get to certain revision. Instead of download the
whole repository to figure out what is new.

We can even slice that metadata information to smaller pieces base on major 
release point.

Chris
 
-
To unsubscribe from this list: send the line unsubscribe git in
the body of a message to [EMAIL PROTECTED]
More majordomo info at  http://vger.kernel.org/majordomo-info.html