ASSERT -> DCHECK in core/editing.

third_party/WebKit/Source/core/editing/spellcheck/SpellCheckRequester.cpp

 /*
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 33 matching lines @@
     const Vector<uint32_t>& documentMarkersInRange,
     const Vector<unsigned>& documentMarkerOffsets,
     int requestNumber)
     : m_requester(nullptr)
     , m_checkingRange(checkingRange)
     , m_paragraphRange(paragraphRange)
     , m_rootEditableElement(m_checkingRange->startContainer()->rootEditableElement())
     , m_requestData(unrequestedTextCheckingSequence, text, mask, processType, documentMarkersInRange, documentMarkerOffsets)
     , m_requestNumber(requestNumber)
 {
-    ASSERT(m_checkingRange);
-    ASSERT(m_checkingRange->inShadowIncludingDocument());
-    ASSERT(m_paragraphRange);
-    ASSERT(m_paragraphRange->inShadowIncludingDocument());
-    ASSERT(m_rootEditableElement);
+    DCHECK(m_checkingRange);
+    DCHECK(m_checkingRange->inShadowIncludingDocument());
+    DCHECK(m_paragraphRange);
+    DCHECK(m_paragraphRange->inShadowIncludingDocument());
+    DCHECK(m_rootEditableElement);
 }
 
 SpellCheckRequest::~SpellCheckRequest()
 {
 }
 
 DEFINE_TRACE(SpellCheckRequest)
 {
     visitor->trace(m_requester);
     visitor->trace(m_checkingRange);
@@ skipping 64 matching lines @@
 {
     if (!m_requester)
         return;
     SpellCheckRequester* requester = m_requester;
     m_requester = nullptr;
     requester->didCheckCancel(m_requestData.sequence());
 }
 
 void SpellCheckRequest::setCheckerAndSequence(SpellCheckRequester* requester, int sequence)
 {
-    ASSERT(!m_requester);
-    ASSERT(m_requestData.sequence() == unrequestedTextCheckingSequence);
+    DCHECK(!m_requester);
+    DCHECK_EQ(m_requestData.sequence(), unrequestedTextCheckingSequence);
     m_requester = requester;
     m_requestData.m_sequence = sequence;
 }
 
 SpellCheckRequester::SpellCheckRequester(LocalFrame& frame)
     : m_frame(&frame)
     , m_lastRequestSequence(0)
     , m_lastProcessedSequence(0)
     , m_timerToProcessQueuedRequest(this, &SpellCheckRequester::timerFiredToProcessQueuedRequest)
 {
 }
 
 SpellCheckRequester::~SpellCheckRequester()
 {
 }
 
 TextCheckerClient& SpellCheckRequester::client() const
 {
     return frame().spellChecker().textChecker();
 }
 
 void SpellCheckRequester::timerFiredToProcessQueuedRequest(Timer<SpellCheckRequester>*)
 {
-    ASSERT(!m_requestQueue.isEmpty());
+    DCHECK(!m_requestQueue.isEmpty());
     if (m_requestQueue.isEmpty())
         return;
 
     invokeRequest(m_requestQueue.takeFirst());
 }
 
 bool SpellCheckRequester::canCheckAsynchronously(Range* range) const
 {
     return isCheckable(range);
 }
 
 bool SpellCheckRequester::isCheckable(Range* range) const
 {
     if (!range || !range->firstNode() || !range->firstNode()->layoutObject())
         return false;
     const Node* node = range->startContainer();
     if (node && node->isElementNode() && !toElement(node)->isSpellCheckingEnabled())
         return false;
     return true;
 }
 
 void SpellCheckRequester::requestCheckingFor(SpellCheckRequest* request)
 {
     if (!request || !canCheckAsynchronously(request->paragraphRange()))
         return;
 
-    ASSERT(request->data().sequence() == unrequestedTextCheckingSequence);
+    DCHECK_EQ(request->data().sequence(), unrequestedTextCheckingSequence);
     int sequence = ++m_lastRequestSequence;
     if (sequence == unrequestedTextCheckingSequence)
         sequence = ++m_lastRequestSequence;
 
     request->setCheckerAndSequence(this, sequence);
 
     if (m_timerToProcessQueuedRequest.isActive() || m_processingRequest) {
         enqueueRequest(request);
         return;
     }
@@ skipping 15 matching lines @@
     // leaks, just async work items waiting to be processed.
     //
     // Rather than somehow wait for this async queue to drain before running
     // the leak detector, they're all cancelled to prevent flaky leaks being
     // reported.
     m_requestQueue.clear();
 }
 
 void SpellCheckRequester::invokeRequest(SpellCheckRequest* request)
 {
-    ASSERT(!m_processingRequest);
+    DCHECK(!m_processingRequest);
     m_processingRequest = request;
     client().requestCheckingOfString(m_processingRequest);
 }
 
 void SpellCheckRequester::clearProcessingRequest()
 {
     if (!m_processingRequest)
         return;
 
     m_processingRequest->dispose();
     m_processingRequest.clear();
 }
 
 void SpellCheckRequester::enqueueRequest(SpellCheckRequest* request)
 {
-    ASSERT(request);
+    DCHECK(request);
     bool continuation = false;
     if (!m_requestQueue.isEmpty()) {
         SpellCheckRequest* lastRequest = m_requestQueue.last();
         // It's a continuation if the number of the last request got incremented in the new one and
         // both apply to the same editable.
         continuation = request->rootEditableElement() == lastRequest->rootEditableElement()
             && request->requestNumber() == lastRequest->requestNumber() + 1;
     }
 
     // Spellcheck requests for chunks of text in the same element should not overwrite each other.
     if (!continuation) {
         for (auto& requestQueue : m_requestQueue) {
             if (request->rootEditableElement() != requestQueue->rootEditableElement())
                 continue;
 
             requestQueue = request;
             return;
         }
     }
 
     m_requestQueue.append(request);
 }
 
 void SpellCheckRequester::didCheck(int sequence, const Vector<TextCheckingResult>& results)
 {
-    ASSERT(m_processingRequest);
-    ASSERT(m_processingRequest->data().sequence() == sequence);
+    DCHECK(m_processingRequest);
+    DCHECK_EQ(m_processingRequest->data().sequence(), sequence);
     if (m_processingRequest->data().sequence() != sequence) {
         m_requestQueue.clear();
         return;
     }
 
     frame().spellChecker().markAndReplaceFor(m_processingRequest, results);
 
     if (m_lastProcessedSequence < sequence)
         m_lastProcessedSequence = sequence;
 
@@ skipping 26 matching lines @@
 }
 
 DEFINE_TRACE(SpellCheckRequester)
 {
     visitor->trace(m_frame);
     visitor->trace(m_processingRequest);
     visitor->trace(m_requestQueue);
 }
 
 } // namespace blink