1
//! Parsing implementation for networkstatus documents.
2
//!
3
//! In Tor, a networkstatus documents describes a complete view of the
4
//! relays in the network: how many there are, how to contact them,
5
//! and so forth.
6
//!
7
//! A networkstatus document can either be a "votes" -- an authority's
8
//! view of the network, used as input to the voting process -- or a
9
//! "consensus" -- a combined view of the network based on multiple
10
//! authorities' votes, and signed by multiple authorities.
11
//!
12
//! A consensus document can itself come in two different flavors: a
13
//! plain (unflavoured) consensus has references to router descriptors, and
14
//! a "microdesc"-flavored consensus ("md") has references to
15
//! microdescriptors.
16
//!
17
//! To keep an up-to-date view of the network, clients download
18
//! microdescriptor-flavored consensuses periodically, and then
19
//! download whatever microdescriptors the consensus lists that the
20
//! client doesn't already have.
21
//!
22
//! For full information about the network status format, see
23
//! [dir-spec.txt](https://spec.torproject.org/dir-spec).
24
//!
25
//! # Limitations
26
//!
27
//! NOTE: The consensus format has changes time, using a
28
//! "consensus-method" mechanism.  This module is does not yet handle all
29
//! all historical consensus-methods.
30
//!
31
//! NOTE: This module _does_ parse some fields that are not in current
32
//! use, like relay nicknames, and the "published" times on
33
//! microdescriptors. We should probably decide whether we actually
34
//! want to do this.
35
//!
36
//! TODO: This module doesn't implement vote parsing at all yet.
37
//!
38
//! TODO: This module doesn't implement plain consensuses.
39
//!
40
//! TODO: We need an object safe trait that combines the common operations found
41
//! on netstatus documents, so we can store one in a `Box<dyn CommonNs>` or
42
//! something similar; otherwise interfacing applications have a hard time to
43
//! process netstatus documents in a flavor agnostic fashion.
44
//!
45
//! TODO: More testing is needed!
46
//!
47
//! TODO: There should be accessor functions for most of the fields here.
48
//! As with the other tor-netdoc types, I'm deferring those till I know what
49
//! they should be.
50

            
51
mod dir_source;
52
mod rs;
53

            
54
pub mod md;
55
pub mod plain;
56
#[cfg(feature = "incomplete")]
57
pub mod vote;
58

            
59
#[cfg(feature = "build_docs")]
60
mod build;
61

            
62
pub use proto_statuses_parse2_encode::ProtoStatusesNetdocParseAccumulator;
63

            
64
#[cfg(feature = "incomplete")]
65
use crate::doc::authcert::EncodedAuthCert;
66

            
67
use crate::doc::authcert::{self, AuthCert, AuthCertKeyIds};
68
use crate::encode::{
69
    EncodeOrd, ItemArgument, ItemEncoder, ItemValueEncodable, NetdocEncodable, NetdocEncoder,
70
};
71
use crate::parse::keyword::Keyword;
72
use crate::parse::parser::{Section, SectionRules, SectionRulesBuilder};
73
use crate::parse::tokenize::{Item, ItemResult, NetDocReader};
74
use crate::parse2::{
75
    self, ArgumentError, ArgumentStream, ErrorProblem, IsStructural, ItemArgumentParseable,
76
    ItemStream, ItemValueParseable, KeywordRef, NetdocParseable, NetdocParseableUnverified,
77
    SignatureHashInputs, SignatureItemParseable, StopAt, UnparsedItem, VerifyFailed,
78
};
79
use crate::types::relay_flags::{self, DocRelayFlags};
80
use crate::types::{self, *};
81
use crate::util::PeekableIterator;
82
use crate::{Error, KeywordEncodable, NetdocErrorKind as EK, NormalItemArgument, Pos};
83
use std::collections::{BTreeSet, HashMap, HashSet};
84
use std::fmt::{self, Display};
85
use std::str::FromStr;
86
use std::sync::Arc;
87
use std::time::{self, SystemTime};
88
use std::{net, result};
89
use tor_basic_utils::iter_join;
90
use tor_error::{Bug, HasKind, bad_api_usage, internal};
91
use tor_protover::Protocols;
92
use void::ResultVoidExt as _;
93

            
94
use derive_deftly::{Deftly, define_derive_deftly};
95
use digest::Digest;
96
use itertools::Itertools;
97
use saturating_time::SaturatingTime as _;
98
use std::sync::LazyLock;
99
use tor_checkable::{ExternallySigned, timed::TimerangeBound};
100
use tor_llcrypto as ll;
101
use tor_llcrypto::pk::rsa::RsaIdentity;
102

            
103
use serde::{Deserialize, Deserializer};
104

            
105
#[cfg(feature = "build_docs")]
106
pub use build::MdConsensusBuilder;
107
#[cfg(feature = "build_docs")]
108
pub use build::PlainConsensusBuilder;
109
#[cfg(feature = "build_docs")]
110
ns_export_each_flavor! {
111
    ty: RouterStatusBuilder;
112
}
113

            
114
ns_export_each_variety! {
115
    ty: Footer, RouterStatus, Preamble;
116
}
117

            
118
#[deprecated]
119
pub use PlainConsensus as NsConsensus;
120
#[deprecated]
121
pub use PlainRouterStatus as NsRouterStatus;
122
#[deprecated]
123
pub use UncheckedPlainConsensus as UncheckedNsConsensus;
124
#[deprecated]
125
pub use UnvalidatedPlainConsensus as UnvalidatedNsConsensus;
126

            
127
pub use rs::{RouterStatusMdDigestsVote, SoftwareVersion};
128

            
129
pub use dir_source::{ConsensusAuthoritySection, DirSource, SupersededAuthorityKey};
130

            
131
define_constant_string! {
132
    /// `network-status-version` version value
133
    ///
134
    /// This is the fixed string `3`.
135
    ///
136
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:network-status-version>
137
    //
138
    // IMO this is nicer than the formulation with an enum.
139
    // In practice we are not going to support other versions with the same parsing approach;
140
    // probably not even with the same code.
141
    NetworkStatusVersion = "3";
142
}
143

            
144
define_constant_string! {
145
    /// The `status` value in a `vote-status` line in a consensus
146
    ///
147
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:vote-status>
148
    VoteStatusConsensus = "consensus";
149
}
150

            
151
define_constant_string! {
152
    /// The `vote` value in a `vote-status` line in a vote
153
    ///
154
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:vote-status>
155
    VoteStatusVote = "vote";
156
}
157

            
158
/// `publiscation` field in routerstatus entry intro item other than in votes
159
///
160
/// Two arguments which are both ignored.
161
/// This used to be an ISO8601 timestamp in anomalous two-argument format.
162
///
163
/// Nowadays, according to the spec, it can be a dummy value.
164
/// So it can be a unit type.
165
///
166
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:r>,
167
/// except in votes which use [`Iso8601TimeSp`] instead.
168
///
169
/// **Not the same as** the `published` item:
170
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:published>
171
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash, Ord, PartialOrd, Default)]
172
#[allow(clippy::exhaustive_structs)]
173
pub struct IgnoredPublicationTimeSp;
174

            
175
/// The lifetime of a networkstatus document.
176
///
177
/// In a consensus, this type describes when the consensus may safely
178
/// be used.  In a vote, this type describes the proposed lifetime for a
179
/// consensus.
180
///
181
/// Aggregate of three netdoc preamble fields.
182
#[derive(Clone, Debug, Deftly)]
183
#[derive_deftly(Constructor, NetdocEncodableFields, NetdocParseableFields)]
184
#[derive_deftly(Lifetime)]
185
#[allow(clippy::exhaustive_structs)]
186
pub struct Lifetime {
187
    /// `valid-after` --- Time at which the document becomes valid
188
    ///
189
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:published>
190
    ///
191
    /// (You might see a consensus a little while before this time,
192
    /// since voting tries to finish up before the.)
193
    #[deftly(constructor)]
194
    #[deftly(netdoc(single_arg))]
195
    pub valid_after: Iso8601TimeSp,
196
    /// `fresh-until` --- Time after which there is expected to be a better version
197
    /// of this consensus
198
    ///
199
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:published>
200
    ///
201
    /// You can use the consensus after this time, but there is (or is
202
    /// supposed to be) a better one by this point.
203
    #[deftly(constructor)]
204
    #[deftly(netdoc(single_arg))]
205
    pub fresh_until: Iso8601TimeSp,
206
    /// `valid-until` --- Time after which this consensus is expired.
207
    ///
208
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:published>
209
    ///
210
    /// You should try to get a better consensus after this time,
211
    /// though it's okay to keep using this one if no more recent one
212
    /// can be found.
213
    #[deftly(constructor)]
214
    #[deftly(netdoc(single_arg))]
215
    pub valid_until: Iso8601TimeSp,
216

            
217
    #[doc(hidden)]
218
    #[deftly(netdoc(skip))]
219
    pub __non_exhaustive: (),
220
}
221

            
222
define_derive_deftly! {
223
    /// Bespoke derive for `Lifetime`, for `new` and accessors
224
    Lifetime:
225

            
226
    ${defcond FIELD not(approx_equal($fname, __non_exhaustive))}
227

            
228
    impl Lifetime {
229
        /// Construct a new Lifetime.
230
14976
        pub fn new(
231
14976
            $( ${when FIELD} $fname: time::SystemTime, )
232
14976
        ) -> crate::Result<Self> {
233
            // Make this now because otherwise literal `valid_after` here in the body
234
            // has the wrong span - the compiler refuses to look at the argument.
235
            // But we can refer to the field names.
236
            let self_ = Lifetime {
237
                $( ${when FIELD} $fname: $fname.into(), )
238
                __non_exhaustive: (),
239
            };
240
            if self_.valid_after < self_.fresh_until && self_.fresh_until < self_.valid_until {
241
                Ok(self_)
242
            } else {
243
                Err(EK::InvalidLifetime.err())
244
            }
245
        }
246
      $(
247
        ${when FIELD}
248

            
249
        ${fattrs doc}
250
151470
        pub fn $fname(&self) -> time::SystemTime {
251
            *self.$fname
252
        }
253
      )
254
        /// Return true if this consensus is officially valid at the provided time.
255
540
        pub fn valid_at(&self, when: time::SystemTime) -> bool {
256
            *self.valid_after <= when && when <= *self.valid_until
257
        }
258

            
259
        /// Return the voting period implied by this lifetime.
260
        ///
261
        /// (The "voting period" is the amount of time in between when a consensus first
262
        /// becomes valid, and when the next consensus is expected to become valid)
263
55944
        pub fn voting_period(&self) -> time::Duration {
264
            let valid_after = self.valid_after();
265
            let fresh_until = self.fresh_until();
266
            fresh_until
267
                .duration_since(valid_after)
268
                .expect("Mis-formed lifetime")
269
        }
270
    }
271
}
272
use derive_deftly_template_Lifetime;
273

            
274
/// A single consensus method
275
///
276
/// These are integers, but we don't do arithmetic on them.
277
///
278
/// As defined here:
279
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:consensus-methods>
280
/// <https://spec.torproject.org/dir-spec/computing-consensus.html#flavor:microdesc>
281
///
282
/// As used in a `consensus-method` item:
283
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:consensus-method>
284
#[derive(Debug, Clone, Default, Eq, PartialEq, Ord, PartialOrd, Hash, Copy)] //
285
#[derive(derive_more::From, derive_more::Into, derive_more::Display, derive_more::FromStr)]
286
pub struct ConsensusMethod(u32);
287
impl NormalItemArgument for ConsensusMethod {}
288

            
289
/// A set of consensus methods
290
///
291
/// Implements `ItemValueParseable` as required for `consensus-methods`,
292
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:consensus-methods>
293
///
294
/// There is also [`consensus_methods_comma_separated`] for `m` lines in votes.
295
#[derive(Debug, Clone, Default, Eq, PartialEq, Ord, PartialOrd, Deftly)]
296
#[derive_deftly(ItemValueEncodable, ItemValueParseable)]
297
#[non_exhaustive]
298
pub struct ConsensusMethods {
299
    /// Consensus methods.
300
    pub methods: BTreeSet<ConsensusMethod>,
301
}
302

            
303
/// Module for use with parse2's `with`, to parse one argument of comma-separated consensus methods
304
///
305
/// As found in an `m` item in a vote:
306
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:m>
307
pub mod consensus_methods_comma_separated {
308
    use super::*;
309
    use parse2::ArgumentError as AE;
310
    use std::result::Result;
311

            
312
    /// Parse
313
14
    pub fn from_args<'s>(args: &mut ArgumentStream<'s>) -> Result<ConsensusMethods, AE> {
314
14
        let mut methods = BTreeSet::new();
315
56
        for ent in args.next().ok_or(AE::Missing)?.split(',') {
316
56
            let ent = ent.parse().map_err(|_| AE::Invalid)?;
317
56
            if !methods.insert(ent) {
318
                return Err(AE::Invalid);
319
56
            }
320
        }
321
14
        Ok(ConsensusMethods { methods })
322
14
    }
323

            
324
    /// Encode
325
    #[cfg(feature = "incomplete")] // untested
326
    pub fn write_arg_onto(self_: &ConsensusMethods, out: &mut ItemEncoder) -> Result<(), Bug> {
327
        out.args_raw_string(&iter_join(",", &self_.methods));
328
        Ok(())
329
    }
330
}
331

            
332
/// A set of named network parameters.
333
///
334
/// These are used to describe current settings for the Tor network,
335
/// current weighting parameters for path selection, and so on.  They're
336
/// encoded with a space-separated K=V format.
337
///
338
/// A `NetParams<i32>` is part of the validated directory manager configuration,
339
/// where it is built (in the builder-pattern sense) from a transparent HashMap.
340
///
341
/// As found in `params` in a network status:
342
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:params>
343
///
344
/// The same syntax is also used, and this type used for parsing, in various other places,
345
/// for example routerstatus entry `w` items (bandwidth weights):
346
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:w>
347
//
348
// TODO DIRAUTH torspec#401 Replace `String` with a suitable newtype
349
// Currently:
350
//  - Our parser allows any keyword that makes it into a netdoc argument,
351
//    but it splits on the *first* `=` so a `NetParams<i32>` cannot parse a keyword with a `=`.
352
//  - We provide constructors that allow any `String`, even ones containing space, `=`,
353
//    newline, etc.
354
//  - Encoding throws `Bug` if the resulting document will be clearly garbage,
355
//    forbidding `=`, whitespace, and controls.  If the supplied keywords are bizarre,
356
//    it may generate surprising documents (eg, containing exciting Unicode).
357
#[derive(Debug, Clone, Default, Eq, PartialEq)]
358
pub struct NetParams<T> {
359
    /// Map from keys to values.
360
    params: HashMap<String, T>,
361
}
362

            
363
impl<T> NetParams<T> {
364
    /// Create a new empty list of NetParams.
365
    #[allow(unused)]
366
30356
    pub fn new() -> Self {
367
30356
        NetParams {
368
30356
            params: HashMap::new(),
369
30356
        }
370
30356
    }
371
    /// Retrieve a given network parameter, if it is present.
372
198450
    pub fn get<A: AsRef<str>>(&self, v: A) -> Option<&T> {
373
198450
        self.params.get(v.as_ref())
374
198450
    }
375
    /// Return an iterator over all key value pairs in an arbitrary order.
376
24776
    pub fn iter(&self) -> impl Iterator<Item = (&String, &T)> {
377
24776
        self.params.iter()
378
24776
    }
379
    /// Set or replace the value of a network parameter.
380
10602
    pub fn set(&mut self, k: String, v: T) {
381
10602
        self.params.insert(k, v);
382
10602
    }
383
}
384

            
385
impl<K: Into<String>, T> FromIterator<(K, T)> for NetParams<T> {
386
7106
    fn from_iter<I: IntoIterator<Item = (K, T)>>(i: I) -> Self {
387
        NetParams {
388
7153
            params: i.into_iter().map(|(k, v)| (k.into(), v)).collect(),
389
        }
390
7106
    }
391
}
392

            
393
impl<T> std::iter::Extend<(String, T)> for NetParams<T> {
394
4390
    fn extend<I: IntoIterator<Item = (String, T)>>(&mut self, iter: I) {
395
4390
        self.params.extend(iter);
396
4390
    }
397
}
398

            
399
impl<'de, T> Deserialize<'de> for NetParams<T>
400
where
401
    T: Deserialize<'de>,
402
{
403
    fn deserialize<D>(deserializer: D) -> std::result::Result<Self, D::Error>
404
    where
405
        D: Deserializer<'de>,
406
    {
407
        let params = HashMap::deserialize(deserializer)?;
408
        Ok(NetParams { params })
409
    }
410
}
411

            
412
/// A list of subprotocol versions that implementors should/must provide.
413
///
414
/// This struct represents a pair of (optional) items:
415
/// `recommended-FOO-protocols` and `required-FOO-protocols`.
416
///
417
/// Each consensus has two of these: one for relays, and one for clients.
418
///
419
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:required-relay-protocols>
420
#[derive(Debug, Clone, Default, PartialEq, serde::Serialize, serde::Deserialize)]
421
pub struct ProtoStatus {
422
    /// Set of protocols that are recommended; if we're missing a protocol
423
    /// in this list we should warn the user.
424
    ///
425
    /// `recommended-client-protocols` or `recommended-relay-protocols`
426
    recommended: Protocols,
427
    /// Set of protocols that are required; if we're missing a protocol
428
    /// in this list we should refuse to start.
429
    ///
430
    /// `required-client-protocols` or `required-relay-protocols`
431
    required: Protocols,
432
}
433

            
434
impl ProtoStatus {
435
    /// Check whether the list of supported protocols
436
    /// is sufficient to satisfy this list of recommendations and requirements.
437
    ///
438
    /// If any required protocol is missing, returns [`ProtocolSupportError::MissingRequired`].
439
    ///
440
    /// Otherwise, if no required protocol is missing, but some recommended protocol is missing,
441
    /// returns [`ProtocolSupportError::MissingRecommended`].
442
    ///
443
    /// Otherwise, if no recommended or required protocol is missing, returns `Ok(())`.
444
168
    pub fn check_protocols(
445
168
        &self,
446
168
        supported_protocols: &Protocols,
447
168
    ) -> Result<(), ProtocolSupportError> {
448
        // Required protocols take precedence, so we check them first.
449
168
        let missing_required = self.required.difference(supported_protocols);
450
168
        if !missing_required.is_empty() {
451
56
            return Err(ProtocolSupportError::MissingRequired(missing_required));
452
112
        }
453
112
        let missing_recommended = self.recommended.difference(supported_protocols);
454
112
        if !missing_recommended.is_empty() {
455
56
            return Err(ProtocolSupportError::MissingRecommended(
456
56
                missing_recommended,
457
56
            ));
458
56
        }
459

            
460
56
        Ok(())
461
168
    }
462
}
463

            
464
/// A subprotocol that is recommended or required in the consensus was not present.
465
#[derive(Clone, Debug, thiserror::Error)]
466
#[cfg_attr(test, derive(PartialEq))]
467
#[non_exhaustive]
468
pub enum ProtocolSupportError {
469
    /// At least one required protocol was not in our list of supported protocols.
470
    #[error("Required protocols are not implemented: {0}")]
471
    MissingRequired(Protocols),
472

            
473
    /// At least one recommended protocol was not in our list of supported protocols.
474
    ///
475
    /// Also implies that no _required_ protocols were missing.
476
    #[error("Recommended protocols are not implemented: {0}")]
477
    MissingRecommended(Protocols),
478
}
479

            
480
impl ProtocolSupportError {
481
    /// Return true if the suggested behavior for this error is a shutdown.
482
    pub fn should_shutdown(&self) -> bool {
483
        matches!(self, Self::MissingRequired(_))
484
    }
485
}
486

            
487
impl HasKind for ProtocolSupportError {
488
    fn kind(&self) -> tor_error::ErrorKind {
489
        tor_error::ErrorKind::SoftwareDeprecated
490
    }
491
}
492

            
493
/// A set of recommended and required protocols when running
494
/// in various scenarios.
495
///
496
/// Represents the collection of four items: `{recommended,required}-{client,relay}-protocols`.
497
///
498
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:required-relay-protocols>
499
#[derive(Clone, Debug, Default, PartialEq, serde::Serialize, serde::Deserialize)]
500
pub struct ProtoStatuses {
501
    /// Lists of recommended and required subprotocol versions for clients
502
    client: ProtoStatus,
503
    /// Lists of recommended and required subprotocol versions for relays
504
    relay: ProtoStatus,
505
}
506

            
507
impl ProtoStatuses {
508
    /// Return the list of recommended and required protocols for running as a client.
509
162
    pub fn client(&self) -> &ProtoStatus {
510
162
        &self.client
511
162
    }
512

            
513
    /// Return the list of recommended and required protocols for running as a relay.
514
    pub fn relay(&self) -> &ProtoStatus {
515
        &self.relay
516
    }
517
}
518

            
519
/// List of recommended Tor versions
520
///
521
/// As seen in `client-versions` and `server-versions` in the preamble.
522
///
523
/// Technically these are supposed to be as according to
524
/// "`version-spec.txt`" but we actually allow anything that doesn't contain commas.
525
///
526
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:client-versions>
527
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:server-versions>
528
///
529
/// An empty set means no information, not no recommended versions.
530
//
531
// TODO should we have a CommaSeparated<T> type for arguments like this?
532
// But maybe we wouldn't be able to use it here anyway because of
533
// the special handling of the missing value.
534
//
535
// This is yet a third version number representation in arti!  Here it's just String.
536
// TODO unify RecommendedTorVersions, RelayPlatform, TorVersion
537
#[derive(Clone, Debug, Default, Eq, PartialEq, Ord, PartialOrd)] //
538
#[derive(derive_more::Deref, derive_more::Into)]
539
pub struct RecommendedTorVersions(BTreeSet<String>);
540

            
541
/// Erroneous "recommended Tor versions" information
542
#[derive(Clone, Debug, Eq, PartialEq, thiserror::Error)]
543
#[non_exhaustive]
544
pub enum InvalidRecommendedTorVersions {
545
    /// Identical version appears twice
546
    #[error("version {_0:?} contains whitespace")]
547
    ContainsWhitespace(String),
548

            
549
    /// Identical version appears twice
550
    #[error("version {_0:?} is repeated")]
551
    Repeated(String),
552
}
553

            
554
impl RecommendedTorVersions {
555
    /// Return a `RecommendedTorVersions` that has no information
556
    pub fn new_unknown() -> Self {
557
        Self::default()
558
    }
559

            
560
    /// Does this `RecommendedTorVersions` have any information?
561
    ///
562
    /// Ie, is it not empty.
563
    ///
564
    /// The opposite of [`BTreeSet::is_empty()`] (which available via deref).
565
    pub fn is_known(&self) -> bool {
566
        !self.is_empty()
567
    }
568

            
569
    /// Construct a RecommendedTorVersions from a list of strings
570
    #[allow(clippy::should_implement_trait)] // we can't due to coherence
571
26180
    pub fn from_iter<I, S>(i: I) -> Result<Self, InvalidRecommendedTorVersions>
572
26180
    where
573
26180
        I: IntoIterator<Item = S>,
574
26180
        S: AsRef<str>,
575
    {
576
26180
        let mut set = BTreeSet::new();
577
26180
        for v in i {
578
800
            let v = v.as_ref();
579
800
            if v.is_empty() {
580
792
                continue;
581
8
            }
582
56
            if v.chars().any(|c| c.is_whitespace()) {
583
                return Err(InvalidRecommendedTorVersions::ContainsWhitespace(
584
                    v.to_owned(),
585
                ));
586
8
            }
587
8
            if !set.insert(v.to_owned()) {
588
                return Err(InvalidRecommendedTorVersions::Repeated(v.to_owned()));
589
8
            }
590
        }
591
26180
        Ok(RecommendedTorVersions(set))
592
26180
    }
593
}
594

            
595
impl FromStr for RecommendedTorVersions {
596
    type Err = InvalidRecommendedTorVersions;
597
792
    fn from_str(s: &str) -> Result<Self, InvalidRecommendedTorVersions> {
598
792
        Self::from_iter(s.split(','))
599
792
    }
600
}
601

            
602
impl Display for RecommendedTorVersions {
603
8
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
604
8
        write!(f, "{}", iter_join(",", &self.0))
605
8
    }
606
}
607

            
608
impl NormalItemArgument for RecommendedTorVersions {}
609

            
610
impl ItemValueEncodable for RecommendedTorVersions {
611
8
    fn write_item_value_onto(&self, mut out: ItemEncoder) -> Result<(), Bug> {
612
8
        out.args_raw_string(self);
613
8
        Ok(())
614
8
    }
615
}
616

            
617
impl ItemValueParseable for RecommendedTorVersions {
618
8
    fn from_unparsed(mut item: UnparsedItem) -> Result<Self, ErrorProblem> {
619
        const FIELD: &str = "versions";
620
8
        item.check_no_object()?;
621
8
        let args = item.args_mut();
622
8
        let arg = args.next().unwrap_or("");
623
8
        arg.parse::<Self>()
624
8
            .map_err(|_| args.handle_error(FIELD, ArgumentError::Invalid))
625
8
    }
626
}
627

            
628
/// A recognized 'flavor' of consensus document.
629
///
630
/// The enum is exhaustive because the addition/removal of a consensus flavor
631
/// should indeed be a breaking change, as it would inevitable require
632
/// interfacing code to think about the handling of it.
633
///
634
/// <https://spec.torproject.org/dir-spec/computing-consensus.html#flavors>
635
#[derive(Copy, Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
636
#[allow(clippy::exhaustive_enums)]
637
pub enum ConsensusFlavor {
638
    /// A "microdesc"-flavored consensus.  This is the one that
639
    /// clients and relays use today.
640
    Microdesc,
641
    /// A "networkstatus"-flavored consensus.  It's used for
642
    /// historical and network-health purposes.  Instead of listing
643
    /// microdescriptor digests, it lists digests of full relay
644
    /// descriptors.
645
    Plain,
646
}
647

            
648
impl ConsensusFlavor {
649
    /// Return the name of this consensus flavor.
650
2754
    pub fn name(&self) -> &'static str {
651
2754
        match self {
652
972
            ConsensusFlavor::Plain => "ns", // spec bug, now baked in
653
1782
            ConsensusFlavor::Microdesc => "microdesc",
654
        }
655
2754
    }
656
    /// Try to find the flavor whose name is `name`.
657
    ///
658
    /// For historical reasons, an unnamed flavor indicates an "Plain"
659
    /// document.
660
392
    pub fn from_opt_name(name: Option<&str>) -> crate::Result<Self> {
661
392
        match name {
662
390
            Some("microdesc") => Ok(ConsensusFlavor::Microdesc),
663
2
            Some("ns") | None => Ok(ConsensusFlavor::Plain),
664
            Some(other) => {
665
                Err(EK::BadDocumentType.with_msg(format!("unrecognized flavor {:?}", other)))
666
            }
667
        }
668
392
    }
669
}
670

            
671
define_derive_deftly! {
672
    /// Bespoke derives applied to [`DirectorySignatureHashAlgo`]
673
    ///
674
    /// Generates:
675
    ///
676
    ///  * [`DirectorySignaturesHashesAccu`]
677
    ///  * [`DirectorySignaturesHashesAccu::update_from`]
678
    ///  * [`DirectorySignaturesHashesAccu::hash_slice_for_verification`]
679
    DirectorySignaturesHashesAccu:
680

            
681
    ${define FNAME ${paste ${snake_case $vname}} }
682

            
683
    /// `directory-signature`a hash algorithm argument
684
    #[derive(Clone, Copy, Default, Debug, Eq, PartialEq, Deftly)]
685
    #[derive_deftly(AsMutSelf)]
686
    #[non_exhaustive]
687
    pub struct DirectorySignaturesHashesAccu {
688
      $(
689
        ${vattrs doc}
690
        pub $FNAME: Option<[u8; ${vmeta(hash_len) as expr}]>,
691
      )
692

            
693
      /// `sha1` but without the algorithm name
694
      ///
695
      /// This is needed because the hash includes the whole signature item keyword line,
696
      /// and therefore a signature with the `sha1` explicitly stated,
697
      /// and one without, have different hashes!
698
      ///
699
      /// So we mustn't use the `sha1` field for both implicit and explicit use of SHA-1,
700
      /// or multiple signatures with different syntax would overwrite each others'
701
      /// different hashes.
702
      pub sha1_unnamed: Option<[u8; 20]>,
703
    }
704

            
705
    impl DirectorySignaturesHashesAccu {
706
        /// Calculate the hash for a signature item and update this accumulator
707
1962
        fn update_from(
708
            &mut self,
709
            algo: &DigestAlgoInSignature,
710
            body: &SignatureHashInputs,
711
        ) {
712
            // Update the hash in self.$UPDATE according to algorithm $AGLO
713
            // (uses dynamic bindings of those parameters)
714
            ${define HASH {
715
                // Avoid recalculating if we don't need to
716
222
                self.$UPDATE.get_or_insert_with(|| {
717
                    let mut h = tor_llcrypto::d::$ALGO::new();
718
                    h.update(body.body().body());
719
                    h.update(body.signature_item_kw_spc);
720
                    h.finalize().into()
721
                });
722
            }}
723

            
724
            match &**algo {
725
              $(
726
                Some(KeywordOrString::Known($vtype)) => {
727
                    ${define UPDATE $FNAME}
728
                    ${define ALGO $vname}
729
                    $HASH
730
                }
731
              )
732
                None => {
733
                    ${define UPDATE sha1_unnamed}
734
                    ${define ALGO Sha1}
735
                    $HASH
736
                }
737
                Some(KeywordOrString::Unknown(..)) => {}
738
            }
739
        }
740

            
741
        /// Return the hash value for a specific algorithm, as a slice
742
        ///
743
        /// `None` if the value wasn't computed.
744
        /// That shouldn't happen.
745
        // TODO DIRAUTH make private when poc's verification is abolished
746
198
        pub(crate) fn hash_slice_for_verification(
747
198
            &self,
748
198
            algo: &DigestAlgoInSignature,
749
198
        ) -> Option<&[u8]> {
750
            match &**algo {
751
              $(
752
                Some(KeywordOrString::Known($vtype)) => Some(self.$FNAME.as_ref()?),
753
              )
754
                None => Some(self.sha1_unnamed.as_ref()?),
755
                Some(KeywordOrString::Unknown(..)) => None,
756
            }
757
        }
758
    }
759
}
760

            
761
/// `directory-signature` hash algorithm argument
762
#[derive(Clone, Copy, Debug, Eq, PartialEq, strum::Display, strum::EnumString, Deftly)]
763
#[derive_deftly(DirectorySignaturesHashesAccu)]
764
#[non_exhaustive]
765
#[strum(serialize_all = "snake_case")]
766
pub enum DirectorySignatureHashAlgo {
767
    /// SHA-1
768
    #[deftly(hash_len = "20")]
769
    Sha1,
770
    /// SHA-256
771
    #[deftly(hash_len = "32")]
772
    Sha256,
773
}
774

            
775
/// `algorithm` field in a `directory-signature` item
776
///
777
/// This is extremely bizarre: it's an *optional item at the start of the arguments*!
778
// TODO SPEC #350
779
///
780
/// So we parse it with some kind of nightmarish lookahead.
781
///
782
/// Additionally, to be able to convey the signatures accurately, without breaking them,
783
/// we must remember whether the argument was present.
784
///
785
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:directory-signature>
786
#[derive(Debug, Clone, derive_more::Deref, derive_more::DerefMut)]
787
#[allow(clippy::exhaustive_structs)]
788
pub struct DigestAlgoInSignature(pub Option<KeywordOrString<DirectorySignatureHashAlgo>>);
789

            
790
impl ItemArgumentParseable for DigestAlgoInSignature {
791
1962
    fn from_args<'s>(args: &mut ArgumentStream<'s>) -> Result<Self, ArgumentError> {
792
1962
        let v = if args
793
1962
            .clone()
794
1962
            .next()
795
            // Treat it as a fingerprint if it doesn't have any non-hex characters
796
            // (including lowercase ones).  If we reuse this item for new algorithms
797
            // they should have at least one letter g-z in their name.
798
78213
            .and_then(|s| s.chars().all(|c| c.is_ascii_hexdigit()).then_some(()))
799
1962
            .is_some()
800
        {
801
            // next argument looks enough like a fingerprint that we don't treat as an algo name
802
1954
            None
803
        } else {
804
8
            Some(KeywordOrString::from_args(args)?)
805
        };
806
1962
        Ok(DigestAlgoInSignature(v))
807
1962
    }
808
}
809
impl ItemArgument for DigestAlgoInSignature {
810
16
    fn write_arg_onto(&self, out: &mut ItemEncoder<'_>) -> Result<(), Bug> {
811
16
        if let Some(y) = &self.0 {
812
8
            y.write_arg_onto(out)?;
813
8
        }
814
16
        Ok(())
815
16
    }
816
}
817
impl DigestAlgoInSignature {
818
    /// Return the actual algorithm
819
    ///
820
    /// This handles the defaulting, where an absent argument means `sha1`.
821
    pub fn algorithm(&self) -> &KeywordOrString<DirectorySignatureHashAlgo> {
822
        self.as_ref()
823
            .unwrap_or(&KeywordOrString::Known(DirectorySignatureHashAlgo::Sha1))
824
    }
825
}
826

            
827
impl NormalItemArgument for DirectorySignatureHashAlgo {}
828

            
829
/// The signature of a single directory authority on a networkstatus document.
830
///
831
/// Implements `ItemValueParseable` which parses without hashing anything;
832
/// this is mostly useful for use by the `SignatureItemParseable` implementation.
833
#[derive(Debug, Clone, Deftly)]
834
#[derive_deftly(ItemValueEncodable, ItemValueParseable)]
835
#[non_exhaustive]
836
pub struct Signature {
837
    /// The name of the digest algorithm used to make the signature.
838
    ///
839
    /// Currently sha1 and sh256 are recognized.  Here we only support
840
    /// sha256.
841
    pub digest_algo: DigestAlgoInSignature,
842
    /// Fingerprints of the keys for the authority that made
843
    /// this signature.
844
    #[deftly(netdoc(with = authcert::keyids_directory_signature_args))]
845
    pub key_ids: AuthCertKeyIds,
846
    /// The signature itself.
847
    #[deftly(netdoc(object(label = "SIGNATURE"), with = types::raw_data_object))]
848
    pub signature: Vec<u8>,
849
}
850

            
851
impl SignatureItemParseable for Signature {
852
    type HashAccu = DirectorySignaturesHashesAccu;
853

            
854
1962
    fn from_unparsed_and_body(
855
1962
        item: UnparsedItem,
856
1962
        body: &SignatureHashInputs<'_>,
857
1962
        hash: &mut Self::HashAccu,
858
1962
    ) -> Result<Self, ErrorProblem> {
859
1962
        let signature = Signature::from_unparsed(item)?;
860
1962
        hash.update_from(&signature.digest_algo, body);
861
1962
        Ok(signature)
862
1962
    }
863
}
864

            
865
/// A collection of signatures that can be checked on a networkstatus document
866
///
867
/// This is derived from the signatures section of a netstatus,
868
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#section:signature>,
869
/// but it is not isomorphic to it, and is not directly parseable.
870
#[derive(Debug, Clone)]
871
#[non_exhaustive]
872
pub struct SignatureGroup {
873
    /// The document hashes of the signed part of the document
874
    ///
875
    /// The pre-parse2 parser always sets `hashes.sha1` and `hashes.sha1_unnamed`
876
    /// to the same value, which is wrong. which is
877
    /// [bug #2530](https://gitlab.torproject.org/tpo/core/arti/-/work_items/2530)
878
    pub hashes: DirectorySignaturesHashesAccu,
879
    /// The signatures listed on the document.
880
    pub signatures: Vec<Signature>,
881
}
882

            
883
/// Error which will prevent us from attempting to verify signatures on a consensus
884
///
885
/// This error occurs if we the consensus isn't signed by the right people,
886
/// or we are lacking authcerts.
887
///
888
/// Does not represent actual verification errors.
889
/// Those show up as `VerifyFailed`, typically [`ConsensusVerifyFailed::InvalidSignature`].
890
///
891
/// Can be converted to a `VerifyFailed`,
892
/// giving [`InsufficientTrustedSigners`](VerifyFailed::InsufficientTrustedSigners).
893
#[derive(Clone, Debug, thiserror::Error)]
894
#[non_exhaustive]
895
// TODO DIRAUTH nothing tests that values in here are right, but there are no
896
// public entrypoints that return one, so we don't need to cfg it "incomplete".
897
pub enum ConsensusVerifiabilityError {
898
    /// Insufficient trusted signers
899
    #[error("consensus not signed by enough authorities")]
900
    InsufficientTrustedSigners,
901

            
902
    /// Insufficient trusted signers because we are missing authcerts
903
    #[error("missing auth certs mean we could not verify enough consensuis signatures (need at least {deficit} more, out of {} that are missing)", missing.len())]
904
    MissingAuthCerts {
905
        /// The number of additional useful authcerts that would be sufficient
906
        deficit: usize,
907
        /// All the authcerts that would be useful
908
        missing: HashSet<AuthCertKeyIds>,
909
    },
910
}
911

            
912
/// Error encountered while verifying a consensus
913
///
914
/// Thrown by
915
/// [`plain::NetworkStatusUnverified::verify`]
916
/// and
917
/// [`md::NetworkStatusUnverified::verify`].
918
///
919
/// Not used for problems with the validity period:
920
/// that's handled by `tor-checkable` and shows up as [`tor_checkable::TimeValidityError`].
921
///
922
/// Can be converted to a `VerifyFailed` (which, in effect, summarises the error).
923
#[derive(Clone, Debug, thiserror::Error)]
924
#[non_exhaustive]
925
pub enum ConsensusVerifyFailed {
926
    /// Certificates or signatures insufficient
927
    #[error("certs/sigs insufficient")]
928
    CertificationInsufficient(#[from] ConsensusVerifiabilityError),
929

            
930
    /// One or more signatures failed to verify
931
    #[error("invalid signature")]
932
    //
933
    // Not `#[from]` because we don't want to accidentally convert
934
    // ConsensusVerifiabilityError -> VerifyFailed -> ConsensusVerifyFailed
935
    // since that would give the wrong variant.
936
    InvalidSignature(#[source] VerifyFailed),
937
}
938

            
939
/// A shared random value produced by the directory authorities.
940
#[derive(
941
    Debug, Clone, Copy, Eq, PartialEq, derive_more::From, derive_more::Into, derive_more::AsRef,
942
)]
943
// (This doesn't need to use CtByteArray; we don't really need to compare these.)
944
pub struct SharedRandVal([u8; 32]);
945

            
946
/// A shared-random value produced by the directory authorities,
947
/// along with meta-information about that value.
948
#[derive(Debug, Clone, Deftly)]
949
#[non_exhaustive]
950
#[derive_deftly(ItemValueEncodable, ItemValueParseable)]
951
pub struct SharedRandStatus {
952
    /// How many authorities revealed shares that contributed to this value.
953
    pub n_reveals: u8,
954
    /// The current random value.
955
    ///
956
    /// The properties of the secure shared-random system guarantee
957
    /// that this value isn't predictable before it first becomes
958
    /// live, and that a hostile party could not have forced it to
959
    /// have any more than a small number of possible random values.
960
    pub value: SharedRandVal,
961

            
962
    /// The time when this SharedRandVal becomes (or became) the latest.
963
    ///
964
    /// (This is added per proposal 342, assuming that gets accepted.)
965
    pub timestamp: Option<Iso8601TimeNoSp>,
966
}
967

            
968
/// The two shared random values, `shared-rand-*-value`
969
///
970
/// As found in the consensus preamble
971
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:shared-rand-current-value>
972
/// and a vote's authority section
973
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#authority-item-shared-rand-value>
974
#[derive(Debug, Clone, Default, Deftly)]
975
#[derive_deftly(Constructor, NetdocEncodableFields, NetdocParseableFields)]
976
#[allow(clippy::exhaustive_structs)]
977
pub struct SharedRandStatuses {
978
    /// Global shared-random value for the previous shared-random period.
979
    pub shared_rand_previous_value: Option<SharedRandStatus>,
980

            
981
    /// Global shared-random value for the current shared-random period.
982
    pub shared_rand_current_value: Option<SharedRandStatus>,
983

            
984
    #[doc(hidden)]
985
    #[deftly(netdoc(skip))]
986
    pub __non_exhaustive: (),
987
}
988

            
989
/// Relay weight information - `w` item in routerstatus
990
///
991
/// This is a combination of two representations of (subsets of) the same information,
992
/// from an optional `w` in the document.
993
///
994
///  * [`effective`](RelayWeightsItem::effective):
995
///
996
///    Always contains the effective weight, as [`RelayWeight`].
997
///    This is what is used by clients.
998
///    It does not record whether a `w` line was actually present.
999
///
///  * [`params`](RelayWeightsItem::params):
///
///    Can represent the presence and whole contents of the `w` line,
///    including all the known and unknown parameters.
///    This is within [`Unknown`], so it is only present with crate `feature = "retain-unknown"`,
///    and only some constructors/parsers record it.
///
/// # Parsing
///
/// Parsing is done with `NetdocParseableFields` rather than `ItemValueParseable`.
/// The `params` are [`Retained`](Unknown::Retained) if `retain_unknown_values` is
/// selected in [`parse2::ParseOptions`].
//
// We use NetdocParseableFields because the containing document, RouterStatus,
// contains `RelayWeightsItem` rather than `Option<RelayWeightsItem>`.
// The item parsing multiplicity machinery would see plain `RelayWeightsItem` as a required item.
//
// This representation also means so that if retaining unknown information is compiled out
// (ie, in clients) each routerstatus entry stored in memory does not need to record
// whether `w` was present, merely what the implications were.
//
// We can't use ItemValueParseable with #[deftly(netdoc(default))]
// because `RelayWeightsItem::default()` is a RelayWeightsItem that definitively
// contains no pazrameters, ie with `Unknown::Retained`,
// and is therefore only conditionally available.
/// # Encoding
///
/// Encoding requires knowing whether a `w` line is to be included, and its contents,
/// so is implemented only with if `effective` is `Unknown::Retained`.
/// The encoding impl is only compiled in with `"retain-unknown"`,
/// and throws [`Bug`] if applied to a `RelayWeightsItem` whose `params` are `Discarded`.
///
/// # Constructors
///
/// An "empty" `RelayWeightsItem` can be constructed with [`RelayWeightsItem::new_no_info`].
///
/// A `RelayWeightsItem` containing only the effective `RelayWeight`
/// can be constructed using [`RelayWeightsItem::from_effective`].
///
/// With `"retain-unknown"`:
/// a `RelayWeightsItem` can be constructed from a [`NetParams<u32>`] using `TryFrom`;
/// and, implements `Default`, which yields a `RelayWeightsItem`
/// representing the (known) absence of a `w` line.
//
// Fields are private to maintain the invariant.
#[derive(Debug, Clone)]
pub struct RelayWeightsItem {
    /// The effective relay weight
    effective: RelayWeight,
    /// The complete parameter set, if available and `w` was present.
    params: Unknown<Option<NetParams<u32>>>,
}
/// Recognized weight fields on a single relay in a consensus
///
/// The part of a `w` item that we understand as a client.
#[non_exhaustive]
#[derive(Debug, Clone, Copy)]
pub enum RelayWeight {
    /// An unmeasured weight for a relay.
    Unmeasured(u32),
    /// An measured weight for a relay.
    Measured(u32),
}
/// Error processing a `w` line's netparams into an effective relay weight
#[derive(Debug, Clone, thiserror::Error)]
#[non_exhaustive]
pub enum InvalidRelayWeights {
    /// Invalid value for `Unmeasured`
    #[error("invalid value for Unmeasured")]
    InvalidUnmeasured,
}
/// Authority entry in a consensus - deprecated compatibility type alias
#[deprecated = "renamed to ConsensusAuthorityEntry"]
pub type ConsensusVoterInfo = ConsensusAuthorityEntry;
/// Authority entry in a plain consensus - type alias provided for consistency
pub type PlainAuthorityEntry = ConsensusAuthorityEntry;
/// Authority entry in an md consensus - type alias provided for consistency
pub type MdAuthorityEntry = ConsensusAuthorityEntry;
/// An authority entry as found in a consensus
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#section:authority-entry>
///
/// See also [`VoteAuthorityEntry`]
//
// We don't use the `each_variety` system for this because:
//  1. That avoids separating the two consensus authority entry types, which are identical
//  2. The only common fields are `dir-source` and `contact`, so there is little duplication
#[derive(Debug, Clone, Deftly)]
#[derive_deftly(Constructor, NetdocEncodable, NetdocParseable)]
#[allow(clippy::exhaustive_structs)]
pub struct ConsensusAuthorityEntry {
    /// Contents of the `dir-source` line about an authority
    #[deftly(constructor)]
    pub dir_source: DirSource,
    /// Human-readable contact information about the authority
    //
    // If more non-intro fields get added that are the same in votes and cosensuses,
    // consider using each_variety.rs or breaking those fields out into
    // `AuthorityEntryCommon` implementing `NetdocParseableFields`, or something.
    #[deftly(constructor)]
    pub contact: ContactInfo,
    /// Digest of the vote that the authority cast to contribute to
    /// this consensus.
    ///
    /// This is not a fixed-length, fixed-algorithm field.
    /// Bizarrely, the algorithm is supposed to be inferred from the length!
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:vote-digest>
    #[deftly(netdoc(single_arg))]
    #[deftly(constructor)]
    pub vote_digest: B16U,
    #[doc(hidden)]
    #[deftly(netdoc(skip))]
    pub __non_exhaustive: (),
}
/// An authority entry as found in a vote
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#section:authority-entry>
///
/// See also [`ConsensusAuthorityEntry`]
#[derive(Debug, Clone, Deftly)]
#[derive_deftly(Constructor, NetdocEncodable, NetdocParseable)]
#[allow(clippy::exhaustive_structs)]
pub struct VoteAuthorityEntry {
    /// Contents of the `dir-source` line about an authority
    #[deftly(constructor)]
    pub dir_source: DirSource,
    /// Human-readable contact information about the authority
    #[deftly(constructor)]
    pub contact: ContactInfo,
    /// `legacy-dir-key` - superseded authority identity key
    ///
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:legacy-dir-key>
    #[deftly(netdoc(single_arg))]
    pub legacy_dir_key: Option<Fingerprint>,
    /// `shared-rand-participate` - Indicate shared random participation
    ///
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:shared-rand-participate>
    pub shared_rand_participate: Option<SharedRandParticipate>,
    /// `shared-rand-commit` - Shared random commitment
    ///
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:shared-rand-commit>
    pub shared_rand_commit: Vec<SharedRandCommit>,
    /// Global shared-random values
    #[deftly(netdoc(flatten))]
    pub shared_rand: SharedRandStatuses,
    #[doc(hidden)]
    #[deftly(netdoc(skip))]
    pub __non_exhaustive: (),
}
/// `shared-rand-participate` in a vote authority entry
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:shared-rand-participate>
//
// We could have done `shared_rand_participate: Option<()>` in VoteAuthorityEntry,
// but then we might end up with variables of type `&Option<()>` etc.
// whose meaning has been detached from its type.
//
// TODO DIRAUTH rework this according to the API design conclusion from !3977 when there is one
#[derive(Debug, Clone, Deftly)]
#[derive_deftly(Constructor, ItemValueEncodable, ItemValueParseable)]
#[allow(clippy::exhaustive_structs)]
pub struct SharedRandParticipate {
    #[doc(hidden)]
    #[deftly(netdoc(skip))]
    pub __non_exhaustive: (),
}
/// `shared-rand-commit` in a vote authority entry
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:shared-rand-commit>
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Deftly)]
// If new protocols use this item with a different version, we'll call it an API break.
#[allow(clippy::exhaustive_enums)]
pub enum SharedRandCommit {
    /// Version 1, the only one supported
    V1(SharedRandCommitV1),
    /// Other versions.  Cannot be encoded.
    // It's not clear that future versions will use this version mechanism.  torspec#408.
    Unknown {},
}
/// `shared-rand-commit` in a vote authority entry
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:shared-rand-commit>
///
/// Version and hash are not explicitly represented.  See torspec#407.
///
/// `ItemValueEncodable` and `ItemValueParseable` impls do not include the fixed arguments;
/// in a netdoc, this type should be used within `SharedRandCommit::V1`.
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Deftly)]
#[derive_deftly(Constructor, ItemValueEncodable, ItemValueParseable)]
#[allow(clippy::exhaustive_structs)]
pub struct SharedRandCommitV1 {
    /// Authority id key, recapitulated.
    // TODO this field shouldn't here at all torspec#407
    #[deftly(constructor)]
    h_kp_auth_id_rsa: Fingerprint,
    /// Commitment
    ///
    /// `TIMESTAMP || SHA3_256(REVEAL)`, as per
    /// <https://spec.torproject.org/srv-spec/specification.html#COMMITREVEAL>
    //
    // TOOD we would like to replace this with a type that separates out the pieces!
    // But that would need a FixedB64 generic over some tor-bytes trait, or something.
    #[deftly(constructor)]
    commit: FixedB64<40>,
    /// Reveal
    ///
    /// `TIMESTAMP || random number`, as per
    /// <https://spec.torproject.org/srv-spec/specification.html#COMMITREVEAL>
    reveal: Option<FixedB64<40>>,
    #[doc(hidden)]
    #[deftly(netdoc(skip))]
    pub __non_exhaustive: (),
}
impl SharedRandCommitV1 {
    /// The fixed arguments that precede the actual value in `shared-rand-commit 1 ...`
    const FIXED_ARGUMENTS: &[&str] = &["1", "sha3-256"];
}
impl ItemValueEncodable for SharedRandCommit {
    fn write_item_value_onto(&self, mut out: ItemEncoder) -> Result<(), Bug> {
        match self {
            SharedRandCommit::V1(values) => {
                for fixed in SharedRandCommitV1::FIXED_ARGUMENTS {
                    out.args_raw_string(fixed);
                }
                values.write_item_value_onto(out)
            }
            SharedRandCommit::Unknown {} => Err(internal!("encoding SharedRandCommit::Unknown")),
        }
    }
}
impl ItemValueParseable for SharedRandCommit {
8
    fn from_unparsed(mut item: UnparsedItem<'_>) -> Result<Self, ErrorProblem> {
8
        let mut fixed = SharedRandCommitV1::FIXED_ARGUMENTS.iter().copied();
8
        let args = item.args_mut();
8
        let version = args
8
            .next()
8
            .ok_or_else(|| args.handle_error("version", ArgumentError::Missing))?;
8
        if version != fixed.next().expect("nonempty") {
            return Ok(SharedRandCommit::Unknown {});
8
        }
8
        for exp in fixed {
8
            let got = args
8
                .next()
8
                .ok_or_else(|| args.handle_error(exp, ArgumentError::Missing))?;
8
            if got != exp {
                return Err(args.handle_error(exp, ArgumentError::Invalid))?;
8
            }
        }
8
        let values = SharedRandCommitV1::from_unparsed(item)?;
8
        Ok(SharedRandCommit::V1(values))
8
    }
}
// For `ConsensusAuthoritySection`, see `dir_source.rs`.
define_derive_deftly! {
    /// Ad-hoc derive, `impl NetdocParseable for VoteAuthoritySection`
    ///
    /// We can't derive from `VoteAuthoritySection` with the normal macros, because
    /// it's not a document, with its own intro item.  It's just a collection of sub-documents.
    /// The netdoc derive macros don't have support for that - and it would be a fairly
    /// confusing thing to support because you'd end up with nested multiplicities and a whole
    /// variety of "intro item keywords" that were keywords for arbitrary sub-documents.
    ///
    /// Instead, we do that ad-hoc here.  It's less confusing because we don't need to
    /// worry about multiplicity, and because we know what only the outer document is
    /// that will contain this.
    VoteAuthoritySection:
    ${defcond F_NORMAL not(fmeta(netdoc(skip)))}
    #[cfg(feature = "incomplete")] // needs EncodedAuthCert, otherwise complete
    impl NetdocParseable for VoteAuthoritySection {
2
        fn doctype_for_error() -> &'static str {
            "vote.authority.section"
        }
314
        fn is_intro_item_keyword(kw: KeywordRef<'_>) -> bool {
            VoteAuthorityEntry::is_intro_item_keyword(kw)
        }
82
        fn is_structural_keyword(kw: KeywordRef<'_>) -> Option<IsStructural> {
          $(
            ${when F_NORMAL}
            if let y @ Some(_) = $ftype::is_structural_keyword(kw) {
                return y;
            }
          )
            None
        }
2
        fn from_items<'s>(
2
            input: &mut ItemStream<'s>,
2
            stop_outer: stop_at!(),
2
        ) -> Result<Self, ErrorProblem> {
            let stop_inner = stop_outer
              $(
                ${when F_NORMAL}
                | StopAt($ftype::is_intro_item_keyword)
              )
            ;
            Ok(VoteAuthoritySection { $(
                ${when F_NORMAL}
                $fname: NetdocParseable::from_items(input, stop_inner)?,
            )
                __non_exhaustive: (),
            })
        }
    }
    #[cfg(feature = "incomplete")]
    impl NetdocEncodable for VoteAuthoritySection {
        fn encode_unsigned(&self, out: &mut NetdocEncoder) -> Result<(), Bug> {
          $(
            ${when F_NORMAL}
            self.$fname.encode_unsigned(out)?;
          )
          Ok(())
        }
    }
}
/// An authority section in a vote
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#section:authority>
//
// We have split this out to help encapsulate vote/consensus-specific
// information in a forthcoming overall network status document type.
#[derive(Deftly, Clone, Debug)]
#[derive_deftly(VoteAuthoritySection, Constructor)]
#[allow(clippy::exhaustive_structs)]
#[cfg(feature = "incomplete")] // needs EncodedAuthCert, otherwise complete
pub struct VoteAuthoritySection {
    /// Authority entry
    #[deftly(constructor)]
    pub authority: VoteAuthorityEntry,
    /// Authority key certificate
    #[deftly(constructor)]
    pub cert: EmbeddedCert<AuthCert, EncodedAuthCert>,
    #[doc(hidden)]
    #[deftly(netdoc(skip))]
    pub __non_exhaustive: (),
}
/// Fields in the footer of a consensus
///
/// <https://spec.torproject.org/dir-spec/consensus-formats.html#section:footer>
///
/// Not the whole footer, because it lacks the `directory-footer` item.
#[derive(Debug, Clone, Deftly)]
#[derive_deftly(Constructor, NetdocEncodableFields, NetdocParseableFields)]
#[allow(clippy::exhaustive_structs)]
pub struct ConsensusFooterFields {
    /// `bandwidth-weights`
    ///
    /// <https://spec.torproject.org/dir-spec/consensus-formats.html#item:bandwidth-weights>
    #[deftly(netdoc(default))]
    pub bandwidth_weights: NetParams<i32>,
    #[doc(hidden)]
    #[deftly(netdoc(skip))]
    pub __non_exhaustive: (),
}
/// A consensus document that lists relays along with their
/// microdescriptor documents.
pub type MdConsensus = md::Consensus;
/// An MdConsensus that has been parsed and checked for timeliness,
/// but not for signatures.
pub type UnvalidatedMdConsensus = md::UnvalidatedConsensus;
/// An MdConsensus that has been parsed but not checked for signatures
/// and timeliness.
pub type UncheckedMdConsensus = md::UncheckedConsensus;
/// A consensus document that lists relays along with their
/// router descriptor documents.
pub type PlainConsensus = plain::Consensus;
/// An PlainConsensus that has been parsed and checked for timeliness,
/// but not for signatures.
pub type UnvalidatedPlainConsensus = plain::UnvalidatedConsensus;
/// An PlainConsensus that has been parsed but not checked for signatures
/// and timeliness.
pub type UncheckedPlainConsensus = plain::UncheckedConsensus;
decl_keyword! {
    /// Keywords that can be used in votes and consensuses.
    // TODO: This is public because otherwise we can't use it in the
    // ParseRouterStatus crate.  But I'd rather find a way to make it
    // private.
    #[non_exhaustive]
    #[allow(missing_docs)]
    pub NetstatusKwd {
        // Header
        "network-status-version" => NETWORK_STATUS_VERSION,
        "vote-status" => VOTE_STATUS,
        "consensus-methods" => CONSENSUS_METHODS,
        "consensus-method" => CONSENSUS_METHOD,
        "published" => PUBLISHED,
        "valid-after" => VALID_AFTER,
        "fresh-until" => FRESH_UNTIL,
        "valid-until" => VALID_UNTIL,
        "voting-delay" => VOTING_DELAY,
        "client-versions" => CLIENT_VERSIONS,
        "server-versions" => SERVER_VERSIONS,
        "known-flags" => KNOWN_FLAGS,
        "flag-thresholds" => FLAG_THRESHOLDS,
        "recommended-client-protocols" => RECOMMENDED_CLIENT_PROTOCOLS,
        "required-client-protocols" => REQUIRED_CLIENT_PROTOCOLS,
        "recommended-relay-protocols" => RECOMMENDED_RELAY_PROTOCOLS,
        "required-relay-protocols" => REQUIRED_RELAY_PROTOCOLS,
        "params" => PARAMS,
        "bandwidth-file-headers" => BANDWIDTH_FILE_HEADERS,
        "bandwidth-file-digest" => BANDWIDTH_FILE_DIGEST,
        // "package" is now ignored.
        // header in consensus, voter section in vote?
        "shared-rand-previous-value" => SHARED_RAND_PREVIOUS_VALUE,
        "shared-rand-current-value" => SHARED_RAND_CURRENT_VALUE,
        // Voter section (both)
        "dir-source" => DIR_SOURCE,
        "contact" => CONTACT,
        // voter section (vote, but not consensus)
        "legacy-dir-key" => LEGACY_DIR_KEY,
        "shared-rand-participate" => SHARED_RAND_PARTICIPATE,
        "shared-rand-commit" => SHARED_RAND_COMMIT,
        // voter section (consensus, but not vote)
        "vote-digest" => VOTE_DIGEST,
        // voter cert beginning (but only the beginning)
        "dir-key-certificate-version" => DIR_KEY_CERTIFICATE_VERSION,
        // routerstatus
        "r" => RS_R,
        "a" => RS_A,
        "s" => RS_S,
        "v" => RS_V,
        "pr" => RS_PR,
        "w" => RS_W,
        "p" => RS_P,
        "m" => RS_M,
        "id" => RS_ID,
        // footer
        "directory-footer" => DIRECTORY_FOOTER,
        "bandwidth-weights" => BANDWIDTH_WEIGHTS,
        "directory-signature" => DIRECTORY_SIGNATURE,
    }
}
/// Shared parts of rules for all kinds of netstatus headers
56
static NS_HEADER_RULES_COMMON_: LazyLock<SectionRulesBuilder<NetstatusKwd>> = LazyLock::new(|| {
    use NetstatusKwd::*;
56
    let mut rules = SectionRules::builder();
56
    rules.add(NETWORK_STATUS_VERSION.rule().required().args(1..=2));
56
    rules.add(VOTE_STATUS.rule().required().args(1..));
56
    rules.add(VALID_AFTER.rule().required());
56
    rules.add(FRESH_UNTIL.rule().required());
56
    rules.add(VALID_UNTIL.rule().required());
56
    rules.add(VOTING_DELAY.rule().args(2..));
56
    rules.add(CLIENT_VERSIONS.rule());
56
    rules.add(SERVER_VERSIONS.rule());
56
    rules.add(KNOWN_FLAGS.rule().required());
56
    rules.add(RECOMMENDED_CLIENT_PROTOCOLS.rule().args(1..));
56
    rules.add(RECOMMENDED_RELAY_PROTOCOLS.rule().args(1..));
56
    rules.add(REQUIRED_CLIENT_PROTOCOLS.rule().args(1..));
56
    rules.add(REQUIRED_RELAY_PROTOCOLS.rule().args(1..));
56
    rules.add(PARAMS.rule());
56
    rules
56
});
/// Rules for parsing the header of a consensus.
56
static NS_HEADER_RULES_CONSENSUS: LazyLock<SectionRules<NetstatusKwd>> = LazyLock::new(|| {
    use NetstatusKwd::*;
56
    let mut rules = NS_HEADER_RULES_COMMON_.clone();
56
    rules.add(CONSENSUS_METHOD.rule().args(1..=1));
56
    rules.add(SHARED_RAND_PREVIOUS_VALUE.rule().args(2..));
56
    rules.add(SHARED_RAND_CURRENT_VALUE.rule().args(2..));
56
    rules.add(UNRECOGNIZED.rule().may_repeat().obj_optional());
56
    rules.build()
56
});
/*
/// Rules for parsing the header of a vote.
static NS_HEADER_RULES_VOTE: SectionRules<NetstatusKwd> = {
    use NetstatusKwd::*;
    let mut rules = NS_HEADER_RULES_COMMON_.clone();
    rules.add(CONSENSUS_METHODS.rule().args(1..));
    rules.add(FLAG_THRESHOLDS.rule());
    rules.add(BANDWIDTH_FILE_HEADERS.rule());
    rules.add(BANDWIDTH_FILE_DIGEST.rule().args(1..));
    rules.add(UNRECOGNIZED.rule().may_repeat().obj_optional());
    rules
};
/// Rules for parsing a single voter's information in a vote.
static NS_VOTERINFO_RULES_VOTE: SectionRules<NetstatusKwd> = {
    use NetstatusKwd::*;
    let mut rules = SectionRules::new();
    rules.add(DIR_SOURCE.rule().required().args(6..));
    rules.add(CONTACT.rule().required());
    rules.add(LEGACY_DIR_KEY.rule().args(1..));
    rules.add(SHARED_RAND_PARTICIPATE.rule().no_args());
    rules.add(SHARED_RAND_COMMIT.rule().may_repeat().args(4..));
    rules.add(SHARED_RAND_PREVIOUS_VALUE.rule().args(2..));
    rules.add(SHARED_RAND_CURRENT_VALUE.rule().args(2..));
    // then comes an entire cert: When we implement vote parsing,
    // we should use the authcert code for handling that.
    rules.add(UNRECOGNIZED.rule().may_repeat().obj_optional());
    rules
};
 */
/// Rules for parsing a single voter's information in a consensus
56
static NS_VOTERINFO_RULES_CONSENSUS: LazyLock<SectionRules<NetstatusKwd>> = LazyLock::new(|| {
    use NetstatusKwd::*;
56
    let mut rules = SectionRules::builder();
56
    rules.add(DIR_SOURCE.rule().required().args(6..));
56
    rules.add(CONTACT.rule().required());
56
    rules.add(VOTE_DIGEST.rule().required());
56
    rules.add(UNRECOGNIZED.rule().may_repeat().obj_optional());
56
    rules.build()
56
});
/// Shared rules for parsing a single routerstatus
static NS_ROUTERSTATUS_RULES_COMMON_: LazyLock<SectionRulesBuilder<NetstatusKwd>> =
56
    LazyLock::new(|| {
        use NetstatusKwd::*;
56
        let mut rules = SectionRules::builder();
56
        rules.add(RS_A.rule().may_repeat().args(1..));
56
        rules.add(RS_S.rule().required());
56
        rules.add(RS_V.rule());
56
        rules.add(RS_PR.rule().required());
56
        rules.add(RS_W.rule());
56
        rules.add(RS_P.rule().args(2..));
56
        rules.add(UNRECOGNIZED.rule().may_repeat().obj_optional());
56
        rules
56
    });
/// Rules for parsing a single routerstatus in an NS consensus
2
static NS_ROUTERSTATUS_RULES_PLAIN: LazyLock<SectionRules<NetstatusKwd>> = LazyLock::new(|| {
    use NetstatusKwd::*;
2
    let mut rules = NS_ROUTERSTATUS_RULES_COMMON_.clone();
2
    rules.add(RS_R.rule().required().args(8..));
2
    rules.build()
2
});
/*
/// Rules for parsing a single routerstatus in a vote
static NS_ROUTERSTATUS_RULES_VOTE: SectionRules<NetstatusKwd> = {
    use NetstatusKwd::*;
        let mut rules = NS_ROUTERSTATUS_RULES_COMMON_.clone();
        rules.add(RS_R.rule().required().args(8..));
        rules.add(RS_M.rule().may_repeat().args(2..));
        rules.add(RS_ID.rule().may_repeat().args(2..)); // may-repeat?
        rules
    };
*/
/// Rules for parsing a single routerstatus in a microdesc consensus
56
static NS_ROUTERSTATUS_RULES_MDCON: LazyLock<SectionRules<NetstatusKwd>> = LazyLock::new(|| {
    use NetstatusKwd::*;
56
    let mut rules = NS_ROUTERSTATUS_RULES_COMMON_.clone();
56
    rules.add(RS_R.rule().required().args(6..));
56
    rules.add(RS_M.rule().required().args(1..));
56
    rules.build()
56
});
/// Rules for parsing consensus fields from a footer.
56
static NS_FOOTER_RULES: LazyLock<SectionRules<NetstatusKwd>> = LazyLock::new(|| {
    use NetstatusKwd::*;
56
    let mut rules = SectionRules::builder();
56
    rules.add(DIRECTORY_FOOTER.rule().required().no_args());
    // consensus only
56
    rules.add(BANDWIDTH_WEIGHTS.rule());
56
    rules.add(UNRECOGNIZED.rule().may_repeat().obj_optional());
56
    rules.build()
56
});
impl ProtoStatus {
    /// Construct a ProtoStatus from two chosen keywords in a section.
784
    fn from_section(
784
        sec: &Section<'_, NetstatusKwd>,
784
        recommend_token: NetstatusKwd,
784
        required_token: NetstatusKwd,
784
    ) -> crate::Result<ProtoStatus> {
        /// Helper: extract a Protocols entry from an item's arguments.
1568
        fn parse(t: Option<&Item<'_, NetstatusKwd>>) -> crate::Result<Protocols> {
1568
            if let Some(item) = t {
1568
                item.args_as_str()
1568
                    .parse::<Protocols>()
1568
                    .map_err(|e| EK::BadArgument.at_pos(item.pos()).with_source(e))
            } else {
                Ok(Protocols::new())
            }
1568
        }
784
        let recommended = parse(sec.get(recommend_token))?;
784
        let required = parse(sec.get(required_token))?;
784
        Ok(ProtoStatus {
784
            recommended,
784
            required,
784
        })
784
    }
    /// Return the protocols that are listed as "required" in this `ProtoStatus`.
    ///
    /// Implementations may assume that relays on the network implement all the
    /// protocols in the relays' required-protocols list.  Implementations should
    /// refuse to start if they do not implement all the protocols on their own
    /// (client or relay) required-protocols list.
2538
    pub fn required_protocols(&self) -> &Protocols {
2538
        &self.required
2538
    }
    /// Return the protocols that are listed as "recommended" in this `ProtoStatus`.
    ///
    /// Implementations should warn if they do not implement all the protocols
    /// on their own (client or relay) recommended-protocols list.
    pub fn recommended_protocols(&self) -> &Protocols {
        &self.recommended
    }
}
impl<T> std::str::FromStr for NetParams<T>
where
    T: std::str::FromStr,
    T::Err: std::error::Error,
{
    type Err = Error;
17870
    fn from_str(s: &str) -> crate::Result<Self> {
        /// Helper: parse a single K=V pair.
22588
        fn parse_pair<U>(p: &str) -> crate::Result<(String, U)>
22588
        where
22588
            U: std::str::FromStr,
22588
            U::Err: std::error::Error,
        {
22588
            let parts: Vec<_> = p.splitn(2, '=').collect();
22588
            if parts.len() != 2 {
                return Err(EK::BadArgument
                    .at_pos(Pos::at(p))
                    .with_msg("Missing = in key=value list"));
22588
            }
22588
            let num = parts[1].parse::<U>().map_err(|e| {
8
                EK::BadArgument
8
                    .at_pos(Pos::at(parts[1]))
8
                    .with_msg(e.to_string())
8
            })?;
22580
            Ok((parts[0].to_string(), num))
22588
        }
17870
        let params = s
17870
            .split(' ')
35614
            .filter(|p| !p.is_empty())
17870
            .map(parse_pair)
17870
            .try_collect()?;
17862
        Ok(NetParams { params })
17870
    }
}
impl FromStr for SharedRandVal {
    type Err = Error;
4
    fn from_str(s: &str) -> crate::Result<Self> {
4
        let val: B64 = s.parse()?;
4
        let val = SharedRandVal(val.into_array()?);
4
        Ok(val)
4
    }
}
impl Display for SharedRandVal {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        Display::fmt(&B64::from(Vec::from(self.0)), f)
    }
}
impl NormalItemArgument for SharedRandVal {}
impl SharedRandStatus {
    /// Parse a current or previous shared rand value from a given
    /// SharedRandPreviousValue or SharedRandCurrentValue.
6
    fn from_item(item: &Item<'_, NetstatusKwd>) -> crate::Result<Self> {
6
        match item.kwd() {
4
            NetstatusKwd::SHARED_RAND_PREVIOUS_VALUE | NetstatusKwd::SHARED_RAND_CURRENT_VALUE => {}
            _ => {
2
                return Err(Error::from(internal!(
2
                    "wrong keyword {:?} on shared-random value",
2
                    item.kwd()
2
                ))
2
                .at_pos(item.pos()));
            }
        }
4
        let n_reveals: u8 = item.parse_arg(0)?;
4
        let value: SharedRandVal = item.parse_arg(1)?;
        // Added in proposal 342
4
        let timestamp = item.parse_optional_arg::<Iso8601TimeNoSp>(2)?;
4
        Ok(SharedRandStatus {
4
            n_reveals,
4
            value,
4
            timestamp,
4
        })
6
    }
    /// Return the actual shared random value.
1296
    pub fn value(&self) -> &SharedRandVal {
1296
        &self.value
1296
    }
    /// Return the timestamp (if any) associated with this `SharedRandValue`.
3564
    pub fn timestamp(&self) -> Option<std::time::SystemTime> {
3564
        self.timestamp.map(|t| t.0)
3564
    }
}
impl DirSource {
    /// Parse a "dir-source" item
1178
    fn from_item(item: &Item<'_, NetstatusKwd>) -> crate::Result<Self> {
1178
        if item.kwd() != NetstatusKwd::DIR_SOURCE {
            return Err(
                Error::from(internal!("Bad keyword {:?} on dir-source", item.kwd()))
                    .at_pos(item.pos()),
            );
1178
        }
1178
        let nickname = item
1178
            .required_arg(0)?
1178
            .parse()
1178
            .map_err(|e: InvalidNickname| {
                EK::BadArgument.at_pos(item.pos()).with_msg(e.to_string())
            })?;
1178
        let identity = item.parse_arg(1)?;
1178
        let hostname = item
1178
            .required_arg(2)?
1178
            .parse()
1178
            .map_err(|e: InvalidInternetHost| {
                EK::BadArgument.at_pos(item.pos()).with_msg(e.to_string())
            })?;
1178
        let ip = item.parse_arg(3)?;
1178
        let dir_port = item.parse_arg(4)?;
1178
        let or_port = item.parse_arg(5)?;
1178
        Ok(DirSource {
1178
            nickname,
1178
            identity,
1178
            hostname,
1178
            ip,
1178
            dir_port,
1178
            or_port,
1178
            __non_exhaustive: (),
1178
        })
1178
    }
}
impl ConsensusAuthorityEntry {
    /// Parse a single ConsensusAuthorityEntry from a voter info section.
1178
    fn from_section(sec: &Section<'_, NetstatusKwd>) -> crate::Result<ConsensusAuthorityEntry> {
        use NetstatusKwd::*;
        // this unwrap should be safe because if there is not at least one
        // token in the section, the section is unparsable.
        #[allow(clippy::unwrap_used)]
1178
        let first = sec.first_item().unwrap();
1178
        if first.kwd() != DIR_SOURCE {
            return Err(Error::from(internal!(
                "Wrong keyword {:?} at start of voter info",
                first.kwd()
            ))
            .at_pos(first.pos()));
1178
        }
1178
        let dir_source = DirSource::from_item(sec.required(DIR_SOURCE)?)?;
1178
        let contact = sec.required(CONTACT)?;
        // Ideally we would parse_args_as_str but that requires us to
        // impl From<InvalidContactInfo> for crate::Error which is wrong
        // because many it's a footgun which lets you just write ? here
        // resulting in lack of position information.
        // (This is a general problem with the error handling in crate::parse.)
1178
        let contact = contact
1178
            .args_as_str()
1178
            .parse()
1178
            .map_err(|err: InvalidContactInfo| {
                EK::BadArgument
                    .with_msg(err.to_string())
                    .at_pos(contact.pos())
            })?;
1178
        let vote_digest = sec.required(VOTE_DIGEST)?.parse_arg::<B16U>(0)?;
1178
        Ok(ConsensusAuthorityEntry {
1178
            dir_source,
1178
            contact,
1178
            vote_digest,
1178
            __non_exhaustive: (),
1178
        })
1178
    }
}
impl RelayWeightsItem {
    /// Return a new `RelayWeightsItem` containing no information
    ///
    /// As if parsed from a document with no `w` line, discarding unknown information.
2114
    pub fn new_no_info() -> Self {
2114
        RelayWeightsItem {
2114
            effective: RelayWeight::default(),
2114
            params: Unknown::new_discard(),
2114
        }
2114
    }
    /// Return a new `RelayWeightsItem` containing only the effective weight
    pub fn from_effective(effective: RelayWeight) -> Self {
        RelayWeightsItem {
            effective,
            params: Unknown::new_discard(),
        }
    }
    /// Get the effective relay weight (bandwidth estimate) for path selection.
    ///
    /// Invariant: consistent with from [`params`](RelayWeightsItem::params),
    /// if `parsed` isn't [`Discarded`](Unknown::Discarded).
    //
    // We open-code this rather than deriving it so we can provide better docs.
    pub fn effective(&self) -> RelayWeight {
        self.effective
    }
    /// Get the complete parameter set, if this information is available.
    ///
    /// After parsing, this is the parsed but not interpreted `w` item,
    /// or `None` if the document contained no `w` item.
    //
    // We open-code this rather than deriving it because we want to return
    // `Unknown<&...>` rather than `&Unknown<..>`, which the user would just have to .as_ref().
    pub fn params(&self) -> Unknown<&Option<NetParams<u32>>> {
        self.params.as_ref()
    }
    /// Parse a routerweight from a "w" line.
2126
    fn from_item(item: &Item<'_, NetstatusKwd>) -> crate::Result<RelayWeightsItem> {
2126
        if item.kwd() != NetstatusKwd::RS_W {
6
            return Err(
6
                Error::from(internal!("Wrong keyword {:?} on W line", item.kwd()))
6
                    .at_pos(item.pos()),
6
            );
2120
        }
2120
        let params = item.args_as_str().parse()?;
2118
        let effective = RelayWeight::from_net_params(&params).map_err(|e| e.at_pos(item.pos()))?;
2118
        Ok(RelayWeightsItem {
2118
            effective,
2118
            params: Unknown::new_discard(),
2118
        })
2126
    }
    /// The keyword for parsing and encoding
    const KEYWORD: &str = "w";
}
#[cfg(feature = "retain-unknown")]
impl Default for RelayWeightsItem {
    fn default() -> Self {
        RelayWeightsItem {
            effective: RelayWeight::default(),
            params: Unknown::Retained(None),
        }
    }
}
impl RelayWeight {
    /// Return true if this weight is the result of a successful measurement
26740
    pub fn is_measured(&self) -> bool {
26740
        matches!(self, RelayWeight::Measured(_))
26740
    }
    /// Return true if this weight is nonzero
25228
    pub fn is_nonzero(&self) -> bool {
25228
        !matches!(self, RelayWeight::Unmeasured(0) | RelayWeight::Measured(0))
25228
    }
    /// Parse a routerweight from partially-parsed `w` line in the form of a `NetParams`
    ///
    /// This function is the common part shared between `parse2` and `parse`.
2118
    fn from_net_params(params: &NetParams<u32>) -> crate::Result<RelayWeight> {
2118
        params
2118
            .try_into()
2118
            .map_err(|e: InvalidRelayWeights| EK::BadArgument.with_msg(e.to_string()))
2118
    }
}
impl Default for RelayWeight {
2114
    fn default() -> RelayWeight {
2114
        RelayWeight::Unmeasured(0)
2114
    }
}
impl TryFrom<&NetParams<u32>> for RelayWeight {
    type Error = InvalidRelayWeights;
2592
    fn try_from(params: &NetParams<u32>) -> Result<RelayWeight, InvalidRelayWeights> {
2592
        let bw = params.params.get("Bandwidth");
2592
        let unmeas = params.params.get("Unmeasured");
2592
        let bw = match bw {
2
            None => return Ok(RelayWeight::Unmeasured(0)),
2590
            Some(b) => *b,
        };
2590
        match unmeas {
448
            None | Some(0) => Ok(RelayWeight::Measured(bw)),
2142
            Some(1) => Ok(RelayWeight::Unmeasured(bw)),
            _ => Err(InvalidRelayWeights::InvalidUnmeasured),
        }
2592
    }
}
#[cfg(feature = "retain-unknown")]
impl TryFrom<NetParams<u32>> for RelayWeightsItem {
    type Error = InvalidRelayWeights;
    fn try_from(params: NetParams<u32>) -> Result<RelayWeightsItem, InvalidRelayWeights> {
        Ok(RelayWeightsItem {
            effective: (&params).try_into()?,
            params: Unknown::Retained(Some(params)),
        })
    }
}
/// `parse2` impls for types in this modulea
///
/// Separate module for a separate namespace.
mod parse2_impls {
    use super::*;
    pub(super) use parse2::{
        ArgumentError as AE, ArgumentStream, ErrorProblem as EP, ItemArgumentParseable,
        ItemValueParseable, NetdocParseableFields,
    };
    use std::result::Result;
    // The NormalItemArgument bound ensures that this is applied only to sane types eg integers
    impl<T: FromStr + NormalItemArgument> ItemValueParseable for NetParams<T>
    where
        T::Err: std::error::Error,
    {
712
        fn from_unparsed(item: parse2::UnparsedItem<'_>) -> Result<Self, EP> {
712
            item.check_no_object()?;
712
            item.args_copy()
712
                .into_remaining()
712
                .parse()
712
                .map_err(item.invalid_argument_handler("parameters"))
712
        }
    }
    impl NetdocParseableFields for RelayWeightsItem {
        type Accumulator = Option<NetParams<u32>>;
474
        fn is_item_keyword(kw: KeywordRef) -> bool {
474
            kw == Self::KEYWORD
474
        }
474
        fn accumulate_item(acc: &mut Self::Accumulator, item: UnparsedItem) -> Result<(), EP> {
474
            if acc.is_some() {
                return Err(EP::ItemRepeated);
474
            }
474
            item.check_no_object()?;
474
            let params = NetParams::from_unparsed(item)?;
474
            *acc = Some(params);
474
            Ok(())
474
        }
474
        fn finish(params: Self::Accumulator, items: &ItemStream) -> Result<Self, EP> {
474
            let effective = params
474
                .as_ref()
474
                .map(TryFrom::try_from)
474
                .transpose()
474
                .map_err(|_| EP::OtherBadDocument("invalid information in `w` item"))?
474
                .unwrap_or_default();
474
            let params = items.parse_options().retain_unknown_values.map(|()| params);
474
            Ok(RelayWeightsItem { effective, params })
474
        }
    }
    impl ItemValueParseable for rs::SoftwareVersion {
474
        fn from_unparsed(mut item: parse2::UnparsedItem<'_>) -> Result<Self, EP> {
474
            item.check_no_object()?;
474
            item.args_mut()
474
                .into_remaining()
474
                .parse()
474
                .map_err(item.invalid_argument_handler("version"))
474
        }
    }
    impl ItemArgumentParseable for IgnoredPublicationTimeSp {
460
        fn from_args(a: &mut ArgumentStream) -> Result<IgnoredPublicationTimeSp, AE> {
942
            let mut next_arg = || a.next().ok_or(AE::Missing);
460
            let _: &str = next_arg()?;
460
            let _: &str = next_arg()?;
460
            Ok(IgnoredPublicationTimeSp)
460
        }
    }
}
/// `encode` impls for types in this modulea
///
/// Separate module for a separate namespace.
mod encode_impls {
    use super::*;
    use std::result::Result;
    pub(crate) use {
        crate::encode::{ItemEncoder, ItemValueEncodable, NetdocEncodableFields},
        tor_error::Bug,
    };
    #[cfg(feature = "incomplete")] // untested
    impl NetdocEncodableFields for RelayWeightsItem {
28
        fn encode_fields(&self, out: &mut NetdocEncoder) -> Result<(), Bug> {
28
            if let Some(w) = self.params.as_ref().into_retained()? {
28
                w.write_item_value_onto(out.item(Self::KEYWORD))?;
            }
28
            Ok(())
28
        }
    }
    // The NormalItemArgument bound ensures that this is applied only to sane types eg integers
    impl<T: NormalItemArgument + Ord + Display> ItemValueEncodable for NetParams<T> {
44
        fn write_item_value_onto(&self, mut out: ItemEncoder) -> Result<(), Bug> {
148
            for (k, v) in self.iter().collect::<BTreeSet<_>>() {
148
                if k.is_empty()
146
                    || k.chars()
967
                        .any(|c| c.is_whitespace() || c.is_control() || c == '=')
                {
                    // TODO torspec#401 see TODO in NetParams<T> definition
8
                    return Err(bad_api_usage!(
8
                        "tried to encode NetParms with unreasonable keyword {k:?}"
8
                    ));
140
                }
140
                out.args_raw_string(&format_args!("{k}={v}"));
            }
36
            Ok(())
44
        }
    }
    impl ItemValueEncodable for rs::SoftwareVersion {
28
        fn write_item_value_onto(&self, mut out: ItemEncoder) -> Result<(), Bug> {
28
            out.args_raw_string(self);
28
            Ok(())
28
        }
    }
    impl ItemArgument for IgnoredPublicationTimeSp {
28
        fn write_arg_onto(&self, out: &mut ItemEncoder) -> Result<(), Bug> {
28
            out.args_raw_string(&"2000-01-01 00:00:01");
28
            Ok(())
28
        }
    }
}
impl ConsensusFooterFields {
    /// Parse a directory footer from a footer section.
384
    fn from_section(sec: &Section<'_, NetstatusKwd>) -> crate::Result<ConsensusFooterFields> {
        use NetstatusKwd::*;
384
        sec.required(DIRECTORY_FOOTER)?;
384
        let bandwidth_weights = sec
384
            .maybe(BANDWIDTH_WEIGHTS)
384
            .args_as_str()
384
            .unwrap_or("")
384
            .parse()?;
382
        Ok(ConsensusFooterFields {
382
            bandwidth_weights,
382
            __non_exhaustive: (),
382
        })
384
    }
}
/// `ProtoStatuses` parsing and encoding
///
/// Separate module for separate namespace
mod proto_statuses_parse2_encode {
    use super::encode_impls::*;
    use super::parse2_impls::*;
    use super::*;
    use paste::paste;
    use std::result::Result;
    /// Implements `NetdocParseableFields` for `ProtoStatuses`
    ///
    /// We have this macro so that it's impossible to write things like
    /// ```text
    ///      ProtoStatuses {
    ///          client: ProtoStatus {
    ///              recommended: something something recommended_relay_versions something,
    /// ```
    ///
    /// (The structure of `ProtoStatuses` means the normal parse2 derive won't work for it.
    /// Note the bug above: the recommended *relay* version info is put in the *client* field.
    /// Preventing this bug must involve: avoiding writing twice the field name elements,
    /// such as `relay` and `client`, during this kind of construction/conversion.)
    macro_rules! impl_proto_statuses { { $( $rr:ident $cr:ident; )* } => { paste! {
        #[derive(Deftly)]
        #[derive_deftly(NetdocParseableFields)]
        // Only ProtoStatusesParseNetdocParseAccumulator is exposed.
        #[allow(unreachable_pub)]
        pub struct ProtoStatusesParseHelper {
            $(
                #[deftly(netdoc(default))]
                [<$rr _ $cr _protocols>]: Protocols,
            )*
        }
        /// Partially parsed `ProtoStatuses`
        pub use ProtoStatusesParseHelperNetdocParseAccumulator
            as ProtoStatusesNetdocParseAccumulator;
        impl NetdocParseableFields for ProtoStatuses {
            type Accumulator = ProtoStatusesNetdocParseAccumulator;
32
            fn is_item_keyword(kw: KeywordRef<'_>) -> bool {
32
                ProtoStatusesParseHelper::is_item_keyword(kw)
32
            }
16
            fn accumulate_item(
16
                acc: &mut Self::Accumulator,
16
                item: UnparsedItem<'_>,
16
            ) -> Result<(), EP> {
16
                ProtoStatusesParseHelper::accumulate_item(acc, item)
16
            }
4
            fn finish(acc: Self::Accumulator, items: &ItemStream<'_>) -> Result<Self, EP> {
4
                let parse = ProtoStatusesParseHelper::finish(acc, items)?;
4
                let mut out = ProtoStatuses::default();
                $(
4
                    out.$cr.$rr = parse.[< $rr _ $cr _protocols >];
                )*
4
                Ok(out)
4
            }
        }
        impl NetdocEncodableFields for ProtoStatuses {
4
            fn encode_fields(&self, out: &mut NetdocEncoder) -> Result<(), Bug> {
              $(
4
                self.$cr.$rr.write_item_value_onto(
4
                    out.item(concat!(stringify!($rr), "-", stringify!($cr), "-protocols"))
                )?;
              )*
4
                Ok(())
4
            }
        }
    } } }
    impl_proto_statuses! {
        recommended client;
        recommended relay;
        required client;
        required relay;
    }
}
impl Signature {
    /// Parse a Signature from a directory-signature section
1148
    fn from_item(item: &Item<'_, NetstatusKwd>) -> crate::Result<Signature> {
1148
        if item.kwd() != NetstatusKwd::DIRECTORY_SIGNATURE {
            return Err(Error::from(internal!(
                "Wrong keyword {:?} for directory signature",
                item.kwd()
            ))
            .at_pos(item.pos()));
1148
        }
1148
        let (digest_algo, id_fp, sk_fp) = if item.n_args() > 2 {
            (
1140
                item.required_arg(0)?,
1140
                item.required_arg(1)?,
1140
                item.required_arg(2)?,
            )
        } else {
            // TODO #2530 digest_algo needs to depend on whether SHA1 was stated
8
            ("sha1", item.required_arg(0)?, item.required_arg(1)?)
        };
1148
        let digest_algo = digest_algo.to_string().parse().void_unwrap();
1148
        let digest_algo = DigestAlgoInSignature(Some(digest_algo));
1148
        let id_fingerprint = id_fp.parse::<Fingerprint>()?.into();
1148
        let sk_fingerprint = sk_fp.parse::<Fingerprint>()?.into();
1148
        let key_ids = AuthCertKeyIds {
1148
            id_fingerprint,
1148
            sk_fingerprint,
1148
        };
1148
        let signature = item.obj("SIGNATURE")?;
1148
        Ok(Signature {
1148
            digest_algo,
1148
            key_ids,
1148
            signature,
1148
        })
1148
    }
    /// Return true if this signature has the identity key and signing key
    /// that match a given cert.
852
    fn matches_cert(&self, cert: &AuthCert) -> bool {
852
        cert.key_ids() == self.key_ids
852
    }
    /// If possible, find the right certificate for checking this signature
    /// from among a slice of certificates.
1208
    fn find_cert<'a>(&self, certs: &'a [AuthCert]) -> Option<&'a AuthCert> {
1334
        certs.iter().find(|&c| self.matches_cert(c))
1208
    }
    /// Find the certificate and assemble the pieces ready for verification
    ///
    /// `None` means precisely that we're missing the authcert.
198
    fn signature_to_verify<'r>(
198
        &'r self,
198
        signed_digest: &'r [u8],
198
        certs: &'r [AuthCert],
198
    ) -> Option<ConsensusSignatureToVerify> {
198
        let cert = self.find_cert(certs)?;
140
        let key = cert.signing_key();
140
        Some(ConsensusSignatureToVerify {
140
            key,
140
            signed_digest,
140
            signature: &self.signature,
140
        })
198
    }
}
impl EncodeOrd for Signature {
12
    fn encode_cmp(&self, other: &Self) -> std::cmp::Ordering {
30
        let k: for<'s> fn(&'_ Signature) -> (&'_ _, &'_ _) = |s| (&s.key_ids, &s.signature);
12
        Ord::cmp(&k(self), &k(other))
12
    }
}
/// Signature information in a consensus, to be verified
///
/// Used by callers of [`SignatureGroup::verify_general`],
/// to allow verification to be suppressed if all we wanted to know was
/// whether we have enough signatures and enough authcerts.
//
// TODO DIRAUTH make this module-private when poc is abolished
#[derive(Debug, Clone, Copy)]
pub(crate) struct ConsensusSignatureToVerify<'r> {
    /// KP_auth_sign_rsa
    key: &'r ll::pk::rsa::PublicKey,
    /// The digest (actual RSA signature payload, before PKCS#11 padding)
    signed_digest: &'r [u8],
    /// The RSA signature value
    signature: &'r [u8],
}
/// Token indicating that signature verification has been done, if required
///
/// Prevents accidentally passing an unintended no-op function as
/// `do_verify` to [`SignatureGroup::verify_general`].
///
/// Write `SignatureVerifiedIfIntended {}` to construct this,
/// only in code which has actually done the verification,
/// or code which is deliberately not verifying at all.
pub(crate) struct SignatureVerifiedIfIntended {}
impl<'r> ConsensusSignatureToVerify<'r> {
    /// Verify this signature
    ///
    // TODO DIRAUTH make this module-private when poc is abolished
140
    pub(crate) fn verify(self) -> Result<SignatureVerifiedIfIntended, VerifyFailed> {
140
        self.key.verify(self.signed_digest, self.signature)?;
140
        Ok(SignatureVerifiedIfIntended {})
140
    }
}
/// How `verify_general` should decide who is a trusted authority
///
/// Don't use this for other purposes
#[derive(Debug, Clone, Copy)]
pub(crate) enum VerifyGeneralTrustedAuthorities<'r> {
    /// Trust these authorities.
    TrustThese {
        /// The HKP_auth_id_rsa
        trusted: &'r [RsaIdentity],
    },
    /// For the benefit of `SignatureGroup::validate`, used by the old parser, only
    ///
    /// Every `AuthCert` passed to `verify_general` is a real authority (!)
    /// (But not necessarily a different one!)
    HazardouslyAssumeAllAuthCertsAreReal {
        /// Total number of authorities that we trust
        ///
        /// Used only to calculate the threshold
        n_authorities: usize,
    },
}
/// Return the minimum number of authorities that we need signatures from
///
/// Enough is strictly more than half.
///
/// The returned value is a [`RangeFrom`](std::ops::RangeFrom), ie an inclusive range.
/// Its `start` value is the minimum acceptable number of authorities
/// from whom we have good signatures.
///
/// Should usually be followed by
/// [`.contains`](std::ops::RangeFrom::contains)`(&actual_number)`.
///
/// # Example
///
/// ```
/// use tor_netdoc::{doc::netstatus::consensus_threshold, parse2::VerifyFailed};
/// # fn main() -> Result<(), VerifyFailed> {
///
/// let n_trusted_authorities = 3;
/// let n_good_signatures_from_different_authorities = 2;
///
/// if consensus_threshold(n_trusted_authorities)
///      .contains(&n_good_signatures_from_different_authorities)
/// {
///     Ok(())
/// } else {
///     Err(VerifyFailed::InsufficientTrustedSigners)
/// }
/// # }
/// ```
680
pub fn consensus_threshold(n_authorities: usize) -> std::ops::RangeFrom<usize> {
680
    (n_authorities / 2) + 1 // strict majority
680
        ..
680
}
impl SignatureGroup {
    // TODO: these functions are pretty similar and could probably stand to be
    // refactored a lot.
    /// Helper: Return a pair of the number of possible authorities'
    /// signatures in this object for which we _could_ find certs, and
    /// a list of the signatures we couldn't find certificates for.
336
    fn list_missing(&self, certs: &[AuthCert]) -> (usize, Vec<&Signature>) {
336
        let mut ok: HashSet<RsaIdentity> = HashSet::new();
336
        let mut missing = Vec::new();
1010
        for sig in &self.signatures {
1010
            let id_fingerprint = &sig.key_ids.id_fingerprint;
1010
            if ok.contains(id_fingerprint) {
                continue;
1010
            }
1010
            if sig.find_cert(certs).is_some() {
186
                ok.insert(*id_fingerprint);
186
                continue;
824
            }
824
            missing.push(sig);
        }
336
        (ok.len(), missing)
336
    }
    /// Given a list of authority identity key fingerprints, return true if
    /// this signature group is _potentially_ well-signed according to those
    /// authorities.
280
    fn could_validate(&self, authorities: &[&RsaIdentity]) -> bool {
280
        let mut signed_by: HashSet<RsaIdentity> = HashSet::new();
844
        for sig in &self.signatures {
844
            let id_fp = &sig.key_ids.id_fingerprint;
844
            if signed_by.contains(id_fp) {
                // Already found this in the list.
                continue;
844
            }
844
            if authorities.contains(&id_fp) {
450
                signed_by.insert(*id_fp);
450
            }
        }
280
        consensus_threshold(authorities.len()).contains(&signed_by.len())
280
    }
    /// Return true if the signature group defines a valid signature.
    ///
    /// A signature is valid if it signed by more than half of the
    /// authorities.  This API requires that `n_authorities` is the number of
    /// authorities we believe in, and that every cert in `certs` belongs
    /// to a real authority.
60
    fn validate(&self, n_authorities: usize, certs: &[AuthCert]) -> Result<(), VerifyFailed> {
        // TODO we ought to take the set of trusted authorities as an argument,
        // rather than use VGTA::HazardouslyAssumeAllAuthCertsAreReal.
60
        self.verify_general(
60
            VerifyGeneralTrustedAuthorities::HazardouslyAssumeAllAuthCertsAreReal { n_authorities },
60
            certs,
124
            |tv| tv.verify(),
        )
60
    }
    /// Check signatures (maybe), but not timeliness
    ///
    /// Examines the signatures and collates them with authcerts.
    /// Performs the necessary consensus signature verifications, via `do_verify`.
    ///
    /// If there are not enough authcerts or not enough signatures,
    /// throws a `ConsensusVerifiabilityError`.
    ///
    /// Differs from [`SignatureGroup::validate`]:
    ///
    ///  * Intended also for use with types from parse2.
    ///
    ///  * Yields information about missing authcerts directly in the return value,
    ///    and can be used without actually doing the verification,
    ///    so there's no need for a separate "which certs are we missing" function.
    ///
    ///  * Threshold is passed as a parameter (wanted for votes).
    ///
    ///  * Ability to check authority identities, by passing `trusted_authorities`.
    ///    (done with `authorities_are_correct` in old parser,
    ///    apparently with no engineered safeguard against consensus user omitting to do so).
    ///
    ///    **If `trusted_authorities` is None, all authorities in `certs` are treated as trusted**.
    ///
    ///  * Returns `Result`, not a boolean
    ///
    ///  * We prefer the term `verify` to `validate`.  All this does is signature verification.
    ///
    // TODO DIRAUTH make this module-private when poc is abolished
64
    pub(crate) fn verify_general<E>(
64
        &self,
64
        trusted_authorities: VerifyGeneralTrustedAuthorities,
64
        certs: &[AuthCert],
64
        do_verify: impl Fn(ConsensusSignatureToVerify) -> Result<SignatureVerifiedIfIntended, E>,
64
    ) -> Result<(), E>
64
    where
64
        ConsensusVerifiabilityError: Into<E>,
    {
        use VerifyGeneralTrustedAuthorities as TA;
        // A set of the authorities (by identity) who have have signed
        // this document.  We use a set here in case `certs` has more
        // than one certificate for a single authority.
64
        let mut ok: HashSet<RsaIdentity> = HashSet::new();
64
        let mut missing = HashSet::new();
64
        let mut verify_failed = Ok(());
198
        for sig in &self.signatures {
            // Exhaustive pattern makes it hard to accidentally ignore a field.
            let Signature {
198
                digest_algo,
                key_ids:
                    AuthCertKeyIds {
198
                        id_fingerprint,
                        // h_kp_auth_sign_rsa, which Signature::check_signature
                        // checks against the authcert.
                        sk_fingerprint: _,
                    },
                // Used by Signature::check_signature
                signature: _,
198
            } = sig;
198
            match trusted_authorities {
16
                TA::TrustThese { trusted } => {
16
                    if !trusted.contains(id_fingerprint) {
                        continue;
16
                    }
                }
182
                TA::HazardouslyAssumeAllAuthCertsAreReal { .. } => {
182
                    // OK then!
182
                }
            }
198
            if ok.contains(id_fingerprint) {
                // We already checked at least one signature using this
                // authority's identity fingerprint.
                continue;
198
            }
198
            let Some(d) = self.hashes.hash_slice_for_verification(digest_algo) else {
                // We don't support this kind of digest for this kind
                // of document.
                continue;
            };
198
            let Some(tv) = sig.signature_to_verify(d, certs) else {
58
                missing.insert(sig.key_ids);
58
                continue;
            };
140
            match do_verify(tv) {
140
                Ok::<SignatureVerifiedIfIntended, _>(_) => {
140
                    ok.insert(*id_fingerprint);
140
                }
                Err(e) => {
                    verify_failed = Err(e);
                }
            }
        }
64
        let n_authorities = match trusted_authorities {
4
            TA::TrustThese { trusted } => trusted.len(),
60
            TA::HazardouslyAssumeAllAuthCertsAreReal { n_authorities: n } => n,
        };
64
        let threshold = consensus_threshold(n_authorities);
64
        if threshold.contains(&ok.len()) {
62
            Ok(())
        } else {
            // Throw the verification error if any of the verifications failed
2
            verify_failed?;
            // Otherwise report that we're missing certs and/or signers
2
            Err(if missing.is_empty() {
                ConsensusVerifiabilityError::InsufficientTrustedSigners
            } else {
2
                let deficit = threshold.start - ok.len();
2
                ConsensusVerifiabilityError::MissingAuthCerts { missing, deficit }
            }
2
            .into())
        }
64
    }
}
impl From<ConsensusVerifiabilityError> for VerifyFailed {
2
    fn from(cve: ConsensusVerifiabilityError) -> VerifyFailed {
        use ConsensusVerifiabilityError as CVE;
        use VerifyFailed as VF;
2
        match cve {
            CVE::InsufficientTrustedSigners => VF::InsufficientTrustedSigners,
2
            CVE::MissingAuthCerts { .. } => VF::InsufficientTrustedSigners,
        }
2
    }
}
impl From<ConsensusVerifyFailed> for VerifyFailed {
    fn from(cvf: ConsensusVerifyFailed) -> VerifyFailed {
        use ConsensusVerifyFailed as CVF;
        use VerifyFailed as VF;
        match cvf {
            CVF::CertificationInsufficient { .. } => VF::InsufficientTrustedSigners,
            CVF::InvalidSignature { .. } => VF::VerifyFailed,
        }
    }
}
#[cfg(test)]
mod test {
    // @@ begin test lint list maintained by maint/add_warning @@
    #![allow(clippy::bool_assert_comparison)]
    #![allow(clippy::clone_on_copy)]
    #![allow(clippy::dbg_macro)]
    #![allow(clippy::mixed_attributes_style)]
    #![allow(clippy::print_stderr)]
    #![allow(clippy::print_stdout)]
    #![allow(clippy::single_char_pattern)]
    #![allow(clippy::unwrap_used)]
    #![allow(clippy::unchecked_time_subtraction)]
    #![allow(clippy::useless_vec)]
    #![allow(clippy::needless_pass_by_value)]
    #![allow(clippy::string_slice)] // See arti#2571
    //! <!-- @@ end test lint list maintained by maint/add_warning @@ -->
    use super::*;
    use crate::doc::authcert::AuthCertUnverified;
    use crate::encode::{NetdocEncodable, NetdocEncodableFields};
    use crate::parse2::{ParseInput, parse_netdoc, parse_netdoc_multiple};
    use crate::util::regsub;
    use hex_literal::hex;
    use humantime::parse_rfc3339;
    use std::fmt::Debug;
    use std::fs;
    use tor_checkable::Timebound;
    const CERTS: &str = include_str!("../../testdata/authcerts2.txt");
    const CONSENSUS: &str = include_str!("../../testdata/mdconsensus1.txt");
    const PLAIN_CERTS: &str = include_str!("../../testdata2/cached-certs");
    const PLAIN_CONSENSUS: &str = include_str!("../../testdata2/cached-consensus");
    fn read_bad(fname: &str) -> String {
        use std::fs;
        use std::path::PathBuf;
        let mut path = PathBuf::from(env!("CARGO_MANIFEST_DIR"));
        path.push("testdata");
        path.push("bad-mdconsensus");
        path.push(fname);
        fs::read_to_string(path).unwrap()
    }
    #[test]
    fn parse_and_validate_md() -> crate::Result<()> {
        use std::net::SocketAddr;
        use tor_checkable::{SelfSigned, Timebound};
        let mut certs = Vec::new();
        for cert in AuthCert::parse_multiple(CERTS)? {
            let cert = cert?.check_signature()?.dangerously_assume_timely();
            certs.push(cert);
        }
        let auth_ids: Vec<_> = certs.iter().map(|c| c.id_fingerprint()).collect();
        assert_eq!(certs.len(), 3);
        let (_, _, consensus) = MdConsensus::parse(CONSENSUS)?;
        let consensus = consensus.dangerously_assume_timely().set_n_authorities(3);
        // The set of authorities we know _could_ validate this cert.
        assert!(consensus.authorities_are_correct(&auth_ids));
        // A subset would also work.
        assert!(consensus.authorities_are_correct(&auth_ids[0..1]));
        {
            // If we only believe in an authority that isn't listed,
            // that won't work.
            let bad_auth_id = (*b"xxxxxxxxxxxxxxxxxxxx").into();
            assert!(!consensus.authorities_are_correct(&[&bad_auth_id]));
        }
        let missing = consensus.key_is_correct(&[]).err().unwrap();
        assert_eq!(3, missing.len());
        assert!(consensus.key_is_correct(&certs).is_ok());
        let missing = consensus.key_is_correct(&certs[0..1]).err().unwrap();
        assert_eq!(2, missing.len());
        // here is a trick that had better not work.
        let same_three_times = vec![certs[0].clone(), certs[0].clone(), certs[0].clone()];
        let missing = consensus.key_is_correct(&same_three_times).err().unwrap();
        assert_eq!(2, missing.len());
        assert!(consensus.is_well_signed(&same_three_times).is_err());
        assert!(consensus.key_is_correct(&certs).is_ok());
        let consensus = consensus.check_signature(&certs)?;
        assert_eq!(6, consensus.relays().len());
        let r0 = &consensus.relays()[0];
        assert_eq!(
            r0.md_digest(),
            &hex!("73dabe0a0468f4f7a67810a18d11e36731bb1d2ec3634db459100609f3b3f535")
        );
        assert_eq!(
            r0.rsa_identity().as_bytes(),
            &hex!("0a3057af2910415794d8ea430309d9ac5f5d524b")
        );
        assert!(!r0.weight().is_measured());
        assert!(!r0.weight().is_nonzero());
        let pv = &r0.protovers();
        assert!(pv.supports_subver("HSDir", 2));
        assert!(!pv.supports_subver("HSDir", 3));
        let ip4 = "127.0.0.1:5002".parse::<SocketAddr>().unwrap();
        let ip6 = "[::1]:5002".parse::<SocketAddr>().unwrap();
        assert!(r0.addrs().any(|a| a == ip4));
        assert!(r0.addrs().any(|a| a == ip6));
        Ok(())
    }
    #[test]
    fn parse_and_validate_ns() -> crate::Result<()> {
        use tor_checkable::{SelfSigned, Timebound};
        let mut certs = Vec::new();
        for cert in AuthCert::parse_multiple(PLAIN_CERTS)? {
            let cert = cert?.check_signature()?.dangerously_assume_timely();
            certs.push(cert);
        }
        let auth_ids: Vec<_> = certs.iter().map(|c| c.id_fingerprint()).collect();
        assert_eq!(certs.len(), 4);
        let (_, _, consensus) = PlainConsensus::parse(PLAIN_CONSENSUS)?;
        let consensus = consensus.dangerously_assume_timely().set_n_authorities(3);
        // The set of authorities we know _could_ validate this cert.
        assert!(consensus.authorities_are_correct(&auth_ids));
        // A subset would also work.
        assert!(consensus.authorities_are_correct(&auth_ids[0..1]));
        assert!(consensus.key_is_correct(&certs).is_ok());
        let _consensus = consensus.check_signature(&certs)?;
        Ok(())
    }
    #[test]
    #[cfg(feature = "incomplete")]
    fn parse2_vote() -> anyhow::Result<()> {
        let file = "testdata2/v3-status-votes--1";
        let text = fs::read_to_string(file)?;
        // TODO DIRAUTH replace the poc struct here when we have parsing of proper whole votes
        use crate::parse2::poc::netstatus::NetworkStatusUnverifiedVote;
        let input = ParseInput::new(&text, file);
        let doc: NetworkStatusUnverifiedVote = parse_netdoc(&input)?;
        println!("{doc:?}");
        println!("{:#?}", doc.inspect_unverified().0.r[0]);
        Ok(())
    }
    #[test]
    fn test_bad() {
        use crate::Pos;
        fn check(fname: &str, e: &Error) {
            let content = read_bad(fname);
            let res = MdConsensus::parse(&content);
            assert!(res.is_err());
            assert_eq!(&res.err().unwrap(), e);
        }
        check(
            "bad-flags",
            &EK::BadArgument
                .at_pos(Pos::from_line(27, 1))
                .with_msg("Flags out of order"),
        );
        check(
            "bad-md-digest",
            &EK::BadArgument
                .at_pos(Pos::from_line(40, 3))
                .with_msg("Invalid base64"),
        );
        check(
            "bad-weight",
            &EK::BadArgument
                .at_pos(Pos::from_line(67, 141))
                .with_msg("invalid digit found in string"),
        );
        check(
            "bad-weights",
            &EK::BadArgument
                .at_pos(Pos::from_line(51, 13))
                .with_msg("invalid digit found in string"),
        );
        check(
            "wrong-order",
            &EK::WrongSortOrder.at_pos(Pos::from_line(52, 1)),
        );
        check(
            "wrong-start",
            &EK::UnexpectedToken
                .with_msg("vote-status")
                .at_pos(Pos::from_line(1, 1)),
        );
        check("wrong-version", &EK::BadDocumentVersion.with_msg("10"));
    }
    fn gettok(s: &str) -> crate::Result<Item<'_, NetstatusKwd>> {
        let mut reader = NetDocReader::new(s)?;
        let tok = reader.next().unwrap();
        assert!(reader.next().is_none());
        tok
    }
    #[test]
    fn test_weight() {
        let w = gettok("w Unmeasured=1 Bandwidth=6\n").unwrap();
        let w = RelayWeightsItem::from_item(&w).unwrap();
        assert!(!w.effective.is_measured());
        assert!(w.effective.is_nonzero());
        let w = gettok("w Bandwidth=10\n").unwrap();
        let w = RelayWeightsItem::from_item(&w).unwrap();
        assert!(w.effective.is_measured());
        assert!(w.effective.is_nonzero());
        let w = RelayWeightsItem::new_no_info();
        assert!(!w.effective.is_measured());
        assert!(!w.effective.is_nonzero());
        let w = gettok("w Mustelid=66 Cheato=7 Unmeasured=1\n").unwrap();
        let w = RelayWeightsItem::from_item(&w).unwrap();
        assert!(!w.effective.is_measured());
        assert!(!w.effective.is_nonzero());
        let w = gettok("r foo\n").unwrap();
        let w = RelayWeightsItem::from_item(&w);
        assert!(w.is_err());
        let w = gettok("r Bandwidth=6 Unmeasured=Frog\n").unwrap();
        let w = RelayWeightsItem::from_item(&w);
        assert!(w.is_err());
        let w = gettok("r Bandwidth=6 Unmeasured=3\n").unwrap();
        let w = RelayWeightsItem::from_item(&w);
        assert!(w.is_err());
    }
    #[test]
    fn test_netparam() {
        let p = "Hello=600 Goodbye=5 Fred=7"
            .parse::<NetParams<u32>>()
            .unwrap();
        assert_eq!(p.get("Hello"), Some(&600_u32));
        let p = "Hello=Goodbye=5 Fred=7".parse::<NetParams<u32>>();
        assert!(p.is_err());
        let p = "Hello=Goodbye Fred=7".parse::<NetParams<u32>>();
        assert!(p.is_err());
        for bad_kw in ["What=The", "", "\n", "\0"] {
            let p = [(bad_kw, 42)].into_iter().collect::<NetParams<i32>>();
            let mut d = NetdocEncoder::new();
            let d = (|| {
                let i = d.item("bad-psrams");
                p.write_item_value_onto(i)?;
                d.finish()
            })();
            let _: tor_error::Bug = d.expect_err(bad_kw);
        }
    }
    #[test]
    fn test_sharedrand() {
        let sr =
            gettok("shared-rand-previous-value 9 5LodY4yWxFhTKtxpV9wAgNA9N8flhUCH0NqQv1/05y4\n")
                .unwrap();
        let sr = SharedRandStatus::from_item(&sr).unwrap();
        assert_eq!(sr.n_reveals, 9);
        assert_eq!(
            sr.value.0,
            hex!("e4ba1d638c96c458532adc6957dc0080d03d37c7e5854087d0da90bf5ff4e72e")
        );
        assert!(sr.timestamp.is_none());
        let sr2 = gettok(
            "shared-rand-current-value 9 \
                    5LodY4yWxFhTKtxpV9wAgNA9N8flhUCH0NqQv1/05y4 2022-01-20T12:34:56\n",
        )
        .unwrap();
        let sr2 = SharedRandStatus::from_item(&sr2).unwrap();
        assert_eq!(sr2.n_reveals, sr.n_reveals);
        assert_eq!(sr2.value.0, sr.value.0);
        assert_eq!(
            sr2.timestamp.unwrap().0,
            humantime::parse_rfc3339("2022-01-20T12:34:56Z").unwrap()
        );
        let sr = gettok("foo bar\n").unwrap();
        let sr = SharedRandStatus::from_item(&sr);
        assert!(sr.is_err());
    }
    #[test]
    fn test_protostatus() {
        let my_protocols: Protocols = "Link=7 Cons=1-5 Desc=3-10".parse().unwrap();
        let outcome = ProtoStatus {
            recommended: "Link=7".parse().unwrap(),
            required: "Desc=5".parse().unwrap(),
        }
        .check_protocols(&my_protocols);
        assert!(outcome.is_ok());
        let outcome = ProtoStatus {
            recommended: "Microdesc=4 Link=7".parse().unwrap(),
            required: "Desc=5".parse().unwrap(),
        }
        .check_protocols(&my_protocols);
        assert_eq!(
            outcome,
            Err(ProtocolSupportError::MissingRecommended(
                "Microdesc=4".parse().unwrap()
            ))
        );
        let outcome = ProtoStatus {
            recommended: "Microdesc=4 Link=7".parse().unwrap(),
            required: "Desc=5 Cons=5-12 Wombat=15".parse().unwrap(),
        }
        .check_protocols(&my_protocols);
        assert_eq!(
            outcome,
            Err(ProtocolSupportError::MissingRequired(
                "Cons=6-12 Wombat=15".parse().unwrap()
            ))
        );
    }
    #[test]
    fn serialize_protostatus() {
        let ps = ProtoStatuses {
            client: ProtoStatus {
                recommended: "Link=1-5 LinkAuth=2-5".parse().unwrap(),
                required: "Link=5 LinkAuth=3".parse().unwrap(),
            },
            relay: ProtoStatus {
                recommended: "Wombat=20-30 Knish=20-30".parse().unwrap(),
                required: "Wombat=20-22 Knish=25-27".parse().unwrap(),
            },
        };
        let json = serde_json::to_string(&ps).unwrap();
        let ps2 = serde_json::from_str(json.as_str()).unwrap();
        assert_eq!(ps, ps2);
        let ps3: ProtoStatuses = serde_json::from_str(
            r#"{
            "client":{
                "required":"Link=5 LinkAuth=3",
                "recommended":"Link=1-5 LinkAuth=2-5"
            },
            "relay":{
                "required":"Wombat=20-22 Knish=25-27",
                "recommended":"Wombat=20-30 Knish=20-30"
            }
        }"#,
        )
        .unwrap();
        assert_eq!(ps, ps3);
    }
    #[cfg(feature = "incomplete")]
    fn roundtrip_netstatus<UV, V, VE>(
        file: &str,
        verify: impl FnOnce(UV, &[RsaIdentity], &[AuthCert]) -> Result<TimerangeBound<V>, VE>,
        adjust_exp: impl FnOnce(&mut String),
    ) -> anyhow::Result<()>
    where
        UV: NetdocParseable + NetdocParseableUnverified,
        UV::Signatures: Clone + NetdocEncodableFields,
        VE: Debug + std::error::Error + Send + Sync + 'static,
        V: Debug + NetdocEncodable,
    {
        let text = fs::read_to_string(file)?;
        let now = parse_rfc3339("2000-01-01T00:02:25Z")?;
        let mut input = ParseInput::new(&text, file);
        input.retain_unknown_values();
        let doc: UV = parse_netdoc(&input)?;
        let certs = {
            let file = "testdata2/cached-certs";
            let text = fs::read_to_string(file)?;
            let input = ParseInput::new(&text, file);
            let certs: Vec<AuthCertUnverified> = parse_netdoc_multiple(&input)?;
            certs
                .into_iter()
                .map(|cert| cert.verify_selfcert(now))
                .collect::<Result<Vec<AuthCert>, _>>()?
        };
        let sigs = doc.inspect_unverified().1.sigs.clone();
        let doc = verify(
            doc,
            &certs.iter().map(|cert| *cert.fingerprint).collect_vec(),
            &certs,
        )?
        .check_valid_at(&now)?;
        println!("{doc:?}");
        let mut enc = NetdocEncoder::new();
        doc.encode_unsigned(&mut enc)?;
        sigs.encode_fields(&mut enc)?;
        let enc = enc.finish()?;
        let mut exp: String = text.clone();
        let mut regsub = |re, repl| regsub(&mut exp, re, repl);
        // C Tor writes empty versions lines with trailing space
        regsub(
            //
            r#"^((?:client|server)-versions) $"#,
            "$1",
        );
        adjust_exp(&mut exp);
        assert_eq_or_diff!(&exp, &enc);
        Ok(())
    }
    /// Test that we can re-encode the consensus we parsed, and that we get the same thing back.
    ///
    /// Well, roughly the same thing.
    //
    // TODO DIRAUTH want more comprehensive test; testdata2's netstatus lacks many things
    #[cfg(feature = "incomplete")]
    #[test]
    fn roundtrip_netstatus_plain() -> anyhow::Result<()> {
        roundtrip_netstatus::<plain::NetworkStatusUnverified, _, _>(
            "testdata2/cached-consensus",
            plain::NetworkStatusUnverified::verify,
            |exp| {
                let mut regsub = |re, repl| regsub(exp, re, repl);
                // We emit the optional `ns`
                // https://spec.torproject.org/dir-spec/consensus-formats.html#item:network-status-version
                regsub(
                    r#"^network-status-version 3$"#,
                    "network-status-version 3 ns",
                );
                // C Tor writes nontrivial values for `publication` in rs `r` items,
                // but we use a fixed string.
                // https://spec.torproject.org/dir-spec/consensus-formats.html#item:r
                regsub(
                    r#"^(r \S+ \S+ \S+) \d{4}-\d{2}-\d{2} \d{2}:\d{2}:\d{2}"#,
                    "$1 2000-01-01 00:00:01",
                );
            },
        )
    }
    #[cfg(feature = "incomplete")]
    #[test]
    fn roundtrip_netstatus_md() -> anyhow::Result<()> {
        roundtrip_netstatus::<md::NetworkStatusUnverified, _, _>(
            "testdata2/cached-microdesc-consensus",
            md::NetworkStatusUnverified::verify,
            |exp| {
                let mut regsub = |re, repl| regsub(exp, re, repl);
                // C Tor writes nontrivial values for `publication` in rs `r` items,
                // but we use a fixed string.
                // https://spec.torproject.org/dir-spec/consensus-formats.html#item:r
                //
                // Not the same as in plain consensus: one fewer fields!
                regsub(
                    r#"^(r \S+ \S+) \d{4}-\d{2}-\d{2} \d{2}:\d{2}:\d{2}"#,
                    "$1 2000-01-01 00:00:01",
                );
            },
        )
    }
}