Ekdohibs
/
ocaml
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Suppression de l'allocation dans la zone Incoming. Ce code semble ineffectif et potentiellement incorrect vis-a-vis du GC 

git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@6592 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02
master
Xavier Leroy 2004-08-12 13:34:42 +00:00
parent e2df31285a
commit 6e982319a2
1 changed files with 44 additions and 65 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

109
asmcomp/coloring.ml
View File

@ -208,77 +208,56 @@ let assign_location reg =
start_register.(cl) <- (if start+1 >= num_regs then 0 else start+1)
end else begin
(* Sorry, we must put the pseudoreg in a stack location *)
(* First, check if we have a preference for an incoming location
we do not conflict with. *)
let best_score = ref 0 and best_incoming_loc = ref (-1) in
let nslots = Proc.num_stack_slots.(cl) in
let score = Array.create nslots 0 in
(* Compute the scores as for registers *)
List.iter
(fun (r, w) ->
match r.loc with
Stack(Incoming n) ->
if w > !best_score
&& List.for_all (fun neighbour -> neighbour.loc <> r.loc)
reg.interf
then begin
best_score := w;
best_incoming_loc := n
end
Stack(Local n) -> if Proc.register_class r = cl then
score.(n) <- score.(n) + w
| Unknown ->
List.iter
(fun neighbour ->
match neighbour.loc with
Stack(Local n) ->
if Proc.register_class neighbour = cl
then score.(n) <- score.(n) - w
| _ -> ())
r.interf
| _ -> ())
reg.prefer;
if !best_incoming_loc >= 0 then
reg.loc <- Stack(Incoming !best_incoming_loc)
else begin
(* Now, look for a location in the local area *)
let nslots = Proc.num_stack_slots.(cl) in
let score = Array.create nslots 0 in
(* Compute the scores as for registers *)
List.iter
(fun (r, w) ->
match r.loc with
Stack(Local n) -> if Proc.register_class r = cl then
score.(n) <- score.(n) + w
| Unknown ->
List.iter
(fun neighbour ->
match neighbour.loc with
Stack(Local n) ->
if Proc.register_class neighbour = cl
then score.(n) <- score.(n) - w
| _ -> ())
r.interf
| _ -> ())
reg.prefer;
List.iter
(fun neighbour ->
begin match neighbour.loc with
Stack(Local n) ->
if Proc.register_class neighbour = cl then
score.(n) <- (-1000000)
| _ -> ()
end;
List.iter
(fun (r, w) ->
match r.loc with
Stack(Local n) -> if Proc.register_class r = cl then
score.(n) <- score.(n) - w
| _ -> ())
neighbour.prefer)
reg.interf;
(* Pick the location with the best score *)
let best_score = ref (-1000000) and best_slot = ref (-1) in
for n = 0 to nslots - 1 do
if score.(n) > !best_score then begin
best_score := score.(n);
best_slot := n
end
done;
(* Found one? *)
if !best_slot >= 0 then
reg.loc <- Stack(Local !best_slot)
else begin
(* Allocate a new stack slot *)
reg.loc <- Stack(Local nslots);
Proc.num_stack_slots.(cl) <- nslots + 1
List.iter
(fun neighbour ->
begin match neighbour.loc with
Stack(Local n) ->
if Proc.register_class neighbour = cl then
score.(n) <- (-1000000)
| _ -> ()
end;
List.iter
(fun (r, w) ->
match r.loc with
Stack(Local n) -> if Proc.register_class r = cl then
score.(n) <- score.(n) - w
| _ -> ())
neighbour.prefer)
reg.interf;
(* Pick the location with the best score *)
let best_score = ref (-1000000) and best_slot = ref (-1) in
for n = 0 to nslots - 1 do
if score.(n) > !best_score then begin
best_score := score.(n);
best_slot := n
end
done;
(* Found one? *)
if !best_slot >= 0 then
reg.loc <- Stack(Local !best_slot)
else begin
(* Allocate a new stack slot *)
reg.loc <- Stack(Local nslots);
Proc.num_stack_slots.(cl) <- nslots + 1
end
end;
(* Cancel the preferences of this register so that they don't influence