2 #include "string-list.h"
4 #include "object-store.h"
6 #define DEBUG_MAILMAP 0
8 #define debug_mm(...) fprintf(stderr, __VA_ARGS__)
9 #define debug_str(X) ((X) ? (X) : "(none)")
11 static inline void debug_mm(const char *format, ...) {}
12 static inline const char *debug_str(const char *s) { return s; }
15 const char *git_mailmap_file;
16 const char *git_mailmap_blob;
23 struct mailmap_entry {
24 /* name and email for the simple mail-only case */
28 /* name and email for the complex mail and name matching case */
29 struct string_list namemap;
32 static void free_mailmap_info(void *p, const char *s)
34 struct mailmap_info *mi = (struct mailmap_info *)p;
35 debug_mm("mailmap: -- complex: '%s' -> '%s' <%s>\n",
36 s, debug_str(mi->name), debug_str(mi->email));
41 static void free_mailmap_entry(void *p, const char *s)
43 struct mailmap_entry *me = (struct mailmap_entry *)p;
44 debug_mm("mailmap: removing entries for <%s>, with %d sub-entries\n",
46 debug_mm("mailmap: - simple: '%s' <%s>\n",
47 debug_str(me->name), debug_str(me->email));
52 me->namemap.strdup_strings = 1;
53 string_list_clear_func(&me->namemap, free_mailmap_info);
57 * On some systems (e.g. MinGW 4.0), string.h has _only_ inline
58 * definition of strcasecmp and no non-inline implementation is
59 * supplied anywhere, which is, eh, "unusual"; we cannot take an
60 * address of such a function to store it in namemap.cmp. This is
61 * here as a workaround---do not assign strcasecmp directly to
62 * namemap.cmp until we know no systems that matter have such an
65 static int namemap_cmp(const char *a, const char *b)
67 return strcasecmp(a, b);
70 static void add_mapping(struct string_list *map,
71 char *new_name, char *new_email,
72 char *old_name, char *old_email)
74 struct mailmap_entry *me;
75 struct string_list_item *item;
77 if (old_email == NULL) {
78 old_email = new_email;
82 item = string_list_insert(map, old_email);
84 me = (struct mailmap_entry *)item->util;
87 me->namemap.strdup_strings = 1;
88 me->namemap.cmp = namemap_cmp;
92 if (old_name == NULL) {
93 debug_mm("mailmap: adding (simple) entry for '%s'\n", old_email);
95 /* Replace current name and new email for simple entry */
98 me->name = xstrdup(new_name);
102 me->email = xstrdup(new_email);
105 struct mailmap_info *mi = xcalloc(1, sizeof(struct mailmap_info));
106 debug_mm("mailmap: adding (complex) entry for '%s'\n", old_email);
107 mi->name = xstrdup_or_null(new_name);
108 mi->email = xstrdup_or_null(new_email);
109 string_list_insert(&me->namemap, old_name)->util = mi;
112 debug_mm("mailmap: '%s' <%s> -> '%s' <%s>\n",
113 debug_str(old_name), old_email,
114 debug_str(new_name), debug_str(new_email));
117 static char *parse_name_and_email(char *buffer, char **name,
118 char **email, int allow_empty_email)
120 char *left, *right, *nstart, *nend;
121 *name = *email = NULL;
123 if ((left = strchr(buffer, '<')) == NULL)
125 if ((right = strchr(left+1, '>')) == NULL)
127 if (!allow_empty_email && (left+1 == right))
130 /* remove whitespace from beginning and end of name */
132 while (isspace(*nstart) && nstart < left)
135 while (nend > nstart && isspace(*nend))
138 *name = (nstart <= nend ? nstart : NULL);
143 return (*right == '\0' ? NULL : right);
146 static void read_mailmap_line(struct string_list *map, char *buffer)
148 char *name1 = NULL, *email1 = NULL, *name2 = NULL, *email2 = NULL;
150 if (buffer[0] == '#')
153 if ((name2 = parse_name_and_email(buffer, &name1, &email1, 0)) != NULL)
154 parse_name_and_email(name2, &name2, &email2, 1);
157 add_mapping(map, name1, email1, name2, email2);
160 /* Flags for read_mailmap_file() */
161 #define MAILMAP_NOFOLLOW (1<<0)
163 static int read_mailmap_file(struct string_list *map, const char *filename,
173 if (flags & MAILMAP_NOFOLLOW)
174 fd = open_nofollow(filename, O_RDONLY);
176 fd = open(filename, O_RDONLY);
181 return error_errno("unable to open mailmap at %s", filename);
183 f = xfdopen(fd, "r");
185 while (fgets(buffer, sizeof(buffer), f) != NULL)
186 read_mailmap_line(map, buffer);
191 static void read_mailmap_string(struct string_list *map, char *buf)
194 char *end = strchrnul(buf, '\n');
199 read_mailmap_line(map, buf);
204 static int read_mailmap_blob(struct string_list *map, const char *name)
206 struct object_id oid;
209 enum object_type type;
213 if (get_oid(name, &oid) < 0)
216 buf = read_object_file(&oid, &type, &size);
218 return error("unable to read mailmap object at %s", name);
219 if (type != OBJ_BLOB)
220 return error("mailmap is not a blob: %s", name);
222 read_mailmap_string(map, buf);
228 int read_mailmap(struct string_list *map)
232 map->strdup_strings = 1;
233 map->cmp = namemap_cmp;
235 if (!git_mailmap_blob && is_bare_repository())
236 git_mailmap_blob = "HEAD:.mailmap";
238 if (!startup_info->have_repository || !is_bare_repository())
239 err |= read_mailmap_file(map, ".mailmap",
240 startup_info->have_repository ?
241 MAILMAP_NOFOLLOW : 0);
242 if (startup_info->have_repository)
243 err |= read_mailmap_blob(map, git_mailmap_blob);
244 err |= read_mailmap_file(map, git_mailmap_file, 0);
248 void clear_mailmap(struct string_list *map)
250 debug_mm("mailmap: clearing %d entries...\n", map->nr);
251 map->strdup_strings = 1;
252 string_list_clear_func(map, free_mailmap_entry);
253 debug_mm("mailmap: cleared\n");
257 * Look for an entry in map that match string[0:len]; string[len]
258 * does not have to be NUL (but it could be).
260 static struct string_list_item *lookup_prefix(struct string_list *map,
261 const char *string, size_t len)
263 int i = string_list_find_insert_index(map, string, 1);
268 return &map->items[i];
270 * that map entry matches exactly to the string, including
271 * the cruft at the end beyond "len". That is not a match
272 * with string[0:len] that we are looking for.
274 } else if (!string[len]) {
276 * asked with the whole string, and got nothing. No
277 * matching entry can exist in the map.
283 * i is at the exact match to an overlong key, or location the
284 * overlong key would be inserted, which must come after the
285 * real location of the key if one exists.
287 while (0 <= --i && i < map->nr) {
288 int cmp = strncasecmp(map->items[i].string, string, len);
291 * "i" points at a key definitely below the prefix;
292 * the map does not have string[0:len] in it.
295 else if (!cmp && !map->items[i].string[len])
297 return &map->items[i];
299 * otherwise, the string at "i" may be string[0:len]
300 * followed by a string that sorts later than string[len:];
307 int map_user(struct string_list *map,
308 const char **email, size_t *emaillen,
309 const char **name, size_t *namelen)
311 struct string_list_item *item;
312 struct mailmap_entry *me;
314 debug_mm("map_user: map '%.*s' <%.*s>\n",
315 (int)*namelen, debug_str(*name),
316 (int)*emaillen, debug_str(*email));
318 item = lookup_prefix(map, *email, *emaillen);
320 me = (struct mailmap_entry *)item->util;
321 if (me->namemap.nr) {
323 * The item has multiple items, so we'll look up on
324 * name too. If the name is not found, we choose the
327 struct string_list_item *subitem;
328 subitem = lookup_prefix(&me->namemap, *name, *namelen);
334 struct mailmap_info *mi = (struct mailmap_info *)item->util;
335 if (mi->name == NULL && mi->email == NULL) {
336 debug_mm("map_user: -- (no simple mapping)\n");
341 *emaillen = strlen(*email);
345 *namelen = strlen(*name);
347 debug_mm("map_user: to '%.*s' <%.*s>\n",
348 (int)*namelen, debug_str(*name),
349 (int)*emaillen, debug_str(*email));
352 debug_mm("map_user: --\n");