Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
C
cwe_checker
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
fact-depend
cwe_checker
Commits
41088680
Unverified
Commit
41088680
authored
Apr 27, 2021
by
Enkelmann
Committed by
GitHub
Apr 27, 2021
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
fix address size of implicit stores (#170)
parent
a7dccec4
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
101 additions
and
56 deletions
+101
-56
expressions.rs
src/cwe_checker_lib/src/pcode/expressions.rs
+43
-11
term.rs
src/cwe_checker_lib/src/pcode/term.rs
+52
-39
tests.rs
src/cwe_checker_lib/src/pcode/term/tests.rs
+6
-6
No files found.
src/cwe_checker_lib/src/pcode/expressions.rs
View file @
41088680
...
...
@@ -41,17 +41,17 @@ impl From<Variable> for IrExpression {
fn
from
(
pcode_var
:
Variable
)
->
IrExpression
{
match
(
&
pcode_var
.name
,
&
pcode_var
.value
)
{
(
Some
(
_name
),
None
)
=>
IrExpression
::
Var
(
pcode_var
.into
()),
(
None
,
Some
(
_hex_value
))
=>
IrExpression
::
Const
(
pcode_var
.parse_to_bitvector
()),
(
None
,
Some
(
_hex_value
))
=>
IrExpression
::
Const
(
pcode_var
.parse_
const_
to_bitvector
()),
_
=>
panic!
(
"Conversion failed:
\n
{:?}"
,
pcode_var
),
}
}
}
impl
Variable
{
/// Parses a variable representing a concrete value
or a concrete address to a bitvector containing the value or address
.
pub
fn
parse_to_bitvector
(
&
self
)
->
Bitvector
{
match
(
&
self
.value
,
&
self
.address
)
{
(
Some
(
hex_value
),
None
)
|
(
None
,
Some
(
hex_value
)
)
=>
{
/// Parses a variable representing a concrete value
to a bitvector containing the value
.
pub
fn
parse_
const_
to_bitvector
(
&
self
)
->
Bitvector
{
match
&
self
.value
{
Some
(
hex_value
)
=>
{
let
mut
bitvector
=
Bitvector
::
from_str_radix
(
16
,
hex_value
)
.unwrap
();
match
bitvector
.width
()
.cmp
(
&
self
.size
.into
())
{
std
::
cmp
::
Ordering
::
Greater
=>
bitvector
.truncate
(
self
.size
)
.unwrap
(),
...
...
@@ -64,6 +64,26 @@ impl Variable {
}
}
/// Parses a variable representing an address to a pointer-sized bitvector containing the address.
pub
fn
parse_address_to_bitvector
(
&
self
,
generic_pointer_size
:
ByteSize
)
->
Bitvector
{
match
&
self
.address
{
Some
(
hex_value
)
=>
{
let
mut
bitvector
=
Bitvector
::
from_str_radix
(
16
,
hex_value
)
.unwrap
();
match
bitvector
.width
()
.cmp
(
&
generic_pointer_size
.into
())
{
std
::
cmp
::
Ordering
::
Greater
=>
{
bitvector
.truncate
(
generic_pointer_size
)
.unwrap
()
}
std
::
cmp
::
Ordering
::
Less
=>
{
bitvector
.zero_extend
(
generic_pointer_size
)
.unwrap
()
}
std
::
cmp
::
Ordering
::
Equal
=>
(),
}
bitvector
}
_
=>
panic!
(),
}
}
/// Generate a virtual variable with the given name and size.
pub
fn
new_virtual
(
name
:
impl
Into
<
String
>
,
size
:
ByteSize
)
->
Variable
{
Variable
{
...
...
@@ -415,24 +435,36 @@ mod tests {
size
:
ByteSize
::
new
(
8
),
is_virtual
:
false
,
};
assert_eq!
(
var
.parse_to_bitvector
(),
Bitvector
::
from_u64
(
0
));
assert_eq!
(
var
.parse_
const_
to_bitvector
(),
Bitvector
::
from_u64
(
0
));
var
.value
=
Some
(
"0010f"
.to_string
());
assert_eq!
(
var
.parse_to_bitvector
(),
Bitvector
::
from_u64
(
271
));
assert_eq!
(
var
.parse_
const_
to_bitvector
(),
Bitvector
::
from_u64
(
271
));
var
.value
=
Some
(
"1ff"
.to_string
());
var
.size
=
ByteSize
::
new
(
1
);
assert_eq!
(
var
.parse_to_bitvector
(),
Bitvector
::
from_u8
(
255
));
assert_eq!
(
var
.parse_
const_
to_bitvector
(),
Bitvector
::
from_u8
(
255
));
var
.size
=
ByteSize
::
new
(
16
);
assert_eq!
(
var
.parse_to_bitvector
(),
Bitvector
::
from_u128
(
511
));
assert_eq!
(
var
.parse_
const_
to_bitvector
(),
Bitvector
::
from_u128
(
511
));
var
.value
=
Some
(
"00_ffffffffffffffff_ffffffffffffffff"
.to_string
());
var
.size
=
ByteSize
::
new
(
16
);
assert_eq!
(
var
.parse_to_bitvector
(),
Bitvector
::
from_i128
(
-
1
));
assert_eq!
(
var
.parse_
const_
to_bitvector
(),
Bitvector
::
from_i128
(
-
1
));
var
.size
=
ByteSize
::
new
(
10
);
assert_eq!
(
var
.parse_to_bitvector
(),
var
.parse_
const_
to_bitvector
(),
Bitvector
::
from_i128
(
-
1
)
.into_truncate
(
ByteSize
::
new
(
10
))
.unwrap
()
);
let
var
=
Variable
{
name
:
None
,
value
:
None
,
address
:
Some
(
"000010f"
.to_string
()),
size
:
ByteSize
::
new
(
1
),
// Note that this size is not the size of a pointer!
is_virtual
:
false
,
};
assert_eq!
(
var
.parse_address_to_bitvector
(
ByteSize
::
new
(
8
)),
Bitvector
::
from_u64
(
271
)
);
}
}
src/cwe_checker_lib/src/pcode/term.rs
View file @
41088680
...
...
@@ -134,46 +134,48 @@ pub struct Def {
pub
rhs
:
Expression
,
}
impl
From
<
Def
>
for
Ir
Def
{
impl
Def
{
/// Convert a P-Code instruction to the internally used IR.
fn
from
(
def
:
Def
)
->
IrDef
{
pub
fn
into_ir_def
(
self
,
generic_pointer_size
:
ByteSize
)
->
IrDef
{
use
super
::
ExpressionType
::
*
;
match
de
f
.rhs.mnemonic
{
match
sel
f
.rhs.mnemonic
{
LOAD
=>
IrDef
::
Load
{
var
:
de
f
.lhs
.unwrap
()
.into
(),
address
:
de
f
.rhs.input1
.unwrap
()
.into
(),
var
:
sel
f
.lhs
.unwrap
()
.into
(),
address
:
sel
f
.rhs.input1
.unwrap
()
.into
(),
},
STORE
=>
IrDef
::
Store
{
address
:
de
f
.rhs.input1
.unwrap
()
.into
(),
value
:
de
f
.rhs.input2
.unwrap
()
.into
(),
address
:
sel
f
.rhs.input1
.unwrap
()
.into
(),
value
:
sel
f
.rhs.input2
.unwrap
()
.into
(),
},
SUBPIECE
=>
IrDef
::
Assign
{
var
:
de
f
.lhs
.clone
()
.unwrap
()
.into
(),
var
:
sel
f
.lhs
.clone
()
.unwrap
()
.into
(),
value
:
IrExpression
::
Subpiece
{
low_byte
:
de
f
.rhs.input1
.unwrap
()
.parse_to_bytesize
(),
size
:
de
f
.lhs
.unwrap
()
.size
,
arg
:
Box
::
new
(
de
f
.rhs.input0
.unwrap
()
.into
()),
low_byte
:
sel
f
.rhs.input1
.unwrap
()
.parse_to_bytesize
(),
size
:
sel
f
.lhs
.unwrap
()
.size
,
arg
:
Box
::
new
(
sel
f
.rhs.input0
.unwrap
()
.into
()),
},
},
INT_ZEXT
|
INT_SEXT
|
INT2FLOAT
|
FLOAT2FLOAT
|
TRUNC
|
POPCOUNT
=>
IrDef
::
Assign
{
var
:
de
f
.lhs
.clone
()
.unwrap
()
.into
(),
var
:
sel
f
.lhs
.clone
()
.unwrap
()
.into
(),
value
:
IrExpression
::
Cast
{
op
:
de
f
.rhs.mnemonic
.into
(),
size
:
de
f
.lhs
.unwrap
()
.size
,
arg
:
Box
::
new
(
de
f
.rhs.input0
.unwrap
()
.into
()),
op
:
sel
f
.rhs.mnemonic
.into
(),
size
:
sel
f
.lhs
.unwrap
()
.size
,
arg
:
Box
::
new
(
sel
f
.rhs.input0
.unwrap
()
.into
()),
},
},
_
=>
{
let
target_var
=
de
f
.lhs
.unwrap
();
let
target_var
=
sel
f
.lhs
.unwrap
();
if
target_var
.address
.is_some
()
{
IrDef
::
Store
{
address
:
IrExpression
::
Const
(
target_var
.parse_to_bitvector
()),
value
:
def
.rhs
.into
(),
address
:
IrExpression
::
Const
(
target_var
.parse_address_to_bitvector
(
generic_pointer_size
),
),
value
:
self
.rhs
.into
(),
}
}
else
{
IrDef
::
Assign
{
var
:
target_var
.into
(),
value
:
de
f
.rhs
.into
(),
value
:
sel
f
.rhs
.into
(),
}
}
}
...
...
@@ -190,23 +192,23 @@ pub struct Blk {
pub
jmps
:
Vec
<
Term
<
Jmp
>>
,
}
impl
From
<
Blk
>
for
Ir
Blk
{
impl
Blk
{
/// Convert a P-Code block to the internally used IR.
fn
from
(
blk
:
Blk
)
->
IrBlk
{
let
defs
:
Vec
<
Term
<
IrDef
>>
=
blk
pub
fn
into_ir_blk
(
self
,
generic_pointer_size
:
ByteSize
)
->
IrBlk
{
let
defs
:
Vec
<
Term
<
IrDef
>>
=
self
.defs
.into_iter
()
.map
(|
def_term
|
Term
{
tid
:
def_term
.tid
,
term
:
def_term
.term
.into
(
),
term
:
def_term
.term
.into
_ir_def
(
generic_pointer_size
),
})
.collect
();
let
indirect_jmp_targets
=
blk
let
indirect_jmp_targets
=
self
.jmps
.iter
()
.find_map
(|
jmp_term
|
jmp_term
.term.target_hints
.clone
())
.unwrap_or_default
();
let
jmps
:
Vec
<
Term
<
IrJmp
>>
=
blk
let
jmps
:
Vec
<
Term
<
IrJmp
>>
=
self
.jmps
.into_iter
()
.map
(|
jmp_term
|
Term
{
...
...
@@ -327,42 +329,42 @@ pub struct Sub {
pub
blocks
:
Vec
<
Term
<
Blk
>>
,
}
impl
From
<
Term
<
Sub
>>
for
Term
<
Ir
Sub
>
{
impl
Term
<
Sub
>
{
/// Convert a `Sub` term in the P-Code representation to a `Sub` term in the intermediate representation.
/// The conversion also repairs the order of the basic blocks in the `blocks` array of the `Sub`
/// in the sense that the first block of the array is required to also be the function entry point
/// after the conversion.
fn
from
(
mut
sub
:
Term
<
Sub
>
)
->
Term
<
IrSub
>
{
pub
fn
into_ir_sub_term
(
mut
self
,
generic_pointer_size
:
ByteSize
)
->
Term
<
IrSub
>
{
// Since the intermediate representation expects that the first block of a function is its entry point,
// we have to make sure that this actually holds.
if
!
s
ub
.term.blocks
.is_empty
()
&&
sub
.tid.address
!=
sub
.term.blocks
[
0
]
.tid.address
{
if
!
s
elf
.term.blocks
.is_empty
()
&&
self
.tid.address
!=
self
.term.blocks
[
0
]
.tid.address
{
let
mut
start_block_index
=
None
;
for
(
i
,
block
)
in
s
ub
.term.blocks
.iter
()
.enumerate
()
{
if
block
.tid.address
==
s
ub
.tid.address
{
for
(
i
,
block
)
in
s
elf
.term.blocks
.iter
()
.enumerate
()
{
if
block
.tid.address
==
s
elf
.tid.address
{
start_block_index
=
Some
(
i
);
break
;
}
}
if
let
Some
(
start_block_index
)
=
start_block_index
{
s
ub
.term.blocks
.swap
(
0
,
start_block_index
);
s
elf
.term.blocks
.swap
(
0
,
start_block_index
);
}
else
{
panic!
(
"Non-empty function without correct starting block encountered. Name: {}, TID: {}"
,
s
ub
.term.name
,
sub
.tid
);
panic!
(
"Non-empty function without correct starting block encountered. Name: {}, TID: {}"
,
s
elf
.term.name
,
self
.tid
);
}
}
let
blocks
=
s
ub
let
blocks
=
s
elf
.term
.blocks
.into_iter
()
.map
(|
block_term
|
Term
{
tid
:
block_term
.tid
,
term
:
block_term
.term
.into
(
),
term
:
block_term
.term
.into
_ir_blk
(
generic_pointer_size
),
})
.collect
();
Term
{
tid
:
s
ub
.tid
,
tid
:
s
elf
.tid
,
term
:
IrSub
{
name
:
s
ub
.term.name
,
name
:
s
elf
.term.name
,
blocks
,
},
}
...
...
@@ -457,8 +459,16 @@ impl Program {
/// It is needed to detect whether Ghidra added a constant offset to all addresses of the memory address.
/// E.g. if the `binary_base_address` is 0 for shared object files,
/// Ghidra adds an offset so that the memory image does not actually start at address 0.
pub
fn
into_ir_program
(
self
,
binary_base_address
:
u64
)
->
IrProgram
{
let
subs
=
self
.subs
.into_iter
()
.map
(|
sub
|
sub
.into
())
.collect
();
pub
fn
into_ir_program
(
self
,
binary_base_address
:
u64
,
generic_pointer_size
:
ByteSize
,
)
->
IrProgram
{
let
subs
=
self
.subs
.into_iter
()
.map
(|
sub
|
sub
.into_ir_sub_term
(
generic_pointer_size
))
.collect
();
let
extern_symbols
=
self
.extern_symbols
.into_iter
()
...
...
@@ -525,7 +535,10 @@ impl Project {
pub
fn
into_ir_project
(
self
,
binary_base_address
:
u64
)
->
IrProject
{
let
mut
program
:
Term
<
IrProgram
>
=
Term
{
tid
:
self
.program.tid
,
term
:
self
.program.term
.into_ir_program
(
binary_base_address
),
term
:
self
.program
.term
.into_ir_program
(
binary_base_address
,
self
.stack_pointer_register.size
),
};
let
register_map
:
HashMap
<&
String
,
&
RegisterProperties
>
=
self
.register_properties
...
...
src/cwe_checker_lib/src/pcode/term/tests.rs
View file @
41088680
...
...
@@ -396,7 +396,7 @@ fn def_deserialization() {
"
#
,
)
.unwrap
();
let
_
:
IrDef
=
def
.into
(
);
let
_
:
IrDef
=
def
.into
_ir_def
(
ByteSize
::
new
(
8
)
);
let
def
:
Def
=
serde_json
::
from_str
(
r
#
"
{
...
...
@@ -422,7 +422,7 @@ fn def_deserialization() {
"
#
,
)
.unwrap
();
let
_
:
IrDef
=
def
.into
(
);
let
_
:
IrDef
=
def
.into
_ir_def
(
ByteSize
::
new
(
8
)
);
}
#[test]
...
...
@@ -463,7 +463,7 @@ fn jmp_deserialization() {
fn
blk_deserialization
()
{
let
setup
=
Setup
::
new
();
let
block_term
:
Term
<
Blk
>
=
setup
.blk_t
.clone
();
let
_
:
IrBlk
=
block_term
.term
.into
(
);
let
_
:
IrBlk
=
block_term
.term
.into
_ir_blk
(
ByteSize
::
new
(
8
)
);
}
#[test]
...
...
@@ -503,7 +503,7 @@ fn arg_deserialization() {
fn
sub_deserialization
()
{
let
setup
=
Setup
::
new
();
let
sub_term
:
Term
<
Sub
>
=
setup
.sub_t
.clone
();
let
_
:
Term
<
IrSub
>
=
sub_term
.into
(
);
let
_
:
Term
<
IrSub
>
=
sub_term
.into
_ir_sub_term
(
ByteSize
::
new
(
8
)
);
let
sub_term
:
Term
<
Sub
>
=
serde_json
::
from_str
(
r
#
"
{
...
...
@@ -542,7 +542,7 @@ fn sub_deserialization() {
.unwrap
();
// Example has special case where the starting block has to be corrected
assert
!
(
sub_term
.tid.address
!=
sub_term
.term.blocks
[
0
]
.tid.address
);
let
ir_sub
:
Term
<
IrSub
>
=
sub_term
.into
(
);
let
ir_sub
:
Term
<
IrSub
>
=
sub_term
.into
_ir_sub_term
(
ByteSize
::
new
(
8
)
);
assert_eq!
(
ir_sub
.tid.address
,
ir_sub
.term.blocks
[
0
]
.tid.address
);
}
...
...
@@ -608,7 +608,7 @@ fn program_deserialization() {
"
#
,
)
.unwrap
();
let
_
:
IrProgram
=
program_term
.term
.into_ir_program
(
10000
);
let
_
:
IrProgram
=
program_term
.term
.into_ir_program
(
10000
,
ByteSize
::
new
(
8
)
);
}
#[test]
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment