Merge branch 'jc/maint-read-tree-multi' into maint
[git/kirr.git] / mailmap.c
blob6be91b60dfc8c37bd21c45d1480f7b3cf1fe5a99
1 #include "cache.h"
2 #include "string-list.h"
3 #include "mailmap.h"
5 #define DEBUG_MAILMAP 0
6 #if DEBUG_MAILMAP
7 #define debug_mm(...) fprintf(stderr, __VA_ARGS__)
8 #else
9 static inline void debug_mm(const char *format, ...) {}
10 #endif
12 const char *git_mailmap_file;
14 struct mailmap_info {
15 char *name;
16 char *email;
19 struct mailmap_entry {
20 /* name and email for the simple mail-only case */
21 char *name;
22 char *email;
24 /* name and email for the complex mail and name matching case */
25 struct string_list namemap;
28 static void free_mailmap_info(void *p, const char *s)
30 struct mailmap_info *mi = (struct mailmap_info *)p;
31 debug_mm("mailmap: -- complex: '%s' -> '%s' <%s>\n", s, mi->name, mi->email);
32 free(mi->name);
33 free(mi->email);
36 static void free_mailmap_entry(void *p, const char *s)
38 struct mailmap_entry *me = (struct mailmap_entry *)p;
39 debug_mm("mailmap: removing entries for <%s>, with %d sub-entries\n", s, me->namemap.nr);
40 debug_mm("mailmap: - simple: '%s' <%s>\n", me->name, me->email);
41 free(me->name);
42 free(me->email);
44 me->namemap.strdup_strings = 1;
45 string_list_clear_func(&me->namemap, free_mailmap_info);
48 static void add_mapping(struct string_list *map,
49 char *new_name, char *new_email, char *old_name, char *old_email)
51 struct mailmap_entry *me;
52 int index;
53 char *p;
55 if (old_email)
56 for (p = old_email; *p; p++)
57 *p = tolower(*p);
58 if (new_email)
59 for (p = new_email; *p; p++)
60 *p = tolower(*p);
62 if (old_email == NULL) {
63 old_email = new_email;
64 new_email = NULL;
67 if ((index = string_list_find_insert_index(map, old_email, 1)) < 0) {
68 /* mailmap entry exists, invert index value */
69 index = -1 - index;
70 } else {
71 /* create mailmap entry */
72 struct string_list_item *item = string_list_insert_at_index(index, old_email, map);
73 item->util = xmalloc(sizeof(struct mailmap_entry));
74 memset(item->util, 0, sizeof(struct mailmap_entry));
75 ((struct mailmap_entry *)item->util)->namemap.strdup_strings = 1;
77 me = (struct mailmap_entry *)map->items[index].util;
79 if (old_name == NULL) {
80 debug_mm("mailmap: adding (simple) entry for %s at index %d\n", old_email, index);
81 /* Replace current name and new email for simple entry */
82 free(me->name);
83 free(me->email);
84 if (new_name)
85 me->name = xstrdup(new_name);
86 if (new_email)
87 me->email = xstrdup(new_email);
88 } else {
89 struct mailmap_info *mi = xmalloc(sizeof(struct mailmap_info));
90 debug_mm("mailmap: adding (complex) entry for %s at index %d\n", old_email, index);
91 if (new_name)
92 mi->name = xstrdup(new_name);
93 if (new_email)
94 mi->email = xstrdup(new_email);
95 string_list_insert(old_name, &me->namemap)->util = mi;
98 debug_mm("mailmap: '%s' <%s> -> '%s' <%s>\n",
99 old_name, old_email, new_name, new_email);
102 static char *parse_name_and_email(char *buffer, char **name, char **email)
104 char *left, *right, *nstart, *nend;
105 *name = *email = 0;
107 if ((left = strchr(buffer, '<')) == NULL)
108 return NULL;
109 if ((right = strchr(left+1, '>')) == NULL)
110 return NULL;
111 if (left+1 == right)
112 return NULL;
114 /* remove whitespace from beginning and end of name */
115 nstart = buffer;
116 while (isspace(*nstart) && nstart < left)
117 ++nstart;
118 nend = left-1;
119 while (isspace(*nend) && nend > nstart)
120 --nend;
122 *name = (nstart < nend ? nstart : NULL);
123 *email = left+1;
124 *(nend+1) = '\0';
125 *right++ = '\0';
127 return (*right == '\0' ? NULL : right);
130 static int read_single_mailmap(struct string_list *map, const char *filename, char **repo_abbrev)
132 char buffer[1024];
133 FILE *f = (filename == NULL ? NULL : fopen(filename, "r"));
135 if (f == NULL)
136 return 1;
137 while (fgets(buffer, sizeof(buffer), f) != NULL) {
138 char *name1 = 0, *email1 = 0, *name2 = 0, *email2 = 0;
139 if (buffer[0] == '#') {
140 static const char abbrev[] = "# repo-abbrev:";
141 int abblen = sizeof(abbrev) - 1;
142 int len = strlen(buffer);
144 if (!repo_abbrev)
145 continue;
147 if (len && buffer[len - 1] == '\n')
148 buffer[--len] = 0;
149 if (!strncmp(buffer, abbrev, abblen)) {
150 char *cp;
152 if (repo_abbrev)
153 free(*repo_abbrev);
154 *repo_abbrev = xmalloc(len);
156 for (cp = buffer + abblen; isspace(*cp); cp++)
157 ; /* nothing */
158 strcpy(*repo_abbrev, cp);
160 continue;
162 if ((name2 = parse_name_and_email(buffer, &name1, &email1)) != NULL)
163 parse_name_and_email(name2, &name2, &email2);
165 if (email1)
166 add_mapping(map, name1, email1, name2, email2);
168 fclose(f);
169 return 0;
172 int read_mailmap(struct string_list *map, char **repo_abbrev)
174 map->strdup_strings = 1;
175 /* each failure returns 1, so >1 means both calls failed */
176 return read_single_mailmap(map, ".mailmap", repo_abbrev) +
177 read_single_mailmap(map, git_mailmap_file, repo_abbrev) > 1;
180 void clear_mailmap(struct string_list *map)
182 debug_mm("mailmap: clearing %d entries...\n", map->nr);
183 map->strdup_strings = 1;
184 string_list_clear_func(map, free_mailmap_entry);
185 debug_mm("mailmap: cleared\n");
188 int map_user(struct string_list *map,
189 char *email, int maxlen_email, char *name, int maxlen_name)
191 char *p;
192 struct string_list_item *item;
193 struct mailmap_entry *me;
194 char buf[1024], *mailbuf;
195 int i;
197 /* figure out space requirement for email */
198 p = strchr(email, '>');
199 if (!p) {
200 /* email passed in might not be wrapped in <>, but end with a \0 */
201 p = memchr(email, '\0', maxlen_email);
202 if (p == 0)
203 return 0;
205 if (p - email + 1 < sizeof(buf))
206 mailbuf = buf;
207 else
208 mailbuf = xmalloc(p - email + 1);
210 /* downcase the email address */
211 for (i = 0; i < p - email; i++)
212 mailbuf[i] = tolower(email[i]);
213 mailbuf[i] = 0;
215 debug_mm("map_user: map '%s' <%s>\n", name, mailbuf);
216 item = string_list_lookup(mailbuf, map);
217 if (item != NULL) {
218 me = (struct mailmap_entry *)item->util;
219 if (me->namemap.nr) {
220 /* The item has multiple items, so we'll look up on name too */
221 /* If the name is not found, we choose the simple entry */
222 struct string_list_item *subitem = string_list_lookup(name, &me->namemap);
223 if (subitem)
224 item = subitem;
227 if (mailbuf != buf)
228 free(mailbuf);
229 if (item != NULL) {
230 struct mailmap_info *mi = (struct mailmap_info *)item->util;
231 if (mi->name == NULL && (mi->email == NULL || maxlen_email == 0)) {
232 debug_mm("map_user: -- (no simple mapping)\n");
233 return 0;
235 if (maxlen_email && mi->email)
236 strlcpy(email, mi->email, maxlen_email);
237 if (maxlen_name && mi->name)
238 strlcpy(name, mi->name, maxlen_name);
239 debug_mm("map_user: to '%s' <%s>\n", name, mi->email ? mi->email : "");
240 return 1;
242 debug_mm("map_user: --\n");
243 return 0;
246 int map_email(struct string_list *map, const char *email, char *name, int maxlen)
248 return map_user(map, (char *)email, 0, name, maxlen);