prefix parachain log targets with parachain:: (#2600)

* prefix parachain log targets with parachain::

* even more consistent
This commit is contained in:
Andronik Ordian
2021-03-10 17:07:56 +01:00
committed by GitHub
parent 956be35dd4
commit baa691deb1
26 changed files with 29 additions and 26 deletions
@@ -46,7 +46,7 @@ use std::sync::Arc;
mod error;
const LOG_TARGET: &'static str = "collation_generation";
const LOG_TARGET: &'static str = "parachain::collation-generation";
/// Collation Generation Subsystem
pub struct CollationGenerationSubsystem {
@@ -75,7 +75,7 @@ mod persisted_entries;
mod tests;
const APPROVAL_SESSIONS: SessionIndex = 6;
const LOG_TARGET: &str = "approval_voting";
const LOG_TARGET: &str = "parachain::approval-voting";
/// Configuration for the approval voting subsystem
pub struct Config {
+1 -1
View File
@@ -49,7 +49,7 @@ use bitvec::{vec::BitVec, order::Lsb0 as BitOrderLsb0};
#[cfg(test)]
mod tests;
const LOG_TARGET: &str = "availability";
const LOG_TARGET: &str = "parachain::availability";
mod columns {
pub const DATA: u32 = 0;
+1 -1
View File
@@ -66,7 +66,7 @@ use statement_table::{
};
use thiserror::Error;
const LOG_TARGET: &str = "candidate_backing";
const LOG_TARGET: &str = "parachain::candidate-backing";
#[derive(Debug, Error)]
enum Error {
@@ -39,7 +39,7 @@ use wasm_timer::{Delay, Instant};
/// Delay between starting a bitfield signing job and its attempting to create a bitfield.
const JOB_DELAY: Duration = Duration::from_millis(1500);
const LOG_TARGET: &str = "bitfield_signing";
const LOG_TARGET: &str = "parachain::bitfield-signing";
/// Each `BitfieldSigningJob` prepares a signed bitfield for a single relay parent.
pub struct BitfieldSigningJob;
@@ -43,7 +43,7 @@ use polkadot_node_primitives::SignedFullStatement;
use std::{pin::Pin, sync::Arc};
use thiserror::Error;
const LOG_TARGET: &'static str = "candidate_selection";
const LOG_TARGET: &'static str = "parachain::candidate-selection";
struct CandidateSelectionJob {
assignment: ParaId,
@@ -51,7 +51,7 @@ use futures::prelude::*;
use std::sync::Arc;
const LOG_TARGET: &'static str = "candidate_validation";
const LOG_TARGET: &'static str = "parachain::candidate-validation";
/// The candidate validation subsystem.
pub struct CandidateValidationSubsystem<S> {
+1 -1
View File
@@ -44,7 +44,7 @@ use std::sync::Arc;
use futures::prelude::*;
const LOG_TARGET: &str = "chain_api";
const LOG_TARGET: &str = "parachain::chain-api";
/// The Chain API Subsystem implementation.
pub struct ChainApiSubsystem<Client> {
+1 -1
View File
@@ -46,7 +46,7 @@ use futures_timer::Delay;
/// How long to wait before proposing.
const PRE_PROPOSE_TIMEOUT: std::time::Duration = core::time::Duration::from_millis(2000);
const LOG_TARGET: &str = "provisioner";
const LOG_TARGET: &str = "parachain::provisioner";
enum InherentAfter {
Ready,
+1 -1
View File
@@ -43,7 +43,7 @@ use cache::{RequestResult, RequestResultCache};
mod cache;
const LOG_TARGET: &str = "runtime_api";
const LOG_TARGET: &str = "parachain::runtime-api";
/// The number of maximum runtime api requests can be executed in parallel. Further requests will be buffered.
const MAX_PARALLEL_REQUESTS: usize = 4;
@@ -45,7 +45,7 @@ use polkadot_node_network_protocol::{
};
const LOG_TARGET: &str = "approval_distribution";
const LOG_TARGET: &str = "parachain::approval-distribution";
const COST_UNEXPECTED_MESSAGE: Rep = Rep::CostMinor("Peer sent an out-of-view assignment or approval");
const COST_DUPLICATE_MESSAGE: Rep = Rep::CostMinorRepeated("Peer sent identical messages");
@@ -46,7 +46,7 @@ pub use metrics::Metrics;
#[cfg(test)]
mod tests;
const LOG_TARGET: &'static str = "availability_distribution";
const LOG_TARGET: &'static str = "parachain::availability-distribution";
/// The availability distribution subsystem.
pub struct AvailabilityDistributionSubsystem {
@@ -56,7 +56,7 @@ mod error;
#[cfg(test)]
mod tests;
const LOG_TARGET: &str = "availability_recovery";
const LOG_TARGET: &str = "parachain::availability-recovery";
const COST_MERKLE_PROOF_INVALID: Rep = Rep::CostMinor("Merkle proof was invalid");
const COST_UNEXPECTED_CHUNK: Rep = Rep::CostMinor("Peer has sent an unexpected chunk");
@@ -136,7 +136,7 @@ impl PerRelayParentData {
}
}
const LOG_TARGET: &str = "bitfield_distribution";
const LOG_TARGET: &str = "parachain::bitfield-distribution";
/// The bitfield distribution subsystem.
pub struct BitfieldDistribution {
+1 -1
View File
@@ -77,7 +77,7 @@ const MALFORMED_VIEW_COST: Rep = Rep::CostMajor("Malformed view");
const EMPTY_VIEW_COST: Rep = Rep::CostMajor("Peer sent us an empty view");
// network bridge log target
const LOG_TARGET: &'static str = "network_bridge";
const LOG_TARGET: &'static str = "parachain::network-bridge";
/// Messages from and to the network.
///
@@ -30,7 +30,7 @@ use polkadot_node_network_protocol::PeerId;
use polkadot_primitives::v1::{AuthorityDiscoveryId, Block, Hash};
use polkadot_node_network_protocol::peer_set::{PeerSet, PerPeerSet};
const LOG_TARGET: &str = "validator_discovery";
const LOG_TARGET: &str = "parachain::validator-discovery";
/// An abstraction over networking for the purposes of validator discovery service.
#[async_trait]
@@ -43,7 +43,7 @@ use polkadot_node_subsystem_util::{
mod collator_side;
mod validator_side;
const LOG_TARGET: &'static str = "collator_protocol";
const LOG_TARGET: &'static str = "parachain::collator-protocol";
const REQUEST_TIMEOUT: Duration = Duration::from_secs(1);
#[derive(Debug, Error)]
@@ -36,7 +36,7 @@ use polkadot_primitives::v1::{
};
use polkadot_node_network_protocol::peer_set::PeerSet;
const LOG_TARGET: &str = "gossip_support";
const LOG_TARGET: &str = "parachain::gossip-support";
/// The Gossip Support subsystem.
pub struct GossipSupport {}
@@ -64,7 +64,7 @@ const BENEFIT_FRESH_POV: Rep = Rep::BenefitMinorFirst("Peer supplied us with an
const BENEFIT_LATE_POV: Rep = Rep::BenefitMinor("Peer supplied us with an awaited PoV, \
but was not the first to do so");
const LOG_TARGET: &str = "pov_distribution";
const LOG_TARGET: &str = "parachain::pov-distribution";
/// The PoV Distribution Subsystem.
pub struct PoVDistribution {
@@ -63,7 +63,7 @@ const BENEFIT_VALID_STATEMENT_FIRST: Rep = Rep::BenefitMajorFirst(
/// Typically we will only keep 1, but when a validator equivocates we will need to track 2.
const VC_THRESHOLD: usize = 2;
const LOG_TARGET: &str = "statement_distribution";
const LOG_TARGET: &str = "parachain::statement-distribution";
/// The statement distribution subsystem.
pub struct StatementDistribution {
+1 -1
View File
@@ -100,7 +100,7 @@ const CHANNEL_CAPACITY: usize = 1024;
// A graceful `Overseer` teardown time delay.
const STOP_DELAY: u64 = 1;
// Target for logs.
const LOG_TARGET: &'static str = "overseer";
const LOG_TARGET: &'static str = "parachain::overseer";
// Rate at which messages are timed.
const MESSAGE_TIMER_METRIC_CAPTURE_RATE: f64 = 0.005;
+1 -1
View File
@@ -158,7 +158,7 @@ impl<B> grandpa::VotingRule<PolkadotBlock, B> for ApprovalCheckingDiagnostic
}
tracing::debug!(
target: "approval_voting",
target: "parachain::approval-voting",
"GRANDPA: voting on {:?}. Approval-checking lag behind best is {}",
actual_vote_target,
approval_checking_subsystem_lag,
@@ -78,7 +78,7 @@ pub async fn connect_to_validators_in_session<Context: SubsystemContext>(
};
tracing::trace!(
target: "network_bridge",
target: "parachain::validator-discovery",
validators = ?validators,
discovery_keys = ?discovery_keys,
session_index,