diff options
author | Matt A. Tobin <mattatobin@localhost.localdomain> | 2018-02-02 04:16:08 -0500 |
---|---|---|
committer | Matt A. Tobin <mattatobin@localhost.localdomain> | 2018-02-02 04:16:08 -0500 |
commit | 5f8de423f190bbb79a62f804151bc24824fa32d8 (patch) | |
tree | 10027f336435511475e392454359edea8e25895d /js/src/jit/BytecodeAnalysis.h | |
parent | 49ee0794b5d912db1f95dce6eb52d781dc210db5 (diff) | |
download | UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.gz UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.lz UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.xz UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.zip |
Add m-esr52 at 52.6.0
Diffstat (limited to 'js/src/jit/BytecodeAnalysis.h')
-rw-r--r-- | js/src/jit/BytecodeAnalysis.h | 78 |
1 files changed, 78 insertions, 0 deletions
diff --git a/js/src/jit/BytecodeAnalysis.h b/js/src/jit/BytecodeAnalysis.h new file mode 100644 index 000000000..c040ca278 --- /dev/null +++ b/js/src/jit/BytecodeAnalysis.h @@ -0,0 +1,78 @@ +/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- + * vim: set ts=8 sts=4 et sw=4 tw=99: + * 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/. */ + +#ifndef jit_BytecodeAnalysis_h +#define jit_BytecodeAnalysis_h + +#include "jsscript.h" +#include "jit/JitAllocPolicy.h" +#include "js/Vector.h" + +namespace js { +namespace jit { + +// Basic information about bytecodes in the script. Used to help baseline compilation. +struct BytecodeInfo +{ + static const uint16_t MAX_STACK_DEPTH = 0xffffU; + uint16_t stackDepth; + bool initialized : 1; + bool jumpTarget : 1; + + // If true, this is a JSOP_LOOPENTRY op inside a catch or finally block. + bool loopEntryInCatchOrFinally : 1; + + void init(unsigned depth) { + MOZ_ASSERT(depth <= MAX_STACK_DEPTH); + MOZ_ASSERT_IF(initialized, stackDepth == depth); + initialized = true; + stackDepth = depth; + } +}; + +class BytecodeAnalysis +{ + JSScript* script_; + Vector<BytecodeInfo, 0, JitAllocPolicy> infos_; + + bool usesEnvironmentChain_; + bool hasTryFinally_; + bool hasSetArg_; + + public: + explicit BytecodeAnalysis(TempAllocator& alloc, JSScript* script); + + MOZ_MUST_USE bool init(TempAllocator& alloc, GSNCache& gsn); + + BytecodeInfo& info(jsbytecode* pc) { + MOZ_ASSERT(infos_[script_->pcToOffset(pc)].initialized); + return infos_[script_->pcToOffset(pc)]; + } + + BytecodeInfo* maybeInfo(jsbytecode* pc) { + if (infos_[script_->pcToOffset(pc)].initialized) + return &infos_[script_->pcToOffset(pc)]; + return nullptr; + } + + bool usesEnvironmentChain() const { + return usesEnvironmentChain_; + } + + bool hasTryFinally() const { + return hasTryFinally_; + } + + bool hasSetArg() const { + return hasSetArg_; + } +}; + + +} // namespace jit +} // namespace js + +#endif /* jit_BytecodeAnalysis_h */ |