Compare commits
3 commits
f1b84f1fbe
...
4d6187ac21
Author | SHA1 | Date | |
---|---|---|---|
Théophile Bastian | 4d6187ac21 | ||
Théophile Bastian | ec75b2fc92 | ||
Théophile Bastian | 3b2cad0dc4 |
|
@ -176,6 +176,59 @@ let build_next_instr sub_ranges (disasm: BStd.disasm): AddrSet.t AddrMap.t =
|
|||
)
|
||||
in
|
||||
|
||||
let block_following_set block sub_first_addr sub_last_addr last_addr =
|
||||
(** Set of addresses that are successors of this block
|
||||
|
||||
This set is the set of the addresses of blocks pointed by an output
|
||||
edge of this block. We filter this set so that it only contains
|
||||
addresses inside the subroutine, and take care of keeping only the
|
||||
return edge of calls.
|
||||
*)
|
||||
|
||||
let blk_outputs =
|
||||
BStd.Graphs.Cfg.Node.outputs block cfg
|
||||
|> BStd.Seq.fold
|
||||
~init:AddrSet.empty
|
||||
~f:(fun set edge -> AddrSet.union
|
||||
(block_addresses
|
||||
(BStd.Graphs.Cfg.Edge.dst edge))
|
||||
set)
|
||||
|> AddrSet.filter (fun addr ->
|
||||
sub_first_addr <= addr
|
||||
&& addr <= sub_last_addr)
|
||||
(* ^ We must ensure the landing address belongs to the current
|
||||
subroutine for our purpose *)
|
||||
in
|
||||
|
||||
let terminator = BStd.Block.terminator block in
|
||||
(* `terminator` is the only jump-ish instruction in `block` *)
|
||||
|
||||
(match BStd.Insn.is BStd.Insn.call terminator with
|
||||
| true ->
|
||||
(* `terminator` is a call: we mustn't include the callee as a successor
|
||||
of this block. *)
|
||||
|
||||
(* Only one output: the one that is closest to `last_addr`, forwards. *)
|
||||
|
||||
(match AddrSet.find_first_opt
|
||||
(fun x -> Int64.(last_addr < x)) blk_outputs with
|
||||
| Some ret_addr ->
|
||||
let delta = Int64.sub ret_addr last_addr |> Int64.to_int in
|
||||
if delta >= 32 then
|
||||
assert false (* FIXME maybe no return *)
|
||||
else (
|
||||
(AddrSet.singleton ret_addr)
|
||||
)
|
||||
| None -> AddrSet.empty (* assume no return *)
|
||||
)
|
||||
|
||||
| false ->
|
||||
(* `terminator` is not a call, all this block's outputs are correct
|
||||
successors *)
|
||||
blk_outputs
|
||||
)
|
||||
in
|
||||
|
||||
let build_of_block cur_map block =
|
||||
(try
|
||||
(* First, check that this block belongs to a subroutine *)
|
||||
|
@ -197,19 +250,8 @@ let build_next_instr sub_ranges (disasm: BStd.disasm): AddrSet.t AddrMap.t =
|
|||
(* Then the set of possible destinations for the block terminator *)
|
||||
(match last_addr with
|
||||
| Some last_addr ->
|
||||
let following_set = BStd.Graphs.Cfg.Node.outputs block cfg
|
||||
|> BStd.Seq.fold
|
||||
~init:AddrSet.empty
|
||||
~f:(fun set edge -> AddrSet.union
|
||||
(block_addresses
|
||||
(BStd.Graphs.Cfg.Edge.dst edge))
|
||||
set)
|
||||
|> AddrSet.filter (fun addr ->
|
||||
sub_first_addr <= addr
|
||||
&& addr <= sub_last_addr)
|
||||
(* ^ We must ensure the landing address belongs
|
||||
to the current subroutine for our purpose *)
|
||||
in
|
||||
let following_set = block_following_set
|
||||
block sub_first_addr sub_last_addr last_addr in
|
||||
AddrMap.add last_addr following_set cur_map
|
||||
| None -> cur_map
|
||||
)
|
||||
|
@ -524,7 +566,13 @@ let process_jmp jmp (cur_reg: reg_pos)
|
|||
in
|
||||
|
||||
match (BStd.Jmp.kind jmp) with
|
||||
| BStd.Call call -> gen_change (-8)
|
||||
| BStd.Call call -> (
|
||||
(* If this call never returns (tail call), do not generate an offset of
|
||||
-8. *)
|
||||
match BStd.Call.return call with
|
||||
| Some _ -> gen_change (-8)
|
||||
| None -> None
|
||||
)
|
||||
| BStd.Ret ret -> gen_change (8)
|
||||
| _ -> None
|
||||
|
||||
|
@ -581,7 +629,7 @@ let process_blk
|
|||
exception Inconsistent of BStd.tid
|
||||
|
||||
let get_entry_blk graph =
|
||||
let entry = BStd.Seq.min_elt (CFG.nodes graph) ~compare:(fun x y ->
|
||||
let entry = BStd.Seq.min_elt (CFG.nodes graph) ~cmp:(fun x y ->
|
||||
let ax = opt_addr_of @@ CFG.Node.label x
|
||||
and ay = opt_addr_of @@ CFG.Node.label y in
|
||||
match ax, ay with
|
||||
|
|
Loading…
Reference in a new issue