media/track: Replace wtf/Assertions.h macros in favor of base/logging.h macros

third_party/WebKit/Source/core/html/track/TextTrackList.cpp

 /*
  * Copyright (C) 2011, 2012 Apple 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 43 matching lines @@
 {
     if (textTrack->trackType() == TextTrack::TrackElement)
         return static_cast<LoadableTextTrack*>(textTrack)->trackElementIndex();
 
     if (textTrack->trackType() == TextTrack::AddTrack)
         return m_elementTracks.size() + m_addTrackTracks.find(textTrack);
 
     if (textTrack->trackType() == TextTrack::InBand)
         return m_elementTracks.size() + m_addTrackTracks.size() + m_inbandTracks.find(textTrack);
 
-    ASSERT_NOT_REACHED();
+    NOTREACHED();
 
     return -1;
 }
 
 int TextTrackList::getTrackIndexRelativeToRenderedTracks(TextTrack *textTrack)
 {
     // Calculate the "Let n be the number of text tracks whose text track mode is showing and that are in the media element's list of text tracks before track."
     int trackIndex = 0;
 
     for (size_t i = 0; i < m_elementTracks.size(); ++i) {
@@ skipping 16 matching lines @@
 
     for (size_t i = 0; i < m_inbandTracks.size(); ++i) {
         if (!m_inbandTracks[i]->isRendered())
             continue;
 
         if (m_inbandTracks[i] == textTrack)
             return trackIndex;
         ++trackIndex;
     }
 
-    ASSERT_NOT_REACHED();
+    NOTREACHED();
 
     return -1;
 }
 
 TextTrack* TextTrackList::anonymousIndexedGetter(unsigned index)
 {
     // 4.8.10.12.1 Text track model
     // The text tracks are sorted as follows:
     // 1. The text tracks corresponding to track element children of the media element, in tree order.
     // 2. Any text tracks added using the addTextTrack() method, in the order they were added, oldest first.
@@ skipping 40 matching lines @@
             m_addTrackTracks[i]->invalidateTrackIndex();
         for (size_t i = 0; i < m_inbandTracks.size(); ++i)
             m_inbandTracks[i]->invalidateTrackIndex();
     } else if (track->trackType() == TextTrack::AddTrack) {
         tracks = &m_addTrackTracks;
         for (size_t i = 0; i < m_inbandTracks.size(); ++i)
             m_inbandTracks[i]->invalidateTrackIndex();
     } else if (track->trackType() == TextTrack::InBand) {
         tracks = &m_inbandTracks;
     } else {
-        ASSERT_NOT_REACHED();
+        NOTREACHED();
     }
 
     size_t index = tracks->find(track);
     if (index == kNotFound)
         return;
 
     for (size_t i = index; i < tracks->size(); ++i)
         tracks->at(index)->invalidateTrackIndex();
 }
 
 void TextTrackList::append(TextTrack* track)
 {
     if (track->trackType() == TextTrack::AddTrack) {
         m_addTrackTracks.append(track);
     } else if (track->trackType() == TextTrack::TrackElement) {
         // Insert tracks added for <track> element in tree order.
         size_t index = static_cast<LoadableTextTrack*>(track)->trackElementIndex();
         m_elementTracks.insert(index, track);
     } else if (track->trackType() == TextTrack::InBand) {
         m_inbandTracks.append(track);
     } else {
-        ASSERT_NOT_REACHED();
+        NOTREACHED();
     }
 
     invalidateTrackIndexesAfterTrack(track);
 
-    ASSERT(!track->trackList());
+    DCHECK(!track->trackList());
     track->setTrackList(this);
 
     scheduleAddTrackEvent(track);
 }
 
 void TextTrackList::remove(TextTrack* track)
 {
     HeapVector<Member<TextTrack>>* tracks = nullptr;
 
     if (track->trackType() == TextTrack::TrackElement) {
         tracks = &m_elementTracks;
     } else if (track->trackType() == TextTrack::AddTrack) {
         tracks = &m_addTrackTracks;
     } else if (track->trackType() == TextTrack::InBand) {
         tracks = &m_inbandTracks;
     } else {
-        ASSERT_NOT_REACHED();
+        NOTREACHED();
     }
 
     size_t index = tracks->find(track);
     if (index == kNotFound)
         return;
 
     invalidateTrackIndexesAfterTrack(track);
 
-    ASSERT(track->trackList() == this);
+    DCHECK_EQ(track->trackList(), this);
     track->setTrackList(0);
 
     tracks->remove(index);
 
     scheduleRemoveTrackEvent(track);
 }
 
 void TextTrackList::removeAllInbandTracks()
 {
     for (unsigned i = 0; i < m_inbandTracks.size(); ++i) {
         m_inbandTracks[i]->setTrackList(0);
     }
     m_inbandTracks.clear();
 }
 
 bool TextTrackList::contains(TextTrack* track) const
 {
     const HeapVector<Member<TextTrack>>* tracks = nullptr;
 
     if (track->trackType() == TextTrack::TrackElement)
         tracks = &m_elementTracks;
     else if (track->trackType() == TextTrack::AddTrack)
         tracks = &m_addTrackTracks;
     else if (track->trackType() == TextTrack::InBand)
         tracks = &m_inbandTracks;
     else
-        ASSERT_NOT_REACHED();
+        NOTREACHED();
 
     return tracks->find(track) != kNotFound;
 }
 
 const AtomicString& TextTrackList::interfaceName() const
 {
     return EventTargetNames::TextTrackList;
 }
 
 ExecutionContext* TextTrackList::getExecutionContext() const
@@ skipping 70 matching lines @@
 
 DEFINE_TRACE_WRAPPERS(TextTrackList)
 {
     for (auto track : m_addTrackTracks)
         visitor->traceWrappers(track);
     for (auto track : m_elementTracks)
         visitor->traceWrappers(track);
     for (auto track : m_inbandTracks)
         visitor->traceWrappers(track);
 }