Rename ASSERT_NO_EXCEPTION_STATE and IGNORE_EXCEPTION_STATE

Source/core/html/TimeRanges.cpp

 /*
  * Copyright (C) 2007, 2009, 2010 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 148 matching lines @@
         }
     }
 
     // Now that we are sure we don't overlap with any range, just add it.
     m_ranges.insert(overlappingArcIndex, addedRange);
 }
 
 bool TimeRanges::contain(double time) const
 {
     for (unsigned n = 0; n < length(); n++) {
-        if (time >= start(n, IGNORE_EXCEPTION_STATE) && time <= end(n, IGNORE_EXCEPTION_STATE))
+        if (time >= start(n, IGNORE_EXCEPTION) && time <= end(n, IGNORE_EXCEPTION))
             return true;
     }
     return false;
 }
 
 double TimeRanges::nearest(double time) const
 {
     double closest = 0;
     unsigned count = length();
     for (unsigned ndx = 0; ndx < count; ndx++) {
-        double startTime = start(ndx, IGNORE_EXCEPTION_STATE);
-        double endTime = end(ndx, IGNORE_EXCEPTION_STATE);
+        double startTime = start(ndx, IGNORE_EXCEPTION);
+        double endTime = end(ndx, IGNORE_EXCEPTION);
         if (time >= startTime && time <= endTime)
             return time;
         if (fabs(startTime - time) < closest)
             closest = fabsf(startTime - time);
         else if (fabs(endTime - time) < closest)
             closest = fabsf(endTime - time);
     }
     return closest;
 }