-
-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathitem.rs
439 lines (397 loc) · 16.4 KB
/
item.rs
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
use std::{collections::BTreeMap, marker::PhantomData, ops::Deref};
use quote::format_ident;
use syn::{spanned::Spanned, Attribute, Ident, Path, Type};
use crate::{
attrs::common::{ContainerAttributes, ItemAttributes, ValidateVersions},
codegen::{
chain::Neighbors,
common::{ContainerVersion, VersionChain},
},
};
/// This trait describes versioned container items, fields and variants in a
/// common way.
///
/// Shared functionality is implemented in a single place. Code which cannot be
/// shared is implemented on the wrapping type, like [`VersionedField`][1].
///
/// [1]: crate::codegen::vstruct::field::VersionedField
pub(crate) trait Item<I, A>: Sized
where
A: for<'i> TryFrom<&'i I> + Attributes,
I: InnerItem,
{
/// Creates a new versioned item (struct field or enum variant) by consuming
/// the parsed [Field](syn::Field) or [Variant](syn::Variant) and validating
/// the versions of field actions against versions attached on the container.
fn new(item: I, container_attrs: &ContainerAttributes) -> syn::Result<Self>;
/// Inserts container versions not yet present in the status chain.
///
/// When initially creating a new versioned item, the code doesn't have
/// access to the versions defined on the container. This function inserts
/// all non-present container versions and decides which status and ident
/// is the right fit based on the status neighbors.
///
/// This continuous chain ensures that when generating code (tokens), each
/// field can lookup the status (and ident) for a requested version.
fn insert_container_versions(&mut self, versions: &[ContainerVersion]);
/// Returns the ident of the item based on the provided container version.
fn get_ident(&self, version: &ContainerVersion) -> Option<&Ident>;
}
pub(crate) trait InnerItem: Named + Spanned {
fn ty(&self) -> Type;
}
/// This trait enables access to the ident of named items, like fields and
/// variants.
///
/// It additionally provides a function to retrieve the cleaned ident, which
/// removes the deprecation prefixes.
pub(crate) trait Named {
fn cleaned_ident(&self) -> Ident;
fn ident(&self) -> &Ident;
}
/// This trait enables access to the common and original attributes across field
/// and variant attributes.
pub(crate) trait Attributes {
/// The common attributes defined by the versioned macro.
fn common_attributes_owned(self) -> ItemAttributes;
/// The common attributes defined by the versioned macro.
fn common_attributes(&self) -> &ItemAttributes;
/// The attributes applied to the item outside of the versioned macro.
fn original_attributes(&self) -> &Vec<Attribute>;
}
/// This struct combines common code for versioned fields and variants.
///
/// Most of the initial creation of a versioned field and variant are identical.
/// Currently, the following steps are unified:
///
/// - Initial creation of the action chain based on item attributes.
/// - Insertion of container versions into the chain.
///
/// The generic type parameter `I` describes the type of the versioned item,
/// usually [`Field`](syn::Field) or [`Variant`](syn::Variant). The parameter
/// `A` indicates the type of item attributes, usually [`FieldAttributes`][1] or
/// [`VariantAttributes`][2] depending on the used item type. As this type is
/// only needed during creation of [`Self`](VersionedItem), we must use a
/// [`PhantomData`] marker.
///
/// [1]: crate::attrs::field::FieldAttributes
/// [2]: crate::attrs::variant::VariantAttributes
#[derive(Debug)]
pub(crate) struct VersionedItem<I, A>
where
A: for<'i> TryFrom<&'i I> + Attributes,
I: InnerItem,
{
pub(crate) original_attributes: Vec<Attribute>,
pub(crate) chain: Option<VersionChain>,
pub(crate) inner: I,
_marker: PhantomData<A>,
}
impl<I, A> Item<I, A> for VersionedItem<I, A>
where
syn::Error: for<'i> From<<A as TryFrom<&'i I>>::Error>,
A: for<'i> TryFrom<&'i I> + Attributes + ValidateVersions<I>,
I: InnerItem,
{
fn new(item: I, container_attrs: &ContainerAttributes) -> syn::Result<Self> {
// We use the TryFrom trait here, because the type parameter `A` can use
// it as a trait bound. Internally this then calls either `from_field`
// for field attributes or `from_variant` for variant attributes. Sadly
// darling doesn't provide a "generic" trait which abstracts over the
// different `from_` functions.
let attrs = A::try_from(&item)?;
attrs.validate_versions(container_attrs, &item)?;
// These are the attributes added to the item outside of the macro.
let original_attributes = attrs.original_attributes().clone();
// These are the versioned macro attrs that are common to all items.
let common_attributes = attrs.common_attributes_owned();
// Constructing the action chain requires going through the actions
// starting at the end, because the container definition always
// represents the latest (most up-to-date) version of that struct.
// That's why the following code needs to go through the actions in
// reverse order, as otherwise it is impossible to extract the item
// ident for each version.
// Deprecating an item is always the last state an item can end up in.
// For items which are not deprecated, the last change is either the
// latest change or addition, which is handled below. The ident of the
// deprecated item is guaranteed to include the 'deprecated_' or
// 'DEPRECATED_' prefix. The ident can thus be used as is.
if let Some(deprecated) = common_attributes.deprecated {
let deprecated_ident = item.ident();
// When the item is deprecated, any change which occurred beforehand
// requires access to the item ident to infer the item ident for
// the latest change.
let mut ident = item.cleaned_ident();
let mut ty = item.ty();
let mut actions = BTreeMap::new();
actions.insert(
*deprecated.since,
ItemStatus::Deprecation {
previous_ident: ident.clone(),
ident: deprecated_ident.clone(),
note: deprecated.note.as_deref().cloned(),
},
);
for change in common_attributes.changes.iter().rev() {
let from_ident = if let Some(from) = change.from_name.as_deref() {
format_ident!("{from}")
} else {
ident.clone()
};
// TODO (@Techassi): This is an awful lot of cloning, can we get
// rid of it?
let from_ty = change
.from_type
.as_ref()
.map(|sv| sv.deref().clone())
.unwrap_or(ty.clone());
actions.insert(
*change.since,
ItemStatus::Change {
from_ident: from_ident.clone(),
to_ident: ident,
from_type: from_ty.clone(),
to_type: ty,
},
);
ident = from_ident;
ty = from_ty;
}
// After the last iteration above (if any) we use the ident for the
// added action if there is any.
if let Some(added) = common_attributes.added {
actions.insert(
*added.since,
ItemStatus::Addition {
default_fn: added.default_fn.deref().clone(),
ident,
ty,
},
);
}
Ok(Self {
_marker: PhantomData,
chain: Some(actions),
original_attributes,
inner: item,
})
} else if !common_attributes.changes.is_empty() {
let mut ident = item.ident().clone();
let mut ty = item.ty();
let mut actions = BTreeMap::new();
for change in common_attributes.changes.iter().rev() {
let from_ident = if let Some(from) = change.from_name.as_deref() {
format_ident!("{from}")
} else {
ident.clone()
};
// TODO (@Techassi): This is an awful lot of cloning, can we get
// rid of it?
let from_ty = change
.from_type
.as_ref()
.map(|sv| sv.deref().clone())
.unwrap_or(ty.clone());
actions.insert(
*change.since,
ItemStatus::Change {
from_ident: from_ident.clone(),
to_ident: ident,
from_type: from_ty.clone(),
to_type: ty,
},
);
ident = from_ident;
ty = from_ty;
}
// After the last iteration above (if any) we use the ident for the
// added action if there is any.
if let Some(added) = common_attributes.added {
actions.insert(
*added.since,
ItemStatus::Addition {
default_fn: added.default_fn.deref().clone(),
ident,
ty,
},
);
}
Ok(Self {
_marker: PhantomData,
chain: Some(actions),
original_attributes,
inner: item,
})
} else {
if let Some(added) = common_attributes.added {
let mut actions = BTreeMap::new();
actions.insert(
*added.since,
ItemStatus::Addition {
default_fn: added.default_fn.deref().clone(),
ident: item.ident().clone(),
ty: item.ty(),
},
);
return Ok(Self {
_marker: PhantomData,
chain: Some(actions),
original_attributes,
inner: item,
});
}
Ok(Self {
_marker: PhantomData,
original_attributes,
chain: None,
inner: item,
})
}
}
fn insert_container_versions(&mut self, versions: &[ContainerVersion]) {
if let Some(chain) = &mut self.chain {
for version in versions {
if chain.contains_key(&version.inner) {
continue;
}
match chain.get_neighbors(&version.inner) {
(None, Some(status)) => match status {
ItemStatus::Addition { .. } => {
chain.insert(version.inner, ItemStatus::NotPresent)
}
ItemStatus::Change {
from_ident,
from_type,
..
} => chain.insert(
version.inner,
ItemStatus::NoChange {
previously_deprecated: false,
ident: from_ident.clone(),
ty: from_type.clone(),
},
),
ItemStatus::Deprecation { previous_ident, .. } => chain.insert(
version.inner,
ItemStatus::NoChange {
previously_deprecated: false,
ident: previous_ident.clone(),
ty: self.inner.ty(),
},
),
ItemStatus::NoChange {
previously_deprecated,
ident,
ty,
} => chain.insert(
version.inner,
ItemStatus::NoChange {
previously_deprecated: *previously_deprecated,
ident: ident.clone(),
ty: ty.clone(),
},
),
ItemStatus::NotPresent => unreachable!(),
},
(Some(status), None) => {
let (ident, ty, previously_deprecated) = match status {
ItemStatus::Addition { ident, ty, .. } => (ident, ty, false),
ItemStatus::Change {
to_ident, to_type, ..
} => (to_ident, to_type, false),
ItemStatus::Deprecation { ident, .. } => {
(ident, &self.inner.ty(), true)
}
ItemStatus::NoChange {
previously_deprecated,
ident,
ty,
..
} => (ident, ty, *previously_deprecated),
ItemStatus::NotPresent => unreachable!(),
};
chain.insert(
version.inner,
ItemStatus::NoChange {
previously_deprecated,
ident: ident.clone(),
ty: ty.clone(),
},
)
}
(Some(status), Some(_)) => {
let (ident, ty, previously_deprecated) = match status {
ItemStatus::Addition { ident, ty, .. } => (ident, ty, false),
ItemStatus::Change {
to_ident, to_type, ..
} => (to_ident, to_type, false),
ItemStatus::NoChange {
previously_deprecated,
ident,
ty,
..
} => (ident, ty, *previously_deprecated),
_ => unreachable!(),
};
chain.insert(
version.inner,
ItemStatus::NoChange {
previously_deprecated,
ident: ident.clone(),
ty: ty.clone(),
},
)
}
_ => unreachable!(),
};
}
}
}
fn get_ident(&self, version: &ContainerVersion) -> Option<&Ident> {
match &self.chain {
Some(chain) => chain
.get(&version.inner)
.expect("internal error: chain must contain container version")
.get_ident(),
None => Some(self.inner.ident()),
}
}
}
#[derive(Debug, PartialEq)]
pub(crate) enum ItemStatus {
Addition {
ident: Ident,
default_fn: Path,
// NOTE (@Techassi): We need to carry idents and type information in
// nearly every status. Ideally, we would store this in separate maps.
ty: Type,
},
Change {
from_ident: Ident,
to_ident: Ident,
from_type: Type,
to_type: Type,
},
Deprecation {
previous_ident: Ident,
note: Option<String>,
ident: Ident,
},
NoChange {
previously_deprecated: bool,
ident: Ident,
ty: Type,
},
NotPresent,
}
impl ItemStatus {
pub(crate) fn get_ident(&self) -> Option<&Ident> {
match &self {
ItemStatus::Addition { ident, .. } => Some(ident),
ItemStatus::Change { to_ident, .. } => Some(to_ident),
ItemStatus::Deprecation { ident, .. } => Some(ident),
ItemStatus::NoChange { ident, .. } => Some(ident),
ItemStatus::NotPresent => None,
}
}
}