1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*
* Copyright (c) 2017 Elise Lennion <elise.lennion@gmail.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*/
#include <stdint.h>
#include <expression.h>
#include <gmputil.h>
#include <list.h>
static void expr_msort_value(const struct expr *expr, mpz_t value);
static void concat_expr_msort_value(const struct expr *expr, mpz_t value)
{
unsigned int len = 0, ilen;
const struct expr *i;
char data[512];
list_for_each_entry(i, &expr->expressions, list) {
ilen = div_round_up(i->len, BITS_PER_BYTE);
mpz_export_data(data + len, i->value, i->byteorder, ilen);
len += ilen;
}
mpz_import_data(value, data, BYTEORDER_HOST_ENDIAN, len);
}
static void expr_msort_value(const struct expr *expr, mpz_t value)
{
switch (expr->etype) {
case EXPR_SET_ELEM:
expr_msort_value(expr->key, value);
break;
case EXPR_BINOP:
case EXPR_MAPPING:
expr_msort_value(expr->left, value);
break;
case EXPR_VALUE:
mpz_set(value, expr->value);
break;
case EXPR_CONCAT:
concat_expr_msort_value(expr, value);
break;
case EXPR_SET_ELEM_CATCHALL:
/* max value to ensure listing shows it in the last position */
mpz_bitmask(value, expr->len);
break;
default:
BUG("Unknown expression %s\n", expr_name(expr));
}
}
static int expr_msort_cmp(const struct expr *e1, const struct expr *e2)
{
mpz_t value1, value2;
int ret;
mpz_init(value1);
mpz_init(value2);
expr_msort_value(e1, value1);
expr_msort_value(e2, value2);
ret = mpz_cmp(value1, value2);
mpz_clear(value1);
mpz_clear(value2);
return ret;
}
static void list_splice_sorted(struct list_head *list, struct list_head *head)
{
struct list_head *h = head->next;
struct list_head *l = list->next;
while (l != list) {
if (h == head ||
expr_msort_cmp(list_entry(l, typeof(struct expr), list),
list_entry(h, typeof(struct expr), list)) < 0) {
l = l->next;
list_add_tail(l->prev, h);
continue;
}
h = h->next;
}
}
static void list_cut_middle(struct list_head *list, struct list_head *head)
{
struct list_head *s = head->next;
struct list_head *e = head->prev;
while (e != s) {
e = e->prev;
if (e != s)
s = s->next;
}
__list_cut_position(list, head, s);
}
void list_expr_sort(struct list_head *head)
{
struct list_head *list;
LIST_HEAD(temp);
list = &temp;
if (list_empty(head) || list_is_singular(head))
return;
list_cut_middle(list, head);
list_expr_sort(head);
list_expr_sort(list);
list_splice_sorted(list, head);
}
|
