2 * Copyright (C) 2005 Junio C Hamano
11 static void prepare_order(const char *orderfile)
22 fd = open(orderfile, O_RDONLY);
29 sz = xsize_t(st.st_size);
30 map = mmap(NULL, sz, PROT_READ|PROT_WRITE, MAP_PRIVATE, fd, 0);
32 if (map == MAP_FAILED)
34 endp = (char *) map + sz;
35 for (pass = 0; pass < 2; pass++) {
40 for (ep = cp; ep < endp && *ep != '\n'; ep++)
42 /* cp to ep has one line */
43 if (*cp == '\n' || *cp == '#')
52 order[cnt] = xmemdupz(cp, ep - cp);
62 order = xmalloc(sizeof(*order) * cnt);
68 struct diff_filepair *pair;
73 static int match_order(const char *path)
76 static struct strbuf p = STRBUF_INIT;
78 for (i = 0; i < order_cnt; i++) {
80 strbuf_addstr(&p, path);
83 if (!fnmatch(order[i], p.buf, 0))
85 cp = strrchr(p.buf, '/');
94 static int compare_pair_order(const void *a_, const void *b_)
96 struct pair_order const *a, *b;
97 a = (struct pair_order const *)a_;
98 b = (struct pair_order const *)b_;
99 if (a->order != b->order)
100 return a->order - b->order;
101 return a->orig_order - b->orig_order;
104 void diffcore_order(const char *orderfile)
106 struct diff_queue_struct *q = &diff_queued_diff;
107 struct pair_order *o;
113 o = xmalloc(sizeof(*o) * q->nr);
114 prepare_order(orderfile);
115 for (i = 0; i < q->nr; i++) {
116 o[i].pair = q->queue[i];
118 o[i].order = match_order(o[i].pair->two->path);
120 qsort(o, q->nr, sizeof(*o), compare_pair_order);
121 for (i = 0; i < q->nr; i++)
122 q->queue[i] = o[i].pair;