-
Notifications
You must be signed in to change notification settings - Fork 66
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Detector: Function signature collision (#670)
Co-authored-by: Alex Roan <[email protected]>
- Loading branch information
1 parent
359ad8d
commit 9fcabc0
Showing
8 changed files
with
327 additions
and
12 deletions.
There are no files selected for viewing
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
117 changes: 117 additions & 0 deletions
117
aderyn_core/src/detect/high/function_selector_collision.rs
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,117 @@ | ||
| use std::collections::{BTreeMap, HashMap}; | ||
| use std::error::Error; | ||
|
|
||
| use crate::ast::NodeID; | ||
|
|
||
| use crate::capture; | ||
| use crate::detect::detector::IssueDetectorNamePool; | ||
| use crate::{ | ||
| context::workspace_context::WorkspaceContext, | ||
| detect::detector::{IssueDetector, IssueSeverity}, | ||
| }; | ||
| use eyre::Result; | ||
|
|
||
| #[derive(Default)] | ||
| pub struct FunctionSelectorCollisionDetector { | ||
| // Keys are: [0] source file name, [1] line number, [2] character location of node. | ||
| // Do not add items manually, use `capture!` to add nodes to this BTreeMap. | ||
| found_instances: BTreeMap<(String, usize, String), NodeID>, | ||
| } | ||
|
|
||
| impl IssueDetector for FunctionSelectorCollisionDetector { | ||
| fn detect(&mut self, context: &WorkspaceContext) -> Result<bool, Box<dyn Error>> { | ||
| // function_selector -> (function_name -> function_id) | ||
| let mut selectors: HashMap<String, HashMap<String, Vec<NodeID>>> = HashMap::new(); | ||
|
|
||
| // PLAN | ||
| // If we have > 1 function_name entries for any function_selector, then capture all the corresponding NodeIDs | ||
|
|
||
| for function in context.function_definitions() { | ||
| if let Some(selector) = function.function_selector.as_ref() { | ||
| let name = &function.name; | ||
| match selectors.entry(selector.clone()) { | ||
| std::collections::hash_map::Entry::Occupied(mut o) => { | ||
| match o.get_mut().entry(name.clone()) { | ||
| std::collections::hash_map::Entry::Occupied(mut o) => { | ||
| o.get_mut().push(function.id); | ||
| } | ||
| std::collections::hash_map::Entry::Vacant(v) => { | ||
| v.insert(vec![function.id]); | ||
| } | ||
| }; | ||
| } | ||
| std::collections::hash_map::Entry::Vacant(v) => { | ||
| let mut nested_entry = HashMap::new(); | ||
| nested_entry.insert(name.clone(), vec![function.id]); | ||
| v.insert(nested_entry); | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| for function_entries in selectors.values() { | ||
| if function_entries.len() >= 2 { | ||
| // Now we know that there is a collision + at least 2 different function names found for that selector. | ||
| for function_ids in function_entries.values() { | ||
| for function_id in function_ids { | ||
| if let Some(node) = context.nodes.get(function_id) { | ||
| capture!(self, context, node); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| Ok(!self.found_instances.is_empty()) | ||
| } | ||
|
|
||
| fn severity(&self) -> IssueSeverity { | ||
| IssueSeverity::High | ||
| } | ||
|
|
||
| fn title(&self) -> String { | ||
| String::from("Function selector collides with other functions") | ||
| } | ||
|
|
||
| fn description(&self) -> String { | ||
| String::from("Function selector collides with other functions. This may cause the solidity function dispatcher to invoke the wrong function if the functions happen to be included in the same contract through an inheritance hirearchy later down the line. It is recommended to rename this function or change its parameters.") | ||
| } | ||
|
|
||
| fn instances(&self) -> BTreeMap<(String, usize, String), NodeID> { | ||
| self.found_instances.clone() | ||
| } | ||
|
|
||
| fn name(&self) -> String { | ||
| format!("{}", IssueDetectorNamePool::FunctionSelectorCollision) | ||
| } | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod function_signature_collision { | ||
| use serial_test::serial; | ||
|
|
||
| use crate::detect::{ | ||
| detector::IssueDetector, | ||
| high::function_selector_collision::FunctionSelectorCollisionDetector, | ||
| }; | ||
|
|
||
| #[test] | ||
| #[serial] | ||
| fn test_function_signature_collision() { | ||
| let context = crate::detect::test_utils::load_solidity_source_unit( | ||
| "../tests/contract-playground/src/FunctionSignatureCollision.sol", | ||
| ); | ||
|
|
||
| let mut detector = FunctionSelectorCollisionDetector::default(); | ||
| let found = detector.detect(&context).unwrap(); | ||
| // assert that the detector found an issue | ||
| assert!(found); | ||
| // assert that the detector found the correct number of instances | ||
| assert_eq!(detector.instances().len(), 2); | ||
| // assert the severity is high | ||
| assert_eq!( | ||
| detector.severity(), | ||
| crate::detect::detector::IssueSeverity::High | ||
| ); | ||
| } | ||
| } |
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
Oops, something went wrong.