Lines Matching refs:uint32

130 	uint32 hash = Hash(name, nameLength);
148 status = fRootEntry->Lookup(hash, (uint32)root->indirection_levels,
159 uint32
162 uint32 hash;
189 uint32
193 uint32 hash = 0x12a3fe2d;
194 uint32 previous = 0x37abe8f9;
197 uint32 next = previous + (hash ^ (*name * 7152373));
210 /*inline*/ uint32
211 HTree::_MD4F(uint32 x, uint32 y, uint32 z)
217 /*inline*/ uint32
218 HTree::_MD4G(uint32 x, uint32 y, uint32 z)
224 /*inline*/ uint32
225 HTree::_MD4H(uint32 x, uint32 y, uint32 z)
232 HTree::_MD4RotateVars(uint32& a, uint32& b, uint32& c, uint32& d)
234 uint32 oldD = d;
243 HTree::_HalfMD4Transform(uint32 buffer[4], uint32 blocks[8])
245 uint32 a, b, c, d;
252 uint32 shifts[4] = { 3, 7, 11, 19 };
256 uint32 shift = shifts[i % 4];
270 uint32 shift = shifts[i / 2];
284 uint32 shift = shifts[i * 2 % 4];
303 uint32
307 uint32 buffer[4];
316 uint32 blocks[8];
318 _PrepareBlocksForHash(name, (uint32)length, blocks, 8);
329 HTree::_TEATransform(uint32 buffer[4], uint32 blocks[4])
331 uint32 x, y;
335 uint32 a, b, c, d;
341 uint32 sum = 0;
354 uint32
358 uint32 buffer[4];
367 uint32 blocks[4];
369 _PrepareBlocksForHash(name, (uint32)length, blocks, 4);
382 HTree::_PrepareBlocksForHash(const char* string, uint32 length, uint32* blocks,
383 uint32 numBlocks)
385 uint32 padding = length;
389 uint32 numBytes = numBlocks * 4;
393 uint32 completeIterations = length / 4;
395 for (uint32 i = 0; i < completeIterations; ++i) {
396 uint32 value = (padding << 8) + *(string++);
404 uint32 remainingBytes = length % 4;
406 uint32 value = padding;
407 for (uint32 i = 0; i < remainingBytes; ++i)
412 for (uint32 i = completeIterations + 1; i < numBlocks; ++i)