> Jonathan Tan <jonathantanmy@xxxxxxxxxx> writes: > > > When rebasing against an upstream that has had many commits since the > > original branch was created: > > > > O -- O -- ... -- O -- O (upstream) > > \ > > -- O (my-dev-branch) > > > > it must read the contents of every novel upstream commit, in addition to > > the tip of the upstream and the merge base, because "git rebase" > > attempts to exclude commits that are duplicates of upstream ones. This > > can be a significant performance hit, especially in a partial clone, > > wherein a read of an object may end up being a fetch. > > OK. I presume that we do this by comparing patch IDs? Yes. > Total disabling would of course is OK as a feature, especially for > the first cut, but I wonder if it would be a reasonable idea to use > some heuristic to keep the current "filter the same change" feature > as much as possible but optimize it by filtering the novel upstream > commits without hitting their trees and blobs (I am assuming that > you at least are aware of and have the commit objects on the > upstream side). > > The most false-negative-prone approach is just to compare the > <author ident, author timestamp> of a candidate upstream commit with > what you have---if that author does not appear on my-dev-branch, it > is very unlikely that your change has been accepted upstream. Of > course, two people who independently discover the same solution is > not all that rare, so it does risk false-negative to take too little > clue from the commits to compare, but at least it is not worse than > what you are proposing here ;-) And if one of your commits on > my-dev-branch _might_ be identical to one of the novel upstream ones, > at that point, we could dig deeper to actually compute the patch ID > by fetching the upstream's tree. As far as I know, the existing patch ID behavior is only based on the patch contents, so if there was any author name or time rewriting (or if two people independently discovered the same solution, as you wrote), then the behavior would be different. Apart from that, this does sound like a cheap thing to compare before comparing the diff. Elijah Newren suggested and I investigated another approach of using a filename-only diff as a first approximation. The relevant quotations and explanations are in my email here [1]. [1] https://lore.kernel.org/git/20200312180427.192096-1-jonathantanmy@xxxxxxxxxx/ > That's all totally outside the scope of this patch. It is just a > random thought to see if anybody wants to pursue to make the topic > even better, possible after it lands. OK. > > New in V2: changed parameter name, used Taylor's commit message > > suggestions, and used Elijah's documentation suggestions. > > Hmph, what was it called earlier? My gut reaction without much > thinking finds --no-skip-* a bit confusing double-negation and > suspect "--[no-]detect-cherry-pick" (which defaults to true for > backward compatibility) may feel more natural, but I suspect (I do > not recall details of the discussion on v1) it has been already > discussed and people found --no-skip-* is OK (in which case I won't > object)? It was earlier called "--{,no-}skip-already-present" (with the opposite meaning, and thus, --skip-already-present is the default), so the double negative has always existed. "--detect-cherry-pick" might be a better idea...I'll wait to see if anybody else has an opinion. > I also wonder if --detect-cherry-pick=(yes|no|auto) may give a > better end-user experience, with "auto" meaning "do run patch-ID > based filtering, but if we know it will be expensive (e.g. the > repository is sparsely cloned), please skip it". That way, there > may appear other reasons that makes patch-ID computation expensive > now or in the fiture, and the users are automatically covered. It might be better to have predictability, and for "auto", I don't know if we can have a simple and explainable set of rules as to when to use patch-ID-based filtering - for example, in a partial clone with no blobs, I would normally want no patch-ID-based filtering, but in a partial clone with only a blob size limit, I probably will still want patch-ID-based filtering.
