Lines Matching refs:m_sha1
63 String m_sha1;
170 if (oldDigest->m_sha1 == newDigest->m_sha1)
208 m_unusedNodesMap.remove(newDigest->m_sha1);
229 for (size_t i = 0; i < oldList.size() && i < newList.size() && oldList[i]->m_sha1 == newList[i]->m_sha1; ++i) {
235 for (size_t i = 0; i < oldList.size() && i < newList.size() && oldList[oldList.size() - i - 1]->m_sha1 == newList[newList.size() - i - 1]->m_sha1; ++i) {
249 newTable.add(newList[i]->m_sha1, Vector<size_t>()).storedValue->value.append(i);
253 oldTable.add(oldList[i]->m_sha1, Vector<size_t>()).storedValue->value.append(i);
273 if (j < oldMap.size() && !oldMap[j].first && newList[i + 1]->m_sha1 == oldList[j]->m_sha1) {
284 if (!oldMap[j].first && newList[i - 1]->m_sha1 == oldList[j]->m_sha1) {
330 if (!m_unusedNodesMap.contains(oldList[i]->m_sha1) && (!i || oldMap[i - 1].first) && (i == oldMap.size() - 1 || oldMap[i + 1].first)) {
424 addStringToDigestor(digestor.get(), childInfo->m_sha1);
444 digest->m_sha1 = base64Encode(reinterpret_cast<const char*>(digestResult.data()), 10);
447 unusedNodesMap->add(digest->m_sha1, digest);
469 UnusedNodesMap::iterator it = m_unusedNodesMap.find(oldDigest->m_sha1);
493 m_unusedNodesMap.remove(first->m_sha1);