notes.c: rearrange xcalloc arguments
xcalloc() takes two arguments: the number of elements and their size. notes.c includes several calls to xcalloc() that pass the arguments in reverse order. Rearrange them so they are in the correct order. Signed-off-by: Brian Gesiak <modocache@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Brian Gesiak committed
May 27, 2014 at 00:33 UTC
65bbf082c27bcc4544511b642fb311e5f3c21722
1 file changed
+3
-3
notes.c
+3
-3
@@ -303,7 +303,7 @@ static int note_tree_insert(struct notes_tree *t, struct int_node *tree,
303
free(entry);
304
return 0;
305
}
306
- new_node = (struct int_node *) xcalloc(sizeof(struct int_node), 1);
306
+ new_node = (struct int_node *) xcalloc(1, sizeof(struct int_node));
307
ret = note_tree_insert(t, new_node, n + 1, l, GET_PTR_TYPE(*p),
308
combine_notes);
309
if (ret)
@@ -443,7 +443,7 @@ static void load_subtree(struct notes_tree *t, struct leaf_node *subtree,
443
if (len <= 20) {
444
type = PTR_TYPE_NOTE;
445
l = (struct leaf_node *)
446
- xcalloc(sizeof(struct leaf_node), 1);
446
+ xcalloc(1, sizeof(struct leaf_node));
447
hashcpy(l->key_sha1, object_sha1);
448
hashcpy(l->val_sha1, entry.sha1);
449
if (len < 20) {
@@ -1003,7 +1003,7 @@ void init_notes(struct notes_tree *t, const char *notes_ref,
1003
if (!combine_notes)
1004
combine_notes = combine_notes_concatenate;
1005
1006
- t->root = (struct int_node *) xcalloc(sizeof(struct int_node), 1);
1006
+ t->root = (struct int_node *) xcalloc(1, sizeof(struct int_node));
1007
t->first_non_note = NULL;
1008
t->prev_non_note = NULL;
1009
t->ref = notes_ref ? xstrdup(notes_ref) : NULL;