1 -----------------------------------------------------------------------------
3 -- Code generator utilities; mostly monadic
5 -- (c) The University of Glasgow 2004
7 -----------------------------------------------------------------------------
12 emitDataLits, emitRODataLits, emitIf, emitIfThenElse,
13 emitRtsCall, emitRtsCallWithVols, emitRtsCallWithResult,
16 emitSwitch, emitLitSwitch,
19 cmmAndWord, cmmOrWord, cmmNegate, cmmEqWord, cmmNeWord,
20 cmmOffsetExprW, cmmOffsetExprB,
21 cmmRegOffW, cmmRegOffB,
22 cmmLabelOffW, cmmLabelOffB,
23 cmmOffsetW, cmmOffsetB,
24 cmmOffsetLitW, cmmOffsetLitB,
34 #include "HsVersions.h"
37 import TyCon ( TyCon, tyConName )
39 import Constants ( wORD_SIZE )
40 import SMRep ( CgRep, StgWord, hALF_WORD_SIZE_IN_BITS, ByteOff,
42 import PprCmm ( {- instances -} )
46 import MachOp ( MachRep(..), wordRep, MachOp(..), MachHint(..),
47 mo_wordOr, mo_wordAnd, mo_wordNe, mo_wordEq,
48 mo_wordULt, mo_wordUGt, machRepByteWidth )
49 import ForeignCall ( CCallConv(..) )
50 import Literal ( Literal(..) )
51 import CLabel ( CLabel, mkStringLitLabel )
52 import Digraph ( SCC(..), stronglyConnComp )
53 import ListSetOps ( assocDefault )
54 import Util ( filterOut, sortLe )
55 import CmdLineOpts ( DynFlags )
56 import FastString ( LitString, FastString, unpackFS )
61 import Maybe ( isNothing )
63 #include "../includes/ghcconfig.h"
64 -- For WORDS_BIGENDIAN
66 -------------------------------------------------------------------------
68 -- Random small functions
70 -------------------------------------------------------------------------
72 addIdReps :: [Id] -> [(CgRep, Id)]
73 addIdReps ids = [(idCgRep id, id) | id <- ids]
75 -------------------------------------------------------------------------
79 -------------------------------------------------------------------------
81 cgLit :: Literal -> FCode CmmLit
82 cgLit (MachStr s) = mkStringCLit (unpackFS s)
83 cgLit other_lit = return (mkSimpleLit other_lit)
85 mkSimpleLit :: Literal -> CmmLit
86 mkSimpleLit (MachChar c) = CmmInt (fromIntegral (ord c)) wordRep
87 mkSimpleLit MachNullAddr = zeroCLit
88 mkSimpleLit (MachInt i) = CmmInt i wordRep
89 mkSimpleLit (MachInt64 i) = CmmInt i I64
90 mkSimpleLit (MachWord i) = CmmInt i wordRep
91 mkSimpleLit (MachWord64 i) = CmmInt i I64
92 mkSimpleLit (MachFloat r) = CmmFloat r F32
93 mkSimpleLit (MachDouble r) = CmmFloat r F64
94 mkSimpleLit (MachLabel fs ms) = CmmLabel (mkForeignLabel fs ms is_dyn)
96 is_dyn = False -- ToDo: fix me
98 mkLtOp :: Literal -> MachOp
99 -- On signed literals we must do a signed comparison
100 mkLtOp (MachInt _) = MO_S_Lt wordRep
101 mkLtOp (MachFloat _) = MO_S_Lt F32
102 mkLtOp (MachDouble _) = MO_S_Lt F64
103 mkLtOp lit = MO_U_Lt (cmmLitRep (mkSimpleLit lit))
106 ---------------------------------------------------
108 -- Cmm data type functions
110 ---------------------------------------------------
112 -----------------------
113 -- The "B" variants take byte offsets
114 cmmRegOffB :: CmmReg -> ByteOff -> CmmExpr
115 cmmRegOffB = cmmRegOff
117 cmmOffsetB :: CmmExpr -> ByteOff -> CmmExpr
118 cmmOffsetB = cmmOffset
120 cmmOffsetExprB :: CmmExpr -> CmmExpr -> CmmExpr
121 cmmOffsetExprB = cmmOffsetExpr
123 cmmLabelOffB :: CLabel -> ByteOff -> CmmLit
124 cmmLabelOffB = cmmLabelOff
126 cmmOffsetLitB :: CmmLit -> ByteOff -> CmmLit
127 cmmOffsetLitB = cmmOffsetLit
129 -----------------------
130 -- The "W" variants take word offsets
131 cmmOffsetExprW :: CmmExpr -> CmmExpr -> CmmExpr
132 -- The second arg is a *word* offset; need to change it to bytes
133 cmmOffsetExprW e (CmmLit (CmmInt n _)) = cmmOffsetW e (fromInteger n)
134 cmmOffsetExprW e wd_off = cmmIndexExpr wordRep e wd_off
136 cmmOffsetW :: CmmExpr -> WordOff -> CmmExpr
137 cmmOffsetW e n = cmmOffsetB e (wORD_SIZE * n)
139 cmmRegOffW :: CmmReg -> WordOff -> CmmExpr
140 cmmRegOffW reg wd_off = cmmRegOffB reg (wd_off * wORD_SIZE)
142 cmmOffsetLitW :: CmmLit -> WordOff -> CmmLit
143 cmmOffsetLitW lit wd_off = cmmOffsetLitB lit (wORD_SIZE * wd_off)
145 cmmLabelOffW :: CLabel -> WordOff -> CmmLit
146 cmmLabelOffW lbl wd_off = cmmLabelOffB lbl (wORD_SIZE * wd_off)
148 cmmLoadIndexW :: CmmExpr -> Int -> CmmExpr
149 cmmLoadIndexW base off
150 = CmmLoad (cmmOffsetW base off) wordRep
152 -----------------------
153 cmmNeWord, cmmEqWord, cmmOrWord, cmmAndWord :: CmmExpr -> CmmExpr -> CmmExpr
154 cmmOrWord e1 e2 = CmmMachOp mo_wordOr [e1, e2]
155 cmmAndWord e1 e2 = CmmMachOp mo_wordAnd [e1, e2]
156 cmmNeWord e1 e2 = CmmMachOp mo_wordNe [e1, e2]
157 cmmEqWord e1 e2 = CmmMachOp mo_wordEq [e1, e2]
158 cmmULtWord e1 e2 = CmmMachOp mo_wordULt [e1, e2]
159 cmmUGtWord e1 e2 = CmmMachOp mo_wordUGt [e1, e2]
161 cmmNegate :: CmmExpr -> CmmExpr
162 cmmNegate (CmmLit (CmmInt n rep)) = CmmLit (CmmInt (-n) rep)
163 cmmNegate e = CmmMachOp (MO_S_Neg (cmmExprRep e)) [e]
165 blankWord :: CmmStatic
166 blankWord = CmmUninitialised wORD_SIZE
168 -----------------------
171 mkWordCLit :: StgWord -> CmmLit
172 mkWordCLit wd = CmmInt (fromIntegral wd) wordRep
174 packHalfWordsCLit :: (Integral a, Integral b) => a -> b -> CmmLit
175 -- Make a single word literal in which the lower_half_word is
176 -- at the lower address, and the upper_half_word is at the
178 -- ToDo: consider using half-word lits instead
179 -- but be careful: that's vulnerable when reversed
180 packHalfWordsCLit lower_half_word upper_half_word
181 #ifdef WORDS_BIGENDIAN
182 = mkWordCLit ((fromIntegral lower_half_word `shiftL` hALF_WORD_SIZE_IN_BITS)
183 .|. fromIntegral upper_half_word)
185 = mkWordCLit ((fromIntegral lower_half_word)
186 .|. (fromIntegral upper_half_word `shiftL` hALF_WORD_SIZE_IN_BITS))
189 --------------------------------------------------------------------------
191 -- Incrementing a memory location
193 --------------------------------------------------------------------------
195 addToMem :: MachRep -- rep of the counter
196 -> CmmExpr -- Address
197 -> Int -- What to add (a word)
199 addToMem rep ptr n = addToMemE rep ptr (CmmLit (CmmInt (toInteger n) rep))
201 addToMemE :: MachRep -- rep of the counter
202 -> CmmExpr -- Address
203 -> CmmExpr -- What to add (a word-typed expression)
206 = CmmStore ptr (CmmMachOp (MO_Add rep) [CmmLoad ptr rep, n])
208 -------------------------------------------------------------------------
210 -- Converting a closure tag to a closure for enumeration types
211 -- (this is the implementation of tagToEnum#).
213 -------------------------------------------------------------------------
215 tagToClosure :: DynFlags -> TyCon -> CmmExpr -> CmmExpr
216 tagToClosure dflags tycon tag
217 = CmmLoad (cmmOffsetExprW closure_tbl tag) wordRep
218 where closure_tbl = CmmLit (CmmLabel lbl)
219 lbl = mkClosureTableLabel dflags (tyConName tycon)
221 -------------------------------------------------------------------------
223 -- Conditionals and rts calls
225 -------------------------------------------------------------------------
227 emitIf :: CmmExpr -- Boolean
230 -- Emit (if e then x)
231 -- ToDo: reverse the condition to avoid the extra branch instruction if possible
232 -- (some conditionals aren't reversible. eg. floating point comparisons cannot
233 -- be inverted because there exist some values for which both comparisons
234 -- return False, such as NaN.)
235 emitIf cond then_part
236 = do { then_id <- newLabelC
237 ; join_id <- newLabelC
238 ; stmtC (CmmCondBranch cond then_id)
239 ; stmtC (CmmBranch join_id)
245 emitIfThenElse :: CmmExpr -- Boolean
249 -- Emit (if e then x else y)
250 emitIfThenElse cond then_part else_part
251 = do { then_id <- newLabelC
252 ; else_id <- newLabelC
253 ; join_id <- newLabelC
254 ; stmtC (CmmCondBranch cond then_id)
256 ; stmtC (CmmBranch join_id)
262 emitRtsCall :: LitString -> [(CmmExpr,MachHint)] -> Code
263 emitRtsCall fun args = emitRtsCall' [] fun args Nothing
264 -- The 'Nothing' says "save all global registers"
266 emitRtsCallWithVols :: LitString -> [(CmmExpr,MachHint)] -> [GlobalReg] -> Code
267 emitRtsCallWithVols fun args vols
268 = emitRtsCall' [] fun args (Just vols)
270 emitRtsCallWithResult :: CmmReg -> MachHint -> LitString
271 -> [(CmmExpr,MachHint)] -> Code
272 emitRtsCallWithResult res hint fun args
273 = emitRtsCall' [(res,hint)] fun args Nothing
275 -- Make a call to an RTS C procedure
277 :: [(CmmReg,MachHint)]
279 -> [(CmmExpr,MachHint)]
282 emitRtsCall' res fun args vols = stmtC (CmmCall target res args vols)
284 target = CmmForeignCall fun_expr CCallConv
285 fun_expr = mkLblExpr (mkRtsCodeLabel fun)
288 -------------------------------------------------------------------------
290 -- Strings gnerate a top-level data block
292 -------------------------------------------------------------------------
294 emitDataLits :: CLabel -> [CmmLit] -> Code
295 -- Emit a data-segment data block
296 emitDataLits lbl lits
297 = emitData Data (CmmDataLabel lbl : map CmmStaticLit lits)
299 emitRODataLits :: CLabel -> [CmmLit] -> Code
300 -- Emit a read-only data block
301 emitRODataLits lbl lits
302 = emitData ReadOnlyData (CmmDataLabel lbl : map CmmStaticLit lits)
304 mkStringCLit :: String -> FCode CmmLit
305 -- Make a global definition for the string,
306 -- and return its label
308 = do { uniq <- newUnique
309 ; let lbl = mkStringLitLabel uniq
310 ; emitData ReadOnlyData [CmmDataLabel lbl, CmmString str]
311 ; return (CmmLabel lbl) }
313 -------------------------------------------------------------------------
315 -- Assigning expressions to temporaries
317 -------------------------------------------------------------------------
319 assignTemp :: CmmExpr -> FCode CmmExpr
320 -- For a non-trivial expression, e, create a local
321 -- variable and assign the expression to it
323 | isTrivialCmmExpr e = return e
324 | otherwise = do { reg <- newTemp (cmmExprRep e)
325 ; stmtC (CmmAssign reg e)
326 ; return (CmmReg reg) }
329 newTemp :: MachRep -> FCode CmmReg
330 newTemp rep = do { uniq <- newUnique; return (CmmLocal (LocalReg uniq rep)) }
333 -------------------------------------------------------------------------
335 -- Building case analysis
337 -------------------------------------------------------------------------
340 :: CmmExpr -- Tag to switch on
341 -> [(ConTagZ, CgStmts)] -- Tagged branches
342 -> Maybe CgStmts -- Default branch (if any)
343 -> ConTagZ -> ConTagZ -- Min and Max possible values; behaviour
344 -- outside this range is undefined
347 -- ONLY A DEFAULT BRANCH: no case analysis to do
348 emitSwitch tag_expr [] (Just stmts) _ _
352 emitSwitch tag_expr branches mb_deflt lo_tag hi_tag
353 = -- Just sort the branches before calling mk_sritch
356 Nothing -> return Nothing
357 Just stmts -> do id <- forkCgStmts stmts; return (Just id)
359 ; stmts <- mk_switch tag_expr (sortLe le branches)
360 mb_deflt_id lo_tag hi_tag
364 (t1,_) `le` (t2,_) = t1 <= t2
367 mk_switch :: CmmExpr -> [(ConTagZ, CgStmts)]
368 -> Maybe BlockId -> ConTagZ -> ConTagZ
371 -- SINGLETON TAG RANGE: no case analysis to do
372 mk_switch tag_expr [(tag,stmts)] _ lo_tag hi_tag
374 = ASSERT( tag == lo_tag )
377 -- SINGLETON BRANCH, NO DEFUALT: no case analysis to do
378 mk_switch tag_expr [(tag,stmts)] Nothing lo_tag hi_tag
380 -- The simplifier might have eliminated a case
381 -- so we may have e.g. case xs of
383 -- In that situation we can be sure the (:) case
384 -- can't happen, so no need to test
386 -- SINGLETON BRANCH: one equality check to do
387 mk_switch tag_expr [(tag,stmts)] (Just deflt) lo_tag hi_tag
388 = return (CmmCondBranch cond deflt `consCgStmt` stmts)
390 cond = cmmNeWord tag_expr (CmmLit (mkIntCLit tag))
391 -- We have lo_tag < hi_tag, but there's only one branch,
392 -- so there must be a default
394 -- ToDo: we might want to check for the two branch case, where one of
395 -- the branches is the tag 0, because comparing '== 0' is likely to be
396 -- more efficient than other kinds of comparison.
398 -- DENSE TAG RANGE: use a switch statment
399 mk_switch tag_expr branches mb_deflt lo_tag hi_tag
400 | use_switch -- Use a switch
401 = do { branch_ids <- mapM forkCgStmts (map snd branches)
403 tagged_blk_ids = zip (map fst branches) (map Just branch_ids)
405 find_branch :: ConTagZ -> Maybe BlockId
406 find_branch i = assocDefault mb_deflt tagged_blk_ids i
408 arms = [ find_branch (i+lo_tag) | i <- [0..n_tags-1]]
410 switch_stmt = CmmSwitch (cmmOffset tag_expr (- lo_tag)) arms
412 ; return (oneCgStmt switch_stmt)
415 -- if we can knock off a bunch of default cases with one if, then do so
416 | Just deflt <- mb_deflt, (lowest_branch - lo_tag) >= n_branches
417 = do { (assign_tag, tag_expr') <- assignTemp' tag_expr
418 ; let cond = cmmULtWord tag_expr' (CmmLit (mkIntCLit lowest_branch))
419 branch = CmmCondBranch cond deflt
420 ; stmts <- mk_switch tag_expr' branches mb_deflt lowest_branch hi_tag
421 ; return (assign_tag `consCgStmt` (branch `consCgStmt` stmts))
424 | Just deflt <- mb_deflt, (hi_tag - highest_branch) >= n_branches
425 = do { (assign_tag, tag_expr') <- assignTemp' tag_expr
426 ; let cond = cmmUGtWord tag_expr' (CmmLit (mkIntCLit highest_branch))
427 branch = CmmCondBranch cond deflt
428 ; stmts <- mk_switch tag_expr' branches mb_deflt lo_tag highest_branch
429 ; return (assign_tag `consCgStmt` (branch `consCgStmt` stmts))
432 | otherwise -- Use an if-tree
433 = do { (assign_tag, tag_expr') <- assignTemp' tag_expr
434 -- To avoid duplication
435 ; lo_stmts <- mk_switch tag_expr' lo_branches mb_deflt lo_tag (mid_tag-1)
436 ; hi_stmts <- mk_switch tag_expr' hi_branches mb_deflt mid_tag hi_tag
437 ; lo_id <- forkCgStmts lo_stmts
438 ; let cond = cmmULtWord tag_expr' (CmmLit (mkIntCLit mid_tag))
439 branch_stmt = CmmCondBranch cond lo_id
440 ; return (assign_tag `consCgStmt` (branch_stmt `consCgStmt` hi_stmts))
443 use_switch = ASSERT( n_branches > 1 && n_tags > 1 )
444 {- pprTrace "mk_switch" (ppr tag_expr <+> text "n_tags: "
445 <+> int n_tags <+> text "dense: "
446 <+> int n_branches) $ -}
447 n_tags > 2 && (small || dense)
448 -- a 2-branch switch always turns into an if.
450 dense = n_branches > (n_tags `div` 2)
451 exhaustive = n_tags == n_branches
452 n_branches = length branches
454 -- ignore default slots at each end of the range if there's
455 -- no default branch defined.
456 lowest_branch = fst (head branches)
457 highest_branch = fst (last branches)
460 | isNothing mb_deflt = lowest_branch
464 | isNothing mb_deflt = highest_branch
467 n_tags = real_hi_tag - real_lo_tag + 1
469 -- INVARIANT: Provided hi_tag > lo_tag (which is true)
470 -- lo_tag <= mid_tag < hi_tag
471 -- lo_branches have tags < mid_tag
472 -- hi_branches have tags >= mid_tag
474 (mid_tag,_) = branches !! (n_branches `div` 2)
475 -- 2 branches => n_branches `div` 2 = 1
476 -- => branches !! 1 give the *second* tag
477 -- There are always at least 2 branches here
479 (lo_branches, hi_branches) = span is_lo branches
480 is_lo (t,_) = t < mid_tag
484 | isTrivialCmmExpr e = return (CmmNop, e)
485 | otherwise = do { reg <- newTemp (cmmExprRep e)
486 ; return (CmmAssign reg e, CmmReg reg) }
489 emitLitSwitch :: CmmExpr -- Tag to switch on
490 -> [(Literal, CgStmts)] -- Tagged branches
491 -> CgStmts -- Default branch (always)
492 -> Code -- Emit the code
493 -- Used for general literals, whose size might not be a word,
494 -- where there is always a default case, and where we don't know
495 -- the range of values for certain. For simplicity we always generate a tree.
497 -- ToDo: for integers we could do better here, perhaps by generalising
498 -- mk_switch and using that. --SDM 15/09/2004
499 emitLitSwitch scrut [] deflt
501 emitLitSwitch scrut branches deflt_blk
502 = do { scrut' <- assignTemp scrut
503 ; deflt_blk_id <- forkCgStmts deflt_blk
504 ; blk <- mk_lit_switch scrut' deflt_blk_id (sortLe le branches)
507 le (t1,_) (t2,_) = t1 <= t2
509 mk_lit_switch :: CmmExpr -> BlockId
510 -> [(Literal,CgStmts)]
512 mk_lit_switch scrut deflt_blk_id [(lit,blk)]
513 = return (consCgStmt if_stmt blk)
515 cmm_lit = mkSimpleLit lit
516 rep = cmmLitRep cmm_lit
517 cond = CmmMachOp (MO_Ne rep) [scrut, CmmLit cmm_lit]
518 if_stmt = CmmCondBranch cond deflt_blk_id
520 mk_lit_switch scrut deflt_blk_id branches
521 = do { hi_blk <- mk_lit_switch scrut deflt_blk_id hi_branches
522 ; lo_blk <- mk_lit_switch scrut deflt_blk_id lo_branches
523 ; lo_blk_id <- forkCgStmts lo_blk
524 ; let if_stmt = CmmCondBranch cond lo_blk_id
525 ; return (if_stmt `consCgStmt` hi_blk) }
527 n_branches = length branches
528 (mid_lit,_) = branches !! (n_branches `div` 2)
529 -- See notes above re mid_tag
531 (lo_branches, hi_branches) = span is_lo branches
532 is_lo (t,_) = t < mid_lit
534 cond = CmmMachOp (mkLtOp mid_lit)
535 [scrut, CmmLit (mkSimpleLit mid_lit)]
537 -------------------------------------------------------------------------
539 -- Simultaneous assignment
541 -------------------------------------------------------------------------
544 emitSimultaneously :: CmmStmts -> Code
545 -- Emit code to perform the assignments in the
546 -- input simultaneously, using temporary variables when necessary.
548 -- The Stmts must be:
549 -- CmmNop, CmmComment, CmmAssign, CmmStore
553 -- We use the strongly-connected component algorithm, in which
554 -- * the vertices are the statements
555 -- * an edge goes from s1 to s2 iff
556 -- s1 assigns to something s2 uses
557 -- that is, if s1 should *follow* s2 in the final order
559 type CVertex = (Int, CmmStmt) -- Give each vertex a unique number,
560 -- for fast comparison
562 emitSimultaneously stmts
564 case filterOut isNopStmt (stmtList stmts) of
567 [stmt] -> stmtC stmt -- It's often just one stmt
568 stmt_list -> doSimultaneously1 (zip [(1::Int)..] stmt_list)
570 doSimultaneously1 :: [CVertex] -> Code
571 doSimultaneously1 vertices
573 edges = [ (vertex, key1, edges_from stmt1)
574 | vertex@(key1, stmt1) <- vertices
576 edges_from stmt1 = [ key2 | (key2, stmt2) <- vertices,
577 stmt1 `mustFollow` stmt2
579 components = stronglyConnComp edges
581 -- do_components deal with one strongly-connected component
582 -- Not cyclic, or singleton? Just do it
583 do_component (AcyclicSCC (n,stmt)) = stmtC stmt
584 do_component (CyclicSCC [(n,stmt)]) = stmtC stmt
586 -- Cyclic? Then go via temporaries. Pick one to
587 -- break the loop and try again with the rest.
588 do_component (CyclicSCC ((n,first_stmt) : rest))
589 = do { from_temp <- go_via_temp first_stmt
590 ; doSimultaneously1 rest
593 go_via_temp (CmmAssign dest src)
594 = do { tmp <- newTemp (cmmRegRep dest)
595 ; stmtC (CmmAssign tmp src)
596 ; return (CmmAssign dest (CmmReg tmp)) }
597 go_via_temp (CmmStore dest src)
598 = do { tmp <- newTemp (cmmExprRep src)
599 ; stmtC (CmmAssign tmp src)
600 ; return (CmmStore dest (CmmReg tmp)) }
602 mapCs do_component components
604 mustFollow :: CmmStmt -> CmmStmt -> Bool
605 CmmAssign reg _ `mustFollow` stmt = anySrc (reg `regUsedIn`) stmt
606 CmmStore loc e `mustFollow` stmt = anySrc (locUsedIn loc (cmmExprRep e)) stmt
607 CmmNop `mustFollow` stmt = False
608 CmmComment _ `mustFollow` stmt = False
611 anySrc :: (CmmExpr -> Bool) -> CmmStmt -> Bool
612 -- True if the fn is true of any input of the stmt
613 anySrc p (CmmAssign _ e) = p e
614 anySrc p (CmmStore e1 e2) = p e1 || p e2 -- Might be used in either side
615 anySrc p (CmmComment _) = False
616 anySrc p CmmNop = False
617 anySrc p other = True -- Conservative
619 regUsedIn :: CmmReg -> CmmExpr -> Bool
620 reg `regUsedIn` CmmLit _ = False
621 reg `regUsedIn` CmmLoad e _ = reg `regUsedIn` e
622 reg `regUsedIn` CmmReg reg' = reg == reg'
623 reg `regUsedIn` CmmRegOff reg' _ = reg == reg'
624 reg `regUsedIn` CmmMachOp _ es = any (reg `regUsedIn`) es
626 locUsedIn :: CmmExpr -> MachRep -> CmmExpr -> Bool
627 -- (locUsedIn a r e) checks whether writing to r[a] could affect the value of
628 -- 'e'. Returns True if it's not sure.
629 locUsedIn loc rep (CmmLit _) = False
630 locUsedIn loc rep (CmmLoad e ld_rep) = possiblySameLoc loc rep e ld_rep
631 locUsedIn loc rep (CmmReg reg') = False
632 locUsedIn loc rep (CmmRegOff reg' _) = False
633 locUsedIn loc rep (CmmMachOp _ es) = any (locUsedIn loc rep) es
635 possiblySameLoc :: CmmExpr -> MachRep -> CmmExpr -> MachRep -> Bool
636 -- Assumes that distinct registers (eg Hp, Sp) do not
637 -- point to the same location, nor any offset thereof.
638 possiblySameLoc (CmmReg r1) rep1 (CmmReg r2) rep2 = r1==r2
639 possiblySameLoc (CmmReg r1) rep1 (CmmRegOff r2 0) rep2 = r1==r2
640 possiblySameLoc (CmmRegOff r1 0) rep1 (CmmReg r2) rep2 = r1==r2
641 possiblySameLoc (CmmRegOff r1 start1) rep1 (CmmRegOff r2 start2) rep2
642 = r1==r2 && end1 > start2 && end2 > start1
644 end1 = start1 + machRepByteWidth rep1
645 end2 = start2 + machRepByteWidth rep2
647 possiblySameLoc l1 rep1 (CmmLit _) rep2 = False
648 possiblySameLoc l1 rep1 l2 rep2 = True -- Conservative