darling-JavaScriptCore/dfg/DFGMinifiedGraph.h
2017-08-12 09:48:01 -07:00

67 lines
2.0 KiB
C++

/*
* Copyright (C) 2012, 2015 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.
*/
#pragma once
#if ENABLE(DFG_JIT)
#include "DFGMinifiedNode.h"
#include <algorithm>
#include <wtf/StdLibExtras.h>
#include <wtf/Vector.h>
namespace JSC {
class TrackedReferences;
namespace DFG {
class MinifiedGraph {
public:
MinifiedGraph() { }
MinifiedNode* at(MinifiedID id)
{
return tryBinarySearch<MinifiedNode, MinifiedID>(
m_list, m_list.size(), id, MinifiedNode::getID);
}
void append(const MinifiedNode& node)
{
m_list.append(node);
}
void prepareAndShrink();
void validateReferences(const TrackedReferences&);
private:
Vector<MinifiedNode> m_list;
};
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)