-
Notifications
You must be signed in to change notification settings - Fork 59
Expand file tree
/
Copy pathtarget.rs
More file actions
414 lines (376 loc) · 13 KB
/
target.rs
File metadata and controls
414 lines (376 loc) · 13 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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
// Copyright (c) 2017-2018 ETH Zurich
// Fabian Schuiki <[email protected]>
//! Target specifications
//!
//! This module implements the boolean expressions that allow source file groups
//! to be only compile under certain target configurations.
#![deny(missing_docs)]
use std;
use std::collections::BTreeSet;
use std::fmt;
use std::str::FromStr;
use indexmap::IndexSet;
use miette::Context as _;
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use crate::{Error, Result};
use crate::{bail, err};
/// A target specification.
#[derive(Clone, Ord, PartialOrd, Eq, PartialEq, Default, Hash)]
pub enum TargetSpec {
/// Matches all targets.
#[default]
Wildcard,
/// A target that must be present.
Name(String),
/// All targets must be present. This is an AND operation.
All(BTreeSet<TargetSpec>),
/// At least one target must be present. This is an OR operation.
Any(BTreeSet<TargetSpec>),
/// Negates a specification. This is a NOT operation.
Not(Box<TargetSpec>),
}
impl fmt::Display for TargetSpec {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match *self {
TargetSpec::Wildcard => write!(f, "*"),
TargetSpec::Name(ref name) => write!(f, "{}", name),
TargetSpec::All(ref specs) => write!(f, "all({})", SpecsWriter(specs.iter())),
TargetSpec::Any(ref specs) => write!(f, "any({})", SpecsWriter(specs.iter())),
TargetSpec::Not(ref spec) => write!(f, "not({})", spec),
}
}
}
struct SpecsWriter<'a, T: Iterator<Item = &'a TargetSpec> + Clone + 'a>(T);
impl<'a, T> fmt::Display for SpecsWriter<'a, T>
where
T: Iterator<Item = &'a TargetSpec> + Clone + 'a,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
use std::iter::{once, repeat};
for (sep, val) in once("").chain(repeat(", ")).zip(self.0.clone()) {
write!(f, "{}{}", sep, val)?;
}
Ok(())
}
}
impl fmt::Debug for TargetSpec {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(self, f)
}
}
impl FromStr for TargetSpec {
type Err = Error;
fn from_str(s: &str) -> std::result::Result<Self, Error> {
let mut iter = s.chars();
let next = iter.next();
let mut lexer = TargetLexer {
inner: iter,
partial: None,
next,
};
parse(&mut lexer).wrap_err_with(|| format!("Syntax error in target specification `{}`.", s))
}
}
impl Serialize for TargetSpec {
fn serialize<S>(&self, serializer: S) -> std::result::Result<S::Ok, S::Error>
where
S: Serializer,
{
format!("{}", self).serialize(serializer)
}
}
impl<'de> Deserialize<'de> for TargetSpec {
fn deserialize<D>(deserializer: D) -> std::result::Result<TargetSpec, D::Error>
where
D: Deserializer<'de>,
{
use serde::de;
let s = String::deserialize(deserializer)?;
TargetSpec::from_str(&s).map_err(de::Error::custom)
}
}
impl TargetSpec {
/// Checks whether this specification matches a set of targets.
pub fn matches(&self, targets: &TargetSet) -> bool {
match *self {
TargetSpec::Wildcard => true,
TargetSpec::Name(ref name) => targets.0.contains(name),
TargetSpec::All(ref specs) => specs.iter().all(|s| s.matches(targets)),
TargetSpec::Any(ref specs) => specs.iter().any(|s| s.matches(targets)),
TargetSpec::Not(ref spec) => !spec.matches(targets),
}
}
/// Check whether this specification is just a wildcard.
pub fn is_wildcard(&self) -> bool {
matches!(*self, TargetSpec::Wildcard)
}
/// Reduce this target specification to its simplest form.
pub fn reduce(&self) -> Self {
match self {
TargetSpec::Wildcard => Self::Wildcard,
TargetSpec::Name(n) => Self::Name(n.clone()),
TargetSpec::All(set) | TargetSpec::Any(set) => {
let set = set
.iter()
.map(|s| s.reduce())
.filter(|s| !matches!(s, Self::Wildcard))
.collect::<BTreeSet<_>>();
match set.len() {
0 => Self::Wildcard,
1 => set.iter().next().unwrap().clone(),
_ => {
if matches!(self, TargetSpec::All(_)) {
Self::All(set)
} else {
Self::Any(set)
}
}
}
}
TargetSpec::Not(t) => Self::Not(Box::new(t.reduce())),
}
}
/// Get list of available targets.
pub fn get_avail(&self) -> IndexSet<String> {
match *self {
TargetSpec::Wildcard => IndexSet::new(),
TargetSpec::Name(ref name) => IndexSet::from([name.clone()]),
TargetSpec::All(ref specs) | TargetSpec::Any(ref specs) => {
specs.iter().flat_map(TargetSpec::get_avail).collect()
}
TargetSpec::Not(ref spec) => spec.get_avail(),
}
}
}
#[derive(Debug, PartialEq, Eq)]
enum TargetToken {
Ident(String),
LParen,
RParen,
Comma,
Any,
All,
Not,
}
struct TargetLexer<T>
where
T: Iterator<Item = char>,
{
inner: T,
partial: Option<String>,
next: Option<char>,
}
impl<T> Iterator for TargetLexer<T>
where
T: Iterator<Item = char>,
{
type Item = Result<TargetToken>;
fn next(&mut self) -> Option<Result<TargetToken>> {
loop {
let next_is_letter = self
.next
.map(|c| c.is_alphanumeric() || c == '.' || c == '_' || c == '-' || c == ':')
.unwrap_or(false);
// Flush if needed.
if !next_is_letter {
let mut partial = None;
std::mem::swap(&mut self.partial, &mut partial);
if let Some(partial) = partial {
if partial == "all" {
return Some(Ok(TargetToken::All));
} else if partial == "any" {
return Some(Ok(TargetToken::Any));
} else if partial == "not" {
return Some(Ok(TargetToken::Not));
} else {
return Some(Ok(TargetToken::Ident(partial)));
}
}
}
// Aggregate if needed.
if next_is_letter {
if self.partial.is_none() {
self.partial = Some(String::new());
}
self.partial
.as_mut()
.unwrap()
.extend(self.next.unwrap().to_lowercase());
self.next = self.inner.next();
continue;
}
// Emit tokens.
let next = self.next;
self.next = self.inner.next();
match next {
Some('(') => return Some(Ok(TargetToken::LParen)),
Some(')') => return Some(Ok(TargetToken::RParen)),
Some(',') => return Some(Ok(TargetToken::Comma)),
Some(c) if c.is_whitespace() => (),
Some(c) => return Some(Err(err!("Invalid character `{}`.", c))),
None => return None,
}
}
}
}
fn parse<T>(lexer: &mut TargetLexer<T>) -> Result<TargetSpec>
where
T: Iterator<Item = char>,
{
Ok(match lexer.next() {
Some(Ok(TargetToken::All)) => TargetSpec::All(parse_paren_list(lexer)?),
Some(Ok(TargetToken::Any)) => TargetSpec::Any(parse_paren_list(lexer)?),
Some(Ok(TargetToken::Not)) => {
parse_require(lexer, TargetToken::LParen, "Expected `(`.")?;
let spec = parse(lexer)?;
parse_require(lexer, TargetToken::RParen, "Expected `)`.")?;
TargetSpec::Not(Box::new(spec))
}
Some(Ok(TargetToken::Ident(name))) => {
if name.contains(':') {
bail!("Targets names cannot contain colons (`:`).");
}
if name.starts_with('-') {
bail!("Target names cannot start with a hyphen (`-`).");
}
TargetSpec::Name(name)
}
Some(Ok(TargetToken::LParen)) => {
let spec = parse(lexer)?;
parse_require(lexer, TargetToken::RParen, "Expected `)`.")?;
spec
}
wrong => return parse_wrong(wrong),
})
}
fn parse_paren_list<T>(lexer: &mut TargetLexer<T>) -> Result<BTreeSet<TargetSpec>>
where
T: Iterator<Item = char>,
{
parse_require(lexer, TargetToken::LParen, "Expected `(`.")?;
let mut set = BTreeSet::new();
set.insert(parse(lexer)?);
loop {
match lexer.next() {
Some(Ok(TargetToken::RParen)) => break,
Some(Ok(TargetToken::Comma)) => (),
wrong => return parse_wrong(wrong),
}
set.insert(parse(lexer)?);
}
Ok(set)
}
fn parse_require<T>(lexer: &mut TargetLexer<T>, token: TargetToken, msg: &str) -> Result<()>
where
T: Iterator<Item = char>,
{
match lexer.next() {
Some(Ok(ref tkn)) if tkn == &token => Ok(()),
Some(Err(e)) => Err(e),
_ => Err(err!("{}", msg)),
}
}
fn parse_wrong<R>(wrong: Option<Result<TargetToken>>) -> Result<R> {
match wrong {
Some(Ok(TargetToken::All)) => Err(err!("Unexpected `all` keyword.")),
Some(Ok(TargetToken::Any)) => Err(err!("Unexpected `any` keyword.")),
Some(Ok(TargetToken::Not)) => Err(err!("Unexpected `not` keyword.")),
Some(Ok(TargetToken::Ident(name))) => Err(err!("Unexpected identifier `{}`.", name)),
Some(Ok(TargetToken::LParen)) => Err(err!("Unexpected `(`.")),
Some(Ok(TargetToken::RParen)) => Err(err!("Unexpected `)`.")),
Some(Ok(TargetToken::Comma)) => Err(err!("Unexpected `,`.")),
Some(Err(e)) => Err(e),
None => Err(err!("Unexpected end of string.")),
}
}
/// A set of targets.
///
/// Target specifications can be matched against a target set. A target set is
/// basically just a collection of strings.
#[derive(Clone, Debug, Serialize, Default)]
pub struct TargetSet(IndexSet<String>);
impl TargetSet {
/// Create an empty target set.
pub fn empty() -> TargetSet {
TargetSet(Default::default())
}
/// Create a target set.
///
/// `targets` can be anything that may be turned into an iterator over
/// something that can be turned into a `&str`.
pub fn new<I>(targets: I) -> TargetSet
where
I: IntoIterator,
I::Item: AsRef<str>,
{
let targets: IndexSet<String> = targets
.into_iter()
.map(|t| t.as_ref().to_lowercase())
.collect();
TargetSet(targets)
}
/// Returns true if the set of targets is empty.
pub fn is_empty(&self) -> bool {
self.0.is_empty()
}
/// Get an iterator over this set.
pub fn iter(&self) -> impl Iterator<Item = &String> {
self.0.iter()
}
/// Insert a target into the set.
pub fn insert(&mut self, target: String) {
self.0.insert(target);
}
/// Reduce target set for a dependency.
pub fn reduce_for_dependency(&self, dep_name: &str) -> TargetSet {
// collect targets relevant to the dependency
let local_targets = TargetSet::new(
self.iter()
.filter_map(|trgt| {
if !trgt.contains(':') {
Some(trgt.clone())
} else {
let parts: Vec<&str> = trgt.splitn(2, ':').collect();
if dep_name == parts[0].to_lowercase().as_str() || parts[0] == "*" {
Some(parts[1].to_string())
} else {
None
}
}
})
.collect::<IndexSet<_>>(),
);
// collect negative targets to be removed
let neg_targets = local_targets
.iter()
.filter_map(|t| t.strip_prefix('-').map(|neg_target| neg_target.to_string()))
.collect::<IndexSet<_>>();
// remove negative targets from all_targets
TargetSet::new(
local_targets
.iter()
.filter_map(|t| {
if t.starts_with('-') || neg_targets.contains(t) {
None
} else {
Some(t.clone())
}
})
.collect::<IndexSet<_>>(),
)
}
}
impl<'a> IntoIterator for &'a TargetSet {
type Item = <&'a IndexSet<String> as IntoIterator>::Item;
type IntoIter = <&'a IndexSet<String> as IntoIterator>::IntoIter;
fn into_iter(self) -> Self::IntoIter {
self.0.iter()
}
}
impl IntoIterator for TargetSet {
type Item = <IndexSet<String> as IntoIterator>::Item;
type IntoIter = <IndexSet<String> as IntoIterator>::IntoIter;
fn into_iter(self) -> Self::IntoIter {
self.0.into_iter()
}
}