-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathUnboundList.qll
More file actions
153 lines (126 loc) · 4.63 KB
/
UnboundList.qll
File metadata and controls
153 lines (126 loc) · 4.63 KB
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/**
* Provides logic for representing unbound lists.
*
* The lists are represented internally as strings, and generally it should
* be preferred to instead use a `newtype` representation, but in certain
* cases where this is not feasible (typically because of performance) unbound
* lists can be used.
*/
overlay[local?]
module;
private import Location
/** Provides the input to `Make`. */
signature module InputSig<LocationSig Location> {
/** An element. */
class Element {
/** Gets a textual representation of this element. */
string toString();
/** Gets the location of this element. */
Location getLocation();
}
/** Gets a unique ID used to identify element `e` amongst all elements. */
int getId(Element e);
/**
* Gets a textual representation for element `e`, which will be used in the
* `toString` representation for unbound lists.
*/
default string getElementString(Element e) { result = e.toString() }
/** Gets an optional length limit for unbound lists. */
default int getLengthLimit() { none() }
}
final private class String = string;
/** Provides the `UnboundList` implementation. */
module Make<LocationSig Location, InputSig<Location> Input> {
private import Input
private import codeql.util.DenseRank
// Use dense ranking to assign compact IDs to elements
private module DenseRankInput implements DenseRankInputSig {
class Ranked = Element;
predicate getRank = getId/1;
}
/** Gets the rank of element `e`, which is used internally in the string encoding. */
int getRank(Element e) { e = DenseRank<DenseRankInput>::denseRank(result) }
private string encode(Element e) { result = getRank(e).toString() }
bindingset[s]
private Element decode(string s) { encode(result) = s }
/**
* An unbound list encoded as a string.
*/
class UnboundList extends String {
bindingset[this]
UnboundList() { exists(this) }
/** Gets the `i`th element in this list. */
bindingset[this]
Element getElement(int i) { result = decode(this.splitAt(".", i)) }
/** Gets a textual representation of this list. */
bindingset[this]
string toString() {
result =
concat(int i, Element e | e = this.getElement(i) | getElementString(e), "." order by i)
}
/** Holds if this list is empty. */
predicate isEmpty() { this = "" }
/** Gets the length of this list. */
bindingset[this]
pragma[inline_late]
int length() {
// Same as
// `result = count(this.indexOf("."))`
// but performs better because it doesn't use an aggregate
result = this.regexpReplaceAll("[0-9]+", "").length()
}
/** Gets the list obtained by appending `suffix` onto this list. */
bindingset[this, suffix]
UnboundList append(UnboundList suffix) {
result = this + suffix and
(
not exists(getLengthLimit())
or
result.length() <= getLengthLimit()
)
}
/**
* Gets the list obtained by appending `suffix` onto this list.
*
* Unlike `append`, this predicate has `result` in the binding set,
* so there is no need to check the length of `result`.
*/
bindingset[this, result]
UnboundList appendInverse(UnboundList suffix) { suffix = result.stripPrefix(this) }
/** Gets the list obtained by removing `prefix` from this list. */
bindingset[this, prefix]
UnboundList stripPrefix(UnboundList prefix) { this = prefix + result }
/** Holds if this list starts with `e`, followed by `suffix`. */
bindingset[this]
predicate isCons(Element e, UnboundList suffix) {
exists(string regexp | regexp = "([0-9]+)\\.(.*)" |
e = decode(this.regexpCapture(regexp, 1)) and
suffix = this.regexpCapture(regexp, 2)
)
}
/** Holds if this list starts with `prefix`, followed by `e`. */
bindingset[this]
predicate isSnoc(UnboundList prefix, Element e) {
exists(string regexp | regexp = "(|.+\\.)([0-9]+)\\." |
prefix = this.regexpCapture(regexp, 1) and
e = decode(this.regexpCapture(regexp, 2))
)
}
/** Gets the head of this list, if any. */
bindingset[this]
Element getHead() { result = this.getElement(0) }
}
/** Provides predicates for constructing `UnboundList`s. */
module UnboundList {
/** Gets the empty list. */
UnboundList nil() { result.isEmpty() }
/** Gets the singleton list `e`. */
UnboundList singleton(Element e) { result = encode(e) + "." }
/**
* Gets the list obtained by appending the singleton list `e`
* onto `suffix`.
*/
bindingset[suffix]
UnboundList cons(Element e, UnboundList suffix) { result = singleton(e).append(suffix) }
}
}