Diff
Modified: trunk/Source/_javascript_Core/ChangeLog (177315 => 177316)
--- trunk/Source/_javascript_Core/ChangeLog 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/ChangeLog 2014-12-15 23:24:12 UTC (rev 177316)
@@ -1,3 +1,18 @@
+2014-12-15 Commit Queue <[email protected]>
+
+ Unreviewed, rolling out r177284.
+ https://bugs.webkit.org/show_bug.cgi?id=139658
+
+ "Breaks API tests and LayoutTests on Yosemite Debug"
+ (Requested by msaboff on #webkit).
+
+ Reverted changeset:
+
+ "Make sure range based iteration of Vector<> still receives
+ bounds checking"
+ https://bugs.webkit.org/show_bug.cgi?id=138821
+ http://trac.webkit.org/changeset/177284
+
2014-12-15 Dániel Bátyai <[email protected]>
[EFL] FTL JIT not working on ARM64
Modified: trunk/Source/_javascript_Core/bytecode/UnlinkedCodeBlock.cpp (177315 => 177316)
--- trunk/Source/_javascript_Core/bytecode/UnlinkedCodeBlock.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/bytecode/UnlinkedCodeBlock.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -229,9 +229,9 @@
Base::visitChildren(thisObject, visitor);
visitor.append(&thisObject->m_symbolTable);
for (FunctionExpressionVector::iterator ptr = thisObject->m_functionDecls.begin(), end = thisObject->m_functionDecls.end(); ptr != end; ++ptr)
- visitor.append(WTF::getPtr(ptr));
+ visitor.append(ptr);
for (FunctionExpressionVector::iterator ptr = thisObject->m_functionExprs.begin(), end = thisObject->m_functionExprs.end(); ptr != end; ++ptr)
- visitor.append(WTF::getPtr(ptr));
+ visitor.append(ptr);
visitor.appendValues(thisObject->m_constantRegisters.data(), thisObject->m_constantRegisters.size());
if (thisObject->m_rareData) {
for (size_t i = 0, end = thisObject->m_rareData->m_regexps.size(); i != end; i++)
Modified: trunk/Source/_javascript_Core/bytecompiler/BytecodeGenerator.cpp (177315 => 177316)
--- trunk/Source/_javascript_Core/bytecompiler/BytecodeGenerator.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/bytecompiler/BytecodeGenerator.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -2283,8 +2283,8 @@
int topScopeIndex = -1;
int bottomScopeIndex = -1;
if (flipScopes) {
- topScopeIndex = topScope - m_scopeContextStack.data();
- bottomScopeIndex = bottomScope - m_scopeContextStack.data();
+ topScopeIndex = topScope - m_scopeContextStack.begin();
+ bottomScopeIndex = bottomScope - m_scopeContextStack.begin();
savedScopeContextStack = m_scopeContextStack;
m_scopeContextStack.shrink(finallyContext.scopeContextStackSize);
}
@@ -2328,7 +2328,7 @@
if (flipScopes) {
m_scopeContextStack = savedScopeContextStack;
topScope = &m_scopeContextStack[topScopeIndex]; // assert it's within bounds
- bottomScope = m_scopeContextStack.data() + bottomScopeIndex; // don't assert, since it the index might be -1.
+ bottomScope = m_scopeContextStack.begin() + bottomScopeIndex; // don't assert, since it the index might be -1.
}
if (flipSwitches)
m_switchContextStack = savedSwitchContextStack;
Modified: trunk/Source/_javascript_Core/dfg/DFGSpeculativeJIT.cpp (177315 => 177316)
--- trunk/Source/_javascript_Core/dfg/DFGSpeculativeJIT.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/dfg/DFGSpeculativeJIT.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -4910,7 +4910,7 @@
addBranch(
m_jit.branch32(JITCompiler::AboveOrEqual, value, Imm32(table.ctiOffsets.size())),
data->fallThrough.block);
- m_jit.move(TrustedImmPtr(table.ctiOffsets.data()), scratch);
+ m_jit.move(TrustedImmPtr(table.ctiOffsets.begin()), scratch);
m_jit.loadPtr(JITCompiler::BaseIndex(scratch, value, JITCompiler::timesPtr()), scratch);
m_jit.jump(scratch);
data->didUseJumpTable = true;
Modified: trunk/Source/_javascript_Core/ftl/FTLAbbreviations.h (177315 => 177316)
--- trunk/Source/_javascript_Core/ftl/FTLAbbreviations.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/ftl/FTLAbbreviations.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -120,7 +120,7 @@
static inline LValue mdString(LContext context, const char* string) { return mdString(context, string, std::strlen(string)); }
static inline LValue mdNode(LContext context, LValue* args, unsigned numArgs) { return llvm->MDNodeInContext(context, args, numArgs); }
template<typename VectorType>
-static inline LValue mdNode(LContext context, const VectorType& vector) { return mdNode(context, const_cast<LValue*>(vector.data()), vector.size()); }
+static inline LValue mdNode(LContext context, const VectorType& vector) { return mdNode(context, const_cast<LValue*>(vector.begin()), vector.size()); }
static inline LValue mdNode(LContext context) { return mdNode(context, 0, 0); }
static inline LValue mdNode(LContext context, LValue arg1) { return mdNode(context, &arg1, 1); }
static inline LValue mdNode(LContext context, LValue arg1, LValue arg2)
@@ -288,7 +288,7 @@
template<typename VectorType>
inline LValue buildCall(LBuilder builder, LValue function, const VectorType& vector)
{
- return buildCall(builder, function, vector.data(), vector.size());
+ return buildCall(builder, function, vector.begin(), vector.size());
}
static inline LValue buildCall(LBuilder builder, LValue function)
{
Modified: trunk/Source/_javascript_Core/llint/LLIntData.cpp (177315 => 177316)
--- trunk/Source/_javascript_Core/llint/LLIntData.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/llint/LLIntData.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -161,7 +161,7 @@
Vector<int> testVector;
testVector.resize(42);
ASSERT(bitwise_cast<uint32_t*>(&testVector)[sizeof(void*)/sizeof(uint32_t) + 1] == 42);
- ASSERT(bitwise_cast<int**>(&testVector)[0] == testVector.data());
+ ASSERT(bitwise_cast<int**>(&testVector)[0] == testVector.begin());
#endif
ASSERT(StringImpl::s_hashFlag8BitBuffer == 32);
Modified: trunk/Source/_javascript_Core/parser/Parser.h (177315 => 177316)
--- trunk/Source/_javascript_Core/parser/Parser.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/parser/Parser.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -130,8 +130,10 @@
if (rhs.m_labels) {
m_labels = std::make_unique<LabelStack>();
- for (auto label : *rhs.m_labels)
- m_labels->append(ScopeLabelInfo(label.m_ident, label.m_isLoop));
+ typedef LabelStack::const_iterator iterator;
+ iterator end = rhs.m_labels->end();
+ for (iterator it = rhs.m_labels->begin(); it != end; ++it)
+ m_labels->append(ScopeLabelInfo(it->m_ident, it->m_isLoop));
}
}
Modified: trunk/Source/_javascript_Core/runtime/JSArray.cpp (177315 => 177316)
--- trunk/Source/_javascript_Core/runtime/JSArray.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/runtime/JSArray.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -351,7 +351,7 @@
// properties, so we have to perform deletion with caution, if not we can
// delete values in any order.
if (map->sparseMode()) {
- qsort(keys.data(), keys.size(), sizeof(unsigned), compareKeysForQSort);
+ qsort(keys.begin(), keys.size(), sizeof(unsigned), compareKeysForQSort);
unsigned i = keys.size();
while (i) {
unsigned index = keys[--i];
@@ -1190,13 +1190,13 @@
#if HAVE(MERGESORT)
if (isSortingPrimitiveValues)
- qsort(values.data(), values.size(), sizeof(ValueStringPair), compareByStringPairForQSort);
+ qsort(values.begin(), values.size(), sizeof(ValueStringPair), compareByStringPairForQSort);
else
- mergesort(values.data(), values.size(), sizeof(ValueStringPair), compareByStringPairForQSort);
+ mergesort(values.begin(), values.size(), sizeof(ValueStringPair), compareByStringPairForQSort);
#else
// FIXME: The qsort library function is likely to not be a stable sort.
// ECMAScript-262 does not specify a stable sort, but in practice, browsers perform a stable sort.
- qsort(values.data(), values.size(), sizeof(ValueStringPair), compareByStringPairForQSort);
+ qsort(values.begin(), values.size(), sizeof(ValueStringPair), compareByStringPairForQSort);
#endif
// If the toString function changed the length of the array or vector storage,
Modified: trunk/Source/_javascript_Core/tools/ProfileTreeNode.h (177315 => 177316)
--- trunk/Source/_javascript_Core/tools/ProfileTreeNode.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/tools/ProfileTreeNode.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -86,7 +86,7 @@
Vector<MapEntry*> entries;
for (Map::iterator it = m_children->begin(); it != m_children->end(); ++it)
entries.append(&*it);
- qsort(entries.data(), entries.size(), sizeof(MapEntry*), compareEntries);
+ qsort(entries.begin(), entries.size(), sizeof(MapEntry*), compareEntries);
// Iterate over the children in sample-frequency order.
for (size_t e = 0; e < entries.size(); ++e) {
Modified: trunk/Source/_javascript_Core/yarr/YarrJIT.cpp (177315 => 177316)
--- trunk/Source/_javascript_Core/yarr/YarrJIT.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/_javascript_Core/yarr/YarrJIT.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -223,7 +223,7 @@
if (charClass->m_ranges.size()) {
unsigned matchIndex = 0;
JumpList failures;
- matchCharacterClassRange(character, failures, matchDest, charClass->m_ranges.data(), charClass->m_ranges.size(), &matchIndex, charClass->m_matches.data(), charClass->m_matches.size());
+ matchCharacterClassRange(character, failures, matchDest, charClass->m_ranges.begin(), charClass->m_ranges.size(), &matchIndex, charClass->m_matches.begin(), charClass->m_matches.size());
while (matchIndex < charClass->m_matches.size())
matchDest.append(branch32(Equal, character, Imm32((unsigned short)charClass->m_matches[matchIndex++])));
Modified: trunk/Source/WTF/ChangeLog (177315 => 177316)
--- trunk/Source/WTF/ChangeLog 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/ChangeLog 2014-12-15 23:24:12 UTC (rev 177316)
@@ -1,3 +1,18 @@
+2014-12-15 Commit Queue <[email protected]>
+
+ Unreviewed, rolling out r177284.
+ https://bugs.webkit.org/show_bug.cgi?id=139658
+
+ "Breaks API tests and LayoutTests on Yosemite Debug"
+ (Requested by msaboff on #webkit).
+
+ Reverted changeset:
+
+ "Make sure range based iteration of Vector<> still receives
+ bounds checking"
+ https://bugs.webkit.org/show_bug.cgi?id=138821
+ http://trac.webkit.org/changeset/177284
+
2014-12-15 Andreas Kling <[email protected]>
Purge PassRefPtr from FocusEvent code.
Modified: trunk/Source/WTF/WTF.vcxproj/WTF.vcxproj (177315 => 177316)
--- trunk/Source/WTF/WTF.vcxproj/WTF.vcxproj 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/WTF.vcxproj/WTF.vcxproj 2014-12-15 23:24:12 UTC (rev 177316)
@@ -221,7 +221,6 @@
<ClInclude Include="..\wtf\HashTable.h" />
<ClInclude Include="..\wtf\HashTraits.h" />
<ClInclude Include="..\wtf\HexNumber.h" />
- <ClInclude Include="..\wtf\IndexedIterator.h" />
<ClInclude Include="..\wtf\IteratorAdaptors.h" />
<ClInclude Include="..\wtf\IteratorRange.h" />
<ClInclude Include="..\wtf\ListHashSet.h" />
Modified: trunk/Source/WTF/WTF.vcxproj/WTF.vcxproj.filters (177315 => 177316)
--- trunk/Source/WTF/WTF.vcxproj/WTF.vcxproj.filters 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/WTF.vcxproj/WTF.vcxproj.filters 2014-12-15 23:24:12 UTC (rev 177316)
@@ -470,9 +470,6 @@
<ClInclude Include="..\wtf\HexNumber.h">
<Filter>wtf</Filter>
</ClInclude>
- <ClInclude Include="..\wtf\IndexedIterator.h">
- <Filter>wtf</Filter>
- </ClInclude>
<ClInclude Include="..\wtf\IteratorAdaptors.h">
<Filter>wtf</Filter>
</ClInclude>
Modified: trunk/Source/WTF/WTF.xcodeproj/project.pbxproj (177315 => 177316)
--- trunk/Source/WTF/WTF.xcodeproj/project.pbxproj 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/WTF.xcodeproj/project.pbxproj 2014-12-15 23:24:12 UTC (rev 177316)
@@ -100,7 +100,6 @@
A748745217A0BDAE00FA04CB /* SixCharacterHash.cpp in Sources */ = {isa = PBXBuildFile; fileRef = A748744F17A0BDAE00FA04CB /* SixCharacterHash.cpp */; };
A748745317A0BDAE00FA04CB /* SixCharacterHash.h in Headers */ = {isa = PBXBuildFile; fileRef = A748745017A0BDAE00FA04CB /* SixCharacterHash.h */; };
A748745417A0BDAE00FA04CB /* StringHashDumpContext.h in Headers */ = {isa = PBXBuildFile; fileRef = A748745117A0BDAE00FA04CB /* StringHashDumpContext.h */; };
- A7DC2F041A09A22D0072F4E3 /* IndexedIterator.h in Headers */ = {isa = PBXBuildFile; fileRef = A7DC2F031A099DE30072F4E3 /* IndexedIterator.h */; };
A7E643C617C5423B003BB16B /* Compression.cpp in Sources */ = {isa = PBXBuildFile; fileRef = A7E643C417C5423B003BB16B /* Compression.cpp */; };
A7E643C717C5423B003BB16B /* Compression.h in Headers */ = {isa = PBXBuildFile; fileRef = A7E643C517C5423B003BB16B /* Compression.h */; };
A876DBD8151816E500DADB95 /* Platform.h in Headers */ = {isa = PBXBuildFile; fileRef = A876DBD7151816E500DADB95 /* Platform.h */; };
@@ -394,7 +393,6 @@
A748744F17A0BDAE00FA04CB /* SixCharacterHash.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = SixCharacterHash.cpp; sourceTree = "<group>"; };
A748745017A0BDAE00FA04CB /* SixCharacterHash.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = SixCharacterHash.h; sourceTree = "<group>"; };
A748745117A0BDAE00FA04CB /* StringHashDumpContext.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = StringHashDumpContext.h; sourceTree = "<group>"; };
- A7DC2F031A099DE30072F4E3 /* IndexedIterator.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = IndexedIterator.h; sourceTree = "<group>"; };
A7E643C417C5423B003BB16B /* Compression.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = Compression.cpp; sourceTree = "<group>"; };
A7E643C517C5423B003BB16B /* Compression.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = Compression.h; sourceTree = "<group>"; };
A876DBD7151816E500DADB95 /* Platform.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = Platform.h; sourceTree = "<group>"; };
@@ -900,7 +898,6 @@
974CFC8D16A4F327006D5404 /* WeakPtr.h */,
A8A4737A151A825B004123FF /* WTFThreadData.cpp */,
A8A4737B151A825B004123FF /* WTFThreadData.h */,
- A7DC2F031A099DE30072F4E3 /* IndexedIterator.h */,
);
path = wtf;
sourceTree = "<group>";
@@ -1074,7 +1071,6 @@
A8A473AD151A825B004123FF /* cached-powers.h in Headers */,
A8A4745E151A825B004123FF /* CharacterNames.h in Headers */,
A8A47394151A825B004123FF /* CheckedArithmetic.h in Headers */,
- A7DC2F041A09A22D0072F4E3 /* IndexedIterator.h in Headers */,
A8A47395151A825B004123FF /* CheckedBoolean.h in Headers */,
A8A4745F151A825B004123FF /* Collator.h in Headers */,
0FC4EDE61696149600F65041 /* CommaPrinter.h in Headers */,
Deleted: trunk/Source/WTF/wtf/IndexedIterator.h (177315 => 177316)
--- trunk/Source/WTF/wtf/IndexedIterator.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/wtf/IndexedIterator.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -1,358 +0,0 @@
-/*
- * Copyright (C) 2014 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
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
- * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
- * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef WTF_IndexedIterator_h
-#define WTF_IndexedIterator_h
-
-namespace WTF {
-
-#define INDEXED_ITERATOR_OVERFLOW(check) do {\
- if (!(check))\
- OverflowHandler::overflowed();\
-} while (0)
-
-template <typename VectorType, typename T, typename OverflowHandler = CrashOnOverflow> struct IndexedIterator {
- typedef struct IndexedIterator<const VectorType, const T, OverflowHandler> const_iterator;
-
- typedef T ValueType;
- typedef ptrdiff_t difference_type;
- typedef ValueType value_type;
- typedef ValueType* pointer;
- typedef ValueType& reference;
- typedef std::bidirectional_iterator_tag iterator_category;
-
- IndexedIterator()
- : m_vector(nullptr)
- , m_position(0)
- {
- }
-
- IndexedIterator(VectorType& vector, ValueType* position)
- : m_vector(&vector)
- , m_position(position - vector.data())
- {
- }
-
- IndexedIterator(const IndexedIterator& other)
- : m_vector(other.m_vector)
- , m_position(other.m_position)
- {
- }
-
- ValueType* operator->() const { return &m_vector->at(m_position); }
- ValueType& operator*() const { return m_vector->at(m_position); }
- ValueType* get() const
- {
- if (!m_vector)
- return nullptr;
- INDEXED_ITERATOR_OVERFLOW(m_position <= m_vector->size());
- return m_vector->data() + m_position;
- }
-
- IndexedIterator& operator++()
- {
- m_position++;
- return *this;
- }
-
- IndexedIterator operator++(int)
- {
- IndexedIterator result(*this);
- m_position++;
- return result;
- }
-
- IndexedIterator& operator--()
- {
- m_position--;
- return *this;
- }
-
- IndexedIterator operator--(int)
- {
- IndexedIterator result(*this);
- m_position--;
- return result;
- }
-
- // This conversion operator allows implicit conversion to bool but not to other integer types.
- typedef size_t (IndexedIterator::*UnspecifiedBoolType);
- operator UnspecifiedBoolType() const { return m_vector ? &IndexedIterator::m_position : nullptr; }
-
-#if __SIZEOF_SIZE_T__ != __SIZEOF_INT__ || PLATFORM(COCOA)
-#define _UNSIGNED_If_DIFFERENT(macro) macro(unsigned)
-#else
-#define _UNSIGNED_If_DIFFERENT(macro)
-#endif
-
-#define FOR_EACH_INTEGER_TYPE(macro) \
- macro(size_t) \
- macro(int32_t) \
- macro(long) \
- macro(long long) \
- macro(unsigned long long) \
- _UNSIGNED_If_DIFFERENT(macro)
-
-#define MODIFIER_OPS(type) \
- IndexedIterator& operator+=(type increment) \
- { \
- m_position += increment; \
- return *this; \
- } \
-\
- IndexedIterator& operator-=(type decrement) \
- { \
- m_position -= decrement; \
- return *this; \
- }
-
- FOR_EACH_INTEGER_TYPE(MODIFIER_OPS)
-
-#undef MODIFIER_OPS
-
-#define ARITHMETIC_OPS(type) \
- IndexedIterator operator+(type increment) const \
- { \
- IndexedIterator result(*this); \
- result.m_position += increment; \
- return result; \
- } \
-\
- IndexedIterator operator-(type decrement) const \
- { \
- IndexedIterator result(*this); \
- result.m_position -= decrement; \
- return result; \
- }
-
-
- FOR_EACH_INTEGER_TYPE(ARITHMETIC_OPS)
-
-#undef ARITHMETIC_OPS
-
- ptrdiff_t operator-(const const_iterator& right) const
- {
- return m_position - right.m_position;
- }
-
- ptrdiff_t operator-(const ValueType* right) const
- {
- return get() - right;
- }
-
- void operator=(const IndexedIterator& other)
- {
- m_vector = other.m_vector;
- m_position = other.m_position;
- }
-
- bool operator==(const const_iterator& other) const
- {
- return unsafeGet() == other.unsafeGet();
- }
-
- bool operator!=(const const_iterator& other) const
- {
- return unsafeGet() != other.unsafeGet();
- }
-
- bool operator==(const ValueType* other) const
- {
- return unsafeGet() == other;
- }
-
- bool operator!=(const ValueType* other) const
- {
- return unsafeGet() != other;
- }
-
- bool operator<(const ValueType* other) const
- {
- return unsafeGet() < other;
- }
-
- bool operator<=(const ValueType* other) const
- {
- return unsafeGet() <= other;
- }
-
- bool operator<(const const_iterator& other) const
- {
- return unsafeGet() < other.unsafeGet();
- }
-
- bool operator<=(const const_iterator& other) const
- {
- return unsafeGet() <= other.unsafeGet();
- }
-
- bool operator>(const IndexedIterator& other) const
- {
- return unsafeGet() > other.unsafeGet();
- }
-
- bool operator>=(const const_iterator& other) const
- {
- return unsafeGet() >= other.unsafeGet();
- }
-
- bool operator>(const ValueType* other) const
- {
- return unsafeGet() > other;
- }
-
- bool operator>=(const ValueType* other) const
- {
- return unsafeGet() >= other;
- }
-
- operator const_iterator() const
- {
- const_iterator result;
- result.m_vector = m_vector;
- result.m_position = m_position;
- return result;
- }
-
- VectorType* m_vector;
- size_t m_position;
-
- ValueType* unsafeGet() const
- {
- if (!m_vector)
- return nullptr;
- return get();
- }
-};
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline typename IndexedIterator<T, ValueType, OverflowHandler>::ValueType* getPtr(IndexedIterator<T, ValueType, OverflowHandler> p)
-{
- return p.get();
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline ptrdiff_t operator-(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return left - right.get();
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline ptrdiff_t operator-(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return left - right.get();
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline ptrdiff_t operator-(const ValueType* left, const IndexedIterator<const T, const ValueType, OverflowHandler>& right)
-{
- return left - right.get();
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator==(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right == left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator==(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right == left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator!=(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right != left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator!=(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right != left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator<=(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right >= left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator<=(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right >= left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator>=(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right <= left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator>=(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right <= left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator<(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right > left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator<(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right > left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator>(ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right < left;
-}
-
-template <typename T, typename ValueType, typename OverflowHandler>
-inline bool operator>(const ValueType* left, const IndexedIterator<T, ValueType, OverflowHandler>& right)
-{
- return right < left;
-}
-
-template <typename VectorType, typename OverflowHandler> struct IndexedIteratorSelector {
- typedef typename VectorType::ValueType ValueType;
- typedef IndexedIterator<VectorType, ValueType, OverflowHandler> iterator;
- typedef typename iterator::const_iterator const_iterator;
- static iterator makeIterator(VectorType& vector, ValueType* p) { return iterator(vector, p); }
- static const_iterator makeConstIterator(const VectorType& vector, const ValueType* p) { return const_iterator(vector, p); }
-};
-
-#undef INDEXED_ITERATOR_OVERFLOW
-
-}
-
-#endif
Modified: trunk/Source/WTF/wtf/RefCountedArray.h (177315 => 177316)
--- trunk/Source/WTF/wtf/RefCountedArray.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/wtf/RefCountedArray.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -83,7 +83,7 @@
Header::fromPayload(m_data)->refCount = 1;
Header::fromPayload(m_data)->length = other.size();
ASSERT(Header::fromPayload(m_data)->length == other.size());
- VectorTypeOperations<T>::uninitializedCopy(getPtr(other.begin()), getPtr(other.end()), m_data);
+ VectorTypeOperations<T>::uninitializedCopy(other.begin(), other.end(), m_data);
}
RefCountedArray& operator=(const RefCountedArray& other)
Modified: trunk/Source/WTF/wtf/Vector.h (177315 => 177316)
--- trunk/Source/WTF/wtf/Vector.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WTF/wtf/Vector.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -28,8 +28,6 @@
#include <utility>
#include <wtf/CheckedArithmetic.h>
#include <wtf/FastMalloc.h>
-#include <wtf/GetPtr.h>
-#include <wtf/IndexedIterator.h>
#include <wtf/MallocPtr.h>
#include <wtf/Noncopyable.h>
#include <wtf/StdLibExtras.h>
@@ -555,17 +553,14 @@
class Vector : private VectorBuffer<T, inlineCapacity> {
WTF_MAKE_FAST_ALLOCATED;
private:
-
typedef VectorBuffer<T, inlineCapacity> Base;
typedef VectorTypeOperations<T> TypeOperations;
- typedef IndexedIteratorSelector<Vector, OverflowHandler> IteratorSelector;
public:
typedef T ValueType;
- typedef typename IteratorSelector::iterator iterator;
- typedef typename IteratorSelector::const_iterator const_iterator;
-
+ typedef T* iterator;
+ typedef const T* const_iterator;
typedef std::reverse_iterator<iterator> reverse_iterator;
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
@@ -578,14 +573,14 @@
: Base(size, size)
{
if (begin())
- TypeOperations::initialize(getPtr(begin()), getPtr(end()));
+ TypeOperations::initialize(begin(), end());
}
Vector(size_t size, const T& val)
: Base(size, size)
{
if (begin())
- TypeOperations::uninitializedFill(getPtr(begin()), getPtr(end()), val);
+ TypeOperations::uninitializedFill(begin(), end(), val);
}
Vector(std::initializer_list<T> initializerList)
@@ -649,10 +644,10 @@
const T* data() const { return Base::buffer(); }
static ptrdiff_t dataMemoryOffset() { return Base::bufferMemoryOffset(); }
- iterator begin() { return IteratorSelector::makeIterator(*this, data()); }
- iterator end() { return begin() + size(); }
- const_iterator begin() const { return IteratorSelector::makeConstIterator(*this, data()); }
- const_iterator end() const { return begin() + size(); }
+ iterator begin() { return data(); }
+ iterator end() { return begin() + m_size; }
+ const_iterator begin() const { return data(); }
+ const_iterator end() const { return begin() + m_size; }
reverse_iterator rbegin() { return reverse_iterator(end()); }
reverse_iterator rend() { return reverse_iterator(begin()); }
@@ -687,7 +682,6 @@
void clear() { shrinkCapacity(0); }
- void append(const_iterator, size_t);
template<typename U> void append(const U*, size_t);
template<typename U> void append(U&&);
template<typename U> void uncheckedAppend(U&& val);
@@ -751,7 +745,7 @@
: Base(other.capacity(), other.size())
{
if (begin())
- TypeOperations::uninitializedCopy(getPtr(other.begin()), getPtr(other.end()), getPtr(begin()));
+ TypeOperations::uninitializedCopy(other.begin(), other.end(), begin());
}
template<typename T, size_t inlineCapacity, typename OverflowHandler>
@@ -760,7 +754,7 @@
: Base(other.capacity(), other.size())
{
if (begin())
- TypeOperations::uninitializedCopy(getPtr(other.begin()), getPtr(other.end()), getPtr(begin()));
+ TypeOperations::uninitializedCopy(other.begin(), other.end(), begin());
}
template<typename T, size_t inlineCapacity, typename OverflowHandler>
@@ -777,8 +771,8 @@
ASSERT(begin());
}
- std::copy(getPtr(other.begin()), getPtr(other.begin() + size()), getPtr(begin()));
- TypeOperations::uninitializedCopy(getPtr(other.begin() + size()), getPtr(other.end()), getPtr(end()));
+ std::copy(other.begin(), other.begin() + size(), begin());
+ TypeOperations::uninitializedCopy(other.begin() + size(), other.end(), end());
m_size = other.size();
return *this;
@@ -802,9 +796,9 @@
reserveCapacity(other.size());
ASSERT(begin());
}
-
- std::copy(getPtr(other.begin()), getPtr(other.begin() + size()), getPtr(begin()));
- TypeOperations::uninitializedCopy(getPtr(other.begin() + size()), getPtr(other.end()), getPtr(end()));
+
+ std::copy(other.begin(), other.begin() + size(), begin());
+ TypeOperations::uninitializedCopy(other.begin() + size(), other.end(), end());
m_size = other.size();
return *this;
@@ -864,8 +858,8 @@
ASSERT(begin());
}
- std::fill(getPtr(begin()), getPtr(end()), val);
- TypeOperations::uninitializedFill(getPtr(end()), getPtr(begin()) + newSize, val);
+ std::fill(begin(), end(), val);
+ TypeOperations::uninitializedFill(end(), begin() + newSize, val);
m_size = newSize;
}
@@ -886,13 +880,13 @@
template<typename T, size_t inlineCapacity, typename OverflowHandler>
T* Vector<T, inlineCapacity, OverflowHandler>::expandCapacity(size_t newMinCapacity, T* ptr)
{
- if (ptr < getPtr(begin()) || ptr >= getPtr(end())) {
+ if (ptr < begin() || ptr >= end()) {
expandCapacity(newMinCapacity);
return ptr;
}
size_t index = ptr - begin();
expandCapacity(newMinCapacity);
- return getPtr(begin() + index);
+ return begin() + index;
}
template<typename T, size_t inlineCapacity, typename OverflowHandler>
@@ -904,15 +898,15 @@
template<typename T, size_t inlineCapacity, typename OverflowHandler>
const T* Vector<T, inlineCapacity, OverflowHandler>::tryExpandCapacity(size_t newMinCapacity, const T* ptr)
{
- if (ptr < getPtr(begin()) || ptr >= getPtr(end())) {
+ if (ptr < begin() || ptr >= end()) {
if (!tryExpandCapacity(newMinCapacity))
return 0;
return ptr;
}
- size_t index = (ptr - begin());
+ size_t index = ptr - begin();
if (!tryExpandCapacity(newMinCapacity))
return 0;
- return getPtr(begin()) + index;
+ return begin() + index;
}
template<typename T, size_t inlineCapacity, typename OverflowHandler> template<typename U>
@@ -926,12 +920,12 @@
inline void Vector<T, inlineCapacity, OverflowHandler>::resize(size_t size)
{
if (size <= m_size)
- TypeOperations::destruct(getPtr(begin()) + size, getPtr(end()));
+ TypeOperations::destruct(begin() + size, end());
else {
if (size > capacity())
expandCapacity(size);
if (begin())
- TypeOperations::initialize(getPtr(end()), getPtr(begin()) + size);
+ TypeOperations::initialize(end(), begin() + size);
}
m_size = size;
@@ -948,7 +942,7 @@
void Vector<T, inlineCapacity, OverflowHandler>::shrink(size_t size)
{
ASSERT(size <= m_size);
- TypeOperations::destruct(getPtr(begin()) + size, getPtr(end()));
+ TypeOperations::destruct(begin() + size, end());
m_size = size;
}
@@ -959,7 +953,7 @@
if (size > capacity())
expandCapacity(size);
if (begin())
- TypeOperations::initialize(getPtr(end()), getPtr(begin()) + size);
+ TypeOperations::initialize(end(), begin() + size);
m_size = size;
}
@@ -968,11 +962,11 @@
{
if (newCapacity <= capacity())
return;
- T* oldBuffer = getPtr(begin());
- T* oldEnd = getPtr(end());
+ T* oldBuffer = begin();
+ T* oldEnd = end();
Base::allocateBuffer(newCapacity);
ASSERT(begin());
- TypeOperations::move(oldBuffer, oldEnd, getPtr(begin()));
+ TypeOperations::move(oldBuffer, oldEnd, begin());
Base::deallocateBuffer(oldBuffer);
}
@@ -981,12 +975,12 @@
{
if (newCapacity <= capacity())
return true;
- T* oldBuffer = getPtr(begin());
- T* oldEnd = getPtr(end());
+ T* oldBuffer = begin();
+ T* oldEnd = end();
if (!Base::tryAllocateBuffer(newCapacity))
return false;
ASSERT(begin());
- TypeOperations::move(oldBuffer, oldEnd, getPtr(begin()));
+ TypeOperations::move(oldBuffer, oldEnd, begin());
Base::deallocateBuffer(oldBuffer);
return true;
}
@@ -1009,17 +1003,17 @@
if (newCapacity < size())
shrink(newCapacity);
- T* oldBuffer = getPtr(begin());
+ T* oldBuffer = begin();
if (newCapacity > 0) {
if (Base::shouldReallocateBuffer(newCapacity)) {
Base::reallocateBuffer(newCapacity);
return;
}
- T* oldEnd = getPtr(end());
+ T* oldEnd = end();
Base::allocateBuffer(newCapacity);
if (begin() != oldBuffer)
- TypeOperations::move(oldBuffer, oldEnd, getPtr(begin()));
+ TypeOperations::move(oldBuffer, oldEnd, begin());
}
Base::deallocateBuffer(oldBuffer);
@@ -1039,17 +1033,11 @@
}
if (newSize < m_size)
CRASH();
- T* dest = getPtr(end());
+ T* dest = end();
VectorCopier<std::is_trivial<T>::value, U>::uninitializedCopy(data, &data[dataSize], dest);
m_size = newSize;
}
-template<typename T, size_t inlineCapacity, typename OverflowHandler>
-void Vector<T, inlineCapacity, OverflowHandler>::append(const_iterator data, size_t dataSize)
-{
- append(getPtr(data), dataSize);
-}
-
template<typename T, size_t inlineCapacity, typename OverflowHandler> template<typename U>
bool Vector<T, inlineCapacity, OverflowHandler>::tryAppend(const U* data, size_t dataSize)
{
@@ -1062,7 +1050,7 @@
}
if (newSize < m_size)
return false;
- T* dest = getPtr(end());
+ T* dest = end();
VectorCopier<std::is_trivial<T>::value, U>::uninitializedCopy(data, &data[dataSize], dest);
m_size = newSize;
return true;
@@ -1072,7 +1060,7 @@
ALWAYS_INLINE void Vector<T, inlineCapacity, OverflowHandler>::append(U&& value)
{
if (size() != capacity()) {
- new (NotNull, getPtr(end())) T(std::forward<U>(value));
+ new (NotNull, end()) T(std::forward<U>(value));
++m_size;
return;
}
@@ -1089,7 +1077,7 @@
ptr = expandCapacity(size() + 1, ptr);
ASSERT(begin());
- new (NotNull, getPtr(end())) T(std::forward<U>(*ptr));
+ new (NotNull, end()) T(std::forward<U>(*ptr));
++m_size;
}
@@ -1102,14 +1090,14 @@
ASSERT(size() < capacity());
auto ptr = std::addressof(value);
- new (NotNull, getPtr(end())) T(std::forward<U>(*ptr));
+ new (NotNull, end()) T(std::forward<U>(*ptr));
++m_size;
}
template<typename T, size_t inlineCapacity, typename OverflowHandler> template<typename U, size_t otherCapacity>
inline void Vector<T, inlineCapacity, OverflowHandler>::appendVector(const Vector<U, otherCapacity>& val)
{
- append(getPtr(val.begin()), val.size());
+ append(val.begin(), val.size());
}
template<typename T, size_t inlineCapacity, typename OverflowHandler> template<typename U>
@@ -1123,8 +1111,8 @@
}
if (newSize < m_size)
CRASH();
- T* spot = getPtr(begin()) + position;
- TypeOperations::moveOverlapping(spot, getPtr(end()), spot + dataSize);
+ T* spot = begin() + position;
+ TypeOperations::moveOverlapping(spot, end(), spot + dataSize);
VectorCopier<std::is_trivial<T>::value, U>::uninitializedCopy(data, &data[dataSize], spot);
m_size = newSize;
}
@@ -1140,8 +1128,8 @@
ASSERT(begin());
}
- T* spot = getPtr(begin()) + position;
- TypeOperations::moveOverlapping(spot, getPtr(end()), spot + 1);
+ T* spot = begin() + position;
+ TypeOperations::moveOverlapping(spot, end(), spot + 1);
new (NotNull, spot) T(std::forward<U>(*ptr));
++m_size;
}
@@ -1149,16 +1137,16 @@
template<typename T, size_t inlineCapacity, typename OverflowHandler> template<typename U, size_t c>
inline void Vector<T, inlineCapacity, OverflowHandler>::insertVector(size_t position, const Vector<U, c>& val)
{
- insert(position, getPtr(val.begin()), val.size());
+ insert(position, val.begin(), val.size());
}
template<typename T, size_t inlineCapacity, typename OverflowHandler>
inline void Vector<T, inlineCapacity, OverflowHandler>::remove(size_t position)
{
ASSERT_WITH_SECURITY_IMPLICATION(position < size());
- T* spot = getPtr(begin()) + position;
+ T* spot = begin() + position;
spot->~T();
- TypeOperations::moveOverlapping(spot + 1, getPtr(end()), spot);
+ TypeOperations::moveOverlapping(spot + 1, end(), spot);
--m_size;
}
@@ -1167,10 +1155,10 @@
{
ASSERT_WITH_SECURITY_IMPLICATION(position <= size());
ASSERT_WITH_SECURITY_IMPLICATION(position + length <= size());
- T* beginSpot = getPtr(begin()) + position;
+ T* beginSpot = begin() + position;
T* endSpot = beginSpot + length;
TypeOperations::destruct(beginSpot, endSpot);
- TypeOperations::moveOverlapping(endSpot, getPtr(end()), beginSpot);
+ TypeOperations::moveOverlapping(endSpot, end(), beginSpot);
m_size -= length;
}
Modified: trunk/Source/WebCore/ChangeLog (177315 => 177316)
--- trunk/Source/WebCore/ChangeLog 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/ChangeLog 2014-12-15 23:24:12 UTC (rev 177316)
@@ -1,3 +1,18 @@
+2014-12-15 Commit Queue <[email protected]>
+
+ Unreviewed, rolling out r177284.
+ https://bugs.webkit.org/show_bug.cgi?id=139658
+
+ "Breaks API tests and LayoutTests on Yosemite Debug"
+ (Requested by msaboff on #webkit).
+
+ Reverted changeset:
+
+ "Make sure range based iteration of Vector<> still receives
+ bounds checking"
+ https://bugs.webkit.org/show_bug.cgi?id=138821
+ http://trac.webkit.org/changeset/177284
+
2014-12-15 Ryosuke Niwa <[email protected]>
cloneNode(true) does not clone nested template elements' contents
Modified: trunk/Source/WebCore/bindings/js/SerializedScriptValue.cpp (177315 => 177316)
--- trunk/Source/WebCore/bindings/js/SerializedScriptValue.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/bindings/js/SerializedScriptValue.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -1442,8 +1442,8 @@
{
if (buffer.isEmpty())
return String();
- const uint8_t* ptr = getPtr(buffer.begin());
- const uint8_t* end = getPtr(buffer.end());
+ const uint8_t* ptr = buffer.begin();
+ const uint8_t* end = buffer.end();
uint32_t version;
if (!readLittleEndian(ptr, end, version) || version > CurrentVersion)
return String();
Modified: trunk/Source/WebCore/editing/TextIterator.cpp (177315 => 177316)
--- trunk/Source/WebCore/editing/TextIterator.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/editing/TextIterator.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -2073,11 +2073,11 @@
// creating a new one each time.
normalizeCharacters(match, matchLength, m_normalizedMatch);
- const UChar* a = getPtr(m_normalizedTarget.begin());
- const UChar* aEnd = getPtr(m_normalizedTarget.end());
+ const UChar* a = m_normalizedTarget.begin();
+ const UChar* aEnd = m_normalizedTarget.end();
- const UChar* b = getPtr(m_normalizedMatch.begin());
- const UChar* bEnd = getPtr(m_normalizedMatch.end());
+ const UChar* b = m_normalizedMatch.begin();
+ const UChar* bEnd = m_normalizedMatch.end();
while (true) {
// Skip runs of non-kana-letter characters. This is necessary so we can
Modified: trunk/Source/WebCore/page/mac/ServicesOverlayController.mm (177315 => 177316)
--- trunk/Source/WebCore/page/mac/ServicesOverlayController.mm 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/page/mac/ServicesOverlayController.mm 2014-12-15 23:24:12 UTC (rev 177316)
@@ -542,7 +542,7 @@
if (!cgRects.isEmpty()) {
CGRect visibleRect = mainFrameView->visibleContentRect();
- RetainPtr<DDHighlightRef> ddHighlight = adoptCF(DDHighlightCreateWithRectsInVisibleRectWithStyleAndDirection(nullptr, cgRects.data(), cgRects.size(), visibleRect, DDHighlightStyleBubbleNone | DDHighlightStyleStandardIconArrow | DDHighlightStyleButtonShowAlways, YES, NSWritingDirectionNatural, NO, YES));
+ RetainPtr<DDHighlightRef> ddHighlight = adoptCF(DDHighlightCreateWithRectsInVisibleRectWithStyleAndDirection(nullptr, cgRects.begin(), cgRects.size(), visibleRect, DDHighlightStyleBubbleNone | DDHighlightStyleStandardIconArrow | DDHighlightStyleButtonShowAlways, YES, NSWritingDirectionNatural, NO, YES));
newPotentialHighlights.add(Highlight::createForSelection(*this, ddHighlight, selectionRange));
}
Modified: trunk/Source/WebCore/platform/graphics/SegmentedFontData.cpp (177315 => 177316)
--- trunk/Source/WebCore/platform/graphics/SegmentedFontData.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/platform/graphics/SegmentedFontData.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -39,8 +39,8 @@
const SimpleFontData* SegmentedFontData::fontDataForCharacter(UChar32 c) const
{
- auto end = m_ranges.end();
- for (auto it = m_ranges.begin(); it != end; ++it) {
+ Vector<FontDataRange>::const_iterator end = m_ranges.end();
+ for (Vector<FontDataRange>::const_iterator it = m_ranges.begin(); it != end; ++it) {
if (it->from() <= c && it->to() >= c)
return it->fontData().get();
}
@@ -49,8 +49,8 @@
bool SegmentedFontData::containsCharacter(UChar32 c) const
{
- auto end = m_ranges.end();
- for (auto it = m_ranges.begin(); it != end; ++it) {
+ Vector<FontDataRange>::const_iterator end = m_ranges.end();
+ for (Vector<FontDataRange>::const_iterator it = m_ranges.begin(); it != end; ++it) {
if (c >= it->from() && c <= it->to())
return true;
}
@@ -76,8 +76,8 @@
bool SegmentedFontData::isLoading() const
{
- auto end = m_ranges.end();
- for (auto it = m_ranges.begin(); it != end; ++it) {
+ Vector<FontDataRange>::const_iterator end = m_ranges.end();
+ for (Vector<FontDataRange>::const_iterator it = m_ranges.begin(); it != end; ++it) {
if (it->fontData()->isLoading())
return true;
}
Modified: trunk/Source/WebCore/platform/graphics/WOFFFileFormat.cpp (177315 => 177316)
--- trunk/Source/WebCore/platform/graphics/WOFFFileFormat.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/platform/graphics/WOFFFileFormat.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -200,7 +200,7 @@
uLongf destLen = tableOrigLength;
if (!sfnt.tryReserveCapacity(sfnt.size() + tableOrigLength))
return false;
- Bytef* dest = reinterpret_cast<Bytef*>(getPtr(sfnt.end()));
+ Bytef* dest = reinterpret_cast<Bytef*>(sfnt.end());
sfnt.grow(sfnt.size() + tableOrigLength);
if (uncompress(dest, &destLen, reinterpret_cast<const Bytef*>(woff->data() + tableOffset), tableCompLength) != Z_OK)
return false;
Modified: trunk/Source/WebCore/platform/graphics/cairo/GradientCairo.cpp (177315 => 177316)
--- trunk/Source/WebCore/platform/graphics/cairo/GradientCairo.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/platform/graphics/cairo/GradientCairo.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -59,7 +59,7 @@
else
m_gradient = cairo_pattern_create_linear(m_p0.x(), m_p0.y(), m_p1.x(), m_p1.y());
- auto stopIterator = m_stops.begin();
+ Vector<ColorStop>::iterator stopIterator = m_stops.begin();
while (stopIterator != m_stops.end()) {
cairo_pattern_add_color_stop_rgba(m_gradient, stopIterator->stop,
stopIterator->red, stopIterator->green, stopIterator->blue,
Modified: trunk/Source/WebCore/platform/image-decoders/gif/GIFImageDecoder.cpp (177315 => 177316)
--- trunk/Source/WebCore/platform/image-decoders/gif/GIFImageDecoder.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/platform/image-decoders/gif/GIFImageDecoder.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -145,7 +145,7 @@
// always use ImageSource::clear(true, ...) to completely free the memory in
// this case.
clearBeforeFrame = std::min(clearBeforeFrame, m_frameBufferCache.size() - 1);
- const auto end = m_frameBufferCache.begin() + clearBeforeFrame;
+ const Vector<ImageFrame>::iterator end(m_frameBufferCache.begin() + clearBeforeFrame);
// We need to preserve frames such that:
// * We don't clear |end|
@@ -165,14 +165,14 @@
// * If the frame is partial, we're decoding it, so don't clear it; if it
// has a disposal method other than DisposeOverwritePrevious, stop
// scanning, as we'll only need this frame when decoding the next one.
- auto i = end;
+ Vector<ImageFrame>::iterator i(end);
for (; (i != m_frameBufferCache.begin()) && ((i->status() == ImageFrame::FrameEmpty) || (i->disposalMethod() == ImageFrame::DisposeOverwritePrevious)); --i) {
if ((i->status() == ImageFrame::FrameComplete) && (i != end))
i->clearPixelData();
}
// Now |i| holds the last frame we need to preserve; clear prior frames.
- for (auto j = m_frameBufferCache.begin(); j != i; ++j) {
+ for (Vector<ImageFrame>::iterator j(m_frameBufferCache.begin()); j != i; ++j) {
ASSERT(j->status() != ImageFrame::FramePartial);
if (j->status() != ImageFrame::FrameEmpty)
j->clearPixelData();
Modified: trunk/Source/WebCore/rendering/RenderBox.cpp (177315 => 177316)
--- trunk/Source/WebCore/rendering/RenderBox.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/rendering/RenderBox.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -1577,8 +1577,8 @@
context->beginTransparencyLayer(1);
}
- auto topLayer = layers.rend();
- for (auto it = layers.rbegin(); it != topLayer; ++it)
+ Vector<const FillLayer*>::const_reverse_iterator topLayer = layers.rend();
+ for (Vector<const FillLayer*>::const_reverse_iterator it = layers.rbegin(); it != topLayer; ++it)
paintFillLayer(paintInfo, c, *it, rect, bleedAvoidance, op, backgroundObject, baseBgColorUsage);
if (shouldDrawBackgroundInSeparateBuffer)
Modified: trunk/Source/WebCore/rendering/style/GridResolvedPosition.cpp (177315 => 177316)
--- trunk/Source/WebCore/rendering/style/GridResolvedPosition.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/rendering/style/GridResolvedPosition.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -295,7 +295,7 @@
// already converted to an index in our grid representation (ie one was removed from the grid line to account for
// the side).
unsigned firstLineBeforePositionIndex = 0;
- auto firstLineBeforePosition = std::lower_bound(gridLines.begin(), gridLines.end(), position);
+ const unsigned* firstLineBeforePosition = std::lower_bound(gridLines.begin(), gridLines.end(), position);
if (firstLineBeforePosition != gridLines.end()) {
if (*firstLineBeforePosition > position && firstLineBeforePosition != gridLines.begin())
--firstLineBeforePosition;
@@ -316,8 +316,9 @@
std::unique_ptr<GridSpan> GridResolvedPosition::resolveRowEndColumnEndNamedGridLinePositionAgainstOppositePosition(const GridResolvedPosition& resolvedOppositePosition, const GridPosition& position, const Vector<unsigned>& gridLines)
{
+ ASSERT(gridLines.size());
unsigned firstLineAfterOppositePositionIndex = gridLines.size() - 1;
- auto firstLineAfterOppositePosition = std::upper_bound(gridLines.begin(), gridLines.end(), resolvedOppositePosition);
+ const unsigned* firstLineAfterOppositePosition = std::upper_bound(gridLines.begin(), gridLines.end(), resolvedOppositePosition);
if (firstLineAfterOppositePosition != gridLines.end())
firstLineAfterOppositePositionIndex = firstLineAfterOppositePosition - gridLines.begin();
Modified: trunk/Source/WebCore/svg/SVGFontElement.cpp (177315 => 177316)
--- trunk/Source/WebCore/svg/SVGFontElement.cpp 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/svg/SVGFontElement.cpp 2014-12-15 23:24:12 UTC (rev 177316)
@@ -252,31 +252,31 @@
{
if (!g1.isEmpty() && kerningMap.glyphMap.contains(g1)) {
SVGKerningVector* kerningVector = kerningMap.glyphMap.get(g1);
- size_t it = kerningVector->size();
- while (it-- > 0) {
- auto& value = kerningVector->at(it);
- if (matches(u2, g2, value))
- return value.kerning;
+ SVGKerningVector::const_iterator it = kerningVector->end() - 1;
+ const SVGKerningVector::const_iterator begin = kerningVector->begin() - 1;
+ for (; it != begin; --it) {
+ if (matches(u2, g2, *it))
+ return it->kerning;
}
}
if (!u1.isEmpty()) {
if (kerningMap.unicodeMap.contains(u1)) {
SVGKerningVector* kerningVector = kerningMap.unicodeMap.get(u1);
- size_t it = kerningVector->size();
- while (it-- > 0) {
- auto& value = kerningVector->at(it);
- if (matches(u2, g2, value))
- return value.kerning;
+ SVGKerningVector::const_iterator it = kerningVector->end() - 1;
+ const SVGKerningVector::const_iterator begin = kerningVector->begin() - 1;
+ for (; it != begin; --it) {
+ if (matches(u2, g2, *it))
+ return it->kerning;
}
}
if (!kerningMap.kerningUnicodeRangeMap.isEmpty()) {
- size_t it = kerningMap.kerningUnicodeRangeMap.size();
- while (it-- > 0) {
- auto& value = kerningMap.kerningUnicodeRangeMap[it];
- if (matches(u1, u2, g2, value))
- return value.kerning;
+ Vector<SVGKerningPair>::const_iterator it = kerningMap.kerningUnicodeRangeMap.end() - 1;
+ const Vector<SVGKerningPair>::const_iterator begin = kerningMap.kerningUnicodeRangeMap.begin() - 1;
+ for (; it != begin; --it) {
+ if (matches(u1, u2, g2, *it))
+ return it->kerning;
}
}
}
Modified: trunk/Source/WebCore/svg/SVGPathByteStream.h (177315 => 177316)
--- trunk/Source/WebCore/svg/SVGPathByteStream.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/svg/SVGPathByteStream.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -60,8 +60,8 @@
void append(unsigned char byte) { m_data.append(byte); }
void append(SVGPathByteStream* other)
{
- for (auto& byte : *other)
- append(byte);
+ for (DataIterator it = other->begin(); it != other->end(); ++it)
+ append(*it);
}
void clear() { m_data.clear(); }
bool isEmpty() const { return !m_data.size(); }
Modified: trunk/Source/WebCore/xml/XPathNodeSet.h (177315 => 177316)
--- trunk/Source/WebCore/xml/XPathNodeSet.h 2014-12-15 22:58:17 UTC (rev 177315)
+++ trunk/Source/WebCore/xml/XPathNodeSet.h 2014-12-15 23:24:12 UTC (rev 177316)
@@ -64,8 +64,8 @@
void markSubtreesDisjoint(bool disjoint) { m_subtreesAreDisjoint = disjoint; }
bool subtreesAreDisjoint() const { return m_subtreesAreDisjoint || m_nodes.size() < 2; }
- const Vector<RefPtr<Node>>::iterator begin() const { return m_nodes.begin(); }
- const Vector<RefPtr<Node>>::iterator end() const { return m_nodes.end(); }
+ const RefPtr<Node>* begin() const { return m_nodes.begin(); }
+ const RefPtr<Node>* end() const { return m_nodes.end(); }
private:
void traversalSort() const;
