This repository has been archived by the owner on Nov 15, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2.6k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Decommit instance memory after a runtime call on Linux (#8998)
* Decommit instance memory after a runtime call on Linux * Update documentation for the test * Remove unfinished comment * Use saturating_sub. Also update the doc comment. * Precise RSS tracking in the test Instead of tracking RSS for the whole process we just look at the particular mapping that is associated with the linear memory of the runtime instance * Remove unused import * Fix unused imports * Fix the unused imports error for good * Rollback an accidental change to benches * Fix the test * Remove now unneeded code
- Loading branch information
Showing
10 changed files
with
260 additions
and
1 deletion.
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,73 @@ | ||
// This file is part of Substrate. | ||
|
||
// Copyright (C) 2021 Parity Technologies (UK) Ltd. | ||
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0 | ||
|
||
// This program is free software: you can redistribute it and/or modify | ||
// it under the terms of the GNU General Public License as published by | ||
// the Free Software Foundation, either version 3 of the License, or | ||
// (at your option) any later version. | ||
|
||
// This program is distributed in the hope that it will be useful, | ||
// but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
// GNU General Public License for more details. | ||
|
||
// You should have received a copy of the GNU General Public License | ||
// along with this program. If not, see <https://www.gnu.org/licenses/>. | ||
|
||
//! Tests that are only relevant for Linux. | ||
// Constrain this only to wasmtime for the time being. Without this rustc will complain on unused | ||
// imports and items. The alternative is to plop `cfg(feature = wasmtime)` everywhere which seems | ||
// borthersome. | ||
#![cfg(feature = "wasmtime")] | ||
|
||
use crate::WasmExecutionMethod; | ||
use super::mk_test_runtime; | ||
use codec::Encode as _; | ||
|
||
mod smaps; | ||
|
||
use self::smaps::Smaps; | ||
|
||
#[test] | ||
fn memory_consumption_compiled() { | ||
// This aims to see if linear memory stays backed by the physical memory after a runtime call. | ||
// | ||
// For that we make a series of runtime calls, probing the RSS for the VMA matching the linear | ||
// memory. After the call we expect RSS to be equal to 0. | ||
|
||
let runtime = mk_test_runtime(WasmExecutionMethod::Compiled, 1024); | ||
|
||
let instance = runtime.new_instance().unwrap(); | ||
let heap_base = instance | ||
.get_global_const("__heap_base") | ||
.expect("`__heap_base` is valid") | ||
.expect("`__heap_base` exists") | ||
.as_i32() | ||
.expect("`__heap_base` is an `i32`"); | ||
|
||
fn probe_rss(instance: &dyn sc_executor_common::wasm_runtime::WasmInstance) -> usize { | ||
let base_addr = instance.linear_memory_base_ptr().unwrap() as usize; | ||
Smaps::new().get_rss(base_addr).expect("failed to get rss") | ||
} | ||
|
||
instance | ||
.call_export( | ||
"test_dirty_plenty_memory", | ||
&(heap_base as u32, 1u32).encode(), | ||
) | ||
.unwrap(); | ||
let probe_1 = probe_rss(&*instance); | ||
instance | ||
.call_export( | ||
"test_dirty_plenty_memory", | ||
&(heap_base as u32, 1024u32).encode(), | ||
) | ||
.unwrap(); | ||
let probe_2 = probe_rss(&*instance); | ||
|
||
assert_eq!(probe_1, 0); | ||
assert_eq!(probe_2, 0); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,82 @@ | ||
// This file is part of Substrate. | ||
|
||
// Copyright (C) 2017-2021 Parity Technologies (UK) Ltd. | ||
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0 | ||
|
||
// This program is free software: you can redistribute it and/or modify | ||
// it under the terms of the GNU General Public License as published by | ||
// the Free Software Foundation, either version 3 of the License, or | ||
// (at your option) any later version. | ||
|
||
// This program is distributed in the hope that it will be useful, | ||
// but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
// GNU General Public License for more details. | ||
|
||
// You should have received a copy of the GNU General Public License | ||
// along with this program. If not, see <https://www.gnu.org/licenses/>. | ||
|
||
//! A tool for extracting information about the memory consumption of the current process from | ||
//! the procfs. | ||
use std::ops::Range; | ||
use std::collections::BTreeMap; | ||
|
||
/// An interface to the /proc/self/smaps | ||
/// | ||
/// See docs about [procfs on kernel.org][procfs] | ||
/// | ||
/// [procfs]: https://www.kernel.org/doc/html/latest/filesystems/proc.html | ||
pub struct Smaps(Vec<(Range<usize>, BTreeMap<String, usize>)>); | ||
|
||
impl Smaps { | ||
pub fn new() -> Self { | ||
let regex_start = regex::RegexBuilder::new("^([0-9a-f]+)-([0-9a-f]+)") | ||
.multi_line(true) | ||
.build() | ||
.unwrap(); | ||
let regex_kv = regex::RegexBuilder::new(r#"^([^:]+):\s*(\d+) kB"#) | ||
.multi_line(true) | ||
.build() | ||
.unwrap(); | ||
let smaps = std::fs::read_to_string("/proc/self/smaps").unwrap(); | ||
let boundaries: Vec<_> = regex_start | ||
.find_iter(&smaps) | ||
.map(|matched| matched.start()) | ||
.chain(std::iter::once(smaps.len())) | ||
.collect(); | ||
|
||
let mut output = Vec::new(); | ||
for window in boundaries.windows(2) { | ||
let chunk = &smaps[window[0]..window[1]]; | ||
let caps = regex_start.captures(chunk).unwrap(); | ||
let start = usize::from_str_radix(caps.get(1).unwrap().as_str(), 16).unwrap(); | ||
let end = usize::from_str_radix(caps.get(2).unwrap().as_str(), 16).unwrap(); | ||
|
||
let values = regex_kv | ||
.captures_iter(chunk) | ||
.map(|cap| { | ||
let key = cap.get(1).unwrap().as_str().to_owned(); | ||
let value = cap.get(2).unwrap().as_str().parse().unwrap(); | ||
(key, value) | ||
}) | ||
.collect(); | ||
|
||
output.push((start..end, values)); | ||
} | ||
|
||
Self(output) | ||
} | ||
|
||
fn get_map(&self, addr: usize) -> &BTreeMap<String, usize> { | ||
&self.0 | ||
.iter() | ||
.find(|(range, _)| addr >= range.start && addr < range.end) | ||
.unwrap() | ||
.1 | ||
} | ||
|
||
pub fn get_rss(&self, addr: usize) -> Option<usize> { | ||
self.get_map(addr).get("Rss").cloned() | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters