Mercurial > projects > ddmd
annotate dmd/AndExp.d @ 53:a8b50ff7f201
ForeachStatement.syntaxCopy
SliceExp.syntaxCopy
AnonDeclaration.syntaxCopy
SwitchStatement.syntaxCopy
CaseStatement.syntaxCopy
BreakStatement.syntaxCopy
ThrowStatement.syntaxCopy
NewExp.syntaxCopy
DefaultStatement.syntaxCopy
AssertExp.syntaxCopy
ClassDeclaration.syntaxCopy
TypeTypedef.constConv
eval_builtin
ComplexExp.isConst
DVCondition.syntaxCopy
OrExp.getIntRange
AndExp.getIntRange
getMask
IntegerExp.getIntRange
Type.sizemask
CastExp.getIntRange
Expression.getIntRange
| author | korDen |
|---|---|
| date | Sat, 21 Aug 2010 12:15:47 +0400 |
| parents | 832f71e6f96c |
| children | cab4c37afb89 |
| rev | line source |
|---|---|
| 0 | 1 module dmd.AndExp; |
| 2 | |
| 3 import dmd.Expression; | |
| 4 import dmd.Identifier; | |
| 5 import dmd.InterState; | |
| 6 import dmd.OutBuffer; | |
| 7 import dmd.Loc; | |
| 8 import dmd.Scope; | |
| 9 import dmd.IntRange; | |
| 10 import dmd.IRState; | |
| 11 import dmd.BinExp; | |
| 12 import dmd.TOK; | |
| 13 import dmd.ArrayTypes; | |
| 14 import dmd.TY; | |
| 15 import dmd.Type; | |
| 16 import dmd.Id; | |
| 17 import dmd.Global; | |
| 18 | |
| 19 import dmd.backend.elem; | |
| 20 import dmd.backend.Util; | |
| 21 import dmd.backend.OPER; | |
| 22 import dmd.expression.Util; | |
| 23 import dmd.expression.And; | |
| 24 | |
| 25 class AndExp : BinExp | |
| 26 { | |
| 27 this(Loc loc, Expression e1, Expression e2) | |
| 28 { | |
| 29 super(loc, TOK.TOKand, AndExp.sizeof, e1, e2); | |
| 30 } | |
| 31 | |
| 32 Expression semantic(Scope sc) | |
| 33 { | |
| 34 Expression e; | |
| 35 | |
| 36 if (!type) | |
| 37 { | |
| 38 BinExp.semanticp(sc); | |
| 39 e = op_overload(sc); | |
| 40 | |
| 41 if (e) | |
| 42 return e; | |
| 43 | |
| 44 if (e1.type.toBasetype().ty == TY.Tbool && e2.type.toBasetype().ty == TY.Tbool) | |
| 45 { | |
| 46 type = e1.type; | |
| 47 e = this; | |
| 48 } | |
| 49 else | |
| 50 { | |
| 51 typeCombine(sc); | |
| 52 if (e1.op != TOK.TOKslice && e2.op != TOK.TOKslice) | |
| 53 { | |
| 54 e1.checkIntegral(); | |
| 55 e2.checkIntegral(); | |
| 56 } | |
| 57 } | |
| 58 } | |
| 59 return this; | |
| 60 } | |
| 61 | |
| 62 Expression optimize(int result) | |
| 63 { | |
| 64 Expression e; | |
| 65 | |
| 66 e1 = e1.optimize(result); | |
| 67 e2 = e2.optimize(result); | |
| 68 if (e1.isConst() == 1 && e2.isConst() == 1) | |
| 69 e = And(type, e1, e2); | |
| 70 else | |
| 71 e = this; | |
| 72 | |
| 73 return e; | |
| 74 } | |
| 75 | |
| 76 Expression interpret(InterState* istate) | |
| 77 { | |
| 78 assert(false); | |
| 79 } | |
| 80 | |
| 81 void buildArrayIdent(OutBuffer buf, Expressions arguments) | |
| 82 { | |
|
12
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
83 Exp_buildArrayIdent(buf, arguments, "And"); |
| 0 | 84 } |
| 85 | |
| 86 Expression buildArrayLoop(Arguments fparams) | |
| 87 { | |
|
12
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
88 /* Evaluate assign expressions left to right |
|
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
89 */ |
|
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
90 Expression ex1 = e1.buildArrayLoop(fparams); |
|
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
91 Expression ex2 = e2.buildArrayLoop(fparams); |
|
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
92 Expression e = new AndExp(Loc(0), ex1, ex2); |
|
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
93 return e; |
| 0 | 94 } |
| 95 | |
| 96 IntRange getIntRange() | |
| 97 { | |
| 53 | 98 IntRange ir; |
| 99 IntRange ir1 = e1.getIntRange(); | |
| 100 IntRange ir2 = e2.getIntRange(); | |
| 101 | |
| 102 ir.imin = ir1.imin; | |
| 103 if (ir2.imin < ir.imin) | |
| 104 ir.imin = ir2.imin; | |
| 105 | |
| 106 ir.imax = ir1.imax; | |
| 107 if (ir2.imax > ir.imax) | |
| 108 ir.imax = ir2.imax; | |
| 109 | |
| 110 ulong u; | |
| 111 | |
| 112 u = getMask(ir1.imax); | |
| 113 ir.imin &= u; | |
| 114 ir.imax &= u; | |
| 115 | |
| 116 u = getMask(ir2.imax); | |
| 117 ir.imin &= u; | |
| 118 ir.imax &= u; | |
| 119 | |
| 120 ir.imin &= type.sizemask(); | |
| 121 ir.imax &= type.sizemask(); | |
| 122 | |
| 123 //printf("AndExp: imin = x%llx, imax = x%llx\n", ir.imin, ir.imax); | |
| 124 //e1.dump(0); | |
| 125 | |
| 126 return ir; | |
| 0 | 127 } |
| 128 | |
| 129 bool isCommutative() | |
| 130 { | |
| 131 return true; | |
| 132 } | |
| 133 | |
| 134 Identifier opId() | |
| 135 { | |
| 136 return Id.iand; | |
| 137 } | |
| 138 | |
| 139 Identifier opId_r() | |
| 140 { | |
| 141 return Id.iand_r; | |
| 142 } | |
| 143 | |
| 144 elem* toElem(IRState* irs) | |
| 145 { | |
| 146 return toElemBin(irs, OPER.OPand); | |
| 147 } | |
| 148 } | |
| 149 |