2 #include "string-list.h"
5 #define DEBUG_MAILMAP 0
7 #define debug_mm(...) fprintf(stderr, __VA_ARGS__)
9 static inline void debug_mm(const char *format, ...) {}
12 const char *git_mailmap_file;
13 const char *git_mailmap_blob;
20 struct mailmap_entry {
21 /* name and email for the simple mail-only case */
25 /* name and email for the complex mail and name matching case */
26 struct string_list namemap;
29 static void free_mailmap_info(void *p, const char *s)
31 struct mailmap_info *mi = (struct mailmap_info *)p;
32 debug_mm("mailmap: -- complex: '%s' -> '%s' <%s>\n", s, mi->name, mi->email);
37 static void free_mailmap_entry(void *p, const char *s)
39 struct mailmap_entry *me = (struct mailmap_entry *)p;
40 debug_mm("mailmap: removing entries for <%s>, with %d sub-entries\n", s, me->namemap.nr);
41 debug_mm("mailmap: - simple: '%s' <%s>\n", me->name, me->email);
45 me->namemap.strdup_strings = 1;
46 string_list_clear_func(&me->namemap, free_mailmap_info);
49 static void add_mapping(struct string_list *map,
50 char *new_name, char *new_email, char *old_name, char *old_email)
52 struct mailmap_entry *me;
55 if (old_email == NULL) {
56 old_email = new_email;
60 if ((index = string_list_find_insert_index(map, old_email, 1)) < 0) {
61 /* mailmap entry exists, invert index value */
63 me = (struct mailmap_entry *)map->items[index].util;
65 /* create mailmap entry */
66 struct string_list_item *item;
68 item = string_list_insert_at_index(map, index, old_email);
69 me = xcalloc(1, sizeof(struct mailmap_entry));
70 me->namemap.strdup_strings = 1;
71 me->namemap.cmp = strcasecmp;
75 if (old_name == NULL) {
76 debug_mm("mailmap: adding (simple) entry for %s at index %d\n", old_email, index);
77 /* Replace current name and new email for simple entry */
80 me->name = xstrdup(new_name);
84 me->email = xstrdup(new_email);
87 struct mailmap_info *mi = xcalloc(1, sizeof(struct mailmap_info));
88 debug_mm("mailmap: adding (complex) entry for %s at index %d\n", old_email, index);
90 mi->name = xstrdup(new_name);
92 mi->email = xstrdup(new_email);
93 string_list_insert(&me->namemap, old_name)->util = mi;
96 debug_mm("mailmap: '%s' <%s> -> '%s' <%s>\n",
97 old_name, old_email, new_name, new_email);
100 static char *parse_name_and_email(char *buffer, char **name,
101 char **email, int allow_empty_email)
103 char *left, *right, *nstart, *nend;
104 *name = *email = NULL;
106 if ((left = strchr(buffer, '<')) == NULL)
108 if ((right = strchr(left+1, '>')) == NULL)
110 if (!allow_empty_email && (left+1 == right))
113 /* remove whitespace from beginning and end of name */
115 while (isspace(*nstart) && nstart < left)
118 while (nend > nstart && isspace(*nend))
121 *name = (nstart <= nend ? nstart : NULL);
126 return (*right == '\0' ? NULL : right);
129 static void read_mailmap_line(struct string_list *map, char *buffer,
132 char *name1 = NULL, *email1 = NULL, *name2 = NULL, *email2 = NULL;
133 if (buffer[0] == '#') {
134 static const char abbrev[] = "# repo-abbrev:";
135 int abblen = sizeof(abbrev) - 1;
136 int len = strlen(buffer);
141 if (len && buffer[len - 1] == '\n')
143 if (!strncmp(buffer, abbrev, abblen)) {
148 *repo_abbrev = xmalloc(len);
150 for (cp = buffer + abblen; isspace(*cp); cp++)
152 strcpy(*repo_abbrev, cp);
156 if ((name2 = parse_name_and_email(buffer, &name1, &email1, 0)) != NULL)
157 parse_name_and_email(name2, &name2, &email2, 1);
160 add_mapping(map, name1, email1, name2, email2);
163 static int read_mailmap_file(struct string_list *map, const char *filename,
172 f = fopen(filename, "r");
176 return error("unable to open mailmap at %s: %s",
177 filename, strerror(errno));
180 while (fgets(buffer, sizeof(buffer), f) != NULL)
181 read_mailmap_line(map, buffer, repo_abbrev);
186 static void read_mailmap_buf(struct string_list *map,
187 const char *buf, unsigned long len,
191 const char *end = strchrnul(buf, '\n');
192 unsigned long linelen = end - buf + 1;
193 char *line = xmemdupz(buf, linelen);
195 read_mailmap_line(map, line, repo_abbrev);
203 static int read_mailmap_blob(struct string_list *map,
207 unsigned char sha1[20];
210 enum object_type type;
214 if (get_sha1(name, sha1) < 0)
217 buf = read_sha1_file(sha1, &type, &size);
219 return error("unable to read mailmap object at %s", name);
220 if (type != OBJ_BLOB)
221 return error("mailmap is not a blob: %s", name);
223 read_mailmap_buf(map, buf, size, repo_abbrev);
229 int read_mailmap(struct string_list *map, char **repo_abbrev)
233 map->strdup_strings = 1;
234 map->cmp = strcasecmp;
236 if (!git_mailmap_blob && is_bare_repository())
237 git_mailmap_blob = "HEAD:.mailmap";
239 err |= read_mailmap_file(map, ".mailmap", repo_abbrev);
240 err |= read_mailmap_blob(map, git_mailmap_blob, repo_abbrev);
241 err |= read_mailmap_file(map, git_mailmap_file, repo_abbrev);
245 void clear_mailmap(struct string_list *map)
247 debug_mm("mailmap: clearing %d entries...\n", map->nr);
248 map->strdup_strings = 1;
249 string_list_clear_func(map, free_mailmap_entry);
250 debug_mm("mailmap: cleared\n");
254 * Look for an entry in map that match string[0:len]; string[len]
255 * does not have to be NUL (but it could be).
257 static struct string_list_item *lookup_prefix(struct string_list *map,
258 const char *string, size_t len)
260 int i = string_list_find_insert_index(map, string, 1);
265 return &map->items[i];
267 * that map entry matches exactly to the string, including
268 * the cruft at the end beyond "len". That is not a match
269 * with string[0:len] that we are looking for.
271 } else if (!string[len]) {
273 * asked with the whole string, and got nothing. No
274 * matching entry can exist in the map.
280 * i is at the exact match to an overlong key, or location the
281 * overlong key would be inserted, which must come after the
282 * real location of the key if one exists.
284 while (0 <= --i && i < map->nr) {
285 int cmp = strncasecmp(map->items[i].string, string, len);
288 * "i" points at a key definitely below the prefix;
289 * the map does not have string[0:len] in it.
292 else if (!cmp && !map->items[i].string[len])
294 return &map->items[i];
296 * otherwise, the string at "i" may be string[0:len]
297 * followed by a string that sorts later than string[len:];
304 int map_user(struct string_list *map,
305 const char **email, size_t *emaillen,
306 const char **name, size_t *namelen)
308 struct string_list_item *item;
309 struct mailmap_entry *me;
311 debug_mm("map_user: map '%.*s' <%.*s>\n",
312 *namelen, *name, *emaillen, *email);
314 item = lookup_prefix(map, *email, *emaillen);
316 me = (struct mailmap_entry *)item->util;
317 if (me->namemap.nr) {
318 /* The item has multiple items, so we'll look up on name too */
319 /* If the name is not found, we choose the simple entry */
320 struct string_list_item *subitem;
321 subitem = lookup_prefix(&me->namemap, *name, *namelen);
327 struct mailmap_info *mi = (struct mailmap_info *)item->util;
328 if (mi->name == NULL && mi->email == NULL) {
329 debug_mm("map_user: -- (no simple mapping)\n");
334 *emaillen = strlen(*email);
338 *namelen = strlen(*name);
340 debug_mm("map_user: to '%.*s' <%.*s>\n", *namelen, *name,
344 debug_mm("map_user: --\n");