mirror of
https://github.com/roytam1/palemoon27.git
synced 2026-05-27 09:09:25 +00:00
978b1470cd
- namespace (b3e3551148) - Bug 1146202 - Add a test for the handling of ignoreVary in Cache.keys; r=bkelly (37a8b2b74c) - Bug 1162411 - Fix Request CORS bug. r=bz (2fe7982d3a) - Bug 1154268 - Fetch Request should not allow creating a GET request with a body by copying a PUT request. r=bkelly (d36cea49f6) - Bug 1134609 -Make Fetch Request constructor less destructive to input on error r=bkelly (7e96b79ef9) - Bug 1147684 - HeapSnapshot::NodeMap store DeserializedNodes directly, rather than UniquePtrs; r=jimb (b1510e5991) - Bug 1148642 - Save some memory in HeapSnapshot instances by using a HashSet with a NodeId lookup, instead of a HashMap; r=jimb (696df66bc2) - Bug 1147684 - Part 2: Make the DeserializedNode cosntructor infallible; r=jimb (19eb651e8b) - fix namespace comments (2490fc27b1) - Bug 1054756, part 4 - Remove BaseProxyHandler::defaultValue. r=jandem. (b43b5657aa)
185 lines
4.3 KiB
C++
185 lines
4.3 KiB
C++
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2; -*- */
|
|
/* 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 "mozilla/devtools/DeserializedNode.h"
|
|
#include "mozilla/devtools/HeapSnapshot.h"
|
|
#include "nsCRTGlue.h"
|
|
|
|
namespace mozilla {
|
|
namespace devtools {
|
|
|
|
DeserializedEdge::DeserializedEdge()
|
|
: referent(0)
|
|
, name(nullptr)
|
|
{ }
|
|
|
|
DeserializedEdge::DeserializedEdge(DeserializedEdge&& rhs)
|
|
{
|
|
referent = rhs.referent;
|
|
name = rhs.name;
|
|
}
|
|
|
|
DeserializedEdge& DeserializedEdge::operator=(DeserializedEdge&& rhs)
|
|
{
|
|
MOZ_ASSERT(&rhs != this);
|
|
this->~DeserializedEdge();
|
|
new(this) DeserializedEdge(Move(rhs));
|
|
return *this;
|
|
}
|
|
|
|
bool
|
|
DeserializedEdge::init(const protobuf::Edge& edge, HeapSnapshot& owner)
|
|
{
|
|
// Although the referent property is optional in the protobuf format for
|
|
// future compatibility, we can't semantically have an edge to nowhere and
|
|
// require a referent here.
|
|
if (!edge.has_referent())
|
|
return false;
|
|
referent = edge.referent();
|
|
|
|
if (edge.has_name()) {
|
|
const char16_t* duplicateEdgeName = reinterpret_cast<const char16_t*>(edge.name().c_str());
|
|
name = owner.borrowUniqueString(duplicateEdgeName, edge.name().length() / sizeof(char16_t));
|
|
if (!name)
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
DeserializedNode::DeserializedNode(DeserializedNode&& rhs)
|
|
{
|
|
id = rhs.id;
|
|
rhs.id = 0;
|
|
|
|
typeName = rhs.typeName;
|
|
rhs.typeName = nullptr;
|
|
|
|
size = rhs.size;
|
|
rhs.size = 0;
|
|
|
|
edges = Move(rhs.edges);
|
|
|
|
owner = rhs.owner;
|
|
rhs.owner = nullptr;
|
|
}
|
|
|
|
DeserializedNode& DeserializedNode::operator=(DeserializedNode&& rhs)
|
|
{
|
|
MOZ_ASSERT(&rhs != this);
|
|
this->~DeserializedNode();
|
|
new(this) DeserializedNode(Move(rhs));
|
|
return *this;
|
|
}
|
|
|
|
DeserializedNode::DeserializedNode(NodeId id, const char16_t* typeName, uint64_t size)
|
|
: id(id)
|
|
, typeName(typeName)
|
|
, size(size)
|
|
, edges()
|
|
, owner(nullptr)
|
|
{ }
|
|
|
|
JS::ubi::Node
|
|
DeserializedNode::getEdgeReferent(const DeserializedEdge& edge)
|
|
{
|
|
auto ptr = owner->nodes.lookup(edge.referent);
|
|
MOZ_ASSERT(ptr);
|
|
|
|
// `HashSets` only provide const access to their values, because mutating a
|
|
// value might change its hash, rendering it unfindable in the set.
|
|
// Unfortunately, the `ubi::Node` constructor requires a non-const pointer to
|
|
// its referent. However, the only aspect of a `DeserializedNode` we hash on
|
|
// is its id, which can't be changed via `ubi::Node`, so this cast can't cause
|
|
// the trouble `HashSet` is concerned a non-const reference would cause.
|
|
return JS::ubi::Node(const_cast<DeserializedNode*>(&*ptr));
|
|
}
|
|
|
|
} // namespace devtools
|
|
} // namespace mozilla
|
|
|
|
namespace JS {
|
|
namespace ubi {
|
|
|
|
using mozilla::devtools::DeserializedEdge;
|
|
|
|
const char16_t Concrete<DeserializedNode>::concreteTypeName[] =
|
|
MOZ_UTF16("mozilla::devtools::DeserializedNode");
|
|
|
|
const char16_t*
|
|
Concrete<DeserializedNode>::typeName() const
|
|
{
|
|
return get().typeName;
|
|
}
|
|
|
|
size_t
|
|
Concrete<DeserializedNode>::size(mozilla::MallocSizeOf mallocSizeof) const
|
|
{
|
|
return get().size;
|
|
}
|
|
|
|
class DeserializedEdgeRange : public EdgeRange
|
|
{
|
|
SimpleEdgeVector edges;
|
|
size_t i;
|
|
|
|
void settle() {
|
|
front_ = i < edges.length() ? &edges[i] : nullptr;
|
|
}
|
|
|
|
public:
|
|
explicit DeserializedEdgeRange(JSContext* cx)
|
|
: edges(cx)
|
|
, i(0)
|
|
{
|
|
settle();
|
|
}
|
|
|
|
bool init(DeserializedNode& node)
|
|
{
|
|
if (!edges.reserve(node.edges.length()))
|
|
return false;
|
|
|
|
for (DeserializedEdge* edgep = node.edges.begin();
|
|
edgep != node.edges.end();
|
|
edgep++)
|
|
{
|
|
char16_t* name = nullptr;
|
|
if (edgep->name) {
|
|
name = NS_strdup(edgep->name);
|
|
if (!name)
|
|
return false;
|
|
}
|
|
|
|
auto referent = node.getEdgeReferent(*edgep);
|
|
edges.infallibleAppend(mozilla::Move(SimpleEdge(name, referent)));
|
|
}
|
|
|
|
settle();
|
|
return true;
|
|
}
|
|
|
|
void popFront() override
|
|
{
|
|
i++;
|
|
settle();
|
|
}
|
|
};
|
|
|
|
UniquePtr<EdgeRange>
|
|
Concrete<DeserializedNode>::edges(JSContext* cx, bool) const
|
|
{
|
|
UniquePtr<DeserializedEdgeRange, JS::DeletePolicy<DeserializedEdgeRange>> range(
|
|
js_new<DeserializedEdgeRange>(cx));
|
|
|
|
if (!range || !range->init(get()))
|
|
return nullptr;
|
|
|
|
return UniquePtr<EdgeRange>(range.release());
|
|
}
|
|
|
|
} // namespace ubi
|
|
} // namespace JS
|