Initial switch to Chromium-style CHECK_* and DCHECK_* macros.

src/objects-inl.h

Index: src/objects-inl.h
diff --git a/src/objects-inl.h b/src/objects-inl.h
index a0e2a38bc092df4249d142bcc225bdc4efa0b755..10f0b33d678994773c2332a3947c0e8b9c30ae2d 100644
--- a/src/objects-inl.h
+++ b/src/objects-inl.h
@@ -2951,7 +2951,7 @@ int LinearSearch(T* array, Name* name, int len, int valid_entries,
     return T::kNotFound;
   } else {
     DCHECK(len >= valid_entries);
-    DCHECK_EQ(NULL, out_insertion_index);  // Not supported here.
+    DCHECK(!out_insertion_index);  // Not supported here.
     for (int number = 0; number < valid_entries; number++) {
       Name* entry = array->GetKey(number);
       uint32_t current_hash = entry->Hash();
@@ -6776,7 +6776,7 @@ uint32_t StringHasher::GetHashCore(uint32_t running_hash) {
 
 uint32_t StringHasher::ComputeRunningHash(uint32_t running_hash,
                                           const uc16* chars, int length) {
-  DCHECK_NOT_NULL(chars);
+  DCHECK(chars);
   DCHECK(length >= 0);
   for (int i = 0; i < length; ++i) {
     running_hash = AddCharacterCore(running_hash, *chars++);
@@ -6788,7 +6788,7 @@ uint32_t StringHasher::ComputeRunningHash(uint32_t running_hash,
 uint32_t StringHasher::ComputeRunningHashOneByte(uint32_t running_hash,
                                                  const char* chars,
                                                  int length) {
-  DCHECK_NOT_NULL(chars);
+  DCHECK(chars);
   DCHECK(length >= 0);
   for (int i = 0; i < length; ++i) {
     uint16_t c = static_cast<uint16_t>(*chars++);