mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-10-16 14:55:47 +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
86 lines
2.5 KiB
C++
86 lines
2.5 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/* 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/. */
|
|
|
|
#include "txExpr.h"
|
|
#include "txNodeSet.h"
|
|
#include "txNodeSetContext.h"
|
|
|
|
/*
|
|
* Represents an ordered list of Predicates,
|
|
* for use with Step and Filter Expressions
|
|
*/
|
|
|
|
nsresult
|
|
PredicateList::evaluatePredicates(txNodeSet* nodes,
|
|
txIMatchContext* aContext)
|
|
{
|
|
NS_ASSERTION(nodes, "called evaluatePredicates with nullptr NodeSet");
|
|
nsresult rv = NS_OK;
|
|
|
|
uint32_t i, len = mPredicates.Length();
|
|
for (i = 0; i < len && !nodes->isEmpty(); ++i) {
|
|
txNodeSetContext predContext(nodes, aContext);
|
|
/*
|
|
* add nodes to newNodes that match the expression
|
|
* or, if the result is a number, add the node with the right
|
|
* position
|
|
*/
|
|
int32_t index = 0;
|
|
while (predContext.hasNext()) {
|
|
predContext.next();
|
|
RefPtr<txAExprResult> exprResult;
|
|
rv = mPredicates[i]->evaluate(&predContext,
|
|
getter_AddRefs(exprResult));
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
// handle default, [position() == numberValue()]
|
|
if (exprResult->getResultType() == txAExprResult::NUMBER) {
|
|
if ((double)predContext.position() == exprResult->numberValue()) {
|
|
nodes->mark(index);
|
|
}
|
|
}
|
|
else if (exprResult->booleanValue()) {
|
|
nodes->mark(index);
|
|
}
|
|
++index;
|
|
}
|
|
// sweep the non-marked nodes
|
|
nodes->sweep();
|
|
}
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
bool
|
|
PredicateList::isSensitiveTo(Expr::ContextSensitivity aContext)
|
|
{
|
|
// We're creating a new node/nodeset so we can ignore those bits.
|
|
Expr::ContextSensitivity context =
|
|
aContext & ~(Expr::NODE_CONTEXT | Expr::NODESET_CONTEXT);
|
|
if (context == Expr::NO_CONTEXT) {
|
|
return false;
|
|
}
|
|
|
|
uint32_t i, len = mPredicates.Length();
|
|
for (i = 0; i < len; ++i) {
|
|
if (mPredicates[i]->isSensitiveTo(context)) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
#ifdef TX_TO_STRING
|
|
void PredicateList::toString(nsAString& dest)
|
|
{
|
|
for (uint32_t i = 0; i < mPredicates.Length(); ++i) {
|
|
dest.Append(char16_t('['));
|
|
mPredicates[i]->toString(dest);
|
|
dest.Append(char16_t(']'));
|
|
}
|
|
}
|
|
#endif
|