| OLD | NEW |
| 1 //===- subzero/src/IceOperand.cpp - High-level operand implementation -----===// | 1 //===- subzero/src/IceOperand.cpp - High-level operand implementation -----===// |
| 2 // | 2 // |
| 3 // The Subzero Code Generator | 3 // The Subzero Code Generator |
| 4 // | 4 // |
| 5 // This file is distributed under the University of Illinois Open Source | 5 // This file is distributed under the University of Illinois Open Source |
| 6 // License. See LICENSE.TXT for details. | 6 // License. See LICENSE.TXT for details. |
| 7 // | 7 // |
| 8 //===----------------------------------------------------------------------===// | 8 //===----------------------------------------------------------------------===// |
| 9 /// | 9 /// |
| 10 /// \file | 10 /// \file |
| (...skipping 311 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 322 | 322 |
| 323 for (Inst &I : Node->getPhis()) { | 323 for (Inst &I : Node->getPhis()) { |
| 324 if (I.isDeleted()) | 324 if (I.isDeleted()) |
| 325 continue; | 325 continue; |
| 326 if (Variable *Dest = I.getDest()) { | 326 if (Variable *Dest = I.getDest()) { |
| 327 SizeT DestNum = Dest->getIndex(); | 327 SizeT DestNum = Dest->getIndex(); |
| 328 assert(DestNum < Metadata.size()); | 328 assert(DestNum < Metadata.size()); |
| 329 Metadata[DestNum].markDef(Kind, &I, Node); | 329 Metadata[DestNum].markDef(Kind, &I, Node); |
| 330 } | 330 } |
| 331 for (SizeT SrcNum = 0; SrcNum < I.getSrcSize(); ++SrcNum) { | 331 for (SizeT SrcNum = 0; SrcNum < I.getSrcSize(); ++SrcNum) { |
| 332 if (const Variable *Var = llvm::dyn_cast<Variable>(I.getSrc(SrcNum))) { | 332 if (auto *Var = llvm::dyn_cast<Variable>(I.getSrc(SrcNum))) { |
| 333 SizeT VarNum = Var->getIndex(); | 333 SizeT VarNum = Var->getIndex(); |
| 334 assert(VarNum < Metadata.size()); | 334 assert(VarNum < Metadata.size()); |
| 335 constexpr bool IsImplicit = false; | 335 constexpr bool IsImplicit = false; |
| 336 Metadata[VarNum].markUse(Kind, &I, Node, IsImplicit); | 336 Metadata[VarNum].markUse(Kind, &I, Node, IsImplicit); |
| 337 } | 337 } |
| 338 } | 338 } |
| 339 } | 339 } |
| 340 | 340 |
| 341 for (Inst &I : Node->getInsts()) { | 341 for (Inst &I : Node->getInsts()) { |
| 342 if (I.isDeleted()) | 342 if (I.isDeleted()) |
| (...skipping 204 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 547 if (getType() != IceType_i32 && getType() != IceType_i16 && | 547 if (getType() != IceType_i32 && getType() != IceType_i16 && |
| 548 getType() != IceType_i8) | 548 getType() != IceType_i8) |
| 549 return false; | 549 return false; |
| 550 // The Following checks if the signed representation of Value is between | 550 // The Following checks if the signed representation of Value is between |
| 551 // -Threshold/2 and +Threshold/2 | 551 // -Threshold/2 and +Threshold/2 |
| 552 bool largerThanThreshold = Threshold / 2 + Value >= Threshold; | 552 bool largerThanThreshold = Threshold / 2 + Value >= Threshold; |
| 553 return largerThanThreshold; | 553 return largerThanThreshold; |
| 554 } | 554 } |
| 555 | 555 |
| 556 } // end of namespace Ice | 556 } // end of namespace Ice |
| OLD | NEW |