summaryrefslogtreecommitdiff
path: root/decorate.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@linux-foundation.org>2007-04-20 18:30:06 -0700
committerJunio C Hamano <junkio@cox.net>2007-04-20 19:16:12 -0700
commit2a1a3dce3333950d16f78caf34b3bb2ac46ab4d4 (patch)
treeecff3deffa96e5b0971e0fc0926ff97efab2acdf /decorate.c
parent2c9750cc8b902a55669183e05533207dd7ec71fd (diff)
downloadgit-2a1a3dce3333950d16f78caf34b3bb2ac46ab4d4.tar.gz
Fix a copy-n-paste bug in the object decorator code.
Duh. When I did the object decorator thing, I made the "loop over the hash" function use the same logic for updating the hash, ie made them use if (++j >= size) j = 0; for both the hash update for both "insert" and "lookup" HOWEVER. For some inexplicable reason I had an extraneous j++; in the insert path (probably just from the fact that the old code there used j++; if (j >= size) j = 0; and when I made them use the same logic I just didn't remove the old extraneous line properly. This fixes it. Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org> Signed-off-by: Junio C Hamano <junkio@cox.net>
Diffstat (limited to 'decorate.c')
-rw-r--r--decorate.c1
1 files changed, 0 insertions, 1 deletions
diff --git a/decorate.c b/decorate.c
index 396b41311a..23f6b0040f 100644
--- a/decorate.c
+++ b/decorate.c
@@ -24,7 +24,6 @@ static void *insert_decoration(struct decoration *n, struct object *base, void *
hash[j].decoration = decoration;
return old;
}
- j++;
if (++j >= size)
j = 0;
}