mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-10-31 06:05:44 +00:00
01583602a9
The bulk of this commit was generated with a script, executed at the top level of a typical source code checkout. The only non-machine-generated part was modifying MFBT's moz.build to reflect the new naming. CLOSED TREE makes big refactorings like this a piece of cake. # The main substitution. find . -name '*.cpp' -o -name '*.cc' -o -name '*.h' -o -name '*.mm' -o -name '*.idl'| \ xargs perl -p -i -e ' s/nsRefPtr\.h/RefPtr\.h/g; # handle includes s/nsRefPtr ?</RefPtr</g; # handle declarations and variables ' # Handle a special friend declaration in gfx/layers/AtomicRefCountedWithFinalize.h. perl -p -i -e 's/::nsRefPtr;/::RefPtr;/' gfx/layers/AtomicRefCountedWithFinalize.h # Handle nsRefPtr.h itself, a couple places that define constructors # from nsRefPtr, and code generators specially. We do this here, rather # than indiscriminantly s/nsRefPtr/RefPtr/, because that would rename # things like nsRefPtrHashtable. perl -p -i -e 's/nsRefPtr/RefPtr/g' \ mfbt/nsRefPtr.h \ xpcom/glue/nsCOMPtr.h \ xpcom/base/OwningNonNull.h \ ipc/ipdl/ipdl/lower.py \ ipc/ipdl/ipdl/builtin.py \ dom/bindings/Codegen.py \ python/lldbutils/lldbutils/utils.py # In our indiscriminate substitution above, we renamed # nsRefPtrGetterAddRefs, the class behind getter_AddRefs. Fix that up. find . -name '*.cpp' -o -name '*.h' -o -name '*.idl' | \ xargs perl -p -i -e 's/nsRefPtrGetterAddRefs/RefPtrGetterAddRefs/g' if [ -d .git ]; then git mv mfbt/nsRefPtr.h mfbt/RefPtr.h else hg mv mfbt/nsRefPtr.h mfbt/RefPtr.h fi --HG-- rename : mfbt/nsRefPtr.h => mfbt/RefPtr.h
298 lines
8.6 KiB
C++
298 lines
8.6 KiB
C++
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* vim:set ts=2 sw=2 sts=2 et cindent: */
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
/**
|
|
* The IterableIterator class is used for WebIDL interfaces that have a
|
|
* iterable<> member defined. It handles the ES6 Iterator-like functions that
|
|
* are generated for the iterable interface.
|
|
*
|
|
* For iterable interfaces, the implementation class will need to
|
|
* implement these two functions:
|
|
*
|
|
* - size_t GetIterableLength()
|
|
* - Returns the number of elements available to iterate over
|
|
* - [type] GetValueAtIndex(size_t index)
|
|
* - Returns the value at the requested index.
|
|
*
|
|
* If this is a two-type iterator, then the implementation class will also need to implement:
|
|
*
|
|
* - [type] GetKeyAtIndex(size_t index)
|
|
* - Returns the key at the requested index
|
|
*
|
|
* Examples of iterable interface implementations can be found in the bindings
|
|
* test directory.
|
|
*/
|
|
|
|
#ifndef mozilla_dom_IterableIterator_h
|
|
#define mozilla_dom_IterableIterator_h
|
|
|
|
#include "nsISupports.h"
|
|
#include "nsWrapperCache.h"
|
|
#include "nsPIDOMWindow.h"
|
|
#include "nsCOMPtr.h"
|
|
#include "mozilla/dom/ToJSValue.h"
|
|
#include "jswrapper.h"
|
|
#include "mozilla/dom/IterableIteratorBinding.h"
|
|
|
|
namespace mozilla {
|
|
namespace dom {
|
|
|
|
class IterableIteratorBase : public nsISupports
|
|
{
|
|
public:
|
|
NS_DECL_CYCLE_COLLECTING_ISUPPORTS
|
|
NS_DECL_CYCLE_COLLECTION_CLASS(IterableIteratorBase)
|
|
typedef enum {
|
|
Keys = 0,
|
|
Values,
|
|
Entries
|
|
} IterableIteratorType;
|
|
|
|
IterableIteratorBase() {}
|
|
|
|
protected:
|
|
virtual ~IterableIteratorBase() {}
|
|
virtual void UnlinkHelper() = 0;
|
|
virtual void TraverseHelper(nsCycleCollectionTraversalCallback& cb) = 0;
|
|
};
|
|
|
|
template <typename T>
|
|
class IterableIterator : public IterableIteratorBase
|
|
{
|
|
public:
|
|
explicit IterableIterator(T* aIterableObj)
|
|
: mIterableObj(aIterableObj)
|
|
{
|
|
MOZ_ASSERT(mIterableObj);
|
|
}
|
|
|
|
protected:
|
|
static void
|
|
DictReturn(JSContext* aCx, JS::MutableHandle<JSObject*> aResult,
|
|
bool aDone, JS::Handle<JS::Value> aValue, ErrorResult& aRv)
|
|
{
|
|
RootedDictionary<IterableKeyOrValueResult> dict(aCx);
|
|
dict.mDone = aDone;
|
|
dict.mValue = aValue;
|
|
JS::Rooted<JS::Value> dictValue(aCx);
|
|
if (!ToJSValue(aCx, dict, &dictValue)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
aResult.set(&dictValue.toObject());
|
|
}
|
|
|
|
static void
|
|
KeyAndValueReturn(JSContext* aCx, JS::Handle<JS::Value> aKey,
|
|
JS::Handle<JS::Value> aValue,
|
|
JS::MutableHandle<JSObject*> aResult, ErrorResult& aRv)
|
|
{
|
|
RootedDictionary<IterableKeyAndValueResult> dict(aCx);
|
|
dict.mDone = false;
|
|
// Dictionary values are a Sequence, which is a FallibleTArray, so we need
|
|
// to check returns when appending.
|
|
if (!dict.mValue.AppendElement(aKey, mozilla::fallible)) {
|
|
aRv.Throw(NS_ERROR_OUT_OF_MEMORY);
|
|
return;
|
|
}
|
|
if (!dict.mValue.AppendElement(aValue, mozilla::fallible)) {
|
|
aRv.Throw(NS_ERROR_OUT_OF_MEMORY);
|
|
return;
|
|
}
|
|
JS::Rooted<JS::Value> dictValue(aCx);
|
|
if (!ToJSValue(aCx, dict, &dictValue)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
aResult.set(&dictValue.toObject());
|
|
}
|
|
|
|
protected:
|
|
virtual ~IterableIterator() {}
|
|
|
|
// Since we're templated on a binding, we need to possibly CC it, but can't do
|
|
// that through macros. So it happens here.
|
|
virtual void UnlinkHelper() final
|
|
{
|
|
mIterableObj = nullptr;
|
|
}
|
|
|
|
virtual void TraverseHelper(nsCycleCollectionTraversalCallback& cb) override
|
|
{
|
|
IterableIterator<T>* tmp = this;
|
|
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mIterableObj);
|
|
}
|
|
|
|
// Binding Implementation object that we're iterating over.
|
|
RefPtr<T> mIterableObj;
|
|
};
|
|
|
|
template<typename T>
|
|
class OneTypeIterableIterator final : public IterableIterator<T>
|
|
{
|
|
public:
|
|
typedef typename IterableIterator<T>::IterableIteratorType IterableIteratorType;
|
|
using IterableIterator<T>::DictReturn;
|
|
using IterableIterator<T>::KeyAndValueReturn;
|
|
typedef bool (*WrapFunc)(JSContext* aCx,
|
|
OneTypeIterableIterator<T>* aObject,
|
|
JS::Handle<JSObject*> aGivenProto,
|
|
JS::MutableHandle<JSObject*> aReflector);
|
|
|
|
OneTypeIterableIterator(T* aIterableObj,
|
|
IterableIteratorType aIteratorType,
|
|
WrapFunc aWrapFunc)
|
|
: IterableIterator<T>(aIterableObj)
|
|
, mIteratorType(aIteratorType)
|
|
, mWrapFunc(aWrapFunc)
|
|
, mIndex(0)
|
|
{
|
|
MOZ_ASSERT(mWrapFunc);
|
|
}
|
|
|
|
void
|
|
Next(JSContext* aCx, JS::MutableHandle<JSObject*> aResult, ErrorResult& aRv)
|
|
{
|
|
JS::Rooted<JS::Value> value(aCx, JS::UndefinedValue());
|
|
if (mIndex >= this->mIterableObj->GetIterableLength()) {
|
|
DictReturn(aCx, aResult, true, value, aRv);
|
|
return;
|
|
}
|
|
|
|
switch (mIteratorType) {
|
|
case IterableIteratorType::Keys:
|
|
case IterableIteratorType::Values:
|
|
{
|
|
if (!ToJSValue(aCx, this->mIterableObj->GetValueAtIndex(mIndex), &value)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
DictReturn(aCx, aResult, false, value, aRv);
|
|
break;
|
|
}
|
|
case IterableIteratorType::Entries:
|
|
{
|
|
if (!ToJSValue(aCx, this->mIterableObj->GetValueAtIndex(mIndex), &value)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
KeyAndValueReturn(aCx, value, value, aResult, aRv);
|
|
break;
|
|
}
|
|
default:
|
|
MOZ_CRASH("Invalid iterator type!");
|
|
}
|
|
++mIndex;
|
|
}
|
|
|
|
bool
|
|
WrapObject(JSContext* aCx, JS::Handle<JSObject*> aGivenProto, JS::MutableHandle<JSObject*> aObj)
|
|
{
|
|
return (*mWrapFunc)(aCx, this, aGivenProto, aObj);
|
|
}
|
|
|
|
protected:
|
|
virtual ~OneTypeIterableIterator() {}
|
|
|
|
// Tells whether this is a key, value, or entries iterator.
|
|
IterableIteratorType mIteratorType;
|
|
// Function pointer to binding-type-specific Wrap() call for this iterator.
|
|
WrapFunc mWrapFunc;
|
|
// Current index of iteration.
|
|
uint32_t mIndex;
|
|
};
|
|
|
|
template<typename T>
|
|
class TwoTypeIterableIterator final : public IterableIterator<T>
|
|
{
|
|
public:
|
|
typedef typename IterableIterator<T>::IterableIteratorType IterableIteratorType;
|
|
using IterableIterator<T>::DictReturn;
|
|
using IterableIterator<T>::KeyAndValueReturn;
|
|
typedef bool (*WrapFunc)(JSContext* aCx,
|
|
TwoTypeIterableIterator<T>* aObject,
|
|
JS::Handle<JSObject*> aGivenProto,
|
|
JS::MutableHandle<JSObject*> aReflector);
|
|
|
|
TwoTypeIterableIterator(T* aIterableObj, IterableIteratorType aIteratorType,
|
|
WrapFunc aWrapFunc)
|
|
: IterableIterator<T>(aIterableObj)
|
|
, mIteratorType(aIteratorType)
|
|
, mWrapFunc(aWrapFunc)
|
|
, mIndex(0)
|
|
{
|
|
MOZ_ASSERT(mWrapFunc);
|
|
}
|
|
|
|
void
|
|
Next(JSContext* aCx, JS::MutableHandle<JSObject*> aResult, ErrorResult& aRv)
|
|
{
|
|
JS::Rooted<JS::Value> value(aCx, JS::UndefinedValue());
|
|
if (mIndex >= this->mIterableObj->GetIterableLength()) {
|
|
DictReturn(aCx, aResult, true, value, aRv);
|
|
return;
|
|
}
|
|
switch (mIteratorType) {
|
|
case IterableIteratorType::Keys:
|
|
{
|
|
if (!ToJSValue(aCx, this->mIterableObj->GetKeyAtIndex(mIndex), &value)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
DictReturn(aCx, aResult, false, value, aRv);
|
|
break;
|
|
}
|
|
case IterableIteratorType::Values:
|
|
{
|
|
if (!ToJSValue(aCx, this->mIterableObj->GetValueAtIndex(mIndex), &value)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
DictReturn(aCx, aResult, false, value, aRv);
|
|
break;
|
|
}
|
|
case IterableIteratorType::Entries:
|
|
{
|
|
JS::Rooted<JS::Value> key(aCx);
|
|
if (!ToJSValue(aCx, this->mIterableObj->GetKeyAtIndex(mIndex), &key)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
if (!ToJSValue(aCx, this->mIterableObj->GetValueAtIndex(mIndex), &value)) {
|
|
aRv.Throw(NS_ERROR_FAILURE);
|
|
return;
|
|
}
|
|
KeyAndValueReturn(aCx, key, value, aResult, aRv);
|
|
break;
|
|
}
|
|
default:
|
|
MOZ_CRASH("Invalid iterator type!");
|
|
}
|
|
++mIndex;
|
|
}
|
|
|
|
bool
|
|
WrapObject(JSContext* aCx, JS::Handle<JSObject*> aGivenProto, JS::MutableHandle<JSObject*> aObj)
|
|
{
|
|
return (*mWrapFunc)(aCx, this, aGivenProto, aObj);
|
|
}
|
|
|
|
protected:
|
|
virtual ~TwoTypeIterableIterator() {}
|
|
|
|
// Tells whether this is a key, value, or entries iterator.
|
|
IterableIteratorType mIteratorType;
|
|
// Function pointer to binding-type-specific Wrap() call for this iterator.
|
|
WrapFunc mWrapFunc;
|
|
// Current index of iteration.
|
|
uint32_t mIndex;
|
|
};
|
|
|
|
} // namespace dom
|
|
} // namespace mozilla
|
|
|
|
#endif // mozilla_dom_IterableIterator_h
|