2026-02-24 23:44:07 -05:00
|
|
|
|
pub(crate) use crate::ast::{
|
2026-02-25 04:02:11 -05:00
|
|
|
|
analyse_file_fused, extract_summaries_from_bytes, run_rules_on_bytes, run_rules_on_file,
|
2026-02-24 23:44:07 -05:00
|
|
|
|
};
|
2026-02-25 21:16:36 -05:00
|
|
|
|
use crate::cli::{IndexMode, OutputFormat};
|
2025-06-24 20:27:06 +02:00
|
|
|
|
use crate::database::index::{Indexer, IssueRow};
|
|
|
|
|
|
use crate::errors::NyxResult;
|
2026-02-25 21:16:36 -05:00
|
|
|
|
use crate::patterns::{FindingCategory, Severity, SeverityFilter};
|
2026-02-25 04:02:11 -05:00
|
|
|
|
use crate::summary::{self, GlobalSummaries};
|
2025-06-24 20:27:06 +02:00
|
|
|
|
use crate::utils::config::Config;
|
2025-06-16 16:46:22 +02:00
|
|
|
|
use crate::utils::project::get_project_info;
|
2026-02-24 23:44:07 -05:00
|
|
|
|
use crate::walk::spawn_file_walker;
|
2025-06-17 16:46:45 +02:00
|
|
|
|
use console::style;
|
2025-06-24 20:27:06 +02:00
|
|
|
|
use dashmap::DashMap;
|
2026-02-25 04:02:11 -05:00
|
|
|
|
use indicatif::{ProgressBar, ProgressStyle};
|
2025-06-17 20:45:33 +02:00
|
|
|
|
use r2d2::Pool;
|
|
|
|
|
|
use r2d2_sqlite::SqliteConnectionManager;
|
2025-06-17 19:54:03 +02:00
|
|
|
|
use rayon::prelude::*;
|
2026-02-24 23:44:07 -05:00
|
|
|
|
use std::path::{Path, PathBuf};
|
|
|
|
|
|
use std::sync::Arc;
|
2025-06-17 16:46:45 +02:00
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
fn make_progress_bar(len: u64, msg: &str, show: bool) -> ProgressBar {
|
|
|
|
|
|
if !show {
|
|
|
|
|
|
return ProgressBar::hidden();
|
|
|
|
|
|
}
|
|
|
|
|
|
let pb = ProgressBar::new(len);
|
|
|
|
|
|
pb.set_style(
|
|
|
|
|
|
ProgressStyle::with_template(
|
|
|
|
|
|
"{spinner:.green} {msg} [{bar:30.cyan/blue}] {pos}/{len} ({eta})",
|
|
|
|
|
|
)
|
|
|
|
|
|
.unwrap()
|
|
|
|
|
|
.progress_chars("##-"),
|
|
|
|
|
|
);
|
|
|
|
|
|
pb.set_message(msg.to_string());
|
|
|
|
|
|
pb
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
#[derive(Debug, Clone, serde::Serialize)]
|
2025-06-17 16:46:45 +02:00
|
|
|
|
pub struct Diag {
|
2026-02-24 23:44:07 -05:00
|
|
|
|
pub path: String,
|
|
|
|
|
|
pub line: usize,
|
|
|
|
|
|
pub col: usize,
|
|
|
|
|
|
pub severity: Severity,
|
|
|
|
|
|
pub id: String,
|
2026-02-25 21:16:36 -05:00
|
|
|
|
/// High-level finding category (Security, Reliability, Quality).
|
|
|
|
|
|
pub category: FindingCategory,
|
|
|
|
|
|
/// Whether the finding is guarded by a path validation predicate.
|
|
|
|
|
|
/// Only set for taint findings; `false` for AST/CFG structural findings.
|
|
|
|
|
|
#[serde(skip_serializing_if = "std::ops::Not::not")]
|
|
|
|
|
|
pub path_validated: bool,
|
|
|
|
|
|
/// The kind of validation guard protecting this path, if any.
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub guard_kind: Option<String>,
|
|
|
|
|
|
/// Optional human-readable message with additional context (e.g. state analysis details).
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub message: Option<String>,
|
|
|
|
|
|
/// Structured evidence labels (e.g. Source, Sink) for console display.
|
|
|
|
|
|
#[serde(skip_serializing_if = "Vec::is_empty")]
|
|
|
|
|
|
pub labels: Vec<(String, String)>,
|
|
|
|
|
|
/// Confidence level (Low / Medium / High).
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub confidence: Option<crate::evidence::Confidence>,
|
|
|
|
|
|
/// Structured evidence (source/sink spans, state transitions, notes).
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub evidence: Option<crate::evidence::Evidence>,
|
|
|
|
|
|
/// Attack-surface ranking score (higher = more exploitable / important).
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub rank_score: Option<f64>,
|
|
|
|
|
|
/// Breakdown of how the ranking score was computed.
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub rank_reason: Option<Vec<(String, String)>>,
|
|
|
|
|
|
/// Whether this finding was suppressed by an inline `nyx:ignore` directive.
|
|
|
|
|
|
#[serde(skip_serializing_if = "is_false")]
|
|
|
|
|
|
pub suppressed: bool,
|
|
|
|
|
|
/// Metadata about the suppression directive, if suppressed.
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub suppression: Option<crate::suppress::SuppressionMeta>,
|
|
|
|
|
|
/// Rollup data when multiple occurrences are grouped into one finding.
|
|
|
|
|
|
#[serde(skip_serializing_if = "Option::is_none")]
|
|
|
|
|
|
pub rollup: Option<RollupData>,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Rollup data for grouped findings (e.g. 38 occurrences of `rs.quality.unwrap`).
|
|
|
|
|
|
#[derive(Debug, Clone, serde::Serialize)]
|
|
|
|
|
|
pub struct RollupData {
|
|
|
|
|
|
/// Total number of occurrences.
|
|
|
|
|
|
pub count: usize,
|
|
|
|
|
|
/// First N example locations (controlled by `rollup_examples`).
|
|
|
|
|
|
pub occurrences: Vec<Location>,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// A source location within a file.
|
|
|
|
|
|
#[derive(Debug, Clone, serde::Serialize)]
|
|
|
|
|
|
pub struct Location {
|
|
|
|
|
|
pub line: usize,
|
|
|
|
|
|
pub col: usize,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Statistics about findings suppressed by the prioritization pipeline.
|
|
|
|
|
|
pub struct SuppressionStats {
|
|
|
|
|
|
pub quality_dropped: usize,
|
|
|
|
|
|
pub low_budget_dropped: usize,
|
|
|
|
|
|
pub max_results_dropped: usize,
|
|
|
|
|
|
pub include_quality: bool,
|
|
|
|
|
|
#[allow(dead_code)]
|
|
|
|
|
|
pub show_all: bool,
|
|
|
|
|
|
pub max_low: u32,
|
|
|
|
|
|
pub max_low_per_file: u32,
|
|
|
|
|
|
pub max_low_per_rule: u32,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
impl SuppressionStats {
|
|
|
|
|
|
pub fn total_suppressed(&self) -> usize {
|
|
|
|
|
|
self.quality_dropped + self.low_budget_dropped + self.max_results_dropped
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn is_false(b: &bool) -> bool {
|
|
|
|
|
|
!*b
|
2025-06-17 16:46:45 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Entry point called by the CLI.
|
2026-02-25 21:16:36 -05:00
|
|
|
|
#[allow(clippy::too_many_arguments)]
|
2025-06-16 16:46:22 +02:00
|
|
|
|
pub fn handle(
|
|
|
|
|
|
path: &str,
|
2026-02-25 21:16:36 -05:00
|
|
|
|
index_mode: IndexMode,
|
|
|
|
|
|
format: OutputFormat,
|
|
|
|
|
|
severity_filter: Option<SeverityFilter>,
|
|
|
|
|
|
fail_on: Option<Severity>,
|
|
|
|
|
|
show_suppressed: bool,
|
|
|
|
|
|
show_instances: Option<&str>,
|
2025-06-16 16:46:22 +02:00
|
|
|
|
database_dir: &Path,
|
|
|
|
|
|
config: &Config,
|
2025-06-23 20:59:49 +02:00
|
|
|
|
) -> NyxResult<()> {
|
2025-06-16 16:46:22 +02:00
|
|
|
|
let scan_path = Path::new(path).canonicalize()?;
|
|
|
|
|
|
let (project_name, db_path) = get_project_info(&scan_path, database_dir)?;
|
2025-06-23 20:27:16 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
let is_machine = format == OutputFormat::Json || format == OutputFormat::Sarif;
|
|
|
|
|
|
let suppress_status = config.output.quiet || is_machine;
|
2026-02-25 04:02:11 -05:00
|
|
|
|
if !suppress_status {
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// Status messages go to stderr so stdout stays clean
|
|
|
|
|
|
eprintln!(
|
2026-02-25 04:02:11 -05:00
|
|
|
|
"{} {}...\n",
|
|
|
|
|
|
style("Checking").green().bold(),
|
|
|
|
|
|
&project_name
|
|
|
|
|
|
);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
let show_progress = !is_machine && !config.output.quiet;
|
2025-06-24 20:27:06 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
let mut diags: Vec<Diag> = if index_mode == IndexMode::Off {
|
2026-02-25 04:02:11 -05:00
|
|
|
|
scan_filesystem(&scan_path, config, show_progress)?
|
2025-06-16 16:46:22 +02:00
|
|
|
|
} else {
|
2026-02-25 21:16:36 -05:00
|
|
|
|
if index_mode == IndexMode::Rebuild || !db_path.exists() {
|
2025-06-17 17:42:41 +02:00
|
|
|
|
tracing::debug!("Scanning filesystem index filesystem");
|
2026-02-25 04:02:11 -05:00
|
|
|
|
crate::commands::index::build_index(
|
|
|
|
|
|
&project_name,
|
|
|
|
|
|
&scan_path,
|
|
|
|
|
|
&db_path,
|
|
|
|
|
|
config,
|
|
|
|
|
|
show_progress,
|
|
|
|
|
|
)?;
|
2025-06-16 16:46:22 +02:00
|
|
|
|
}
|
2025-06-17 17:52:22 +02:00
|
|
|
|
|
2025-06-17 20:45:33 +02:00
|
|
|
|
let pool = Indexer::init(&db_path)?;
|
2026-02-25 04:02:11 -05:00
|
|
|
|
if config.database.vacuum_on_startup {
|
|
|
|
|
|
let idx = Indexer::from_pool(&project_name, &pool)?;
|
|
|
|
|
|
idx.vacuum()?;
|
|
|
|
|
|
}
|
|
|
|
|
|
scan_with_index_parallel(&project_name, pool, config, show_progress)?
|
2025-06-23 17:49:15 +02:00
|
|
|
|
};
|
2025-06-16 16:46:22 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
tracing::debug!("Found {:?} issues (pre-filter).", diags.len());
|
2025-06-23 18:25:10 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── Apply severity filter AFTER all downgrades/dedup ────────────────
|
|
|
|
|
|
if let Some(ref filter) = severity_filter {
|
|
|
|
|
|
diags.retain(|d| filter.matches(d.severity));
|
2026-02-24 23:44:07 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── Apply minimum-score filter AFTER ranking ─────────────────────
|
|
|
|
|
|
if let Some(min) = config.output.min_score {
|
|
|
|
|
|
let threshold = f64::from(min);
|
|
|
|
|
|
diags.retain(|d| d.rank_score.unwrap_or(0.0) >= threshold);
|
2026-02-25 04:02:11 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── Apply minimum-confidence filter AFTER confidence assignment ──
|
|
|
|
|
|
if let Some(min_conf) = config.output.min_confidence {
|
|
|
|
|
|
diags.retain(|d| d.confidence.is_none_or(|c| c >= min_conf));
|
|
|
|
|
|
}
|
2025-06-23 20:27:16 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── Apply inline suppressions ───────────────────────────────────
|
|
|
|
|
|
apply_suppressions(&mut diags);
|
|
|
|
|
|
if !show_suppressed {
|
|
|
|
|
|
diags.retain(|d| !d.suppressed);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ── Prioritization: category filter, rollup, LOW budgets ─────────
|
|
|
|
|
|
let stats = prioritize(&mut diags, &config.output, show_instances);
|
|
|
|
|
|
|
|
|
|
|
|
tracing::debug!("Emitting {:?} issues (post-filter).", diags.len());
|
|
|
|
|
|
|
|
|
|
|
|
// ── Output ──────────────────────────────────────────────────────────
|
|
|
|
|
|
match format {
|
|
|
|
|
|
OutputFormat::Json => {
|
|
|
|
|
|
let json = serde_json::to_string(&diags)
|
|
|
|
|
|
.map_err(|e| crate::errors::NyxError::Msg(e.to_string()))?;
|
|
|
|
|
|
println!("{json}");
|
2025-06-17 16:46:45 +02:00
|
|
|
|
}
|
2026-02-25 21:16:36 -05:00
|
|
|
|
OutputFormat::Sarif => {
|
|
|
|
|
|
let sarif = crate::output::build_sarif(&diags, &scan_path);
|
|
|
|
|
|
let json = serde_json::to_string_pretty(&sarif)
|
|
|
|
|
|
.map_err(|e| crate::errors::NyxError::Msg(e.to_string()))?;
|
|
|
|
|
|
println!("{json}");
|
|
|
|
|
|
}
|
|
|
|
|
|
OutputFormat::Console => {
|
|
|
|
|
|
tracing::debug!("Printing to console");
|
|
|
|
|
|
print!(
|
|
|
|
|
|
"{}",
|
|
|
|
|
|
crate::fmt::render_console(&diags, &project_name, Some(&stats))
|
|
|
|
|
|
);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2025-06-23 18:25:10 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── --fail-on: exit non-zero if threshold breached ──────────────────
|
|
|
|
|
|
// Suppressed findings do not count toward the threshold.
|
|
|
|
|
|
if let Some(threshold) = fail_on {
|
|
|
|
|
|
let breached = diags
|
|
|
|
|
|
.iter()
|
|
|
|
|
|
.any(|d| !d.suppressed && d.severity <= threshold);
|
|
|
|
|
|
if breached {
|
|
|
|
|
|
std::process::exit(1);
|
|
|
|
|
|
}
|
2025-06-16 16:46:22 +02:00
|
|
|
|
}
|
2026-02-25 21:16:36 -05:00
|
|
|
|
|
2025-06-16 16:46:22 +02:00
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2025-06-17 16:46:45 +02:00
|
|
|
|
// --------------------------------------------------------------------------------------------
|
2026-02-24 23:44:07 -05:00
|
|
|
|
// Two‑pass scanning (no index)
|
2025-06-17 16:46:45 +02:00
|
|
|
|
// --------------------------------------------------------------------------------------------
|
2025-06-16 23:47:50 +02:00
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
/// Walk the filesystem and perform a two‑pass scan:
|
|
|
|
|
|
///
|
|
|
|
|
|
/// **Pass 1** – Parse every file and extract function summaries.
|
|
|
|
|
|
/// **Pass 2** – Re‑parse every file and run taint analysis with the
|
|
|
|
|
|
/// merged cross‑file summaries.
|
|
|
|
|
|
///
|
|
|
|
|
|
/// AST pattern queries are run during pass 2 (they don't depend on summaries).
|
2026-02-25 04:02:11 -05:00
|
|
|
|
pub(crate) fn scan_filesystem(
|
|
|
|
|
|
root: &Path,
|
|
|
|
|
|
cfg: &Config,
|
|
|
|
|
|
show_progress: bool,
|
|
|
|
|
|
) -> NyxResult<Vec<Diag>> {
|
2026-02-24 23:44:07 -05:00
|
|
|
|
// ── Collect file list ────────────────────────────────────────────────
|
|
|
|
|
|
let all_paths: Vec<PathBuf> = {
|
|
|
|
|
|
let _span = tracing::info_span!("walk_files").entered();
|
|
|
|
|
|
let (rx, handle) = spawn_file_walker(root, cfg);
|
2026-02-25 04:02:11 -05:00
|
|
|
|
// Drain the channel BEFORE joining the walker thread.
|
|
|
|
|
|
// The channel is bounded, so joining first would deadlock once
|
|
|
|
|
|
// the walker fills it and blocks on send.
|
|
|
|
|
|
let paths: Vec<PathBuf> = rx.into_iter().flatten().collect();
|
2026-02-24 23:44:07 -05:00
|
|
|
|
if let Err(err) = handle.join() {
|
|
|
|
|
|
tracing::error!("walker thread panicked: {:#?}", err);
|
|
|
|
|
|
}
|
2026-02-25 04:02:11 -05:00
|
|
|
|
paths
|
2026-02-24 23:44:07 -05:00
|
|
|
|
};
|
|
|
|
|
|
tracing::info!(file_count = all_paths.len(), "file walk complete");
|
2025-06-23 20:27:16 +02:00
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
let needs_taint = cfg.scanner.mode == crate::utils::config::AnalysisMode::Full
|
|
|
|
|
|
|| cfg.scanner.mode == crate::utils::config::AnalysisMode::Taint;
|
|
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
if !needs_taint {
|
|
|
|
|
|
// ── AST-only: single fused pass (no cross-file context needed) ──
|
|
|
|
|
|
let _span = tracing::info_span!("ast_only_analysis", files = all_paths.len()).entered();
|
|
|
|
|
|
let pb = make_progress_bar(all_paths.len() as u64, "Running analysis", show_progress);
|
2026-02-24 23:44:07 -05:00
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let mut diags: Vec<Diag> = all_paths
|
2026-02-24 23:44:07 -05:00
|
|
|
|
.par_iter()
|
2026-02-25 04:02:11 -05:00
|
|
|
|
.flat_map_iter(|path| {
|
|
|
|
|
|
let result = match analyse_file_fused(
|
|
|
|
|
|
&std::fs::read(path).unwrap_or_default(),
|
|
|
|
|
|
path,
|
|
|
|
|
|
cfg,
|
|
|
|
|
|
None,
|
|
|
|
|
|
Some(root),
|
|
|
|
|
|
) {
|
|
|
|
|
|
Ok(r) => r.diags,
|
|
|
|
|
|
Err(e) => {
|
|
|
|
|
|
tracing::warn!("analysis: {}: {e}", path.display());
|
|
|
|
|
|
vec![]
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
pb.inc(1);
|
|
|
|
|
|
result
|
2026-02-24 23:44:07 -05:00
|
|
|
|
})
|
|
|
|
|
|
.collect();
|
2026-02-25 04:02:11 -05:00
|
|
|
|
pb.finish_and_clear();
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
if cfg.output.attack_surface_ranking {
|
|
|
|
|
|
crate::rank::rank_diags(&mut diags);
|
|
|
|
|
|
}
|
|
|
|
|
|
for d in &mut diags {
|
|
|
|
|
|
if d.confidence.is_none() {
|
|
|
|
|
|
d.confidence = Some(crate::evidence::compute_confidence(d));
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2026-02-25 04:02:11 -05:00
|
|
|
|
if let Some(max) = cfg.output.max_results {
|
|
|
|
|
|
diags.truncate(max as usize);
|
|
|
|
|
|
}
|
|
|
|
|
|
return Ok(diags);
|
|
|
|
|
|
}
|
2026-02-24 23:44:07 -05:00
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
// ── Taint mode: two-pass with fused pass 1 ──────────────────────────
|
|
|
|
|
|
//
|
|
|
|
|
|
// Pass 1 (fused): parse + CFG (once!) → extract summaries + run
|
|
|
|
|
|
// AST queries + local taint + CFG structural analyses.
|
|
|
|
|
|
// Summaries are collected for the cross-file merge.
|
|
|
|
|
|
//
|
|
|
|
|
|
// Pass 2: re-run full analysis with global summaries injected.
|
|
|
|
|
|
// This requires a second parse+CFG, but ONLY for taint-mode files
|
|
|
|
|
|
// that need cross-file context. For repos where most functions
|
|
|
|
|
|
// don't have unresolved callees, pass 1 results are already correct.
|
|
|
|
|
|
|
|
|
|
|
|
// ── Pass 1: fused summary extraction + parallel merge ──────────────
|
|
|
|
|
|
//
|
|
|
|
|
|
// Each rayon thread builds a local `GlobalSummaries` from its chunk,
|
|
|
|
|
|
// then the per-thread maps are merged in a binary reduce tree.
|
|
|
|
|
|
// This eliminates the serial merge_summaries bottleneck.
|
|
|
|
|
|
let global_summaries: GlobalSummaries = {
|
|
|
|
|
|
let _span = tracing::info_span!("pass1_fused", files = all_paths.len()).entered();
|
|
|
|
|
|
let pb = make_progress_bar(
|
|
|
|
|
|
all_paths.len() as u64,
|
|
|
|
|
|
"Pass 1: Extracting summaries",
|
|
|
|
|
|
show_progress,
|
|
|
|
|
|
);
|
2026-02-24 23:44:07 -05:00
|
|
|
|
let root_str = root.to_string_lossy();
|
2026-02-25 04:02:11 -05:00
|
|
|
|
|
|
|
|
|
|
let gs = all_paths
|
|
|
|
|
|
.par_iter()
|
|
|
|
|
|
.fold(GlobalSummaries::new, |mut local_gs, path| {
|
|
|
|
|
|
if let Ok(bytes) = std::fs::read(path) {
|
|
|
|
|
|
match analyse_file_fused(&bytes, path, cfg, None, Some(root)) {
|
|
|
|
|
|
Ok(r) => {
|
|
|
|
|
|
for s in r.summaries {
|
|
|
|
|
|
let key = s.func_key(Some(&root_str));
|
|
|
|
|
|
local_gs.insert(key, s);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
Err(e) => {
|
|
|
|
|
|
tracing::warn!("pass 1: {}: {e}", path.display());
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
} else {
|
|
|
|
|
|
tracing::warn!("pass 1: cannot read {}", path.display());
|
|
|
|
|
|
}
|
|
|
|
|
|
pb.inc(1);
|
|
|
|
|
|
local_gs
|
|
|
|
|
|
})
|
|
|
|
|
|
.reduce(GlobalSummaries::new, |mut a, b| {
|
|
|
|
|
|
a.merge(b);
|
|
|
|
|
|
a
|
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
|
|
pb.finish_and_clear();
|
|
|
|
|
|
tracing::info!("pass 1 complete");
|
|
|
|
|
|
gs
|
2026-02-24 23:44:07 -05:00
|
|
|
|
};
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── Build call graph ────────────────────────────────────────────────
|
|
|
|
|
|
{
|
|
|
|
|
|
let _span = tracing::info_span!("build_call_graph").entered();
|
|
|
|
|
|
// TODO: wire interop_edges from config/index when InteropEdge sources are implemented
|
|
|
|
|
|
let call_graph = crate::callgraph::build_call_graph(&global_summaries, &[]);
|
|
|
|
|
|
let cg_analysis = crate::callgraph::analyse(&call_graph);
|
|
|
|
|
|
tracing::info!(
|
|
|
|
|
|
nodes = call_graph.graph.node_count(),
|
|
|
|
|
|
edges = call_graph.graph.edge_count(),
|
|
|
|
|
|
unresolved_not_found = call_graph.unresolved_not_found.len(),
|
|
|
|
|
|
unresolved_ambiguous = call_graph.unresolved_ambiguous.len(),
|
|
|
|
|
|
sccs = cg_analysis.sccs.len(),
|
|
|
|
|
|
"call graph built"
|
|
|
|
|
|
);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
// ── Pass 2: re-run with cross-file global summaries ──────────────────
|
2026-02-24 23:44:07 -05:00
|
|
|
|
let mut diags: Vec<Diag> = {
|
|
|
|
|
|
let _span = tracing::info_span!("pass2_analysis", files = all_paths.len()).entered();
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let pb = make_progress_bar(
|
|
|
|
|
|
all_paths.len() as u64,
|
|
|
|
|
|
"Pass 2: Running analysis",
|
|
|
|
|
|
show_progress,
|
|
|
|
|
|
);
|
2026-02-24 23:44:07 -05:00
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let result: Vec<Diag> = all_paths
|
2026-02-24 23:44:07 -05:00
|
|
|
|
.par_iter()
|
2026-02-25 04:02:11 -05:00
|
|
|
|
.flat_map_iter(|path| {
|
|
|
|
|
|
let result = match run_rules_on_file(path, cfg, Some(&global_summaries), Some(root))
|
|
|
|
|
|
{
|
|
|
|
|
|
Ok(d) => d,
|
|
|
|
|
|
Err(e) => {
|
|
|
|
|
|
tracing::warn!("pass 2: {}: {e}", path.display());
|
|
|
|
|
|
vec![]
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
pb.inc(1);
|
|
|
|
|
|
result
|
|
|
|
|
|
})
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
pb.finish_and_clear();
|
|
|
|
|
|
result
|
2026-02-24 23:44:07 -05:00
|
|
|
|
};
|
|
|
|
|
|
tracing::info!(diags = diags.len(), "pass 2 complete");
|
2025-06-24 20:27:06 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
if cfg.output.attack_surface_ranking {
|
|
|
|
|
|
crate::rank::rank_diags(&mut diags);
|
|
|
|
|
|
}
|
|
|
|
|
|
for d in &mut diags {
|
|
|
|
|
|
if d.confidence.is_none() {
|
|
|
|
|
|
d.confidence = Some(crate::evidence::compute_confidence(d));
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2025-06-24 22:44:57 +02:00
|
|
|
|
if let Some(max) = cfg.output.max_results {
|
2025-06-24 23:38:32 +02:00
|
|
|
|
diags.truncate(max as usize);
|
2025-06-24 22:44:57 +02:00
|
|
|
|
}
|
2025-06-24 23:38:32 +02:00
|
|
|
|
|
2025-06-24 22:44:57 +02:00
|
|
|
|
Ok(diags)
|
2025-06-16 23:47:50 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
// --------------------------------------------------------------------------------------------
|
|
|
|
|
|
// Two‑pass scanning (with index)
|
|
|
|
|
|
// --------------------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
|
|
/// Indexed two‑pass scan:
|
|
|
|
|
|
///
|
|
|
|
|
|
/// **Pass 1** – For every file that needs scanning, extract summaries and
|
|
|
|
|
|
/// persist them to the database. Unchanged files keep their
|
|
|
|
|
|
/// existing summaries.
|
|
|
|
|
|
/// **Pass 2** – Load *all* summaries from the DB, merge them, and re‑run
|
|
|
|
|
|
/// taint analysis on every file with the full cross‑file view.
|
|
|
|
|
|
/// Files whose *own* code has not changed AND whose
|
|
|
|
|
|
/// dependencies have not changed can serve cached issues
|
|
|
|
|
|
/// instead. (Today we conservatively re‑analyse every file in
|
|
|
|
|
|
/// pass 2; caching will be refined in approach 2 / 3.)
|
2025-06-23 20:27:16 +02:00
|
|
|
|
pub fn scan_with_index_parallel(
|
2025-06-17 16:46:45 +02:00
|
|
|
|
project: &str,
|
2025-06-17 20:45:33 +02:00
|
|
|
|
pool: Arc<Pool<SqliteConnectionManager>>,
|
2025-06-17 16:46:45 +02:00
|
|
|
|
cfg: &Config,
|
2026-02-25 04:02:11 -05:00
|
|
|
|
show_progress: bool,
|
2025-06-23 20:27:16 +02:00
|
|
|
|
) -> NyxResult<Vec<Diag>> {
|
2025-06-17 20:45:33 +02:00
|
|
|
|
let files = {
|
|
|
|
|
|
let idx = Indexer::from_pool(project, &pool)?;
|
|
|
|
|
|
idx.get_files(project)?
|
|
|
|
|
|
};
|
2025-06-24 23:38:32 +02:00
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
let needs_taint = cfg.scanner.mode == crate::utils::config::AnalysisMode::Full
|
|
|
|
|
|
|| cfg.scanner.mode == crate::utils::config::AnalysisMode::Taint;
|
|
|
|
|
|
|
|
|
|
|
|
// ── Pass 1: ensure summaries are up‑to‑date ──────────────────────────
|
|
|
|
|
|
if needs_taint {
|
|
|
|
|
|
let _span = tracing::info_span!("pass1_indexed", files = files.len()).entered();
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let pb = make_progress_bar(
|
|
|
|
|
|
files.len() as u64,
|
|
|
|
|
|
"Pass 1: Extracting summaries",
|
|
|
|
|
|
show_progress,
|
|
|
|
|
|
);
|
2026-02-24 23:44:07 -05:00
|
|
|
|
|
|
|
|
|
|
files.par_iter().for_each_init(
|
|
|
|
|
|
|| Indexer::from_pool(project, &pool).expect("db pool"),
|
|
|
|
|
|
|idx, path| {
|
2026-02-25 04:02:11 -05:00
|
|
|
|
// Read once, hash once — use the hash for the change check
|
|
|
|
|
|
// to avoid a second file read inside should_scan.
|
|
|
|
|
|
if let Ok(bytes) = std::fs::read(path) {
|
|
|
|
|
|
let hash = Indexer::digest_bytes(&bytes);
|
|
|
|
|
|
let needs_scan = idx.should_scan_with_hash(path, &hash).unwrap_or(true);
|
|
|
|
|
|
if needs_scan {
|
|
|
|
|
|
match extract_summaries_from_bytes(&bytes, path, cfg) {
|
|
|
|
|
|
Ok(sums) => {
|
|
|
|
|
|
idx.replace_summaries_for_file(path, &hash, &sums).ok();
|
|
|
|
|
|
}
|
|
|
|
|
|
Err(e) => {
|
|
|
|
|
|
tracing::warn!("pass 1: {}: {e}", path.display());
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2026-02-24 23:44:07 -05:00
|
|
|
|
}
|
2026-02-25 04:02:11 -05:00
|
|
|
|
} else {
|
|
|
|
|
|
tracing::warn!("pass 1: cannot read {}", path.display());
|
2026-02-24 23:44:07 -05:00
|
|
|
|
}
|
2026-02-25 04:02:11 -05:00
|
|
|
|
pb.inc(1);
|
2026-02-24 23:44:07 -05:00
|
|
|
|
},
|
|
|
|
|
|
);
|
2026-02-25 04:02:11 -05:00
|
|
|
|
pb.finish_and_clear();
|
2026-02-24 23:44:07 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ── Load global summaries ────────────────────────────────────────────
|
|
|
|
|
|
let global_summaries: Option<GlobalSummaries> = if needs_taint {
|
|
|
|
|
|
let _span = tracing::info_span!("load_summaries_db").entered();
|
|
|
|
|
|
let idx = Indexer::from_pool(project, &pool)?;
|
|
|
|
|
|
let all = idx.load_all_summaries()?;
|
|
|
|
|
|
tracing::info!(summaries = all.len(), "loaded cross-file summaries from DB");
|
|
|
|
|
|
Some(summary::merge_summaries(all, None))
|
|
|
|
|
|
} else {
|
|
|
|
|
|
None
|
|
|
|
|
|
};
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ── Build call graph ────────────────────────────────────────────────
|
|
|
|
|
|
if let Some(ref gs) = global_summaries {
|
|
|
|
|
|
let _span = tracing::info_span!("build_call_graph").entered();
|
|
|
|
|
|
// TODO: wire interop_edges from config/index when InteropEdge sources are implemented
|
|
|
|
|
|
let call_graph = crate::callgraph::build_call_graph(gs, &[]);
|
|
|
|
|
|
let cg_analysis = crate::callgraph::analyse(&call_graph);
|
|
|
|
|
|
tracing::info!(
|
|
|
|
|
|
nodes = call_graph.graph.node_count(),
|
|
|
|
|
|
edges = call_graph.graph.edge_count(),
|
|
|
|
|
|
unresolved_not_found = call_graph.unresolved_not_found.len(),
|
|
|
|
|
|
unresolved_ambiguous = call_graph.unresolved_ambiguous.len(),
|
|
|
|
|
|
sccs = cg_analysis.sccs.len(),
|
|
|
|
|
|
"call graph built"
|
|
|
|
|
|
);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
// ── Pass 2: full analysis ────────────────────────────────────────────
|
|
|
|
|
|
let _span = tracing::info_span!("pass2_indexed").entered();
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let pb2 = make_progress_bar(
|
|
|
|
|
|
files.len() as u64,
|
|
|
|
|
|
"Pass 2: Running analysis",
|
|
|
|
|
|
show_progress,
|
|
|
|
|
|
);
|
2025-06-23 20:27:16 +02:00
|
|
|
|
let diag_map: DashMap<String, Vec<Diag>> = DashMap::new();
|
2025-06-17 20:45:33 +02:00
|
|
|
|
|
2025-06-24 20:27:06 +02:00
|
|
|
|
files.into_par_iter().for_each_init(
|
|
|
|
|
|
|| Indexer::from_pool(project, &pool).expect("db pool"),
|
|
|
|
|
|
|idx, path| {
|
2026-02-25 04:02:11 -05:00
|
|
|
|
// Read file once for both change-detection and analysis.
|
|
|
|
|
|
let bytes_opt = std::fs::read(&path).ok();
|
|
|
|
|
|
let hash = bytes_opt.as_ref().map(|b| Indexer::digest_bytes(b));
|
|
|
|
|
|
|
2026-02-24 23:44:07 -05:00
|
|
|
|
// In pass 2 we always re-analyse when taint is enabled because
|
|
|
|
|
|
// global summaries may have changed even if this file didn't.
|
|
|
|
|
|
// For AST-only mode, we can still use the cached issues.
|
|
|
|
|
|
let needs_scan = if needs_taint {
|
|
|
|
|
|
true // conservative: always re-analyse in taint mode
|
|
|
|
|
|
} else {
|
2026-02-25 04:02:11 -05:00
|
|
|
|
match (&hash, &bytes_opt) {
|
|
|
|
|
|
(Some(h), _) => idx.should_scan_with_hash(&path, h).unwrap_or(true),
|
|
|
|
|
|
_ => true,
|
|
|
|
|
|
}
|
2026-02-24 23:44:07 -05:00
|
|
|
|
};
|
2025-06-24 20:27:06 +02:00
|
|
|
|
|
|
|
|
|
|
let mut diags = if needs_scan {
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let d = match &bytes_opt {
|
|
|
|
|
|
Some(bytes) => {
|
|
|
|
|
|
run_rules_on_bytes(bytes, &path, cfg, global_summaries.as_ref(), None)
|
|
|
|
|
|
.unwrap_or_default()
|
|
|
|
|
|
}
|
|
|
|
|
|
None => run_rules_on_file(&path, cfg, global_summaries.as_ref(), None)
|
|
|
|
|
|
.unwrap_or_default(),
|
|
|
|
|
|
};
|
2026-02-24 23:44:07 -05:00
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
// Persist issues + update file record (use pre-computed hash)
|
|
|
|
|
|
let file_id = match &hash {
|
|
|
|
|
|
Some(h) => idx.upsert_file_with_hash(&path, h).unwrap_or_default(),
|
|
|
|
|
|
None => idx.upsert_file(&path).unwrap_or_default(),
|
|
|
|
|
|
};
|
2025-06-24 20:27:06 +02:00
|
|
|
|
idx.replace_issues(
|
|
|
|
|
|
file_id,
|
|
|
|
|
|
d.iter().map(|d| IssueRow {
|
|
|
|
|
|
rule_id: &d.id,
|
|
|
|
|
|
severity: d.severity.as_db_str(),
|
|
|
|
|
|
line: d.line as i64,
|
|
|
|
|
|
col: d.col as i64,
|
|
|
|
|
|
}),
|
|
|
|
|
|
)
|
|
|
|
|
|
.ok();
|
|
|
|
|
|
d
|
|
|
|
|
|
} else {
|
|
|
|
|
|
idx.get_issues_from_file(&path).unwrap_or_default()
|
|
|
|
|
|
};
|
2025-06-28 17:36:14 +02:00
|
|
|
|
|
|
|
|
|
|
match cfg.scanner.mode {
|
|
|
|
|
|
crate::utils::config::AnalysisMode::Ast => {
|
2026-02-24 23:44:07 -05:00
|
|
|
|
diags.retain(|d| !d.id.starts_with("taint") && !d.id.starts_with("cfg-"));
|
2025-06-28 17:36:14 +02:00
|
|
|
|
}
|
|
|
|
|
|
crate::utils::config::AnalysisMode::Taint => {
|
2026-02-24 23:44:07 -05:00
|
|
|
|
diags.retain(|d| d.id.starts_with("taint") || d.id.starts_with("cfg-"));
|
2025-06-28 17:36:14 +02:00
|
|
|
|
}
|
|
|
|
|
|
crate::utils::config::AnalysisMode::Full => {}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2025-06-24 20:27:06 +02:00
|
|
|
|
if !diags.is_empty() {
|
|
|
|
|
|
diag_map
|
|
|
|
|
|
.entry(path.to_string_lossy().to_string())
|
2025-06-23 20:27:16 +02:00
|
|
|
|
.or_default()
|
|
|
|
|
|
.append(&mut diags);
|
2025-06-24 20:27:06 +02:00
|
|
|
|
}
|
2026-02-25 04:02:11 -05:00
|
|
|
|
pb2.inc(1);
|
2025-06-24 20:27:06 +02:00
|
|
|
|
},
|
|
|
|
|
|
);
|
2026-02-25 04:02:11 -05:00
|
|
|
|
pb2.finish_and_clear();
|
2025-06-17 20:45:33 +02:00
|
|
|
|
|
2025-06-24 20:27:06 +02:00
|
|
|
|
let mut diags: Vec<Diag> = diag_map.into_iter().flat_map(|(_, v)| v).collect();
|
|
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
if cfg.output.attack_surface_ranking {
|
|
|
|
|
|
crate::rank::rank_diags(&mut diags);
|
|
|
|
|
|
}
|
|
|
|
|
|
for d in &mut diags {
|
|
|
|
|
|
if d.confidence.is_none() {
|
|
|
|
|
|
d.confidence = Some(crate::evidence::compute_confidence(d));
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2025-06-24 20:27:06 +02:00
|
|
|
|
if let Some(max) = cfg.output.max_results {
|
|
|
|
|
|
diags.truncate(max as usize);
|
|
|
|
|
|
}
|
2025-06-24 23:38:32 +02:00
|
|
|
|
|
2025-06-24 20:27:06 +02:00
|
|
|
|
Ok(diags)
|
2025-06-16 16:46:22 +02:00
|
|
|
|
}
|
2025-06-24 23:57:27 +02:00
|
|
|
|
|
2026-02-25 21:16:36 -05:00
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
|
|
// Low-noise prioritization pipeline
|
|
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
|
|
|
|
|
|
|
|
/// Rules eligible for rollup grouping (high-frequency, low-signal patterns).
|
|
|
|
|
|
const ROLLUP_RULES: &[&str] = &[
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
"rs.quality.expect",
|
|
|
|
|
|
"rs.quality.panic_macro",
|
|
|
|
|
|
];
|
|
|
|
|
|
|
|
|
|
|
|
/// Apply category filtering, rollup grouping, and LOW budgets to reduce noise.
|
|
|
|
|
|
///
|
|
|
|
|
|
/// Modifies `diags` in place and returns suppression statistics for the footer.
|
|
|
|
|
|
pub(crate) fn prioritize(
|
|
|
|
|
|
diags: &mut Vec<Diag>,
|
|
|
|
|
|
config: &crate::utils::config::OutputConfig,
|
|
|
|
|
|
show_instances: Option<&str>,
|
|
|
|
|
|
) -> SuppressionStats {
|
|
|
|
|
|
let mut stats = SuppressionStats {
|
|
|
|
|
|
quality_dropped: 0,
|
|
|
|
|
|
low_budget_dropped: 0,
|
|
|
|
|
|
max_results_dropped: 0,
|
|
|
|
|
|
include_quality: config.include_quality,
|
|
|
|
|
|
show_all: config.show_all,
|
|
|
|
|
|
max_low: config.max_low,
|
|
|
|
|
|
max_low_per_file: config.max_low_per_file,
|
|
|
|
|
|
max_low_per_rule: config.max_low_per_rule,
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
if config.show_all {
|
|
|
|
|
|
return stats;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ── 1. Category filter: drop Quality unless include_quality ────────
|
|
|
|
|
|
if !config.include_quality {
|
|
|
|
|
|
let before = diags.len();
|
|
|
|
|
|
diags.retain(|d| d.category != FindingCategory::Quality);
|
|
|
|
|
|
stats.quality_dropped = before - diags.len();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ── 2. Rollup: group high-frequency LOW Quality findings ──────────
|
|
|
|
|
|
rollup_findings(diags, config, show_instances);
|
|
|
|
|
|
|
|
|
|
|
|
// ── 3. LOW budgets ────────────────────────────────────────────────
|
|
|
|
|
|
apply_low_budgets(diags, config, &mut stats);
|
|
|
|
|
|
|
|
|
|
|
|
// ── 4. Global max_results with severity stability ─────────────────
|
|
|
|
|
|
if let Some(max) = config.max_results {
|
|
|
|
|
|
let max = max as usize;
|
|
|
|
|
|
if diags.len() > max {
|
|
|
|
|
|
// Partition by severity priority: High first, then Medium, then Low
|
|
|
|
|
|
let high_count = diags
|
|
|
|
|
|
.iter()
|
|
|
|
|
|
.filter(|d| d.severity == Severity::High)
|
|
|
|
|
|
.count();
|
|
|
|
|
|
let med_count = diags
|
|
|
|
|
|
.iter()
|
|
|
|
|
|
.filter(|d| d.severity == Severity::Medium)
|
|
|
|
|
|
.count();
|
|
|
|
|
|
|
|
|
|
|
|
let take = if high_count >= max {
|
|
|
|
|
|
// Only High fits
|
|
|
|
|
|
diags.retain(|d| d.severity == Severity::High);
|
|
|
|
|
|
diags.truncate(max);
|
|
|
|
|
|
max
|
|
|
|
|
|
} else if high_count + med_count >= max {
|
|
|
|
|
|
// High + some Medium
|
|
|
|
|
|
let med_slots = max - high_count;
|
|
|
|
|
|
let mut med_seen = 0usize;
|
|
|
|
|
|
diags.retain(|d| {
|
|
|
|
|
|
if d.severity == Severity::High {
|
|
|
|
|
|
true
|
|
|
|
|
|
} else if d.severity == Severity::Medium && med_seen < med_slots {
|
|
|
|
|
|
med_seen += 1;
|
|
|
|
|
|
true
|
|
|
|
|
|
} else {
|
|
|
|
|
|
false
|
|
|
|
|
|
}
|
|
|
|
|
|
});
|
|
|
|
|
|
max
|
|
|
|
|
|
} else {
|
|
|
|
|
|
// High + Medium + some Low
|
|
|
|
|
|
let low_slots = max - high_count - med_count;
|
|
|
|
|
|
let mut low_seen = 0usize;
|
|
|
|
|
|
diags.retain(|d| {
|
|
|
|
|
|
if d.severity == Severity::High || d.severity == Severity::Medium {
|
|
|
|
|
|
true
|
|
|
|
|
|
} else if low_seen < low_slots {
|
|
|
|
|
|
low_seen += 1;
|
|
|
|
|
|
true
|
|
|
|
|
|
} else {
|
|
|
|
|
|
false
|
|
|
|
|
|
}
|
|
|
|
|
|
});
|
|
|
|
|
|
max
|
|
|
|
|
|
};
|
|
|
|
|
|
let original_total = high_count + med_count + diags.len(); // approximate
|
|
|
|
|
|
stats.max_results_dropped = original_total.saturating_sub(take);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
stats
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Group eligible LOW Quality findings into rollup Diags.
|
|
|
|
|
|
fn rollup_findings(
|
|
|
|
|
|
diags: &mut Vec<Diag>,
|
|
|
|
|
|
config: &crate::utils::config::OutputConfig,
|
|
|
|
|
|
show_instances: Option<&str>,
|
|
|
|
|
|
) {
|
|
|
|
|
|
use std::collections::HashMap;
|
|
|
|
|
|
|
|
|
|
|
|
// Identify which diags are eligible for rollup
|
|
|
|
|
|
let mut groups: HashMap<(String, String), Vec<usize>> = HashMap::new();
|
|
|
|
|
|
for (i, d) in diags.iter().enumerate() {
|
|
|
|
|
|
if d.severity != Severity::Low {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
if d.category != FindingCategory::Quality {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
if !ROLLUP_RULES.contains(&d.id.as_str()) {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
if show_instances == Some(d.id.as_str()) {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
groups
|
|
|
|
|
|
.entry((d.path.clone(), d.id.clone()))
|
|
|
|
|
|
.or_default()
|
|
|
|
|
|
.push(i);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Only rollup groups with more than 1 occurrence
|
|
|
|
|
|
let mut to_remove: Vec<usize> = Vec::new();
|
|
|
|
|
|
let mut rollups: Vec<Diag> = Vec::new();
|
|
|
|
|
|
|
|
|
|
|
|
for ((_path, _rule_id), mut indices) in groups {
|
|
|
|
|
|
if indices.len() <= 1 {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Sort by (line, col) for deterministic canonical location
|
|
|
|
|
|
indices.sort_by_key(|&i| (diags[i].line, diags[i].col));
|
|
|
|
|
|
|
|
|
|
|
|
let canonical_idx = indices[0];
|
|
|
|
|
|
let total = indices.len();
|
|
|
|
|
|
|
|
|
|
|
|
// Collect example locations (first N)
|
|
|
|
|
|
let examples: Vec<Location> = indices
|
|
|
|
|
|
.iter()
|
|
|
|
|
|
.take(config.rollup_examples as usize)
|
|
|
|
|
|
.map(|&i| Location {
|
|
|
|
|
|
line: diags[i].line,
|
|
|
|
|
|
col: diags[i].col,
|
|
|
|
|
|
})
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
|
|
|
|
|
|
// Build rollup Diag from canonical
|
|
|
|
|
|
let canonical = &diags[canonical_idx];
|
|
|
|
|
|
let rollup_diag = Diag {
|
|
|
|
|
|
path: canonical.path.clone(),
|
|
|
|
|
|
line: canonical.line,
|
|
|
|
|
|
col: canonical.col,
|
|
|
|
|
|
severity: canonical.severity,
|
|
|
|
|
|
id: canonical.id.clone(),
|
|
|
|
|
|
category: canonical.category,
|
|
|
|
|
|
path_validated: false,
|
|
|
|
|
|
guard_kind: None,
|
|
|
|
|
|
message: canonical.message.clone(),
|
|
|
|
|
|
labels: vec![],
|
|
|
|
|
|
confidence: canonical.confidence,
|
|
|
|
|
|
evidence: None,
|
|
|
|
|
|
rank_score: None,
|
|
|
|
|
|
rank_reason: None,
|
|
|
|
|
|
suppressed: false,
|
|
|
|
|
|
suppression: None,
|
|
|
|
|
|
rollup: Some(RollupData {
|
|
|
|
|
|
count: total,
|
|
|
|
|
|
occurrences: examples,
|
|
|
|
|
|
}),
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
rollups.push(rollup_diag);
|
|
|
|
|
|
to_remove.extend(indices);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if to_remove.is_empty() {
|
|
|
|
|
|
return;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Remove originals (in reverse order to preserve indices)
|
|
|
|
|
|
to_remove.sort_unstable();
|
|
|
|
|
|
to_remove.dedup();
|
|
|
|
|
|
for &i in to_remove.iter().rev() {
|
|
|
|
|
|
diags.remove(i);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Sort rollups for deterministic output: by (path, id, line)
|
|
|
|
|
|
rollups.sort_by(|a, b| {
|
|
|
|
|
|
a.path
|
|
|
|
|
|
.cmp(&b.path)
|
|
|
|
|
|
.then(a.id.cmp(&b.id))
|
|
|
|
|
|
.then(a.line.cmp(&b.line))
|
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
|
|
// Add rollup diags
|
|
|
|
|
|
diags.extend(rollups);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Enforce per-file, per-rule, and total LOW budgets.
|
|
|
|
|
|
fn apply_low_budgets(
|
|
|
|
|
|
diags: &mut Vec<Diag>,
|
|
|
|
|
|
config: &crate::utils::config::OutputConfig,
|
|
|
|
|
|
stats: &mut SuppressionStats,
|
|
|
|
|
|
) {
|
|
|
|
|
|
use std::collections::HashMap;
|
|
|
|
|
|
|
|
|
|
|
|
let mut per_file: HashMap<String, u32> = HashMap::new();
|
|
|
|
|
|
let mut per_rule: HashMap<String, u32> = HashMap::new();
|
|
|
|
|
|
let mut total_low: u32 = 0;
|
|
|
|
|
|
|
|
|
|
|
|
let before = diags.len();
|
|
|
|
|
|
diags.retain(|d| {
|
|
|
|
|
|
// High/Medium always kept
|
|
|
|
|
|
if d.severity != Severity::Low {
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Check per-file budget
|
|
|
|
|
|
let file_count = per_file.entry(d.path.clone()).or_insert(0);
|
|
|
|
|
|
if *file_count >= config.max_low_per_file {
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Check per-rule budget
|
|
|
|
|
|
let rule_count = per_rule.entry(d.id.clone()).or_insert(0);
|
|
|
|
|
|
if *rule_count >= config.max_low_per_rule {
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Check total budget
|
|
|
|
|
|
if total_low >= config.max_low {
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
*file_count += 1;
|
|
|
|
|
|
*rule_count += 1;
|
|
|
|
|
|
total_low += 1;
|
|
|
|
|
|
true
|
|
|
|
|
|
});
|
|
|
|
|
|
stats.low_budget_dropped = before - diags.len();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
|
|
// Inline suppression application
|
|
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
|
|
|
|
|
|
|
|
/// Apply inline `nyx:ignore` / `nyx:ignore-next-line` suppressions to `diags`.
|
|
|
|
|
|
///
|
|
|
|
|
|
/// For each unique file path in the diagnostics, the source file is read once,
|
|
|
|
|
|
/// suppression directives are parsed, and matching findings are marked as
|
|
|
|
|
|
/// suppressed.
|
|
|
|
|
|
fn apply_suppressions(diags: &mut [Diag]) {
|
|
|
|
|
|
use std::collections::HashMap;
|
|
|
|
|
|
|
|
|
|
|
|
// Group diag indices by path (clone path strings to avoid borrowing diags).
|
|
|
|
|
|
let mut by_path: HashMap<String, Vec<usize>> = HashMap::new();
|
|
|
|
|
|
for (i, d) in diags.iter().enumerate() {
|
|
|
|
|
|
by_path.entry(d.path.clone()).or_default().push(i);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
for (path, indices) in &by_path {
|
|
|
|
|
|
let Ok(source) = std::fs::read_to_string(path) else {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
};
|
|
|
|
|
|
let file_path = Path::new(path.as_str());
|
|
|
|
|
|
let index = crate::suppress::parse_inline_suppressions(file_path, &source);
|
|
|
|
|
|
if index.is_empty() {
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
for &i in indices {
|
|
|
|
|
|
if let Some(meta) = index.check(diags[i].line, &diags[i].id) {
|
|
|
|
|
|
diags[i].suppressed = true;
|
|
|
|
|
|
diags[i].suppression = Some(meta);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2025-06-24 23:57:27 +02:00
|
|
|
|
#[test]
|
|
|
|
|
|
fn scan_with_index_parallel_uses_existing_index_without_rescanning() {
|
|
|
|
|
|
let mut cfg = Config::default();
|
|
|
|
|
|
cfg.performance.worker_threads = Some(1);
|
|
|
|
|
|
cfg.performance.channel_multiplier = 1;
|
|
|
|
|
|
cfg.performance.batch_size = 2;
|
|
|
|
|
|
|
|
|
|
|
|
let td = tempfile::tempdir().unwrap();
|
|
|
|
|
|
let project_dir = td.path().join("proj");
|
|
|
|
|
|
std::fs::create_dir(&project_dir).unwrap();
|
|
|
|
|
|
std::fs::write(project_dir.join("foo.txt"), "abc").unwrap();
|
|
|
|
|
|
|
|
|
|
|
|
let (project_name, db_path) = get_project_info(&project_dir, td.path()).unwrap();
|
2026-02-25 04:02:11 -05:00
|
|
|
|
crate::commands::index::build_index(&project_name, &project_dir, &db_path, &cfg, false)
|
|
|
|
|
|
.unwrap();
|
2025-06-24 23:57:27 +02:00
|
|
|
|
|
|
|
|
|
|
let pool = Indexer::init(&db_path).unwrap();
|
|
|
|
|
|
|
|
|
|
|
|
assert_eq!(
|
|
|
|
|
|
Indexer::from_pool(&project_name, &pool)
|
|
|
|
|
|
.unwrap()
|
|
|
|
|
|
.get_files(&project_name)
|
|
|
|
|
|
.unwrap()
|
|
|
|
|
|
.len(),
|
|
|
|
|
|
1
|
|
|
|
|
|
);
|
|
|
|
|
|
|
2026-02-25 04:02:11 -05:00
|
|
|
|
let diags = scan_with_index_parallel(&project_name, Arc::clone(&pool), &cfg, false)
|
2025-06-24 23:57:27 +02:00
|
|
|
|
.expect("scan should succeed");
|
|
|
|
|
|
|
|
|
|
|
|
assert!(diags.is_empty());
|
|
|
|
|
|
}
|
2026-02-25 21:16:36 -05:00
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn severity_filter_applied_at_output_stage() {
|
|
|
|
|
|
// Simulate: findings start as High, get downgraded to Medium by nonprod logic,
|
|
|
|
|
|
// then --severity HIGH should filter them out.
|
|
|
|
|
|
let diags = vec![
|
|
|
|
|
|
Diag {
|
|
|
|
|
|
path: "tests/test.py".into(),
|
|
|
|
|
|
line: 1,
|
|
|
|
|
|
col: 1,
|
|
|
|
|
|
severity: Severity::Medium, // was High, downgraded
|
|
|
|
|
|
id: "taint-unsanitised-flow".into(),
|
|
|
|
|
|
category: FindingCategory::Security,
|
|
|
|
|
|
path_validated: false,
|
|
|
|
|
|
guard_kind: None,
|
|
|
|
|
|
message: None,
|
|
|
|
|
|
labels: vec![],
|
|
|
|
|
|
confidence: None,
|
|
|
|
|
|
evidence: None,
|
|
|
|
|
|
rank_score: None,
|
|
|
|
|
|
rank_reason: None,
|
|
|
|
|
|
suppressed: false,
|
|
|
|
|
|
suppression: None,
|
|
|
|
|
|
rollup: None,
|
|
|
|
|
|
},
|
|
|
|
|
|
Diag {
|
|
|
|
|
|
path: "src/main.rs".into(),
|
|
|
|
|
|
line: 10,
|
|
|
|
|
|
col: 5,
|
|
|
|
|
|
severity: Severity::High,
|
|
|
|
|
|
id: "taint-unsanitised-flow".into(),
|
|
|
|
|
|
category: FindingCategory::Security,
|
|
|
|
|
|
path_validated: false,
|
|
|
|
|
|
guard_kind: None,
|
|
|
|
|
|
message: None,
|
|
|
|
|
|
labels: vec![],
|
|
|
|
|
|
confidence: None,
|
|
|
|
|
|
evidence: None,
|
|
|
|
|
|
rank_score: None,
|
|
|
|
|
|
rank_reason: None,
|
|
|
|
|
|
suppressed: false,
|
|
|
|
|
|
suppression: None,
|
|
|
|
|
|
rollup: None,
|
|
|
|
|
|
},
|
|
|
|
|
|
];
|
|
|
|
|
|
|
|
|
|
|
|
let filter = SeverityFilter::parse("HIGH").unwrap();
|
|
|
|
|
|
let filtered: Vec<_> = diags
|
|
|
|
|
|
.into_iter()
|
|
|
|
|
|
.filter(|d| filter.matches(d.severity))
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
|
|
|
|
|
|
assert_eq!(filtered.len(), 1);
|
|
|
|
|
|
assert_eq!(filtered[0].severity, Severity::High);
|
|
|
|
|
|
assert_eq!(filtered[0].path, "src/main.rs");
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
|
|
// Prioritization pipeline tests
|
|
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
|
|
mod prioritize_tests {
|
|
|
|
|
|
use super::*;
|
|
|
|
|
|
use crate::utils::config::OutputConfig;
|
|
|
|
|
|
|
|
|
|
|
|
fn make_diag(
|
|
|
|
|
|
path: &str,
|
|
|
|
|
|
line: usize,
|
|
|
|
|
|
severity: Severity,
|
|
|
|
|
|
id: &str,
|
|
|
|
|
|
cat: FindingCategory,
|
|
|
|
|
|
) -> Diag {
|
|
|
|
|
|
Diag {
|
|
|
|
|
|
path: path.into(),
|
|
|
|
|
|
line,
|
|
|
|
|
|
col: 1,
|
|
|
|
|
|
severity,
|
|
|
|
|
|
id: id.into(),
|
|
|
|
|
|
category: cat,
|
|
|
|
|
|
path_validated: false,
|
|
|
|
|
|
guard_kind: None,
|
|
|
|
|
|
message: None,
|
|
|
|
|
|
labels: vec![],
|
|
|
|
|
|
confidence: None,
|
|
|
|
|
|
evidence: None,
|
|
|
|
|
|
rank_score: None,
|
|
|
|
|
|
rank_reason: None,
|
|
|
|
|
|
suppressed: false,
|
|
|
|
|
|
suppression: None,
|
|
|
|
|
|
rollup: None,
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn default_config() -> OutputConfig {
|
|
|
|
|
|
OutputConfig::default()
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn quality_dropped_by_default() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
2,
|
|
|
|
|
|
Severity::High,
|
|
|
|
|
|
"taint-flow",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let stats = prioritize(&mut diags, &default_config(), None);
|
|
|
|
|
|
assert_eq!(diags.len(), 1);
|
|
|
|
|
|
assert_eq!(diags[0].id, "taint-flow");
|
|
|
|
|
|
assert_eq!(stats.quality_dropped, 1);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn quality_kept_with_include_quality() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
2,
|
|
|
|
|
|
Severity::High,
|
|
|
|
|
|
"taint-flow",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
let stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
assert_eq!(diags.len(), 2);
|
|
|
|
|
|
assert_eq!(stats.quality_dropped, 0);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn show_all_disables_everything() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
2,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
3,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.show_all = true;
|
|
|
|
|
|
let stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
assert_eq!(diags.len(), 3); // no filtering, no rollup
|
|
|
|
|
|
assert_eq!(stats.quality_dropped, 0);
|
|
|
|
|
|
assert_eq!(stats.low_budget_dropped, 0);
|
|
|
|
|
|
assert!(diags.iter().all(|d| d.rollup.is_none()));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn rollup_groups_by_file_and_rule() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
10,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
20,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
30,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"b.rs",
|
|
|
|
|
|
5,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"b.rs",
|
|
|
|
|
|
15,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
let _stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
|
|
|
|
|
|
// Should have 2 rollup diags (one per file)
|
|
|
|
|
|
let rollups: Vec<_> = diags.iter().filter(|d| d.rollup.is_some()).collect();
|
|
|
|
|
|
assert_eq!(rollups.len(), 2);
|
|
|
|
|
|
|
|
|
|
|
|
let a_rollup = rollups.iter().find(|d| d.path == "a.rs").unwrap();
|
|
|
|
|
|
assert_eq!(a_rollup.rollup.as_ref().unwrap().count, 3);
|
|
|
|
|
|
|
|
|
|
|
|
let b_rollup = rollups.iter().find(|d| d.path == "b.rs").unwrap();
|
|
|
|
|
|
assert_eq!(b_rollup.rollup.as_ref().unwrap().count, 2);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn rollup_examples_limited() {
|
|
|
|
|
|
let mut diags: Vec<Diag> = (1..=20)
|
|
|
|
|
|
.map(|i| {
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
i,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
)
|
|
|
|
|
|
})
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
cfg.rollup_examples = 3;
|
|
|
|
|
|
let _stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
|
|
|
|
|
|
let rollup = diags.iter().find(|d| d.rollup.is_some()).unwrap();
|
|
|
|
|
|
assert_eq!(rollup.rollup.as_ref().unwrap().count, 20);
|
|
|
|
|
|
assert_eq!(rollup.rollup.as_ref().unwrap().occurrences.len(), 3);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn rollup_canonical_is_first_sorted() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
50,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
10,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
30,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
let _stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
|
|
|
|
|
|
let rollup = diags.iter().find(|d| d.rollup.is_some()).unwrap();
|
|
|
|
|
|
assert_eq!(rollup.line, 10); // canonical = first sorted
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn low_budget_per_file() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"some-rule",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
2,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"some-rule-2",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"b.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"some-rule",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.max_low_per_file = 1;
|
|
|
|
|
|
cfg.max_low = 100;
|
|
|
|
|
|
cfg.max_low_per_rule = 100;
|
|
|
|
|
|
let stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
// a.rs: only 1 LOW kept, b.rs: 1 LOW kept
|
|
|
|
|
|
assert_eq!(diags.len(), 2);
|
|
|
|
|
|
assert_eq!(stats.low_budget_dropped, 1);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn low_budget_per_rule() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rule-x",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"b.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rule-x",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"c.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rule-x",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.max_low_per_file = 100;
|
|
|
|
|
|
cfg.max_low = 100;
|
|
|
|
|
|
cfg.max_low_per_rule = 2;
|
|
|
|
|
|
let stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
assert_eq!(diags.len(), 2);
|
|
|
|
|
|
assert_eq!(stats.low_budget_dropped, 1);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn low_budget_total() {
|
|
|
|
|
|
let mut diags: Vec<Diag> = (1..=5)
|
|
|
|
|
|
.map(|i| {
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
&format!("f{i}.rs"),
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
&format!("rule-{i}"),
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
)
|
|
|
|
|
|
})
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.max_low_per_file = 100;
|
|
|
|
|
|
cfg.max_low_per_rule = 100;
|
|
|
|
|
|
cfg.max_low = 3;
|
|
|
|
|
|
let stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
assert_eq!(diags.len(), 3);
|
|
|
|
|
|
assert_eq!(stats.low_budget_dropped, 2);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn high_medium_never_dropped_by_low_budget() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::High,
|
|
|
|
|
|
"vuln-1",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
2,
|
|
|
|
|
|
Severity::Medium,
|
|
|
|
|
|
"vuln-2",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
3,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"vuln-3",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.max_low = 0;
|
|
|
|
|
|
cfg.max_low_per_file = 0;
|
|
|
|
|
|
cfg.max_low_per_rule = 0;
|
|
|
|
|
|
let stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
assert_eq!(diags.len(), 2); // High + Medium kept
|
|
|
|
|
|
assert!(diags.iter().all(|d| d.severity != Severity::Low));
|
|
|
|
|
|
assert_eq!(stats.low_budget_dropped, 1);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn rollup_counts_as_one_for_budget() {
|
|
|
|
|
|
// 10 unwrap findings in same file → 1 rollup → counts as 1 LOW
|
|
|
|
|
|
let mut diags: Vec<Diag> = (1..=10)
|
|
|
|
|
|
.map(|i| {
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
i,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
)
|
|
|
|
|
|
})
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
// Add another LOW finding from a different rule
|
|
|
|
|
|
diags.push(make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
100,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"other-rule",
|
|
|
|
|
|
FindingCategory::Security,
|
|
|
|
|
|
));
|
|
|
|
|
|
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
cfg.max_low_per_file = 2; // allow 2 per file
|
|
|
|
|
|
cfg.max_low = 100;
|
|
|
|
|
|
cfg.max_low_per_rule = 100;
|
|
|
|
|
|
let _stats = prioritize(&mut diags, &cfg, None);
|
|
|
|
|
|
|
|
|
|
|
|
// Should have rollup (1) + other-rule (1) = 2
|
|
|
|
|
|
assert_eq!(diags.len(), 2);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn show_instances_bypasses_rollup_for_rule() {
|
|
|
|
|
|
let mut diags = vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
2,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
3,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.expect",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
4,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.expect",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
];
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
cfg.max_low = 100;
|
|
|
|
|
|
cfg.max_low_per_file = 100;
|
|
|
|
|
|
cfg.max_low_per_rule = 100;
|
|
|
|
|
|
let _stats = prioritize(&mut diags, &cfg, Some("rs.quality.unwrap"));
|
|
|
|
|
|
|
|
|
|
|
|
// unwrap not rolled up (2 individual), expect rolled up (1 rollup)
|
|
|
|
|
|
let unwrap_count = diags.iter().filter(|d| d.id == "rs.quality.unwrap").count();
|
|
|
|
|
|
let expect_rollup = diags
|
|
|
|
|
|
.iter()
|
|
|
|
|
|
.find(|d| d.id == "rs.quality.expect" && d.rollup.is_some());
|
|
|
|
|
|
assert_eq!(unwrap_count, 2);
|
|
|
|
|
|
assert!(expect_rollup.is_some());
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn json_includes_rollup_data() {
|
|
|
|
|
|
let d = Diag {
|
|
|
|
|
|
path: "a.rs".into(),
|
|
|
|
|
|
line: 10,
|
|
|
|
|
|
col: 1,
|
|
|
|
|
|
severity: Severity::Low,
|
|
|
|
|
|
id: "rs.quality.unwrap".into(),
|
|
|
|
|
|
category: FindingCategory::Quality,
|
|
|
|
|
|
path_validated: false,
|
|
|
|
|
|
guard_kind: None,
|
|
|
|
|
|
message: None,
|
|
|
|
|
|
labels: vec![],
|
|
|
|
|
|
confidence: None,
|
|
|
|
|
|
evidence: None,
|
|
|
|
|
|
rank_score: None,
|
|
|
|
|
|
rank_reason: None,
|
|
|
|
|
|
suppressed: false,
|
|
|
|
|
|
suppression: None,
|
|
|
|
|
|
rollup: Some(RollupData {
|
|
|
|
|
|
count: 38,
|
|
|
|
|
|
occurrences: vec![Location { line: 10, col: 1 }, Location { line: 20, col: 5 }],
|
|
|
|
|
|
}),
|
|
|
|
|
|
};
|
|
|
|
|
|
let json = serde_json::to_string(&d).unwrap();
|
|
|
|
|
|
assert!(json.contains("\"rollup\""));
|
|
|
|
|
|
assert!(json.contains("\"count\":38"));
|
|
|
|
|
|
assert!(json.contains("\"occurrences\""));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
|
fn deterministic_output() {
|
|
|
|
|
|
let make_diags = || {
|
|
|
|
|
|
vec![
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"b.rs",
|
|
|
|
|
|
5,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
10,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"a.rs",
|
|
|
|
|
|
3,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
make_diag(
|
|
|
|
|
|
"b.rs",
|
|
|
|
|
|
1,
|
|
|
|
|
|
Severity::Low,
|
|
|
|
|
|
"rs.quality.unwrap",
|
|
|
|
|
|
FindingCategory::Quality,
|
|
|
|
|
|
),
|
|
|
|
|
|
]
|
|
|
|
|
|
};
|
|
|
|
|
|
let mut cfg = default_config();
|
|
|
|
|
|
cfg.include_quality = true;
|
|
|
|
|
|
|
|
|
|
|
|
let mut d1 = make_diags();
|
|
|
|
|
|
let mut d2 = make_diags();
|
|
|
|
|
|
let _s1 = prioritize(&mut d1, &cfg, None);
|
|
|
|
|
|
let _s2 = prioritize(&mut d2, &cfg, None);
|
|
|
|
|
|
|
|
|
|
|
|
let j1 = serde_json::to_string(&d1).unwrap();
|
|
|
|
|
|
let j2 = serde_json::to_string(&d2).unwrap();
|
|
|
|
|
|
assert_eq!(j1, j2, "same input should produce same output");
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|