Lines Matching defs:has

76     // constant has.
220       bool has(Register R) const {
311     //   "true" if a change has been made, "false" otherwise.
543 // happens. If a cell has room for more constants, the new constant is added.
638   // If the def has a sub-register, set the corresponding cell to "bottom".
666     if (!Cells.has(UseR.Reg))
716       if (!Outputs.has(DefR.Reg))
918     // If this block has been visited, go on to the next one.
1107   assert(Inputs.has(R1.Reg) && Inputs.has(R2.Reg));
1146   assert(Inputs.has(R1.Reg));
1173   assert(Inputs.has(R1.Reg));
1252   // Let X be a number that has properties Props.
1371   assert(Inputs.has(R1.Reg) && Inputs.has(R2.Reg));
1402   assert(Inputs.has(R1.Reg));
1438   assert(Inputs.has(R1.Reg) && Inputs.has(R2.Reg));
1469   assert(Inputs.has(R1.Reg));
1505   assert(Inputs.has(R1.Reg) && Inputs.has(R2.Reg));
1534   assert(Inputs.has(R1.Reg));
1567   assert(Inputs.has(R1.Reg));
1598   assert(Inputs.has(R1.Reg));
1663   assert(Inputs.has(R1.Reg));
1698   assert(Inputs.has(R1.Reg));
1734   assert(Inputs.has(R1.Reg));
1792   assert(Inputs.has(R1.Reg));
2092       assert(Inputs.has(R1.Reg));
2124       assert(Inputs.has(R1.Reg));
2294     // If the condition operand has a subregister, this is not something
2298     assert(Inputs.has(PR.Reg));
2518   assert(Inputs.has(RL.Reg) && Inputs.has(RH.Reg));
2679   assert(Inputs.has(CR.Reg));
2722   assert(Inputs.has(R1.Reg));
2767   assert(Inputs.has(R1.Reg));
2809       if (!MI.isPHI() && !Inputs.has(R.Reg)) {
2850     assert(Inputs.has(R));
2893       // This cell has a single value.
2978       assert(Inputs.has(R2.Reg) && Inputs.has(R3.Reg));
3040       assert(Inputs.has(R1.Reg) && Inputs.has(R2.Reg));
3076       assert(Inputs.has(R1.Reg) && Inputs.has(R2.Reg));