2 * GIT - The information manager from hell
4 * Copyright (C) Linus Torvalds, 2005
11 #define BLOCKING (1ul << 14)
14 * FIXME! Share the code with "write-tree.c"
16 static void init_buffer(char **bufp
, unsigned int *sizep
)
18 char *buf
= xmalloc(BLOCKING
);
23 static void add_buffer(char **bufp
, unsigned int *sizep
, const char *fmt
, ...)
28 unsigned long alloc
, size
, newsize
;
32 len
= vsnprintf(one_line
, sizeof(one_line
), fmt
, args
);
36 alloc
= (size
+ 32767) & ~32767;
38 if (newsize
> alloc
) {
39 alloc
= (newsize
+ 32767) & ~32767;
40 buf
= xrealloc(buf
, alloc
);
44 memcpy(buf
+ size
, one_line
, len
);
47 static void check_valid(unsigned char *sha1
, const char *expect
)
51 if (sha1_object_info(sha1
, type
, NULL
))
52 die("%s is not a valid object", sha1_to_hex(sha1
));
53 if (expect
&& strcmp(type
, expect
))
54 die("%s is not a valid '%s' object", sha1_to_hex(sha1
),
59 * Having more than two parents is not strange at all, and this is
60 * how multi-way merges are represented.
62 #define MAXPARENT (16)
63 static unsigned char parent_sha1
[MAXPARENT
][20];
65 static const char commit_tree_usage
[] = "git-commit-tree <sha1> [-p <sha1>]* < changelog";
67 static int new_parent(int idx
)
70 unsigned char *sha1
= parent_sha1
[idx
];
71 for (i
= 0; i
< idx
; i
++) {
72 if (!memcmp(parent_sha1
[i
], sha1
, 20)) {
73 error("duplicate parent %s ignored", sha1_to_hex(sha1
));
80 int cmd_commit_tree(int argc
, const char **argv
, const char *prefix
)
84 unsigned char tree_sha1
[20];
85 unsigned char commit_sha1
[20];
91 git_config(git_default_config
);
94 usage(commit_tree_usage
);
95 if (get_sha1(argv
[1], tree_sha1
))
96 die("Not a valid object name %s", argv
[1]);
98 check_valid(tree_sha1
, tree_type
);
99 for (i
= 2; i
< argc
; i
+= 2) {
101 a
= argv
[i
]; b
= argv
[i
+1];
102 if (!b
|| strcmp(a
, "-p"))
103 usage(commit_tree_usage
);
104 if (get_sha1(b
, parent_sha1
[parents
]))
105 die("Not a valid object name %s", b
);
106 check_valid(parent_sha1
[parents
], commit_type
);
107 if (new_parent(parents
))
111 fprintf(stderr
, "Committing initial tree %s\n", argv
[1]);
113 init_buffer(&buffer
, &size
);
114 add_buffer(&buffer
, &size
, "tree %s\n", sha1_to_hex(tree_sha1
));
117 * NOTE! This ordering means that the same exact tree merged with a
118 * different order of parents will be a _different_ changeset even
119 * if everything else stays the same.
121 for (i
= 0; i
< parents
; i
++)
122 add_buffer(&buffer
, &size
, "parent %s\n", sha1_to_hex(parent_sha1
[i
]));
124 /* Person/date information */
125 add_buffer(&buffer
, &size
, "author %s\n", git_author_info(1));
126 add_buffer(&buffer
, &size
, "committer %s\n\n", git_committer_info(1));
128 /* And add the comment */
129 while (fgets(comment
, sizeof(comment
), stdin
) != NULL
)
130 add_buffer(&buffer
, &size
, "%s", comment
);
132 if (!write_sha1_file(buffer
, size
, commit_type
, commit_sha1
)) {
133 printf("%s\n", sha1_to_hex(commit_sha1
));