Lines Matching full:hash
8182 // Compute hash:
8197 // ecx = TranscendentalCache::hash(double value).
9379 // Make the hash mask from the length of the number string cache. It
9384 // Calculate the entry in the number string cache. The hash value in the
10595 // different hash algorithm. Don't try to look for these in the symbol table.
10607 // Calculate the two character string hash.
10608 Register hash = scratch1;
10609 GenerateHashInit(masm, hash, c1, scratch);
10610 GenerateHashAddCharacter(masm, hash, c2, scratch);
10611 GenerateHashGetHash(masm, hash, scratch);
10619 // hash: hash of two character string.
10639 // hash: hash of two character string
10650 __ mov(scratch, hash);
10669 // If entry is undefined no string with this hash can be found.
10712 Register hash,
10715 // hash = character + (character << 10);
10716 __ mov(hash, character);
10717 __ shl(hash, 10);
10718 __ add(hash, Operand(character));
10719 // hash ^= hash >> 6;
10720 __ mov(scratch, hash);
10722 __ xor_(hash, Operand(scratch));
10727 Register hash,
10730 // hash += character;
10731 __ add(hash, Operand(character));
10732 // hash += hash << 10;
10733 __ mov(scratch, hash);
10735 __ add(hash, Operand(scratch));
10736 // hash ^= hash >> 6;
10737 __ mov(scratch, hash);
10739 __ xor_(hash, Operand(scratch));
10744 Register hash,
10746 // hash += hash << 3;
10747 __ mov(scratch, hash);
10749 __ add(hash, Operand(scratch));
10750 // hash ^= hash >> 11;
10751 __ mov(scratch, hash);
10753 __ xor_(hash, Operand(scratch));
10754 // hash += hash << 15;
10755 __ mov(scratch, hash);
10757 __ add(hash, Operand(scratch));
10759 // if (hash == 0) hash = 27;
10761 __ test(hash, Operand(hash));
10763 __ mov(hash, Immediate(27));
