2 * Copyright (C) 2005 Junio C Hamano
11 static void prepare_order(const char *orderfile
)
14 struct strbuf sb
= STRBUF_INIT
;
22 sz
= strbuf_read_file(&sb
, orderfile
, 0);
24 die_errno(_("failed to read orderfile '%s'"), orderfile
);
25 map
= strbuf_detach(&sb
, NULL
);
26 endp
= (char *) map
+ sz
;
28 for (pass
= 0; pass
< 2; pass
++) {
33 for (ep
= cp
; ep
< endp
&& *ep
!= '\n'; ep
++)
35 /* cp to ep has one line */
36 if (*cp
== '\n' || *cp
== '#')
45 order
[cnt
] = xmemdupz(cp
, ep
- cp
);
55 order
= xmalloc(sizeof(*order
) * cnt
);
61 struct diff_filepair
*pair
;
66 static int match_order(const char *path
)
71 for (i
= 0; i
< order_cnt
; i
++) {
75 if (!fnmatch(order
[i
], p
, 0))
86 static int compare_pair_order(const void *a_
, const void *b_
)
88 struct pair_order
const *a
, *b
;
89 a
= (struct pair_order
const *)a_
;
90 b
= (struct pair_order
const *)b_
;
91 if (a
->order
!= b
->order
)
92 return a
->order
- b
->order
;
93 return a
->orig_order
- b
->orig_order
;
96 void diffcore_order(const char *orderfile
)
98 struct diff_queue_struct
*q
= &diff_queued_diff
;
105 o
= xmalloc(sizeof(*o
) * q
->nr
);
106 prepare_order(orderfile
);
107 for (i
= 0; i
< q
->nr
; i
++) {
108 o
[i
].pair
= q
->queue
[i
];
110 o
[i
].order
= match_order(o
[i
].pair
->two
->path
);
112 qsort(o
, q
->nr
, sizeof(*o
), compare_pair_order
);
113 for (i
= 0; i
< q
->nr
; i
++)
114 q
->queue
[i
] = o
[i
].pair
;