]>
git.ipfire.org Git - thirdparty/git.git/blob - mailmap.c
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
;
86 me
= xcalloc(1, sizeof(struct mailmap_entry
));
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
,
149 char *name1
= NULL
, *email1
= NULL
, *name2
= NULL
, *email2
= NULL
;
150 if (buffer
[0] == '#') {
151 static const char abbrev
[] = "# repo-abbrev:";
152 int abblen
= sizeof(abbrev
) - 1;
153 int len
= strlen(buffer
);
158 if (len
&& buffer
[len
- 1] == '\n')
160 if (!strncmp(buffer
, abbrev
, abblen
)) {
165 for (cp
= buffer
+ abblen
; isspace(*cp
); cp
++)
167 *repo_abbrev
= xstrdup(cp
);
171 if ((name2
= parse_name_and_email(buffer
, &name1
, &email1
, 0)) != NULL
)
172 parse_name_and_email(name2
, &name2
, &email2
, 1);
175 add_mapping(map
, name1
, email1
, name2
, email2
);
178 static int read_mailmap_file(struct string_list
*map
, const char *filename
,
187 f
= fopen(filename
, "r");
191 return error_errno("unable to open mailmap at %s", filename
);
194 while (fgets(buffer
, sizeof(buffer
), f
) != NULL
)
195 read_mailmap_line(map
, buffer
, repo_abbrev
);
200 static void read_mailmap_string(struct string_list
*map
, char *buf
,
204 char *end
= strchrnul(buf
, '\n');
209 read_mailmap_line(map
, buf
, repo_abbrev
);
214 static int read_mailmap_blob(struct string_list
*map
,
218 struct object_id oid
;
221 enum object_type type
;
225 if (get_oid(name
, &oid
) < 0)
228 buf
= read_object_file(&oid
, &type
, &size
);
230 return error("unable to read mailmap object at %s", name
);
231 if (type
!= OBJ_BLOB
)
232 return error("mailmap is not a blob: %s", name
);
234 read_mailmap_string(map
, buf
, repo_abbrev
);
240 int read_mailmap(struct string_list
*map
, char **repo_abbrev
)
244 map
->strdup_strings
= 1;
245 map
->cmp
= namemap_cmp
;
247 if (!git_mailmap_blob
&& is_bare_repository())
248 git_mailmap_blob
= "HEAD:.mailmap";
250 err
|= read_mailmap_file(map
, ".mailmap", repo_abbrev
);
251 if (startup_info
->have_repository
)
252 err
|= read_mailmap_blob(map
, git_mailmap_blob
, repo_abbrev
);
253 err
|= read_mailmap_file(map
, git_mailmap_file
, repo_abbrev
);
257 void clear_mailmap(struct string_list
*map
)
259 debug_mm("mailmap: clearing %d entries...\n", map
->nr
);
260 map
->strdup_strings
= 1;
261 string_list_clear_func(map
, free_mailmap_entry
);
262 debug_mm("mailmap: cleared\n");
266 * Look for an entry in map that match string[0:len]; string[len]
267 * does not have to be NUL (but it could be).
269 static struct string_list_item
*lookup_prefix(struct string_list
*map
,
270 const char *string
, size_t len
)
272 int i
= string_list_find_insert_index(map
, string
, 1);
277 return &map
->items
[i
];
279 * that map entry matches exactly to the string, including
280 * the cruft at the end beyond "len". That is not a match
281 * with string[0:len] that we are looking for.
283 } else if (!string
[len
]) {
285 * asked with the whole string, and got nothing. No
286 * matching entry can exist in the map.
292 * i is at the exact match to an overlong key, or location the
293 * overlong key would be inserted, which must come after the
294 * real location of the key if one exists.
296 while (0 <= --i
&& i
< map
->nr
) {
297 int cmp
= strncasecmp(map
->items
[i
].string
, string
, len
);
300 * "i" points at a key definitely below the prefix;
301 * the map does not have string[0:len] in it.
304 else if (!cmp
&& !map
->items
[i
].string
[len
])
306 return &map
->items
[i
];
308 * otherwise, the string at "i" may be string[0:len]
309 * followed by a string that sorts later than string[len:];
316 int map_user(struct string_list
*map
,
317 const char **email
, size_t *emaillen
,
318 const char **name
, size_t *namelen
)
320 struct string_list_item
*item
;
321 struct mailmap_entry
*me
;
323 debug_mm("map_user: map '%.*s' <%.*s>\n",
324 (int)*namelen
, debug_str(*name
),
325 (int)*emaillen
, debug_str(*email
));
327 item
= lookup_prefix(map
, *email
, *emaillen
);
329 me
= (struct mailmap_entry
*)item
->util
;
330 if (me
->namemap
.nr
) {
332 * The item has multiple items, so we'll look up on
333 * name too. If the name is not found, we choose the
336 struct string_list_item
*subitem
;
337 subitem
= lookup_prefix(&me
->namemap
, *name
, *namelen
);
343 struct mailmap_info
*mi
= (struct mailmap_info
*)item
->util
;
344 if (mi
->name
== NULL
&& mi
->email
== NULL
) {
345 debug_mm("map_user: -- (no simple mapping)\n");
350 *emaillen
= strlen(*email
);
354 *namelen
= strlen(*name
);
356 debug_mm("map_user: to '%.*s' <%.*s>\n",
357 (int)*namelen
, debug_str(*name
),
358 (int)*emaillen
, debug_str(*email
));
361 debug_mm("map_user: --\n");