Home | History | Annotate | Download | only in Support

Lines Matching refs:Size

31   return static_cast<unsigned>(hash_combine_range(Data, Data+Size));
35 if (Size != RHS.Size) return false;
36 return memcmp(Data, RHS.Data, Size*sizeof(*Data)) == 0;
42 if (Size != RHS.Size)
43 return Size < RHS.Size;
44 return memcmp(Data, RHS.Data, Size*sizeof(*Data)) < 0;
88 unsigned Size = String.size();
89 Bits.push_back(Size);
90 if (!Size) return;
92 unsigned Units = Size / 4;
107 for (Pos += 4; Pos <= Size; Pos += 4) {
115 for (Pos += 4; Pos <= Size; Pos += 4) {
127 // Pos will have overshot size by 4 - #bytes left over.
129 switch (Pos - Size) {
130 case 1: V = (V << 8) | (unsigned char)String[Size - 3]; // Fall thru.
131 case 2: V = (V << 8) | (unsigned char)String[Size - 2]; // Fall thru.
132 case 3: V = (V << 8) | (unsigned char)String[Size - 1]; break;
147 return FoldingSetNodeIDRef(Bits.data(), Bits.size()).ComputeHash();
153 return *this == FoldingSetNodeIDRef(RHS.Bits.data(), RHS.Bits.size());
159 return FoldingSetNodeIDRef(Bits.data(), Bits.size()) == RHS;
165 return *this < FoldingSetNodeIDRef(RHS.Bits.data(), RHS.Bits.size());
169 return FoldingSetNodeIDRef(Bits.data(), Bits.size()) < RHS;
177 unsigned *New = Allocator.Allocate<unsigned>(Bits.size());
179 return FoldingSetNodeIDRef(New, Bits.size());
230 "Initial hash table size out of range");
269 /// GrowHashTable - Double the size of the hash table and rehash everything.