28 const int kBlockSize = BlockHash::kBlockSize;
36     dh_.reset(BlockHash::CreateDictionaryHash(sample_text,  in BlockHashTest()
38     th_.reset(BlockHash::CreateTargetHash(sample_text, strlen(sample_text), 0));  in BlockHashTest()
46     return BlockHash::BlockContentsMatch(block1, block2);  in BlockContentsMatch()
49   int FirstMatchingBlock(const BlockHash& block_hash,  in FirstMatchingBlock()
55   int NextMatchingBlock(const BlockHash& block_hash,  in NextMatchingBlock()
64     return BlockHash::MatchingBytesToLeft(source_match_start,  in MatchingBytesToLeft()
72     return BlockHash::MatchingBytesToRight(source_match_end,  in MatchingBytesToRight()
235   std::auto_ptr<const BlockHash> dh_;  // hash table is populated at startup
236   std::auto_ptr<BlockHash> th_;  // hash table not populated;
239   BlockHash::Match best_match_;
332       if (!BlockHash::BlockCompareWords(block1, block2)) {  in TestAndPrintTimesForCompareFunctions()
350       if (!BlockHash::BlockContentsMatch(block1, block2)) {  in TestAndPrintTimesForCompareFunctions()
726   BlockHash zero_sized_hash(sample_text, 0, 0);  in TEST_F()
738   BlockHash bh(sample_text, strlen(sample_text), 0);  in TEST_F()
744   BlockHash bh(sample_text, strlen(sample_text), 0);  in TEST_F()
774   BlockHash th2(sample_text, strlen(sample_text), 0x10000);  in TEST_F()
823   BlockHash many_matches_hash(sample_text_many_matches,  in TEST_F()
893   BlockHash huge_bh(huge_dictionary, kTestSize, 0);  in TEST_F()