Searched refs:Literals (Results 1 – 7 of 7) sorted by relevance
364 const std::vector<unsigned> &Literals) const { in insertLiterals()366 for (unsigned i = 0, e = Literals.size(); i < e; i+=2) { in insertLiterals()367 unsigned LiteralPair0 = Literals[i]; in insertLiterals()368 unsigned LiteralPair1 = (i + 1 < e)?Literals[i + 1]:0; in insertLiterals()390 std::vector<MachineOperand *>Literals; in MakeALUClause() local400 getLiteral(*BI, Literals); in MakeALUClause()406 getLiteral(*I, Literals); in MakeALUClause()410 for (unsigned i = 0, e = Literals.size(); i < e; i += 2) { in MakeALUClause()413 if (Literals[i]->isImm()) { in MakeALUClause()414 MILit.addImm(Literals[i]->getImm()); in MakeALUClause()[all …]
585 SmallSet<int64_t, 4> Literals; in fitsConstReadLimitations() local592 Literals.insert(Src.second); in fitsConstReadLimitations()593 if (Literals.size() > 4) in fitsConstReadLimitations()
46 void addClause(ArrayRef<Literal> Literals) { in addClause()48 assert(!Literals.empty() && Literals.size() <= 3); in addClause()51 for (auto L : Literals) { in addClause()
86 - [Literals Section](#literals-section)411 - [Literals Section](#literals-section)431 Literals Section437 Literals can be stored uncompressed or compressed using Huffman prefix codes.468 - `Raw_Literals_Block` - Literals are stored uncompressed.469 - `RLE_Literals_Block` - Literals consist of a single byte value537 #### Raw Literals Block541 #### RLE Literals Block545 #### Compressed Literals Block and Treeless Literals Block596 It is the number of bytes to be copied (or extracted) from the Literals Section.[all …]
79 //--- Literals -----------------------------------------------------------//
13 Literals or match lengths are compressed with one Huffman tree, and
186 // C99 6.4.5: String Literals.193 // C++11 String Literals.