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
;
74 struct string_list_item
*item
;
76 if (old_email
== NULL
) {
77 old_email
= new_email
;
81 item
= string_list_insert(map
, old_email
);
83 me
= (struct mailmap_entry
*)item
->util
;
85 me
= xcalloc(1, sizeof(struct mailmap_entry
));
86 me
->namemap
.strdup_strings
= 1;
87 me
->namemap
.cmp
= namemap_cmp
;
91 if (old_name
== NULL
) {
92 debug_mm("mailmap: adding (simple) entry for '%s'\n", old_email
);
94 /* Replace current name and new email for simple entry */
97 me
->name
= xstrdup(new_name
);
101 me
->email
= xstrdup(new_email
);
104 struct mailmap_info
*mi
= xcalloc(1, sizeof(struct mailmap_info
));
105 debug_mm("mailmap: adding (complex) entry for '%s'\n", old_email
);
107 mi
->name
= xstrdup(new_name
);
109 mi
->email
= xstrdup(new_email
);
110 string_list_insert(&me
->namemap
, old_name
)->util
= mi
;
113 debug_mm("mailmap: '%s' <%s> -> '%s' <%s>\n",
114 debug_str(old_name
), old_email
,
115 debug_str(new_name
), debug_str(new_email
));
118 static char *parse_name_and_email(char *buffer
, char **name
,
119 char **email
, int allow_empty_email
)
121 char *left
, *right
, *nstart
, *nend
;
122 *name
= *email
= NULL
;
124 if ((left
= strchr(buffer
, '<')) == NULL
)
126 if ((right
= strchr(left
+1, '>')) == NULL
)
128 if (!allow_empty_email
&& (left
+1 == right
))
131 /* remove whitespace from beginning and end of name */
133 while (isspace(*nstart
) && nstart
< left
)
136 while (nend
> nstart
&& isspace(*nend
))
139 *name
= (nstart
<= nend
? nstart
: NULL
);
144 return (*right
== '\0' ? NULL
: right
);
147 static void read_mailmap_line(struct string_list
*map
, char *buffer
,
150 char *name1
= NULL
, *email1
= NULL
, *name2
= NULL
, *email2
= NULL
;
151 if (buffer
[0] == '#') {
152 static const char abbrev
[] = "# repo-abbrev:";
153 int abblen
= sizeof(abbrev
) - 1;
154 int len
= strlen(buffer
);
159 if (len
&& buffer
[len
- 1] == '\n')
161 if (!strncmp(buffer
, abbrev
, abblen
)) {
166 for (cp
= buffer
+ abblen
; isspace(*cp
); cp
++)
168 *repo_abbrev
= xstrdup(cp
);
172 if ((name2
= parse_name_and_email(buffer
, &name1
, &email1
, 0)) != NULL
)
173 parse_name_and_email(name2
, &name2
, &email2
, 1);
176 add_mapping(map
, name1
, email1
, name2
, email2
);
179 static int read_mailmap_file(struct string_list
*map
, const char *filename
,
188 f
= fopen(filename
, "r");
192 return error("unable to open mailmap at %s: %s",
193 filename
, strerror(errno
));
196 while (fgets(buffer
, sizeof(buffer
), f
) != NULL
)
197 read_mailmap_line(map
, buffer
, repo_abbrev
);
202 static void read_mailmap_string(struct string_list
*map
, char *buf
,
206 char *end
= strchrnul(buf
, '\n');
211 read_mailmap_line(map
, buf
, repo_abbrev
);
216 static int read_mailmap_blob(struct string_list
*map
,
220 unsigned char sha1
[20];
223 enum object_type type
;
227 if (get_sha1(name
, sha1
) < 0)
230 buf
= read_sha1_file(sha1
, &type
, &size
);
232 return error("unable to read mailmap object at %s", name
);
233 if (type
!= OBJ_BLOB
)
234 return error("mailmap is not a blob: %s", name
);
236 read_mailmap_string(map
, buf
, repo_abbrev
);
242 int read_mailmap(struct string_list
*map
, char **repo_abbrev
)
246 map
->strdup_strings
= 1;
247 map
->cmp
= namemap_cmp
;
249 if (!git_mailmap_blob
&& is_bare_repository())
250 git_mailmap_blob
= "HEAD:.mailmap";
252 err
|= read_mailmap_file(map
, ".mailmap", repo_abbrev
);
253 if (startup_info
->have_repository
)
254 err
|= read_mailmap_blob(map
, git_mailmap_blob
, repo_abbrev
);
255 err
|= read_mailmap_file(map
, git_mailmap_file
, repo_abbrev
);
259 void clear_mailmap(struct string_list
*map
)
261 debug_mm("mailmap: clearing %d entries...\n", map
->nr
);
262 map
->strdup_strings
= 1;
263 string_list_clear_func(map
, free_mailmap_entry
);
264 debug_mm("mailmap: cleared\n");
268 * Look for an entry in map that match string[0:len]; string[len]
269 * does not have to be NUL (but it could be).
271 static struct string_list_item
*lookup_prefix(struct string_list
*map
,
272 const char *string
, size_t len
)
274 int i
= string_list_find_insert_index(map
, string
, 1);
279 return &map
->items
[i
];
281 * that map entry matches exactly to the string, including
282 * the cruft at the end beyond "len". That is not a match
283 * with string[0:len] that we are looking for.
285 } else if (!string
[len
]) {
287 * asked with the whole string, and got nothing. No
288 * matching entry can exist in the map.
294 * i is at the exact match to an overlong key, or location the
295 * overlong key would be inserted, which must come after the
296 * real location of the key if one exists.
298 while (0 <= --i
&& i
< map
->nr
) {
299 int cmp
= strncasecmp(map
->items
[i
].string
, string
, len
);
302 * "i" points at a key definitely below the prefix;
303 * the map does not have string[0:len] in it.
306 else if (!cmp
&& !map
->items
[i
].string
[len
])
308 return &map
->items
[i
];
310 * otherwise, the string at "i" may be string[0:len]
311 * followed by a string that sorts later than string[len:];
318 int map_user(struct string_list
*map
,
319 const char **email
, size_t *emaillen
,
320 const char **name
, size_t *namelen
)
322 struct string_list_item
*item
;
323 struct mailmap_entry
*me
;
325 debug_mm("map_user: map '%.*s' <%.*s>\n",
326 (int)*namelen
, debug_str(*name
),
327 (int)*emaillen
, debug_str(*email
));
329 item
= lookup_prefix(map
, *email
, *emaillen
);
331 me
= (struct mailmap_entry
*)item
->util
;
332 if (me
->namemap
.nr
) {
334 * The item has multiple items, so we'll look up on
335 * name too. If the name is not found, we choose the
338 struct string_list_item
*subitem
;
339 subitem
= lookup_prefix(&me
->namemap
, *name
, *namelen
);
345 struct mailmap_info
*mi
= (struct mailmap_info
*)item
->util
;
346 if (mi
->name
== NULL
&& mi
->email
== NULL
) {
347 debug_mm("map_user: -- (no simple mapping)\n");
352 *emaillen
= strlen(*email
);
356 *namelen
= strlen(*name
);
358 debug_mm("map_user: to '%.*s' <%.*s>\n",
359 (int)*namelen
, debug_str(*name
),
360 (int)*emaillen
, debug_str(*email
));
363 debug_mm("map_user: --\n");