mailmap.c

   1 #include "cache.h"
   2 #include "environment.h"
   3 #include "string-list.h"
   4 #include "mailmap.h"
   5 #include "object-store.h"
   6 #include "setup.h"
   7
   8 const char *git_mailmap_file;
   9 const char *git_mailmap_blob;
  10
  11 struct mailmap_info {
  12         char *name;
  13         char *email;
  14 };
  15
  16 struct mailmap_entry {
  17         /* name and email for the simple mail-only case */
  18         char *name;
  19         char *email;
  20
  21         /* name and email for the complex mail and name matching case */
  22         struct string_list namemap;
  23 };
  24
  25 static void free_mailmap_info(void *p, const char *s UNUSED)
  26 {
  27         struct mailmap_info *mi = (struct mailmap_info *)p;
  28         free(mi->name);
  29         free(mi->email);
  30         free(mi);
  31 }
  32
  33 static void free_mailmap_entry(void *p, const char *s UNUSED)
  34 {
  35         struct mailmap_entry *me = (struct mailmap_entry *)p;
  36
  37         free(me->name);
  38         free(me->email);
  39
  40         me->namemap.strdup_strings = 1;
  41         string_list_clear_func(&me->namemap, free_mailmap_info);
  42         free(me);
  43 }
  44
  45 /*
  46  * On some systems (e.g. MinGW 4.0), string.h has _only_ inline
  47  * definition of strcasecmp and no non-inline implementation is
  48  * supplied anywhere, which is, eh, "unusual"; we cannot take an
  49  * address of such a function to store it in namemap.cmp.  This is
  50  * here as a workaround---do not assign strcasecmp directly to
  51  * namemap.cmp until we know no systems that matter have such an
  52  * "unusual" string.h.
  53  */
  54 static int namemap_cmp(const char *a, const char *b)
  55 {
  56         return strcasecmp(a, b);
  57 }
  58
  59 static void add_mapping(struct string_list *map,
  60                         char *new_name, char *new_email,
  61                         char *old_name, char *old_email)
  62 {
  63         struct mailmap_entry *me;
  64         struct string_list_item *item;
  65
  66         if (!old_email) {
  67                 old_email = new_email;
  68                 new_email = NULL;
  69         }
  70
  71         item = string_list_insert(map, old_email);
  72         if (item->util) {
  73                 me = (struct mailmap_entry *)item->util;
  74         } else {
  75                 CALLOC_ARRAY(me, 1);
  76                 me->namemap.strdup_strings = 1;
  77                 me->namemap.cmp = namemap_cmp;
  78                 item->util = me;
  79         }
  80
  81         if (!old_name) {
  82                 /* Replace current name and new email for simple entry */
  83                 if (new_name) {
  84                         free(me->name);
  85                         me->name = xstrdup(new_name);
  86                 }
  87                 if (new_email) {
  88                         free(me->email);
  89                         me->email = xstrdup(new_email);
  90                 }
  91         } else {
  92                 struct mailmap_info *mi = xcalloc(1, sizeof(struct mailmap_info));
  93                 mi->name = xstrdup_or_null(new_name);
  94                 mi->email = xstrdup_or_null(new_email);
  95                 string_list_insert(&me->namemap, old_name)->util = mi;
  96         }
  97 }
  98
  99 static char *parse_name_and_email(char *buffer, char **name,
 100                                   char **email, int allow_empty_email)
 101 {
 102         char *left, *right, *nstart, *nend;
 103         *name = *email = NULL;
 104
 105         if (!(left = strchr(buffer, '<')))
 106                 return NULL;
 107         if (!(right = strchr(left + 1, '>')))
 108                 return NULL;
 109         if (!allow_empty_email && (left+1 == right))
 110                 return NULL;
 111
 112         /* remove whitespace from beginning and end of name */
 113         nstart = buffer;
 114         while (isspace(*nstart) && nstart < left)
 115                 ++nstart;
 116         nend = left-1;
 117         while (nend > nstart && isspace(*nend))
 118                 --nend;
 119
 120         *name = (nstart <= nend ? nstart : NULL);
 121         *email = left+1;
 122         *(nend+1) = '\0';
 123         *right++ = '\0';
 124
 125         return (*right == '\0' ? NULL : right);
 126 }
 127
 128 static void read_mailmap_line(struct string_list *map, char *buffer)
 129 {
 130         char *name1 = NULL, *email1 = NULL, *name2 = NULL, *email2 = NULL;
 131
 132         if (buffer[0] == '#')
 133                 return;
 134
 135         if ((name2 = parse_name_and_email(buffer, &name1, &email1, 0)))
 136                 parse_name_and_email(name2, &name2, &email2, 1);
 137
 138         if (email1)
 139                 add_mapping(map, name1, email1, name2, email2);
 140 }
 141
 142 /* Flags for read_mailmap_file() */
 143 #define MAILMAP_NOFOLLOW (1<<0)
 144
 145 static int read_mailmap_file(struct string_list *map, const char *filename,
 146                              unsigned flags)
 147 {
 148         char buffer[1024];
 149         FILE *f;
 150         int fd;
 151
 152         if (!filename)
 153                 return 0;
 154
 155         if (flags & MAILMAP_NOFOLLOW)
 156                 fd = open_nofollow(filename, O_RDONLY);
 157         else
 158                 fd = open(filename, O_RDONLY);
 159
 160         if (fd < 0) {
 161                 if (errno == ENOENT)
 162                         return 0;
 163                 return error_errno("unable to open mailmap at %s", filename);
 164         }
 165         f = xfdopen(fd, "r");
 166
 167         while (fgets(buffer, sizeof(buffer), f) != NULL)
 168                 read_mailmap_line(map, buffer);
 169         fclose(f);
 170         return 0;
 171 }
 172
 173 static void read_mailmap_string(struct string_list *map, char *buf)
 174 {
 175         while (*buf) {
 176                 char *end = strchrnul(buf, '\n');
 177
 178                 if (*end)
 179                         *end++ = '\0';
 180
 181                 read_mailmap_line(map, buf);
 182                 buf = end;
 183         }
 184 }
 185
 186 static int read_mailmap_blob(struct string_list *map, const char *name)
 187 {
 188         struct object_id oid;
 189         char *buf;
 190         unsigned long size;
 191         enum object_type type;
 192
 193         if (!name)
 194                 return 0;
 195         if (repo_get_oid(the_repository, name, &oid) < 0)
 196                 return 0;
 197
 198         buf = repo_read_object_file(the_repository, &oid, &type, &size);
 199         if (!buf)
 200                 return error("unable to read mailmap object at %s", name);
 201         if (type != OBJ_BLOB)
 202                 return error("mailmap is not a blob: %s", name);
 203
 204         read_mailmap_string(map, buf);
 205
 206         free(buf);
 207         return 0;
 208 }
 209
 210 int read_mailmap(struct string_list *map)
 211 {
 212         int err = 0;
 213
 214         map->strdup_strings = 1;
 215         map->cmp = namemap_cmp;
 216
 217         if (!git_mailmap_blob && is_bare_repository())
 218                 git_mailmap_blob = "HEAD:.mailmap";
 219
 220         if (!startup_info->have_repository || !is_bare_repository())
 221                 err |= read_mailmap_file(map, ".mailmap",
 222                                          startup_info->have_repository ?
 223                                          MAILMAP_NOFOLLOW : 0);
 224         if (startup_info->have_repository)
 225                 err |= read_mailmap_blob(map, git_mailmap_blob);
 226         err |= read_mailmap_file(map, git_mailmap_file, 0);
 227         return err;
 228 }
 229
 230 void clear_mailmap(struct string_list *map)
 231 {
 232         map->strdup_strings = 1;
 233         string_list_clear_func(map, free_mailmap_entry);
 234 }
 235
 236 /*
 237  * Look for an entry in map that match string[0:len]; string[len]
 238  * does not have to be NUL (but it could be).
 239  */
 240 static struct string_list_item *lookup_prefix(struct string_list *map,
 241                                               const char *string, size_t len)
 242 {
 243         int i = string_list_find_insert_index(map, string, 1);
 244         if (i < 0) {
 245                 /* exact match */
 246                 i = -1 - i;
 247                 if (!string[len])
 248                         return &map->items[i];
 249                 /*
 250                  * that map entry matches exactly to the string, including
 251                  * the cruft at the end beyond "len".  That is not a match
 252                  * with string[0:len] that we are looking for.
 253                  */
 254         } else if (!string[len]) {
 255                 /*
 256                  * asked with the whole string, and got nothing.  No
 257                  * matching entry can exist in the map.
 258                  */
 259                 return NULL;
 260         }
 261
 262         /*
 263          * i is at the exact match to an overlong key, or location the
 264          * overlong key would be inserted, which must come after the
 265          * real location of the key if one exists.
 266          */
 267         while (0 <= --i && i < map->nr) {
 268                 int cmp = strncasecmp(map->items[i].string, string, len);
 269                 if (cmp < 0)
 270                         /*
 271                          * "i" points at a key definitely below the prefix;
 272                          * the map does not have string[0:len] in it.
 273                          */
 274                         break;
 275                 else if (!cmp && !map->items[i].string[len])
 276                         /* found it */
 277                         return &map->items[i];
 278                 /*
 279                  * otherwise, the string at "i" may be string[0:len]
 280                  * followed by a string that sorts later than string[len:];
 281                  * keep trying.
 282                  */
 283         }
 284         return NULL;
 285 }
 286
 287 int map_user(struct string_list *map,
 288              const char **email, size_t *emaillen,
 289              const char **name, size_t *namelen)
 290 {
 291         struct string_list_item *item;
 292         struct mailmap_entry *me;
 293
 294         item = lookup_prefix(map, *email, *emaillen);
 295         if (item) {
 296                 me = (struct mailmap_entry *)item->util;
 297                 if (me->namemap.nr) {
 298                         /*
 299                          * The item has multiple items, so we'll look up on
 300                          * name too. If the name is not found, we choose the
 301                          * simple entry.
 302                          */
 303                         struct string_list_item *subitem;
 304                         subitem = lookup_prefix(&me->namemap, *name, *namelen);
 305                         if (subitem)
 306                                 item = subitem;
 307                 }
 308         }
 309         if (item) {
 310                 struct mailmap_info *mi = (struct mailmap_info *)item->util;
 311                 if (mi->name == NULL && mi->email == NULL)
 312                         return 0;
 313                 if (mi->email) {
 314                                 *email = mi->email;
 315                                 *emaillen = strlen(*email);
 316                 }
 317                 if (mi->name) {
 318                                 *name = mi->name;
 319                                 *namelen = strlen(*name);
 320                 }
 321                 return 1;
 322         }
 323         return 0;
 324 }