macro-template 0.1.0-rc.3

Macro to generate repeated Rust code with table-driven inputs.
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
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
// Copyright 2026 FastLabs Developers
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

use std::cmp::Ordering;
use std::fmt;

use proc_macro2::Ident;
use proc_macro2::Literal;
use proc_macro2::TokenStream;
use proc_macro2::TokenTree;
use quote::ToTokens;
use syn::Error;
use syn::Lit;
use syn::Result;
use syn::Token;
use syn::braced;
use syn::bracketed;
use syn::parenthesized;
use syn::parse::Parse;
use syn::parse::ParseStream;
use syn::punctuated::Punctuated;

#[derive(Clone)]
pub struct Binding {
    var: Ident,
    tokens: TokenStream,
}

impl PartialEq for Binding {
    fn eq(&self, other: &Self) -> bool {
        matches!(self.cmp(other), Ordering::Equal)
    }
}

impl Eq for Binding {}

impl PartialOrd for Binding {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for Binding {
    fn cmp(&self, other: &Self) -> Ordering {
        self.var.cmp(&other.var)
    }
}

pub fn substitute(ident: Ident, bindings: &[Binding]) -> TokenStream {
    if let Ok(index) = bindings.binary_search_by(|b| b.var.cmp(&ident)) {
        bindings[index].tokens.clone()
    } else {
        TokenTree::Ident(ident).into_token_stream()
    }
}

pub struct Template {
    table: Table,
    template: TokenStream,
}

impl Template {
    pub fn into_parts(self) -> (Table, TokenStream) {
        (self.table, self.template)
    }
}

impl Parse for Template {
    fn parse(input: ParseStream<'_>) -> Result<Self> {
        let mut tables = vec![];
        let mut vars = Vars { idents: vec![] };

        loop {
            let clause = input.parse::<ForClause>()?;
            vars.extend(clause.vars)?;
            tables.push(clause.table);

            if !input.peek(Token![,]) {
                break;
            }

            input.parse::<Token![,]>()?;
            if input.peek(Token![for]) {
                continue;
            }

            if input.peek(syn::token::Brace) {
                break;
            } else {
                return Err(input.error("expected another input clause after comma"));
            }
        }

        let table = tables
            .into_iter()
            .reduce(|acc, clause| acc.join(clause))
            .expect("template must have at least one input clause");

        let template;
        braced!(template in input);
        let template = template.parse::<TokenStream>()?;

        if !input.is_empty() {
            return Err(input.error("unexpected tokens after template body"));
        }
        Ok(Self { table, template })
    }
}

pub struct Table {
    bindings: Vec<Binding>,
    num_rows: usize,
    num_cols: usize,
}

impl Table {
    pub fn rows(&self) -> RowsIter<'_> {
        RowsIter {
            table: self,
            row: 0,
        }
    }
}

impl Table {
    fn new(num_cols: usize) -> Self {
        Self {
            bindings: vec![],
            num_rows: 0,
            num_cols,
        }
    }

    fn is_empty(&self) -> bool {
        self.num_rows == 0
    }

    fn add_row(&mut self, vars: &Vars, values: Vec<TokenStream>) -> Result<()> {
        debug_assert_eq!(self.num_cols, vars.len());

        let expected = self.num_cols;
        let found = values.len();
        if expected != found {
            let mut error = Error::new_spanned(
                TokenStream::from_iter(values),
                format!(
                    "this row provides {} value{}",
                    found,
                    if found > 1 { "s" } else { "" }
                ),
            );
            error.combine(Error::new_spanned(
                vars,
                format!(
                    "template variables `{}` require {} row value{}",
                    vars,
                    expected,
                    if expected > 1 { "s" } else { "" }
                ),
            ));
            return Err(error);
        }

        let row_start = self.bindings.len();
        self.bindings.extend(
            vars.iter()
                .cloned()
                .zip(values)
                .map(|(var, tokens)| Binding { var, tokens }),
        );
        self.bindings[row_start..].sort();
        self.num_rows += 1;

        debug_assert_eq!(self.bindings.len(), self.num_rows * self.num_cols);
        Ok(())
    }

    fn join(self, other: Self) -> Self {
        let num_cols = self.num_cols + other.num_cols;
        let num_rows = self.num_rows * other.num_rows;
        if num_rows == 0 {
            return Self::new(num_cols);
        }

        if num_rows == 1 {
            let mut bindings = self.bindings;
            bindings.extend(other.bindings);
            bindings.sort();

            let table = Self {
                bindings,
                num_rows,
                num_cols,
            };
            return table;
        }

        let mut bindings = Vec::with_capacity(num_rows * num_cols);
        for left in self.rows() {
            for right in other.rows() {
                let row_start = bindings.len();
                bindings.extend(left.to_vec());
                bindings.extend(right.to_vec());
                bindings[row_start..].sort();
            }
        }

        debug_assert_eq!(bindings.len(), num_rows * num_cols);
        Self {
            bindings,
            num_rows,
            num_cols,
        }
    }

    fn row(&self, row: usize) -> &[Binding] {
        let start = row * self.num_cols;
        let end = start + self.num_cols;
        &self.bindings[start..end]
    }
}

pub struct RowsIter<'a> {
    table: &'a Table,
    row: usize,
}

impl<'a> Iterator for RowsIter<'a> {
    type Item = &'a [Binding];

    fn next(&mut self) -> Option<Self::Item> {
        if self.row < self.table.num_rows {
            let row = self.table.row(self.row);
            self.row += 1;
            Some(row)
        } else {
            None
        }
    }
}

struct Vars {
    idents: Vec<Ident>,
}

impl Vars {
    fn len(&self) -> usize {
        self.idents.len()
    }

    fn iter(&self) -> std::slice::Iter<'_, Ident> {
        self.idents.iter()
    }

    fn push(&mut self, ident: Ident) -> Result<()> {
        if self.idents.iter().any(|previous| previous == &ident) {
            return Err(Error::new_spanned(ident, "duplicate template variable"));
        }

        self.idents.push(ident);
        Ok(())
    }

    fn extend(&mut self, vars: Self) -> Result<()> {
        for ident in &vars.idents {
            if let Some(previous) = self.idents.iter().find(|previous| *previous == ident) {
                let mut error = Error::new_spanned(
                    ident,
                    format!("the template variable `{ident}` duplicates an earlier one"),
                );
                error.combine(Error::new_spanned(
                    previous,
                    format!("an earlier template variable `{previous}` declared here"),
                ));
                return Err(error);
            }
        }

        self.idents.extend(vars.idents);
        Ok(())
    }
}

impl fmt::Display for Vars {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self.idents.as_slice() {
            [ident] => write!(f, "{}", ident),
            idents => {
                write!(f, "(")?;
                for (i, ident) in idents.iter().enumerate() {
                    if i != 0 {
                        f.write_str(", ")?;
                    }
                    write!(f, "{}", ident)?;
                }
                write!(f, ")")
            }
        }
    }
}

impl ToTokens for Vars {
    fn to_tokens(&self, tokens: &mut TokenStream) {
        tokens.extend(self.idents.iter().cloned());
    }
}

impl Parse for Vars {
    fn parse(input: ParseStream<'_>) -> Result<Self> {
        let mut vars = Self { idents: vec![] };

        if input.peek(syn::token::Paren) {
            let content;
            let paren_token = parenthesized!(content in input);
            let idents = Punctuated::<Ident, Token![,]>::parse_terminated(&content)?;
            if idents.is_empty() {
                return Err(Error::new(
                    paren_token.span.join(),
                    "expected at least one template variable",
                ));
            }

            for ident in idents {
                vars.push(ident)?;
            }
        } else if let Ok(ident) = input.parse::<Ident>() {
            vars.push(ident)?;
        } else {
            return Err(input
                .error("multiple template variables must use parentheses, such as `(Ty, Width)`"));
        };

        Ok(vars)
    }
}

struct ForClause {
    vars: Vars,
    table: Table,
}

impl Parse for ForClause {
    fn parse(input: ParseStream<'_>) -> Result<Self> {
        input.parse::<Token![for]>()?;
        let vars = input.parse::<Vars>()?;
        input.parse::<Token![in]>()?;
        let table = if input.peek(syn::token::Bracket) {
            parse_rows(input, &vars)?
        } else {
            parse_range_rows(input, &vars)?
        };
        Ok(Self { vars, table })
    }
}

fn parse_range_rows(input: ParseStream<'_>, vars: &Vars) -> Result<Table> {
    if vars.len() != 1 {
        return Err(Error::new_spanned(
            vars,
            "range inputs require exactly one template variable",
        ));
    }

    let range = input.parse::<RangeInput>()?;
    let values = range.values();
    let mut table = Table::new(vars.len());
    for value in values {
        table.add_row(vars, vec![value])?;
    }

    if table.is_empty() {
        return Err(Error::new_spanned(
            range.tokens,
            "range input must contain at least one value",
        ));
    }

    Ok(table)
}

fn parse_rows(input: ParseStream<'_>, vars: &Vars) -> Result<Table> {
    let rows;
    let bracket_token = bracketed!(rows in input);

    let mut table = Table::new(vars.len());
    while !rows.is_empty() {
        let values = parse_row(&rows, vars)?;
        table.add_row(vars, values)?;
        if rows.is_empty() {
            break;
        }
        rows.parse::<Token![,]>()?;
    }

    if table.is_empty() {
        return Err(Error::new(
            bracket_token.span.join(),
            "input list must contain at least one row",
        ));
    }

    Ok(table)
}

fn parse_row(input: ParseStream<'_>, vars: &Vars) -> Result<Vec<TokenStream>> {
    debug_assert!(vars.len() > 0);

    if vars.len() == 1 {
        return Ok(vec![parse_cell(input)?]);
    }

    if !input.peek(syn::token::Paren) {
        return Err(input.error(
            "rows for multiple template variables must use parentheses, such as `(u16, 2)`",
        ));
    }

    let row;
    parenthesized!(row in input);
    parse_cells(&row)
}

fn parse_cells(input: ParseStream<'_>) -> Result<Vec<TokenStream>> {
    let mut cells = vec![];
    while !input.is_empty() {
        cells.push(parse_cell(input)?);
        if input.is_empty() {
            break;
        }
        input.parse::<Token![,]>()?;
    }
    Ok(cells)
}

fn parse_cell(input: ParseStream<'_>) -> Result<TokenStream> {
    let mut tokens = vec![];
    while !input.is_empty() {
        if input.peek(Token![,]) {
            break;
        }
        tokens.push(input.parse::<TokenTree>()?);
    }

    if tokens.is_empty() {
        return Err(input.error("expected row value tokens"));
    }

    Ok(tokens.into_iter().collect())
}

struct RangeInput {
    start: u64,
    end: u64,
    inclusive: bool,
    kind: RangeKind,
    suffix: String,
    width: usize,
    radix: RangeRadix,
    tokens: TokenStream,
}

impl RangeInput {
    fn values(&self) -> Vec<TokenStream> {
        if self.start > self.end || (!self.inclusive && self.start == self.end) {
            vec![]
        } else if self.inclusive {
            (self.start..=self.end)
                .filter_map(|v| self.value_to_tokens(v))
                .collect()
        } else {
            (self.start..self.end)
                .filter_map(|v| self.value_to_tokens(v))
                .collect()
        }
    }

    fn value_to_tokens(&self, value: u64) -> Option<TokenStream> {
        match self.kind {
            RangeKind::Integer => {
                let width = self.width;
                let repr = match self.radix {
                    RangeRadix::Binary => format!("0b{:0width$b}{}", value, self.suffix),
                    RangeRadix::Octal => format!("0o{:0width$o}{}", value, self.suffix),
                    RangeRadix::Decimal => format!("{:0width$}{}", value, self.suffix),
                    RangeRadix::LowerHex => format!("0x{:0width$x}{}", value, self.suffix),
                    RangeRadix::UpperHex => format!("0x{:0width$X}{}", value, self.suffix),
                };
                Some(repr.parse().expect("generated range literal should parse"))
            }
            RangeKind::Byte => u8::try_from(value)
                .ok()
                .map(|value| Literal::byte_character(value).into_token_stream()),
            RangeKind::Character => u32::try_from(value)
                .ok()
                .and_then(char::from_u32)
                .map(|value| Literal::character(value).into_token_stream()),
        }
    }
}

impl Parse for RangeInput {
    fn parse(input: ParseStream<'_>) -> Result<Self> {
        let start = input.parse::<RangeBound>()?;
        let (inclusive, operator) = if input.peek(Token![..=]) {
            (true, input.parse::<Token![..=]>()?.into_token_stream())
        } else {
            (false, input.parse::<Token![..]>()?.into_token_stream())
        };
        let end = input.parse::<RangeBound>()?;

        let tokens = TokenStream::from_iter([start.tokens.clone(), operator, end.tokens.clone()]);
        if start.kind != end.kind {
            return Err(Error::new_spanned(
                TokenStream::from_iter([start.tokens, end.tokens]),
                "range bounds must both be integer literals, both byte literals, or both character literals",
            ));
        }

        let suffix = if start.suffix.is_empty() {
            end.suffix
        } else if end.suffix.is_empty() || start.suffix == end.suffix {
            start.suffix
        } else {
            return Err(Error::new_spanned(
                end.tokens,
                "range bounds must use the same integer suffix",
            ));
        };

        let radix = if start.radix == end.radix {
            start.radix
        } else if matches!(
            (start.radix, end.radix),
            (RangeRadix::LowerHex, RangeRadix::UpperHex)
                | (RangeRadix::UpperHex, RangeRadix::LowerHex)
        ) {
            RangeRadix::UpperHex
        } else {
            return Err(Error::new_spanned(
                end.tokens,
                "range bounds must use the same integer radix",
            ));
        };

        Ok(Self {
            start: start.value,
            end: end.value,
            inclusive,
            kind: start.kind,
            suffix,
            width: start.width.min(end.width),
            radix,
            tokens,
        })
    }
}

struct RangeBound {
    value: u64,
    kind: RangeKind,
    suffix: String,
    width: usize,
    radix: RangeRadix,
    tokens: TokenStream,
}

impl Parse for RangeBound {
    fn parse(input: ParseStream<'_>) -> Result<Self> {
        let literal = input.parse::<Lit>()?;
        let tokens = literal.clone().into_token_stream();

        match literal {
            Lit::Int(value) => parse_integer_bound(value),
            Lit::Byte(value) => Ok(Self {
                value: u64::from(value.value()),
                kind: RangeKind::Byte,
                suffix: String::new(),
                width: 0,
                radix: RangeRadix::Decimal,
                tokens,
            }),
            Lit::Char(value) => Ok(Self {
                value: u64::from(u32::from(value.value())),
                kind: RangeKind::Character,
                suffix: String::new(),
                width: 0,
                radix: RangeRadix::Decimal,
                tokens,
            }),
            _ => Err(Error::new_spanned(
                tokens,
                "range bounds must be integer, byte, or character literals",
            )),
        }
    }
}

#[derive(Clone, Copy, PartialEq, Eq)]
enum RangeKind {
    Integer,
    Byte,
    Character,
}

#[derive(Clone, Copy, PartialEq, Eq)]
enum RangeRadix {
    Binary,
    Octal,
    Decimal,
    LowerHex,
    UpperHex,
}

fn parse_integer_bound(value: syn::LitInt) -> Result<RangeBound> {
    let tokens = value.clone().into_token_stream();
    let repr = value.to_string();

    let (mut radix, base, digits_start) = if repr.starts_with("0b") {
        (RangeRadix::Binary, 2, 2)
    } else if repr.starts_with("0o") {
        (RangeRadix::Octal, 8, 2)
    } else if repr.starts_with("0x") {
        (RangeRadix::LowerHex, 16, 2)
    } else if repr.starts_with("0X") {
        (RangeRadix::UpperHex, 16, 2)
    } else {
        (RangeRadix::Decimal, 10, 0)
    };

    let body = &repr[digits_start..];
    let mut digits = String::new();
    let mut suffix = String::new();

    for (offset, ch) in body.char_indices() {
        match ch {
            '_' => {}
            '0'..='9' => digits.push(ch),
            'A'..='F' if radix == RangeRadix::LowerHex => {
                digits.push(ch);
                radix = RangeRadix::UpperHex;
            }
            'a'..='f' | 'A'..='F' if base == 16 => digits.push(ch),
            _ => {
                if digits.is_empty() {
                    return Err(Error::new_spanned(tokens, "expected integer range bound"));
                }
                suffix = repr[digits_start + offset..].to_owned();
                break;
            }
        }
    }

    if digits.is_empty() {
        return Err(Error::new_spanned(tokens, "expected integer range bound"));
    }

    let parsed = match u64::from_str_radix(&digits, base) {
        Ok(parsed) => parsed,
        Err(_) => {
            return Err(Error::new_spanned(
                tokens,
                "integer range bounds must fit in u64",
            ));
        }
    };

    Ok(RangeBound {
        value: parsed,
        kind: RangeKind::Integer,
        suffix,
        width: digits.len(),
        radix,
        tokens,
    })
}