Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Splitting profile_proto example #208

Merged
merged 1 commit into from
Apr 13, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 5 additions & 1 deletion Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -59,9 +59,13 @@ name = "flamegraph"
required-features = ["flamegraph"]

[[example]]
name = "profile_proto"
name = "profile_proto_with_prost"
required-features = ["protobuf", "prost-codec"]

[[example]]
name = "profile_proto_with_protobuf_codec"
required-features = ["protobuf", "protobuf-codec"]

[[example]]
name = "multithread_flamegraph"
required-features = ["flamegraph"]
Expand Down
112 changes: 112 additions & 0 deletions examples/profile_proto_with_prost.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,112 @@
// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.

use pprof::protos::Message;
use std::fs::File;
use std::io::Write;

#[inline(never)]
fn is_prime_number1(v: usize, prime_numbers: &[usize]) -> bool {
if v < 10000 {
let r = prime_numbers.binary_search(&v);
return r.is_ok();
}

for n in prime_numbers {
if v % n == 0 {
return false;
}
}

true
}

#[inline(always)]
fn is_prime_number2(v: usize, prime_numbers: &[usize]) -> bool {
if v < 10000 {
let r = prime_numbers.binary_search(&v);
return r.is_ok();
}

for n in prime_numbers {
if v % n == 0 {
return false;
}
}

true
}

#[inline(never)]
fn is_prime_number3(v: usize, prime_numbers: &[usize]) -> bool {
if v < 10000 {
let r = prime_numbers.binary_search(&v);
return r.is_ok();
}

for n in prime_numbers {
if v % n == 0 {
return false;
}
}

true
}

#[inline(never)]
fn prepare_prime_numbers() -> Vec<usize> {
// bootstrap: Generate a prime table of 0..10000
let mut prime_number_table: [bool; 10000] = [true; 10000];
prime_number_table[0] = false;
prime_number_table[1] = false;
for i in 2..10000 {
if prime_number_table[i] {
let mut v = i * 2;
while v < 10000 {
prime_number_table[v] = false;
v += i;
}
}
}
let mut prime_numbers = vec![];
for (i, exist) in prime_number_table.iter().enumerate().skip(2) {
if *exist {
prime_numbers.push(i);
}
}
prime_numbers
}

fn main() {
let prime_numbers = prepare_prime_numbers();

let guard = pprof::ProfilerGuard::new(100).unwrap();

let mut v = 0;

for i in 2..5000000 {
if i % 4 == 0 {
if is_prime_number1(i, &prime_numbers) {
v += 1;
}
} else if i % 4 == 1 {
if is_prime_number2(i, &prime_numbers) {
v += 1;
}
} else if is_prime_number3(i, &prime_numbers) {
v += 1;
}
}

println!("Prime numbers: {}", v);

if let Ok(report) = guard.report().build() {
let mut file = File::create("profile.pb").unwrap();
let profile = report.pprof().unwrap();

let mut content = Vec::new();
profile.encode(&mut content).unwrap();
file.write_all(&content).unwrap();

println!("report: {:?}", report);
};
}
Original file line number Diff line number Diff line change
Expand Up @@ -104,9 +104,6 @@ fn main() {
let profile = report.pprof().unwrap();

let mut content = Vec::new();
#[cfg(not(feature = "protobuf-codec"))]
profile.encode(&mut content).unwrap();
#[cfg(feature = "protobuf-codec")]
profile.write_to_vec(&mut content).unwrap();
file.write_all(&content).unwrap();

Expand Down