Coverage Report

Created: 2025-12-31 07:01

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/git/diffcore-order.c
Line
Count
Source
1
/*
2
 * Copyright (C) 2005 Junio C Hamano
3
 */
4
5
#include "git-compat-util.h"
6
#include "gettext.h"
7
#include "diff.h"
8
#include "diffcore.h"
9
#include "wildmatch.h"
10
11
static char **order;
12
static int order_cnt;
13
14
static void prepare_order(const char *orderfile)
15
0
{
16
0
  int cnt, pass;
17
0
  struct strbuf sb = STRBUF_INIT;
18
0
  const char *cp, *endp;
19
0
  ssize_t sz;
20
21
0
  if (order)
22
0
    return;
23
24
0
  sz = strbuf_read_file(&sb, orderfile, 0);
25
0
  if (sz < 0)
26
0
    die_errno(_("failed to read orderfile '%s'"), orderfile);
27
0
  endp = sb.buf + sz;
28
29
0
  for (pass = 0; pass < 2; pass++) {
30
0
    cnt = 0;
31
0
    cp = sb.buf;
32
0
    while (cp < endp) {
33
0
      const char *ep;
34
0
      for (ep = cp; ep < endp && *ep != '\n'; ep++)
35
0
        ;
36
      /* cp to ep has one line */
37
0
      if (*cp == '\n' || *cp == '#')
38
0
        ; /* comment */
39
0
      else if (pass == 0)
40
0
        cnt++;
41
0
      else {
42
0
        order[cnt] = xmemdupz(cp, ep - cp);
43
0
        cnt++;
44
0
      }
45
0
      if (ep < endp)
46
0
        ep++;
47
0
      cp = ep;
48
0
    }
49
0
    if (pass == 0) {
50
0
      order_cnt = cnt;
51
0
      ALLOC_ARRAY(order, cnt);
52
0
    }
53
0
  }
54
55
0
  strbuf_release(&sb);
56
0
}
57
58
static int match_order(const char *path)
59
0
{
60
0
  int i;
61
0
  static struct strbuf p = STRBUF_INIT;
62
63
0
  for (i = 0; i < order_cnt; i++) {
64
0
    strbuf_reset(&p);
65
0
    strbuf_addstr(&p, path);
66
0
    while (p.buf[0]) {
67
0
      char *cp;
68
0
      if (!wildmatch(order[i], p.buf, 0))
69
0
        return i;
70
0
      cp = strrchr(p.buf, '/');
71
0
      if (!cp)
72
0
        break;
73
0
      *cp = 0;
74
0
    }
75
0
  }
76
0
  return order_cnt;
77
0
}
78
79
static int compare_objs_order(const void *a_, const void *b_)
80
0
{
81
0
  struct obj_order const *a, *b;
82
0
  a = (struct obj_order const *)a_;
83
0
  b = (struct obj_order const *)b_;
84
0
  if (a->order != b->order)
85
0
    return a->order - b->order;
86
0
  return a->orig_order - b->orig_order;
87
0
}
88
89
void order_objects(const char *orderfile, obj_path_fn_t obj_path,
90
       struct obj_order *objs, int nr)
91
0
{
92
0
  int i;
93
94
0
  if (!nr)
95
0
    return;
96
97
0
  prepare_order(orderfile);
98
0
  for (i = 0; i < nr; i++) {
99
0
    objs[i].orig_order = i;
100
0
    objs[i].order = match_order(obj_path(objs[i].obj));
101
0
  }
102
0
  QSORT(objs, nr, compare_objs_order);
103
0
}
104
105
static const char *pair_pathtwo(void *obj)
106
0
{
107
0
  struct diff_filepair *pair = (struct diff_filepair *)obj;
108
109
0
  return pair->two->path;
110
0
}
111
112
void diffcore_order(const char *orderfile)
113
0
{
114
0
  struct diff_queue_struct *q = &diff_queued_diff;
115
0
  struct obj_order *o;
116
0
  int i;
117
118
0
  if (!q->nr)
119
0
    return;
120
121
0
  ALLOC_ARRAY(o, q->nr);
122
0
  for (i = 0; i < q->nr; i++)
123
0
    o[i].obj = q->queue[i];
124
0
  order_objects(orderfile, pair_pathtwo, o, q->nr);
125
0
  for (i = 0; i < q->nr; i++)
126
0
    q->queue[i] = o[i].obj;
127
0
  free(o);
128
0
  return;
129
0
}