Update BidiResolver's max level depth to 125 per tr9r29

Source/platform/text/BidiResolver.h

 /*
  * Copyright (C) 2000 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2003, 2004, 2006, 2007, 2008 Apple Inc.  All right reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 415 matching lines @@
             if (BidiContext* parentContext = toContext->parent())
                 toContext = parentContext;
         } else {
             Direction direction = (embedding.direction() == RightToLeftEmbedding || embedding.direction() == RightToLeftOverride) ? RightToLeft : LeftToRight;
             bool override = embedding.direction() == LeftToRightOverride || embedding.direction() == RightToLeftOverride;
             unsigned char level = toContext->level();
             if (direction == RightToLeft)
                 level = nextGreaterOddLevel(level);
             else
                 level = nextGreaterEvenLevel(level);
-            if (level < 61)
+            if (level < BidiContext::kMaxLevel)
                 toContext = BidiContext::create(level, direction, override, embedding.source(), toContext.get());
         }
     }
 
     unsigned char toLevel = toContext->level();
 
     if (toLevel > fromLevel)
         raiseExplicitEmbeddingLevel(fromLevel % 2 ? RightToLeft : LeftToRight, toLevel % 2 ? RightToLeft : LeftToRight);
     else if (toLevel < fromLevel)
         lowerExplicitEmbeddingLevel(fromLevel % 2 ? RightToLeft : LeftToRight);
@@ skipping 43 matching lines @@
     case EuropeanNumber:
         // fall through
     default:
         m_status.last = dirCurrent;
     }
 }
 
 template <class Iterator, class Run>
 inline void BidiResolver<Iterator, Run>::reorderRunsFromLevels()
 {
-    unsigned char levelLow = 128;
+    unsigned char levelLow = BidiContext::kMaxLevel;
     unsigned char levelHigh = 0;
     for (Run* run = m_runs.firstRun(); run; run = run->next()) {
         levelHigh = std::max(run->level(), levelHigh);
         levelLow = std::min(run->level(), levelLow);
     }
 
     // This implements reordering of the line (L2 according to Bidi spec):
     // http://unicode.org/reports/tr9/#L2
     // L2. From the highest level found in the text to the lowest odd level on each line,
     // reverse any contiguous sequence of characters that are at that level or higher.
@@ skipping 461 matching lines @@
 template<class Iterator, class Run>
 MidpointState<Iterator> BidiResolver<Iterator, Run>::midpointStateForIsolatedRun(Run* run)
 {
     return m_midpointStateForIsolatedRun.take(run);
 }
 
 
 } // namespace WebCore
 
 #endif // BidiResolver_h