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
)) {
172 *repo_abbrev
= xmalloc(len
);
174 for (cp
= buffer
+ abblen
; isspace(*cp
); cp
++)
176 strcpy(*repo_abbrev
, cp
);
180 if ((name2
= parse_name_and_email(buffer
, &name1
, &email1
, 0)) != NULL
)
181 parse_name_and_email(name2
, &name2
, &email2
, 1);
184 add_mapping(map
, name1
, email1
, name2
, email2
);
187 static int read_mailmap_file(struct string_list
*map
, const char *filename
,
196 f
= fopen(filename
, "r");
200 return error("unable to open mailmap at %s: %s",
201 filename
, strerror(errno
));
204 while (fgets(buffer
, sizeof(buffer
), f
) != NULL
)
205 read_mailmap_line(map
, buffer
, repo_abbrev
);
210 static void read_mailmap_buf(struct string_list
*map
,
211 const char *buf
, unsigned long len
,
215 const char *end
= strchrnul(buf
, '\n');
216 unsigned long linelen
= end
- buf
+ 1;
217 char *line
= xmemdupz(buf
, linelen
);
219 read_mailmap_line(map
, line
, repo_abbrev
);
227 static int read_mailmap_blob(struct string_list
*map
,
231 unsigned char sha1
[20];
234 enum object_type type
;
238 if (get_sha1(name
, sha1
) < 0)
241 buf
= read_sha1_file(sha1
, &type
, &size
);
243 return error("unable to read mailmap object at %s", name
);
244 if (type
!= OBJ_BLOB
)
245 return error("mailmap is not a blob: %s", name
);
247 read_mailmap_buf(map
, buf
, size
, repo_abbrev
);
253 int read_mailmap(struct string_list
*map
, char **repo_abbrev
)
257 map
->strdup_strings
= 1;
258 map
->cmp
= namemap_cmp
;
260 if (!git_mailmap_blob
&& is_bare_repository())
261 git_mailmap_blob
= "HEAD:.mailmap";
263 err
|= read_mailmap_file(map
, ".mailmap", repo_abbrev
);
264 err
|= read_mailmap_blob(map
, git_mailmap_blob
, repo_abbrev
);
265 err
|= read_mailmap_file(map
, git_mailmap_file
, repo_abbrev
);
269 void clear_mailmap(struct string_list
*map
)
271 debug_mm("mailmap: clearing %d entries...\n", map
->nr
);
272 map
->strdup_strings
= 1;
273 string_list_clear_func(map
, free_mailmap_entry
);
274 debug_mm("mailmap: cleared\n");
278 * Look for an entry in map that match string[0:len]; string[len]
279 * does not have to be NUL (but it could be).
281 static struct string_list_item
*lookup_prefix(struct string_list
*map
,
282 const char *string
, size_t len
)
284 int i
= string_list_find_insert_index(map
, string
, 1);
289 return &map
->items
[i
];
291 * that map entry matches exactly to the string, including
292 * the cruft at the end beyond "len". That is not a match
293 * with string[0:len] that we are looking for.
295 } else if (!string
[len
]) {
297 * asked with the whole string, and got nothing. No
298 * matching entry can exist in the map.
304 * i is at the exact match to an overlong key, or location the
305 * overlong key would be inserted, which must come after the
306 * real location of the key if one exists.
308 while (0 <= --i
&& i
< map
->nr
) {
309 int cmp
= strncasecmp(map
->items
[i
].string
, string
, len
);
312 * "i" points at a key definitely below the prefix;
313 * the map does not have string[0:len] in it.
316 else if (!cmp
&& !map
->items
[i
].string
[len
])
318 return &map
->items
[i
];
320 * otherwise, the string at "i" may be string[0:len]
321 * followed by a string that sorts later than string[len:];
328 int map_user(struct string_list
*map
,
329 const char **email
, size_t *emaillen
,
330 const char **name
, size_t *namelen
)
332 struct string_list_item
*item
;
333 struct mailmap_entry
*me
;
335 debug_mm("map_user: map '%.*s' <%.*s>\n",
336 (int)*namelen
, debug_str(*name
),
337 (int)*emaillen
, debug_str(*email
));
339 item
= lookup_prefix(map
, *email
, *emaillen
);
341 me
= (struct mailmap_entry
*)item
->util
;
342 if (me
->namemap
.nr
) {
344 * The item has multiple items, so we'll look up on
345 * name too. If the name is not found, we choose the
348 struct string_list_item
*subitem
;
349 subitem
= lookup_prefix(&me
->namemap
, *name
, *namelen
);
355 struct mailmap_info
*mi
= (struct mailmap_info
*)item
->util
;
356 if (mi
->name
== NULL
&& mi
->email
== NULL
) {
357 debug_mm("map_user: -- (no simple mapping)\n");
362 *emaillen
= strlen(*email
);
366 *namelen
= strlen(*name
);
368 debug_mm("map_user: to '%.*s' <%.*s>\n",
369 (int)*namelen
, debug_str(*name
),
370 (int)*emaillen
, debug_str(*email
));
373 debug_mm("map_user: --\n");