2 #include "string-list.h"
5 #define DEBUG_MAILMAP 0
7 #define debug_mm(...) fprintf(stderr, __VA_ARGS__)
8 #define debug_str(X) ((X) ? (X) : "(none)")
10 static inline void debug_mm(const char *format, ...) {}
11 static inline const char *debug_str(const char *s) { return s; }
14 const char *git_mailmap_file;
15 const char *git_mailmap_blob;
22 struct mailmap_entry {
23 /* name and email for the simple mail-only case */
27 /* name and email for the complex mail and name matching case */
28 struct string_list namemap;
31 static void free_mailmap_info(void *p, const char *s)
33 struct mailmap_info *mi = (struct mailmap_info *)p;
34 debug_mm("mailmap: -- complex: '%s' -> '%s' <%s>\n",
35 s, debug_str(mi->name), debug_str(mi->email));
40 static void free_mailmap_entry(void *p, const char *s)
42 struct mailmap_entry *me = (struct mailmap_entry *)p;
43 debug_mm("mailmap: removing entries for <%s>, with %d sub-entries\n",
45 debug_mm("mailmap: - simple: '%s' <%s>\n",
46 debug_str(me->name), debug_str(me->email));
51 me->namemap.strdup_strings = 1;
52 string_list_clear_func(&me->namemap, free_mailmap_info);
56 * On some systems (e.g. MinGW 4.0), string.h has _only_ inline
57 * definition of strcasecmp and no non-inline implementation is
58 * supplied anywhere, which is, eh, "unusual"; we cannot take an
59 * address of such a function to store it in namemap.cmp. This is
60 * here as a workaround---do not assign strcasecmp directly to
61 * namemap.cmp until we know no systems that matter have such an
64 static int namemap_cmp(const char *a, const char *b)
66 return strcasecmp(a, b);
69 static void add_mapping(struct string_list *map,
70 char *new_name, char *new_email,
71 char *old_name, char *old_email)
73 struct mailmap_entry *me;
76 if (old_email == NULL) {
77 old_email = new_email;
81 if ((index = string_list_find_insert_index(map, old_email, 1)) < 0) {
82 /* mailmap entry exists, invert index value */
84 me = (struct mailmap_entry *)map->items[index].util;
86 /* create mailmap entry */
87 struct string_list_item *item;
89 item = string_list_insert_at_index(map, index, old_email);
90 me = xcalloc(1, sizeof(struct mailmap_entry));
91 me->namemap.strdup_strings = 1;
92 me->namemap.cmp = namemap_cmp;
96 if (old_name == NULL) {
97 debug_mm("mailmap: adding (simple) entry for %s at index %d\n",
99 /* Replace current name and new email for simple entry */
102 me->name = xstrdup(new_name);
106 me->email = xstrdup(new_email);
109 struct mailmap_info *mi = xcalloc(1, sizeof(struct mailmap_info));
110 debug_mm("mailmap: adding (complex) entry for %s at index %d\n",
113 mi->name = xstrdup(new_name);
115 mi->email = xstrdup(new_email);
116 string_list_insert(&me->namemap, old_name)->util = mi;
119 debug_mm("mailmap: '%s' <%s> -> '%s' <%s>\n",
120 debug_str(old_name), old_email,
121 debug_str(new_name), debug_str(new_email));
124 static char *parse_name_and_email(char *buffer, char **name,
125 char **email, int allow_empty_email)
127 char *left, *right, *nstart, *nend;
128 *name = *email = NULL;
130 if ((left = strchr(buffer, '<')) == NULL)
132 if ((right = strchr(left+1, '>')) == NULL)
134 if (!allow_empty_email && (left+1 == right))
137 /* remove whitespace from beginning and end of name */
139 while (isspace(*nstart) && nstart < left)
142 while (nend > nstart && isspace(*nend))
145 *name = (nstart <= nend ? nstart : NULL);
150 return (*right == '\0' ? NULL : right);
153 static void read_mailmap_line(struct string_list *map, char *buffer,
156 char *name1 = NULL, *email1 = NULL, *name2 = NULL, *email2 = NULL;
157 if (buffer[0] == '#') {
158 static const char abbrev[] = "# repo-abbrev:";
159 int abblen = sizeof(abbrev) - 1;
160 int len = strlen(buffer);
165 if (len && buffer[len - 1] == '\n')
167 if (!strncmp(buffer, abbrev, abblen)) {
171 *repo_abbrev = xmalloc(len);
173 for (cp = buffer + abblen; isspace(*cp); cp++)
175 strcpy(*repo_abbrev, cp);
179 if ((name2 = parse_name_and_email(buffer, &name1, &email1, 0)) != NULL)
180 parse_name_and_email(name2, &name2, &email2, 1);
183 add_mapping(map, name1, email1, name2, email2);
186 static int read_mailmap_file(struct string_list *map, const char *filename,
195 f = fopen(filename, "r");
199 return error("unable to open mailmap at %s: %s",
200 filename, strerror(errno));
203 while (fgets(buffer, sizeof(buffer), f) != NULL)
204 read_mailmap_line(map, buffer, repo_abbrev);
209 static void read_mailmap_string(struct string_list *map, char *buf,
213 char *end = strchrnul(buf, '\n');
218 read_mailmap_line(map, buf, repo_abbrev);
223 static int read_mailmap_blob(struct string_list *map,
227 unsigned char sha1[20];
230 enum object_type type;
234 if (get_sha1(name, sha1) < 0)
237 buf = read_sha1_file(sha1, &type, &size);
239 return error("unable to read mailmap object at %s", name);
240 if (type != OBJ_BLOB)
241 return error("mailmap is not a blob: %s", name);
243 read_mailmap_string(map, buf, repo_abbrev);
249 int read_mailmap(struct string_list *map, char **repo_abbrev)
253 map->strdup_strings = 1;
254 map->cmp = namemap_cmp;
256 if (!git_mailmap_blob && is_bare_repository())
257 git_mailmap_blob = "HEAD:.mailmap";
259 err |= read_mailmap_file(map, ".mailmap", repo_abbrev);
260 err |= read_mailmap_blob(map, git_mailmap_blob, repo_abbrev);
261 err |= read_mailmap_file(map, git_mailmap_file, repo_abbrev);
265 void clear_mailmap(struct string_list *map)
267 debug_mm("mailmap: clearing %d entries...\n", map->nr);
268 map->strdup_strings = 1;
269 string_list_clear_func(map, free_mailmap_entry);
270 debug_mm("mailmap: cleared\n");
274 * Look for an entry in map that match string[0:len]; string[len]
275 * does not have to be NUL (but it could be).
277 static struct string_list_item *lookup_prefix(struct string_list *map,
278 const char *string, size_t len)
280 int i = string_list_find_insert_index(map, string, 1);
285 return &map->items[i];
287 * that map entry matches exactly to the string, including
288 * the cruft at the end beyond "len". That is not a match
289 * with string[0:len] that we are looking for.
291 } else if (!string[len]) {
293 * asked with the whole string, and got nothing. No
294 * matching entry can exist in the map.
300 * i is at the exact match to an overlong key, or location the
301 * overlong key would be inserted, which must come after the
302 * real location of the key if one exists.
304 while (0 <= --i && i < map->nr) {
305 int cmp = strncasecmp(map->items[i].string, string, len);
308 * "i" points at a key definitely below the prefix;
309 * the map does not have string[0:len] in it.
312 else if (!cmp && !map->items[i].string[len])
314 return &map->items[i];
316 * otherwise, the string at "i" may be string[0:len]
317 * followed by a string that sorts later than string[len:];
324 int map_user(struct string_list *map,
325 const char **email, size_t *emaillen,
326 const char **name, size_t *namelen)
328 struct string_list_item *item;
329 struct mailmap_entry *me;
331 debug_mm("map_user: map '%.*s' <%.*s>\n",
332 (int)*namelen, debug_str(*name),
333 (int)*emaillen, debug_str(*email));
335 item = lookup_prefix(map, *email, *emaillen);
337 me = (struct mailmap_entry *)item->util;
338 if (me->namemap.nr) {
340 * The item has multiple items, so we'll look up on
341 * name too. If the name is not found, we choose the
344 struct string_list_item *subitem;
345 subitem = lookup_prefix(&me->namemap, *name, *namelen);
351 struct mailmap_info *mi = (struct mailmap_info *)item->util;
352 if (mi->name == NULL && mi->email == NULL) {
353 debug_mm("map_user: -- (no simple mapping)\n");
358 *emaillen = strlen(*email);
362 *namelen = strlen(*name);
364 debug_mm("map_user: to '%.*s' <%.*s>\n",
365 (int)*namelen, debug_str(*name),
366 (int)*emaillen, debug_str(*email));
369 debug_mm("map_user: --\n");