1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431
|
(* buildFlowgraph.sml
*
* COPYRIGHT (c) 2001 Bell Labs, Lucent Technologies
*)
signature CONTROL_FLOWGRAPH_GEN =
sig
structure S : INSTRUCTION_STREAM
structure I : INSTRUCTIONS
structure P : PSEUDO_OPS
structure CFG : CONTROL_FLOW_GRAPH (* where I = I and P = P *)
where type I.addressing_mode = I.addressing_mode
and type I.ea = I.ea
and type I.instr = I.instr
and type I.instruction = I.instruction
and type I.operand = I.operand
where type P.Client.pseudo_op = P.Client.pseudo_op
and type P.T.Basis.cond = P.T.Basis.cond
and type P.T.Basis.div_rounding_mode = P.T.Basis.div_rounding_mode
and type P.T.Basis.ext = P.T.Basis.ext
and type P.T.Basis.fcond = P.T.Basis.fcond
and type P.T.Basis.rounding_mode = P.T.Basis.rounding_mode
and type P.T.Constant.const = P.T.Constant.const
and type ('s,'r,'f,'c) P.T.Extension.ccx = ('s,'r,'f,'c) P.T.Extension.ccx
and type ('s,'r,'f,'c) P.T.Extension.fx = ('s,'r,'f,'c) P.T.Extension.fx
and type ('s,'r,'f,'c) P.T.Extension.rx = ('s,'r,'f,'c) P.T.Extension.rx
and type ('s,'r,'f,'c) P.T.Extension.sx = ('s,'r,'f,'c) P.T.Extension.sx
and type P.T.I.div_rounding_mode = P.T.I.div_rounding_mode
and type P.T.Region.region = P.T.Region.region
and type P.T.ccexp = P.T.ccexp
and type P.T.fexp = P.T.fexp
(* and type P.T.labexp = P.T.labexp *)
and type P.T.mlrisc = P.T.mlrisc
and type P.T.oper = P.T.oper
and type P.T.rep = P.T.rep
and type P.T.rexp = P.T.rexp
and type P.T.stm = P.T.stm
(*
* This creates an emitter which can be used to build a CFG incrementally
*)
type instrStream =
(I.instruction, Annotations.annotations, I.C.cellset, CFG.cfg) S.stream
val build : unit -> instrStream
end
functor BuildFlowgraph
(structure Props : INSN_PROPERTIES
structure Stream : INSTRUCTION_STREAM
structure CFG : CONTROL_FLOW_GRAPH (* where I = Props.I and P = Stream.P *)
where type I.addressing_mode = Props.I.addressing_mode
and type I.ea = Props.I.ea
and type I.instr = Props.I.instr
and type I.instruction = Props.I.instruction
and type I.operand = Props.I.operand
where type P.Client.pseudo_op = Stream.P.Client.pseudo_op
and type P.T.Basis.cond = Stream.P.T.Basis.cond
and type P.T.Basis.div_rounding_mode = Stream.P.T.Basis.div_rounding_mode
and type P.T.Basis.ext = Stream.P.T.Basis.ext
and type P.T.Basis.fcond = Stream.P.T.Basis.fcond
and type P.T.Basis.rounding_mode = Stream.P.T.Basis.rounding_mode
and type P.T.Constant.const = Stream.P.T.Constant.const
and type ('s,'r,'f,'c) P.T.Extension.ccx = ('s,'r,'f,'c) Stream.P.T.Extension.ccx
and type ('s,'r,'f,'c) P.T.Extension.fx = ('s,'r,'f,'c) Stream.P.T.Extension.fx
and type ('s,'r,'f,'c) P.T.Extension.rx = ('s,'r,'f,'c) Stream.P.T.Extension.rx
and type ('s,'r,'f,'c) P.T.Extension.sx = ('s,'r,'f,'c) Stream.P.T.Extension.sx
and type P.T.I.div_rounding_mode = Stream.P.T.I.div_rounding_mode
and type P.T.Region.region = Stream.P.T.Region.region
and type P.T.ccexp = Stream.P.T.ccexp
and type P.T.fexp = Stream.P.T.fexp
(* and type P.T.labexp = Stream.P.T.labexp *)
and type P.T.mlrisc = Stream.P.T.mlrisc
and type P.T.oper = Stream.P.T.oper
and type P.T.rep = Stream.P.T.rep
and type P.T.rexp = Stream.P.T.rexp
and type P.T.stm = Stream.P.T.stm
) : CONTROL_FLOWGRAPH_GEN =
struct
structure CFG = CFG
structure P = CFG.P
structure I = Props.I
structure G = Graph
structure S = Stream
structure Fmt = Format
structure PB = PseudoOpsBasisTyp
exception LabelNotFound
type instrStream =
(I.instruction, Annotations.annotations, CFG.I.C.cellset, CFG.cfg) S.stream
val dumpCFG =
MLRiscControl.mkFlag
("dump-initial-cfg",
"Dump CFG after instruction selection")
fun error msg = MLRiscErrorMsg.error ("BuildFlowGraph", msg)
val hashLabel = Word.toInt o Label.hash
fun build () = let
val cfg as ref(G.GRAPH graph) = ref(CFG.new())
(* list of blocks generated so far *)
val blockList = ref ([] : CFG.block list)
(* list of entry labels to patch successors of ENTRY *)
val entryLabels = ref ([] : Label.label list)
(* block id associated with a label*)
val labelMap = IntHashTable.mkTable(32, LabelNotFound)
val findLabel = IntHashTable.find labelMap
val addLabel = IntHashTable.insert labelMap
(* Data in text segment is read-only *)
datatype segment_t = TEXT | DATA | RO_DATA | BSS | DECLS
val segmentF = ref DECLS
(* the block names *)
val blockNames = ref [] : Annotations.annotations ref
(* can instructions be reordered *)
val reorder = ref [] : Annotations.annotations ref
(* noblock or invalid block has id of ~1 *)
val noBlock = CFG.newBlock(~1, ref 0.0)
(* current block being built up *)
val currentBlock = ref noBlock
(* add a new block and make it the current block being built up *)
fun newBlock (freq) = let
val G.GRAPH graph = !cfg
val id = #new_id graph ()
val blk as CFG.BLOCK{annotations, ...} = CFG.newBlock(id, ref freq)
in
currentBlock := blk;
annotations := !blockNames @ !reorder;
blockList := blk :: !blockList;
#add_node graph (id, blk);
blk
end
(* get current basic block *)
fun getBlock () =
(case !currentBlock of CFG.BLOCK{id= ~1, ...} => newBlock(1.0) | blk => blk)
(* ------------------------cluster---------------------------*)
(* start a new cluster *)
fun beginCluster _ =
(blockList := [];
entryLabels := [];
IntHashTable.clear labelMap;
blockNames := [];
currentBlock := noBlock)
(* emit an instruction *)
fun emit i = let
val CFG.BLOCK{insns, ...} = getBlock()
fun terminate() = currentBlock := noBlock;
in
insns := i:: !insns;
case Props.instrKind(i)
of Props.IK_JUMP => terminate()
| Props.IK_CALL_WITH_CUTS => terminate()
| _ => ()
(*esac*)
end
(* make current block an exit block *)
fun exitBlock liveout = let
fun setLiveOut(CFG.BLOCK{annotations, ...}) =
annotations := #create CFG.LIVEOUT liveout :: !annotations
in
case !currentBlock
of CFG.BLOCK{id= ~1, ...} =>
(case !blockList
of [] => error "exitBlocks"
| blk::_ => setLiveOut blk
(*esac*))
| blk => setLiveOut blk
end (* exitBlock *)
(* end cluster --- all done *)
fun endCluster (annotations) = let
val cfg as G.GRAPH graph = (!cfg before cfg := CFG.new())
val _ = CFG.init(cfg) (* create unique ENTRY/EXIT nodes *)
val ENTRY = hd(#entries graph ())
val EXIT = hd(#exits graph ())
fun addEdge(from, to, kind) =
#add_edge graph (from, to, CFG.EDGE{k=kind, w=ref 0.0, a=ref[]})
fun addEdgeAn(from, to, kind, an) =
#add_edge graph (from, to, CFG.EDGE{k=kind, w=ref 0.0, a=ref an})
fun target lab =
(case (IntHashTable.find labelMap (hashLabel lab))
of SOME bId => bId
| NONE => EXIT)
val {get=getProb, ...} = MLRiscAnnotations.BRANCH_PROB
fun jump(from, instr, blocks) = let
fun branch(targetLab) = let
val (_, an) = Props.getAnnotations instr
val an = List.filter
(fn (MLRiscAnnotations.BRANCHPROB _) => true | _ => false)
an
fun next(CFG.BLOCK{id, ...}::_) = id
| next [] = error "jump.next"
in
addEdgeAn(from, target targetLab, CFG.BRANCH true, an);
addEdge(from, next blocks, CFG.BRANCH false)
end
in
case Props.branchTargets instr
of [Props.ESCAPES] => addEdge(from, EXIT, CFG.EXIT)
| [Props.LABELLED lab] => addEdge(from, target lab, CFG.JUMP)
| [Props.LABELLED lab, Props.FALLTHROUGH] => branch(lab)
| [Props.FALLTHROUGH, Props.LABELLED lab] => branch(lab)
| targets => let
fun switch(Props.LABELLED lab, n) =
(addEdge(from, target lab, CFG.SWITCH(n)); n+1)
| switch _ = error "jump.switch"
in List.foldl switch 0 targets; ()
end
end
and fallsThru(id, blks) =
case blks
of [] => addEdge(id, EXIT, CFG.EXIT)
| CFG.BLOCK{id=next, ...}::_ => addEdge(id, next, CFG.FALLSTHRU)
(*esac*)
and addEdges [] = ()
| addEdges(CFG.BLOCK{id, insns=ref[], ...}::blocks) = fallsThru(id, blocks)
| addEdges(CFG.BLOCK{id, insns=ref(instr::_), ...}::blocks) = let
fun doJmp () = jump(id, instr, blocks)
in
case Props.instrKind instr
of Props.IK_JUMP => doJmp()
| Props.IK_CALL_WITH_CUTS => doJmp()
| _ => fallsThru(id, blocks)
(*esac*);
addEdges(blocks)
end
in
addEdges (rev(!blockList));
app (fn lab => addEdge(ENTRY, target lab, CFG.ENTRY)) (!entryLabels);
let val an = CFG.annotations cfg in an := annotations @ (!an) end;
if !dumpCFG
then CFG.dump (
!MLRiscControl.debug_stream,
"after instruction selection", cfg)
else ();
cfg
end (* endCluster *)
(* ------------------------annotations-----------------------*)
(* XXX: Bug: EMPTYBLOCK does not really generate an empty block
* but merely terminates the current block. Contradicts the comment
* in instructions/mlriscAnnotations.sig.
* It should be (newBlock(1.0); newBlock(1.0); ())
*)
(* Add a new annotation *)
fun addAnnotation a =
(case a
of MLRiscAnnotations.BLOCKNAMES names =>
(blockNames := names; newBlock(1.0); ())
| MLRiscAnnotations.EMPTYBLOCK => (newBlock(1.0); ())
| MLRiscAnnotations.EXECUTIONFREQ f =>
(case !currentBlock
of CFG.BLOCK{id= ~1, ...} => (newBlock(real f); ())
| CFG.BLOCK{freq, ...} => freq := real f
(*esac*))
| a => let
val CFG.BLOCK{annotations,...} = getBlock()
in annotations := a :: !annotations
end
(*esac*))
(* get annotation associated with flow graph *)
fun getAnnotations () = CFG.annotations(!cfg)
(* add a comment annotation to the current block *)
fun comment msg =
case !segmentF
of TEXT => addAnnotation (#create MLRiscAnnotations.COMMENT msg)
| _ => let
val Graph.GRAPH graph = !cfg
val CFG.INFO{data, ...} = #graph_info graph
in data := PB.COMMENT msg :: !data
end
(* -------------------------labels---------------------------*)
(* BUG: Does not respect any ordering between labels and pseudoOps.
* This could be a problem with jump tables.
*)
fun addPseudoOp p = let
val Graph.GRAPH graph = !cfg
val CFG.INFO{data, decls, ...} = #graph_info graph
fun addAlignment () =
(case !segmentF
of DECLS => error "addAlignment: DECLS"
| TEXT => let
val CFG.BLOCK{align, ...} = newBlock 1.0
in align := SOME p
end
| _ => data := p :: !data
(*esac*))
fun startSegment(seg) = (data := p :: !data; segmentF := seg)
fun addData () = data := p :: !data
fun chkAddData(seg) = let
fun errmsg curr =
Fmt.format "addPseudoOp: %s in %s segment" [Fmt.STR seg, Fmt.STR curr]
in
case !segmentF
of DECLS => error(errmsg "DECLS")
| TEXT => error(errmsg "TEXT")
| _ => data := p :: !data
(*esac*)
end
fun addDecl() =
(case !segmentF
of DECLS => decls := p :: !decls
| _ => data := p :: !data
(*esac*))
in
case p
of PB.ALIGN_SZ _ => addAlignment()
| PB.ALIGN_ENTRY => addAlignment()
| PB.ALIGN_LABEL => addAlignment()
| PB.DATA_LABEL _ =>
(case !segmentF
of TEXT => error "addPseudoOp: DATA_LABEL in TEXT segment"
| _ => (data := p:: !data)
(*esac*))
| PB.DATA_READ_ONLY => startSegment(RO_DATA)
| PB.DATA => startSegment(DATA)
| PB.TEXT => segmentF := TEXT
| PB.BSS => startSegment(BSS)
| PB.SECTION _ =>
(case !segmentF
of TEXT => error "addPseudoOp: SECTION in TEXT segment"
| _ => data := p :: !data
(*esac*))
| PB.REORDER => (reorder := []; newBlock 1.0; ())
| PB.NOREORDER =>
(reorder := [#create MLRiscAnnotations.NOREORDER ()]; newBlock 1.0; ())
| PB.INT _ => chkAddData("INT")
| PB.FLOAT _ => chkAddData("FLOAT")
| PB.ASCII _ => chkAddData("ASCII")
| PB.ASCIIZ _ => chkAddData("ASCIIZ")
| PB.SPACE _ => chkAddData("SPACE")
| PB.COMMENT _ => addDecl()
| PB.IMPORT _ => addDecl()
| PB.EXPORT _ => addDecl()
| PB.EXT _ =>
(case !segmentF
of TEXT => error "EXT in TEXT segment"
| _ => addDecl()
(*esac*))
end
fun defineLabel lab =
(case !segmentF
of TEXT =>
(case findLabel (hashLabel lab)
of NONE => let
fun newBlk () =
(case !currentBlock
of CFG.BLOCK{id= ~1, ...} => newBlock 1.0
| CFG.BLOCK{insns=ref[], ...} => !currentBlock (* probably aligned block *)
| _ => newBlock 1.0
(*esac*))
val CFG.BLOCK{id, labels, ...} = newBlk()
in
labels := lab :: !labels;
addLabel(hashLabel lab, id)
end
| SOME _ =>
error (concat
["multiple definitions of label \"", Label.toString lab, "\""])
(*esac*))
| _ => let
(* non-text segment *)
val Graph.GRAPH graph = !cfg
val CFG.INFO{data, ...} = #graph_info graph
in
data := PB.DATA_LABEL lab :: !data
end
(*esac*))
fun entryLabel lab = (defineLabel lab; entryLabels := lab :: !entryLabels)
in
S.STREAM
{
comment = comment,
getAnnotations= getAnnotations,
annotation = addAnnotation,
defineLabel = defineLabel,
entryLabel = entryLabel,
pseudoOp = addPseudoOp,
beginCluster = beginCluster,
emit = emit,
exitBlock = exitBlock,
endCluster = endCluster
}
end (* build *)
end
|