diff options
| author | xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e> | 2009-08-16 15:35:09 +0000 |
|---|---|---|
| committer | xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e> | 2009-08-16 15:35:09 +0000 |
| commit | 4b119d6f9f0e846edccaf5c08788ca1615b22526 (patch) | |
| tree | 66cf55decd8d950d0bdc1050448aa3ee448ca13a /backend/Linearizeaux.ml | |
| parent | 1fe28ba1ec3dd0657b121c4a911ee1cb046bab09 (diff) | |
| download | compcert-kvx-4b119d6f9f0e846edccaf5c08788ca1615b22526.tar.gz compcert-kvx-4b119d6f9f0e846edccaf5c08788ca1615b22526.zip | |
Cil2Csyntax: added goto and labels; added assignment between structs
Kildall: simplified the interface
Constprop, CSE, Allocation, Linearize: updated for the new Kildall
RTL, LTL: removed the well-formedness condition on the CFG,
it is no longer necessary with the new Kildall and it is problematic
for validated optimizations.
Maps: more efficient implementation of PTree.fold.
git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1124 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e
Diffstat (limited to 'backend/Linearizeaux.ml')
| -rw-r--r-- | backend/Linearizeaux.ml | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/backend/Linearizeaux.ml b/backend/Linearizeaux.ml index 239e2a6d..b2738605 100644 --- a/backend/Linearizeaux.ml +++ b/backend/Linearizeaux.ml @@ -50,6 +50,7 @@ module IntSet = Set.Make(struct type t = int let compare = compare end) (* Determine join points: reachable nodes that have > 1 predecessor *) let join_points f = + let succs = LTL.successors f in let reached = ref IntSet.empty in let reached_twice = ref IntSet.empty in let rec traverse pc = @@ -59,7 +60,7 @@ let join_points f = reached_twice := IntSet.add npc !reached_twice end else begin reached := IntSet.add npc !reached; - List.iter traverse (LTL.successors f pc) + List.iter traverse (Kildall.successors_list succs pc) end in traverse f.fn_entrypoint; !reached_twice |