18008720487

Committed 25 Sep 2025 01:16PM UTC coverage: 49.589% (-0.4%) from 49.949%

Build # 18008720487

Build Type

push

github

Committed by

vigna

Commit Message

Fixed fuzzing code for new epserde

Run Details

0 of 2 new or added lines in 1 file covered. (0.0%)

650 existing lines in 25 files now uncovered.

3862 of 7788 relevant lines covered (49.59%)

25127316.85 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

41.18

/cli/src/perm/bfs.rs

/*
 * SPDX-FileCopyrightText: 2023 Sebastiano Vigna
 * SPDX-FileCopyrightText: 2023 Tommaso Fontana
 *
 * SPDX-License-Identifier: Apache-2.0 OR LGPL-2.1-or-later
 */

use crate::{create_parent_dir, GlobalArgs};
use anyhow::{Context, Result};
use clap::Parser;
use dsi_bitstream::dispatch::factory::CodesReaderFactoryHelper;
use dsi_bitstream::prelude::*;
use dsi_progress_logger::prelude::*;
use epserde::prelude::Serialize;
use std::io::{BufWriter, Write};
use std::path::PathBuf;
use webgraph::prelude::*;

#[derive(Parser, Debug)]
#[command(name = "bfs", about = "Computes the permutation induced by a breadth-first visit.", long_about = None)]
pub struct CliArgs {
    /// The basename of the graph.
    pub src: PathBuf,

    /// The filename of the permutation in binary big-endian format.
    pub perm: PathBuf,

    #[arg(short, long)]
    /// Save the permutation in ε-serde format.
    pub epserde: bool,
}

pub fn main(global_args: GlobalArgs, args: CliArgs) -> Result<()> {
    create_parent_dir(&args.perm)?;

    match get_endianness(&args.src)?.as_str() {
        #[cfg(feature = "be_bins")]
        BE::NAME => bfs::<BE>(global_args, args),
        #[cfg(feature = "le_bins")]
        LE::NAME => bfs::<LE>(global_args, args),
        e => panic!("Unknown endianness: {}", e),
    }
}

pub fn bfs<E: Endianness + 'static + Send + Sync>(
    global_args: GlobalArgs,
    args: CliArgs,
) -> Result<()>
where
    MemoryFactory<E, MmapHelper<u32>>: CodesReaderFactoryHelper<E>,
    for<'a> LoadModeCodesReader<'a, E, LoadMmap>: BitSeek,
{
    // load the graph
    let graph = BvGraph::with_basename(&args.src)
        .mode::<LoadMmap>()
        .flags(MemoryFlags::TRANSPARENT_HUGE_PAGES | MemoryFlags::RANDOM_ACCESS)
        .endianness::<E>()
        .load()?;

    let mut pl = ProgressLogger::default();
    pl.display_memory(true)
        .item_name("nodes")
        .expected_updates(Some(graph.num_nodes()));
    if let Some(duration) = global_args.log_interval {
        pl.log_interval(duration);
    }

    // create the permutation
    let mut perm = vec![0; graph.num_nodes()];
    pl.start("Computing BFS permutation...");
    let mut visit = webgraph::visits::breadth_first::Seq::new(&graph);
    for (i, event) in visit.into_iter().enumerate() {
        perm[event.node] = i;
        pl.light_update();
    }
    pl.done();

    if args.epserde {
        unsafe {
            perm.store(&args.perm)
                .with_context(|| format!("Could not write permutation to {}", args.perm.display()))
        }?;
    } else {
        let mut file = std::fs::File::create(&args.perm)
            .with_context(|| format!("Could not create permutation at {}", args.perm.display()))?;
        let mut buf = BufWriter::new(&mut file);
        pl.start(format!("Storing the nodes to {}", args.perm.display()));
        for word in perm.iter() {
            buf.write_all(&word.to_be_bytes()).with_context(|| {
                format!("Could not write permutation to {}", args.perm.display())
            })?;
            pl.light_update();
        }
        pl.done();
    }
    Ok(())
}

1	/*
2	* SPDX-FileCopyrightText: 2023 Sebastiano Vigna
3	* SPDX-FileCopyrightText: 2023 Tommaso Fontana
4	*
5	* SPDX-License-Identifier: Apache-2.0 OR LGPL-2.1-or-later
6	*/
7
8	use crate::{create_parent_dir, GlobalArgs};
9	use anyhow::{Context, Result};
10	use clap::Parser;
11	use dsi_bitstream::dispatch::factory::CodesReaderFactoryHelper;
12	use dsi_bitstream::prelude::*;
13	use dsi_progress_logger::prelude::*;
14	use epserde::prelude::Serialize;
15	use std::io::{BufWriter, Write};
16	use std::path::PathBuf;
17	use webgraph::prelude::*;
18
19	#[derive(Parser, Debug)]
20	#[command(name = "bfs", about = "Computes the permutation induced by a breadth-first visit.", long_about = None)]
21	pub struct CliArgs {
22	/// The basename of the graph.
23	pub src: PathBuf,
24
25	/// The filename of the permutation in binary big-endian format.
26	pub perm: PathBuf,
27
28	#[arg(short, long)]
29	/// Save the permutation in ε-serde format.
30	pub epserde: bool,
31	}
32
33	pub fn main(global_args: GlobalArgs, args: CliArgs) -> Result<()> {	4✔
34	create_parent_dir(&args.perm)?;	8✔
35
36	match get_endianness(&args.src)?.as_str() {	8✔
37	#[cfg(feature = "be_bins")]
38	BE::NAME => bfs::<BE>(global_args, args),	12✔
39	#[cfg(feature = "le_bins")]
40	LE::NAME => bfs::<LE>(global_args, args),	×
41	e => panic!("Unknown endianness: {}", e),	×
42	}
43	}
44
45	pub fn bfs<E: Endianness + 'static + Send + Sync>(	4✔
46	global_args: GlobalArgs,
47	args: CliArgs,
48	) -> Result<()>
49	where
50	MemoryFactory<E, MmapHelper<u32>>: CodesReaderFactoryHelper<E>,
51	for<'a> LoadModeCodesReader<'a, E, LoadMmap>: BitSeek,
52	{
53	// load the graph
54	let graph = BvGraph::with_basename(&args.src)	12✔
55	.mode::<LoadMmap>()
56	.flags(MemoryFlags::TRANSPARENT_HUGE_PAGES \| MemoryFlags::RANDOM_ACCESS)	8✔
57	.endianness::<E>()
58	.load()?;
59
60	let mut pl = ProgressLogger::default();	×
61	pl.display_memory(true)	×
62	.item_name("nodes")
63	.expected_updates(Some(graph.num_nodes()));	×
64	if let Some(duration) = global_args.log_interval {	×
65	pl.log_interval(duration);	×
66	}
67
68	// create the permutation
69	let mut perm = vec![0; graph.num_nodes()];	×
70	pl.start("Computing BFS permutation...");	×
71	let mut visit = webgraph::visits::breadth_first::Seq::new(&graph);	×
72	for (i, event) in visit.into_iter().enumerate() {	1,302,228✔
73	perm[event.node] = i;	×
74	pl.light_update();	×
75	}
76	pl.done();	×
77
78	if args.epserde {	×
79	unsafe {
80	perm.store(&args.perm)	×
UNCOV 81	.with_context(\|\| format!("Could not write permutation to {}", args.perm.display()))	×
82	}?;
83	} else {
84	let mut file = std::fs::File::create(&args.perm)	8✔
85	.with_context(\|\| format!("Could not create permutation at {}", args.perm.display()))?;	×
UNCOV 86	let mut buf = BufWriter::new(&mut file);	×
UNCOV 87	pl.start(format!("Storing the nodes to {}", args.perm.display()));	×
88	for word in perm.iter() {	1,302,228✔
89	buf.write_all(&word.to_be_bytes()).with_context(\|\| {	5,208,912✔
UNCOV 90	format!("Could not write permutation to {}", args.perm.display())	×
91	})?;
92	pl.light_update();	1,302,228✔
93	}
94	pl.done();	4✔
95	}
96	Ok(())	4✔
97	}

vigna / webgraph-rs / 18008720487

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous