reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
127 const BT::BitValue &V = RC[i]; 128 const BT::BitValue &SV = RC[Start]; 165 OS << "]:" << RC[Start]; 168 const BT::BitValue &SV = RC[Start]; 207 const BitValue &RCV = RC[i]; 225 Bits[i+B] = RC[i]; 228 Bits[i+B] = RC[i]; 230 Bits[i] = RC[i+(W-B)]; 315 if (Bits[i] != RC[i]) 391 if (!A[i].is(0) && !A[i].is(1)) 391 if (!A[i].is(0) && !A[i].is(1)) 403 Val |= A[i].is(1); 440 const BitValue &V1 = A1[I]; 441 const BitValue &V2 = A2[I]; 449 const BitValue &V1 = A1[I]; 450 const BitValue &V2 = A2[I]; 473 const BitValue &V1 = A1[I]; 474 const BitValue &V2 = A2[I]; 482 const BitValue &V1 = A1[I]; 483 const BitValue &V2 = A2[I]; 554 const BitValue &V1 = A1[i]; 555 const BitValue &V2 = A2[i]; 576 const BitValue &V1 = A1[i]; 577 const BitValue &V2 = A2[i]; 598 const BitValue &V1 = A1[i]; 599 const BitValue &V2 = A2[i]; 616 const BitValue &V = A1[i]; 648 if ((C < AW && A1[AW-1-C].num()) || C == AW) 658 if ((C < AW && A1[C].num()) || C == AW)lib/Target/Hexagon/BitTracker.h
383 RC[i] = BitValue::ref(C[i]);
lib/Target/Hexagon/HexagonBitSimplify.cpp318 if (RC1[B1+i].Type == BitTracker::BitValue::Ref && RC1[B1+i].RefI.Reg == 0) 318 if (RC1[B1+i].Type == BitTracker::BitValue::Ref && RC1[B1+i].RefI.Reg == 0) 321 if (RC2[B2+i].Type == BitTracker::BitValue::Ref && RC2[B2+i].RefI.Reg == 0) 321 if (RC2[B2+i].Type == BitTracker::BitValue::Ref && RC2[B2+i].RefI.Reg == 0) 323 if (RC1[B1+i] != RC2[B2+i]) 323 if (RC1[B1+i] != RC2[B2+i]) 333 if (!RC[i].is(0)) 343 const BitTracker::BitValue &BV = RC[i-1]; 1295 if (Used[i+DB] && DC[DB+i] != SC[SB+i]) 1295 if (Used[i+DB] && DC[DB+i] != SC[SB+i]) 1806 while (I < B+16 && RC[I].num()) 1811 unsigned Reg = RC[I].RefI.Reg; 1812 unsigned P = RC[I].RefI.Pos; // The RefI.Pos will be advanced by I-B. 1829 const BitTracker::BitValue &RV = RC[i+B]; 1837 if (RC[i+B] != SC[i+Pos]) 1837 if (RC[i+B] != SC[i+Pos]) 2128 while (W > 0 && RC[W-1].is(0)) 2193 while (Z > 0 && C[Z-1].is(0)) 2205 const BitTracker::BitValue &B0 = RC[0]; 2215 const BitTracker::BitValue &V = RC[i]; 2236 const BitTracker::BitValue &S0 = SC[0]; 2251 const BitTracker::BitValue &V = SC[I]; 2340 const BitTracker::BitValue &V = SC[F+BN]; 2417 const BitTracker::BitValue &TopV = RC[W-1]; 2424 const BitTracker::BitValue &V = RC[I]; 2434 for (--W; W > 0 && RC[W-1].is(S); --W) 2446 for (--W; W > 0 && RC[W-1] == TopV; --W) 2605 const BitTracker::BitValue &V = SC[I]; 2971 const BitTracker::BitValue &V = RC[i]; 3025 const BitTracker::BitValue &V = OutC[i]; 3045 const BitTracker::BitValue &V1 = OutC1[i], &V2 = OutC2[i]; 3045 const BitTracker::BitValue &V1 = OutC1[i], &V2 = OutC2[i];lib/Target/Hexagon/HexagonGenInsert.cpp
339 const BitTracker::BitValue &V1 = RC1[i], &V2 = RC2[i]; 339 const BitTracker::BitValue &V1 = RC1[i], &V2 = RC2[i]; 369 const BitTracker::BitValue &V1 = RC1[Bit1], V2 = RC2[Bit2]; 369 const BitTracker::BitValue &V1 = RC1[Bit1], V2 = RC2[Bit2]; 648 const BitTracker::BitValue &BV = RC[i]; 663 const BitTracker::BitValue &BV = RC[i]; 704 const BitTracker::BitValue &V = RC[i]; 881 if (RC[i] == AC[i]) 881 if (RC[i] == AC[i])