Rollback to Version 3.30.33 (based on 6bee6dcebc3033d4665a8069020302ce5018522d)
git-svn-id: https://v8.googlecode.com/svn/trunk@25196 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
diff --git a/src/arm/assembler-arm.cc b/src/arm/assembler-arm.cc
index eae38be..17bf4f9 100644
--- a/src/arm/assembler-arm.cc
+++ b/src/arm/assembler-arm.cc
@@ -2545,20 +2545,27 @@
uint32_t lo, hi;
DoubleAsTwoUInt32(imm, &lo, &hi);
- if (lo == hi) {
- // Move the low and high parts of the double to a D register in one
- // instruction.
- mov(ip, Operand(lo));
- vmov(dst, ip, ip);
- } else if (scratch.is(no_reg)) {
- mov(ip, Operand(lo));
- vmov(dst, VmovIndexLo, ip);
- if ((lo & 0xffff) == (hi & 0xffff)) {
- movt(ip, hi >> 16);
- } else {
+ if (scratch.is(no_reg)) {
+ if (dst.code() < 16) {
+ const LowDwVfpRegister loc = LowDwVfpRegister::from_code(dst.code());
+ // Move the low part of the double into the lower of the corresponsing S
+ // registers of D register dst.
+ mov(ip, Operand(lo));
+ vmov(loc.low(), ip);
+
+ // Move the high part of the double into the higher of the
+ // corresponsing S registers of D register dst.
mov(ip, Operand(hi));
+ vmov(loc.high(), ip);
+ } else {
+ // D16-D31 does not have S registers, so move the low and high parts
+ // directly to the D register using vmov.32.
+ // Note: This may be slower, so we only do this when we have to.
+ mov(ip, Operand(lo));
+ vmov(dst, VmovIndexLo, ip);
+ mov(ip, Operand(hi));
+ vmov(dst, VmovIndexHi, ip);
}
- vmov(dst, VmovIndexHi, ip);
} else {
// Move the low and high parts of the double to a D register in one
// instruction.
diff --git a/src/arm/simulator-arm.cc b/src/arm/simulator-arm.cc
index 972fd07..aeb35c8 100644
--- a/src/arm/simulator-arm.cc
+++ b/src/arm/simulator-arm.cc
@@ -2960,7 +2960,7 @@
} else if (((instr->Opc2Value() == 0x6)) && (instr->Opc3Value() == 0x3)) {
// vrintz - truncate
double dm_value = get_double_from_d_register(vm);
- double dd_value = trunc(dm_value);
+ double dd_value = std::trunc(dm_value);
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
@@ -3624,7 +3624,7 @@
int rounding_mode = instr->Bits(17, 16);
switch (rounding_mode) {
case 0x0: // vrinta - round with ties to away from zero
- dd_value = round(dm_value);
+ dd_value = std::round(dm_value);
break;
case 0x1: { // vrintn - round with ties to even
dd_value = std::floor(dm_value);
diff --git a/src/arm64/delayed-masm-arm64.cc b/src/arm64/delayed-masm-arm64.cc
index b51e77e..c3bda91 100644
--- a/src/arm64/delayed-masm-arm64.cc
+++ b/src/arm64/delayed-masm-arm64.cc
@@ -16,8 +16,8 @@
void DelayedMasm::StackSlotMove(LOperand* src, LOperand* dst) {
- DCHECK((src->IsStackSlot() && dst->IsStackSlot()) ||
- (src->IsDoubleStackSlot() && dst->IsDoubleStackSlot()));
+ DCHECK(src->IsStackSlot());
+ DCHECK(dst->IsStackSlot());
MemOperand src_operand = cgen_->ToMemOperand(src);
MemOperand dst_operand = cgen_->ToMemOperand(dst);
if (pending_ == kStackSlotMove) {
diff --git a/src/ast.cc b/src/ast.cc
index 26bc491..1df668d 100644
--- a/src/ast.cc
+++ b/src/ast.cc
@@ -61,9 +61,9 @@
VariableProxy::VariableProxy(Zone* zone, Variable* var, int position)
: Expression(zone, position),
- bit_field_(IsThisField::encode(var->is_this()) |
- IsAssignedField::encode(false) |
- IsResolvedField::encode(false)),
+ is_this_(var->is_this()),
+ is_assigned_(false),
+ is_resolved_(false),
variable_feedback_slot_(FeedbackVectorICSlot::Invalid()),
raw_name_(var->raw_name()),
interface_(var->interface()) {
@@ -74,8 +74,9 @@
VariableProxy::VariableProxy(Zone* zone, const AstRawString* name, bool is_this,
Interface* interface, int position)
: Expression(zone, position),
- bit_field_(IsThisField::encode(is_this) | IsAssignedField::encode(false) |
- IsResolvedField::encode(false)),
+ is_this_(is_this),
+ is_assigned_(false),
+ is_resolved_(false),
variable_feedback_slot_(FeedbackVectorICSlot::Invalid()),
raw_name_(name),
interface_(interface) {}
@@ -98,17 +99,17 @@
Assignment::Assignment(Zone* zone, Token::Value op, Expression* target,
Expression* value, int pos)
: Expression(zone, pos),
- bit_field_(IsUninitializedField::encode(false) |
- KeyTypeField::encode(ELEMENT) |
- StoreModeField::encode(STANDARD_STORE) |
- TokenField::encode(op)),
+ is_uninitialized_(false),
+ key_type_(ELEMENT),
+ store_mode_(STANDARD_STORE),
+ op_(op),
target_(target),
value_(value),
binary_operation_(NULL) {}
Token::Value Assignment::binary_op() const {
- switch (op()) {
+ switch (op_) {
case Token::ASSIGN_BIT_OR: return Token::BIT_OR;
case Token::ASSIGN_BIT_XOR: return Token::BIT_XOR;
case Token::ASSIGN_BIT_AND: return Token::BIT_AND;
diff --git a/src/ast.h b/src/ast.h
index 749e579..aa23b4e 100644
--- a/src/ast.h
+++ b/src/ast.h
@@ -359,16 +359,11 @@
void set_bounds(Bounds bounds) { bounds_ = bounds; }
// Whether the expression is parenthesized
- bool is_parenthesized() const {
- return IsParenthesizedField::decode(bit_field_);
- }
- bool is_multi_parenthesized() const {
- return IsMultiParenthesizedField::decode(bit_field_);
- }
+ bool is_parenthesized() const { return is_parenthesized_; }
+ bool is_multi_parenthesized() const { return is_multi_parenthesized_; }
void increase_parenthesization_level() {
- bit_field_ =
- IsMultiParenthesizedField::update(bit_field_, is_parenthesized());
- bit_field_ = IsParenthesizedField::update(bit_field_, true);
+ is_multi_parenthesized_ = is_parenthesized_;
+ is_parenthesized_ = true;
}
// Type feedback information for assignments and properties.
@@ -380,20 +375,18 @@
UNREACHABLE();
return NULL;
}
- virtual KeyedAccessStoreMode GetStoreMode() const {
+ virtual KeyedAccessStoreMode GetStoreMode() {
UNREACHABLE();
return STANDARD_STORE;
}
- virtual IcCheckType GetKeyType() const {
+ virtual IcCheckType GetKeyType() {
UNREACHABLE();
return ELEMENT;
}
// TODO(rossberg): this should move to its own AST node eventually.
virtual void RecordToBooleanTypeFeedback(TypeFeedbackOracle* oracle);
- byte to_boolean_types() const {
- return ToBooleanTypesField::decode(bit_field_);
- }
+ byte to_boolean_types() const { return to_boolean_types_; }
void set_base_id(int id) { base_id_ = id; }
static int num_ids() { return parent_num_ids() + 2; }
@@ -405,11 +398,10 @@
: AstNode(pos),
base_id_(BailoutId::None().ToInt()),
bounds_(Bounds::Unbounded(zone)),
- bit_field_(0) {}
+ is_parenthesized_(false),
+ is_multi_parenthesized_(false) {}
static int parent_num_ids() { return 0; }
- void set_to_boolean_types(byte types) {
- bit_field_ = ToBooleanTypesField::update(bit_field_, types);
- }
+ void set_to_boolean_types(byte types) { to_boolean_types_ = types; }
int base_id() const {
DCHECK(!BailoutId(base_id_).IsNone());
@@ -421,12 +413,9 @@
int base_id_;
Bounds bounds_;
- class ToBooleanTypesField : public BitField16<byte, 0, 8> {};
- class IsParenthesizedField : public BitField16<bool, 8, 1> {};
- class IsMultiParenthesizedField : public BitField16<bool, 9, 1> {};
- uint16_t bit_field_;
- // Ends with 16-bit field; deriving classes in turn begin with
- // 16-bit fields for optimum packing efficiency.
+ byte to_boolean_types_;
+ bool is_parenthesized_ : 1;
+ bool is_multi_parenthesized_ : 1;
};
@@ -1708,17 +1697,13 @@
var_ = v;
}
- bool is_this() const { return IsThisField::decode(bit_field_); }
+ bool is_this() const { return is_this_; }
- bool is_assigned() const { return IsAssignedField::decode(bit_field_); }
- void set_is_assigned() {
- bit_field_ = IsAssignedField::update(bit_field_, true);
- }
+ bool is_assigned() const { return is_assigned_; }
+ void set_is_assigned() { is_assigned_ = true; }
- bool is_resolved() const { return IsResolvedField::decode(bit_field_); }
- void set_is_resolved() {
- bit_field_ = IsResolvedField::update(bit_field_, true);
- }
+ bool is_resolved() const { return is_resolved_; }
+ void set_is_resolved() { is_resolved_ = true; }
Interface* interface() const { return interface_; }
@@ -1742,13 +1727,9 @@
VariableProxy(Zone* zone, const AstRawString* name, bool is_this,
Interface* interface, int position);
- class IsThisField : public BitField8<bool, 0, 1> {};
- class IsAssignedField : public BitField8<bool, 1, 1> {};
- class IsResolvedField : public BitField8<bool, 2, 1> {};
-
- // Start with 16-bit (or smaller) field, which should get packed together
- // with Expression's trailing 16-bit field.
- uint8_t bit_field_;
+ bool is_this_ : 1;
+ bool is_assigned_ : 1;
+ bool is_resolved_ : 1;
FeedbackVectorICSlot variable_feedback_slot_;
union {
const AstRawString* raw_name_; // if !is_resolved_
@@ -1771,9 +1752,7 @@
BailoutId LoadId() const { return BailoutId(local_id(0)); }
TypeFeedbackId PropertyFeedbackId() { return TypeFeedbackId(local_id(1)); }
- bool IsStringAccess() const {
- return IsStringAccessField::decode(bit_field_);
- }
+ bool IsStringAccess() const { return is_string_access_; }
// Type feedback information.
virtual bool IsMonomorphic() OVERRIDE {
@@ -1782,29 +1761,21 @@
virtual SmallMapList* GetReceiverTypes() OVERRIDE {
return &receiver_types_;
}
- virtual KeyedAccessStoreMode GetStoreMode() const OVERRIDE {
+ virtual KeyedAccessStoreMode GetStoreMode() OVERRIDE {
return STANDARD_STORE;
}
- virtual IcCheckType GetKeyType() const OVERRIDE {
+ virtual IcCheckType GetKeyType() OVERRIDE {
// PROPERTY key types currently aren't implemented for KeyedLoadICs.
return ELEMENT;
}
- bool IsUninitialized() const {
- return !is_for_call() && HasNoTypeInformation();
+ bool IsUninitialized() { return !is_for_call_ && is_uninitialized_; }
+ bool HasNoTypeInformation() {
+ return is_uninitialized_;
}
- bool HasNoTypeInformation() const {
- return IsUninitializedField::decode(bit_field_);
- }
- void set_is_uninitialized(bool b) {
- bit_field_ = IsUninitializedField::update(bit_field_, b);
- }
- void set_is_string_access(bool b) {
- bit_field_ = IsStringAccessField::update(bit_field_, b);
- }
- void mark_for_call() {
- bit_field_ = IsForCallField::update(bit_field_, true);
- }
- bool is_for_call() const { return IsForCallField::decode(bit_field_); }
+ void set_is_uninitialized(bool b) { is_uninitialized_ = b; }
+ void set_is_string_access(bool b) { is_string_access_ = b; }
+ void mark_for_call() { is_for_call_ = true; }
+ bool IsForCall() { return is_for_call_; }
bool IsSuperAccess() {
return obj()->IsSuperReference();
@@ -1824,9 +1795,9 @@
protected:
Property(Zone* zone, Expression* obj, Expression* key, int pos)
: Expression(zone, pos),
- bit_field_(IsForCallField::encode(false) |
- IsUninitializedField::encode(false) |
- IsStringAccessField::encode(false)),
+ is_for_call_(false),
+ is_uninitialized_(false),
+ is_string_access_(false),
property_feedback_slot_(FeedbackVectorICSlot::Invalid()),
obj_(obj),
key_(key) {}
@@ -1835,10 +1806,9 @@
private:
int local_id(int n) const { return base_id() + parent_num_ids() + n; }
- class IsForCallField : public BitField8<bool, 0, 1> {};
- class IsUninitializedField : public BitField8<bool, 1, 1> {};
- class IsStringAccessField : public BitField8<bool, 2, 1> {};
- uint8_t bit_field_;
+ bool is_for_call_ : 1;
+ bool is_uninitialized_ : 1;
+ bool is_string_access_ : 1;
FeedbackVectorICSlot property_feedback_slot_;
Expression* obj_;
Expression* key_;
@@ -2150,10 +2120,10 @@
public:
DECLARE_NODE_TYPE(CountOperation)
- bool is_prefix() const { return IsPrefixField::decode(bit_field_); }
- bool is_postfix() const { return !is_prefix(); }
+ bool is_prefix() const { return is_prefix_; }
+ bool is_postfix() const { return !is_prefix_; }
- Token::Value op() const { return TokenField::decode(bit_field_); }
+ Token::Value op() const { return op_; }
Token::Value binary_op() {
return (op() == Token::INC) ? Token::ADD : Token::SUB;
}
@@ -2166,19 +2136,13 @@
virtual SmallMapList* GetReceiverTypes() OVERRIDE {
return &receiver_types_;
}
- virtual IcCheckType GetKeyType() const OVERRIDE {
- return KeyTypeField::decode(bit_field_);
- }
- virtual KeyedAccessStoreMode GetStoreMode() const OVERRIDE {
- return StoreModeField::decode(bit_field_);
+ virtual IcCheckType GetKeyType() OVERRIDE { return key_type_; }
+ virtual KeyedAccessStoreMode GetStoreMode() OVERRIDE {
+ return store_mode_;
}
Type* type() const { return type_; }
- void set_key_type(IcCheckType type) {
- bit_field_ = KeyTypeField::update(bit_field_, type);
- }
- void set_store_mode(KeyedAccessStoreMode mode) {
- bit_field_ = StoreModeField::update(bit_field_, mode);
- }
+ void set_key_type(IcCheckType type) { key_type_ = type; }
+ void set_store_mode(KeyedAccessStoreMode mode) { store_mode_ = mode; }
void set_type(Type* type) { type_ = type; }
static int num_ids() { return parent_num_ids() + 3; }
@@ -2194,25 +2158,21 @@
CountOperation(Zone* zone, Token::Value op, bool is_prefix, Expression* expr,
int pos)
: Expression(zone, pos),
- bit_field_(IsPrefixField::encode(is_prefix) |
- KeyTypeField::encode(ELEMENT) |
- StoreModeField::encode(STANDARD_STORE) |
- TokenField::encode(op)),
- type_(NULL),
+ op_(op),
+ is_prefix_(is_prefix),
+ key_type_(ELEMENT),
+ store_mode_(STANDARD_STORE),
expression_(expr) {}
static int parent_num_ids() { return Expression::num_ids(); }
private:
int local_id(int n) const { return base_id() + parent_num_ids() + n; }
- class IsPrefixField : public BitField16<bool, 0, 1> {};
- class KeyTypeField : public BitField16<IcCheckType, 1, 1> {};
- class StoreModeField : public BitField16<KeyedAccessStoreMode, 2, 4> {};
- class TokenField : public BitField16<Token::Value, 6, 8> {};
-
- // Starts with 16-bit field, which should get packed together with
- // Expression's trailing 16-bit field.
- uint16_t bit_field_;
+ Token::Value op_;
+ bool is_prefix_ : 1;
+ IcCheckType key_type_ : 1;
+ KeyedAccessStoreMode store_mode_ : 5; // Windows treats as signed,
+ // must have extra bit.
Type* type_;
Expression* expression_;
SmallMapList receiver_types_;
@@ -2301,7 +2261,7 @@
Token::Value binary_op() const;
- Token::Value op() const { return TokenField::decode(bit_field_); }
+ Token::Value op() const { return op_; }
Expression* target() const { return target_; }
Expression* value() const { return value_; }
BinaryOperation* binary_operation() const { return binary_operation_; }
@@ -2317,30 +2277,20 @@
virtual bool IsMonomorphic() OVERRIDE {
return receiver_types_.length() == 1;
}
- bool IsUninitialized() const {
- return IsUninitializedField::decode(bit_field_);
- }
+ bool IsUninitialized() { return is_uninitialized_; }
bool HasNoTypeInformation() {
- return IsUninitializedField::decode(bit_field_);
+ return is_uninitialized_;
}
virtual SmallMapList* GetReceiverTypes() OVERRIDE {
return &receiver_types_;
}
- virtual IcCheckType GetKeyType() const OVERRIDE {
- return KeyTypeField::decode(bit_field_);
+ virtual IcCheckType GetKeyType() OVERRIDE { return key_type_; }
+ virtual KeyedAccessStoreMode GetStoreMode() OVERRIDE {
+ return store_mode_;
}
- virtual KeyedAccessStoreMode GetStoreMode() const OVERRIDE {
- return StoreModeField::decode(bit_field_);
- }
- void set_is_uninitialized(bool b) {
- bit_field_ = IsUninitializedField::update(bit_field_, b);
- }
- void set_key_type(IcCheckType key_type) {
- bit_field_ = KeyTypeField::update(bit_field_, key_type);
- }
- void set_store_mode(KeyedAccessStoreMode mode) {
- bit_field_ = StoreModeField::update(bit_field_, mode);
- }
+ void set_is_uninitialized(bool b) { is_uninitialized_ = b; }
+ void set_key_type(IcCheckType key_type) { key_type_ = key_type; }
+ void set_store_mode(KeyedAccessStoreMode mode) { store_mode_ = mode; }
protected:
Assignment(Zone* zone, Token::Value op, Expression* target, Expression* value,
@@ -2349,7 +2299,7 @@
template <class Visitor>
void Init(AstNodeFactory<Visitor>* factory) {
- DCHECK(Token::IsAssignmentOp(op()));
+ DCHECK(Token::IsAssignmentOp(op_));
if (is_compound()) {
binary_operation_ = factory->NewBinaryOperation(
binary_op(), target_, value_, position() + 1);
@@ -2359,14 +2309,11 @@
private:
int local_id(int n) const { return base_id() + parent_num_ids() + n; }
- class IsUninitializedField : public BitField16<bool, 0, 1> {};
- class KeyTypeField : public BitField16<IcCheckType, 1, 1> {};
- class StoreModeField : public BitField16<KeyedAccessStoreMode, 2, 4> {};
- class TokenField : public BitField16<Token::Value, 6, 8> {};
-
- // Starts with 16-bit field, which should get packed together with
- // Expression's trailing 16-bit field.
- uint16_t bit_field_;
+ bool is_uninitialized_ : 1;
+ IcCheckType key_type_ : 1;
+ KeyedAccessStoreMode store_mode_ : 5; // Windows treats as signed,
+ // must have extra bit.
+ Token::Value op_;
Expression* target_;
Expression* value_;
BinaryOperation* binary_operation_;
diff --git a/src/base/atomicops_internals_mac.h b/src/base/atomicops_internals_mac.h
index 84f9dbc..a046872 100644
--- a/src/base/atomicops_internals_mac.h
+++ b/src/base/atomicops_internals_mac.h
@@ -12,20 +12,6 @@
namespace v8 {
namespace base {
-#define ATOMICOPS_COMPILER_BARRIER() __asm__ __volatile__("" : : : "memory")
-
-inline void MemoryBarrier() { OSMemoryBarrier(); }
-
-inline void AcquireMemoryBarrier() {
-// On x86 processors, loads already have acquire semantics, so
-// there is no need to put a full barrier here.
-#if V8_HOST_ARCH_IA32 || V8_HOST_ARCH_X64
- ATOMICOPS_COMPILER_BARRIER();
-#else
- MemoryBarrier();
-#endif
-}
-
inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
Atomic32 old_value,
Atomic32 new_value) {
@@ -60,6 +46,10 @@
return OSAtomicAdd32Barrier(increment, const_cast<Atomic32*>(ptr));
}
+inline void MemoryBarrier() {
+ OSMemoryBarrier();
+}
+
inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
Atomic32 old_value,
Atomic32 new_value) {
@@ -108,7 +98,7 @@
inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
Atomic32 value = *ptr;
- AcquireMemoryBarrier();
+ MemoryBarrier();
return value;
}
@@ -198,7 +188,7 @@
inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
Atomic64 value = *ptr;
- AcquireMemoryBarrier();
+ MemoryBarrier();
return value;
}
@@ -209,7 +199,6 @@
#endif // defined(__LP64__)
-#undef ATOMICOPS_COMPILER_BARRIER
} } // namespace v8::base
#endif // V8_BASE_ATOMICOPS_INTERNALS_MAC_H_
diff --git a/src/base/platform/platform-linux.cc b/src/base/platform/platform-linux.cc
index b13a1e8..eff5ced 100644
--- a/src/base/platform/platform-linux.cc
+++ b/src/base/platform/platform-linux.cc
@@ -109,7 +109,7 @@
if (std::isnan(time)) return "";
time_t tv = static_cast<time_t>(std::floor(time/msPerSecond));
struct tm* t = localtime(&tv);
- if (!t || !t->tm_zone) return "";
+ if (NULL == t) return "";
return t->tm_zone;
#endif
}
diff --git a/src/compiler/access-builder.cc b/src/compiler/access-builder.cc
index 583bd3a..2c27022 100644
--- a/src/compiler/access-builder.cc
+++ b/src/compiler/access-builder.cc
@@ -106,10 +106,10 @@
Type::Unsigned32(), kMachUint32};
case kExternalFloat32Array:
return {kTypedArrayBoundsCheck, taggedness, header_size, Type::Number(),
- kMachFloat32};
+ kRepFloat32};
case kExternalFloat64Array:
return {kTypedArrayBoundsCheck, taggedness, header_size, Type::Number(),
- kMachFloat64};
+ kRepFloat64};
}
UNREACHABLE();
return {kTypedArrayBoundsCheck, kUntaggedBase, 0, Type::None(), kMachNone};
diff --git a/src/compiler/arm64/code-generator-arm64.cc b/src/compiler/arm64/code-generator-arm64.cc
index 0c75b7c..58886ae 100644
--- a/src/compiler/arm64/code-generator-arm64.cc
+++ b/src/compiler/arm64/code-generator-arm64.cc
@@ -100,7 +100,8 @@
return MemOperand(InputRegister(index + 0), InputInt32(index + 1));
case kMode_MRR:
*first_index += 2;
- return MemOperand(InputRegister(index + 0), InputRegister(index + 1));
+ return MemOperand(InputRegister(index + 0), InputRegister(index + 1),
+ SXTW);
}
UNREACHABLE();
return MemOperand(no_reg);
diff --git a/src/compiler/ast-graph-builder.cc b/src/compiler/ast-graph-builder.cc
index 805afc5..7b5abd1 100644
--- a/src/compiler/ast-graph-builder.cc
+++ b/src/compiler/ast-graph-builder.cc
@@ -1173,8 +1173,8 @@
switch (assign_type) {
case VARIABLE: {
Variable* variable = expr->target()->AsVariableProxy()->var();
- BuildVariableAssignment(variable, value, expr->op(), expr->AssignmentId(),
- ast_context()->GetStateCombine());
+ BuildVariableAssignment(variable, value, expr->op(),
+ expr->AssignmentId());
break;
}
case NAMED_PROPERTY: {
@@ -1183,8 +1183,7 @@
MakeUnique(property->key()->AsLiteral()->AsPropertyName());
Node* store =
NewNode(javascript()->StoreNamed(strict_mode(), name), object, value);
- PrepareFrameState(store, expr->AssignmentId(),
- ast_context()->GetStateCombine());
+ PrepareFrameState(store, expr->AssignmentId());
break;
}
case KEYED_PROPERTY: {
@@ -1192,8 +1191,7 @@
Node* object = environment()->Pop();
Node* store = NewNode(javascript()->StoreProperty(strict_mode()), object,
key, value);
- PrepareFrameState(store, expr->AssignmentId(),
- ast_context()->GetStateCombine());
+ PrepareFrameState(store, expr->AssignmentId());
break;
}
}
@@ -1959,9 +1957,9 @@
}
-Node* AstGraphBuilder::BuildVariableAssignment(
- Variable* variable, Node* value, Token::Value op, BailoutId bailout_id,
- OutputFrameStateCombine combine) {
+Node* AstGraphBuilder::BuildVariableAssignment(Variable* variable, Node* value,
+ Token::Value op,
+ BailoutId bailout_id) {
Node* the_hole = jsgraph()->TheHoleConstant();
VariableMode mode = variable->mode();
switch (variable->location()) {
@@ -1971,7 +1969,7 @@
Unique<Name> name = MakeUnique(variable->name());
const Operator* op = javascript()->StoreNamed(strict_mode(), name);
Node* store = NewNode(op, global, value);
- PrepareFrameState(store, bailout_id, combine);
+ PrepareFrameState(store, bailout_id);
return store;
}
case Variable::PARAMETER:
@@ -2037,7 +2035,7 @@
const Operator* op =
javascript()->CallRuntime(Runtime::kStoreLookupSlot, 4);
Node* store = NewNode(op, value, current_context(), name, strict);
- PrepareFrameState(store, bailout_id, combine);
+ PrepareFrameState(store, bailout_id);
return store;
}
}
diff --git a/src/compiler/ast-graph-builder.h b/src/compiler/ast-graph-builder.h
index 518f23f..6e51723 100644
--- a/src/compiler/ast-graph-builder.h
+++ b/src/compiler/ast-graph-builder.h
@@ -80,9 +80,7 @@
// Builders for variable load and assignment.
Node* BuildVariableAssignment(Variable* var, Node* value, Token::Value op,
- BailoutId bailout_id,
- OutputFrameStateCombine state_combine =
- OutputFrameStateCombine::Ignore());
+ BailoutId bailout_id);
Node* BuildVariableDelete(Variable* var, BailoutId bailout_id,
OutputFrameStateCombine state_combine);
Node* BuildVariableLoad(Variable* var, BailoutId bailout_id,
diff --git a/src/compiler/instruction-selector.cc b/src/compiler/instruction-selector.cc
index ffbf2a3..877230c 100644
--- a/src/compiler/instruction-selector.cc
+++ b/src/compiler/instruction-selector.cc
@@ -833,7 +833,7 @@
#endif // V8_TURBOFAN_BACKEND
// 32 bit targets do not implement the following instructions.
-#if V8_TARGET_ARCH_32_BIT && !V8_TARGET_ARCH_X64 && V8_TURBOFAN_BACKEND
+#if V8_TARGET_ARCH_32_BIT && V8_TURBOFAN_BACKEND
void InstructionSelector::VisitWord64And(Node* node) { UNIMPLEMENTED(); }
@@ -905,7 +905,7 @@
UNIMPLEMENTED();
}
-#endif // V8_TARGET_ARCH_32_BIT && !V8_TARGET_ARCH_X64 && V8_TURBOFAN_BACKEND
+#endif // V8_TARGET_ARCH_32_BIT && V8_TURBOFAN_BACKEND
void InstructionSelector::VisitFinish(Node* node) {
diff --git a/src/compiler/instruction.cc b/src/compiler/instruction.cc
index ad7a5ee..76a6950 100644
--- a/src/compiler/instruction.cc
+++ b/src/compiler/instruction.cc
@@ -346,7 +346,7 @@
static BasicBlock::RpoNumber GetLoopEndRpo(const BasicBlock* block) {
if (!block->IsLoopHeader()) return BasicBlock::RpoNumber::Invalid();
- return block->loop_end()->GetRpoNumber();
+ return BasicBlock::RpoNumber::FromInt(block->loop_end());
}
diff --git a/src/compiler/register-allocator.cc b/src/compiler/register-allocator.cc
index c65b906..7a82768 100644
--- a/src/compiler/register-allocator.cc
+++ b/src/compiler/register-allocator.cc
@@ -199,7 +199,7 @@
}
-InstructionOperand* LiveRange::CreateAssignedOperand(Zone* zone) const {
+InstructionOperand* LiveRange::CreateAssignedOperand(Zone* zone) {
InstructionOperand* op = NULL;
if (HasRegisterAssigned()) {
DCHECK(!IsSpilled());
@@ -507,24 +507,23 @@
RegisterAllocator::RegisterAllocator(const RegisterConfiguration* config,
- Zone* zone, Frame* frame,
+ Zone* local_zone, Frame* frame,
InstructionSequence* code,
const char* debug_name)
- : local_zone_(zone),
+ : zone_(local_zone),
frame_(frame),
code_(code),
debug_name_(debug_name),
config_(config),
- live_in_sets_(code->InstructionBlockCount(), local_zone()),
- live_ranges_(code->VirtualRegisterCount() * 2, local_zone()),
- fixed_live_ranges_(this->config()->num_general_registers(), NULL,
- local_zone()),
+ live_in_sets_(code->InstructionBlockCount(), zone()),
+ live_ranges_(code->VirtualRegisterCount() * 2, zone()),
+ fixed_live_ranges_(this->config()->num_general_registers(), NULL, zone()),
fixed_double_live_ranges_(this->config()->num_double_registers(), NULL,
- local_zone()),
- unhandled_live_ranges_(code->VirtualRegisterCount() * 2, local_zone()),
- active_live_ranges_(8, local_zone()),
- inactive_live_ranges_(8, local_zone()),
- reusable_slots_(8, local_zone()),
+ zone()),
+ unhandled_live_ranges_(code->VirtualRegisterCount() * 2, zone()),
+ active_live_ranges_(8, zone()),
+ inactive_live_ranges_(8, zone()),
+ reusable_slots_(8, zone()),
mode_(UNALLOCATED_REGISTERS),
num_registers_(-1),
allocation_ok_(true) {
@@ -542,16 +541,16 @@
void RegisterAllocator::InitializeLivenessAnalysis() {
// Initialize the live_in sets for each block to NULL.
int block_count = code()->InstructionBlockCount();
- live_in_sets_.Initialize(block_count, local_zone());
- live_in_sets_.AddBlock(NULL, block_count, local_zone());
+ live_in_sets_.Initialize(block_count, zone());
+ live_in_sets_.AddBlock(NULL, block_count, zone());
}
BitVector* RegisterAllocator::ComputeLiveOut(const InstructionBlock* block) {
// Compute live out for the given block, except not including backward
// successor edges.
- BitVector* live_out = new (local_zone())
- BitVector(code()->VirtualRegisterCount(), local_zone());
+ BitVector* live_out =
+ new (zone()) BitVector(code()->VirtualRegisterCount(), zone());
// Process all successor blocks.
for (auto succ : block->successors()) {
@@ -585,7 +584,7 @@
while (!iterator.Done()) {
int operand_index = iterator.Current();
LiveRange* range = LiveRangeFor(operand_index);
- range->AddUseInterval(start, end, local_zone());
+ range->AddUseInterval(start, end, zone());
iterator.Advance();
}
}
@@ -631,7 +630,7 @@
// The LiveRange object itself can go in this zone, but the
// InstructionOperand needs
// to go in the code zone, since it may survive register allocation.
- result = new (local_zone()) LiveRange(FixedLiveRangeID(index), code_zone());
+ result = new (zone()) LiveRange(FixedLiveRangeID(index), code_zone());
DCHECK(result->IsFixed());
result->kind_ = GENERAL_REGISTERS;
SetLiveRangeAssignedRegister(result, index);
@@ -645,8 +644,7 @@
DCHECK(index < config()->num_aliased_double_registers());
LiveRange* result = fixed_double_live_ranges_[index];
if (result == NULL) {
- result = new (local_zone())
- LiveRange(FixedDoubleLiveRangeID(index), code_zone());
+ result = new (zone()) LiveRange(FixedDoubleLiveRangeID(index), code_zone());
DCHECK(result->IsFixed());
result->kind_ = DOUBLE_REGISTERS;
SetLiveRangeAssignedRegister(result, index);
@@ -658,12 +656,11 @@
LiveRange* RegisterAllocator::LiveRangeFor(int index) {
if (index >= live_ranges_.length()) {
- live_ranges_.AddBlock(NULL, index - live_ranges_.length() + 1,
- local_zone());
+ live_ranges_.AddBlock(NULL, index - live_ranges_.length() + 1, zone());
}
LiveRange* result = live_ranges_[index];
if (result == NULL) {
- result = new (local_zone()) LiveRange(index, code_zone());
+ result = new (zone()) LiveRange(index, code_zone());
live_ranges_[index] = result;
}
return result;
@@ -697,15 +694,15 @@
if (range->IsEmpty() || range->Start().Value() > position.Value()) {
// Can happen if there is a definition without use.
- range->AddUseInterval(position, position.NextInstruction(), local_zone());
- range->AddUsePosition(position.NextInstruction(), NULL, NULL, local_zone());
+ range->AddUseInterval(position, position.NextInstruction(), zone());
+ range->AddUsePosition(position.NextInstruction(), NULL, NULL, zone());
} else {
range->ShortenTo(position);
}
if (operand->IsUnallocated()) {
UnallocatedOperand* unalloc_operand = UnallocatedOperand::cast(operand);
- range->AddUsePosition(position, unalloc_operand, hint, local_zone());
+ range->AddUsePosition(position, unalloc_operand, hint, zone());
}
}
@@ -718,9 +715,9 @@
if (range == NULL) return;
if (operand->IsUnallocated()) {
UnallocatedOperand* unalloc_operand = UnallocatedOperand::cast(operand);
- range->AddUsePosition(position, unalloc_operand, hint, local_zone());
+ range->AddUsePosition(position, unalloc_operand, hint, zone());
}
- range->AddUseInterval(block_start, position, local_zone());
+ range->AddUseInterval(block_start, position, zone());
}
@@ -1026,7 +1023,7 @@
if (!IsOutputRegisterOf(instr, i)) {
LiveRange* range = FixedLiveRangeFor(i);
range->AddUseInterval(curr_position, curr_position.InstructionEnd(),
- local_zone());
+ zone());
}
}
}
@@ -1036,7 +1033,7 @@
if (!IsOutputDoubleRegisterOf(instr, i)) {
LiveRange* range = FixedDoubleLiveRangeFor(i);
range->AddUseInterval(curr_position, curr_position.InstructionEnd(),
- local_zone());
+ zone());
}
}
}
@@ -1163,8 +1160,9 @@
void RegisterAllocator::MeetRegisterConstraints() {
- for (auto block : code()->instruction_blocks()) {
- MeetRegisterConstraints(block);
+ for (int i = 0; i < code()->InstructionBlockCount(); ++i) {
+ MeetRegisterConstraints(
+ code()->InstructionBlockAt(BasicBlock::RpoNumber::FromInt(i)));
if (!AllocationOk()) return;
}
}
@@ -1172,9 +1170,55 @@
void RegisterAllocator::ResolvePhis() {
// Process the blocks in reverse order.
- for (auto i = code()->instruction_blocks().rbegin();
- i != code()->instruction_blocks().rend(); ++i) {
- ResolvePhis(*i);
+ for (int i = code()->InstructionBlockCount() - 1; i >= 0; --i) {
+ ResolvePhis(code()->InstructionBlockAt(BasicBlock::RpoNumber::FromInt(i)));
+ }
+}
+
+
+void RegisterAllocator::ResolveControlFlow(LiveRange* range,
+ const InstructionBlock* block,
+ const InstructionBlock* pred) {
+ LifetimePosition pred_end =
+ LifetimePosition::FromInstructionIndex(pred->last_instruction_index());
+ LifetimePosition cur_start =
+ LifetimePosition::FromInstructionIndex(block->first_instruction_index());
+ LiveRange* pred_cover = NULL;
+ LiveRange* cur_cover = NULL;
+ LiveRange* cur_range = range;
+ while (cur_range != NULL && (cur_cover == NULL || pred_cover == NULL)) {
+ if (cur_range->CanCover(cur_start)) {
+ DCHECK(cur_cover == NULL);
+ cur_cover = cur_range;
+ }
+ if (cur_range->CanCover(pred_end)) {
+ DCHECK(pred_cover == NULL);
+ pred_cover = cur_range;
+ }
+ cur_range = cur_range->next();
+ }
+
+ if (cur_cover->IsSpilled()) return;
+ DCHECK(pred_cover != NULL && cur_cover != NULL);
+ if (pred_cover != cur_cover) {
+ InstructionOperand* pred_op =
+ pred_cover->CreateAssignedOperand(code_zone());
+ InstructionOperand* cur_op = cur_cover->CreateAssignedOperand(code_zone());
+ if (!pred_op->Equals(cur_op)) {
+ GapInstruction* gap = NULL;
+ if (block->PredecessorCount() == 1) {
+ gap = code()->GapAt(block->first_instruction_index());
+ } else {
+ DCHECK(pred->SuccessorCount() == 1);
+ gap = GetLastGap(pred);
+
+ Instruction* branch = InstructionAt(pred->last_instruction_index());
+ DCHECK(!branch->HasPointerMap());
+ USE(branch);
+ }
+ gap->GetOrCreateParallelMove(GapInstruction::START, code_zone())
+ ->AddMove(pred_op, cur_op, code_zone());
+ }
}
}
@@ -1244,146 +1288,20 @@
}
-namespace {
-
-class LiveRangeBound {
- public:
- explicit LiveRangeBound(const LiveRange* range)
- : range_(range), start_(range->Start()), end_(range->End()) {
- DCHECK(!range->IsEmpty());
- }
-
- bool CanCover(LifetimePosition position) {
- return start_.Value() <= position.Value() &&
- position.Value() < end_.Value();
- }
-
- const LiveRange* const range_;
- const LifetimePosition start_;
- const LifetimePosition end_;
-
- private:
- DISALLOW_COPY_AND_ASSIGN(LiveRangeBound);
-};
-
-
-struct FindResult {
- const LiveRange* cur_cover_;
- const LiveRange* pred_cover_;
-};
-
-
-class LiveRangeBoundArray {
- public:
- LiveRangeBoundArray() : length_(0), start_(nullptr) {}
-
- bool ShouldInitialize() { return start_ == NULL; }
-
- void Initialize(Zone* zone, const LiveRange* const range) {
- size_t length = 0;
- for (const LiveRange* i = range; i != NULL; i = i->next()) length++;
- start_ = zone->NewArray<LiveRangeBound>(static_cast<int>(length));
- length_ = length;
- LiveRangeBound* curr = start_;
- for (const LiveRange* i = range; i != NULL; i = i->next(), ++curr) {
- new (curr) LiveRangeBound(i);
- }
- }
-
- LiveRangeBound* Find(const LifetimePosition position) const {
- size_t left_index = 0;
- size_t right_index = length_;
- while (true) {
- size_t current_index = left_index + (right_index - left_index) / 2;
- DCHECK(right_index > current_index);
- LiveRangeBound* bound = &start_[current_index];
- if (bound->start_.Value() <= position.Value()) {
- if (position.Value() < bound->end_.Value()) return bound;
- DCHECK(left_index < current_index);
- left_index = current_index;
- } else {
- right_index = current_index;
- }
- }
- }
-
- void Find(const InstructionBlock* block, const InstructionBlock* pred,
- FindResult* result) const {
- const LifetimePosition pred_end =
- LifetimePosition::FromInstructionIndex(pred->last_instruction_index());
- LiveRangeBound* bound = Find(pred_end);
- result->pred_cover_ = bound->range_;
- const LifetimePosition cur_start = LifetimePosition::FromInstructionIndex(
- block->first_instruction_index());
- // Common case.
- if (bound->CanCover(cur_start)) {
- result->cur_cover_ = bound->range_;
- return;
- }
- result->cur_cover_ = Find(cur_start)->range_;
- DCHECK(result->pred_cover_ != NULL && result->cur_cover_ != NULL);
- }
-
- private:
- size_t length_;
- LiveRangeBound* start_;
-
- DISALLOW_COPY_AND_ASSIGN(LiveRangeBoundArray);
-};
-
-
-class LiveRangeFinder {
- public:
- explicit LiveRangeFinder(const RegisterAllocator& allocator)
- : allocator_(allocator),
- bounds_length_(allocator.live_ranges().length()),
- bounds_(allocator.local_zone()->NewArray<LiveRangeBoundArray>(
- bounds_length_)) {
- for (int i = 0; i < bounds_length_; ++i) {
- new (&bounds_[i]) LiveRangeBoundArray();
- }
- }
-
- LiveRangeBoundArray* ArrayFor(int operand_index) {
- DCHECK(operand_index < bounds_length_);
- const LiveRange* range = allocator_.live_ranges()[operand_index];
- DCHECK(range != nullptr && !range->IsEmpty());
- LiveRangeBoundArray* array = &bounds_[operand_index];
- if (array->ShouldInitialize()) {
- array->Initialize(allocator_.local_zone(), range);
- }
- return array;
- }
-
- private:
- const RegisterAllocator& allocator_;
- const int bounds_length_;
- LiveRangeBoundArray* const bounds_;
-
- DISALLOW_COPY_AND_ASSIGN(LiveRangeFinder);
-};
-
-} // namespace
-
-
void RegisterAllocator::ResolveControlFlow() {
- // Lazily linearize live ranges in memory for fast lookup.
- LiveRangeFinder finder(*this);
- for (auto block : code()->instruction_blocks()) {
+ for (int block_id = 1; block_id < code()->InstructionBlockCount();
+ ++block_id) {
+ const InstructionBlock* block =
+ code()->InstructionBlockAt(BasicBlock::RpoNumber::FromInt(block_id));
if (CanEagerlyResolveControlFlow(block)) continue;
BitVector* live = live_in_sets_[block->rpo_number().ToInt()];
BitVector::Iterator iterator(live);
while (!iterator.Done()) {
- LiveRangeBoundArray* array = finder.ArrayFor(iterator.Current());
+ int operand_index = iterator.Current();
for (auto pred : block->predecessors()) {
- FindResult result;
- const InstructionBlock* pred_block = code()->InstructionBlockAt(pred);
- array->Find(block, pred_block, &result);
- if (result.cur_cover_ == result.pred_cover_ ||
- result.cur_cover_->IsSpilled())
- continue;
- ResolveControlFlow(block, result.cur_cover_, pred_block,
- result.pred_cover_);
+ const InstructionBlock* cur = code()->InstructionBlockAt(pred);
+ LiveRange* cur_range = LiveRangeFor(operand_index);
+ ResolveControlFlow(cur_range, block, cur);
}
iterator.Advance();
}
@@ -1391,30 +1309,6 @@
}
-void RegisterAllocator::ResolveControlFlow(const InstructionBlock* block,
- const LiveRange* cur_cover,
- const InstructionBlock* pred,
- const LiveRange* pred_cover) {
- InstructionOperand* pred_op = pred_cover->CreateAssignedOperand(code_zone());
- InstructionOperand* cur_op = cur_cover->CreateAssignedOperand(code_zone());
- if (!pred_op->Equals(cur_op)) {
- GapInstruction* gap = NULL;
- if (block->PredecessorCount() == 1) {
- gap = code()->GapAt(block->first_instruction_index());
- } else {
- DCHECK(pred->SuccessorCount() == 1);
- gap = GetLastGap(pred);
-
- Instruction* branch = InstructionAt(pred->last_instruction_index());
- DCHECK(!branch->HasPointerMap());
- USE(branch);
- }
- gap->GetOrCreateParallelMove(GapInstruction::START, code_zone())
- ->AddMove(pred_op, cur_op, code_zone());
- }
-}
-
-
void RegisterAllocator::BuildLiveRanges() {
InitializeLivenessAnalysis();
// Process the blocks in reverse order.
@@ -1477,7 +1371,7 @@
while (!iterator.Done()) {
int operand_index = iterator.Current();
LiveRange* range = LiveRangeFor(operand_index);
- range->EnsureInterval(start, end, local_zone());
+ range->EnsureInterval(start, end, zone());
iterator.Advance();
}
@@ -1773,13 +1667,13 @@
void RegisterAllocator::AddToActive(LiveRange* range) {
TraceAlloc("Add live range %d to active\n", range->id());
- active_live_ranges_.Add(range, local_zone());
+ active_live_ranges_.Add(range, zone());
}
void RegisterAllocator::AddToInactive(LiveRange* range) {
TraceAlloc("Add live range %d to inactive\n", range->id());
- inactive_live_ranges_.Add(range, local_zone());
+ inactive_live_ranges_.Add(range, zone());
}
@@ -1791,13 +1685,13 @@
LiveRange* cur_range = unhandled_live_ranges_.at(i);
if (range->ShouldBeAllocatedBefore(cur_range)) {
TraceAlloc("Add live range %d to unhandled at %d\n", range->id(), i + 1);
- unhandled_live_ranges_.InsertAt(i + 1, range, local_zone());
+ unhandled_live_ranges_.InsertAt(i + 1, range, zone());
DCHECK(UnhandledIsSorted());
return;
}
}
TraceAlloc("Add live range %d to unhandled at start\n", range->id());
- unhandled_live_ranges_.InsertAt(0, range, local_zone());
+ unhandled_live_ranges_.InsertAt(0, range, zone());
DCHECK(UnhandledIsSorted());
}
@@ -1806,7 +1700,7 @@
if (range == NULL || range->IsEmpty()) return;
DCHECK(!range->HasRegisterAssigned() && !range->IsSpilled());
TraceAlloc("Add live range %d to unhandled unsorted at end\n", range->id());
- unhandled_live_ranges_.Add(range, local_zone());
+ unhandled_live_ranges_.Add(range, zone());
}
@@ -1848,7 +1742,7 @@
InstructionOperand* spill_operand = range->TopLevel()->GetSpillOperand();
if (spill_operand->IsConstant()) return;
if (spill_operand->index() >= 0) {
- reusable_slots_.Add(range, local_zone());
+ reusable_slots_.Add(range, zone());
}
}
@@ -1877,7 +1771,7 @@
void RegisterAllocator::ActiveToInactive(LiveRange* range) {
DCHECK(active_live_ranges_.Contains(range));
active_live_ranges_.RemoveElement(range);
- inactive_live_ranges_.Add(range, local_zone());
+ inactive_live_ranges_.Add(range, zone());
TraceAlloc("Moving live range %d from active to inactive\n", range->id());
}
@@ -1893,7 +1787,7 @@
void RegisterAllocator::InactiveToActive(LiveRange* range) {
DCHECK(inactive_live_ranges_.Contains(range));
inactive_live_ranges_.RemoveElement(range);
- active_live_ranges_.Add(range, local_zone());
+ active_live_ranges_.Add(range, zone());
TraceAlloc("Moving live range %d from inactive to active\n", range->id());
}
@@ -2169,7 +2063,7 @@
int vreg = GetVirtualRegister();
if (!AllocationOk()) return NULL;
LiveRange* result = LiveRangeFor(vreg);
- range->SplitAt(pos, result, local_zone());
+ range->SplitAt(pos, result, zone());
return result;
}
@@ -2277,10 +2171,10 @@
RegisterKind kind = range->Kind();
int index = frame()->AllocateSpillSlot(kind == DOUBLE_REGISTERS);
if (kind == DOUBLE_REGISTERS) {
- op = DoubleStackSlotOperand::Create(index, local_zone());
+ op = DoubleStackSlotOperand::Create(index, zone());
} else {
DCHECK(kind == GENERAL_REGISTERS);
- op = StackSlotOperand::Create(index, local_zone());
+ op = StackSlotOperand::Create(index, zone());
}
}
first->SetSpillOperand(op);
diff --git a/src/compiler/register-allocator.h b/src/compiler/register-allocator.h
index a6578af..b167437 100644
--- a/src/compiler/register-allocator.h
+++ b/src/compiler/register-allocator.h
@@ -186,15 +186,12 @@
UsePosition* first_pos() const { return first_pos_; }
LiveRange* parent() const { return parent_; }
LiveRange* TopLevel() { return (parent_ == NULL) ? this : parent_; }
- const LiveRange* TopLevel() const {
- return (parent_ == NULL) ? this : parent_;
- }
LiveRange* next() const { return next_; }
bool IsChild() const { return parent() != NULL; }
int id() const { return id_; }
bool IsFixed() const { return id_ < 0; }
bool IsEmpty() const { return first_interval() == NULL; }
- InstructionOperand* CreateAssignedOperand(Zone* zone) const;
+ InstructionOperand* CreateAssignedOperand(Zone* zone);
int assigned_register() const { return assigned_register_; }
int spill_start_index() const { return spill_start_index_; }
void set_assigned_register(int reg, Zone* zone);
@@ -340,8 +337,6 @@
return fixed_double_live_ranges_;
}
InstructionSequence* code() const { return code_; }
- // This zone is for datastructures only needed during register allocation.
- Zone* local_zone() const { return local_zone_; }
private:
int GetVirtualRegister() {
@@ -361,6 +356,9 @@
// Returns the register kind required by the given virtual register.
RegisterKind RequiredRegisterKind(int virtual_register) const;
+ // This zone is for datastructures only needed during register allocation.
+ Zone* zone() const { return zone_; }
+
// This zone is for InstructionOperands and moves that live beyond register
// allocation.
Zone* code_zone() const { return code()->zone(); }
@@ -467,10 +465,8 @@
bool IsBlockBoundary(LifetimePosition pos);
// Helper methods for resolving control flow.
- void ResolveControlFlow(const InstructionBlock* block,
- const LiveRange* cur_cover,
- const InstructionBlock* pred,
- const LiveRange* pred_cover);
+ void ResolveControlFlow(LiveRange* range, const InstructionBlock* block,
+ const InstructionBlock* pred);
void SetLiveRangeAssignedRegister(LiveRange* range, int reg);
@@ -498,7 +494,7 @@
const char* debug_name() const { return debug_name_; }
const RegisterConfiguration* config() const { return config_; }
- Zone* const local_zone_;
+ Zone* const zone_;
Frame* const frame_;
InstructionSequence* const code_;
const char* const debug_name_;
diff --git a/src/compiler/schedule.cc b/src/compiler/schedule.cc
index 50ece95..51400cf 100644
--- a/src/compiler/schedule.cc
+++ b/src/compiler/schedule.cc
@@ -16,11 +16,10 @@
: ao_number_(-1),
rpo_number_(-1),
deferred_(false),
- dominator_depth_(-1),
dominator_(NULL),
loop_header_(NULL),
- loop_end_(NULL),
loop_depth_(0),
+ loop_end_(-1),
control_(kNone),
control_input_(NULL),
nodes_(zone),
@@ -33,9 +32,8 @@
// RPO numbers must be initialized.
DCHECK(rpo_number_ >= 0);
DCHECK(block->rpo_number_ >= 0);
- if (loop_end_ == NULL) return false; // This is not a loop.
- return block->rpo_number_ >= rpo_number_ &&
- block->rpo_number_ < loop_end_->rpo_number_;
+ if (loop_end_ < 0) return false; // This is not a loop.
+ return block->rpo_number_ >= rpo_number_ && block->rpo_number_ < loop_end_;
}
@@ -62,11 +60,6 @@
}
-void BasicBlock::set_dominator_depth(int32_t dominator_depth) {
- dominator_depth_ = dominator_depth;
-}
-
-
void BasicBlock::set_dominator(BasicBlock* dominator) {
dominator_ = dominator;
}
@@ -82,7 +75,7 @@
}
-void BasicBlock::set_loop_end(BasicBlock* loop_end) { loop_end_ = loop_end; }
+void BasicBlock::set_loop_end(int32_t loop_end) { loop_end_ = loop_end; }
void BasicBlock::set_loop_header(BasicBlock* loop_header) {
diff --git a/src/compiler/schedule.h b/src/compiler/schedule.h
index b65a507..7974182 100644
--- a/src/compiler/schedule.h
+++ b/src/compiler/schedule.h
@@ -145,21 +145,18 @@
bool deferred() const { return deferred_; }
void set_deferred(bool deferred) { deferred_ = deferred; }
- int32_t dominator_depth() const { return dominator_depth_; }
- void set_dominator_depth(int32_t dominator_depth);
-
BasicBlock* dominator() const { return dominator_; }
void set_dominator(BasicBlock* dominator);
BasicBlock* loop_header() const { return loop_header_; }
void set_loop_header(BasicBlock* loop_header);
- BasicBlock* loop_end() const { return loop_end_; }
- void set_loop_end(BasicBlock* loop_end);
-
int32_t loop_depth() const { return loop_depth_; }
void set_loop_depth(int32_t loop_depth);
+ int32_t loop_end() const { return loop_end_; }
+ void set_loop_end(int32_t loop_end);
+
RpoNumber GetAoNumber() const { return RpoNumber::FromInt(ao_number_); }
int32_t ao_number() const { return ao_number_; }
void set_ao_number(int32_t ao_number) { ao_number_ = ao_number; }
@@ -169,20 +166,19 @@
void set_rpo_number(int32_t rpo_number);
// Loop membership helpers.
- inline bool IsLoopHeader() const { return loop_end_ != NULL; }
+ inline bool IsLoopHeader() const { return loop_end_ >= 0; }
bool LoopContains(BasicBlock* block) const;
private:
int32_t ao_number_; // assembly order number of the block.
int32_t rpo_number_; // special RPO number of the block.
bool deferred_; // true if the block contains deferred code.
- int32_t dominator_depth_; // Depth within the dominator tree.
BasicBlock* dominator_; // Immediate dominator of the block.
BasicBlock* loop_header_; // Pointer to dominating loop header basic block,
// NULL if none. For loop headers, this points to
// enclosing loop header.
- BasicBlock* loop_end_; // end of the loop, if this block is a loop header.
int32_t loop_depth_; // loop nesting, 0 is top-level
+ int32_t loop_end_; // end of the loop, if this block is a loop header.
Control control_; // Control at the end of the block.
Node* control_input_; // Input value for control.
diff --git a/src/compiler/scheduler.cc b/src/compiler/scheduler.cc
index 92e05cb..1599152 100644
--- a/src/compiler/scheduler.cc
+++ b/src/compiler/scheduler.cc
@@ -52,8 +52,6 @@
scheduler.ScheduleEarly();
scheduler.ScheduleLate();
- scheduler.SealFinalSchedule();
-
return schedule;
}
@@ -213,11 +211,20 @@
}
+int Scheduler::GetRPONumber(BasicBlock* block) {
+ DCHECK(block->rpo_number() >= 0 &&
+ block->rpo_number() < static_cast<int>(schedule_->rpo_order_.size()));
+ DCHECK(schedule_->rpo_order_[block->rpo_number()] == block);
+ return block->rpo_number();
+}
+
+
BasicBlock* Scheduler::GetCommonDominator(BasicBlock* b1, BasicBlock* b2) {
while (b1 != b2) {
- int32_t b1_depth = b1->dominator_depth();
- int32_t b2_depth = b2->dominator_depth();
- if (b1_depth < b2_depth) {
+ int b1_rpo = GetRPONumber(b1);
+ int b2_rpo = GetRPONumber(b2);
+ DCHECK(b1_rpo != b2_rpo);
+ if (b1_rpo < b2_rpo) {
b2 = b2->dominator();
} else {
b1 = b1->dominator();
@@ -415,6 +422,8 @@
IrOpcode::kIfFalse);
// Consider branch hints.
+ // TODO(turbofan): Propagate the deferred flag to all blocks dominated by
+ // this IfTrue/IfFalse later.
switch (BranchHintOf(branch->op())) {
case BranchHint::kNone:
break;
@@ -520,68 +529,219 @@
// 2. All loops are contiguous in the order (i.e. no intervening blocks that
// do not belong to the loop.)
// Note a simple RPO traversal satisfies (1) but not (2).
-class SpecialRPONumberer : public ZoneObject {
+class SpecialRPONumberer {
public:
SpecialRPONumberer(Zone* zone, Schedule* schedule)
- : zone_(zone),
- schedule_(schedule),
- order_(NULL),
- loops_(zone),
- beyond_end_(NULL) {}
+ : zone_(zone), schedule_(schedule) {}
- // Computes the special reverse-post-order for the main control flow graph,
- // that is for the graph spanned between the schedule's start and end blocks.
void ComputeSpecialRPO() {
- DCHECK_EQ(NULL, order_); // Main order does not exist yet.
- // TODO(mstarzinger): Should use Schedule::end() after tests are fixed.
- ComputeAndInsertSpecialRPO(schedule_->start(), NULL);
- }
+ // RPO should not have been computed for this schedule yet.
+ CHECK_EQ(kBlockUnvisited1, schedule_->start()->rpo_number());
+ CHECK_EQ(0, static_cast<int>(schedule_->rpo_order()->size()));
- // Computes the special reverse-post-order for a partial control flow graph,
- // that is for the graph spanned between the given {entry} and {end} blocks,
- // then updates the existing ordering with this new information.
- void UpdateSpecialRPO(BasicBlock* entry, BasicBlock* end) {
- DCHECK_NE(NULL, order_); // Main order to be updated is present.
- ComputeAndInsertSpecialRPO(entry, end);
- }
+ // Perform an iterative RPO traversal using an explicit stack,
+ // recording backedges that form cycles. O(|B|).
+ ZoneList<std::pair<BasicBlock*, size_t> > backedges(1, zone_);
+ SpecialRPOStackFrame* stack = zone_->NewArray<SpecialRPOStackFrame>(
+ static_cast<int>(schedule_->BasicBlockCount()));
+ BasicBlock* entry = schedule_->start();
+ BlockList* order = NULL;
+ int stack_depth = Push(stack, 0, entry, kBlockUnvisited1);
+ int num_loops = 0;
- // Serialize the previously computed order as an assembly order (non-deferred
- // code first, deferred code afterwards) into the final schedule.
- void SerializeAOIntoSchedule() {
+ while (stack_depth > 0) {
+ int current = stack_depth - 1;
+ SpecialRPOStackFrame* frame = stack + current;
+
+ if (frame->index < frame->block->SuccessorCount()) {
+ // Process the next successor.
+ BasicBlock* succ = frame->block->SuccessorAt(frame->index++);
+ if (succ->rpo_number() == kBlockVisited1) continue;
+ if (succ->rpo_number() == kBlockOnStack) {
+ // The successor is on the stack, so this is a backedge (cycle).
+ backedges.Add(
+ std::pair<BasicBlock*, size_t>(frame->block, frame->index - 1),
+ zone_);
+ if (succ->loop_end() < 0) {
+ // Assign a new loop number to the header if it doesn't have one.
+ succ->set_loop_end(num_loops++);
+ }
+ } else {
+ // Push the successor onto the stack.
+ DCHECK(succ->rpo_number() == kBlockUnvisited1);
+ stack_depth = Push(stack, stack_depth, succ, kBlockUnvisited1);
+ }
+ } else {
+ // Finished with all successors; pop the stack and add the block.
+ order = order->Add(zone_, frame->block);
+ frame->block->set_rpo_number(kBlockVisited1);
+ stack_depth--;
+ }
+ }
+
+ // If no loops were encountered, then the order we computed was correct.
+ LoopInfo* loops = NULL;
+ if (num_loops != 0) {
+ // Otherwise, compute the loop information from the backedges in order
+ // to perform a traversal that groups loop bodies together.
+ loops = ComputeLoopInfo(stack, num_loops, schedule_->BasicBlockCount(),
+ &backedges);
+
+ // Initialize the "loop stack". Note the entry could be a loop header.
+ LoopInfo* loop = entry->IsLoopHeader() ? &loops[entry->loop_end()] : NULL;
+ order = NULL;
+
+ // Perform an iterative post-order traversal, visiting loop bodies before
+ // edges that lead out of loops. Visits each block once, but linking loop
+ // sections together is linear in the loop size, so overall is
+ // O(|B| + max(loop_depth) * max(|loop|))
+ stack_depth = Push(stack, 0, entry, kBlockUnvisited2);
+ while (stack_depth > 0) {
+ SpecialRPOStackFrame* frame = stack + (stack_depth - 1);
+ BasicBlock* block = frame->block;
+ BasicBlock* succ = NULL;
+
+ if (frame->index < block->SuccessorCount()) {
+ // Process the next normal successor.
+ succ = block->SuccessorAt(frame->index++);
+ } else if (block->IsLoopHeader()) {
+ // Process additional outgoing edges from the loop header.
+ if (block->rpo_number() == kBlockOnStack) {
+ // Finish the loop body the first time the header is left on the
+ // stack.
+ DCHECK(loop != NULL && loop->header == block);
+ loop->start = order->Add(zone_, block);
+ order = loop->end;
+ block->set_rpo_number(kBlockVisited2);
+ // Pop the loop stack and continue visiting outgoing edges within
+ // the context of the outer loop, if any.
+ loop = loop->prev;
+ // We leave the loop header on the stack; the rest of this iteration
+ // and later iterations will go through its outgoing edges list.
+ }
+
+ // Use the next outgoing edge if there are any.
+ int outgoing_index =
+ static_cast<int>(frame->index - block->SuccessorCount());
+ LoopInfo* info = &loops[block->loop_end()];
+ DCHECK(loop != info);
+ if (info->outgoing != NULL &&
+ outgoing_index < info->outgoing->length()) {
+ succ = info->outgoing->at(outgoing_index);
+ frame->index++;
+ }
+ }
+
+ if (succ != NULL) {
+ // Process the next successor.
+ if (succ->rpo_number() == kBlockOnStack) continue;
+ if (succ->rpo_number() == kBlockVisited2) continue;
+ DCHECK(succ->rpo_number() == kBlockUnvisited2);
+ if (loop != NULL && !loop->members->Contains(succ->id().ToInt())) {
+ // The successor is not in the current loop or any nested loop.
+ // Add it to the outgoing edges of this loop and visit it later.
+ loop->AddOutgoing(zone_, succ);
+ } else {
+ // Push the successor onto the stack.
+ stack_depth = Push(stack, stack_depth, succ, kBlockUnvisited2);
+ if (succ->IsLoopHeader()) {
+ // Push the inner loop onto the loop stack.
+ DCHECK(succ->loop_end() >= 0 && succ->loop_end() < num_loops);
+ LoopInfo* next = &loops[succ->loop_end()];
+ next->end = order;
+ next->prev = loop;
+ loop = next;
+ }
+ }
+ } else {
+ // Finished with all successors of the current block.
+ if (block->IsLoopHeader()) {
+ // If we are going to pop a loop header, then add its entire body.
+ LoopInfo* info = &loops[block->loop_end()];
+ for (BlockList* l = info->start; true; l = l->next) {
+ if (l->next == info->end) {
+ l->next = order;
+ info->end = order;
+ break;
+ }
+ }
+ order = info->start;
+ } else {
+ // Pop a single node off the stack and add it to the order.
+ order = order->Add(zone_, block);
+ block->set_rpo_number(kBlockVisited2);
+ }
+ stack_depth--;
+ }
+ }
+ }
+
+ // Construct the final order from the list.
+ BasicBlockVector* final_order = schedule_->rpo_order();
+ order->Serialize(final_order);
+
+ // Compute the correct loop headers and set the correct loop ends.
+ LoopInfo* current_loop = NULL;
+ BasicBlock* current_header = NULL;
+ int loop_depth = 0;
+ for (BasicBlockVectorIter i = final_order->begin(); i != final_order->end();
+ ++i) {
+ BasicBlock* current = *i;
+
+ // Finish the previous loop(s) if we just exited them.
+ while (current_header != NULL &&
+ current->rpo_number() >= current_header->loop_end()) {
+ DCHECK(current_header->IsLoopHeader());
+ DCHECK(current_loop != NULL);
+ current_loop = current_loop->prev;
+ current_header = current_loop == NULL ? NULL : current_loop->header;
+ --loop_depth;
+ }
+ current->set_loop_header(current_header);
+
+ // Push a new loop onto the stack if this loop is a loop header.
+ if (current->IsLoopHeader()) {
+ loop_depth++;
+ current_loop = &loops[current->loop_end()];
+ BlockList* end = current_loop->end;
+ current->set_loop_end(end == NULL
+ ? static_cast<int>(final_order->size())
+ : end->block->rpo_number());
+ current_header = current_loop->header;
+ Trace("B%d is a loop header, increment loop depth to %d\n",
+ current->id().ToInt(), loop_depth);
+ }
+
+ current->set_loop_depth(loop_depth);
+
+ if (current->loop_header() == NULL) {
+ Trace("B%d is not in a loop (depth == %d)\n", current->id().ToInt(),
+ current->loop_depth());
+ } else {
+ Trace("B%d has loop header B%d, (depth == %d)\n", current->id().ToInt(),
+ current->loop_header()->id().ToInt(), current->loop_depth());
+ }
+ }
+
+ // Compute the assembly order (non-deferred code first, deferred code
+ // afterwards).
int32_t number = 0;
- for (BlockList* l = order_; l != NULL; l = l->next) {
- if (l->block->deferred()) continue;
- l->block->set_ao_number(number++);
+ for (auto block : *final_order) {
+ if (block->deferred()) continue;
+ block->set_ao_number(number++);
}
- for (BlockList* l = order_; l != NULL; l = l->next) {
- if (!l->block->deferred()) continue;
- l->block->set_ao_number(number++);
+ for (auto block : *final_order) {
+ if (!block->deferred()) continue;
+ block->set_ao_number(number++);
}
- }
- // Serialize the previously computed order as a special reverse-post-order
- // numbering for basic blocks into the final schedule.
- void SerializeRPOIntoSchedule() {
- int32_t number = 0;
- for (BlockList* l = order_; l != NULL; l = l->next) {
- l->block->set_rpo_number(number++);
- schedule_->rpo_order()->push_back(l->block);
- }
- BeyondEndSentinel()->set_rpo_number(number);
- }
-
- // Print and verify the special reverse-post-order.
- void PrintAndVerifySpecialRPO() {
#if DEBUG
- if (FLAG_trace_turbo_scheduler) PrintRPO();
- VerifySpecialRPO();
+ if (FLAG_trace_turbo_scheduler) PrintRPO(num_loops, loops, final_order);
+ VerifySpecialRPO(num_loops, loops, final_order);
#endif
}
private:
- // TODO(mstarzinger): Only for Scheduler::GenerateImmediateDominatorTree.
- friend class Scheduler;
-
// Numbering for BasicBlockData.rpo_number_ for this block traversal:
static const int kBlockOnStack = -2;
static const int kBlockVisited1 = -3;
@@ -605,11 +765,11 @@
return list;
}
- BlockList* FindForBlock(BasicBlock* b) {
+ void Serialize(BasicBlockVector* final_order) {
for (BlockList* l = this; l != NULL; l = l->next) {
- if (l->block == b) return l;
+ l->block->set_rpo_number(static_cast<int>(final_order->size()));
+ final_order->push_back(l->block);
}
- return NULL;
}
};
@@ -640,247 +800,31 @@
return depth;
}
- // We are hijacking the {ao_number} to enumerate loops temporarily. Note that
- // these numbers are only valid within this class.
- static int GetLoopNumber(BasicBlock* block) { return block->ao_number(); }
- static void SetLoopNumber(BasicBlock* block, int loop_number) {
- return block->set_ao_number(loop_number);
- }
- static bool HasLoopNumber(BasicBlock* block) {
- return block->ao_number() >= 0;
- }
-
- // TODO(mstarzinger): We only need this special sentinel because some tests
- // use the schedule's end block in actual control flow (e.g. with end having
- // successors). Once this has been cleaned up we can use the end block here.
- BasicBlock* BeyondEndSentinel() {
- if (beyond_end_ == NULL) {
- BasicBlock::Id id = BasicBlock::Id::FromInt(-1);
- beyond_end_ = new (schedule_->zone()) BasicBlock(schedule_->zone(), id);
- }
- return beyond_end_;
- }
-
- // Compute special RPO for the control flow graph between {entry} and {end},
- // mutating any existing order so that the result is still valid.
- void ComputeAndInsertSpecialRPO(BasicBlock* entry, BasicBlock* end) {
- // RPO should not have been serialized for this schedule yet.
- CHECK_EQ(kBlockUnvisited1, schedule_->start()->ao_number());
- CHECK_EQ(kBlockUnvisited1, schedule_->start()->rpo_number());
- CHECK_EQ(0, static_cast<int>(schedule_->rpo_order()->size()));
-
- // Find correct insertion point within existing order.
- BlockList* insert_before = order_->FindForBlock(entry);
- BlockList* insert_after = insert_before ? insert_before->next : NULL;
-
- // Perform an iterative RPO traversal using an explicit stack,
- // recording backedges that form cycles. O(|B|).
- ZoneList<std::pair<BasicBlock*, size_t> > backedges(1, zone_);
- SpecialRPOStackFrame* stack = zone_->NewArray<SpecialRPOStackFrame>(
- static_cast<int>(schedule_->BasicBlockCount()));
- int stack_depth = Push(stack, 0, entry, kBlockUnvisited1);
- int num_loops = 0;
-
- while (stack_depth > 0) {
- int current = stack_depth - 1;
- SpecialRPOStackFrame* frame = stack + current;
-
- if (frame->block != end &&
- frame->index < frame->block->SuccessorCount()) {
- // Process the next successor.
- BasicBlock* succ = frame->block->SuccessorAt(frame->index++);
- if (succ->rpo_number() == kBlockVisited1) continue;
- if (succ->rpo_number() == kBlockOnStack) {
- // The successor is on the stack, so this is a backedge (cycle).
- backedges.Add(
- std::pair<BasicBlock*, size_t>(frame->block, frame->index - 1),
- zone_);
- if (!HasLoopNumber(succ)) {
- // Assign a new loop number to the header if it doesn't have one.
- SetLoopNumber(succ, num_loops++);
- }
- } else {
- // Push the successor onto the stack.
- DCHECK(succ->rpo_number() == kBlockUnvisited1);
- stack_depth = Push(stack, stack_depth, succ, kBlockUnvisited1);
- }
- } else {
- // Finished with all successors; pop the stack and add the block.
- insert_after = insert_after->Add(zone_, frame->block);
- frame->block->set_rpo_number(kBlockVisited1);
- stack_depth--;
- }
- }
-
- // Insert the result into any existing order.
- if (insert_before == NULL) {
- order_ = insert_after;
- } else {
- // There already is a list element for the entry block in the list, hence
- // we skip the first element of the sub-list to compensate duplication.
- DCHECK_EQ(insert_before->block, insert_after->block);
- insert_before->next = insert_after->next;
- }
-
- // If no loops were encountered, then the order we computed was correct.
- if (num_loops != 0) {
- // Otherwise, compute the loop information from the backedges in order
- // to perform a traversal that groups loop bodies together.
- ComputeLoopInfo(stack, num_loops, &backedges);
-
- // Initialize the "loop stack". Note the entry could be a loop header.
- LoopInfo* loop =
- HasLoopNumber(entry) ? &loops_[GetLoopNumber(entry)] : NULL;
- order_ = NULL;
-
- // Perform an iterative post-order traversal, visiting loop bodies before
- // edges that lead out of loops. Visits each block once, but linking loop
- // sections together is linear in the loop size, so overall is
- // O(|B| + max(loop_depth) * max(|loop|))
- stack_depth = Push(stack, 0, entry, kBlockUnvisited2);
- while (stack_depth > 0) {
- SpecialRPOStackFrame* frame = stack + (stack_depth - 1);
- BasicBlock* block = frame->block;
- BasicBlock* succ = NULL;
-
- if (frame->index < block->SuccessorCount()) {
- // Process the next normal successor.
- succ = block->SuccessorAt(frame->index++);
- } else if (HasLoopNumber(block)) {
- // Process additional outgoing edges from the loop header.
- if (block->rpo_number() == kBlockOnStack) {
- // Finish the loop body the first time the header is left on the
- // stack.
- DCHECK(loop != NULL && loop->header == block);
- loop->start = order_->Add(zone_, block);
- order_ = loop->end;
- block->set_rpo_number(kBlockVisited2);
- // Pop the loop stack and continue visiting outgoing edges within
- // the context of the outer loop, if any.
- loop = loop->prev;
- // We leave the loop header on the stack; the rest of this iteration
- // and later iterations will go through its outgoing edges list.
- }
-
- // Use the next outgoing edge if there are any.
- int outgoing_index =
- static_cast<int>(frame->index - block->SuccessorCount());
- LoopInfo* info = &loops_[GetLoopNumber(block)];
- DCHECK(loop != info);
- if (info->outgoing != NULL &&
- outgoing_index < info->outgoing->length()) {
- succ = info->outgoing->at(outgoing_index);
- frame->index++;
- }
- }
-
- if (succ != NULL) {
- // Process the next successor.
- if (succ->rpo_number() == kBlockOnStack) continue;
- if (succ->rpo_number() == kBlockVisited2) continue;
- DCHECK(succ->rpo_number() == kBlockUnvisited2);
- if (loop != NULL && !loop->members->Contains(succ->id().ToInt())) {
- // The successor is not in the current loop or any nested loop.
- // Add it to the outgoing edges of this loop and visit it later.
- loop->AddOutgoing(zone_, succ);
- } else {
- // Push the successor onto the stack.
- stack_depth = Push(stack, stack_depth, succ, kBlockUnvisited2);
- if (HasLoopNumber(succ)) {
- // Push the inner loop onto the loop stack.
- DCHECK(GetLoopNumber(succ) < num_loops);
- LoopInfo* next = &loops_[GetLoopNumber(succ)];
- next->end = order_;
- next->prev = loop;
- loop = next;
- }
- }
- } else {
- // Finished with all successors of the current block.
- if (HasLoopNumber(block)) {
- // If we are going to pop a loop header, then add its entire body.
- LoopInfo* info = &loops_[GetLoopNumber(block)];
- for (BlockList* l = info->start; true; l = l->next) {
- if (l->next == info->end) {
- l->next = order_;
- info->end = order_;
- break;
- }
- }
- order_ = info->start;
- } else {
- // Pop a single node off the stack and add it to the order.
- order_ = order_->Add(zone_, block);
- block->set_rpo_number(kBlockVisited2);
- }
- stack_depth--;
- }
- }
- }
-
- // Compute the correct loop headers and set the correct loop ends.
- LoopInfo* current_loop = NULL;
- BasicBlock* current_header = NULL;
- int loop_depth = 0;
- for (BlockList* l = order_; l != NULL; l = l->next) {
- BasicBlock* current = l->block;
-
- // Finish the previous loop(s) if we just exited them.
- while (current_header != NULL && current == current_header->loop_end()) {
- DCHECK(current_header->IsLoopHeader());
- DCHECK(current_loop != NULL);
- current_loop = current_loop->prev;
- current_header = current_loop == NULL ? NULL : current_loop->header;
- --loop_depth;
- }
- current->set_loop_header(current_header);
-
- // Push a new loop onto the stack if this loop is a loop header.
- if (HasLoopNumber(current)) {
- loop_depth++;
- current_loop = &loops_[GetLoopNumber(current)];
- BlockList* end = current_loop->end;
- current->set_loop_end(end == NULL ? BeyondEndSentinel() : end->block);
- current_header = current_loop->header;
- Trace("B%d is a loop header, increment loop depth to %d\n",
- current->id().ToInt(), loop_depth);
- }
-
- current->set_loop_depth(loop_depth);
-
- if (current->loop_header() == NULL) {
- Trace("B%d is not in a loop (depth == %d)\n", current->id().ToInt(),
- current->loop_depth());
- } else {
- Trace("B%d has loop header B%d, (depth == %d)\n", current->id().ToInt(),
- current->loop_header()->id().ToInt(), current->loop_depth());
- }
- }
- }
-
// Computes loop membership from the backedges of the control flow graph.
- void ComputeLoopInfo(SpecialRPOStackFrame* queue, size_t num_loops,
- ZoneList<std::pair<BasicBlock*, size_t> >* backedges) {
- loops_.resize(num_loops, LoopInfo());
+ LoopInfo* ComputeLoopInfo(
+ SpecialRPOStackFrame* queue, int num_loops, size_t num_blocks,
+ ZoneList<std::pair<BasicBlock*, size_t> >* backedges) {
+ LoopInfo* loops = zone_->NewArray<LoopInfo>(num_loops);
+ memset(loops, 0, num_loops * sizeof(LoopInfo));
// Compute loop membership starting from backedges.
// O(max(loop_depth) * max(|loop|)
for (int i = 0; i < backedges->length(); i++) {
BasicBlock* member = backedges->at(i).first;
BasicBlock* header = member->SuccessorAt(backedges->at(i).second);
- size_t loop_num = GetLoopNumber(header);
- if (loops_[loop_num].header == NULL) {
- loops_[loop_num].header = header;
- loops_[loop_num].members = new (zone_)
- BitVector(static_cast<int>(schedule_->BasicBlockCount()), zone_);
+ int loop_num = header->loop_end();
+ if (loops[loop_num].header == NULL) {
+ loops[loop_num].header = header;
+ loops[loop_num].members =
+ new (zone_) BitVector(static_cast<int>(num_blocks), zone_);
}
int queue_length = 0;
if (member != header) {
// As long as the header doesn't have a backedge to itself,
// Push the member onto the queue and process its predecessors.
- if (!loops_[loop_num].members->Contains(member->id().ToInt())) {
- loops_[loop_num].members->Add(member->id().ToInt());
+ if (!loops[loop_num].members->Contains(member->id().ToInt())) {
+ loops[loop_num].members->Add(member->id().ToInt());
}
queue[queue_length++].block = member;
}
@@ -892,46 +836,47 @@
for (size_t i = 0; i < block->PredecessorCount(); i++) {
BasicBlock* pred = block->PredecessorAt(i);
if (pred != header) {
- if (!loops_[loop_num].members->Contains(pred->id().ToInt())) {
- loops_[loop_num].members->Add(pred->id().ToInt());
+ if (!loops[loop_num].members->Contains(pred->id().ToInt())) {
+ loops[loop_num].members->Add(pred->id().ToInt());
queue[queue_length++].block = pred;
}
}
}
}
}
+ return loops;
}
#if DEBUG
- void PrintRPO() {
+ void PrintRPO(int num_loops, LoopInfo* loops, BasicBlockVector* order) {
OFStream os(stdout);
- os << "RPO with " << loops_.size() << " loops";
- if (loops_.size() > 0) {
- os << " (";
- for (size_t i = 0; i < loops_.size(); i++) {
+ os << "-- RPO with " << num_loops << " loops ";
+ if (num_loops > 0) {
+ os << "(";
+ for (int i = 0; i < num_loops; i++) {
if (i > 0) os << " ";
- os << "B" << loops_[i].header->id();
+ os << "B" << loops[i].header->id();
}
- os << ")";
+ os << ") ";
}
- os << ":\n";
+ os << "-- \n";
- for (BlockList* l = order_; l != NULL; l = l->next) {
- BasicBlock* block = l->block;
+ for (size_t i = 0; i < order->size(); i++) {
+ BasicBlock* block = (*order)[i];
BasicBlock::Id bid = block->id();
// TODO(jarin,svenpanne): Add formatting here once we have support for
- // that in streams (we want an equivalent of PrintF("%5d:", x) here).
- os << " " << block->rpo_number() << ":";
- for (size_t i = 0; i < loops_.size(); i++) {
- bool range = loops_[i].header->LoopContains(block);
- bool membership = loops_[i].header != block && range;
+ // that in streams (we want an equivalent of PrintF("%5d:", i) here).
+ os << i << ":";
+ for (int j = 0; j < num_loops; j++) {
+ bool membership = loops[j].members->Contains(bid.ToInt());
+ bool range = loops[j].header->LoopContains(block);
os << (membership ? " |" : " ");
os << (range ? "x" : " ");
}
os << " B" << bid << ": ";
- if (block->loop_end() != NULL) {
- os << " range: [" << block->rpo_number() << ", "
- << block->loop_end()->rpo_number() << ")";
+ if (block->loop_end() >= 0) {
+ os << " range: [" << block->rpo_number() << ", " << block->loop_end()
+ << ")";
}
if (block->loop_header() != NULL) {
os << " header: B" << block->loop_header()->id();
@@ -943,22 +888,21 @@
}
}
- void VerifySpecialRPO() {
- BasicBlockVector* order = schedule_->rpo_order();
+ void VerifySpecialRPO(int num_loops, LoopInfo* loops,
+ BasicBlockVector* order) {
DCHECK(order->size() > 0);
DCHECK((*order)[0]->id().ToInt() == 0); // entry should be first.
- for (size_t i = 0; i < loops_.size(); i++) {
- LoopInfo* loop = &loops_[i];
+ for (int i = 0; i < num_loops; i++) {
+ LoopInfo* loop = &loops[i];
BasicBlock* header = loop->header;
- BasicBlock* end = header->loop_end();
DCHECK(header != NULL);
DCHECK(header->rpo_number() >= 0);
DCHECK(header->rpo_number() < static_cast<int>(order->size()));
- DCHECK(end != NULL);
- DCHECK(end->rpo_number() <= static_cast<int>(order->size()));
- DCHECK(end->rpo_number() > header->rpo_number());
+ DCHECK(header->loop_end() >= 0);
+ DCHECK(header->loop_end() <= static_cast<int>(order->size()));
+ DCHECK(header->loop_end() > header->rpo_number());
DCHECK(header->loop_header() != header);
// Verify the start ... end list relationship.
@@ -978,7 +922,7 @@
DCHECK(links < static_cast<int>(2 * order->size())); // cycle?
}
DCHECK(links > 0);
- DCHECK(links == end->rpo_number() - header->rpo_number());
+ DCHECK(links == (header->loop_end() - header->rpo_number()));
DCHECK(end_found);
// Check the contiguousness of loops.
@@ -986,10 +930,14 @@
for (int j = 0; j < static_cast<int>(order->size()); j++) {
BasicBlock* block = order->at(j);
DCHECK(block->rpo_number() == j);
- if (j < header->rpo_number() || j >= end->rpo_number()) {
- DCHECK(!header->LoopContains(block));
+ if (j < header->rpo_number() || j >= header->loop_end()) {
+ DCHECK(!loop->members->Contains(block->id().ToInt()));
} else {
- DCHECK(header->LoopContains(block));
+ if (block == header) {
+ DCHECK(!loop->members->Contains(block->id().ToInt()));
+ } else {
+ DCHECK(loop->members->Contains(block->id().ToInt()));
+ }
count++;
}
}
@@ -1000,9 +948,6 @@
Zone* zone_;
Schedule* schedule_;
- BlockList* order_;
- ZoneVector<LoopInfo> loops_;
- BasicBlock* beyond_end_;
};
@@ -1013,9 +958,6 @@
SpecialRPONumberer numberer(zone, schedule);
numberer.ComputeSpecialRPO();
- numberer.SerializeAOIntoSchedule();
- numberer.SerializeRPOIntoSchedule();
- numberer.PrintAndVerifySpecialRPO();
return schedule->rpo_order();
}
@@ -1023,41 +965,40 @@
void Scheduler::ComputeSpecialRPONumbering() {
Trace("--- COMPUTING SPECIAL RPO ----------------------------------\n");
- // Compute the special reverse-post-order for basic blocks.
- special_rpo_ = new (zone_) SpecialRPONumberer(zone_, schedule_);
- special_rpo_->ComputeSpecialRPO();
+ SpecialRPONumberer numberer(zone_, schedule_);
+ numberer.ComputeSpecialRPO();
}
void Scheduler::GenerateImmediateDominatorTree() {
Trace("--- IMMEDIATE BLOCK DOMINATORS -----------------------------\n");
- // TODO(danno): Consider using Lengauer & Tarjan's if this becomes too slow.
-
- // Build the block dominator tree.
- schedule_->start()->set_dominator_depth(0);
- typedef SpecialRPONumberer::BlockList BlockList;
- for (BlockList* l = special_rpo_->order_; l != NULL; l = l->next) {
- BasicBlock* current = l->block;
- if (current == schedule_->start()) continue;
- BasicBlock::Predecessors::iterator pred = current->predecessors_begin();
- BasicBlock::Predecessors::iterator end = current->predecessors_end();
- DCHECK(pred != end); // All blocks except start have predecessors.
- BasicBlock* dominator = *pred;
- // For multiple predecessors, walk up the dominator tree until a common
- // dominator is found. Visitation order guarantees that all predecessors
- // except for backwards edges have been visited.
- for (++pred; pred != end; ++pred) {
- // Don't examine backwards edges.
- if ((*pred)->dominator_depth() < 0) continue;
- dominator = GetCommonDominator(dominator, *pred);
+ // Build the dominator graph.
+ // TODO(danno): consider using Lengauer & Tarjan's if this becomes too slow.
+ for (size_t i = 0; i < schedule_->rpo_order_.size(); i++) {
+ BasicBlock* current_rpo = schedule_->rpo_order_[i];
+ if (current_rpo != schedule_->start()) {
+ BasicBlock::Predecessors::iterator current_pred =
+ current_rpo->predecessors_begin();
+ BasicBlock::Predecessors::iterator end = current_rpo->predecessors_end();
+ DCHECK(current_pred != end);
+ BasicBlock* dominator = *current_pred;
+ ++current_pred;
+ // For multiple predecessors, walk up the RPO ordering until a common
+ // dominator is found.
+ int current_rpo_pos = GetRPONumber(current_rpo);
+ while (current_pred != end) {
+ // Don't examine backwards edges
+ BasicBlock* pred = *current_pred;
+ if (GetRPONumber(pred) < current_rpo_pos) {
+ dominator = GetCommonDominator(dominator, *current_pred);
+ }
+ ++current_pred;
+ }
+ current_rpo->set_dominator(dominator);
+ Trace("Block %d's idom is %d\n", current_rpo->id().ToInt(),
+ dominator->id().ToInt());
}
- current->set_dominator(dominator);
- current->set_dominator_depth(dominator->dominator_depth() + 1);
- // Propagate "deferredness" of the dominator.
- if (dominator->deferred()) current->set_deferred(true);
- Trace("Block B%d's idom is B%d, depth = %d\n", current->id().ToInt(),
- dominator->id().ToInt(), current->dominator_depth());
}
}
@@ -1146,10 +1087,8 @@
if (scheduler_->GetPlacement(node) == Scheduler::kFixed) {
DCHECK_EQ(schedule_->start(), data->minimum_block_);
data->minimum_block_ = schedule_->block(node);
- Trace("Fixing #%d:%s minimum_block = B%d, dominator_depth = %d\n",
- node->id(), node->op()->mnemonic(),
- data->minimum_block_->id().ToInt(),
- data->minimum_block_->dominator_depth());
+ Trace("Fixing #%d:%s minimum_rpo = %d\n", node->id(),
+ node->op()->mnemonic(), data->minimum_block_->rpo_number());
}
// No need to propagate unconstrained schedule early positions.
@@ -1159,14 +1098,14 @@
DCHECK(data->minimum_block_ != NULL);
Node::Uses uses = node->uses();
for (Node::Uses::iterator i = uses.begin(); i != uses.end(); ++i) {
- PropagateMinimumPositionToNode(data->minimum_block_, *i);
+ PropagateMinimumRPOToNode(data->minimum_block_, *i);
}
}
- // Propagates {block} as another minimum position into the given {node}. This
- // has the net effect of computing the minimum dominator block of {node} that
- // still post-dominates all inputs to {node} when the queue is processed.
- void PropagateMinimumPositionToNode(BasicBlock* block, Node* node) {
+ // Propagates {block} as another minimum RPO placement into the given {node}.
+ // This has the net effect of computing the maximum of the minimum RPOs for
+ // all inputs to {node} when the queue has been fully processed.
+ void PropagateMinimumRPOToNode(BasicBlock* block, Node* node) {
Scheduler::SchedulerData* data = scheduler_->GetData(node);
// No need to propagate to fixed node, it's guaranteed to be a root.
@@ -1175,30 +1114,18 @@
// Coupled nodes influence schedule early position of their control.
if (scheduler_->GetPlacement(node) == Scheduler::kCoupled) {
Node* control = NodeProperties::GetControlInput(node);
- PropagateMinimumPositionToNode(block, control);
+ PropagateMinimumRPOToNode(block, control);
}
- // Propagate new position if it is deeper down the dominator tree than the
- // current. Note that all inputs need to have minimum block position inside
- // the dominator chain of {node}'s minimum block position.
- DCHECK(InsideSameDominatorChain(block, data->minimum_block_));
- if (block->dominator_depth() > data->minimum_block_->dominator_depth()) {
+ // Propagate new position if it is larger than the current.
+ if (block->rpo_number() > data->minimum_block_->rpo_number()) {
data->minimum_block_ = block;
queue_.push(node);
- Trace("Propagating #%d:%s minimum_block = B%d, dominator_depth = %d\n",
- node->id(), node->op()->mnemonic(),
- data->minimum_block_->id().ToInt(),
- data->minimum_block_->dominator_depth());
+ Trace("Propagating #%d:%s minimum_rpo = %d\n", node->id(),
+ node->op()->mnemonic(), data->minimum_block_->rpo_number());
}
}
-#if DEBUG
- bool InsideSameDominatorChain(BasicBlock* b1, BasicBlock* b2) {
- BasicBlock* dominator = scheduler_->GetCommonDominator(b1, b2);
- return dominator == b1 || dominator == b2;
- }
-#endif
-
Scheduler* scheduler_;
Schedule* schedule_;
ZoneQueue<Node*> queue_;
@@ -1209,13 +1136,14 @@
Trace("--- SCHEDULE EARLY -----------------------------------------\n");
if (FLAG_trace_turbo_scheduler) {
Trace("roots: ");
- for (Node* node : schedule_root_nodes_) {
- Trace("#%d:%s ", node->id(), node->op()->mnemonic());
+ for (NodeVectorIter i = schedule_root_nodes_.begin();
+ i != schedule_root_nodes_.end(); ++i) {
+ Trace("#%d:%s ", (*i)->id(), (*i)->op()->mnemonic());
}
Trace("\n");
}
- // Compute the minimum block for each node thereby determining the earliest
+ // Compute the minimum RPO for each node thereby determining the earliest
// position each node could be placed within a valid schedule.
ScheduleEarlyNodeVisitor schedule_early_visitor(zone_, this);
schedule_early_visitor.Run(&schedule_root_nodes_);
@@ -1276,20 +1204,17 @@
BasicBlock* block = GetCommonDominatorOfUses(node);
DCHECK_NOT_NULL(block);
- // The schedule early block dominates the schedule late block.
- BasicBlock* min_block = scheduler_->GetData(node)->minimum_block_;
- DCHECK_EQ(min_block, scheduler_->GetCommonDominator(block, min_block));
- Trace("Schedule late of #%d:%s is B%d at loop depth %d, minimum = B%d\n",
+ int min_rpo = scheduler_->GetData(node)->minimum_block_->rpo_number();
+ Trace("Schedule late of #%d:%s is B%d at loop depth %d, minimum_rpo = %d\n",
node->id(), node->op()->mnemonic(), block->id().ToInt(),
- block->loop_depth(), min_block->id().ToInt());
+ block->loop_depth(), min_rpo);
// Hoist nodes out of loops if possible. Nodes can be hoisted iteratively
- // into enclosing loop pre-headers until they would preceed their schedule
- // early position.
+ // into enclosing loop pre-headers until they would preceed their
+ // ScheduleEarly position.
BasicBlock* hoist_block = GetPreHeader(block);
- while (hoist_block != NULL &&
- hoist_block->dominator_depth() >= min_block->dominator_depth()) {
- Trace(" hoisting #%d:%s to block B%d\n", node->id(),
+ while (hoist_block != NULL && hoist_block->rpo_number() >= min_rpo) {
+ Trace(" hoisting #%d:%s to block %d\n", node->id(),
node->op()->mnemonic(), hoist_block->id().ToInt());
DCHECK_LT(hoist_block->loop_depth(), block->loop_depth());
block = hoist_block;
@@ -1377,8 +1302,9 @@
Trace("--- SCHEDULE LATE ------------------------------------------\n");
if (FLAG_trace_turbo_scheduler) {
Trace("roots: ");
- for (Node* node : schedule_root_nodes_) {
- Trace("#%d:%s ", node->id(), node->op()->mnemonic());
+ for (NodeVectorIter i = schedule_root_nodes_.begin();
+ i != schedule_root_nodes_.end(); ++i) {
+ Trace("#%d:%s ", (*i)->id(), (*i)->op()->mnemonic());
}
Trace("\n");
}
@@ -1386,29 +1312,15 @@
// Schedule: Places nodes in dominator block of all their uses.
ScheduleLateNodeVisitor schedule_late_visitor(zone_, this);
schedule_late_visitor.Run(&schedule_root_nodes_);
-}
-
-
-// -----------------------------------------------------------------------------
-// Phase 6: Seal the final schedule.
-
-
-void Scheduler::SealFinalSchedule() {
- Trace("--- SEAL FINAL SCHEDULE ------------------------------------\n");
-
- // Serialize the assembly order and reverse-post-order numbering.
- special_rpo_->SerializeAOIntoSchedule();
- special_rpo_->SerializeRPOIntoSchedule();
- special_rpo_->PrintAndVerifySpecialRPO();
// Add collected nodes for basic blocks to their blocks in the right order.
int block_num = 0;
- for (NodeVector& nodes : scheduled_nodes_) {
- BasicBlock::Id id = BasicBlock::Id::FromInt(block_num++);
- BasicBlock* block = schedule_->GetBlockById(id);
- for (NodeVectorRIter i = nodes.rbegin(); i != nodes.rend(); ++i) {
- schedule_->AddNode(block, *i);
+ for (NodeVectorVectorIter i = scheduled_nodes_.begin();
+ i != scheduled_nodes_.end(); ++i) {
+ for (NodeVectorRIter j = i->rbegin(); j != i->rend(); ++j) {
+ schedule_->AddNode(schedule_->all_blocks_.at(block_num), *j);
}
+ block_num++;
}
}
@@ -1429,22 +1341,27 @@
// Iterate on phase 2: Compute special RPO and dominator tree.
// TODO(mstarzinger): Currently "iterate on" means "re-run". Fix that.
- for (BasicBlock* block : schedule_->all_blocks_) {
+ BasicBlockVector* rpo = schedule_->rpo_order();
+ for (BasicBlockVectorIter i = rpo->begin(); i != rpo->end(); ++i) {
+ BasicBlock* block = *i;
block->set_rpo_number(-1);
- block->set_dominator_depth(-1);
- block->set_dominator(NULL);
+ block->set_loop_header(NULL);
+ block->set_loop_depth(0);
+ block->set_loop_end(-1);
}
- special_rpo_->UpdateSpecialRPO(block, schedule_->block(node));
+ schedule_->rpo_order()->clear();
+ SpecialRPONumberer numberer(zone_, schedule_);
+ numberer.ComputeSpecialRPO();
GenerateImmediateDominatorTree();
+ scheduled_nodes_.resize(schedule_->BasicBlockCount(), NodeVector(zone_));
// Move previously planned nodes.
// TODO(mstarzinger): Improve that by supporting bulk moves.
- scheduled_nodes_.resize(schedule_->BasicBlockCount(), NodeVector(zone_));
MovePlannedNodes(block, schedule_->block(node));
if (FLAG_trace_turbo_scheduler) {
OFStream os(stdout);
- os << "Schedule after control flow fusion:\n" << *schedule_;
+ os << "Schedule after control flow fusion:" << *schedule_;
}
}
diff --git a/src/compiler/scheduler.h b/src/compiler/scheduler.h
index 2839a0c..b73d1bb 100644
--- a/src/compiler/scheduler.h
+++ b/src/compiler/scheduler.h
@@ -16,8 +16,6 @@
namespace internal {
namespace compiler {
-class SpecialRPONumberer;
-
// Computes a schedule from a graph, placing nodes into basic blocks and
// ordering the basic blocks in the special RPO order.
class Scheduler {
@@ -62,7 +60,6 @@
NodeVector schedule_root_nodes_; // Fixed root nodes seed the worklist.
ZoneQueue<Node*> schedule_queue_; // Worklist of schedulable nodes.
ZoneVector<SchedulerData> node_data_; // Per-node data for all nodes.
- SpecialRPONumberer* special_rpo_; // Special RPO numbering of blocks.
Scheduler(Zone* zone, Graph* graph, Schedule* schedule);
@@ -76,6 +73,7 @@
void IncrementUnscheduledUseCount(Node* node, int index, Node* from);
void DecrementUnscheduledUseCount(Node* node, int index, Node* from);
+ inline int GetRPONumber(BasicBlock* block);
BasicBlock* GetCommonDominator(BasicBlock* b1, BasicBlock* b2);
// Phase 1: Build control-flow graph.
@@ -99,9 +97,6 @@
friend class ScheduleLateNodeVisitor;
void ScheduleLate();
- // Phase 6: Seal the final schedule.
- void SealFinalSchedule();
-
void FuseFloatingControl(BasicBlock* block, Node* node);
void MovePlannedNodes(BasicBlock* from, BasicBlock* to);
};
diff --git a/src/compiler/x64/instruction-selector-x64.cc b/src/compiler/x64/instruction-selector-x64.cc
index c70944b..f927501 100644
--- a/src/compiler/x64/instruction-selector-x64.cc
+++ b/src/compiler/x64/instruction-selector-x64.cc
@@ -320,17 +320,6 @@
void InstructionSelector::VisitWord64Shl(Node* node) {
- X64OperandGenerator g(this);
- Int64BinopMatcher m(node);
- if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) &&
- m.right().IsInRange(32, 63)) {
- // There's no need to sign/zero-extend to 64-bit if we shift out the upper
- // 32 bits anyway.
- Emit(kX64Shl, g.DefineSameAsFirst(node),
- g.UseRegister(m.left().node()->InputAt(0)),
- g.UseImmediate(m.right().node()));
- return;
- }
VisitWord64Shift(this, node, kX64Shl);
}
diff --git a/src/debug-debugger.js b/src/debug-debugger.js
index fc4c5da..a1468a0 100644
--- a/src/debug-debugger.js
+++ b/src/debug-debugger.js
@@ -33,8 +33,7 @@
StepNext: 1,
StepIn: 2,
StepMin: 3,
- StepInMin: 4,
- StepFrame: 5 };
+ StepInMin: 4 };
// The different types of scripts matching enum ScriptType in objects.h.
Debug.ScriptType = { Native: 0,
diff --git a/src/debug.cc b/src/debug.cc
index 7fe9064..841b6cf 100644
--- a/src/debug.cc
+++ b/src/debug.cc
@@ -120,37 +120,21 @@
DCHECK(statement_position_ >= 0);
}
- // Check for break at return.
- if (RelocInfo::IsJSReturn(rmode())) {
- // Set the positions to the end of the function.
- if (debug_info_->shared()->HasSourceCode()) {
- position_ = debug_info_->shared()->end_position() -
- debug_info_->shared()->start_position() - 1;
- } else {
- position_ = 0;
- }
- statement_position_ = position_;
+ if (IsDebugBreakSlot()) {
+ // There is always a possible break point at a debug break slot.
break_point_++;
return;
- }
-
- if (RelocInfo::IsCodeTarget(rmode())) {
+ } else if (RelocInfo::IsCodeTarget(rmode())) {
// Check for breakable code target. Look in the original code as setting
// break points can cause the code targets in the running (debugged) code
// to be of a different kind than in the original code.
Address target = original_rinfo()->target_address();
Code* code = Code::GetCodeFromTargetAddress(target);
-
- if (RelocInfo::IsConstructCall(rmode()) || code->is_call_stub()) {
- break_point_++;
- return;
- }
-
- // Skip below if we only want locations for calls and returns.
- if (type_ == CALLS_AND_RETURNS) continue;
-
- if ((code->is_inline_cache_stub() && !code->is_binary_op_stub() &&
- !code->is_compare_ic_stub() && !code->is_to_boolean_ic_stub())) {
+ if ((code->is_inline_cache_stub() &&
+ !code->is_binary_op_stub() &&
+ !code->is_compare_ic_stub() &&
+ !code->is_to_boolean_ic_stub()) ||
+ RelocInfo::IsConstructCall(rmode())) {
break_point_++;
return;
}
@@ -173,8 +157,16 @@
}
}
- if (IsDebugBreakSlot() && type_ != CALLS_AND_RETURNS) {
- // There is always a possible break point at a debug break slot.
+ // Check for break at return.
+ if (RelocInfo::IsJSReturn(rmode())) {
+ // Set the positions to the end of the function.
+ if (debug_info_->shared()->HasSourceCode()) {
+ position_ = debug_info_->shared()->end_position() -
+ debug_info_->shared()->start_position() - 1;
+ } else {
+ position_ = 0;
+ }
+ statement_position_ = position_;
break_point_++;
return;
}
@@ -1197,8 +1189,7 @@
}
-void Debug::FloodWithOneShot(Handle<JSFunction> function,
- BreakLocatorType type) {
+void Debug::FloodWithOneShot(Handle<JSFunction> function) {
PrepareForBreakPoints();
// Make sure the function is compiled and has set up the debug info.
@@ -1209,7 +1200,7 @@
}
// Flood the function with break points.
- BreakLocationIterator it(GetDebugInfo(shared), type);
+ BreakLocationIterator it(GetDebugInfo(shared), ALL_BREAK_LOCATIONS);
while (!it.Done()) {
it.SetOneShot();
it.Next();
@@ -1225,7 +1216,7 @@
if (!bindee.is_null() && bindee->IsJSFunction() &&
!JSFunction::cast(*bindee)->IsFromNativeScript()) {
Handle<JSFunction> bindee_function(JSFunction::cast(*bindee));
- FloodWithOneShot(bindee_function);
+ Debug::FloodWithOneShot(bindee_function);
}
}
@@ -1305,7 +1296,7 @@
FloodHandlerWithOneShot();
// If the function on the top frame is unresolved perform step out. This will
- // be the case when calling unknown function and having the debugger stopped
+ // be the case when calling unknown functions and having the debugger stopped
// in an unhandled exception.
if (!frame->function()->IsJSFunction()) {
// Step out: Find the calling JavaScript frame and flood it with
@@ -1363,7 +1354,7 @@
if ((maybe_call_function_stub->kind() == Code::STUB &&
CodeStub::GetMajorKey(maybe_call_function_stub) ==
CodeStub::CallFunction) ||
- maybe_call_function_stub->is_call_stub()) {
+ maybe_call_function_stub->kind() == Code::CALL_IC) {
// Save reference to the code as we may need it to find out arguments
// count for 'step in' later.
call_function_stub = Handle<Code>(maybe_call_function_stub);
@@ -1404,9 +1395,7 @@
// Step next or step min.
// Fill the current function with one-shot break points.
- // If we are stepping into another frame, only fill calls and returns.
- FloodWithOneShot(function, step_action == StepFrame ? CALLS_AND_RETURNS
- : ALL_BREAK_LOCATIONS);
+ FloodWithOneShot(function);
// Remember source position and frame to handle step next.
thread_local_.last_statement_position_ =
@@ -1465,7 +1454,7 @@
if (fun->IsJSFunction()) {
Handle<JSFunction> js_function(JSFunction::cast(fun));
if (js_function->shared()->bound()) {
- FloodBoundFunctionWithOneShot(js_function);
+ Debug::FloodBoundFunctionWithOneShot(js_function);
} else if (!js_function->IsFromNativeScript()) {
// Don't step into builtins.
// It will also compile target function if it's not compiled yet.
@@ -1478,9 +1467,7 @@
// a call target as the function called might be a native function for
// which step in will not stop. It also prepares for stepping in
// getters/setters.
- // If we are stepping into another frame, only fill calls and returns.
- FloodWithOneShot(function, step_action == StepFrame ? CALLS_AND_RETURNS
- : ALL_BREAK_LOCATIONS);
+ FloodWithOneShot(function);
if (is_load_or_store) {
// Remember source position and frame to handle step in getter/setter. If
@@ -1509,20 +1496,15 @@
JavaScriptFrame* frame) {
// StepNext and StepOut shouldn't bring us deeper in code, so last frame
// shouldn't be a parent of current frame.
- StepAction step_action = thread_local_.last_step_action_;
-
- if (step_action == StepNext || step_action == StepOut) {
+ if (thread_local_.last_step_action_ == StepNext ||
+ thread_local_.last_step_action_ == StepOut) {
if (frame->fp() < thread_local_.last_fp_) return true;
}
- // We stepped into a new frame if the frame pointer changed.
- if (step_action == StepFrame) {
- return frame->UnpaddedFP() == thread_local_.last_fp_;
- }
-
// If the step last action was step next or step in make sure that a new
// statement is hit.
- if (step_action == StepNext || step_action == StepIn) {
+ if (thread_local_.last_step_action_ == StepNext ||
+ thread_local_.last_step_action_ == StepIn) {
// Never continue if returning from function.
if (break_location_iterator->IsExit()) return false;
@@ -1589,13 +1571,10 @@
// Handle stepping into a function.
-void Debug::HandleStepIn(Handle<Object> function_obj, Handle<Object> holder,
- Address fp, bool is_constructor) {
- // Flood getter/setter if we either step in or step to another frame.
- bool step_frame = thread_local_.last_step_action_ == StepFrame;
- if (!StepInActive() && !step_frame) return;
- if (!function_obj->IsJSFunction()) return;
- Handle<JSFunction> function = Handle<JSFunction>::cast(function_obj);
+void Debug::HandleStepIn(Handle<JSFunction> function,
+ Handle<Object> holder,
+ Address fp,
+ bool is_constructor) {
Isolate* isolate = function->GetIsolate();
// If the frame pointer is not supplied by the caller find it.
if (fp == 0) {
@@ -1610,11 +1589,11 @@
}
// Flood the function with one-shot break points if it is called from where
- // step into was requested, or when stepping into a new frame.
- if (fp == thread_local_.step_into_fp_ || step_frame) {
+ // step into was requested.
+ if (fp == thread_local_.step_into_fp_) {
if (function->shared()->bound()) {
// Handle Function.prototype.bind
- FloodBoundFunctionWithOneShot(function);
+ Debug::FloodBoundFunctionWithOneShot(function);
} else if (!function->IsFromNativeScript()) {
// Don't allow step into functions in the native context.
if (function->shared()->code() ==
@@ -1628,14 +1607,14 @@
if (!holder.is_null() && holder->IsJSFunction()) {
Handle<JSFunction> js_function = Handle<JSFunction>::cast(holder);
if (!js_function->IsFromNativeScript()) {
- FloodWithOneShot(js_function);
+ Debug::FloodWithOneShot(js_function);
} else if (js_function->shared()->bound()) {
// Handle Function.prototype.bind
- FloodBoundFunctionWithOneShot(js_function);
+ Debug::FloodBoundFunctionWithOneShot(js_function);
}
}
} else {
- FloodWithOneShot(function);
+ Debug::FloodWithOneShot(function);
}
}
}
diff --git a/src/debug.h b/src/debug.h
index e486d97..2afe0f6 100644
--- a/src/debug.h
+++ b/src/debug.h
@@ -32,14 +32,13 @@
// Step actions. NOTE: These values are in macros.py as well.
enum StepAction {
StepNone = -1, // Stepping not prepared.
- StepOut = 0, // Step out of the current function.
- StepNext = 1, // Step to the next statement in the current function.
- StepIn = 2, // Step into new functions invoked or the next statement
- // in the current function.
- StepMin = 3, // Perform a minimum step in the current function.
- StepInMin = 4, // Step into new functions invoked or perform a minimum step
- // in the current function.
- StepFrame = 5 // Step into a new frame or return to previous frame.
+ StepOut = 0, // Step out of the current function.
+ StepNext = 1, // Step to the next statement in the current function.
+ StepIn = 2, // Step into new functions invoked or the next statement
+ // in the current function.
+ StepMin = 3, // Perform a minimum step in the current function.
+ StepInMin = 4 // Step into new functions invoked or perform a minimum step
+ // in the current function.
};
@@ -50,11 +49,10 @@
};
-// Type of exception break.
+// Type of exception break. NOTE: These values are in macros.py as well.
enum BreakLocatorType {
ALL_BREAK_LOCATIONS = 0,
- SOURCE_BREAK_LOCATIONS = 1,
- CALLS_AND_RETURNS = 2
+ SOURCE_BREAK_LOCATIONS = 1
};
@@ -387,8 +385,7 @@
BreakPositionAlignment alignment);
void ClearBreakPoint(Handle<Object> break_point_object);
void ClearAllBreakPoints();
- void FloodWithOneShot(Handle<JSFunction> function,
- BreakLocatorType type = ALL_BREAK_LOCATIONS);
+ void FloodWithOneShot(Handle<JSFunction> function);
void FloodBoundFunctionWithOneShot(Handle<JSFunction> function);
void FloodHandlerWithOneShot();
void ChangeBreakOnException(ExceptionBreakType type, bool enable);
@@ -404,8 +401,10 @@
bool StepNextContinue(BreakLocationIterator* break_location_iterator,
JavaScriptFrame* frame);
bool StepInActive() { return thread_local_.step_into_fp_ != 0; }
- void HandleStepIn(Handle<Object> function_obj, Handle<Object> holder,
- Address fp, bool is_constructor);
+ void HandleStepIn(Handle<JSFunction> function,
+ Handle<Object> holder,
+ Address fp,
+ bool is_constructor);
bool StepOutActive() { return thread_local_.step_out_fp_ != 0; }
// Purge all code objects that have no debug break slots.
@@ -624,7 +623,7 @@
// Number of steps left to perform before debug event.
int step_count_;
- // Frame pointer from last step next or step frame action.
+ // Frame pointer from last step next action.
Address last_fp_;
// Number of queued steps left to perform before debug event.
diff --git a/src/globals.h b/src/globals.h
index c6ba010..ae79038 100644
--- a/src/globals.h
+++ b/src/globals.h
@@ -26,8 +26,8 @@
# define V8_INFINITY INFINITY
#endif
-#if V8_TARGET_ARCH_IA32 || (V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_32_BIT) || \
- V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_MIPS
+#if V8_TARGET_ARCH_IA32 || V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM || \
+ V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_MIPS
#define V8_TURBOFAN_BACKEND 1
#else
#define V8_TURBOFAN_BACKEND 0
@@ -354,7 +354,6 @@
class String;
class Name;
class Struct;
-class Symbol;
class Variable;
class RelocInfo;
class Deserializer;
diff --git a/src/heap-snapshot-generator-inl.h b/src/heap-snapshot-generator-inl.h
index ad95776..3f7e622 100644
--- a/src/heap-snapshot-generator-inl.h
+++ b/src/heap-snapshot-generator-inl.h
@@ -12,7 +12,7 @@
HeapEntry* HeapGraphEdge::from() const {
- return &snapshot()->entries()[from_index()];
+ return &snapshot()->entries()[from_index_];
}
diff --git a/src/heap-snapshot-generator.cc b/src/heap-snapshot-generator.cc
index 7f217bb..68522fc 100644
--- a/src/heap-snapshot-generator.cc
+++ b/src/heap-snapshot-generator.cc
@@ -18,7 +18,8 @@
HeapGraphEdge::HeapGraphEdge(Type type, const char* name, int from, int to)
- : bit_field_(TypeField::encode(type) | FromIndexField::encode(from)),
+ : type_(type),
+ from_index_(from),
to_index_(to),
name_(name) {
DCHECK(type == kContextVariable
@@ -30,7 +31,8 @@
HeapGraphEdge::HeapGraphEdge(Type type, int index, int from, int to)
- : bit_field_(TypeField::encode(type) | FromIndexField::encode(from)),
+ : type_(type),
+ from_index_(from),
to_index_(to),
index_(index) {
DCHECK(type == kElement || type == kHidden);
diff --git a/src/heap-snapshot-generator.h b/src/heap-snapshot-generator.h
index fb43876..646d497 100644
--- a/src/heap-snapshot-generator.h
+++ b/src/heap-snapshot-generator.h
@@ -28,18 +28,22 @@
kWeak = v8::HeapGraphEdge::kWeak
};
+ HeapGraphEdge() { }
HeapGraphEdge(Type type, const char* name, int from, int to);
HeapGraphEdge(Type type, int index, int from, int to);
void ReplaceToIndexWithEntry(HeapSnapshot* snapshot);
- Type type() const { return TypeField::decode(bit_field_); }
+ Type type() const { return static_cast<Type>(type_); }
int index() const {
- DCHECK(type() == kElement || type() == kHidden);
+ DCHECK(type_ == kElement || type_ == kHidden);
return index_;
}
const char* name() const {
- DCHECK(type() == kContextVariable || type() == kProperty ||
- type() == kInternal || type() == kShortcut || type() == kWeak);
+ DCHECK(type_ == kContextVariable
+ || type_ == kProperty
+ || type_ == kInternal
+ || type_ == kShortcut
+ || type_ == kWeak);
return name_;
}
INLINE(HeapEntry* from() const);
@@ -47,11 +51,9 @@
private:
INLINE(HeapSnapshot* snapshot() const);
- int from_index() const { return FromIndexField::decode(bit_field_); }
- class TypeField : public BitField<Type, 0, 3> {};
- class FromIndexField : public BitField<int, 3, 29> {};
- uint32_t bit_field_;
+ unsigned type_ : 3;
+ int from_index_ : 29;
union {
// During entries population |to_index_| is used for storing the index,
// afterwards it is replaced with a pointer to the entry.
diff --git a/src/heap/heap.cc b/src/heap/heap.cc
index c4eed9c..5c8cd45 100644
--- a/src/heap/heap.cc
+++ b/src/heap/heap.cc
@@ -2038,17 +2038,7 @@
// Order is important: slot might be inside of the target if target
// was allocated over a dead object and slot comes from the store
// buffer.
-
- // Unfortunately, the allocation can also write over the slot if the slot
- // was in free space and the allocation wrote free list data (such as the
- // free list map or entry size) over the slot. We guard against this by
- // checking that the slot still points to the object being moved. This
- // should be sufficient because neither the free list map nor the free
- // list entry size should look like a new space pointer (the former is an
- // old space pointer, the latter is word-aligned).
- if (*slot == object) {
- *slot = target;
- }
+ *slot = target;
MigrateObject(heap, object, target, object_size);
if (object_contents == POINTER_OBJECT) {
diff --git a/src/hydrogen-instructions.cc b/src/hydrogen-instructions.cc
index ce76fbe..188119d 100644
--- a/src/hydrogen-instructions.cc
+++ b/src/hydrogen-instructions.cc
@@ -1789,7 +1789,7 @@
Range* HConstant::InferRange(Zone* zone) {
- if (HasInteger32Value()) {
+ if (has_int32_value_) {
Range* result = new(zone) Range(int32_value_, int32_value_);
result->set_can_be_minus_zero(false);
return result;
@@ -2606,7 +2606,7 @@
void HSimulate::ReplayEnvironment(HEnvironment* env) {
- if (is_done_with_replay()) return;
+ if (done_with_replay_) return;
DCHECK(env != NULL);
env->set_ast_id(ast_id());
env->Drop(pop_count());
@@ -2618,7 +2618,7 @@
env->Push(value);
}
}
- set_done_with_replay();
+ done_with_replay_ = true;
}
@@ -2674,41 +2674,36 @@
HConstant::HConstant(Handle<Object> object, Representation r)
- : HTemplateInstruction<0>(HType::FromValue(object)),
- object_(Unique<Object>::CreateUninitialized(object)),
- object_map_(Handle<Map>::null()),
- bit_field_(HasStableMapValueField::encode(false) |
- HasSmiValueField::encode(false) |
- HasInt32ValueField::encode(false) |
- HasDoubleValueField::encode(false) |
- HasExternalReferenceValueField::encode(false) |
- IsNotInNewSpaceField::encode(true) |
- BooleanValueField::encode(object->BooleanValue()) |
- IsUndetectableField::encode(false) |
- InstanceTypeField::encode(kUnknownInstanceType)) {
+ : HTemplateInstruction<0>(HType::FromValue(object)),
+ object_(Unique<Object>::CreateUninitialized(object)),
+ object_map_(Handle<Map>::null()),
+ has_stable_map_value_(false),
+ has_smi_value_(false),
+ has_int32_value_(false),
+ has_double_value_(false),
+ has_external_reference_value_(false),
+ is_not_in_new_space_(true),
+ boolean_value_(object->BooleanValue()),
+ is_undetectable_(false),
+ instance_type_(kUnknownInstanceType) {
if (object->IsHeapObject()) {
Handle<HeapObject> heap_object = Handle<HeapObject>::cast(object);
Isolate* isolate = heap_object->GetIsolate();
Handle<Map> map(heap_object->map(), isolate);
- bit_field_ = IsNotInNewSpaceField::update(
- bit_field_, !isolate->heap()->InNewSpace(*object));
- bit_field_ = InstanceTypeField::update(bit_field_, map->instance_type());
- bit_field_ =
- IsUndetectableField::update(bit_field_, map->is_undetectable());
+ is_not_in_new_space_ = !isolate->heap()->InNewSpace(*object);
+ instance_type_ = map->instance_type();
+ is_undetectable_ = map->is_undetectable();
if (map->is_stable()) object_map_ = Unique<Map>::CreateImmovable(map);
- bit_field_ = HasStableMapValueField::update(
- bit_field_,
- HasMapValue() && Handle<Map>::cast(heap_object)->is_stable());
+ has_stable_map_value_ = (instance_type_ == MAP_TYPE &&
+ Handle<Map>::cast(heap_object)->is_stable());
}
if (object->IsNumber()) {
double n = object->Number();
- bool has_int32_value = IsInteger32(n);
- bit_field_ = HasInt32ValueField::update(bit_field_, has_int32_value);
+ has_int32_value_ = IsInteger32(n);
int32_value_ = DoubleToInt32(n);
- bit_field_ = HasSmiValueField::update(
- bit_field_, has_int32_value && Smi::IsValid(int32_value_));
+ has_smi_value_ = has_int32_value_ && Smi::IsValid(int32_value_);
double_value_ = n;
- bit_field_ = HasDoubleValueField::update(bit_field_, true);
+ has_double_value_ = true;
// TODO(titzer): if this heap number is new space, tenure a new one.
}
@@ -2716,104 +2711,112 @@
}
-HConstant::HConstant(Unique<Object> object, Unique<Map> object_map,
- bool has_stable_map_value, Representation r, HType type,
- bool is_not_in_new_space, bool boolean_value,
- bool is_undetectable, InstanceType instance_type)
- : HTemplateInstruction<0>(type),
- object_(object),
- object_map_(object_map),
- bit_field_(HasStableMapValueField::encode(has_stable_map_value) |
- HasSmiValueField::encode(false) |
- HasInt32ValueField::encode(false) |
- HasDoubleValueField::encode(false) |
- HasExternalReferenceValueField::encode(false) |
- IsNotInNewSpaceField::encode(is_not_in_new_space) |
- BooleanValueField::encode(boolean_value) |
- IsUndetectableField::encode(is_undetectable) |
- InstanceTypeField::encode(instance_type)) {
+HConstant::HConstant(Unique<Object> object,
+ Unique<Map> object_map,
+ bool has_stable_map_value,
+ Representation r,
+ HType type,
+ bool is_not_in_new_space,
+ bool boolean_value,
+ bool is_undetectable,
+ InstanceType instance_type)
+ : HTemplateInstruction<0>(type),
+ object_(object),
+ object_map_(object_map),
+ has_stable_map_value_(has_stable_map_value),
+ has_smi_value_(false),
+ has_int32_value_(false),
+ has_double_value_(false),
+ has_external_reference_value_(false),
+ is_not_in_new_space_(is_not_in_new_space),
+ boolean_value_(boolean_value),
+ is_undetectable_(is_undetectable),
+ instance_type_(instance_type) {
DCHECK(!object.handle().is_null());
DCHECK(!type.IsTaggedNumber() || type.IsNone());
Initialize(r);
}
-HConstant::HConstant(int32_t integer_value, Representation r,
- bool is_not_in_new_space, Unique<Object> object)
- : object_(object),
- object_map_(Handle<Map>::null()),
- bit_field_(HasStableMapValueField::encode(false) |
- HasSmiValueField::encode(Smi::IsValid(integer_value)) |
- HasInt32ValueField::encode(true) |
- HasDoubleValueField::encode(true) |
- HasExternalReferenceValueField::encode(false) |
- IsNotInNewSpaceField::encode(is_not_in_new_space) |
- BooleanValueField::encode(integer_value != 0) |
- IsUndetectableField::encode(false) |
- InstanceTypeField::encode(kUnknownInstanceType)),
- int32_value_(integer_value),
- double_value_(FastI2D(integer_value)) {
+HConstant::HConstant(int32_t integer_value,
+ Representation r,
+ bool is_not_in_new_space,
+ Unique<Object> object)
+ : object_(object),
+ object_map_(Handle<Map>::null()),
+ has_stable_map_value_(false),
+ has_smi_value_(Smi::IsValid(integer_value)),
+ has_int32_value_(true),
+ has_double_value_(true),
+ has_external_reference_value_(false),
+ is_not_in_new_space_(is_not_in_new_space),
+ boolean_value_(integer_value != 0),
+ is_undetectable_(false),
+ int32_value_(integer_value),
+ double_value_(FastI2D(integer_value)),
+ instance_type_(kUnknownInstanceType) {
// It's possible to create a constant with a value in Smi-range but stored
// in a (pre-existing) HeapNumber. See crbug.com/349878.
bool could_be_heapobject = r.IsTagged() && !object.handle().is_null();
- bool is_smi = HasSmiValue() && !could_be_heapobject;
+ bool is_smi = has_smi_value_ && !could_be_heapobject;
set_type(is_smi ? HType::Smi() : HType::TaggedNumber());
Initialize(r);
}
-HConstant::HConstant(double double_value, Representation r,
- bool is_not_in_new_space, Unique<Object> object)
- : object_(object),
- object_map_(Handle<Map>::null()),
- bit_field_(HasStableMapValueField::encode(false) |
- HasInt32ValueField::encode(IsInteger32(double_value)) |
- HasDoubleValueField::encode(true) |
- HasExternalReferenceValueField::encode(false) |
- IsNotInNewSpaceField::encode(is_not_in_new_space) |
- BooleanValueField::encode(double_value != 0 &&
- !std::isnan(double_value)) |
- IsUndetectableField::encode(false) |
- InstanceTypeField::encode(kUnknownInstanceType)),
- int32_value_(DoubleToInt32(double_value)),
- double_value_(double_value) {
- bit_field_ = HasSmiValueField::update(
- bit_field_, HasInteger32Value() && Smi::IsValid(int32_value_));
+HConstant::HConstant(double double_value,
+ Representation r,
+ bool is_not_in_new_space,
+ Unique<Object> object)
+ : object_(object),
+ object_map_(Handle<Map>::null()),
+ has_stable_map_value_(false),
+ has_int32_value_(IsInteger32(double_value)),
+ has_double_value_(true),
+ has_external_reference_value_(false),
+ is_not_in_new_space_(is_not_in_new_space),
+ boolean_value_(double_value != 0 && !std::isnan(double_value)),
+ is_undetectable_(false),
+ int32_value_(DoubleToInt32(double_value)),
+ double_value_(double_value),
+ instance_type_(kUnknownInstanceType) {
+ has_smi_value_ = has_int32_value_ && Smi::IsValid(int32_value_);
// It's possible to create a constant with a value in Smi-range but stored
// in a (pre-existing) HeapNumber. See crbug.com/349878.
bool could_be_heapobject = r.IsTagged() && !object.handle().is_null();
- bool is_smi = HasSmiValue() && !could_be_heapobject;
+ bool is_smi = has_smi_value_ && !could_be_heapobject;
set_type(is_smi ? HType::Smi() : HType::TaggedNumber());
Initialize(r);
}
HConstant::HConstant(ExternalReference reference)
- : HTemplateInstruction<0>(HType::Any()),
- object_(Unique<Object>(Handle<Object>::null())),
- object_map_(Handle<Map>::null()),
- bit_field_(
- HasStableMapValueField::encode(false) |
- HasSmiValueField::encode(false) | HasInt32ValueField::encode(false) |
- HasDoubleValueField::encode(false) |
- HasExternalReferenceValueField::encode(true) |
- IsNotInNewSpaceField::encode(true) | BooleanValueField::encode(true) |
- IsUndetectableField::encode(false) |
- InstanceTypeField::encode(kUnknownInstanceType)),
- external_reference_value_(reference) {
+ : HTemplateInstruction<0>(HType::Any()),
+ object_(Unique<Object>(Handle<Object>::null())),
+ object_map_(Handle<Map>::null()),
+ has_stable_map_value_(false),
+ has_smi_value_(false),
+ has_int32_value_(false),
+ has_double_value_(false),
+ has_external_reference_value_(true),
+ is_not_in_new_space_(true),
+ boolean_value_(true),
+ is_undetectable_(false),
+ external_reference_value_(reference),
+ instance_type_(kUnknownInstanceType) {
Initialize(Representation::External());
}
void HConstant::Initialize(Representation r) {
if (r.IsNone()) {
- if (HasSmiValue() && SmiValuesAre31Bits()) {
+ if (has_smi_value_ && SmiValuesAre31Bits()) {
r = Representation::Smi();
- } else if (HasInteger32Value()) {
+ } else if (has_int32_value_) {
r = Representation::Integer32();
- } else if (HasDoubleValue()) {
+ } else if (has_double_value_) {
r = Representation::Double();
- } else if (HasExternalReferenceValue()) {
+ } else if (has_external_reference_value_) {
r = Representation::External();
} else {
Handle<Object> object = object_.handle();
@@ -2840,16 +2843,16 @@
bool HConstant::ImmortalImmovable() const {
- if (HasInteger32Value()) {
+ if (has_int32_value_) {
return false;
}
- if (HasDoubleValue()) {
+ if (has_double_value_) {
if (IsSpecialDouble()) {
return true;
}
return false;
}
- if (HasExternalReferenceValue()) {
+ if (has_external_reference_value_) {
return false;
}
@@ -2890,35 +2893,44 @@
HConstant* HConstant::CopyToRepresentation(Representation r, Zone* zone) const {
- if (r.IsSmi() && !HasSmiValue()) return NULL;
- if (r.IsInteger32() && !HasInteger32Value()) return NULL;
- if (r.IsDouble() && !HasDoubleValue()) return NULL;
- if (r.IsExternal() && !HasExternalReferenceValue()) return NULL;
- if (HasInteger32Value()) {
- return new (zone) HConstant(int32_value_, r, NotInNewSpace(), object_);
+ if (r.IsSmi() && !has_smi_value_) return NULL;
+ if (r.IsInteger32() && !has_int32_value_) return NULL;
+ if (r.IsDouble() && !has_double_value_) return NULL;
+ if (r.IsExternal() && !has_external_reference_value_) return NULL;
+ if (has_int32_value_) {
+ return new(zone) HConstant(int32_value_, r, is_not_in_new_space_, object_);
}
- if (HasDoubleValue()) {
- return new (zone) HConstant(double_value_, r, NotInNewSpace(), object_);
+ if (has_double_value_) {
+ return new(zone) HConstant(double_value_, r, is_not_in_new_space_, object_);
}
- if (HasExternalReferenceValue()) {
+ if (has_external_reference_value_) {
return new(zone) HConstant(external_reference_value_);
}
DCHECK(!object_.handle().is_null());
- return new (zone) HConstant(object_, object_map_, HasStableMapValue(), r,
- type_, NotInNewSpace(), BooleanValue(),
- IsUndetectable(), GetInstanceType());
+ return new(zone) HConstant(object_,
+ object_map_,
+ has_stable_map_value_,
+ r,
+ type_,
+ is_not_in_new_space_,
+ boolean_value_,
+ is_undetectable_,
+ instance_type_);
}
Maybe<HConstant*> HConstant::CopyToTruncatedInt32(Zone* zone) {
HConstant* res = NULL;
- if (HasInteger32Value()) {
- res = new (zone) HConstant(int32_value_, Representation::Integer32(),
- NotInNewSpace(), object_);
- } else if (HasDoubleValue()) {
- res = new (zone)
- HConstant(DoubleToInt32(double_value_), Representation::Integer32(),
- NotInNewSpace(), object_);
+ if (has_int32_value_) {
+ res = new(zone) HConstant(int32_value_,
+ Representation::Integer32(),
+ is_not_in_new_space_,
+ object_);
+ } else if (has_double_value_) {
+ res = new(zone) HConstant(DoubleToInt32(double_value_),
+ Representation::Integer32(),
+ is_not_in_new_space_,
+ object_);
}
return Maybe<HConstant*>(res != NULL, res);
}
@@ -2940,11 +2952,11 @@
std::ostream& HConstant::PrintDataTo(std::ostream& os) const { // NOLINT
- if (HasInteger32Value()) {
+ if (has_int32_value_) {
os << int32_value_ << " ";
- } else if (HasDoubleValue()) {
+ } else if (has_double_value_) {
os << double_value_ << " ";
- } else if (HasExternalReferenceValue()) {
+ } else if (has_external_reference_value_) {
os << reinterpret_cast<void*>(external_reference_value_.address()) << " ";
} else {
// The handle() method is silently and lazily mutating the object.
@@ -2953,7 +2965,7 @@
if (HasStableMapValue()) os << "[stable-map] ";
if (HasObjectMap()) os << "[map " << *ObjectMap().handle() << "] ";
}
- if (!NotInNewSpace()) os << "[new space] ";
+ if (!is_not_in_new_space_) os << "[new space] ";
return os;
}
diff --git a/src/hydrogen-instructions.h b/src/hydrogen-instructions.h
index 233ca42..810a2fd 100644
--- a/src/hydrogen-instructions.h
+++ b/src/hydrogen-instructions.h
@@ -1497,18 +1497,13 @@
virtual std::ostream& PrintDataTo(std::ostream& os) const OVERRIDE; // NOLINT
static const int kNoKnownSuccessorIndex = -1;
- int known_successor_index() const {
- return KnownSuccessorIndexField::decode(bit_field_) -
- kInternalKnownSuccessorOffset;
- }
- void set_known_successor_index(int index) {
- DCHECK(index >= 0 - kInternalKnownSuccessorOffset);
- bit_field_ = KnownSuccessorIndexField::update(
- bit_field_, index + kInternalKnownSuccessorOffset);
+ int known_successor_index() const { return known_successor_index_; }
+ void set_known_successor_index(int known_successor_index) {
+ known_successor_index_ = known_successor_index;
}
Unique<Map> map() const { return map_; }
- bool map_is_stable() const { return MapIsStableField::decode(bit_field_); }
+ bool map_is_stable() const { return map_is_stable_; }
virtual Representation RequiredInputRepresentation(int index) OVERRIDE {
return Representation::Tagged();
@@ -1520,25 +1515,19 @@
virtual int RedefinedOperandIndex() OVERRIDE { return 0; }
private:
- HCompareMap(HValue* value, Handle<Map> map, HBasicBlock* true_target = NULL,
+ HCompareMap(HValue* value,
+ Handle<Map> map,
+ HBasicBlock* true_target = NULL,
HBasicBlock* false_target = NULL)
: HUnaryControlInstruction(value, true_target, false_target),
- bit_field_(KnownSuccessorIndexField::encode(
- kNoKnownSuccessorIndex + kInternalKnownSuccessorOffset) |
- MapIsStableField::encode(map->is_stable())),
+ known_successor_index_(kNoKnownSuccessorIndex),
+ map_is_stable_(map->is_stable()),
map_(Unique<Map>::CreateImmovable(map)) {
set_representation(Representation::Tagged());
}
- // BitFields can only store unsigned values, so use an offset.
- // Adding kInternalKnownSuccessorOffset must yield an unsigned value.
- static const int kInternalKnownSuccessorOffset = 1;
- STATIC_ASSERT(kNoKnownSuccessorIndex + kInternalKnownSuccessorOffset >= 0);
-
- class KnownSuccessorIndexField : public BitField<int, 0, 31> {};
- class MapIsStableField : public BitField<bool, 31, 1> {};
-
- uint32_t bit_field_;
+ int known_successor_index_ : 31;
+ bool map_is_stable_ : 1;
Unique<Map> map_;
};
@@ -1814,15 +1803,17 @@
class HSimulate FINAL : public HInstruction {
public:
- HSimulate(BailoutId ast_id, int pop_count, Zone* zone,
+ HSimulate(BailoutId ast_id,
+ int pop_count,
+ Zone* zone,
RemovableSimulate removable)
: ast_id_(ast_id),
pop_count_(pop_count),
values_(2, zone),
assigned_indexes_(2, zone),
zone_(zone),
- bit_field_(RemovableField::encode(removable) |
- DoneWithReplayField::encode(false)) {}
+ removable_(removable),
+ done_with_replay_(false) {}
~HSimulate() {}
virtual std::ostream& PrintDataTo(std::ostream& os) const OVERRIDE; // NOLINT
@@ -1866,9 +1857,7 @@
}
void MergeWith(ZoneList<HSimulate*>* list);
- bool is_candidate_for_removal() {
- return RemovableField::decode(bit_field_) == REMOVABLE_SIMULATE;
- }
+ bool is_candidate_for_removal() { return removable_ == REMOVABLE_SIMULATE; }
// Replay effects of this instruction on the given environment.
void ReplayEnvironment(HEnvironment* env);
@@ -1902,22 +1891,13 @@
}
return false;
}
- bool is_done_with_replay() const {
- return DoneWithReplayField::decode(bit_field_);
- }
- void set_done_with_replay() {
- bit_field_ = DoneWithReplayField::update(bit_field_, true);
- }
-
- class RemovableField : public BitField<RemovableSimulate, 0, 1> {};
- class DoneWithReplayField : public BitField<bool, 1, 1> {};
-
BailoutId ast_id_;
int pop_count_;
ZoneList<HValue*> values_;
ZoneList<int> assigned_indexes_;
Zone* zone_;
- uint32_t bit_field_;
+ RemovableSimulate removable_ : 2;
+ bool done_with_replay_ : 1;
#ifdef DEBUG
Handle<JSFunction> closure_;
@@ -2762,13 +2742,11 @@
return new(zone) HCheckMaps(value, maps, typecheck);
}
- bool IsStabilityCheck() const {
- return IsStabilityCheckField::decode(bit_field_);
- }
+ bool IsStabilityCheck() const { return is_stability_check_; }
void MarkAsStabilityCheck() {
- bit_field_ = MapsAreStableField::encode(true) |
- HasMigrationTargetField::encode(false) |
- IsStabilityCheckField::encode(true);
+ maps_are_stable_ = true;
+ has_migration_target_ = false;
+ is_stability_check_ = true;
ClearChangesFlag(kNewSpacePromotion);
ClearDependsOnFlag(kElementsKind);
ClearDependsOnFlag(kMaps);
@@ -2792,13 +2770,9 @@
const UniqueSet<Map>* maps() const { return maps_; }
void set_maps(const UniqueSet<Map>* maps) { maps_ = maps; }
- bool maps_are_stable() const {
- return MapsAreStableField::decode(bit_field_);
- }
+ bool maps_are_stable() const { return maps_are_stable_; }
- bool HasMigrationTarget() const {
- return HasMigrationTargetField::decode(bit_field_);
- }
+ bool HasMigrationTarget() const { return has_migration_target_; }
virtual HValue* Canonicalize() OVERRIDE;
@@ -2830,11 +2804,9 @@
private:
HCheckMaps(HValue* value, const UniqueSet<Map>* maps, bool maps_are_stable)
- : HTemplateInstruction<2>(HType::HeapObject()),
- maps_(maps),
- bit_field_(HasMigrationTargetField::encode(false) |
- IsStabilityCheckField::encode(false) |
- MapsAreStableField::encode(maps_are_stable)) {
+ : HTemplateInstruction<2>(HType::HeapObject()), maps_(maps),
+ has_migration_target_(false), is_stability_check_(false),
+ maps_are_stable_(maps_are_stable) {
DCHECK_NE(0, maps->size());
SetOperandAt(0, value);
// Use the object value for the dependency.
@@ -2846,11 +2818,9 @@
}
HCheckMaps(HValue* value, const UniqueSet<Map>* maps, HValue* typecheck)
- : HTemplateInstruction<2>(HType::HeapObject()),
- maps_(maps),
- bit_field_(HasMigrationTargetField::encode(false) |
- IsStabilityCheckField::encode(false) |
- MapsAreStableField::encode(true)) {
+ : HTemplateInstruction<2>(HType::HeapObject()), maps_(maps),
+ has_migration_target_(false), is_stability_check_(false),
+ maps_are_stable_(true) {
DCHECK_NE(0, maps->size());
SetOperandAt(0, value);
// Use the object value for the dependency if NULL is passed.
@@ -2861,22 +2831,16 @@
SetDependsOnFlag(kElementsKind);
for (int i = 0; i < maps->size(); ++i) {
Handle<Map> map = maps->at(i).handle();
- if (map->is_migration_target()) {
- bit_field_ = HasMigrationTargetField::update(bit_field_, true);
- }
- if (!map->is_stable()) {
- bit_field_ = MapsAreStableField::update(bit_field_, false);
- }
+ if (map->is_migration_target()) has_migration_target_ = true;
+ if (!map->is_stable()) maps_are_stable_ = false;
}
- if (HasMigrationTarget()) SetChangesFlag(kNewSpacePromotion);
+ if (has_migration_target_) SetChangesFlag(kNewSpacePromotion);
}
- class HasMigrationTargetField : public BitField<bool, 0, 1> {};
- class IsStabilityCheckField : public BitField<bool, 1, 1> {};
- class MapsAreStableField : public BitField<bool, 2, 1> {};
-
const UniqueSet<Map>* maps_;
- uint32_t bit_field_;
+ bool has_migration_target_ : 1;
+ bool is_stability_check_ : 1;
+ bool maps_are_stable_ : 1;
};
@@ -3573,26 +3537,29 @@
isolate->factory()->NewNumber(double_value_, TENURED));
}
AllowDeferredHandleDereference smi_check;
- DCHECK(HasInteger32Value() || !object_.handle()->IsSmi());
+ DCHECK(has_int32_value_ || !object_.handle()->IsSmi());
return object_.handle();
}
bool IsSpecialDouble() const {
- return HasDoubleValue() &&
+ return has_double_value_ &&
(bit_cast<int64_t>(double_value_) == bit_cast<int64_t>(-0.0) ||
FixedDoubleArray::is_the_hole_nan(double_value_) ||
std::isnan(double_value_));
}
bool NotInNewSpace() const {
- return IsNotInNewSpaceField::decode(bit_field_);
+ return is_not_in_new_space_;
}
bool ImmortalImmovable() const;
bool IsCell() const {
- InstanceType instance_type = GetInstanceType();
- return instance_type == CELL_TYPE || instance_type == PROPERTY_CELL_TYPE;
+ return instance_type_ == CELL_TYPE || instance_type_ == PROPERTY_CELL_TYPE;
+ }
+
+ bool IsMap() const {
+ return instance_type_ == MAP_TYPE;
}
virtual Representation RequiredInputRepresentation(int index) OVERRIDE {
@@ -3612,17 +3579,13 @@
HConstant* CopyToRepresentation(Representation r, Zone* zone) const;
Maybe<HConstant*> CopyToTruncatedInt32(Zone* zone);
Maybe<HConstant*> CopyToTruncatedNumber(Zone* zone);
- bool HasInteger32Value() const {
- return HasInt32ValueField::decode(bit_field_);
- }
+ bool HasInteger32Value() const { return has_int32_value_; }
int32_t Integer32Value() const {
DCHECK(HasInteger32Value());
return int32_value_;
}
- bool HasSmiValue() const { return HasSmiValueField::decode(bit_field_); }
- bool HasDoubleValue() const {
- return HasDoubleValueField::decode(bit_field_);
- }
+ bool HasSmiValue() const { return has_smi_value_; }
+ bool HasDoubleValue() const { return has_double_value_; }
double DoubleValue() const {
DCHECK(HasDoubleValue());
return double_value_;
@@ -3634,7 +3597,7 @@
return object_.IsInitialized() &&
object_.IsKnownGlobal(isolate()->heap()->the_hole_value());
}
- bool HasNumberValue() const { return HasDoubleValue(); }
+ bool HasNumberValue() const { return has_double_value_; }
int32_t NumberValueAsInteger32() const {
DCHECK(HasNumberValue());
// Irrespective of whether a numeric HConstant can be safely
@@ -3643,42 +3606,38 @@
return int32_value_;
}
bool HasStringValue() const {
- if (HasNumberValue()) return false;
+ if (has_double_value_ || has_int32_value_) return false;
DCHECK(!object_.handle().is_null());
- return GetInstanceType() < FIRST_NONSTRING_TYPE;
+ return instance_type_ < FIRST_NONSTRING_TYPE;
}
Handle<String> StringValue() const {
DCHECK(HasStringValue());
return Handle<String>::cast(object_.handle());
}
bool HasInternalizedStringValue() const {
- return HasStringValue() && StringShape(GetInstanceType()).IsInternalized();
+ return HasStringValue() && StringShape(instance_type_).IsInternalized();
}
bool HasExternalReferenceValue() const {
- return HasExternalReferenceValueField::decode(bit_field_);
+ return has_external_reference_value_;
}
ExternalReference ExternalReferenceValue() const {
return external_reference_value_;
}
bool HasBooleanValue() const { return type_.IsBoolean(); }
- bool BooleanValue() const { return BooleanValueField::decode(bit_field_); }
- bool IsUndetectable() const {
- return IsUndetectableField::decode(bit_field_);
- }
- InstanceType GetInstanceType() const {
- return InstanceTypeField::decode(bit_field_);
- }
+ bool BooleanValue() const { return boolean_value_; }
+ bool IsUndetectable() const { return is_undetectable_; }
+ InstanceType GetInstanceType() const { return instance_type_; }
- bool HasMapValue() const { return GetInstanceType() == MAP_TYPE; }
+ bool HasMapValue() const { return instance_type_ == MAP_TYPE; }
Unique<Map> MapValue() const {
DCHECK(HasMapValue());
return Unique<Map>::cast(GetUnique());
}
bool HasStableMapValue() const {
- DCHECK(HasMapValue() || !HasStableMapValueField::decode(bit_field_));
- return HasStableMapValueField::decode(bit_field_);
+ DCHECK(HasMapValue() || !has_stable_map_value_);
+ return has_stable_map_value_;
}
bool HasObjectMap() const { return !object_map_.IsNull(); }
@@ -3688,11 +3647,11 @@
}
virtual intptr_t Hashcode() OVERRIDE {
- if (HasInteger32Value()) {
+ if (has_int32_value_) {
return static_cast<intptr_t>(int32_value_);
- } else if (HasDoubleValue()) {
+ } else if (has_double_value_) {
return static_cast<intptr_t>(bit_cast<int64_t>(double_value_));
- } else if (HasExternalReferenceValue()) {
+ } else if (has_external_reference_value_) {
return reinterpret_cast<intptr_t>(external_reference_value_.address());
} else {
DCHECK(!object_.handle().is_null());
@@ -3701,7 +3660,7 @@
}
virtual void FinalizeUniqueness() OVERRIDE {
- if (!HasDoubleValue() && !HasExternalReferenceValue()) {
+ if (!has_double_value_ && !has_external_reference_value_) {
DCHECK(!object_.handle().is_null());
object_ = Unique<Object>(object_.handle());
}
@@ -3717,21 +3676,21 @@
virtual bool DataEquals(HValue* other) OVERRIDE {
HConstant* other_constant = HConstant::cast(other);
- if (HasInteger32Value()) {
- return other_constant->HasInteger32Value() &&
- int32_value_ == other_constant->int32_value_;
- } else if (HasDoubleValue()) {
- return other_constant->HasDoubleValue() &&
+ if (has_int32_value_) {
+ return other_constant->has_int32_value_ &&
+ int32_value_ == other_constant->int32_value_;
+ } else if (has_double_value_) {
+ return other_constant->has_double_value_ &&
bit_cast<int64_t>(double_value_) ==
bit_cast<int64_t>(other_constant->double_value_);
- } else if (HasExternalReferenceValue()) {
- return other_constant->HasExternalReferenceValue() &&
- external_reference_value_ ==
- other_constant->external_reference_value_;
+ } else if (has_external_reference_value_) {
+ return other_constant->has_external_reference_value_ &&
+ external_reference_value_ ==
+ other_constant->external_reference_value_;
} else {
- if (other_constant->HasInteger32Value() ||
- other_constant->HasDoubleValue() ||
- other_constant->HasExternalReferenceValue()) {
+ if (other_constant->has_int32_value_ ||
+ other_constant->has_double_value_ ||
+ other_constant->has_external_reference_value_) {
return false;
}
DCHECK(!object_.handle().is_null());
@@ -3776,25 +3735,6 @@
virtual bool IsDeletable() const OVERRIDE { return true; }
- // If object_ is a map, this indicates whether the map is stable.
- class HasStableMapValueField : public BitField<bool, 0, 1> {};
-
- // We store the HConstant in the most specific form safely possible.
- // These flags tell us if the respective member fields hold valid, safe
- // representations of the constant. More specific flags imply more general
- // flags, but not the converse (i.e. smi => int32 => double).
- class HasSmiValueField : public BitField<bool, 1, 1> {};
- class HasInt32ValueField : public BitField<bool, 2, 1> {};
- class HasDoubleValueField : public BitField<bool, 3, 1> {};
-
- class HasExternalReferenceValueField : public BitField<bool, 4, 1> {};
- class IsNotInNewSpaceField : public BitField<bool, 5, 1> {};
- class BooleanValueField : public BitField<bool, 6, 1> {};
- class IsUndetectableField : public BitField<bool, 7, 1> {};
-
- static const InstanceType kUnknownInstanceType = FILLER_TYPE;
- class InstanceTypeField : public BitField<InstanceType, 8, 8> {};
-
// If this is a numerical constant, object_ either points to the
// HeapObject the constant originated from or is null. If the
// constant is non-numeric, object_ always points to a valid
@@ -3804,11 +3744,27 @@
// If object_ is a heap object, this points to the stable map of the object.
Unique<Map> object_map_;
- uint32_t bit_field_;
+ // If object_ is a map, this indicates whether the map is stable.
+ bool has_stable_map_value_ : 1;
+ // We store the HConstant in the most specific form safely possible.
+ // The two flags, has_int32_value_ and has_double_value_ tell us if
+ // int32_value_ and double_value_ hold valid, safe representations
+ // of the constant. has_int32_value_ implies has_double_value_ but
+ // not the converse.
+ bool has_smi_value_ : 1;
+ bool has_int32_value_ : 1;
+ bool has_double_value_ : 1;
+ bool has_external_reference_value_ : 1;
+ bool is_not_in_new_space_ : 1;
+ bool boolean_value_ : 1;
+ bool is_undetectable_: 1;
int32_t int32_value_;
double double_value_;
ExternalReference external_reference_value_;
+
+ static const InstanceType kUnknownInstanceType = FILLER_TYPE;
+ InstanceType instance_type_;
};
@@ -5356,12 +5312,6 @@
return Representation::None();
}
- virtual Representation KnownOptimalRepresentation() OVERRIDE {
- // If a parameter is an input to a phi, that phi should not
- // choose any more optimistic representation than Tagged.
- return Representation::Tagged();
- }
-
DECLARE_CONCRETE_INSTRUCTION(Parameter)
private:
@@ -6789,8 +6739,8 @@
kStartIsDehoisted = kStartBaseOffset + kBitsForBaseOffset
};
- STATIC_ASSERT((kBitsForElementsKind + kBitsForHoleMode + kBitsForBaseOffset +
- kBitsForIsDehoisted) <= sizeof(uint32_t) * 8);
+ STATIC_ASSERT((kBitsForElementsKind + kBitsForBaseOffset +
+ kBitsForIsDehoisted) <= sizeof(uint32_t)*8);
STATIC_ASSERT(kElementsKindCount <= (1 << kBitsForElementsKind));
class ElementsKindField:
public BitField<ElementsKind, kStartElementsKind, kBitsForElementsKind>
@@ -6895,8 +6845,7 @@
} else if (field_representation().IsDouble()) {
return field_representation();
} else if (field_representation().IsSmi()) {
- if (SmiValuesAre32Bits() &&
- store_mode() == STORE_TO_INITIALIZED_ENTRY) {
+ if (SmiValuesAre32Bits() && store_mode_ == STORE_TO_INITIALIZED_ENTRY) {
return Representation::Integer32();
}
return field_representation();
@@ -6921,10 +6870,8 @@
HObjectAccess access() const { return access_; }
HValue* dominator() const { return dominator_; }
- bool has_transition() const { return HasTransitionField::decode(bit_field_); }
- StoreFieldOrKeyedMode store_mode() const {
- return StoreModeField::decode(bit_field_);
- }
+ bool has_transition() const { return has_transition_; }
+ StoreFieldOrKeyedMode store_mode() const { return store_mode_; }
Handle<Map> transition_map() const {
if (has_transition()) {
@@ -6938,7 +6885,7 @@
void SetTransition(HConstant* transition) {
DCHECK(!has_transition()); // Only set once.
SetOperandAt(2, transition);
- bit_field_ = HasTransitionField::update(bit_field_, true);
+ has_transition_ = true;
SetChangesFlag(kMaps);
}
@@ -6989,12 +6936,14 @@
}
private:
- HStoreNamedField(HValue* obj, HObjectAccess access, HValue* val,
+ HStoreNamedField(HValue* obj,
+ HObjectAccess access,
+ HValue* val,
StoreFieldOrKeyedMode store_mode = INITIALIZING_STORE)
: access_(access),
dominator_(NULL),
- bit_field_(HasTransitionField::encode(false) |
- StoreModeField::encode(store_mode)) {
+ has_transition_(false),
+ store_mode_(store_mode) {
// Stores to a non existing in-object property are allowed only to the
// newly allocated objects (via HAllocate or HInnerAllocatedObject).
DCHECK(!access.IsInobject() || access.existing_inobject_property() ||
@@ -7005,12 +6954,10 @@
access.SetGVNFlags(this, STORE);
}
- class HasTransitionField : public BitField<bool, 0, 1> {};
- class StoreModeField : public BitField<StoreFieldOrKeyedMode, 1, 1> {};
-
HObjectAccess access_;
HValue* dominator_;
- uint32_t bit_field_;
+ bool has_transition_ : 1;
+ StoreFieldOrKeyedMode store_mode_ : 1;
};
@@ -7077,7 +7024,7 @@
}
DCHECK_EQ(index, 2);
- return RequiredValueRepresentation(elements_kind(), store_mode());
+ return RequiredValueRepresentation(elements_kind_, store_mode_);
}
static Representation RequiredValueRepresentation(
@@ -7118,8 +7065,7 @@
if (IsUninitialized()) {
return Representation::None();
}
- Representation r =
- RequiredValueRepresentation(elements_kind(), store_mode());
+ Representation r = RequiredValueRepresentation(elements_kind_, store_mode_);
// For fast object elements kinds, don't assume anything.
if (r.IsTagged()) return Representation::None();
return r;
@@ -7128,26 +7074,22 @@
HValue* elements() const { return OperandAt(0); }
HValue* key() const { return OperandAt(1); }
HValue* value() const { return OperandAt(2); }
- bool value_is_smi() const { return IsFastSmiElementsKind(elements_kind()); }
- StoreFieldOrKeyedMode store_mode() const {
- return StoreModeField::decode(bit_field_);
+ bool value_is_smi() const {
+ return IsFastSmiElementsKind(elements_kind_);
}
- ElementsKind elements_kind() const OVERRIDE {
- return ElementsKindField::decode(bit_field_);
- }
+ StoreFieldOrKeyedMode store_mode() const { return store_mode_; }
+ ElementsKind elements_kind() const OVERRIDE { return elements_kind_; }
uint32_t base_offset() const { return base_offset_; }
bool TryIncreaseBaseOffset(uint32_t increase_by_value) OVERRIDE;
HValue* GetKey() OVERRIDE { return key(); }
void SetKey(HValue* key) OVERRIDE { SetOperandAt(1, key); }
- bool IsDehoisted() const OVERRIDE {
- return IsDehoistedField::decode(bit_field_);
- }
+ bool IsDehoisted() const OVERRIDE { return is_dehoisted_; }
void SetDehoisted(bool is_dehoisted) OVERRIDE {
- bit_field_ = IsDehoistedField::update(bit_field_, is_dehoisted);
+ is_dehoisted_ = is_dehoisted;
}
- bool IsUninitialized() { return IsUninitializedField::decode(bit_field_); }
+ bool IsUninitialized() { return is_uninitialized_; }
void SetUninitialized(bool is_uninitialized) {
- bit_field_ = IsUninitializedField::update(bit_field_, is_uninitialized);
+ is_uninitialized_ = is_uninitialized;
}
bool IsConstantHoleStore() {
@@ -7183,17 +7125,18 @@
DECLARE_CONCRETE_INSTRUCTION(StoreKeyed)
private:
- HStoreKeyed(HValue* obj, HValue* key, HValue* val, ElementsKind elements_kind,
+ HStoreKeyed(HValue* obj, HValue* key, HValue* val,
+ ElementsKind elements_kind,
StoreFieldOrKeyedMode store_mode = INITIALIZING_STORE,
int offset = kDefaultKeyedHeaderOffsetSentinel)
- : base_offset_(offset == kDefaultKeyedHeaderOffsetSentinel
- ? GetDefaultHeaderSizeForElementsKind(elements_kind)
- : offset),
- bit_field_(IsDehoistedField::encode(false) |
- IsUninitializedField::encode(false) |
- StoreModeField::encode(store_mode) |
- ElementsKindField::encode(elements_kind)),
- dominator_(NULL) {
+ : elements_kind_(elements_kind),
+ base_offset_(offset == kDefaultKeyedHeaderOffsetSentinel
+ ? GetDefaultHeaderSizeForElementsKind(elements_kind)
+ : offset),
+ is_dehoisted_(false),
+ is_uninitialized_(false),
+ store_mode_(store_mode),
+ dominator_(NULL) {
SetOperandAt(0, obj);
SetOperandAt(1, key);
SetOperandAt(2, val);
@@ -7225,13 +7168,11 @@
}
}
- class IsDehoistedField : public BitField<bool, 0, 1> {};
- class IsUninitializedField : public BitField<bool, 1, 1> {};
- class StoreModeField : public BitField<StoreFieldOrKeyedMode, 2, 1> {};
- class ElementsKindField : public BitField<ElementsKind, 3, 5> {};
-
+ ElementsKind elements_kind_;
uint32_t base_offset_;
- uint32_t bit_field_;
+ bool is_dehoisted_ : 1;
+ bool is_uninitialized_ : 1;
+ StoreFieldOrKeyedMode store_mode_: 1;
HValue* dominator_;
};
@@ -7555,25 +7496,23 @@
DECLARE_CONCRETE_INSTRUCTION(FunctionLiteral)
Handle<SharedFunctionInfo> shared_info() const { return shared_info_; }
- bool pretenure() const { return PretenureField::decode(bit_field_); }
- bool has_no_literals() const {
- return HasNoLiteralsField::decode(bit_field_);
- }
- bool is_arrow() const { return IsArrowFunction(kind()); }
- bool is_generator() const { return IsGeneratorFunction(kind()); }
- bool is_concise_method() const { return IsConciseMethod(kind()); }
- FunctionKind kind() const { return FunctionKindField::decode(bit_field_); }
- StrictMode strict_mode() const { return StrictModeField::decode(bit_field_); }
+ bool pretenure() const { return pretenure_; }
+ bool has_no_literals() const { return has_no_literals_; }
+ bool is_arrow() const { return IsArrowFunction(kind_); }
+ bool is_generator() const { return IsGeneratorFunction(kind_); }
+ bool is_concise_method() const { return IsConciseMethod(kind_); }
+ FunctionKind kind() const { return kind_; }
+ StrictMode strict_mode() const { return strict_mode_; }
private:
HFunctionLiteral(HValue* context, Handle<SharedFunctionInfo> shared,
bool pretenure)
: HTemplateInstruction<1>(HType::JSObject()),
shared_info_(shared),
- bit_field_(FunctionKindField::encode(shared->kind()) |
- PretenureField::encode(pretenure) |
- HasNoLiteralsField::encode(shared->num_literals() == 0) |
- StrictModeField::encode(shared->strict_mode())) {
+ kind_(shared->kind()),
+ pretenure_(pretenure),
+ has_no_literals_(shared->num_literals() == 0),
+ strict_mode_(shared->strict_mode()) {
SetOperandAt(0, context);
set_representation(Representation::Tagged());
SetChangesFlag(kNewSpacePromotion);
@@ -7581,13 +7520,11 @@
virtual bool IsDeletable() const OVERRIDE { return true; }
- class FunctionKindField : public BitField<FunctionKind, 0, 3> {};
- class PretenureField : public BitField<bool, 3, 1> {};
- class HasNoLiteralsField : public BitField<bool, 4, 1> {};
- class StrictModeField : public BitField<StrictMode, 5, 1> {};
-
Handle<SharedFunctionInfo> shared_info_;
- uint32_t bit_field_;
+ FunctionKind kind_;
+ bool pretenure_ : 1;
+ bool has_no_literals_ : 1;
+ StrictMode strict_mode_;
};
diff --git a/src/hydrogen.cc b/src/hydrogen.cc
index 6184bb9..31fcd4c 100644
--- a/src/hydrogen.cc
+++ b/src/hydrogen.cc
@@ -6114,7 +6114,7 @@
if (IsAccessor()) return true;
Handle<Map> map = this->map();
- map->LookupTransition(NULL, *name_, NONE, &lookup_);
+ map->LookupTransition(NULL, *name_, &lookup_);
if (lookup_.IsTransitionToField() && map->unused_property_fields() > 0) {
// Construct the object field access.
int descriptor = transition()->LastAdded();
diff --git a/src/object-observe.js b/src/object-observe.js
index 01ce805..3af2d51 100644
--- a/src/object-observe.js
+++ b/src/object-observe.js
@@ -567,11 +567,12 @@
if (!IS_NULL(pendingObservers))
delete pendingObservers[priority];
- // TODO: combine the following runtime calls for perf optimization.
var delivered = [];
%MoveArrayContents(callbackInfo, delivered);
- %DeliverObservationChangeRecords(callback, delivered);
+ try {
+ %_CallFunction(UNDEFINED, delivered, callback);
+ } catch (ex) {} // TODO(rossberg): perhaps log uncaught exceptions.
return true;
}
diff --git a/src/objects-debug.cc b/src/objects-debug.cc
index ca649c7..353cfda 100644
--- a/src/objects-debug.cc
+++ b/src/objects-debug.cc
@@ -1164,13 +1164,15 @@
for (int i = 0; i < number_of_descriptors(); i++) {
Name* key = GetSortedKey(i);
if (key == current_key) {
- Print();
+ OFStream os(stdout);
+ PrintDescriptors(os);
return false;
}
current_key = key;
uint32_t hash = GetSortedKey(i)->Hash();
if (hash < current) {
- Print();
+ OFStream os(stdout);
+ PrintDescriptors(os);
return false;
}
current = hash;
@@ -1181,36 +1183,23 @@
bool TransitionArray::IsSortedNoDuplicates(int valid_entries) {
DCHECK(valid_entries == -1);
- Name* prev_key = NULL;
- bool prev_is_data_property = false;
- PropertyAttributes prev_attributes = NONE;
- uint32_t prev_hash = 0;
+ Name* current_key = NULL;
+ uint32_t current = 0;
for (int i = 0; i < number_of_transitions(); i++) {
Name* key = GetSortedKey(i);
- uint32_t hash = key->Hash();
- bool is_data_property = false;
- PropertyAttributes attributes = NONE;
- if (!IsSpecialTransition(key)) {
- Map* target = GetTarget(i);
- PropertyDetails details = GetTargetDetails(key, target);
- is_data_property = details.type() == FIELD || details.type() == CONSTANT;
- attributes = details.attributes();
- } else {
- // Duplicate entries are not allowed for non-property transitions.
- CHECK_NE(prev_key, key);
- }
-
- int cmp =
- CompareKeys(prev_key, prev_hash, prev_is_data_property, prev_attributes,
- key, hash, is_data_property, attributes);
- if (cmp >= 0) {
- Print();
+ if (key == current_key) {
+ OFStream os(stdout);
+ PrintTransitions(os);
return false;
}
- prev_key = key;
- prev_hash = hash;
- prev_attributes = attributes;
- prev_is_data_property = is_data_property;
+ current_key = key;
+ uint32_t hash = GetSortedKey(i)->Hash();
+ if (hash < current) {
+ OFStream os(stdout);
+ PrintTransitions(os);
+ return false;
+ }
+ current = hash;
}
return true;
}
diff --git a/src/objects-inl.h b/src/objects-inl.h
index 85584c4..6d0f8d4 100644
--- a/src/objects-inl.h
+++ b/src/objects-inl.h
@@ -1884,10 +1884,11 @@
DisallowHeapAllocation no_allocation;
if (!map->HasTransitionArray()) return Handle<Map>::null();
TransitionArray* transitions = map->transitions();
- int transition = transitions->Search(FIELD, *key, NONE);
+ int transition = transitions->Search(*key);
if (transition == TransitionArray::kNotFound) return Handle<Map>::null();
- DCHECK_EQ(FIELD, transitions->GetTargetDetails(transition).type());
- DCHECK_EQ(NONE, transitions->GetTargetDetails(transition).attributes());
+ PropertyDetails target_details = transitions->GetTargetDetails(transition);
+ if (target_details.type() != FIELD) return Handle<Map>::null();
+ if (target_details.attributes() != NONE) return Handle<Map>::null();
return Handle<Map>(transitions->GetTarget(transition));
}
@@ -2942,10 +2943,10 @@
}
-void Map::LookupTransition(JSObject* holder, Name* name,
- PropertyAttributes attributes,
+void Map::LookupTransition(JSObject* holder,
+ Name* name,
LookupResult* result) {
- int transition_index = this->SearchTransition(FIELD, name, attributes);
+ int transition_index = this->SearchTransition(name);
if (transition_index == TransitionArray::kNotFound) return result->NotFound();
result->TransitionResult(holder, this->GetTransition(transition_index));
}
@@ -4330,10 +4331,8 @@
}
if (instance_type == ONE_BYTE_STRING_TYPE ||
instance_type == ONE_BYTE_INTERNALIZED_STRING_TYPE) {
- // Strings may get concurrently truncated, hence we have to access its
- // length synchronized.
return SeqOneByteString::SizeFor(
- reinterpret_cast<SeqOneByteString*>(this)->synchronized_length());
+ reinterpret_cast<SeqOneByteString*>(this)->length());
}
if (instance_type == BYTE_ARRAY_TYPE) {
return reinterpret_cast<ByteArray*>(this)->ByteArraySize();
@@ -4343,10 +4342,8 @@
}
if (instance_type == STRING_TYPE ||
instance_type == INTERNALIZED_STRING_TYPE) {
- // Strings may get concurrently truncated, hence we have to access its
- // length synchronized.
return SeqTwoByteString::SizeFor(
- reinterpret_cast<SeqTwoByteString*>(this)->synchronized_length());
+ reinterpret_cast<SeqTwoByteString*>(this)->length());
}
if (instance_type == FIXED_DOUBLE_ARRAY_TYPE) {
return FixedDoubleArray::SizeFor(
@@ -5220,8 +5217,7 @@
Map* Map::elements_transition_map() {
- int index =
- transitions()->SearchSpecial(GetHeap()->elements_transition_symbol());
+ int index = transitions()->Search(GetHeap()->elements_transition_symbol());
return transitions()->GetTarget(index);
}
@@ -5238,19 +5234,8 @@
}
-int Map::SearchSpecialTransition(Symbol* name) {
- if (HasTransitionArray()) {
- return transitions()->SearchSpecial(name);
- }
- return TransitionArray::kNotFound;
-}
-
-
-int Map::SearchTransition(PropertyType type, Name* name,
- PropertyAttributes attributes) {
- if (HasTransitionArray()) {
- return transitions()->Search(type, name, attributes);
- }
+int Map::SearchTransition(Name* name) {
+ if (HasTransitionArray()) return transitions()->Search(name);
return TransitionArray::kNotFound;
}
@@ -5303,17 +5288,9 @@
Map* target = transitions()->GetTarget(i);
if (target->instance_descriptors() == instance_descriptors()) {
Name* key = transitions()->GetKey(i);
- int new_target_index;
- if (TransitionArray::IsSpecialTransition(key)) {
- new_target_index = transition_array->SearchSpecial(Symbol::cast(key));
- } else {
- PropertyDetails details =
- TransitionArray::GetTargetDetails(key, target);
- new_target_index = transition_array->Search(details.type(), key,
- details.attributes());
- }
- DCHECK_NE(TransitionArray::kNotFound, new_target_index);
- DCHECK_EQ(target, transition_array->GetTarget(new_target_index));
+ int new_target_index = transition_array->Search(key);
+ DCHECK(new_target_index != TransitionArray::kNotFound);
+ DCHECK(transition_array->GetTarget(new_target_index) == target);
}
}
#endif
diff --git a/src/objects-printer.cc b/src/objects-printer.cc
index ba05b47..cce2b8b 100644
--- a/src/objects-printer.cc
+++ b/src/objects-printer.cc
@@ -1090,19 +1090,18 @@
}
for (int i = 0; i < number_of_transitions(); i++) {
Name* key = GetKey(i);
- Map* target = GetTarget(i);
os << " ";
key->NamePrint(os);
os << ": ";
if (key == GetHeap()->frozen_symbol()) {
os << " (transition to frozen)";
} else if (key == GetHeap()->elements_transition_symbol()) {
- os << " (transition to " << ElementsKindToString(target->elements_kind())
- << ")";
+ os << " (transition to "
+ << ElementsKindToString(GetTarget(i)->elements_kind()) << ")";
} else if (key == GetHeap()->observed_symbol()) {
os << " (transition to Object.observe)";
} else {
- PropertyDetails details = GetTargetDetails(key, target);
+ PropertyDetails details = GetTargetDetails(i);
switch (details.type()) {
case FIELD: {
os << " (transition to field)";
@@ -1121,7 +1120,7 @@
}
os << ", attrs: " << details.attributes();
}
- os << " -> " << Brief(target) << "\n";
+ os << " -> " << Brief(GetTarget(i)) << "\n";
}
}
diff --git a/src/objects.cc b/src/objects.cc
index 258390c..9933e9c 100644
--- a/src/objects.cc
+++ b/src/objects.cc
@@ -542,8 +542,9 @@
Debug* debug = isolate->debug();
// Handle stepping into a getter if step into is active.
// TODO(rossberg): should this apply to getters that are function proxies?
- if (debug->is_active()) {
- debug->HandleStepIn(getter, Handle<Object>::null(), 0, false);
+ if (debug->StepInActive() && getter->IsJSFunction()) {
+ debug->HandleStepIn(
+ Handle<JSFunction>::cast(getter), Handle<Object>::null(), 0, false);
}
return Execution::Call(isolate, getter, receiver, 0, NULL, true);
@@ -559,8 +560,9 @@
Debug* debug = isolate->debug();
// Handle stepping into a setter if step into is active.
// TODO(rossberg): should this apply to getters that are function proxies?
- if (debug->is_active()) {
- debug->HandleStepIn(setter, Handle<Object>::null(), 0, false);
+ if (debug->StepInActive() && setter->IsJSFunction()) {
+ debug->HandleStepIn(
+ Handle<JSFunction>::cast(setter), Handle<Object>::null(), 0, false);
}
Handle<Object> argv[] = { value };
@@ -1932,7 +1934,7 @@
void Map::ConnectElementsTransition(Handle<Map> parent, Handle<Map> child) {
Isolate* isolate = parent->GetIsolate();
Handle<Name> name = isolate->factory()->elements_transition_symbol();
- ConnectTransition(parent, child, name, SPECIAL_TRANSITION);
+ ConnectTransition(parent, child, name, FULL_TRANSITION);
}
@@ -2226,12 +2228,10 @@
// Invalidates a transition target at |key|, and installs |new_descriptors| over
// the current instance_descriptors to ensure proper sharing of descriptor
// arrays.
-void Map::DeprecateTarget(PropertyType type, Name* key,
- PropertyAttributes attributes,
- DescriptorArray* new_descriptors) {
+void Map::DeprecateTarget(Name* key, DescriptorArray* new_descriptors) {
if (HasTransitionArray()) {
TransitionArray* transitions = this->transitions();
- int transition = transitions->Search(type, key, attributes);
+ int transition = transitions->Search(key);
if (transition != TransitionArray::kNotFound) {
transitions->GetTarget(transition)->DeprecateTransitionTree();
}
@@ -2278,15 +2278,14 @@
for (int i = verbatim; i < length; i++) {
if (!current->HasTransitionArray()) break;
Name* name = descriptors->GetKey(i);
- PropertyDetails details = descriptors->GetDetails(i);
TransitionArray* transitions = current->transitions();
- int transition =
- transitions->Search(details.type(), name, details.attributes());
+ int transition = transitions->Search(name);
if (transition == TransitionArray::kNotFound) break;
Map* next = transitions->GetTarget(transition);
DescriptorArray* next_descriptors = next->instance_descriptors();
+ PropertyDetails details = descriptors->GetDetails(i);
PropertyDetails next_details = next_descriptors->GetDetails(i);
if (details.type() != next_details.type()) break;
if (details.attributes() != next_details.attributes()) break;
@@ -2476,23 +2475,21 @@
Handle<Map> target_map = root_map;
for (int i = root_nof; i < old_nof; ++i) {
- PropertyDetails old_details = old_descriptors->GetDetails(i);
- int j = target_map->SearchTransition(old_details.type(),
- old_descriptors->GetKey(i),
- old_details.attributes());
+ int j = target_map->SearchTransition(old_descriptors->GetKey(i));
if (j == TransitionArray::kNotFound) break;
Handle<Map> tmp_map(target_map->GetTransition(j), isolate);
Handle<DescriptorArray> tmp_descriptors = handle(
tmp_map->instance_descriptors(), isolate);
// Check if target map is incompatible.
+ PropertyDetails old_details = old_descriptors->GetDetails(i);
PropertyDetails tmp_details = tmp_descriptors->GetDetails(i);
PropertyType old_type = old_details.type();
PropertyType tmp_type = tmp_details.type();
- DCHECK_EQ(old_details.attributes(), tmp_details.attributes());
- if ((tmp_type == CALLBACKS || old_type == CALLBACKS) &&
- (tmp_type != old_type ||
- tmp_descriptors->GetValue(i) != old_descriptors->GetValue(i))) {
+ if (tmp_details.attributes() != old_details.attributes() ||
+ ((tmp_type == CALLBACKS || old_type == CALLBACKS) &&
+ (tmp_type != old_type ||
+ tmp_descriptors->GetValue(i) != old_descriptors->GetValue(i)))) {
return CopyGeneralizeAllRepresentations(
old_map, modify_index, store_mode, "incompatible");
}
@@ -2544,21 +2541,19 @@
// Find the last compatible target map in the transition tree.
for (int i = target_nof; i < old_nof; ++i) {
- PropertyDetails old_details = old_descriptors->GetDetails(i);
- int j = target_map->SearchTransition(old_details.type(),
- old_descriptors->GetKey(i),
- old_details.attributes());
+ int j = target_map->SearchTransition(old_descriptors->GetKey(i));
if (j == TransitionArray::kNotFound) break;
Handle<Map> tmp_map(target_map->GetTransition(j), isolate);
Handle<DescriptorArray> tmp_descriptors(
tmp_map->instance_descriptors(), isolate);
// Check if target map is compatible.
+ PropertyDetails old_details = old_descriptors->GetDetails(i);
PropertyDetails tmp_details = tmp_descriptors->GetDetails(i);
- DCHECK_EQ(old_details.attributes(), tmp_details.attributes());
- if ((tmp_details.type() == CALLBACKS || old_details.type() == CALLBACKS) &&
- (tmp_details.type() != old_details.type() ||
- tmp_descriptors->GetValue(i) != old_descriptors->GetValue(i))) {
+ if (tmp_details.attributes() != old_details.attributes() ||
+ ((tmp_details.type() == CALLBACKS || old_details.type() == CALLBACKS) &&
+ (tmp_details.type() != old_details.type() ||
+ tmp_descriptors->GetValue(i) != old_descriptors->GetValue(i)))) {
return CopyGeneralizeAllRepresentations(
old_map, modify_index, store_mode, "incompatible");
}
@@ -2690,10 +2685,8 @@
int split_nof = split_map->NumberOfOwnDescriptors();
DCHECK_NE(old_nof, split_nof);
- PropertyDetails split_prop_details = old_descriptors->GetDetails(split_nof);
- split_map->DeprecateTarget(split_prop_details.type(),
- old_descriptors->GetKey(split_nof),
- split_prop_details.attributes(), *new_descriptors);
+ split_map->DeprecateTarget(
+ old_descriptors->GetKey(split_nof), *new_descriptors);
if (FLAG_trace_generalization) {
PropertyDetails old_details = old_descriptors->GetDetails(modify_index);
@@ -2782,15 +2775,13 @@
Map* new_map = root_map;
for (int i = root_nof; i < old_nof; ++i) {
- PropertyDetails old_details = old_descriptors->GetDetails(i);
- int j = new_map->SearchTransition(old_details.type(),
- old_descriptors->GetKey(i),
- old_details.attributes());
+ int j = new_map->SearchTransition(old_descriptors->GetKey(i));
if (j == TransitionArray::kNotFound) return MaybeHandle<Map>();
new_map = new_map->GetTransition(j);
DescriptorArray* new_descriptors = new_map->instance_descriptors();
PropertyDetails new_details = new_descriptors->GetDetails(i);
+ PropertyDetails old_details = old_descriptors->GetDetails(i);
if (old_details.attributes() != new_details.attributes() ||
!old_details.representation().fits_into(new_details.representation())) {
return MaybeHandle<Map>();
@@ -5389,8 +5380,8 @@
}
Handle<Map> old_map(object->map(), isolate);
- int transition_index =
- old_map->SearchSpecialTransition(isolate->heap()->frozen_symbol());
+ int transition_index = old_map->SearchTransition(
+ isolate->heap()->frozen_symbol());
if (transition_index != TransitionArray::kNotFound) {
Handle<Map> transition_map(old_map->GetTransition(transition_index));
DCHECK(transition_map->has_dictionary_elements());
@@ -5442,8 +5433,8 @@
Handle<Map> new_map;
Handle<Map> old_map(object->map(), isolate);
DCHECK(!old_map->is_observed());
- int transition_index =
- old_map->SearchSpecialTransition(isolate->heap()->observed_symbol());
+ int transition_index = old_map->SearchTransition(
+ isolate->heap()->observed_symbol());
if (transition_index != TransitionArray::kNotFound) {
new_map = handle(old_map->GetTransition(transition_index), isolate);
DCHECK(new_map->is_observed());
@@ -6610,7 +6601,7 @@
}
DCHECK(result->NumberOfOwnDescriptors() == map->NumberOfOwnDescriptors() + 1);
- ConnectTransition(map, result, name, SIMPLE_PROPERTY_TRANSITION);
+ ConnectTransition(map, result, name, SIMPLE_TRANSITION);
return result;
}
@@ -6686,7 +6677,7 @@
result->set_unused_property_fields(unused_property_fields);
Handle<Name> name = handle(descriptors->GetKey(new_descriptor));
- ConnectTransition(map, result, name, SIMPLE_PROPERTY_TRANSITION);
+ ConnectTransition(map, result, name, SIMPLE_TRANSITION);
return result;
}
@@ -6760,7 +6751,7 @@
if (map->CanHaveMoreTransitions()) {
Handle<Name> name = isolate->factory()->observed_symbol();
- ConnectTransition(map, new_map, name, SPECIAL_TRANSITION);
+ ConnectTransition(map, new_map, name, FULL_TRANSITION);
}
return new_map;
}
@@ -6771,8 +6762,8 @@
int number_of_own_descriptors = map->NumberOfOwnDescriptors();
Handle<DescriptorArray> new_descriptors =
DescriptorArray::CopyUpTo(descriptors, number_of_own_descriptors);
- return CopyReplaceDescriptors(map, new_descriptors, OMIT_TRANSITION,
- MaybeHandle<Name>(), SPECIAL_TRANSITION);
+ return CopyReplaceDescriptors(
+ map, new_descriptors, OMIT_TRANSITION, MaybeHandle<Name>());
}
@@ -6807,8 +6798,7 @@
Handle<DescriptorArray> new_desc = DescriptorArray::CopyUpToAddAttributes(
handle(map->instance_descriptors(), isolate), num_descriptors, FROZEN);
Handle<Map> new_map = CopyReplaceDescriptors(
- map, new_desc, INSERT_TRANSITION, isolate->factory()->frozen_symbol(),
- SPECIAL_TRANSITION);
+ map, new_desc, INSERT_TRANSITION, isolate->factory()->frozen_symbol());
new_map->freeze();
new_map->set_is_extensible(false);
new_map->set_elements_kind(DICTIONARY_ELEMENTS);
@@ -6872,14 +6862,16 @@
// Migrate to the newest map before storing the property.
map = Update(map);
- int index = map->SearchTransition(FIELD, *name, attributes);
+ int index = map->SearchTransition(*name);
if (index != TransitionArray::kNotFound) {
Handle<Map> transition(map->GetTransition(index));
int descriptor = transition->LastAdded();
- DCHECK_EQ(attributes, transition->instance_descriptors()
- ->GetDetails(descriptor)
- .attributes());
+ // TODO(verwaest): Handle attributes better.
+ DescriptorArray* descriptors = transition->instance_descriptors();
+ if (descriptors->GetDetails(descriptor).attributes() != attributes) {
+ return Map::Normalize(map, CLEAR_INOBJECT_PROPERTIES);
+ }
return Map::PrepareForDataProperty(transition, descriptor, value);
}
@@ -6939,15 +6931,25 @@
? KEEP_INOBJECT_PROPERTIES
: CLEAR_INOBJECT_PROPERTIES;
- int index = map->SearchTransition(CALLBACKS, *name, attributes);
+ int index = map->SearchTransition(*name);
if (index != TransitionArray::kNotFound) {
Handle<Map> transition(map->GetTransition(index));
DescriptorArray* descriptors = transition->instance_descriptors();
+ // Fast path, assume that we're modifying the last added descriptor.
int descriptor = transition->LastAdded();
- DCHECK(descriptors->GetKey(descriptor)->Equals(*name));
+ if (descriptors->GetKey(descriptor) != *name) {
+ // If not, search for the descriptor.
+ descriptor = descriptors->SearchWithCache(*name, *transition);
+ }
- DCHECK_EQ(CALLBACKS, descriptors->GetDetails(descriptor).type());
- DCHECK_EQ(attributes, descriptors->GetDetails(descriptor).attributes());
+ if (descriptors->GetDetails(descriptor).type() != CALLBACKS) {
+ return Map::Normalize(map, mode);
+ }
+
+ // TODO(verwaest): Handle attributes better.
+ if (descriptors->GetDetails(descriptor).attributes() != attributes) {
+ return Map::Normalize(map, mode);
+ }
Handle<Object> maybe_pair(descriptors->GetValue(descriptor), isolate);
if (!maybe_pair->IsAccessorPair()) {
@@ -6966,9 +6968,6 @@
DescriptorArray* old_descriptors = map->instance_descriptors();
int descriptor = old_descriptors->SearchWithCache(*name, *map);
if (descriptor != DescriptorArray::kNotFound) {
- if (descriptor != map->LastAdded()) {
- return Map::Normalize(map, mode);
- }
PropertyDetails old_details = old_descriptors->GetDetails(descriptor);
if (old_details.type() != CALLBACKS) {
return Map::Normalize(map, mode);
@@ -7023,9 +7022,8 @@
descriptors, map->NumberOfOwnDescriptors(), 1);
new_descriptors->Append(descriptor);
- return CopyReplaceDescriptors(map, new_descriptors, flag,
- descriptor->GetKey(),
- SIMPLE_PROPERTY_TRANSITION);
+ return CopyReplaceDescriptors(
+ map, new_descriptors, flag, descriptor->GetKey(), SIMPLE_TRANSITION);
}
@@ -7119,8 +7117,8 @@
SimpleTransitionFlag simple_flag =
(insertion_index == descriptors->number_of_descriptors() - 1)
- ? SIMPLE_PROPERTY_TRANSITION
- : PROPERTY_TRANSITION;
+ ? SIMPLE_TRANSITION
+ : FULL_TRANSITION;
return CopyReplaceDescriptors(map, new_descriptors, flag, key, simple_flag);
}
diff --git a/src/objects.h b/src/objects.h
index 9333e9e..d12896f 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -280,9 +280,8 @@
// either extends the current map with a new property, or it modifies the
// property that was added last to the current map.
enum SimpleTransitionFlag {
- SIMPLE_PROPERTY_TRANSITION,
- PROPERTY_TRANSITION,
- SPECIAL_TRANSITION
+ SIMPLE_TRANSITION,
+ FULL_TRANSITION
};
@@ -5821,9 +5820,7 @@
inline Map* elements_transition_map();
inline Map* GetTransition(int transition_index);
- inline int SearchSpecialTransition(Symbol* name);
- inline int SearchTransition(PropertyType type, Name* name,
- PropertyAttributes attributes);
+ inline int SearchTransition(Name* name);
inline FixedArrayBase* GetInitialElements();
DECL_ACCESSORS(transitions, TransitionArray)
@@ -5961,8 +5958,8 @@
Name* name,
LookupResult* result);
- inline void LookupTransition(JSObject* holder, Name* name,
- PropertyAttributes attributes,
+ inline void LookupTransition(JSObject* holder,
+ Name* name,
LookupResult* result);
inline PropertyDetails GetLastDescriptorDetails();
@@ -6332,11 +6329,12 @@
static Handle<Map> CopyAddDescriptor(Handle<Map> map,
Descriptor* descriptor,
TransitionFlag flag);
- static Handle<Map> CopyReplaceDescriptors(Handle<Map> map,
- Handle<DescriptorArray> descriptors,
- TransitionFlag flag,
- MaybeHandle<Name> maybe_name,
- SimpleTransitionFlag simple_flag);
+ static Handle<Map> CopyReplaceDescriptors(
+ Handle<Map> map,
+ Handle<DescriptorArray> descriptors,
+ TransitionFlag flag,
+ MaybeHandle<Name> maybe_name,
+ SimpleTransitionFlag simple_flag = FULL_TRANSITION);
static Handle<Map> CopyReplaceDescriptor(Handle<Map> map,
Handle<DescriptorArray> descriptors,
Descriptor* descriptor,
@@ -6364,9 +6362,7 @@
void ZapTransitions();
void DeprecateTransitionTree();
- void DeprecateTarget(PropertyType type, Name* key,
- PropertyAttributes attributes,
- DescriptorArray* new_descriptors);
+ void DeprecateTarget(Name* key, DescriptorArray* new_descriptors);
Map* FindLastMatchMap(int verbatim, int length, DescriptorArray* descriptors);
diff --git a/src/profile-generator-inl.h b/src/profile-generator-inl.h
index b638857..58c124f 100644
--- a/src/profile-generator-inl.h
+++ b/src/profile-generator-inl.h
@@ -10,11 +10,14 @@
namespace v8 {
namespace internal {
-CodeEntry::CodeEntry(Logger::LogEventsAndTags tag, const char* name,
- const char* name_prefix, const char* resource_name,
- int line_number, int column_number)
- : bit_field_(TagField::encode(tag) |
- BuiltinIdField::encode(Builtins::builtin_count)),
+CodeEntry::CodeEntry(Logger::LogEventsAndTags tag,
+ const char* name,
+ const char* name_prefix,
+ const char* resource_name,
+ int line_number,
+ int column_number)
+ : tag_(tag),
+ builtin_id_(Builtins::builtin_count),
name_prefix_(name_prefix),
name_(name),
resource_name_(resource_name),
@@ -23,7 +26,7 @@
shared_id_(0),
script_id_(v8::UnboundScript::kNoScriptId),
no_frame_ranges_(NULL),
- bailout_reason_(kEmptyBailoutReason) {}
+ bailout_reason_(kEmptyBailoutReason) { }
bool CodeEntry::is_js_function_tag(Logger::LogEventsAndTags tag) {
diff --git a/src/profile-generator.cc b/src/profile-generator.cc
index 4607156..6017f12 100644
--- a/src/profile-generator.cc
+++ b/src/profile-generator.cc
@@ -143,7 +143,7 @@
uint32_t CodeEntry::GetCallUid() const {
- uint32_t hash = ComputeIntegerHash(tag(), v8::internal::kZeroHashSeed);
+ uint32_t hash = ComputeIntegerHash(tag_, v8::internal::kZeroHashSeed);
if (shared_id_ != 0) {
hash ^= ComputeIntegerHash(static_cast<uint32_t>(shared_id_),
v8::internal::kZeroHashSeed);
@@ -164,18 +164,20 @@
bool CodeEntry::IsSameAs(CodeEntry* entry) const {
- return this == entry ||
- (tag() == entry->tag() && shared_id_ == entry->shared_id_ &&
- (shared_id_ != 0 ||
- (name_prefix_ == entry->name_prefix_ && name_ == entry->name_ &&
- resource_name_ == entry->resource_name_ &&
- line_number_ == entry->line_number_)));
+ return this == entry
+ || (tag_ == entry->tag_
+ && shared_id_ == entry->shared_id_
+ && (shared_id_ != 0
+ || (name_prefix_ == entry->name_prefix_
+ && name_ == entry->name_
+ && resource_name_ == entry->resource_name_
+ && line_number_ == entry->line_number_)));
}
void CodeEntry::SetBuiltinId(Builtins::Name id) {
- bit_field_ = TagField::update(bit_field_, Logger::BUILTIN_TAG);
- bit_field_ = BuiltinIdField::update(bit_field_, id);
+ tag_ = Logger::BUILTIN_TAG;
+ builtin_id_ = id;
}
diff --git a/src/profile-generator.h b/src/profile-generator.h
index f78beb0..5ebb92b 100644
--- a/src/profile-generator.h
+++ b/src/profile-generator.h
@@ -55,7 +55,7 @@
int column_number = v8::CpuProfileNode::kNoColumnNumberInfo);
~CodeEntry();
- bool is_js_function() const { return is_js_function_tag(tag()); }
+ bool is_js_function() const { return is_js_function_tag(tag_); }
const char* name_prefix() const { return name_prefix_; }
bool has_name_prefix() const { return name_prefix_[0] != '\0'; }
const char* name() const { return name_; }
@@ -78,9 +78,7 @@
}
void SetBuiltinId(Builtins::Name id);
- Builtins::Name builtin_id() const {
- return BuiltinIdField::decode(bit_field_);
- }
+ Builtins::Name builtin_id() const { return builtin_id_; }
uint32_t GetCallUid() const;
bool IsSameAs(CodeEntry* entry) const;
@@ -90,11 +88,8 @@
static const char* const kEmptyBailoutReason;
private:
- class TagField : public BitField<Logger::LogEventsAndTags, 0, 8> {};
- class BuiltinIdField : public BitField<Builtins::Name, 8, 8> {};
- Logger::LogEventsAndTags tag() const { return TagField::decode(bit_field_); }
-
- uint32_t bit_field_;
+ Logger::LogEventsAndTags tag_ : 8;
+ Builtins::Name builtin_id_ : 8;
const char* name_prefix_;
const char* name_;
const char* resource_name_;
diff --git a/src/runtime/runtime-array.cc b/src/runtime/runtime-array.cc
index 523d8f5..c3a6d80 100644
--- a/src/runtime/runtime-array.cc
+++ b/src/runtime/runtime-array.cc
@@ -104,19 +104,19 @@
storage_(Handle<FixedArray>::cast(
isolate->global_handles()->Create(*storage))),
index_offset_(0u),
- bit_field_(FastElementsField::encode(fast_elements) |
- ExceedsLimitField::encode(false)) {}
+ fast_elements_(fast_elements),
+ exceeds_array_limit_(false) {}
~ArrayConcatVisitor() { clear_storage(); }
void visit(uint32_t i, Handle<Object> elm) {
if (i > JSObject::kMaxElementCount - index_offset_) {
- set_exceeds_array_limit(true);
+ exceeds_array_limit_ = true;
return;
}
uint32_t index = index_offset_ + i;
- if (fast_elements()) {
+ if (fast_elements_) {
if (index < static_cast<uint32_t>(storage_->length())) {
storage_->set(index, *elm);
return;
@@ -128,7 +128,7 @@
SetDictionaryMode();
// Fall-through to dictionary mode.
}
- DCHECK(!fast_elements());
+ DCHECK(!fast_elements_);
Handle<SeededNumberDictionary> dict(
SeededNumberDictionary::cast(*storage_));
Handle<SeededNumberDictionary> result =
@@ -149,23 +149,21 @@
// If the initial length estimate was off (see special case in visit()),
// but the array blowing the limit didn't contain elements beyond the
// provided-for index range, go to dictionary mode now.
- if (fast_elements() &&
+ if (fast_elements_ &&
index_offset_ >
static_cast<uint32_t>(FixedArrayBase::cast(*storage_)->length())) {
SetDictionaryMode();
}
}
- bool exceeds_array_limit() const {
- return ExceedsLimitField::decode(bit_field_);
- }
+ bool exceeds_array_limit() { return exceeds_array_limit_; }
Handle<JSArray> ToArray() {
Handle<JSArray> array = isolate_->factory()->NewJSArray(0);
Handle<Object> length =
isolate_->factory()->NewNumber(static_cast<double>(index_offset_));
Handle<Map> map = JSObject::GetElementsTransitionMap(
- array, fast_elements() ? FAST_HOLEY_ELEMENTS : DICTIONARY_ELEMENTS);
+ array, fast_elements_ ? FAST_HOLEY_ELEMENTS : DICTIONARY_ELEMENTS);
array->set_map(*map);
array->set_length(*length);
array->set_elements(*storage_);
@@ -175,7 +173,7 @@
private:
// Convert storage to dictionary mode.
void SetDictionaryMode() {
- DCHECK(fast_elements());
+ DCHECK(fast_elements_);
Handle<FixedArray> current_storage(*storage_);
Handle<SeededNumberDictionary> slow_storage(
SeededNumberDictionary::New(isolate_, current_storage->length()));
@@ -193,7 +191,7 @@
}
clear_storage();
set_storage(*slow_storage);
- set_fast_elements(false);
+ fast_elements_ = false;
}
inline void clear_storage() {
@@ -205,23 +203,13 @@
Handle<FixedArray>::cast(isolate_->global_handles()->Create(storage));
}
- class FastElementsField : public BitField<bool, 0, 1> {};
- class ExceedsLimitField : public BitField<bool, 1, 1> {};
-
- bool fast_elements() const { return FastElementsField::decode(bit_field_); }
- void set_fast_elements(bool fast) {
- bit_field_ = FastElementsField::update(bit_field_, fast);
- }
- void set_exceeds_array_limit(bool exceeds) {
- bit_field_ = ExceedsLimitField::update(bit_field_, exceeds);
- }
-
Isolate* isolate_;
Handle<FixedArray> storage_; // Always a global handle.
// Index after last seen index. Always less than or equal to
// JSObject::kMaxElementCount.
uint32_t index_offset_;
- uint32_t bit_field_;
+ bool fast_elements_ : 1;
+ bool exceeds_array_limit_ : 1;
};
diff --git a/src/runtime/runtime-debug.cc b/src/runtime/runtime-debug.cc
index 95ac77b..2de372f 100644
--- a/src/runtime/runtime-debug.cc
+++ b/src/runtime/runtime-debug.cc
@@ -1984,7 +1984,7 @@
StepAction step_action = static_cast<StepAction>(NumberToInt32(args[1]));
if (step_action != StepIn && step_action != StepNext &&
step_action != StepOut && step_action != StepInMin &&
- step_action != StepMin && step_action != StepFrame) {
+ step_action != StepMin) {
return isolate->Throw(isolate->heap()->illegal_argument_string());
}
diff --git a/src/runtime/runtime-observe.cc b/src/runtime/runtime-observe.cc
index 4579136..ab7f250 100644
--- a/src/runtime/runtime-observe.cc
+++ b/src/runtime/runtime-observe.cc
@@ -52,28 +52,6 @@
}
-RUNTIME_FUNCTION(Runtime_DeliverObservationChangeRecords) {
- HandleScope scope(isolate);
- DCHECK(args.length() == 2);
- CONVERT_ARG_HANDLE_CHECKED(JSFunction, callback, 0);
- CONVERT_ARG_HANDLE_CHECKED(Object, argument, 1);
- v8::TryCatch catcher;
- // We should send a message on uncaught exception thrown during
- // Object.observe delivery while not interrupting further delivery, thus
- // we make a call inside a verbose TryCatch.
- catcher.SetVerbose(true);
- Handle<Object> argv[] = {argument};
- USE(Execution::Call(isolate, callback, isolate->factory()->undefined_value(),
- arraysize(argv), argv));
- if (isolate->has_pending_exception()) {
- isolate->ReportPendingMessages();
- isolate->clear_pending_exception();
- isolate->set_external_caught_exception(false);
- }
- return isolate->heap()->undefined_value();
-}
-
-
RUNTIME_FUNCTION(Runtime_GetObservationState) {
SealHandleScope shs(isolate);
DCHECK(args.length() == 0);
diff --git a/src/runtime/runtime.h b/src/runtime/runtime.h
index 5d6ccac..448010a 100644
--- a/src/runtime/runtime.h
+++ b/src/runtime/runtime.h
@@ -350,7 +350,6 @@
F(GetObjectContextObjectObserve, 1, 1) \
F(GetObjectContextObjectGetNotifier, 1, 1) \
F(GetObjectContextNotifierPerformChange, 1, 1) \
- F(DeliverObservationChangeRecords, 2, 1) \
\
/* Harmony typed arrays */ \
F(ArrayBufferInitialize, 2, 1) \
diff --git a/src/scanner.cc b/src/scanner.cc
index e63239d..8062faa 100644
--- a/src/scanner.cc
+++ b/src/scanner.cc
@@ -245,8 +245,6 @@
while (true) {
while (true) {
- // The unicode cache accepts unsigned inputs.
- if (c0_ < 0) break;
// Advance as long as character is a WhiteSpace or LineTerminator.
// Remember if the latter is the case.
if (unicode_cache_->IsLineTerminator(c0_)) {
@@ -367,7 +365,7 @@
while (c0_ >= 0) {
uc32 ch = c0_;
Advance();
- if (c0_ >= 0 && unicode_cache_->IsLineTerminator(ch)) {
+ if (unicode_cache_->IsLineTerminator(ch)) {
// Following ECMA-262, section 7.4, a comment containing
// a newline will make the comment count as a line-terminator.
has_multiline_comment_before_next_ = true;
@@ -627,14 +625,14 @@
break;
default:
- if (c0_ < 0) {
- token = Token::EOS;
- } else if (unicode_cache_->IsIdentifierStart(c0_)) {
+ if (unicode_cache_->IsIdentifierStart(c0_)) {
token = ScanIdentifierOrKeyword();
} else if (IsDecimalDigit(c0_)) {
token = ScanNumber(false);
} else if (SkipWhiteSpace()) {
token = Token::WHITESPACE;
+ } else if (c0_ < 0) {
+ token = Token::EOS;
} else {
token = Select(Token::ILLEGAL);
}
@@ -676,7 +674,7 @@
Advance();
// Skip escaped newlines.
- if (c0_ >= 0 && unicode_cache_->IsLineTerminator(c)) {
+ if (unicode_cache_->IsLineTerminator(c)) {
// Allow CR+LF newlines in multiline string literals.
if (IsCarriageReturn(c) && IsLineFeed(c0_)) Advance();
// Allow LF+CR newlines in multiline string literals.
@@ -873,8 +871,7 @@
// not be an identifier start or a decimal digit; see ECMA-262
// section 7.8.3, page 17 (note that we read only one decimal digit
// if the value is 0).
- if (IsDecimalDigit(c0_) ||
- (c0_ >= 0 && unicode_cache_->IsIdentifierStart(c0_)))
+ if (IsDecimalDigit(c0_) || unicode_cache_->IsIdentifierStart(c0_))
return Token::ILLEGAL;
literal.Complete();
@@ -1042,7 +1039,7 @@
AddLiteralChar(first_char);
// Scan the rest of the identifier characters.
- while (c0_ >= 0 && unicode_cache_->IsIdentifierPart(c0_)) {
+ while (unicode_cache_->IsIdentifierPart(c0_)) {
if (c0_ != '\\') {
uc32 next_char = c0_;
Advance();
@@ -1070,7 +1067,7 @@
Token::Value Scanner::ScanIdentifierSuffix(LiteralScope* literal) {
// Scan the rest of the identifier characters.
- while (c0_ >= 0 && unicode_cache_->IsIdentifierPart(c0_)) {
+ while (unicode_cache_->IsIdentifierPart(c0_)) {
if (c0_ == '\\') {
uc32 c = ScanIdentifierUnicodeEscape();
// Only allow legal identifier part characters.
@@ -1109,10 +1106,10 @@
}
while (c0_ != '/' || in_character_class) {
- if (c0_ < 0 || unicode_cache_->IsLineTerminator(c0_)) return false;
+ if (unicode_cache_->IsLineTerminator(c0_) || c0_ < 0) return false;
if (c0_ == '\\') { // Escape sequence.
AddLiteralCharAdvance();
- if (c0_ < 0 || unicode_cache_->IsLineTerminator(c0_)) return false;
+ if (unicode_cache_->IsLineTerminator(c0_) || c0_ < 0) return false;
AddLiteralCharAdvance();
// If the escape allows more characters, i.e., \x??, \u????, or \c?,
// only "safe" characters are allowed (letters, digits, underscore),
@@ -1159,7 +1156,7 @@
bool Scanner::ScanRegExpFlags() {
// Scan regular expression flags.
LiteralScope literal(this);
- while (c0_ >= 0 && unicode_cache_->IsIdentifierPart(c0_)) {
+ while (unicode_cache_->IsIdentifierPart(c0_)) {
if (c0_ != '\\') {
AddLiteralCharAdvance();
} else {
diff --git a/src/transitions-inl.h b/src/transitions-inl.h
index 8a6d1bb..087755d 100644
--- a/src/transitions-inl.h
+++ b/src/transitions-inl.h
@@ -34,7 +34,7 @@
bool TransitionArray::HasElementsTransition() {
- return SearchSpecial(GetHeap()->elements_transition_symbol()) != kNotFound;
+ return Search(GetHeap()->elements_transition_symbol()) != kNotFound;
}
@@ -140,7 +140,7 @@
}
-int TransitionArray::SearchName(Name* name, int* out_insertion_index) {
+int TransitionArray::Search(Name* name, int* out_insertion_index) {
if (IsSimpleTransition()) {
Name* key = GetKey(kSimpleTransitionIndex);
if (key->Equals(name)) return kSimpleTransitionIndex;
@@ -153,71 +153,6 @@
}
-#ifdef DEBUG
-bool TransitionArray::IsSpecialTransition(Name* name) {
- if (!name->IsSymbol()) return false;
- Heap* heap = name->GetHeap();
- return name == heap->frozen_symbol() ||
- name == heap->elements_transition_symbol() ||
- name == heap->observed_symbol();
-}
-#endif
-
-
-int TransitionArray::CompareKeys(Name* key1, uint32_t hash1,
- bool is_data_property1,
- PropertyAttributes attributes1, Name* key2,
- uint32_t hash2, bool is_data_property2,
- PropertyAttributes attributes2) {
- int cmp = CompareNames(key1, hash1, key2, hash2);
- if (cmp != 0) return cmp;
-
- return CompareDetails(is_data_property1, attributes1, is_data_property2,
- attributes2);
-}
-
-
-int TransitionArray::CompareNames(Name* key1, uint32_t hash1, Name* key2,
- uint32_t hash2) {
- if (key1 != key2) {
- // In case of hash collisions key1 is always "less" than key2.
- return hash1 <= hash2 ? -1 : 1;
- }
-
- return 0;
-}
-
-
-int TransitionArray::CompareDetails(bool is_data_property1,
- PropertyAttributes attributes1,
- bool is_data_property2,
- PropertyAttributes attributes2) {
- if (is_data_property1 != is_data_property2) {
- return static_cast<int>(is_data_property1) <
- static_cast<int>(is_data_property2)
- ? -1
- : 1;
- }
-
- if (attributes1 != attributes2) {
- return static_cast<int>(attributes1) < static_cast<int>(attributes2) ? -1
- : 1;
- }
-
- return 0;
-}
-
-
-PropertyDetails TransitionArray::GetTargetDetails(Name* name, Map* target) {
- DCHECK(!IsSpecialTransition(name));
- int descriptor = target->LastAdded();
- DescriptorArray* descriptors = target->instance_descriptors();
- // Transitions are allowed only for the last added property.
- DCHECK(descriptors->GetKey(descriptor)->Equals(name));
- return descriptors->GetDetails(descriptor);
-}
-
-
void TransitionArray::NoIncrementalWriteBarrierSet(int transition_number,
Name* key,
Map* target) {
diff --git a/src/transitions.cc b/src/transitions.cc
index 51eee6f..ec1b7f4 100644
--- a/src/transitions.cc
+++ b/src/transitions.cc
@@ -48,7 +48,7 @@
Handle<TransitionArray> result;
Isolate* isolate = name->GetIsolate();
- if (flag == SIMPLE_PROPERTY_TRANSITION) {
+ if (flag == SIMPLE_TRANSITION) {
result = AllocateSimple(isolate, target);
} else {
result = Allocate(isolate, 1);
@@ -94,19 +94,9 @@
int number_of_transitions = map->transitions()->number_of_transitions();
int new_nof = number_of_transitions;
- bool is_special_transition = flag == SPECIAL_TRANSITION;
- DCHECK_EQ(is_special_transition, IsSpecialTransition(*name));
- PropertyDetails details = is_special_transition
- ? PropertyDetails(NONE, NORMAL, 0)
- : GetTargetDetails(*name, *target);
-
int insertion_index = kNotFound;
- int index =
- is_special_transition
- ? map->transitions()->SearchSpecial(Symbol::cast(*name),
- &insertion_index)
- : map->transitions()->Search(details.type(), *name,
- details.attributes(), &insertion_index);
+ int index = map->transitions()->Search(*name, &insertion_index);
+
if (index == kNotFound) {
++new_nof;
} else {
@@ -128,12 +118,12 @@
array->SetNumberOfTransitions(new_nof);
for (index = number_of_transitions; index > insertion_index; --index) {
Name* key = array->GetKey(index - 1);
+ DCHECK(key->Hash() > name->Hash());
array->SetKey(index, key);
array->SetTarget(index, array->GetTarget(index - 1));
}
array->SetKey(index, *name);
array->SetTarget(index, *target);
- SLOW_DCHECK(array->IsSortedNoDuplicates());
return handle(array);
}
@@ -154,11 +144,7 @@
new_nof = number_of_transitions;
insertion_index = kNotFound;
- index = is_special_transition ? map->transitions()->SearchSpecial(
- Symbol::cast(*name), &insertion_index)
- : map->transitions()->Search(
- details.type(), *name,
- details.attributes(), &insertion_index);
+ index = array->Search(*name, &insertion_index);
if (index == kNotFound) {
++new_nof;
} else {
@@ -184,46 +170,8 @@
}
result->set_back_pointer_storage(array->back_pointer_storage());
- SLOW_DCHECK(result->IsSortedNoDuplicates());
return result;
}
-int TransitionArray::SearchDetails(int transition, PropertyType type,
- PropertyAttributes attributes,
- int* out_insertion_index) {
- int nof_transitions = number_of_transitions();
- DCHECK(transition < nof_transitions);
- Name* key = GetKey(transition);
- bool is_data = type == FIELD || type == CONSTANT;
- for (; transition < nof_transitions && GetKey(transition) == key;
- transition++) {
- Map* target = GetTarget(transition);
- PropertyDetails target_details = GetTargetDetails(key, target);
-
- bool target_is_data =
- target_details.type() == FIELD || target_details.type() == CONSTANT;
-
- int cmp = CompareDetails(is_data, attributes, target_is_data,
- target_details.attributes());
- if (cmp == 0) {
- return transition;
- } else if (cmp < 0) {
- break;
- }
- }
- if (out_insertion_index != NULL) *out_insertion_index = transition;
- return kNotFound;
-}
-
-
-int TransitionArray::Search(PropertyType type, Name* name,
- PropertyAttributes attributes,
- int* out_insertion_index) {
- int transition = SearchName(name, out_insertion_index);
- if (transition == kNotFound) {
- return kNotFound;
- }
- return SearchDetails(transition, type, attributes, out_insertion_index);
-}
} } // namespace v8::internal
diff --git a/src/transitions.h b/src/transitions.h
index ef74b4d..c5f9a30 100644
--- a/src/transitions.h
+++ b/src/transitions.h
@@ -98,17 +98,9 @@
static Handle<TransitionArray> Insert(Handle<Map> map, Handle<Name> name,
Handle<Map> target,
SimpleTransitionFlag flag);
- // Search a transition for a given type, property name and attributes.
- int Search(PropertyType type, Name* name, PropertyAttributes attributes,
- int* out_insertion_index = NULL);
- // Search a non-property transition (like elements kind, observe or frozen
- // transitions).
- inline int SearchSpecial(Symbol* symbol, int* out_insertion_index = NULL) {
- return SearchName(symbol, out_insertion_index);
- }
-
- static inline PropertyDetails GetTargetDetails(Name* name, Map* target);
+ // Search a transition for a given property name.
+ inline int Search(Name* name, int* out_insertion_index = NULL);
// Allocates a TransitionArray.
static Handle<TransitionArray> Allocate(Isolate* isolate,
@@ -175,10 +167,6 @@
bool IsSortedNoDuplicates(int valid_entries = -1);
bool IsConsistentWithBackPointers(Map* current_map);
bool IsEqualTo(TransitionArray* other);
-
- // Returns true for a non-property transitions like elements kind, observed
- // or frozen transitions.
- static inline bool IsSpecialTransition(Name* name);
#endif
// The maximum number of transitions we want in a transition array (should
@@ -214,31 +202,6 @@
Handle<Map> target,
SimpleTransitionFlag flag);
- // Search a first transition for a given property name.
- inline int SearchName(Name* name, int* out_insertion_index = NULL);
- int SearchDetails(int transition, PropertyType type,
- PropertyAttributes attributes, int* out_insertion_index);
-
- // Compares two tuples <key, is_data_property, attributes>, returns -1 if
- // tuple1 is "less" than tuple2, 0 if tuple1 equal to tuple2 and 1 otherwise.
- static inline int CompareKeys(Name* key1, uint32_t hash1,
- bool is_data_property1,
- PropertyAttributes attributes1, Name* key2,
- uint32_t hash2, bool is_data_property2,
- PropertyAttributes attributes2);
-
- // Compares keys, returns -1 if key1 is "less" than key2,
- // 0 if key1 equal to key2 and 1 otherwise.
- static inline int CompareNames(Name* key1, uint32_t hash1, Name* key2,
- uint32_t hash2);
-
- // Compares two details, returns -1 if details1 is "less" than details2,
- // 0 if details1 equal to details2 and 1 otherwise.
- static inline int CompareDetails(bool is_data_property1,
- PropertyAttributes attributes1,
- bool is_data_property2,
- PropertyAttributes attributes2);
-
inline void NoIncrementalWriteBarrierSet(int transition_number,
Name* key,
Map* target);
diff --git a/src/unicode-inl.h b/src/unicode-inl.h
index 0f78d39..d47ee3e 100644
--- a/src/unicode-inl.h
+++ b/src/unicode-inl.h
@@ -13,7 +13,7 @@
template <class T, int s> bool Predicate<T, s>::get(uchar code_point) {
CacheEntry entry = entries_[code_point & kMask];
- if (entry.code_point() == code_point) return entry.value();
+ if (entry.code_point_ == code_point) return entry.value_;
return CalculateValue(code_point);
}
diff --git a/src/unicode.h b/src/unicode.h
index 1666814..1af6170 100644
--- a/src/unicode.h
+++ b/src/unicode.h
@@ -7,7 +7,6 @@
#include <sys/types.h>
#include "src/globals.h"
-#include "src/utils.h"
/**
* \file
* Definitions and convenience functions for working with unicode.
@@ -29,26 +28,16 @@
public:
inline Predicate() { }
inline bool get(uchar c);
-
private:
friend class Test;
bool CalculateValue(uchar c);
- class CacheEntry {
- public:
- inline CacheEntry()
- : bit_field_(CodePointField::encode(0) | ValueField::encode(0)) {}
+ struct CacheEntry {
+ inline CacheEntry() : code_point_(0), value_(0) { }
inline CacheEntry(uchar code_point, bool value)
- : bit_field_(CodePointField::encode(code_point) |
- ValueField::encode(value)) {}
-
- uchar code_point() const { return CodePointField::decode(bit_field_); }
- bool value() const { return ValueField::decode(bit_field_); }
-
- private:
- class CodePointField : public v8::internal::BitField<uchar, 0, 21> {};
- class ValueField : public v8::internal::BitField<bool, 21, 1> {};
-
- uint32_t bit_field_;
+ : code_point_(code_point),
+ value_(value) { }
+ uchar code_point_ : 21;
+ bool value_ : 1;
};
static const int kSize = size;
static const int kMask = kSize - 1;
diff --git a/src/utils.h b/src/utils.h
index d5685c9..dcefa44 100644
--- a/src/utils.h
+++ b/src/utils.h
@@ -230,14 +230,6 @@
};
-template <class T, int shift, int size>
-class BitField8 : public BitFieldBase<T, shift, size, uint8_t> {};
-
-
-template <class T, int shift, int size>
-class BitField16 : public BitFieldBase<T, shift, size, uint16_t> {};
-
-
template<class T, int shift, int size>
class BitField : public BitFieldBase<T, shift, size, uint32_t> { };
diff --git a/src/version.cc b/src/version.cc
index 6b9481c..70a1f9d 100644
--- a/src/version.cc
+++ b/src/version.cc
@@ -34,7 +34,7 @@
// system so their names cannot be changed without changing the scripts.
#define MAJOR_VERSION 3
#define MINOR_VERSION 30
-#define BUILD_NUMBER 36
+#define BUILD_NUMBER 33
#define PATCH_LEVEL 0
// Use 1 for candidates and 0 otherwise.
// (Boolean macro values are not supported by all preprocessors.)
diff --git a/src/x87/interface-descriptors-x87.cc b/src/x87/interface-descriptors-x87.cc
index 26ce4dc..7640343 100644
--- a/src/x87/interface-descriptors-x87.cc
+++ b/src/x87/interface-descriptors-x87.cc
@@ -155,15 +155,6 @@
}
-void AllocateHeapNumberDescriptor::Initialize(
- CallInterfaceDescriptorData* data) {
- // register state
- // esi -- context
- Register registers[] = {esi};
- data->Initialize(arraysize(registers), registers, nullptr);
-}
-
-
void ArrayConstructorConstantArgCountDescriptor::Initialize(
CallInterfaceDescriptorData* data) {
// register state
diff --git a/src/x87/lithium-codegen-x87.cc b/src/x87/lithium-codegen-x87.cc
index f8872d7..2766b65 100644
--- a/src/x87/lithium-codegen-x87.cc
+++ b/src/x87/lithium-codegen-x87.cc
@@ -2272,8 +2272,6 @@
if (instr->op() != Token::MOD) {
X87PrepareBinaryOp(left, right, result);
}
- // Set the precision control to double-precision.
- __ X87SetFPUCW(0x027F);
switch (instr->op()) {
case Token::ADD:
__ fadd_i(1);
@@ -2308,8 +2306,12 @@
break;
}
- // Restore the default value of control word.
- __ X87SetFPUCW(0x037F);
+ // Only always explicitly storing to memory to force the round-down for double
+ // arithmetic.
+ __ lea(esp, Operand(esp, -kDoubleSize));
+ __ fstp_d(Operand(esp, 0));
+ __ fld_d(Operand(esp, 0));
+ __ lea(esp, Operand(esp, kDoubleSize));
}
diff --git a/src/x87/macro-assembler-x87.cc b/src/x87/macro-assembler-x87.cc
index 3f522fc..ff5db7b 100644
--- a/src/x87/macro-assembler-x87.cc
+++ b/src/x87/macro-assembler-x87.cc
@@ -767,13 +767,6 @@
}
-void MacroAssembler::X87SetFPUCW(int cw) {
- push(Immediate(cw));
- fldcw(MemOperand(esp, 0));
- add(esp, Immediate(kPointerSize));
-}
-
-
void MacroAssembler::AssertNumber(Register object) {
if (emit_debug_code()) {
Label ok;
diff --git a/src/x87/macro-assembler-x87.h b/src/x87/macro-assembler-x87.h
index ad308a4..0796456 100644
--- a/src/x87/macro-assembler-x87.h
+++ b/src/x87/macro-assembler-x87.h
@@ -425,7 +425,6 @@
void FXamSign();
void X87CheckIA();
void X87SetRC(int rc);
- void X87SetFPUCW(int cw);
void ClampUint8(Register reg);
void ClampTOSToUint8(Register result_reg);
diff --git a/test/cctest/cctest.gyp b/test/cctest/cctest.gyp
index b05f0a7..5e7ab99 100644
--- a/test/cctest/cctest.gyp
+++ b/test/cctest/cctest.gyp
@@ -156,7 +156,6 @@
'test-strtod.cc',
'test-thread-termination.cc',
'test-threads.cc',
- 'test-transitions.cc',
'test-types.cc',
'test-unbound-queue.cc',
'test-unique.cc',
diff --git a/test/cctest/compiler/test-instruction.cc b/test/cctest/compiler/test-instruction.cc
index e0fa346..54babfe 100644
--- a/test/cctest/compiler/test-instruction.cc
+++ b/test/cctest/compiler/test-instruction.cc
@@ -139,7 +139,7 @@
BasicBlock* block = *i;
CHECK_EQ(block->rpo_number(), R.BlockAt(block)->rpo_number().ToInt());
CHECK_EQ(block->id().ToInt(), R.BlockAt(block)->id().ToInt());
- CHECK_EQ(NULL, block->loop_end());
+ CHECK_EQ(-1, block->loop_end());
}
}
diff --git a/test/cctest/compiler/test-scheduler.cc b/test/cctest/compiler/test-scheduler.cc
index 5f5c9d1..0ade4d1 100644
--- a/test/cctest/compiler/test-scheduler.cc
+++ b/test/cctest/compiler/test-scheduler.cc
@@ -30,42 +30,29 @@
for (int i = 0; i < static_cast<int>(order->size()); i++) {
CHECK(order->at(i)->rpo_number() == i);
if (!loops_allowed) {
- CHECK_EQ(NULL, order->at(i)->loop_end());
+ CHECK_LT(order->at(i)->loop_end(), 0);
CHECK_EQ(NULL, order->at(i)->loop_header());
}
}
- int number = 0;
- for (auto const block : *order) {
- if (block->deferred()) continue;
- CHECK_EQ(number, block->ao_number());
- ++number;
- }
- for (auto const block : *order) {
- if (!block->deferred()) continue;
- CHECK_EQ(number, block->ao_number());
- ++number;
- }
}
static void CheckLoop(BasicBlockVector* order, BasicBlock** blocks,
int body_size) {
BasicBlock* header = blocks[0];
- BasicBlock* end = header->loop_end();
- CHECK_NE(NULL, end);
- CHECK_GT(end->rpo_number(), 0);
- CHECK_EQ(body_size, end->rpo_number() - header->rpo_number());
+ CHECK_GT(header->loop_end(), 0);
+ CHECK_EQ(body_size, (header->loop_end() - header->rpo_number()));
for (int i = 0; i < body_size; i++) {
- CHECK_GE(blocks[i]->rpo_number(), header->rpo_number());
- CHECK_LT(blocks[i]->rpo_number(), end->rpo_number());
+ int num = blocks[i]->rpo_number();
+ CHECK(num >= header->rpo_number() && num < header->loop_end());
CHECK(header->LoopContains(blocks[i]));
CHECK(header->IsLoopHeader() || blocks[i]->loop_header() == header);
}
if (header->rpo_number() > 0) {
CHECK_NE(order->at(header->rpo_number() - 1)->loop_header(), header);
}
- if (end->rpo_number() < static_cast<int>(order->size())) {
- CHECK_NE(order->at(end->rpo_number())->loop_header(), header);
+ if (header->loop_end() < static_cast<int>(order->size())) {
+ CHECK_NE(order->at(header->loop_end())->loop_header(), header);
}
}
@@ -166,7 +153,6 @@
BasicBlock* last = schedule.start();
for (int j = 0; j < i; j++) {
BasicBlock* block = schedule.NewBasicBlock();
- block->set_deferred(i & 1);
schedule.AddGoto(last, block);
last = block;
}
diff --git a/test/cctest/test-api.cc b/test/cctest/test-api.cc
index 5fa2a2f..068a07e 100644
--- a/test/cctest/test-api.cc
+++ b/test/cctest/test-api.cc
@@ -8810,33 +8810,6 @@
v8::V8::RemoveMessageListeners(ApiUncaughtExceptionTestListener);
}
-
-TEST(ApiUncaughtExceptionInObjectObserve) {
- v8::internal::FLAG_stack_size = 150;
- report_count = 0;
- LocalContext env;
- v8::Isolate* isolate = env->GetIsolate();
- v8::HandleScope scope(isolate);
- v8::V8::AddMessageListener(ApiUncaughtExceptionTestListener);
- CompileRun(
- "var obj = {};"
- "var observe_count = 0;"
- "function observer1() { ++observe_count; };"
- "function observer2() { ++observe_count; };"
- "function observer_throws() { throw new Error(); };"
- "function stack_overflow() { return (function f(x) { f(x+1); })(0); };"
- "Object.observe(obj, observer_throws.bind());"
- "Object.observe(obj, observer1);"
- "Object.observe(obj, stack_overflow);"
- "Object.observe(obj, observer2);"
- "Object.observe(obj, observer_throws.bind());"
- "obj.foo = 'bar';");
- CHECK_EQ(3, report_count);
- ExpectInt32("observe_count", 2);
- v8::V8::RemoveMessageListeners(ApiUncaughtExceptionTestListener);
-}
-
-
static const char* script_resource_name = "ExceptionInNativeScript.js";
static void ExceptionInNativeScriptTestListener(v8::Handle<v8::Message> message,
v8::Handle<Value>) {
diff --git a/test/cctest/test-debug.cc b/test/cctest/test-debug.cc
index 5d38a16..575f938 100644
--- a/test/cctest/test-debug.cc
+++ b/test/cctest/test-debug.cc
@@ -7594,29 +7594,3 @@
CHECK(CompileRun("r")->Equals(v8_str("rejectedrejection")));
CHECK_EQ(1, exception_event_counter);
}
-
-
-TEST(DebugBreakOnExceptionInObserveCallback) {
- DebugLocalContext env;
- v8::Isolate* isolate = env->GetIsolate();
- v8::HandleScope scope(isolate);
- v8::Debug::SetDebugEventListener(&DebugEventCountException);
- // Break on uncaught exception
- ChangeBreakOnException(false, true);
- exception_event_counter = 0;
-
- v8::Handle<v8::FunctionTemplate> fun =
- v8::FunctionTemplate::New(isolate, ThrowCallback);
- env->Global()->Set(v8_str("fun"), fun->GetFunction());
-
- CompileRun(
- "var obj = {};"
- "var callbackRan = false;"
- "Object.observe(obj, function() {"
- " callbackRan = true;"
- " throw Error('foo');"
- "});"
- "obj.prop = 1");
- CHECK(CompileRun("callbackRan")->BooleanValue());
- CHECK_EQ(1, exception_event_counter);
-}
diff --git a/test/cctest/test-object-observe.cc b/test/cctest/test-object-observe.cc
index 8851d88..d208a26 100644
--- a/test/cctest/test-object-observe.cc
+++ b/test/cctest/test-object-observe.cc
@@ -130,59 +130,6 @@
}
-TEST(DeliveryCallbackThrows) {
- HandleScope scope(CcTest::isolate());
- LocalContext context(CcTest::isolate());
- CompileRun(
- "var obj = {};"
- "var ordering = [];"
- "function observer1() { ordering.push(1); };"
- "function observer2() { ordering.push(2); };"
- "function observer_throws() {"
- " ordering.push(0);"
- " throw new Error();"
- " ordering.push(-1);"
- "};"
- "Object.observe(obj, observer_throws.bind());"
- "Object.observe(obj, observer1);"
- "Object.observe(obj, observer_throws.bind());"
- "Object.observe(obj, observer2);"
- "Object.observe(obj, observer_throws.bind());"
- "obj.foo = 'bar';");
- CHECK_EQ(5, CompileRun("ordering.length")->Int32Value());
- CHECK_EQ(0, CompileRun("ordering[0]")->Int32Value());
- CHECK_EQ(1, CompileRun("ordering[1]")->Int32Value());
- CHECK_EQ(0, CompileRun("ordering[2]")->Int32Value());
- CHECK_EQ(2, CompileRun("ordering[3]")->Int32Value());
- CHECK_EQ(0, CompileRun("ordering[4]")->Int32Value());
-}
-
-
-TEST(DeliveryChangesMutationInCallback) {
- HandleScope scope(CcTest::isolate());
- LocalContext context(CcTest::isolate());
- CompileRun(
- "var obj = {};"
- "var ordering = [];"
- "function observer1(records) {"
- " ordering.push(100 + records.length);"
- " records.push(11);"
- " records.push(22);"
- "};"
- "function observer2(records) {"
- " ordering.push(200 + records.length);"
- " records.push(33);"
- " records.push(44);"
- "};"
- "Object.observe(obj, observer1);"
- "Object.observe(obj, observer2);"
- "obj.foo = 'bar';");
- CHECK_EQ(2, CompileRun("ordering.length")->Int32Value());
- CHECK_EQ(101, CompileRun("ordering[0]")->Int32Value());
- CHECK_EQ(201, CompileRun("ordering[1]")->Int32Value());
-}
-
-
TEST(DeliveryOrderingReentrant) {
HandleScope scope(CcTest::isolate());
LocalContext context(CcTest::isolate());
diff --git a/test/cctest/test-transitions.cc b/test/cctest/test-transitions.cc
deleted file mode 100644
index 94e230c..0000000
--- a/test/cctest/test-transitions.cc
+++ /dev/null
@@ -1,283 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include <stdlib.h>
-#include <utility>
-
-#include "src/v8.h"
-
-#include "src/compilation-cache.h"
-#include "src/execution.h"
-#include "src/factory.h"
-#include "src/global-handles.h"
-#include "test/cctest/cctest.h"
-
-using namespace v8::internal;
-
-
-//
-// Helper functions.
-//
-
-static void ConnectTransition(Handle<Map> parent,
- Handle<TransitionArray> transitions,
- Handle<Map> child) {
- if (!parent->HasTransitionArray() || *transitions != parent->transitions()) {
- parent->set_transitions(*transitions);
- }
- child->SetBackPointer(*parent);
-}
-
-
-TEST(TransitionArray_SimpleFieldTransitions) {
- CcTest::InitializeVM();
- v8::HandleScope scope(CcTest::isolate());
- Isolate* isolate = CcTest::i_isolate();
- Factory* factory = isolate->factory();
-
- Handle<String> name1 = factory->InternalizeUtf8String("foo");
- Handle<String> name2 = factory->InternalizeUtf8String("bar");
- PropertyAttributes attributes = NONE;
-
- Handle<Map> map0 = Map::Create(isolate, 0);
- Handle<Map> map1 =
- Map::CopyWithField(map0, name1, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
- Handle<Map> map2 =
- Map::CopyWithField(map0, name2, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
-
- CHECK(!map0->HasTransitionArray());
- Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
- CHECK(transitions->IsFullTransitionArray());
-
- int transition;
- transitions =
- transitions->Insert(map0, name1, map1, SIMPLE_PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map1);
- CHECK(transitions->IsSimpleTransition());
- transition = transitions->Search(FIELD, *name1, attributes);
- CHECK_EQ(TransitionArray::kSimpleTransitionIndex, transition);
- CHECK_EQ(*name1, transitions->GetKey(transition));
- CHECK_EQ(*map1, transitions->GetTarget(transition));
-
- transitions =
- transitions->Insert(map0, name2, map2, SIMPLE_PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map2);
- CHECK(transitions->IsFullTransitionArray());
-
- transition = transitions->Search(FIELD, *name1, attributes);
- CHECK_EQ(*name1, transitions->GetKey(transition));
- CHECK_EQ(*map1, transitions->GetTarget(transition));
-
- transition = transitions->Search(FIELD, *name2, attributes);
- CHECK_EQ(*name2, transitions->GetKey(transition));
- CHECK_EQ(*map2, transitions->GetTarget(transition));
-
- DCHECK(transitions->IsSortedNoDuplicates());
-}
-
-
-TEST(TransitionArray_FullFieldTransitions) {
- CcTest::InitializeVM();
- v8::HandleScope scope(CcTest::isolate());
- Isolate* isolate = CcTest::i_isolate();
- Factory* factory = isolate->factory();
-
- Handle<String> name1 = factory->InternalizeUtf8String("foo");
- Handle<String> name2 = factory->InternalizeUtf8String("bar");
- PropertyAttributes attributes = NONE;
-
- Handle<Map> map0 = Map::Create(isolate, 0);
- Handle<Map> map1 =
- Map::CopyWithField(map0, name1, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
- Handle<Map> map2 =
- Map::CopyWithField(map0, name2, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
-
- CHECK(!map0->HasTransitionArray());
- Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
- CHECK(transitions->IsFullTransitionArray());
-
- int transition;
- transitions = transitions->Insert(map0, name1, map1, PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map1);
- CHECK(transitions->IsFullTransitionArray());
- transition = transitions->Search(FIELD, *name1, attributes);
- CHECK_EQ(*name1, transitions->GetKey(transition));
- CHECK_EQ(*map1, transitions->GetTarget(transition));
-
- transitions = transitions->Insert(map0, name2, map2, PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map2);
- CHECK(transitions->IsFullTransitionArray());
-
- transition = transitions->Search(FIELD, *name1, attributes);
- CHECK_EQ(*name1, transitions->GetKey(transition));
- CHECK_EQ(*map1, transitions->GetTarget(transition));
-
- transition = transitions->Search(FIELD, *name2, attributes);
- CHECK_EQ(*name2, transitions->GetKey(transition));
- CHECK_EQ(*map2, transitions->GetTarget(transition));
-
- DCHECK(transitions->IsSortedNoDuplicates());
-}
-
-
-TEST(TransitionArray_DifferentFieldNames) {
- CcTest::InitializeVM();
- v8::HandleScope scope(CcTest::isolate());
- Isolate* isolate = CcTest::i_isolate();
- Factory* factory = isolate->factory();
-
- const int PROPS_COUNT = 10;
- Handle<String> names[PROPS_COUNT];
- Handle<Map> maps[PROPS_COUNT];
- PropertyAttributes attributes = NONE;
-
- Handle<Map> map0 = Map::Create(isolate, 0);
- CHECK(!map0->HasTransitionArray());
- Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
- CHECK(transitions->IsFullTransitionArray());
-
- for (int i = 0; i < PROPS_COUNT; i++) {
- EmbeddedVector<char, 64> buffer;
- SNPrintF(buffer, "prop%d", i);
- Handle<String> name = factory->InternalizeUtf8String(buffer.start());
- Handle<Map> map =
- Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
- names[i] = name;
- maps[i] = map;
-
- transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map);
- }
-
- for (int i = 0; i < PROPS_COUNT; i++) {
- int transition = transitions->Search(FIELD, *names[i], attributes);
- CHECK_EQ(*names[i], transitions->GetKey(transition));
- CHECK_EQ(*maps[i], transitions->GetTarget(transition));
- }
-
- DCHECK(transitions->IsSortedNoDuplicates());
-}
-
-
-TEST(TransitionArray_SameFieldNamesDifferentAttributesSimple) {
- CcTest::InitializeVM();
- v8::HandleScope scope(CcTest::isolate());
- Isolate* isolate = CcTest::i_isolate();
- Factory* factory = isolate->factory();
-
- Handle<Map> map0 = Map::Create(isolate, 0);
- CHECK(!map0->HasTransitionArray());
- Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
- CHECK(transitions->IsFullTransitionArray());
-
- const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1;
- STATIC_ASSERT(ATTRS_COUNT == 8);
- Handle<Map> attr_maps[ATTRS_COUNT];
- Handle<String> name = factory->InternalizeUtf8String("foo");
-
- // Add transitions for same field name but different attributes.
- for (int i = 0; i < ATTRS_COUNT; i++) {
- PropertyAttributes attributes = static_cast<PropertyAttributes>(i);
-
- Handle<Map> map =
- Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
- attr_maps[i] = map;
-
- transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map);
- }
-
- // Ensure that transitions for |name| field are valid.
- for (int i = 0; i < ATTRS_COUNT; i++) {
- PropertyAttributes attributes = static_cast<PropertyAttributes>(i);
-
- int transition = transitions->Search(FIELD, *name, attributes);
- CHECK_EQ(*name, transitions->GetKey(transition));
- CHECK_EQ(*attr_maps[i], transitions->GetTarget(transition));
- }
-
- DCHECK(transitions->IsSortedNoDuplicates());
-}
-
-
-TEST(TransitionArray_SameFieldNamesDifferentAttributes) {
- CcTest::InitializeVM();
- v8::HandleScope scope(CcTest::isolate());
- Isolate* isolate = CcTest::i_isolate();
- Factory* factory = isolate->factory();
-
- const int PROPS_COUNT = 10;
- Handle<String> names[PROPS_COUNT];
- Handle<Map> maps[PROPS_COUNT];
-
- Handle<Map> map0 = Map::Create(isolate, 0);
- CHECK(!map0->HasTransitionArray());
- Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
- CHECK(transitions->IsFullTransitionArray());
-
- // Some number of fields.
- for (int i = 0; i < PROPS_COUNT; i++) {
- EmbeddedVector<char, 64> buffer;
- SNPrintF(buffer, "prop%d", i);
- Handle<String> name = factory->InternalizeUtf8String(buffer.start());
- Handle<Map> map =
- Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate), NONE,
- Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
- names[i] = name;
- maps[i] = map;
-
- transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map);
- }
-
- const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1;
- STATIC_ASSERT(ATTRS_COUNT == 8);
- Handle<Map> attr_maps[ATTRS_COUNT];
- Handle<String> name = factory->InternalizeUtf8String("foo");
-
- // Add transitions for same field name but different attributes.
- for (int i = 0; i < ATTRS_COUNT; i++) {
- PropertyAttributes attributes = static_cast<PropertyAttributes>(i);
-
- Handle<Map> map =
- Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate),
- attributes, Representation::Tagged(),
- OMIT_TRANSITION).ToHandleChecked();
- attr_maps[i] = map;
-
- transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
- ConnectTransition(map0, transitions, map);
- }
-
- // Ensure that transitions for |name| field are valid.
- for (int i = 0; i < ATTRS_COUNT; i++) {
- PropertyAttributes attributes = static_cast<PropertyAttributes>(i);
-
- int transition = transitions->Search(FIELD, *name, attributes);
- CHECK_EQ(*name, transitions->GetKey(transition));
- CHECK_EQ(*attr_maps[i], transitions->GetTarget(transition));
- }
-
- // Ensure that info about the other fields still valid.
- for (int i = 0; i < PROPS_COUNT; i++) {
- int transition = transitions->Search(FIELD, *names[i], NONE);
- CHECK_EQ(*names[i], transitions->GetKey(transition));
- CHECK_EQ(*maps[i], transitions->GetTarget(transition));
- }
-
- DCHECK(transitions->IsSortedNoDuplicates());
-}
diff --git a/test/mjsunit/asm/embenchen/box2d.js b/test/mjsunit/asm/embenchen/box2d.js
deleted file mode 100644
index d524af2..0000000
--- a/test/mjsunit/asm/embenchen/box2d.js
+++ /dev/null
@@ -1,20326 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-var EXPECTED_OUTPUT =
- /frame averages: .+ \+- .+, range: .+ to .+ \n/;
-var Module = {
- arguments: [1],
- print: function(x) {Module.printBuffer += x + '\n';},
- preRun: [function() {Module.printBuffer = ''}],
- postRun: [function() {
- assertTrue(EXPECTED_OUTPUT.test(Module.printBuffer));
- }],
-};
-// The Module object: Our interface to the outside world. We import
-// and export values on it, and do the work to get that through
-// closure compiler if necessary. There are various ways Module can be used:
-// 1. Not defined. We create it here
-// 2. A function parameter, function(Module) { ..generated code.. }
-// 3. pre-run appended it, var Module = {}; ..generated code..
-// 4. External script tag defines var Module.
-// We need to do an eval in order to handle the closure compiler
-// case, where this code here is minified but Module was defined
-// elsewhere (e.g. case 4 above). We also need to check if Module
-// already exists (e.g. case 3 above).
-// Note that if you want to run closure, and also to use Module
-// after the generated code, you will need to define var Module = {};
-// before the code. Then that object will be used in the code, and you
-// can continue to use Module afterwards as well.
-var Module;
-if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
-
-// Sometimes an existing Module object exists with properties
-// meant to overwrite the default module functionality. Here
-// we collect those properties and reapply _after_ we configure
-// the current environment's defaults to avoid having to be so
-// defensive during initialization.
-var moduleOverrides = {};
-for (var key in Module) {
- if (Module.hasOwnProperty(key)) {
- moduleOverrides[key] = Module[key];
- }
-}
-
-// The environment setup code below is customized to use Module.
-// *** Environment setup code ***
-var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
-var ENVIRONMENT_IS_WEB = typeof window === 'object';
-var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
-var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
-
-if (ENVIRONMENT_IS_NODE) {
- // Expose functionality in the same simple way that the shells work
- // Note that we pollute the global namespace here, otherwise we break in node
- if (!Module['print']) Module['print'] = function print(x) {
- process['stdout'].write(x + '\n');
- };
- if (!Module['printErr']) Module['printErr'] = function printErr(x) {
- process['stderr'].write(x + '\n');
- };
-
- var nodeFS = require('fs');
- var nodePath = require('path');
-
- Module['read'] = function read(filename, binary) {
- filename = nodePath['normalize'](filename);
- var ret = nodeFS['readFileSync'](filename);
- // The path is absolute if the normalized version is the same as the resolved.
- if (!ret && filename != nodePath['resolve'](filename)) {
- filename = path.join(__dirname, '..', 'src', filename);
- ret = nodeFS['readFileSync'](filename);
- }
- if (ret && !binary) ret = ret.toString();
- return ret;
- };
-
- Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
-
- Module['load'] = function load(f) {
- globalEval(read(f));
- };
-
- Module['arguments'] = process['argv'].slice(2);
-
- module['exports'] = Module;
-}
-else if (ENVIRONMENT_IS_SHELL) {
- if (!Module['print']) Module['print'] = print;
- if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
-
- if (typeof read != 'undefined') {
- Module['read'] = read;
- } else {
- Module['read'] = function read() { throw 'no read() available (jsc?)' };
- }
-
- Module['readBinary'] = function readBinary(f) {
- return read(f, 'binary');
- };
-
- if (typeof scriptArgs != 'undefined') {
- Module['arguments'] = scriptArgs;
- } else if (typeof arguments != 'undefined') {
- Module['arguments'] = arguments;
- }
-
- this['Module'] = Module;
-
- eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
-}
-else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
- Module['read'] = function read(url) {
- var xhr = new XMLHttpRequest();
- xhr.open('GET', url, false);
- xhr.send(null);
- return xhr.responseText;
- };
-
- if (typeof arguments != 'undefined') {
- Module['arguments'] = arguments;
- }
-
- if (typeof console !== 'undefined') {
- if (!Module['print']) Module['print'] = function print(x) {
- console.log(x);
- };
- if (!Module['printErr']) Module['printErr'] = function printErr(x) {
- console.log(x);
- };
- } else {
- // Probably a worker, and without console.log. We can do very little here...
- var TRY_USE_DUMP = false;
- if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
- dump(x);
- }) : (function(x) {
- // self.postMessage(x); // enable this if you want stdout to be sent as messages
- }));
- }
-
- if (ENVIRONMENT_IS_WEB) {
- window['Module'] = Module;
- } else {
- Module['load'] = importScripts;
- }
-}
-else {
- // Unreachable because SHELL is dependant on the others
- throw 'Unknown runtime environment. Where are we?';
-}
-
-function globalEval(x) {
- eval.call(null, x);
-}
-if (!Module['load'] == 'undefined' && Module['read']) {
- Module['load'] = function load(f) {
- globalEval(Module['read'](f));
- };
-}
-if (!Module['print']) {
- Module['print'] = function(){};
-}
-if (!Module['printErr']) {
- Module['printErr'] = Module['print'];
-}
-if (!Module['arguments']) {
- Module['arguments'] = [];
-}
-// *** Environment setup code ***
-
-// Closure helpers
-Module.print = Module['print'];
-Module.printErr = Module['printErr'];
-
-// Callbacks
-Module['preRun'] = [];
-Module['postRun'] = [];
-
-// Merge back in the overrides
-for (var key in moduleOverrides) {
- if (moduleOverrides.hasOwnProperty(key)) {
- Module[key] = moduleOverrides[key];
- }
-}
-
-
-
-// === Auto-generated preamble library stuff ===
-
-//========================================
-// Runtime code shared with compiler
-//========================================
-
-var Runtime = {
- stackSave: function () {
- return STACKTOP;
- },
- stackRestore: function (stackTop) {
- STACKTOP = stackTop;
- },
- forceAlign: function (target, quantum) {
- quantum = quantum || 4;
- if (quantum == 1) return target;
- if (isNumber(target) && isNumber(quantum)) {
- return Math.ceil(target/quantum)*quantum;
- } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
- return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
- }
- return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
- },
- isNumberType: function (type) {
- return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
- },
- isPointerType: function isPointerType(type) {
- return type[type.length-1] == '*';
-},
- isStructType: function isStructType(type) {
- if (isPointerType(type)) return false;
- if (isArrayType(type)) return true;
- if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
- // See comment in isStructPointerType()
- return type[0] == '%';
-},
- INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
- FLOAT_TYPES: {"float":0,"double":0},
- or64: function (x, y) {
- var l = (x | 0) | (y | 0);
- var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
- return l + h;
- },
- and64: function (x, y) {
- var l = (x | 0) & (y | 0);
- var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
- return l + h;
- },
- xor64: function (x, y) {
- var l = (x | 0) ^ (y | 0);
- var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
- return l + h;
- },
- getNativeTypeSize: function (type) {
- switch (type) {
- case 'i1': case 'i8': return 1;
- case 'i16': return 2;
- case 'i32': return 4;
- case 'i64': return 8;
- case 'float': return 4;
- case 'double': return 8;
- default: {
- if (type[type.length-1] === '*') {
- return Runtime.QUANTUM_SIZE; // A pointer
- } else if (type[0] === 'i') {
- var bits = parseInt(type.substr(1));
- assert(bits % 8 === 0);
- return bits/8;
- } else {
- return 0;
- }
- }
- }
- },
- getNativeFieldSize: function (type) {
- return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
- },
- dedup: function dedup(items, ident) {
- var seen = {};
- if (ident) {
- return items.filter(function(item) {
- if (seen[item[ident]]) return false;
- seen[item[ident]] = true;
- return true;
- });
- } else {
- return items.filter(function(item) {
- if (seen[item]) return false;
- seen[item] = true;
- return true;
- });
- }
-},
- set: function set() {
- var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
- var ret = {};
- for (var i = 0; i < args.length; i++) {
- ret[args[i]] = 0;
- }
- return ret;
-},
- STACK_ALIGN: 8,
- getAlignSize: function (type, size, vararg) {
- // we align i64s and doubles on 64-bit boundaries, unlike x86
- if (!vararg && (type == 'i64' || type == 'double')) return 8;
- if (!type) return Math.min(size, 8); // align structures internally to 64 bits
- return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
- },
- calculateStructAlignment: function calculateStructAlignment(type) {
- type.flatSize = 0;
- type.alignSize = 0;
- var diffs = [];
- var prev = -1;
- var index = 0;
- type.flatIndexes = type.fields.map(function(field) {
- index++;
- var size, alignSize;
- if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
- size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
- alignSize = Runtime.getAlignSize(field, size);
- } else if (Runtime.isStructType(field)) {
- if (field[1] === '0') {
- // this is [0 x something]. When inside another structure like here, it must be at the end,
- // and it adds no size
- // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
- size = 0;
- if (Types.types[field]) {
- alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
- } else {
- alignSize = type.alignSize || QUANTUM_SIZE;
- }
- } else {
- size = Types.types[field].flatSize;
- alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
- }
- } else if (field[0] == 'b') {
- // bN, large number field, like a [N x i8]
- size = field.substr(1)|0;
- alignSize = 1;
- } else if (field[0] === '<') {
- // vector type
- size = alignSize = Types.types[field].flatSize; // fully aligned
- } else if (field[0] === 'i') {
- // illegal integer field, that could not be legalized because it is an internal structure field
- // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
- size = alignSize = parseInt(field.substr(1))/8;
- assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
- } else {
- assert(false, 'invalid type for calculateStructAlignment');
- }
- if (type.packed) alignSize = 1;
- type.alignSize = Math.max(type.alignSize, alignSize);
- var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
- type.flatSize = curr + size;
- if (prev >= 0) {
- diffs.push(curr-prev);
- }
- prev = curr;
- return curr;
- });
- if (type.name_ && type.name_[0] === '[') {
- // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
- // allocating a potentially huge array for [999999 x i8] etc.
- type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
- }
- type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
- if (diffs.length == 0) {
- type.flatFactor = type.flatSize;
- } else if (Runtime.dedup(diffs).length == 1) {
- type.flatFactor = diffs[0];
- }
- type.needsFlattening = (type.flatFactor != 1);
- return type.flatIndexes;
- },
- generateStructInfo: function (struct, typeName, offset) {
- var type, alignment;
- if (typeName) {
- offset = offset || 0;
- type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
- if (!type) return null;
- if (type.fields.length != struct.length) {
- printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
- return null;
- }
- alignment = type.flatIndexes;
- } else {
- var type = { fields: struct.map(function(item) { return item[0] }) };
- alignment = Runtime.calculateStructAlignment(type);
- }
- var ret = {
- __size__: type.flatSize
- };
- if (typeName) {
- struct.forEach(function(item, i) {
- if (typeof item === 'string') {
- ret[item] = alignment[i] + offset;
- } else {
- // embedded struct
- var key;
- for (var k in item) key = k;
- ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
- }
- });
- } else {
- struct.forEach(function(item, i) {
- ret[item[1]] = alignment[i];
- });
- }
- return ret;
- },
- dynCall: function (sig, ptr, args) {
- if (args && args.length) {
- if (!args.splice) args = Array.prototype.slice.call(args);
- args.splice(0, 0, ptr);
- return Module['dynCall_' + sig].apply(null, args);
- } else {
- return Module['dynCall_' + sig].call(null, ptr);
- }
- },
- functionPointers: [],
- addFunction: function (func) {
- for (var i = 0; i < Runtime.functionPointers.length; i++) {
- if (!Runtime.functionPointers[i]) {
- Runtime.functionPointers[i] = func;
- return 2*(1 + i);
- }
- }
- throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
- },
- removeFunction: function (index) {
- Runtime.functionPointers[(index-2)/2] = null;
- },
- getAsmConst: function (code, numArgs) {
- // code is a constant string on the heap, so we can cache these
- if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
- var func = Runtime.asmConstCache[code];
- if (func) return func;
- var args = [];
- for (var i = 0; i < numArgs; i++) {
- args.push(String.fromCharCode(36) + i); // $0, $1 etc
- }
- var source = Pointer_stringify(code);
- if (source[0] === '"') {
- // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
- if (source.indexOf('"', 1) === source.length-1) {
- source = source.substr(1, source.length-2);
- } else {
- // something invalid happened, e.g. EM_ASM("..code($0)..", input)
- abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
- }
- }
- try {
- var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
- } catch(e) {
- Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
- throw e;
- }
- return Runtime.asmConstCache[code] = evalled;
- },
- warnOnce: function (text) {
- if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
- if (!Runtime.warnOnce.shown[text]) {
- Runtime.warnOnce.shown[text] = 1;
- Module.printErr(text);
- }
- },
- funcWrappers: {},
- getFuncWrapper: function (func, sig) {
- assert(sig);
- if (!Runtime.funcWrappers[func]) {
- Runtime.funcWrappers[func] = function dynCall_wrapper() {
- return Runtime.dynCall(sig, func, arguments);
- };
- }
- return Runtime.funcWrappers[func];
- },
- UTF8Processor: function () {
- var buffer = [];
- var needed = 0;
- this.processCChar = function (code) {
- code = code & 0xFF;
-
- if (buffer.length == 0) {
- if ((code & 0x80) == 0x00) { // 0xxxxxxx
- return String.fromCharCode(code);
- }
- buffer.push(code);
- if ((code & 0xE0) == 0xC0) { // 110xxxxx
- needed = 1;
- } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
- needed = 2;
- } else { // 11110xxx
- needed = 3;
- }
- return '';
- }
-
- if (needed) {
- buffer.push(code);
- needed--;
- if (needed > 0) return '';
- }
-
- var c1 = buffer[0];
- var c2 = buffer[1];
- var c3 = buffer[2];
- var c4 = buffer[3];
- var ret;
- if (buffer.length == 2) {
- ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
- } else if (buffer.length == 3) {
- ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
- } else {
- // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
- var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
- ((c3 & 0x3F) << 6) | (c4 & 0x3F);
- ret = String.fromCharCode(
- Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
- (codePoint - 0x10000) % 0x400 + 0xDC00);
- }
- buffer.length = 0;
- return ret;
- }
- this.processJSString = function processJSString(string) {
- /* TODO: use TextEncoder when present,
- var encoder = new TextEncoder();
- encoder['encoding'] = "utf-8";
- var utf8Array = encoder['encode'](aMsg.data);
- */
- string = unescape(encodeURIComponent(string));
- var ret = [];
- for (var i = 0; i < string.length; i++) {
- ret.push(string.charCodeAt(i));
- }
- return ret;
- }
- },
- getCompilerSetting: function (name) {
- throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
- },
- stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
- staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
- dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
- alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
- makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
- GLOBAL_BASE: 8,
- QUANTUM_SIZE: 4,
- __dummy__: 0
-}
-
-
-Module['Runtime'] = Runtime;
-
-
-
-
-
-
-
-
-
-//========================================
-// Runtime essentials
-//========================================
-
-var __THREW__ = 0; // Used in checking for thrown exceptions.
-
-var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
-var EXITSTATUS = 0;
-
-var undef = 0;
-// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
-// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
-var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
-var tempI64, tempI64b;
-var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
-
-function assert(condition, text) {
- if (!condition) {
- abort('Assertion failed: ' + text);
- }
-}
-
-var globalScope = this;
-
-// C calling interface. A convenient way to call C functions (in C files, or
-// defined with extern "C").
-//
-// Note: LLVM optimizations can inline and remove functions, after which you will not be
-// able to call them. Closure can also do so. To avoid that, add your function to
-// the exports using something like
-//
-// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
-//
-// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
-// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
-// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
-// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
-// except that 'array' is not possible (there is no way for us to know the length of the array)
-// @param args An array of the arguments to the function, as native JS values (as in returnType)
-// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
-// @return The return value, as a native JS value (as in returnType)
-function ccall(ident, returnType, argTypes, args) {
- return ccallFunc(getCFunc(ident), returnType, argTypes, args);
-}
-Module["ccall"] = ccall;
-
-// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
-function getCFunc(ident) {
- try {
- var func = Module['_' + ident]; // closure exported function
- if (!func) func = eval('_' + ident); // explicit lookup
- } catch(e) {
- }
- assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
- return func;
-}
-
-// Internal function that does a C call using a function, not an identifier
-function ccallFunc(func, returnType, argTypes, args) {
- var stack = 0;
- function toC(value, type) {
- if (type == 'string') {
- if (value === null || value === undefined || value === 0) return 0; // null string
- value = intArrayFromString(value);
- type = 'array';
- }
- if (type == 'array') {
- if (!stack) stack = Runtime.stackSave();
- var ret = Runtime.stackAlloc(value.length);
- writeArrayToMemory(value, ret);
- return ret;
- }
- return value;
- }
- function fromC(value, type) {
- if (type == 'string') {
- return Pointer_stringify(value);
- }
- assert(type != 'array');
- return value;
- }
- var i = 0;
- var cArgs = args ? args.map(function(arg) {
- return toC(arg, argTypes[i++]);
- }) : [];
- var ret = fromC(func.apply(null, cArgs), returnType);
- if (stack) Runtime.stackRestore(stack);
- return ret;
-}
-
-// Returns a native JS wrapper for a C function. This is similar to ccall, but
-// returns a function you can call repeatedly in a normal way. For example:
-//
-// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
-// alert(my_function(5, 22));
-// alert(my_function(99, 12));
-//
-function cwrap(ident, returnType, argTypes) {
- var func = getCFunc(ident);
- return function() {
- return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
- }
-}
-Module["cwrap"] = cwrap;
-
-// Sets a value in memory in a dynamic way at run-time. Uses the
-// type data. This is the same as makeSetValue, except that
-// makeSetValue is done at compile-time and generates the needed
-// code then, whereas this function picks the right code at
-// run-time.
-// Note that setValue and getValue only do *aligned* writes and reads!
-// Note that ccall uses JS types as for defining types, while setValue and
-// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
-function setValue(ptr, value, type, noSafe) {
- type = type || 'i8';
- if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
- switch(type) {
- case 'i1': HEAP8[(ptr)]=value; break;
- case 'i8': HEAP8[(ptr)]=value; break;
- case 'i16': HEAP16[((ptr)>>1)]=value; break;
- case 'i32': HEAP32[((ptr)>>2)]=value; break;
- case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
- case 'float': HEAPF32[((ptr)>>2)]=value; break;
- case 'double': HEAPF64[((ptr)>>3)]=value; break;
- default: abort('invalid type for setValue: ' + type);
- }
-}
-Module['setValue'] = setValue;
-
-// Parallel to setValue.
-function getValue(ptr, type, noSafe) {
- type = type || 'i8';
- if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
- switch(type) {
- case 'i1': return HEAP8[(ptr)];
- case 'i8': return HEAP8[(ptr)];
- case 'i16': return HEAP16[((ptr)>>1)];
- case 'i32': return HEAP32[((ptr)>>2)];
- case 'i64': return HEAP32[((ptr)>>2)];
- case 'float': return HEAPF32[((ptr)>>2)];
- case 'double': return HEAPF64[((ptr)>>3)];
- default: abort('invalid type for setValue: ' + type);
- }
- return null;
-}
-Module['getValue'] = getValue;
-
-var ALLOC_NORMAL = 0; // Tries to use _malloc()
-var ALLOC_STACK = 1; // Lives for the duration of the current function call
-var ALLOC_STATIC = 2; // Cannot be freed
-var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
-var ALLOC_NONE = 4; // Do not allocate
-Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
-Module['ALLOC_STACK'] = ALLOC_STACK;
-Module['ALLOC_STATIC'] = ALLOC_STATIC;
-Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
-Module['ALLOC_NONE'] = ALLOC_NONE;
-
-// allocate(): This is for internal use. You can use it yourself as well, but the interface
-// is a little tricky (see docs right below). The reason is that it is optimized
-// for multiple syntaxes to save space in generated code. So you should
-// normally not use allocate(), and instead allocate memory using _malloc(),
-// initialize it with setValue(), and so forth.
-// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
-// in *bytes* (note that this is sometimes confusing: the next parameter does not
-// affect this!)
-// @types: Either an array of types, one for each byte (or 0 if no type at that position),
-// or a single type which is used for the entire block. This only matters if there
-// is initial data - if @slab is a number, then this does not matter at all and is
-// ignored.
-// @allocator: How to allocate memory, see ALLOC_*
-function allocate(slab, types, allocator, ptr) {
- var zeroinit, size;
- if (typeof slab === 'number') {
- zeroinit = true;
- size = slab;
- } else {
- zeroinit = false;
- size = slab.length;
- }
-
- var singleType = typeof types === 'string' ? types : null;
-
- var ret;
- if (allocator == ALLOC_NONE) {
- ret = ptr;
- } else {
- ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
- }
-
- if (zeroinit) {
- var ptr = ret, stop;
- assert((ret & 3) == 0);
- stop = ret + (size & ~3);
- for (; ptr < stop; ptr += 4) {
- HEAP32[((ptr)>>2)]=0;
- }
- stop = ret + size;
- while (ptr < stop) {
- HEAP8[((ptr++)|0)]=0;
- }
- return ret;
- }
-
- if (singleType === 'i8') {
- if (slab.subarray || slab.slice) {
- HEAPU8.set(slab, ret);
- } else {
- HEAPU8.set(new Uint8Array(slab), ret);
- }
- return ret;
- }
-
- var i = 0, type, typeSize, previousType;
- while (i < size) {
- var curr = slab[i];
-
- if (typeof curr === 'function') {
- curr = Runtime.getFunctionIndex(curr);
- }
-
- type = singleType || types[i];
- if (type === 0) {
- i++;
- continue;
- }
-
- if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
-
- setValue(ret+i, curr, type);
-
- // no need to look up size unless type changes, so cache it
- if (previousType !== type) {
- typeSize = Runtime.getNativeTypeSize(type);
- previousType = type;
- }
- i += typeSize;
- }
-
- return ret;
-}
-Module['allocate'] = allocate;
-
-function Pointer_stringify(ptr, /* optional */ length) {
- // TODO: use TextDecoder
- // Find the length, and check for UTF while doing so
- var hasUtf = false;
- var t;
- var i = 0;
- while (1) {
- t = HEAPU8[(((ptr)+(i))|0)];
- if (t >= 128) hasUtf = true;
- else if (t == 0 && !length) break;
- i++;
- if (length && i == length) break;
- }
- if (!length) length = i;
-
- var ret = '';
-
- if (!hasUtf) {
- var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
- var curr;
- while (length > 0) {
- curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
- ret = ret ? ret + curr : curr;
- ptr += MAX_CHUNK;
- length -= MAX_CHUNK;
- }
- return ret;
- }
-
- var utf8 = new Runtime.UTF8Processor();
- for (i = 0; i < length; i++) {
- t = HEAPU8[(((ptr)+(i))|0)];
- ret += utf8.processCChar(t);
- }
- return ret;
-}
-Module['Pointer_stringify'] = Pointer_stringify;
-
-// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
-// a copy of that string as a Javascript String object.
-function UTF16ToString(ptr) {
- var i = 0;
-
- var str = '';
- while (1) {
- var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
- if (codeUnit == 0)
- return str;
- ++i;
- // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
- str += String.fromCharCode(codeUnit);
- }
-}
-Module['UTF16ToString'] = UTF16ToString;
-
-// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
-// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
-function stringToUTF16(str, outPtr) {
- for(var i = 0; i < str.length; ++i) {
- // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
- var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
- HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
- }
- // Null-terminate the pointer to the HEAP.
- HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
-}
-Module['stringToUTF16'] = stringToUTF16;
-
-// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
-// a copy of that string as a Javascript String object.
-function UTF32ToString(ptr) {
- var i = 0;
-
- var str = '';
- while (1) {
- var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
- if (utf32 == 0)
- return str;
- ++i;
- // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
- if (utf32 >= 0x10000) {
- var ch = utf32 - 0x10000;
- str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
- } else {
- str += String.fromCharCode(utf32);
- }
- }
-}
-Module['UTF32ToString'] = UTF32ToString;
-
-// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
-// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
-// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
-function stringToUTF32(str, outPtr) {
- var iChar = 0;
- for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
- // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
- var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
- if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
- var trailSurrogate = str.charCodeAt(++iCodeUnit);
- codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
- }
- HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
- ++iChar;
- }
- // Null-terminate the pointer to the HEAP.
- HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
-}
-Module['stringToUTF32'] = stringToUTF32;
-
-function demangle(func) {
- var i = 3;
- // params, etc.
- var basicTypes = {
- 'v': 'void',
- 'b': 'bool',
- 'c': 'char',
- 's': 'short',
- 'i': 'int',
- 'l': 'long',
- 'f': 'float',
- 'd': 'double',
- 'w': 'wchar_t',
- 'a': 'signed char',
- 'h': 'unsigned char',
- 't': 'unsigned short',
- 'j': 'unsigned int',
- 'm': 'unsigned long',
- 'x': 'long long',
- 'y': 'unsigned long long',
- 'z': '...'
- };
- var subs = [];
- var first = true;
- function dump(x) {
- //return;
- if (x) Module.print(x);
- Module.print(func);
- var pre = '';
- for (var a = 0; a < i; a++) pre += ' ';
- Module.print (pre + '^');
- }
- function parseNested() {
- i++;
- if (func[i] === 'K') i++; // ignore const
- var parts = [];
- while (func[i] !== 'E') {
- if (func[i] === 'S') { // substitution
- i++;
- var next = func.indexOf('_', i);
- var num = func.substring(i, next) || 0;
- parts.push(subs[num] || '?');
- i = next+1;
- continue;
- }
- if (func[i] === 'C') { // constructor
- parts.push(parts[parts.length-1]);
- i += 2;
- continue;
- }
- var size = parseInt(func.substr(i));
- var pre = size.toString().length;
- if (!size || !pre) { i--; break; } // counter i++ below us
- var curr = func.substr(i + pre, size);
- parts.push(curr);
- subs.push(curr);
- i += pre + size;
- }
- i++; // skip E
- return parts;
- }
- function parse(rawList, limit, allowVoid) { // main parser
- limit = limit || Infinity;
- var ret = '', list = [];
- function flushList() {
- return '(' + list.join(', ') + ')';
- }
- var name;
- if (func[i] === 'N') {
- // namespaced N-E
- name = parseNested().join('::');
- limit--;
- if (limit === 0) return rawList ? [name] : name;
- } else {
- // not namespaced
- if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
- var size = parseInt(func.substr(i));
- if (size) {
- var pre = size.toString().length;
- name = func.substr(i + pre, size);
- i += pre + size;
- }
- }
- first = false;
- if (func[i] === 'I') {
- i++;
- var iList = parse(true);
- var iRet = parse(true, 1, true);
- ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
- } else {
- ret = name;
- }
- paramLoop: while (i < func.length && limit-- > 0) {
- //dump('paramLoop');
- var c = func[i++];
- if (c in basicTypes) {
- list.push(basicTypes[c]);
- } else {
- switch (c) {
- case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
- case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
- case 'L': { // literal
- i++; // skip basic type
- var end = func.indexOf('E', i);
- var size = end - i;
- list.push(func.substr(i, size));
- i += size + 2; // size + 'EE'
- break;
- }
- case 'A': { // array
- var size = parseInt(func.substr(i));
- i += size.toString().length;
- if (func[i] !== '_') throw '?';
- i++; // skip _
- list.push(parse(true, 1, true)[0] + ' [' + size + ']');
- break;
- }
- case 'E': break paramLoop;
- default: ret += '?' + c; break paramLoop;
- }
- }
- }
- if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
- if (rawList) {
- if (ret) {
- list.push(ret + '?');
- }
- return list;
- } else {
- return ret + flushList();
- }
- }
- try {
- // Special-case the entry point, since its name differs from other name mangling.
- if (func == 'Object._main' || func == '_main') {
- return 'main()';
- }
- if (typeof func === 'number') func = Pointer_stringify(func);
- if (func[0] !== '_') return func;
- if (func[1] !== '_') return func; // C function
- if (func[2] !== 'Z') return func;
- switch (func[3]) {
- case 'n': return 'operator new()';
- case 'd': return 'operator delete()';
- }
- return parse();
- } catch(e) {
- return func;
- }
-}
-
-function demangleAll(text) {
- return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
-}
-
-function stackTrace() {
- var stack = new Error().stack;
- return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
-}
-
-// Memory management
-
-var PAGE_SIZE = 4096;
-function alignMemoryPage(x) {
- return (x+4095)&-4096;
-}
-
-var HEAP;
-var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
-
-var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
-var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
-var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
-
-function enlargeMemory() {
- abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
-}
-
-var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
-var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
-var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
-
-var totalMemory = 4096;
-while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
- if (totalMemory < 16*1024*1024) {
- totalMemory *= 2;
- } else {
- totalMemory += 16*1024*1024
- }
-}
-if (totalMemory !== TOTAL_MEMORY) {
- Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
- TOTAL_MEMORY = totalMemory;
-}
-
-// Initialize the runtime's memory
-// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
-assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
- 'JS engine does not provide full typed array support');
-
-var buffer = new ArrayBuffer(TOTAL_MEMORY);
-HEAP8 = new Int8Array(buffer);
-HEAP16 = new Int16Array(buffer);
-HEAP32 = new Int32Array(buffer);
-HEAPU8 = new Uint8Array(buffer);
-HEAPU16 = new Uint16Array(buffer);
-HEAPU32 = new Uint32Array(buffer);
-HEAPF32 = new Float32Array(buffer);
-HEAPF64 = new Float64Array(buffer);
-
-// Endianness check (note: assumes compiler arch was little-endian)
-HEAP32[0] = 255;
-assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
-
-Module['HEAP'] = HEAP;
-Module['HEAP8'] = HEAP8;
-Module['HEAP16'] = HEAP16;
-Module['HEAP32'] = HEAP32;
-Module['HEAPU8'] = HEAPU8;
-Module['HEAPU16'] = HEAPU16;
-Module['HEAPU32'] = HEAPU32;
-Module['HEAPF32'] = HEAPF32;
-Module['HEAPF64'] = HEAPF64;
-
-function callRuntimeCallbacks(callbacks) {
- while(callbacks.length > 0) {
- var callback = callbacks.shift();
- if (typeof callback == 'function') {
- callback();
- continue;
- }
- var func = callback.func;
- if (typeof func === 'number') {
- if (callback.arg === undefined) {
- Runtime.dynCall('v', func);
- } else {
- Runtime.dynCall('vi', func, [callback.arg]);
- }
- } else {
- func(callback.arg === undefined ? null : callback.arg);
- }
- }
-}
-
-var __ATPRERUN__ = []; // functions called before the runtime is initialized
-var __ATINIT__ = []; // functions called during startup
-var __ATMAIN__ = []; // functions called when main() is to be run
-var __ATEXIT__ = []; // functions called during shutdown
-var __ATPOSTRUN__ = []; // functions called after the runtime has exited
-
-var runtimeInitialized = false;
-
-function preRun() {
- // compatibility - merge in anything from Module['preRun'] at this time
- if (Module['preRun']) {
- if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
- while (Module['preRun'].length) {
- addOnPreRun(Module['preRun'].shift());
- }
- }
- callRuntimeCallbacks(__ATPRERUN__);
-}
-
-function ensureInitRuntime() {
- if (runtimeInitialized) return;
- runtimeInitialized = true;
- callRuntimeCallbacks(__ATINIT__);
-}
-
-function preMain() {
- callRuntimeCallbacks(__ATMAIN__);
-}
-
-function exitRuntime() {
- callRuntimeCallbacks(__ATEXIT__);
-}
-
-function postRun() {
- // compatibility - merge in anything from Module['postRun'] at this time
- if (Module['postRun']) {
- if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
- while (Module['postRun'].length) {
- addOnPostRun(Module['postRun'].shift());
- }
- }
- callRuntimeCallbacks(__ATPOSTRUN__);
-}
-
-function addOnPreRun(cb) {
- __ATPRERUN__.unshift(cb);
-}
-Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
-
-function addOnInit(cb) {
- __ATINIT__.unshift(cb);
-}
-Module['addOnInit'] = Module.addOnInit = addOnInit;
-
-function addOnPreMain(cb) {
- __ATMAIN__.unshift(cb);
-}
-Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
-
-function addOnExit(cb) {
- __ATEXIT__.unshift(cb);
-}
-Module['addOnExit'] = Module.addOnExit = addOnExit;
-
-function addOnPostRun(cb) {
- __ATPOSTRUN__.unshift(cb);
-}
-Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
-
-// Tools
-
-// This processes a JS string into a C-line array of numbers, 0-terminated.
-// For LLVM-originating strings, see parser.js:parseLLVMString function
-function intArrayFromString(stringy, dontAddNull, length /* optional */) {
- var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
- if (length) {
- ret.length = length;
- }
- if (!dontAddNull) {
- ret.push(0);
- }
- return ret;
-}
-Module['intArrayFromString'] = intArrayFromString;
-
-function intArrayToString(array) {
- var ret = [];
- for (var i = 0; i < array.length; i++) {
- var chr = array[i];
- if (chr > 0xFF) {
- chr &= 0xFF;
- }
- ret.push(String.fromCharCode(chr));
- }
- return ret.join('');
-}
-Module['intArrayToString'] = intArrayToString;
-
-// Write a Javascript array to somewhere in the heap
-function writeStringToMemory(string, buffer, dontAddNull) {
- var array = intArrayFromString(string, dontAddNull);
- var i = 0;
- while (i < array.length) {
- var chr = array[i];
- HEAP8[(((buffer)+(i))|0)]=chr;
- i = i + 1;
- }
-}
-Module['writeStringToMemory'] = writeStringToMemory;
-
-function writeArrayToMemory(array, buffer) {
- for (var i = 0; i < array.length; i++) {
- HEAP8[(((buffer)+(i))|0)]=array[i];
- }
-}
-Module['writeArrayToMemory'] = writeArrayToMemory;
-
-function writeAsciiToMemory(str, buffer, dontAddNull) {
- for (var i = 0; i < str.length; i++) {
- HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
- }
- if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
-}
-Module['writeAsciiToMemory'] = writeAsciiToMemory;
-
-function unSign(value, bits, ignore) {
- if (value >= 0) {
- return value;
- }
- return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
- : Math.pow(2, bits) + value;
-}
-function reSign(value, bits, ignore) {
- if (value <= 0) {
- return value;
- }
- var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
- : Math.pow(2, bits-1);
- if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
- // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
- // TODO: In i64 mode 1, resign the two parts separately and safely
- value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
- }
- return value;
-}
-
-// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
-if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
- var ah = a >>> 16;
- var al = a & 0xffff;
- var bh = b >>> 16;
- var bl = b & 0xffff;
- return (al*bl + ((ah*bl + al*bh) << 16))|0;
-};
-Math.imul = Math['imul'];
-
-
-var Math_abs = Math.abs;
-var Math_cos = Math.cos;
-var Math_sin = Math.sin;
-var Math_tan = Math.tan;
-var Math_acos = Math.acos;
-var Math_asin = Math.asin;
-var Math_atan = Math.atan;
-var Math_atan2 = Math.atan2;
-var Math_exp = Math.exp;
-var Math_log = Math.log;
-var Math_sqrt = Math.sqrt;
-var Math_ceil = Math.ceil;
-var Math_floor = Math.floor;
-var Math_pow = Math.pow;
-var Math_imul = Math.imul;
-var Math_fround = Math.fround;
-var Math_min = Math.min;
-
-// A counter of dependencies for calling run(). If we need to
-// do asynchronous work before running, increment this and
-// decrement it. Incrementing must happen in a place like
-// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
-// Note that you can add dependencies in preRun, even though
-// it happens right before run - run will be postponed until
-// the dependencies are met.
-var runDependencies = 0;
-var runDependencyWatcher = null;
-var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
-
-function addRunDependency(id) {
- runDependencies++;
- if (Module['monitorRunDependencies']) {
- Module['monitorRunDependencies'](runDependencies);
- }
-}
-Module['addRunDependency'] = addRunDependency;
-function removeRunDependency(id) {
- runDependencies--;
- if (Module['monitorRunDependencies']) {
- Module['monitorRunDependencies'](runDependencies);
- }
- if (runDependencies == 0) {
- if (runDependencyWatcher !== null) {
- clearInterval(runDependencyWatcher);
- runDependencyWatcher = null;
- }
- if (dependenciesFulfilled) {
- var callback = dependenciesFulfilled;
- dependenciesFulfilled = null;
- callback(); // can add another dependenciesFulfilled
- }
- }
-}
-Module['removeRunDependency'] = removeRunDependency;
-
-Module["preloadedImages"] = {}; // maps url to image data
-Module["preloadedAudios"] = {}; // maps url to audio data
-
-
-var memoryInitializer = null;
-
-// === Body ===
-var __ZTVN10__cxxabiv117__class_type_infoE = 7024;
-var __ZTVN10__cxxabiv120__si_class_type_infoE = 7064;
-
-
-
-
-STATIC_BASE = 8;
-
-STATICTOP = STATIC_BASE + Runtime.alignMemory(7731);
-/* global initializers */ __ATINIT__.push();
-
-
-/* memory initializer */ allocate([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,232,118,72,0,0,0,0,255,255,255,255,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,101,114,114,111,114,58,32,37,100,92,110,0,0,0,0,0,102,114,97,109,101,32,97,118,101,114,97,103,101,115,58,32,37,46,51,102,32,43,45,32,37,46,51,102,44,32,114,97,110,103,101,58,32,37,46,51,102,32,116,111,32,37,46,51,102,32,10,0,0,0,0,0,105,102,32,40,77,111,100,117,108,101,46,114,101,112,111,114,116,67,111,109,112,108,101,116,105,111,110,41,32,77,111,100,117,108,101,46,114,101,112,111,114,116,67,111,109,112,108,101,116,105,111,110,40,41,0,0,114,101,115,112,111,110,115,105,118,101,32,109,97,105,110,32,108,111,111,112,0,0,0,0,0,0,0,0,56,1,0,0,1,0,0,0,2,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,49,49,98,50,69,100,103,101,83,104,97,112,101,0,0,0,55,98,50,83,104,97,112,101,0,0,0,0,0,0,0,0,120,27,0,0,32,1,0,0,160,27,0,0,16,1,0,0,48,1,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,83,104,97,112,101,115,47,98,50,80,111,108,121,103,111,110,83,104,97,112,101,46,99,112,112,0,0,0,0,0,0,0,48,46,48,102,32,60,61,32,108,111,119,101,114,32,38,38,32,108,111,119,101,114,32,60,61,32,105,110,112,117,116,46,109,97,120,70,114,97,99,116,105,111,110,0,0,0,0,0,82,97,121,67,97,115,116,0,109,95,118,101,114,116,101,120,67,111,117,110,116,32,62,61,32,51,0,0,0,0,0,0,67,111,109,112,117,116,101,77,97,115,115,0,0,0,0,0,97,114,101,97,32,62,32,49,46,49,57,50,48,57,50,57,48,101,45,48,55,70,0,0,0,0,0,0,48,2,0,0,3,0,0,0,4,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,49,52,98,50,80,111,108,121,103,111,110,83,104,97,112,101,0,0,0,0,0,0,0,0,160,27,0,0,24,2,0,0,48,1,0,0,0,0,0,0,16,0,0,0,32,0,0,0,64,0,0,0,96,0,0,0,128,0,0,0,160,0,0,0,192,0,0,0,224,0,0,0,0,1,0,0,64,1,0,0,128,1,0,0,192,1,0,0,0,2,0,0,128,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,106,32,60,32,98,50,95,98,108,111,99,107,83,105,122,101,115,0,0,0,0,0,0,0,66,111,120,50,68,47,67,111,109,109,111,110,47,98,50,66,108,111,99,107,65,108,108,111,99,97,116,111,114,46,99,112,112,0,0,0,0,0,0,0,98,50,66,108,111,99,107,65,108,108,111,99,97,116,111,114,0,0,0,0,0,0,0,0,48,32,60,32,115,105,122,101,0,0,0,0,0,0,0,0,65,108,108,111,99,97,116,101,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,98,50,95,98,108,111,99,107,83,105,122,101,115,0,0,0,0,0,98,108,111,99,107,67,111,117,110,116,32,42,32,98,108,111,99,107,83,105,122,101,32,60,61,32,98,50,95,99,104,117,110,107,83,105,122,101,0,0,70,114,101,101,0,0,0,0,98,100,45,62,112,111,115,105,116,105,111,110,46,73,115,86,97,108,105,100,40,41,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,66,111,100,121,46,99,112,112,0,0,0,0,0,0,0,98,50,66,111,100,121,0,0,98,100,45,62,108,105,110,101,97,114,86,101,108,111,99,105,116,121,46,73,115,86,97,108,105,100,40,41,0,0,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,97,110,103,108,101,41,0,0,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,97,110,103,117,108,97,114,86,101,108,111,99,105,116,121,41,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,97,110,103,117,108,97,114,68,97,109,112,105,110,103,41,32,38,38,32,98,100,45,62,97,110,103,117,108,97,114,68,97,109,112,105,110,103,32,62,61,32,48,46,48,102,0,0,0,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,108,105,110,101,97,114,68,97,109,112,105,110,103,41,32,38,38,32,98,100,45,62,108,105,110,101,97,114,68,97,109,112,105,110,103,32,62,61,32,48,46,48,102,0,0,0,0,0,0,0,109,95,119,111,114,108,100,45,62,73,115,76,111,99,107,101,100,40,41,32,61,61,32,102,97,108,115,101,0,0,0,0,67,114,101,97,116,101,70,105,120,116,117,114,101,0,0,0,109,95,116,121,112,101,32,61,61,32,98,50,95,100,121,110,97,109,105,99,66,111,100,121,0,0,0,0,0,0,0,0,82,101,115,101,116,77,97,115,115,68,97,116,97,0,0,0,109,95,73,32,62,32,48,46,48,102,0,0,0,0,0,0,0,10,0,0,0,0,0,0,240,7,0,0,0,0,0,0,48,32,60,61,32,112,114,111,120,121,73,100,32,38,38,32,112,114,111,120,121,73,100,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,0,0,0,0,0,0,46,47,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,121,110,97,109,105,99,84,114,101,101,46,104,0,0,0,0,0,0,0,71,101,116,85,115,101,114,68,97,116,97,0,0,0,0,0,71,101,116,70,97,116,65,65,66,66,0,0,0,0,0,0,0,0,0,0,32,8,0,0,5,0,0,0,6,0,0,0,1,0,0,0,2,0,0,0,1,0,0,0,2,0,0,0,49,55,98,50,67,111,110,116,97,99,116,76,105,115,116,101,110,101,114,0,0,0,0,0,120,27,0,0,8,8,0,0,109,95,112,114,111,120,121,67,111,117,110,116,32,61,61,32,48,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,70,105,120,116,117,114,101,46,99,112,112,0,0,0,0,67,114,101,97,116,101,80,114,111,120,105,101,115,0,0,0,73,115,76,111,99,107,101,100,40,41,32,61,61,32,102,97,108,115,101,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,87,111,114,108,100,46,99,112,112,0,0,0,0,0,0,67,114,101,97,116,101,66,111,100,121,0,0,0,0,0,0,98,45,62,73,115,65,99,116,105,118,101,40,41,32,61,61,32,116,114,117,101,0,0,0,83,111,108,118,101,0,0,0,115,116,97,99,107,67,111,117,110,116,32,60,32,115,116,97,99,107,83,105,122,101,0,0,116,121,112,101,65,32,61,61,32,98,50,95,100,121,110,97,109,105,99,66,111,100,121,32,124,124,32,116,121,112,101,66,32,61,61,32,98,50,95,100,121,110,97,109,105,99,66,111,100,121,0,0,0,0,0,0,83,111,108,118,101,84,79,73,0,0,0,0,0,0,0,0,97,108,112,104,97,48,32,60,32,49,46,48,102,0,0,0,46,47,66,111,120,50,68,47,67,111,109,109,111,110,47,98,50,77,97,116,104,46,104,0,65,100,118,97,110,99,101,0,109,95,106,111,105,110,116,67,111,117,110,116,32,60,32,109,95,106,111,105,110,116,67,97,112,97,99,105,116,121,0,0,46,47,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,73,115,108,97,110,100,46,104,0,0,0,0,0,65,100,100,0,0,0,0,0,109,95,99,111,110,116,97,99,116,67,111,117,110,116,32,60,32,109,95,99,111,110,116,97,99,116,67,97,112,97,99,105,116,121,0,0,0,0,0,0,109,95,98,111,100,121,67,111,117,110,116,32,60,32,109,95,98,111,100,121,67,97,112,97,99,105,116,121,0,0,0,0,0,0,0,0,40,10,0,0,7,0,0,0,8,0,0,0,3,0,0,0,0,0,0,0,49,53,98,50,67,111,110,116,97,99,116,70,105,108,116,101,114,0,0,0,0,0,0,0,120,27,0,0,16,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,99,104,97,105,110,45,62,109,95,99,111,117,110,116,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,105,115,116,97,110,99,101,46,99,112,112,0,0,83,101,116,0,0,0,0,0,102,97,108,115,101,0,0,0,98,50,68,105,115,116,97,110,99,101,0,0,0,0,0,0,71,101,116,77,101,116,114,105,99,0,0,0,0,0,0,0,71,101,116,87,105,116,110,101,115,115,80,111,105,110,116,115,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,109,95,99,111,117,110,116,0,0,0,46,47,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,105,115,116,97,110,99,101,46,104,0,0,71,101,116,86,101,114,116,101,120,0,0,0,0,0,0,0,71,101,116,67,108,111,115,101,115,116,80,111,105,110,116,0,99,97,99,104,101,45,62,99,111,117,110,116,32,60,61,32,51,0,0,0,0,0,0,0,82,101,97,100,67,97,99,104,101,0,0,0,0,0,0,0,109,95,110,111,100,101,67,111,117,110,116,32,61,61,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,121,110,97,109,105,99,84,114,101,101,46,99,112,112,0,0,0,0,0,0,0,65,108,108,111,99,97,116,101,78,111,100,101,0,0,0,0,48,32,60,61,32,110,111,100,101,73,100,32,38,38,32,110,111,100,101,73,100,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,70,114,101,101,78,111,100,101,0,0,0,0,0,0,0,0,48,32,60,32,109,95,110,111,100,101,67,111,117,110,116,0,48,32,60,61,32,112,114,111,120,121,73,100,32,38,38,32,112,114,111,120,121,73,100,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,0,0,0,0,0,0,109,95,110,111,100,101,115,91,112,114,111,120,121,73,100,93,46,73,115,76,101,97,102,40,41,0,0,0,0,0,0,0,77,111,118,101,80,114,111,120,121,0,0,0,0,0,0,0,99,104,105,108,100,49,32,33,61,32,40,45,49,41,0,0,73,110,115,101,114,116,76,101,97,102,0,0,0,0,0,0,99,104,105,108,100,50,32,33,61,32,40,45,49,41,0,0,105,65,32,33,61,32,40,45,49,41,0,0,0,0,0,0,66,97,108,97,110,99,101,0,48,32,60,61,32,105,66,32,38,38,32,105,66,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,67,32,38,38,32,105,67,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,70,32,38,38,32,105,70,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,71,32,38,38,32,105,71,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,109,95,110,111,100,101,115,91,67,45,62,112,97,114,101,110,116,93,46,99,104,105,108,100,50,32,61,61,32,105,65,0,48,32,60,61,32,105,68,32,38,38,32,105,68,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,69,32,38,38,32,105,69,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,109,95,110,111,100,101,115,91,66,45,62,112,97,114,101,110,116,93,46,99,104,105,108,100,50,32,61,61,32,105,65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,116,97,114,103,101,116,32,62,32,116,111,108,101,114,97,110,99,101,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,84,105,109,101,79,102,73,109,112,97,99,116,46,99,112,112,0,0,0,0,0,0,98,50,84,105,109,101,79,102,73,109,112,97,99,116,0,0,102,97,108,115,101,0,0,0,69,118,97,108,117,97,116,101,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,109,95,99,111,117,110,116,0,0,0,46,47,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,105,115,116,97,110,99,101,46,104,0,0,71,101,116,86,101,114,116,101,120,0,0,0,0,0,0,0,70,105,110,100,77,105,110,83,101,112,97,114,97,116,105,111,110,0,0,0,0,0,0,0,48,32,60,32,99,111,117,110,116,32,38,38,32,99,111,117,110,116,32,60,32,51,0,0,73,110,105,116,105,97,108,105,122,101,0,0,0,0,0,0,0,0,0,0,0,0,0,0,109,95,105,110,100,101,120,32,61,61,32,48,0,0,0,0,66,111,120,50,68,47,67,111,109,109,111,110,47,98,50,83,116,97,99,107,65,108,108,111,99,97,116,111,114,46,99,112,112,0,0,0,0,0,0,0,126,98,50,83,116,97,99,107,65,108,108,111,99,97,116,111,114,0,0,0,0,0,0,0,109,95,101,110,116,114,121,67,111,117,110,116,32,61,61,32,48,0,0,0,0,0,0,0,109,95,101,110,116,114,121,67,111,117,110,116,32,60,32,98,50,95,109,97,120,83,116,97,99,107,69,110,116,114,105,101,115,0,0,0,0,0,0,0,65,108,108,111,99,97,116,101,0,0,0,0,0,0,0,0,109,95,101,110,116,114,121,67,111,117,110,116,32,62,32,48,0,0,0,0,0,0,0,0,70,114,101,101,0,0,0,0,112,32,61,61,32,101,110,116,114,121,45,62,100,97,116,97,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,32,60,61,32,116,121,112,101,49,32,38,38,32,116,121,112,101,49,32,60,32,98,50,83,104,97,112,101,58,58,101,95,116,121,112,101,67,111,117,110,116,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,111,110,116,97,99,116,46,99,112,112,0,0,0,48,32,60,61,32,116,121,112,101,50,32,38,38,32,116,121,112,101,50,32,60,32,98,50,83,104,97,112,101,58,58,101,95,116,121,112,101,67,111,117,110,116,0,0,0,0,0,0,67,114,101,97,116,101,0,0,115,95,105,110,105,116,105,97,108,105,122,101,100,32,61,61,32,116,114,117,101,0,0,0,68,101,115,116,114,111,121,0,48,32,60,61,32,116,121,112,101,65,32,38,38,32,116,121,112,101,66,32,60,32,98,50,83,104,97,112,101,58,58,101,95,116,121,112,101,67,111,117,110,116,0,0,0,0,0,0,0,0,0,0,120,17,0,0,1,0,0,0,9,0,0,0,10,0,0,0,0,0,0,0,57,98,50,67,111,110,116,97,99,116,0,0,0,0,0,0,120,27,0,0,104,17,0,0,0,0,0,0,104,18,0,0,3,0,0,0,11,0,0,0,12,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,101,100,103,101,0,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,69,100,103,101,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,0,98,50,69,100,103,101,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,50,50,98,50,69,100,103,101,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,0,160,27,0,0,72,18,0,0,120,17,0,0,0,0,0,0,0,0,0,0,96,19,0,0,4,0,0,0,13,0,0,0,14,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,101,100,103,101,0,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,69,100,103,101,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,98,50,69,100,103,101,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,50,51,98,50,69,100,103,101,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,0,160,27,0,0,64,19,0,0,120,17,0,0,0,0,0,0,0,0,0,0,96,20,0,0,5,0,0,0,15,0,0,0,16,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,80,111,108,121,103,111,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,98,50,80,111,108,121,103,111,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,50,53,98,50,80,111,108,121,103,111,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,160,27,0,0,64,20,0,0,120,17,0,0,0,0,0,0,0,0,0,0,72,21,0,0,6,0,0,0,17,0,0,0,18,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,80,111,108,121,103,111,110,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,98,50,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,49,54,98,50,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,160,27,0,0,48,21,0,0,120,17,0,0,0,0,0,0,116,111,105,73,110,100,101,120,65,32,60,32,109,95,98,111,100,121,67,111,117,110,116,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,73,115,108,97,110,100,46,99,112,112,0,0,0,0,0,83,111,108,118,101,84,79,73,0,0,0,0,0,0,0,0,116,111,105,73,110,100,101,120,66,32,60,32,109,95,98,111,100,121,67,111,117,110,116,0,100,101,110,32,62,32,48,46,48,102,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,67,111,108,108,105,100,101,69,100,103,101,46,99,112,112,0,0,0,0,0,0,0,98,50,67,111,108,108,105,100,101,69,100,103,101,65,110,100,67,105,114,99,108,101,0,0,48,32,60,61,32,101,100,103,101,49,32,38,38,32,101,100,103,101,49,32,60,32,112,111,108,121,49,45,62,109,95,118,101,114,116,101,120,67,111,117,110,116,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,67,111,108,108,105,100,101,80,111,108,121,103,111,110,46,99,112,112,0,0,0,0,98,50,70,105,110,100,73,110,99,105,100,101,110,116,69,100,103,101,0,0,0,0,0,0,98,50,69,100,103,101,83,101,112,97,114,97,116,105,111,110,0,0,0,0,0,0,0,0,0,0,0,0,120,23,0,0,7,0,0,0,19,0,0,0,20,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,104,97,105,110,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,104,97,105,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,98,50,67,104,97,105,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,50,51,98,50,67,104,97,105,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,160,27,0,0,88,23,0,0,120,17,0,0,0,0,0,0,0,0,0,0,120,24,0,0,8,0,0,0,21,0,0,0,22,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,104,97,105,110,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,104,97,105,110,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,98,50,67,104,97,105,110,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,50,52,98,50,67,104,97,105,110,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,160,27,0,0,88,24,0,0,120,17,0,0,0,0,0,0,0,0,0,0,88,25,0,0,9,0,0,0,23,0,0,0,24,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,98,50,67,105,114,99,108,101,67,111,110,116,97,99,116,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,49,53,98,50,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,160,27,0,0,64,25,0,0,120,17,0,0,0,0,0,0,112,111,105,110,116,67,111,117,110,116,32,62,32,48,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,111,110,116,97,99,116,83,111,108,118,101,114,46,99,112,112,0,0,0,0,0,98,50,67,111,110,116,97,99,116,83,111,108,118,101,114,0,109,97,110,105,102,111,108,100,45,62,112,111,105,110,116,67,111,117,110,116,32,62,32,48,0,0,0,0,0,0,0,0,73,110,105,116,105,97,108,105,122,101,86,101,108,111,99,105,116,121,67,111,110,115,116,114,97,105,110,116,115,0,0,0,112,111,105,110,116,67,111,117,110,116,32,61,61,32,49,32,124,124,32,112,111,105,110,116,67,111,117,110,116,32,61,61,32,50,0,0,0,0,0,0,83,111,108,118,101,86,101,108,111,99,105,116,121,67,111,110,115,116,114,97,105,110,116,115,0,0,0,0,0,0,0,0,97,46,120,32,62,61,32,48,46,48,102,32,38,38,32,97,46,121,32,62,61,32,48,46,48,102,0,0,0,0,0,0,112,99,45,62,112,111,105,110,116,67,111,117,110,116,32,62,32,48,0,0,0,0,0,0,73,110,105,116,105,97,108,105,122,101,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,83,104,97,112,101,115,47,98,50,67,104,97,105,110,83,104,97,112,101,46,99,112,112,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,109,95,99,111,117,110,116,32,45,32,49,0,0,0,0,0,0,0,71,101,116,67,104,105,108,100,69,100,103,101,0,0,0,0,83,116,57,116,121,112,101,95,105,110,102,111,0,0,0,0,120,27,0,0,232,26,0,0,78,49,48,95,95,99,120,120,97,98,105,118,49,49,54,95,95,115,104,105,109,95,116,121,112,101,95,105,110,102,111,69,0,0,0,0,0,0,0,0,160,27,0,0,0,27,0,0,248,26,0,0,0,0,0,0,78,49,48,95,95,99,120,120,97,98,105,118,49,49,55,95,95,99,108,97,115,115,95,116,121,112,101,95,105,110,102,111,69,0,0,0,0,0,0,0,160,27,0,0,56,27,0,0,40,27,0,0,0,0,0,0,0,0,0,0,96,27,0,0,25,0,0,0,26,0,0,0,27,0,0,0,28,0,0,0,4,0,0,0,1,0,0,0,1,0,0,0,10,0,0,0,0,0,0,0,232,27,0,0,25,0,0,0,29,0,0,0,27,0,0,0,28,0,0,0,4,0,0,0,2,0,0,0,2,0,0,0,11,0,0,0,78,49,48,95,95,99,120,120,97,98,105,118,49,50,48,95,95,115,105,95,99,108,97,115,115,95,116,121,112,101,95,105,110,102,111,69,0,0,0,0,160,27,0,0,192,27,0,0,96,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,40,30,0,0,30,0,0,0,31,0,0,0,3,0,0,0,0,0,0,0,115,116,100,58,58,98,97,100,95,97,108,108,111,99,0,0,83,116,57,98,97,100,95,97,108,108,111,99,0,0,0,0,160,27,0,0,24,30,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
-
-
-
-
-var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
-
-assert(tempDoublePtr % 8 == 0);
-
-function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
-
- HEAP8[tempDoublePtr] = HEAP8[ptr];
-
- HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
-
- HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
-
- HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
-
-}
-
-function copyTempDouble(ptr) {
-
- HEAP8[tempDoublePtr] = HEAP8[ptr];
-
- HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
-
- HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
-
- HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
-
- HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
-
- HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
-
- HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
-
- HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
-
-}
-
-
- function _emscripten_set_main_loop(func, fps, simulateInfiniteLoop, arg) {
- Module['noExitRuntime'] = true;
-
- Browser.mainLoop.runner = function Browser_mainLoop_runner() {
- if (ABORT) return;
- if (Browser.mainLoop.queue.length > 0) {
- var start = Date.now();
- var blocker = Browser.mainLoop.queue.shift();
- blocker.func(blocker.arg);
- if (Browser.mainLoop.remainingBlockers) {
- var remaining = Browser.mainLoop.remainingBlockers;
- var next = remaining%1 == 0 ? remaining-1 : Math.floor(remaining);
- if (blocker.counted) {
- Browser.mainLoop.remainingBlockers = next;
- } else {
- // not counted, but move the progress along a tiny bit
- next = next + 0.5; // do not steal all the next one's progress
- Browser.mainLoop.remainingBlockers = (8*remaining + next)/9;
- }
- }
- console.log('main loop blocker "' + blocker.name + '" took ' + (Date.now() - start) + ' ms'); //, left: ' + Browser.mainLoop.remainingBlockers);
- Browser.mainLoop.updateStatus();
- setTimeout(Browser.mainLoop.runner, 0);
- return;
- }
- if (Browser.mainLoop.shouldPause) {
- // catch pauses from non-main loop sources
- Browser.mainLoop.paused = true;
- Browser.mainLoop.shouldPause = false;
- return;
- }
-
- // Signal GL rendering layer that processing of a new frame is about to start. This helps it optimize
- // VBO double-buffering and reduce GPU stalls.
-
- if (Browser.mainLoop.method === 'timeout' && Module.ctx) {
- Module.printErr('Looks like you are rendering without using requestAnimationFrame for the main loop. You should use 0 for the frame rate in emscripten_set_main_loop in order to use requestAnimationFrame, as that can greatly improve your frame rates!');
- Browser.mainLoop.method = ''; // just warn once per call to set main loop
- }
-
- if (Module['preMainLoop']) {
- Module['preMainLoop']();
- }
-
- try {
- if (typeof arg !== 'undefined') {
- Runtime.dynCall('vi', func, [arg]);
- } else {
- Runtime.dynCall('v', func);
- }
- } catch (e) {
- if (e instanceof ExitStatus) {
- return;
- } else {
- if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
- throw e;
- }
- }
-
- if (Module['postMainLoop']) {
- Module['postMainLoop']();
- }
-
- if (Browser.mainLoop.shouldPause) {
- // catch pauses from the main loop itself
- Browser.mainLoop.paused = true;
- Browser.mainLoop.shouldPause = false;
- return;
- }
- Browser.mainLoop.scheduler();
- }
- if (fps && fps > 0) {
- Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler() {
- setTimeout(Browser.mainLoop.runner, 1000/fps); // doing this each time means that on exception, we stop
- };
- Browser.mainLoop.method = 'timeout';
- } else {
- Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler() {
- Browser.requestAnimationFrame(Browser.mainLoop.runner);
- };
- Browser.mainLoop.method = 'rAF';
- }
- Browser.mainLoop.scheduler();
-
- if (simulateInfiniteLoop) {
- throw 'SimulateInfiniteLoop';
- }
- }
-
- var _cosf=Math_cos;
-
- function ___cxa_pure_virtual() {
- ABORT = true;
- throw 'Pure virtual function called!';
- }
-
- function _time(ptr) {
- var ret = Math.floor(Date.now()/1000);
- if (ptr) {
- HEAP32[((ptr)>>2)]=ret;
- }
- return ret;
- }
-
- function ___assert_fail(condition, filename, line, func) {
- ABORT = true;
- throw 'Assertion failed: ' + Pointer_stringify(condition) + ', at: ' + [filename ? Pointer_stringify(filename) : 'unknown filename', line, func ? Pointer_stringify(func) : 'unknown function'] + ' at ' + stackTrace();
- }
-
-
- function __ZSt18uncaught_exceptionv() { // std::uncaught_exception()
- return !!__ZSt18uncaught_exceptionv.uncaught_exception;
- }
-
-
-
- function ___cxa_is_number_type(type) {
- var isNumber = false;
- try { if (type == __ZTIi) isNumber = true } catch(e){}
- try { if (type == __ZTIj) isNumber = true } catch(e){}
- try { if (type == __ZTIl) isNumber = true } catch(e){}
- try { if (type == __ZTIm) isNumber = true } catch(e){}
- try { if (type == __ZTIx) isNumber = true } catch(e){}
- try { if (type == __ZTIy) isNumber = true } catch(e){}
- try { if (type == __ZTIf) isNumber = true } catch(e){}
- try { if (type == __ZTId) isNumber = true } catch(e){}
- try { if (type == __ZTIe) isNumber = true } catch(e){}
- try { if (type == __ZTIc) isNumber = true } catch(e){}
- try { if (type == __ZTIa) isNumber = true } catch(e){}
- try { if (type == __ZTIh) isNumber = true } catch(e){}
- try { if (type == __ZTIs) isNumber = true } catch(e){}
- try { if (type == __ZTIt) isNumber = true } catch(e){}
- return isNumber;
- }function ___cxa_does_inherit(definiteType, possibilityType, possibility) {
- if (possibility == 0) return false;
- if (possibilityType == 0 || possibilityType == definiteType)
- return true;
- var possibility_type_info;
- if (___cxa_is_number_type(possibilityType)) {
- possibility_type_info = possibilityType;
- } else {
- var possibility_type_infoAddr = HEAP32[((possibilityType)>>2)] - 8;
- possibility_type_info = HEAP32[((possibility_type_infoAddr)>>2)];
- }
- switch (possibility_type_info) {
- case 0: // possibility is a pointer
- // See if definite type is a pointer
- var definite_type_infoAddr = HEAP32[((definiteType)>>2)] - 8;
- var definite_type_info = HEAP32[((definite_type_infoAddr)>>2)];
- if (definite_type_info == 0) {
- // Also a pointer; compare base types of pointers
- var defPointerBaseAddr = definiteType+8;
- var defPointerBaseType = HEAP32[((defPointerBaseAddr)>>2)];
- var possPointerBaseAddr = possibilityType+8;
- var possPointerBaseType = HEAP32[((possPointerBaseAddr)>>2)];
- return ___cxa_does_inherit(defPointerBaseType, possPointerBaseType, possibility);
- } else
- return false; // one pointer and one non-pointer
- case 1: // class with no base class
- return false;
- case 2: // class with base class
- var parentTypeAddr = possibilityType + 8;
- var parentType = HEAP32[((parentTypeAddr)>>2)];
- return ___cxa_does_inherit(definiteType, parentType, possibility);
- default:
- return false; // some unencountered type
- }
- }
-
-
-
- var ___cxa_last_thrown_exception=0;function ___resumeException(ptr) {
- if (!___cxa_last_thrown_exception) { ___cxa_last_thrown_exception = ptr; }
- throw ptr + " - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.";
- }
-
- var ___cxa_exception_header_size=8;function ___cxa_find_matching_catch(thrown, throwntype) {
- if (thrown == -1) thrown = ___cxa_last_thrown_exception;
- header = thrown - ___cxa_exception_header_size;
- if (throwntype == -1) throwntype = HEAP32[((header)>>2)];
- var typeArray = Array.prototype.slice.call(arguments, 2);
-
- // If throwntype is a pointer, this means a pointer has been
- // thrown. When a pointer is thrown, actually what's thrown
- // is a pointer to the pointer. We'll dereference it.
- if (throwntype != 0 && !___cxa_is_number_type(throwntype)) {
- var throwntypeInfoAddr= HEAP32[((throwntype)>>2)] - 8;
- var throwntypeInfo= HEAP32[((throwntypeInfoAddr)>>2)];
- if (throwntypeInfo == 0)
- thrown = HEAP32[((thrown)>>2)];
- }
- // The different catch blocks are denoted by different types.
- // Due to inheritance, those types may not precisely match the
- // type of the thrown object. Find one which matches, and
- // return the type of the catch block which should be called.
- for (var i = 0; i < typeArray.length; i++) {
- if (___cxa_does_inherit(typeArray[i], throwntype, thrown))
- return ((asm["setTempRet0"](typeArray[i]),thrown)|0);
- }
- // Shouldn't happen unless we have bogus data in typeArray
- // or encounter a type for which emscripten doesn't have suitable
- // typeinfo defined. Best-efforts match just in case.
- return ((asm["setTempRet0"](throwntype),thrown)|0);
- }function ___cxa_throw(ptr, type, destructor) {
- if (!___cxa_throw.initialized) {
- try {
- HEAP32[((__ZTVN10__cxxabiv119__pointer_type_infoE)>>2)]=0; // Workaround for libcxxabi integration bug
- } catch(e){}
- try {
- HEAP32[((__ZTVN10__cxxabiv117__class_type_infoE)>>2)]=1; // Workaround for libcxxabi integration bug
- } catch(e){}
- try {
- HEAP32[((__ZTVN10__cxxabiv120__si_class_type_infoE)>>2)]=2; // Workaround for libcxxabi integration bug
- } catch(e){}
- ___cxa_throw.initialized = true;
- }
- var header = ptr - ___cxa_exception_header_size;
- HEAP32[((header)>>2)]=type;
- HEAP32[(((header)+(4))>>2)]=destructor;
- ___cxa_last_thrown_exception = ptr;
- if (!("uncaught_exception" in __ZSt18uncaught_exceptionv)) {
- __ZSt18uncaught_exceptionv.uncaught_exception = 1;
- } else {
- __ZSt18uncaught_exceptionv.uncaught_exception++;
- }
- throw ptr + " - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.";
- }
-
-
- Module["_memset"] = _memset;
-
-
-
- function __exit(status) {
- // void _exit(int status);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/exit.html
- Module['exit'](status);
- }function _exit(status) {
- __exit(status);
- }function __ZSt9terminatev() {
- _exit(-1234);
- }
-
- function _abort() {
- Module['abort']();
- }
-
-
-
-
-
- var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
-
- var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
-
-
- var ___errno_state=0;function ___setErrNo(value) {
- // For convenient setting and returning of errno.
- HEAP32[((___errno_state)>>2)]=value;
- return value;
- }
-
- var PATH={splitPath:function (filename) {
- var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
- return splitPathRe.exec(filename).slice(1);
- },normalizeArray:function (parts, allowAboveRoot) {
- // if the path tries to go above the root, `up` ends up > 0
- var up = 0;
- for (var i = parts.length - 1; i >= 0; i--) {
- var last = parts[i];
- if (last === '.') {
- parts.splice(i, 1);
- } else if (last === '..') {
- parts.splice(i, 1);
- up++;
- } else if (up) {
- parts.splice(i, 1);
- up--;
- }
- }
- // if the path is allowed to go above the root, restore leading ..s
- if (allowAboveRoot) {
- for (; up--; up) {
- parts.unshift('..');
- }
- }
- return parts;
- },normalize:function (path) {
- var isAbsolute = path.charAt(0) === '/',
- trailingSlash = path.substr(-1) === '/';
- // Normalize the path
- path = PATH.normalizeArray(path.split('/').filter(function(p) {
- return !!p;
- }), !isAbsolute).join('/');
- if (!path && !isAbsolute) {
- path = '.';
- }
- if (path && trailingSlash) {
- path += '/';
- }
- return (isAbsolute ? '/' : '') + path;
- },dirname:function (path) {
- var result = PATH.splitPath(path),
- root = result[0],
- dir = result[1];
- if (!root && !dir) {
- // No dirname whatsoever
- return '.';
- }
- if (dir) {
- // It has a dirname, strip trailing slash
- dir = dir.substr(0, dir.length - 1);
- }
- return root + dir;
- },basename:function (path) {
- // EMSCRIPTEN return '/'' for '/', not an empty string
- if (path === '/') return '/';
- var lastSlash = path.lastIndexOf('/');
- if (lastSlash === -1) return path;
- return path.substr(lastSlash+1);
- },extname:function (path) {
- return PATH.splitPath(path)[3];
- },join:function () {
- var paths = Array.prototype.slice.call(arguments, 0);
- return PATH.normalize(paths.join('/'));
- },join2:function (l, r) {
- return PATH.normalize(l + '/' + r);
- },resolve:function () {
- var resolvedPath = '',
- resolvedAbsolute = false;
- for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
- var path = (i >= 0) ? arguments[i] : FS.cwd();
- // Skip empty and invalid entries
- if (typeof path !== 'string') {
- throw new TypeError('Arguments to path.resolve must be strings');
- } else if (!path) {
- continue;
- }
- resolvedPath = path + '/' + resolvedPath;
- resolvedAbsolute = path.charAt(0) === '/';
- }
- // At this point the path should be resolved to a full absolute path, but
- // handle relative paths to be safe (might happen when process.cwd() fails)
- resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
- return !!p;
- }), !resolvedAbsolute).join('/');
- return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
- },relative:function (from, to) {
- from = PATH.resolve(from).substr(1);
- to = PATH.resolve(to).substr(1);
- function trim(arr) {
- var start = 0;
- for (; start < arr.length; start++) {
- if (arr[start] !== '') break;
- }
- var end = arr.length - 1;
- for (; end >= 0; end--) {
- if (arr[end] !== '') break;
- }
- if (start > end) return [];
- return arr.slice(start, end - start + 1);
- }
- var fromParts = trim(from.split('/'));
- var toParts = trim(to.split('/'));
- var length = Math.min(fromParts.length, toParts.length);
- var samePartsLength = length;
- for (var i = 0; i < length; i++) {
- if (fromParts[i] !== toParts[i]) {
- samePartsLength = i;
- break;
- }
- }
- var outputParts = [];
- for (var i = samePartsLength; i < fromParts.length; i++) {
- outputParts.push('..');
- }
- outputParts = outputParts.concat(toParts.slice(samePartsLength));
- return outputParts.join('/');
- }};
-
- var TTY={ttys:[],init:function () {
- // https://github.com/kripken/emscripten/pull/1555
- // if (ENVIRONMENT_IS_NODE) {
- // // currently, FS.init does not distinguish if process.stdin is a file or TTY
- // // device, it always assumes it's a TTY device. because of this, we're forcing
- // // process.stdin to UTF8 encoding to at least make stdin reading compatible
- // // with text files until FS.init can be refactored.
- // process['stdin']['setEncoding']('utf8');
- // }
- },shutdown:function () {
- // https://github.com/kripken/emscripten/pull/1555
- // if (ENVIRONMENT_IS_NODE) {
- // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
- // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
- // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
- // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
- // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
- // process['stdin']['pause']();
- // }
- },register:function (dev, ops) {
- TTY.ttys[dev] = { input: [], output: [], ops: ops };
- FS.registerDevice(dev, TTY.stream_ops);
- },stream_ops:{open:function (stream) {
- var tty = TTY.ttys[stream.node.rdev];
- if (!tty) {
- throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
- }
- stream.tty = tty;
- stream.seekable = false;
- },close:function (stream) {
- // flush any pending line data
- if (stream.tty.output.length) {
- stream.tty.ops.put_char(stream.tty, 10);
- }
- },read:function (stream, buffer, offset, length, pos /* ignored */) {
- if (!stream.tty || !stream.tty.ops.get_char) {
- throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
- }
- var bytesRead = 0;
- for (var i = 0; i < length; i++) {
- var result;
- try {
- result = stream.tty.ops.get_char(stream.tty);
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EIO);
- }
- if (result === undefined && bytesRead === 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
- }
- if (result === null || result === undefined) break;
- bytesRead++;
- buffer[offset+i] = result;
- }
- if (bytesRead) {
- stream.node.timestamp = Date.now();
- }
- return bytesRead;
- },write:function (stream, buffer, offset, length, pos) {
- if (!stream.tty || !stream.tty.ops.put_char) {
- throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
- }
- for (var i = 0; i < length; i++) {
- try {
- stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EIO);
- }
- }
- if (length) {
- stream.node.timestamp = Date.now();
- }
- return i;
- }},default_tty_ops:{get_char:function (tty) {
- if (!tty.input.length) {
- var result = null;
- if (ENVIRONMENT_IS_NODE) {
- result = process['stdin']['read']();
- if (!result) {
- if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
- return null; // EOF
- }
- return undefined; // no data available
- }
- } else if (typeof window != 'undefined' &&
- typeof window.prompt == 'function') {
- // Browser.
- result = window.prompt('Input: '); // returns null on cancel
- if (result !== null) {
- result += '\n';
- }
- } else if (typeof readline == 'function') {
- // Command line.
- result = readline();
- if (result !== null) {
- result += '\n';
- }
- }
- if (!result) {
- return null;
- }
- tty.input = intArrayFromString(result, true);
- }
- return tty.input.shift();
- },put_char:function (tty, val) {
- if (val === null || val === 10) {
- Module['print'](tty.output.join(''));
- tty.output = [];
- } else {
- tty.output.push(TTY.utf8.processCChar(val));
- }
- }},default_tty1_ops:{put_char:function (tty, val) {
- if (val === null || val === 10) {
- Module['printErr'](tty.output.join(''));
- tty.output = [];
- } else {
- tty.output.push(TTY.utf8.processCChar(val));
- }
- }}};
-
- var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
- return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
- },createNode:function (parent, name, mode, dev) {
- if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
- // no supported
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- if (!MEMFS.ops_table) {
- MEMFS.ops_table = {
- dir: {
- node: {
- getattr: MEMFS.node_ops.getattr,
- setattr: MEMFS.node_ops.setattr,
- lookup: MEMFS.node_ops.lookup,
- mknod: MEMFS.node_ops.mknod,
- rename: MEMFS.node_ops.rename,
- unlink: MEMFS.node_ops.unlink,
- rmdir: MEMFS.node_ops.rmdir,
- readdir: MEMFS.node_ops.readdir,
- symlink: MEMFS.node_ops.symlink
- },
- stream: {
- llseek: MEMFS.stream_ops.llseek
- }
- },
- file: {
- node: {
- getattr: MEMFS.node_ops.getattr,
- setattr: MEMFS.node_ops.setattr
- },
- stream: {
- llseek: MEMFS.stream_ops.llseek,
- read: MEMFS.stream_ops.read,
- write: MEMFS.stream_ops.write,
- allocate: MEMFS.stream_ops.allocate,
- mmap: MEMFS.stream_ops.mmap
- }
- },
- link: {
- node: {
- getattr: MEMFS.node_ops.getattr,
- setattr: MEMFS.node_ops.setattr,
- readlink: MEMFS.node_ops.readlink
- },
- stream: {}
- },
- chrdev: {
- node: {
- getattr: MEMFS.node_ops.getattr,
- setattr: MEMFS.node_ops.setattr
- },
- stream: FS.chrdev_stream_ops
- },
- };
- }
- var node = FS.createNode(parent, name, mode, dev);
- if (FS.isDir(node.mode)) {
- node.node_ops = MEMFS.ops_table.dir.node;
- node.stream_ops = MEMFS.ops_table.dir.stream;
- node.contents = {};
- } else if (FS.isFile(node.mode)) {
- node.node_ops = MEMFS.ops_table.file.node;
- node.stream_ops = MEMFS.ops_table.file.stream;
- node.contents = [];
- node.contentMode = MEMFS.CONTENT_FLEXIBLE;
- } else if (FS.isLink(node.mode)) {
- node.node_ops = MEMFS.ops_table.link.node;
- node.stream_ops = MEMFS.ops_table.link.stream;
- } else if (FS.isChrdev(node.mode)) {
- node.node_ops = MEMFS.ops_table.chrdev.node;
- node.stream_ops = MEMFS.ops_table.chrdev.stream;
- }
- node.timestamp = Date.now();
- // add the new node to the parent
- if (parent) {
- parent.contents[name] = node;
- }
- return node;
- },ensureFlexible:function (node) {
- if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
- var contents = node.contents;
- node.contents = Array.prototype.slice.call(contents);
- node.contentMode = MEMFS.CONTENT_FLEXIBLE;
- }
- },node_ops:{getattr:function (node) {
- var attr = {};
- // device numbers reuse inode numbers.
- attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
- attr.ino = node.id;
- attr.mode = node.mode;
- attr.nlink = 1;
- attr.uid = 0;
- attr.gid = 0;
- attr.rdev = node.rdev;
- if (FS.isDir(node.mode)) {
- attr.size = 4096;
- } else if (FS.isFile(node.mode)) {
- attr.size = node.contents.length;
- } else if (FS.isLink(node.mode)) {
- attr.size = node.link.length;
- } else {
- attr.size = 0;
- }
- attr.atime = new Date(node.timestamp);
- attr.mtime = new Date(node.timestamp);
- attr.ctime = new Date(node.timestamp);
- // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
- // but this is not required by the standard.
- attr.blksize = 4096;
- attr.blocks = Math.ceil(attr.size / attr.blksize);
- return attr;
- },setattr:function (node, attr) {
- if (attr.mode !== undefined) {
- node.mode = attr.mode;
- }
- if (attr.timestamp !== undefined) {
- node.timestamp = attr.timestamp;
- }
- if (attr.size !== undefined) {
- MEMFS.ensureFlexible(node);
- var contents = node.contents;
- if (attr.size < contents.length) contents.length = attr.size;
- else while (attr.size > contents.length) contents.push(0);
- }
- },lookup:function (parent, name) {
- throw FS.genericErrors[ERRNO_CODES.ENOENT];
- },mknod:function (parent, name, mode, dev) {
- return MEMFS.createNode(parent, name, mode, dev);
- },rename:function (old_node, new_dir, new_name) {
- // if we're overwriting a directory at new_name, make sure it's empty.
- if (FS.isDir(old_node.mode)) {
- var new_node;
- try {
- new_node = FS.lookupNode(new_dir, new_name);
- } catch (e) {
- }
- if (new_node) {
- for (var i in new_node.contents) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
- }
- }
- }
- // do the internal rewiring
- delete old_node.parent.contents[old_node.name];
- old_node.name = new_name;
- new_dir.contents[new_name] = old_node;
- old_node.parent = new_dir;
- },unlink:function (parent, name) {
- delete parent.contents[name];
- },rmdir:function (parent, name) {
- var node = FS.lookupNode(parent, name);
- for (var i in node.contents) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
- }
- delete parent.contents[name];
- },readdir:function (node) {
- var entries = ['.', '..']
- for (var key in node.contents) {
- if (!node.contents.hasOwnProperty(key)) {
- continue;
- }
- entries.push(key);
- }
- return entries;
- },symlink:function (parent, newname, oldpath) {
- var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
- node.link = oldpath;
- return node;
- },readlink:function (node) {
- if (!FS.isLink(node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- return node.link;
- }},stream_ops:{read:function (stream, buffer, offset, length, position) {
- var contents = stream.node.contents;
- if (position >= contents.length)
- return 0;
- var size = Math.min(contents.length - position, length);
- assert(size >= 0);
- if (size > 8 && contents.subarray) { // non-trivial, and typed array
- buffer.set(contents.subarray(position, position + size), offset);
- } else
- {
- for (var i = 0; i < size; i++) {
- buffer[offset + i] = contents[position + i];
- }
- }
- return size;
- },write:function (stream, buffer, offset, length, position, canOwn) {
- var node = stream.node;
- node.timestamp = Date.now();
- var contents = node.contents;
- if (length && contents.length === 0 && position === 0 && buffer.subarray) {
- // just replace it with the new data
- if (canOwn && offset === 0) {
- node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
- node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
- } else {
- node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
- node.contentMode = MEMFS.CONTENT_FIXED;
- }
- return length;
- }
- MEMFS.ensureFlexible(node);
- var contents = node.contents;
- while (contents.length < position) contents.push(0);
- for (var i = 0; i < length; i++) {
- contents[position + i] = buffer[offset + i];
- }
- return length;
- },llseek:function (stream, offset, whence) {
- var position = offset;
- if (whence === 1) { // SEEK_CUR.
- position += stream.position;
- } else if (whence === 2) { // SEEK_END.
- if (FS.isFile(stream.node.mode)) {
- position += stream.node.contents.length;
- }
- }
- if (position < 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- stream.ungotten = [];
- stream.position = position;
- return position;
- },allocate:function (stream, offset, length) {
- MEMFS.ensureFlexible(stream.node);
- var contents = stream.node.contents;
- var limit = offset + length;
- while (limit > contents.length) contents.push(0);
- },mmap:function (stream, buffer, offset, length, position, prot, flags) {
- if (!FS.isFile(stream.node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
- }
- var ptr;
- var allocated;
- var contents = stream.node.contents;
- // Only make a new copy when MAP_PRIVATE is specified.
- if ( !(flags & 2) &&
- (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
- // We can't emulate MAP_SHARED when the file is not backed by the buffer
- // we're mapping to (e.g. the HEAP buffer).
- allocated = false;
- ptr = contents.byteOffset;
- } else {
- // Try to avoid unnecessary slices.
- if (position > 0 || position + length < contents.length) {
- if (contents.subarray) {
- contents = contents.subarray(position, position + length);
- } else {
- contents = Array.prototype.slice.call(contents, position, position + length);
- }
- }
- allocated = true;
- ptr = _malloc(length);
- if (!ptr) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
- }
- buffer.set(contents, ptr);
- }
- return { ptr: ptr, allocated: allocated };
- }}};
-
- var IDBFS={dbs:{},indexedDB:function () {
- return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
- },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
- // reuse all of the core MEMFS functionality
- return MEMFS.mount.apply(null, arguments);
- },syncfs:function (mount, populate, callback) {
- IDBFS.getLocalSet(mount, function(err, local) {
- if (err) return callback(err);
-
- IDBFS.getRemoteSet(mount, function(err, remote) {
- if (err) return callback(err);
-
- var src = populate ? remote : local;
- var dst = populate ? local : remote;
-
- IDBFS.reconcile(src, dst, callback);
- });
- });
- },getDB:function (name, callback) {
- // check the cache first
- var db = IDBFS.dbs[name];
- if (db) {
- return callback(null, db);
- }
-
- var req;
- try {
- req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
- } catch (e) {
- return callback(e);
- }
- req.onupgradeneeded = function(e) {
- var db = e.target.result;
- var transaction = e.target.transaction;
-
- var fileStore;
-
- if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
- fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
- } else {
- fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
- }
-
- fileStore.createIndex('timestamp', 'timestamp', { unique: false });
- };
- req.onsuccess = function() {
- db = req.result;
-
- // add to the cache
- IDBFS.dbs[name] = db;
- callback(null, db);
- };
- req.onerror = function() {
- callback(this.error);
- };
- },getLocalSet:function (mount, callback) {
- var entries = {};
-
- function isRealDir(p) {
- return p !== '.' && p !== '..';
- };
- function toAbsolute(root) {
- return function(p) {
- return PATH.join2(root, p);
- }
- };
-
- var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
-
- while (check.length) {
- var path = check.pop();
- var stat;
-
- try {
- stat = FS.stat(path);
- } catch (e) {
- return callback(e);
- }
-
- if (FS.isDir(stat.mode)) {
- check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
- }
-
- entries[path] = { timestamp: stat.mtime };
- }
-
- return callback(null, { type: 'local', entries: entries });
- },getRemoteSet:function (mount, callback) {
- var entries = {};
-
- IDBFS.getDB(mount.mountpoint, function(err, db) {
- if (err) return callback(err);
-
- var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
- transaction.onerror = function() { callback(this.error); };
-
- var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
- var index = store.index('timestamp');
-
- index.openKeyCursor().onsuccess = function(event) {
- var cursor = event.target.result;
-
- if (!cursor) {
- return callback(null, { type: 'remote', db: db, entries: entries });
- }
-
- entries[cursor.primaryKey] = { timestamp: cursor.key };
-
- cursor.continue();
- };
- });
- },loadLocalEntry:function (path, callback) {
- var stat, node;
-
- try {
- var lookup = FS.lookupPath(path);
- node = lookup.node;
- stat = FS.stat(path);
- } catch (e) {
- return callback(e);
- }
-
- if (FS.isDir(stat.mode)) {
- return callback(null, { timestamp: stat.mtime, mode: stat.mode });
- } else if (FS.isFile(stat.mode)) {
- return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
- } else {
- return callback(new Error('node type not supported'));
- }
- },storeLocalEntry:function (path, entry, callback) {
- try {
- if (FS.isDir(entry.mode)) {
- FS.mkdir(path, entry.mode);
- } else if (FS.isFile(entry.mode)) {
- FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
- } else {
- return callback(new Error('node type not supported'));
- }
-
- FS.utime(path, entry.timestamp, entry.timestamp);
- } catch (e) {
- return callback(e);
- }
-
- callback(null);
- },removeLocalEntry:function (path, callback) {
- try {
- var lookup = FS.lookupPath(path);
- var stat = FS.stat(path);
-
- if (FS.isDir(stat.mode)) {
- FS.rmdir(path);
- } else if (FS.isFile(stat.mode)) {
- FS.unlink(path);
- }
- } catch (e) {
- return callback(e);
- }
-
- callback(null);
- },loadRemoteEntry:function (store, path, callback) {
- var req = store.get(path);
- req.onsuccess = function(event) { callback(null, event.target.result); };
- req.onerror = function() { callback(this.error); };
- },storeRemoteEntry:function (store, path, entry, callback) {
- var req = store.put(entry, path);
- req.onsuccess = function() { callback(null); };
- req.onerror = function() { callback(this.error); };
- },removeRemoteEntry:function (store, path, callback) {
- var req = store.delete(path);
- req.onsuccess = function() { callback(null); };
- req.onerror = function() { callback(this.error); };
- },reconcile:function (src, dst, callback) {
- var total = 0;
-
- var create = [];
- Object.keys(src.entries).forEach(function (key) {
- var e = src.entries[key];
- var e2 = dst.entries[key];
- if (!e2 || e.timestamp > e2.timestamp) {
- create.push(key);
- total++;
- }
- });
-
- var remove = [];
- Object.keys(dst.entries).forEach(function (key) {
- var e = dst.entries[key];
- var e2 = src.entries[key];
- if (!e2) {
- remove.push(key);
- total++;
- }
- });
-
- if (!total) {
- return callback(null);
- }
-
- var errored = false;
- var completed = 0;
- var db = src.type === 'remote' ? src.db : dst.db;
- var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
- var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
-
- function done(err) {
- if (err) {
- if (!done.errored) {
- done.errored = true;
- return callback(err);
- }
- return;
- }
- if (++completed >= total) {
- return callback(null);
- }
- };
-
- transaction.onerror = function() { done(this.error); };
-
- // sort paths in ascending order so directory entries are created
- // before the files inside them
- create.sort().forEach(function (path) {
- if (dst.type === 'local') {
- IDBFS.loadRemoteEntry(store, path, function (err, entry) {
- if (err) return done(err);
- IDBFS.storeLocalEntry(path, entry, done);
- });
- } else {
- IDBFS.loadLocalEntry(path, function (err, entry) {
- if (err) return done(err);
- IDBFS.storeRemoteEntry(store, path, entry, done);
- });
- }
- });
-
- // sort paths in descending order so files are deleted before their
- // parent directories
- remove.sort().reverse().forEach(function(path) {
- if (dst.type === 'local') {
- IDBFS.removeLocalEntry(path, done);
- } else {
- IDBFS.removeRemoteEntry(store, path, done);
- }
- });
- }};
-
- var NODEFS={isWindows:false,staticInit:function () {
- NODEFS.isWindows = !!process.platform.match(/^win/);
- },mount:function (mount) {
- assert(ENVIRONMENT_IS_NODE);
- return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
- },createNode:function (parent, name, mode, dev) {
- if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- var node = FS.createNode(parent, name, mode);
- node.node_ops = NODEFS.node_ops;
- node.stream_ops = NODEFS.stream_ops;
- return node;
- },getMode:function (path) {
- var stat;
- try {
- stat = fs.lstatSync(path);
- if (NODEFS.isWindows) {
- // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
- // propagate write bits to execute bits.
- stat.mode = stat.mode | ((stat.mode & 146) >> 1);
- }
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- return stat.mode;
- },realPath:function (node) {
- var parts = [];
- while (node.parent !== node) {
- parts.push(node.name);
- node = node.parent;
- }
- parts.push(node.mount.opts.root);
- parts.reverse();
- return PATH.join.apply(null, parts);
- },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
- if (flags in NODEFS.flagsToPermissionStringMap) {
- return NODEFS.flagsToPermissionStringMap[flags];
- } else {
- return flags;
- }
- },node_ops:{getattr:function (node) {
- var path = NODEFS.realPath(node);
- var stat;
- try {
- stat = fs.lstatSync(path);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
- // See http://support.microsoft.com/kb/140365
- if (NODEFS.isWindows && !stat.blksize) {
- stat.blksize = 4096;
- }
- if (NODEFS.isWindows && !stat.blocks) {
- stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
- }
- return {
- dev: stat.dev,
- ino: stat.ino,
- mode: stat.mode,
- nlink: stat.nlink,
- uid: stat.uid,
- gid: stat.gid,
- rdev: stat.rdev,
- size: stat.size,
- atime: stat.atime,
- mtime: stat.mtime,
- ctime: stat.ctime,
- blksize: stat.blksize,
- blocks: stat.blocks
- };
- },setattr:function (node, attr) {
- var path = NODEFS.realPath(node);
- try {
- if (attr.mode !== undefined) {
- fs.chmodSync(path, attr.mode);
- // update the common node structure mode as well
- node.mode = attr.mode;
- }
- if (attr.timestamp !== undefined) {
- var date = new Date(attr.timestamp);
- fs.utimesSync(path, date, date);
- }
- if (attr.size !== undefined) {
- fs.truncateSync(path, attr.size);
- }
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },lookup:function (parent, name) {
- var path = PATH.join2(NODEFS.realPath(parent), name);
- var mode = NODEFS.getMode(path);
- return NODEFS.createNode(parent, name, mode);
- },mknod:function (parent, name, mode, dev) {
- var node = NODEFS.createNode(parent, name, mode, dev);
- // create the backing node for this in the fs root as well
- var path = NODEFS.realPath(node);
- try {
- if (FS.isDir(node.mode)) {
- fs.mkdirSync(path, node.mode);
- } else {
- fs.writeFileSync(path, '', { mode: node.mode });
- }
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- return node;
- },rename:function (oldNode, newDir, newName) {
- var oldPath = NODEFS.realPath(oldNode);
- var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
- try {
- fs.renameSync(oldPath, newPath);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },unlink:function (parent, name) {
- var path = PATH.join2(NODEFS.realPath(parent), name);
- try {
- fs.unlinkSync(path);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },rmdir:function (parent, name) {
- var path = PATH.join2(NODEFS.realPath(parent), name);
- try {
- fs.rmdirSync(path);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },readdir:function (node) {
- var path = NODEFS.realPath(node);
- try {
- return fs.readdirSync(path);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },symlink:function (parent, newName, oldPath) {
- var newPath = PATH.join2(NODEFS.realPath(parent), newName);
- try {
- fs.symlinkSync(oldPath, newPath);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },readlink:function (node) {
- var path = NODEFS.realPath(node);
- try {
- return fs.readlinkSync(path);
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- }},stream_ops:{open:function (stream) {
- var path = NODEFS.realPath(stream.node);
- try {
- if (FS.isFile(stream.node.mode)) {
- stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
- }
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },close:function (stream) {
- try {
- if (FS.isFile(stream.node.mode) && stream.nfd) {
- fs.closeSync(stream.nfd);
- }
- } catch (e) {
- if (!e.code) throw e;
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- },read:function (stream, buffer, offset, length, position) {
- // FIXME this is terrible.
- var nbuffer = new Buffer(length);
- var res;
- try {
- res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- if (res > 0) {
- for (var i = 0; i < res; i++) {
- buffer[offset + i] = nbuffer[i];
- }
- }
- return res;
- },write:function (stream, buffer, offset, length, position) {
- // FIXME this is terrible.
- var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
- var res;
- try {
- res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- return res;
- },llseek:function (stream, offset, whence) {
- var position = offset;
- if (whence === 1) { // SEEK_CUR.
- position += stream.position;
- } else if (whence === 2) { // SEEK_END.
- if (FS.isFile(stream.node.mode)) {
- try {
- var stat = fs.fstatSync(stream.nfd);
- position += stat.size;
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES[e.code]);
- }
- }
- }
-
- if (position < 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
-
- stream.position = position;
- return position;
- }}};
-
- var _stdin=allocate(1, "i32*", ALLOC_STATIC);
-
- var _stdout=allocate(1, "i32*", ALLOC_STATIC);
-
- var _stderr=allocate(1, "i32*", ALLOC_STATIC);
-
- function _fflush(stream) {
- // int fflush(FILE *stream);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
- // we don't currently perform any user-space buffering of data
- }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
- if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
- return ___setErrNo(e.errno);
- },lookupPath:function (path, opts) {
- path = PATH.resolve(FS.cwd(), path);
- opts = opts || {};
-
- var defaults = {
- follow_mount: true,
- recurse_count: 0
- };
- for (var key in defaults) {
- if (opts[key] === undefined) {
- opts[key] = defaults[key];
- }
- }
-
- if (opts.recurse_count > 8) { // max recursive lookup of 8
- throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
- }
-
- // split the path
- var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
- return !!p;
- }), false);
-
- // start at the root
- var current = FS.root;
- var current_path = '/';
-
- for (var i = 0; i < parts.length; i++) {
- var islast = (i === parts.length-1);
- if (islast && opts.parent) {
- // stop resolving
- break;
- }
-
- current = FS.lookupNode(current, parts[i]);
- current_path = PATH.join2(current_path, parts[i]);
-
- // jump to the mount's root node if this is a mountpoint
- if (FS.isMountpoint(current)) {
- if (!islast || (islast && opts.follow_mount)) {
- current = current.mounted.root;
- }
- }
-
- // by default, lookupPath will not follow a symlink if it is the final path component.
- // setting opts.follow = true will override this behavior.
- if (!islast || opts.follow) {
- var count = 0;
- while (FS.isLink(current.mode)) {
- var link = FS.readlink(current_path);
- current_path = PATH.resolve(PATH.dirname(current_path), link);
-
- var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
- current = lookup.node;
-
- if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
- throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
- }
- }
- }
- }
-
- return { path: current_path, node: current };
- },getPath:function (node) {
- var path;
- while (true) {
- if (FS.isRoot(node)) {
- var mount = node.mount.mountpoint;
- if (!path) return mount;
- return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
- }
- path = path ? node.name + '/' + path : node.name;
- node = node.parent;
- }
- },hashName:function (parentid, name) {
- var hash = 0;
-
-
- for (var i = 0; i < name.length; i++) {
- hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
- }
- return ((parentid + hash) >>> 0) % FS.nameTable.length;
- },hashAddNode:function (node) {
- var hash = FS.hashName(node.parent.id, node.name);
- node.name_next = FS.nameTable[hash];
- FS.nameTable[hash] = node;
- },hashRemoveNode:function (node) {
- var hash = FS.hashName(node.parent.id, node.name);
- if (FS.nameTable[hash] === node) {
- FS.nameTable[hash] = node.name_next;
- } else {
- var current = FS.nameTable[hash];
- while (current) {
- if (current.name_next === node) {
- current.name_next = node.name_next;
- break;
- }
- current = current.name_next;
- }
- }
- },lookupNode:function (parent, name) {
- var err = FS.mayLookup(parent);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- var hash = FS.hashName(parent.id, name);
- for (var node = FS.nameTable[hash]; node; node = node.name_next) {
- var nodeName = node.name;
- if (node.parent.id === parent.id && nodeName === name) {
- return node;
- }
- }
- // if we failed to find it in the cache, call into the VFS
- return FS.lookup(parent, name);
- },createNode:function (parent, name, mode, rdev) {
- if (!FS.FSNode) {
- FS.FSNode = function(parent, name, mode, rdev) {
- if (!parent) {
- parent = this; // root node sets parent to itself
- }
- this.parent = parent;
- this.mount = parent.mount;
- this.mounted = null;
- this.id = FS.nextInode++;
- this.name = name;
- this.mode = mode;
- this.node_ops = {};
- this.stream_ops = {};
- this.rdev = rdev;
- };
-
- FS.FSNode.prototype = {};
-
- // compatibility
- var readMode = 292 | 73;
- var writeMode = 146;
-
- // NOTE we must use Object.defineProperties instead of individual calls to
- // Object.defineProperty in order to make closure compiler happy
- Object.defineProperties(FS.FSNode.prototype, {
- read: {
- get: function() { return (this.mode & readMode) === readMode; },
- set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
- },
- write: {
- get: function() { return (this.mode & writeMode) === writeMode; },
- set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
- },
- isFolder: {
- get: function() { return FS.isDir(this.mode); },
- },
- isDevice: {
- get: function() { return FS.isChrdev(this.mode); },
- },
- });
- }
-
- var node = new FS.FSNode(parent, name, mode, rdev);
-
- FS.hashAddNode(node);
-
- return node;
- },destroyNode:function (node) {
- FS.hashRemoveNode(node);
- },isRoot:function (node) {
- return node === node.parent;
- },isMountpoint:function (node) {
- return !!node.mounted;
- },isFile:function (mode) {
- return (mode & 61440) === 32768;
- },isDir:function (mode) {
- return (mode & 61440) === 16384;
- },isLink:function (mode) {
- return (mode & 61440) === 40960;
- },isChrdev:function (mode) {
- return (mode & 61440) === 8192;
- },isBlkdev:function (mode) {
- return (mode & 61440) === 24576;
- },isFIFO:function (mode) {
- return (mode & 61440) === 4096;
- },isSocket:function (mode) {
- return (mode & 49152) === 49152;
- },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
- var flags = FS.flagModes[str];
- if (typeof flags === 'undefined') {
- throw new Error('Unknown file open mode: ' + str);
- }
- return flags;
- },flagsToPermissionString:function (flag) {
- var accmode = flag & 2097155;
- var perms = ['r', 'w', 'rw'][accmode];
- if ((flag & 512)) {
- perms += 'w';
- }
- return perms;
- },nodePermissions:function (node, perms) {
- if (FS.ignorePermissions) {
- return 0;
- }
- // return 0 if any user, group or owner bits are set.
- if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
- return ERRNO_CODES.EACCES;
- } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
- return ERRNO_CODES.EACCES;
- } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
- return ERRNO_CODES.EACCES;
- }
- return 0;
- },mayLookup:function (dir) {
- return FS.nodePermissions(dir, 'x');
- },mayCreate:function (dir, name) {
- try {
- var node = FS.lookupNode(dir, name);
- return ERRNO_CODES.EEXIST;
- } catch (e) {
- }
- return FS.nodePermissions(dir, 'wx');
- },mayDelete:function (dir, name, isdir) {
- var node;
- try {
- node = FS.lookupNode(dir, name);
- } catch (e) {
- return e.errno;
- }
- var err = FS.nodePermissions(dir, 'wx');
- if (err) {
- return err;
- }
- if (isdir) {
- if (!FS.isDir(node.mode)) {
- return ERRNO_CODES.ENOTDIR;
- }
- if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
- return ERRNO_CODES.EBUSY;
- }
- } else {
- if (FS.isDir(node.mode)) {
- return ERRNO_CODES.EISDIR;
- }
- }
- return 0;
- },mayOpen:function (node, flags) {
- if (!node) {
- return ERRNO_CODES.ENOENT;
- }
- if (FS.isLink(node.mode)) {
- return ERRNO_CODES.ELOOP;
- } else if (FS.isDir(node.mode)) {
- if ((flags & 2097155) !== 0 || // opening for write
- (flags & 512)) {
- return ERRNO_CODES.EISDIR;
- }
- }
- return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
- },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
- fd_start = fd_start || 0;
- fd_end = fd_end || FS.MAX_OPEN_FDS;
- for (var fd = fd_start; fd <= fd_end; fd++) {
- if (!FS.streams[fd]) {
- return fd;
- }
- }
- throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
- },getStream:function (fd) {
- return FS.streams[fd];
- },createStream:function (stream, fd_start, fd_end) {
- if (!FS.FSStream) {
- FS.FSStream = function(){};
- FS.FSStream.prototype = {};
- // compatibility
- Object.defineProperties(FS.FSStream.prototype, {
- object: {
- get: function() { return this.node; },
- set: function(val) { this.node = val; }
- },
- isRead: {
- get: function() { return (this.flags & 2097155) !== 1; }
- },
- isWrite: {
- get: function() { return (this.flags & 2097155) !== 0; }
- },
- isAppend: {
- get: function() { return (this.flags & 1024); }
- }
- });
- }
- if (0) {
- // reuse the object
- stream.__proto__ = FS.FSStream.prototype;
- } else {
- var newStream = new FS.FSStream();
- for (var p in stream) {
- newStream[p] = stream[p];
- }
- stream = newStream;
- }
- var fd = FS.nextfd(fd_start, fd_end);
- stream.fd = fd;
- FS.streams[fd] = stream;
- return stream;
- },closeStream:function (fd) {
- FS.streams[fd] = null;
- },getStreamFromPtr:function (ptr) {
- return FS.streams[ptr - 1];
- },getPtrForStream:function (stream) {
- return stream ? stream.fd + 1 : 0;
- },chrdev_stream_ops:{open:function (stream) {
- var device = FS.getDevice(stream.node.rdev);
- // override node's stream ops with the device's
- stream.stream_ops = device.stream_ops;
- // forward the open call
- if (stream.stream_ops.open) {
- stream.stream_ops.open(stream);
- }
- },llseek:function () {
- throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
- }},major:function (dev) {
- return ((dev) >> 8);
- },minor:function (dev) {
- return ((dev) & 0xff);
- },makedev:function (ma, mi) {
- return ((ma) << 8 | (mi));
- },registerDevice:function (dev, ops) {
- FS.devices[dev] = { stream_ops: ops };
- },getDevice:function (dev) {
- return FS.devices[dev];
- },getMounts:function (mount) {
- var mounts = [];
- var check = [mount];
-
- while (check.length) {
- var m = check.pop();
-
- mounts.push(m);
-
- check.push.apply(check, m.mounts);
- }
-
- return mounts;
- },syncfs:function (populate, callback) {
- if (typeof(populate) === 'function') {
- callback = populate;
- populate = false;
- }
-
- var mounts = FS.getMounts(FS.root.mount);
- var completed = 0;
-
- function done(err) {
- if (err) {
- if (!done.errored) {
- done.errored = true;
- return callback(err);
- }
- return;
- }
- if (++completed >= mounts.length) {
- callback(null);
- }
- };
-
- // sync all mounts
- mounts.forEach(function (mount) {
- if (!mount.type.syncfs) {
- return done(null);
- }
- mount.type.syncfs(mount, populate, done);
- });
- },mount:function (type, opts, mountpoint) {
- var root = mountpoint === '/';
- var pseudo = !mountpoint;
- var node;
-
- if (root && FS.root) {
- throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
- } else if (!root && !pseudo) {
- var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
-
- mountpoint = lookup.path; // use the absolute path
- node = lookup.node;
-
- if (FS.isMountpoint(node)) {
- throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
- }
-
- if (!FS.isDir(node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
- }
- }
-
- var mount = {
- type: type,
- opts: opts,
- mountpoint: mountpoint,
- mounts: []
- };
-
- // create a root node for the fs
- var mountRoot = type.mount(mount);
- mountRoot.mount = mount;
- mount.root = mountRoot;
-
- if (root) {
- FS.root = mountRoot;
- } else if (node) {
- // set as a mountpoint
- node.mounted = mount;
-
- // add the new mount to the current mount's children
- if (node.mount) {
- node.mount.mounts.push(mount);
- }
- }
-
- return mountRoot;
- },unmount:function (mountpoint) {
- var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
-
- if (!FS.isMountpoint(lookup.node)) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
-
- // destroy the nodes for this mount, and all its child mounts
- var node = lookup.node;
- var mount = node.mounted;
- var mounts = FS.getMounts(mount);
-
- Object.keys(FS.nameTable).forEach(function (hash) {
- var current = FS.nameTable[hash];
-
- while (current) {
- var next = current.name_next;
-
- if (mounts.indexOf(current.mount) !== -1) {
- FS.destroyNode(current);
- }
-
- current = next;
- }
- });
-
- // no longer a mountpoint
- node.mounted = null;
-
- // remove this mount from the child mounts
- var idx = node.mount.mounts.indexOf(mount);
- assert(idx !== -1);
- node.mount.mounts.splice(idx, 1);
- },lookup:function (parent, name) {
- return parent.node_ops.lookup(parent, name);
- },mknod:function (path, mode, dev) {
- var lookup = FS.lookupPath(path, { parent: true });
- var parent = lookup.node;
- var name = PATH.basename(path);
- var err = FS.mayCreate(parent, name);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- if (!parent.node_ops.mknod) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- return parent.node_ops.mknod(parent, name, mode, dev);
- },create:function (path, mode) {
- mode = mode !== undefined ? mode : 438 /* 0666 */;
- mode &= 4095;
- mode |= 32768;
- return FS.mknod(path, mode, 0);
- },mkdir:function (path, mode) {
- mode = mode !== undefined ? mode : 511 /* 0777 */;
- mode &= 511 | 512;
- mode |= 16384;
- return FS.mknod(path, mode, 0);
- },mkdev:function (path, mode, dev) {
- if (typeof(dev) === 'undefined') {
- dev = mode;
- mode = 438 /* 0666 */;
- }
- mode |= 8192;
- return FS.mknod(path, mode, dev);
- },symlink:function (oldpath, newpath) {
- var lookup = FS.lookupPath(newpath, { parent: true });
- var parent = lookup.node;
- var newname = PATH.basename(newpath);
- var err = FS.mayCreate(parent, newname);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- if (!parent.node_ops.symlink) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- return parent.node_ops.symlink(parent, newname, oldpath);
- },rename:function (old_path, new_path) {
- var old_dirname = PATH.dirname(old_path);
- var new_dirname = PATH.dirname(new_path);
- var old_name = PATH.basename(old_path);
- var new_name = PATH.basename(new_path);
- // parents must exist
- var lookup, old_dir, new_dir;
- try {
- lookup = FS.lookupPath(old_path, { parent: true });
- old_dir = lookup.node;
- lookup = FS.lookupPath(new_path, { parent: true });
- new_dir = lookup.node;
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
- }
- // need to be part of the same mount
- if (old_dir.mount !== new_dir.mount) {
- throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
- }
- // source must exist
- var old_node = FS.lookupNode(old_dir, old_name);
- // old path should not be an ancestor of the new path
- var relative = PATH.relative(old_path, new_dirname);
- if (relative.charAt(0) !== '.') {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- // new path should not be an ancestor of the old path
- relative = PATH.relative(new_path, old_dirname);
- if (relative.charAt(0) !== '.') {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
- }
- // see if the new path already exists
- var new_node;
- try {
- new_node = FS.lookupNode(new_dir, new_name);
- } catch (e) {
- // not fatal
- }
- // early out if nothing needs to change
- if (old_node === new_node) {
- return;
- }
- // we'll need to delete the old entry
- var isdir = FS.isDir(old_node.mode);
- var err = FS.mayDelete(old_dir, old_name, isdir);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- // need delete permissions if we'll be overwriting.
- // need create permissions if new doesn't already exist.
- err = new_node ?
- FS.mayDelete(new_dir, new_name, isdir) :
- FS.mayCreate(new_dir, new_name);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- if (!old_dir.node_ops.rename) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
- throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
- }
- // if we are going to change the parent, check write permissions
- if (new_dir !== old_dir) {
- err = FS.nodePermissions(old_dir, 'w');
- if (err) {
- throw new FS.ErrnoError(err);
- }
- }
- // remove the node from the lookup hash
- FS.hashRemoveNode(old_node);
- // do the underlying fs rename
- try {
- old_dir.node_ops.rename(old_node, new_dir, new_name);
- } catch (e) {
- throw e;
- } finally {
- // add the node back to the hash (in case node_ops.rename
- // changed its name)
- FS.hashAddNode(old_node);
- }
- },rmdir:function (path) {
- var lookup = FS.lookupPath(path, { parent: true });
- var parent = lookup.node;
- var name = PATH.basename(path);
- var node = FS.lookupNode(parent, name);
- var err = FS.mayDelete(parent, name, true);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- if (!parent.node_ops.rmdir) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- if (FS.isMountpoint(node)) {
- throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
- }
- parent.node_ops.rmdir(parent, name);
- FS.destroyNode(node);
- },readdir:function (path) {
- var lookup = FS.lookupPath(path, { follow: true });
- var node = lookup.node;
- if (!node.node_ops.readdir) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
- }
- return node.node_ops.readdir(node);
- },unlink:function (path) {
- var lookup = FS.lookupPath(path, { parent: true });
- var parent = lookup.node;
- var name = PATH.basename(path);
- var node = FS.lookupNode(parent, name);
- var err = FS.mayDelete(parent, name, false);
- if (err) {
- // POSIX says unlink should set EPERM, not EISDIR
- if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
- throw new FS.ErrnoError(err);
- }
- if (!parent.node_ops.unlink) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- if (FS.isMountpoint(node)) {
- throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
- }
- parent.node_ops.unlink(parent, name);
- FS.destroyNode(node);
- },readlink:function (path) {
- var lookup = FS.lookupPath(path);
- var link = lookup.node;
- if (!link.node_ops.readlink) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- return link.node_ops.readlink(link);
- },stat:function (path, dontFollow) {
- var lookup = FS.lookupPath(path, { follow: !dontFollow });
- var node = lookup.node;
- if (!node.node_ops.getattr) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- return node.node_ops.getattr(node);
- },lstat:function (path) {
- return FS.stat(path, true);
- },chmod:function (path, mode, dontFollow) {
- var node;
- if (typeof path === 'string') {
- var lookup = FS.lookupPath(path, { follow: !dontFollow });
- node = lookup.node;
- } else {
- node = path;
- }
- if (!node.node_ops.setattr) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- node.node_ops.setattr(node, {
- mode: (mode & 4095) | (node.mode & ~4095),
- timestamp: Date.now()
- });
- },lchmod:function (path, mode) {
- FS.chmod(path, mode, true);
- },fchmod:function (fd, mode) {
- var stream = FS.getStream(fd);
- if (!stream) {
- throw new FS.ErrnoError(ERRNO_CODES.EBADF);
- }
- FS.chmod(stream.node, mode);
- },chown:function (path, uid, gid, dontFollow) {
- var node;
- if (typeof path === 'string') {
- var lookup = FS.lookupPath(path, { follow: !dontFollow });
- node = lookup.node;
- } else {
- node = path;
- }
- if (!node.node_ops.setattr) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- node.node_ops.setattr(node, {
- timestamp: Date.now()
- // we ignore the uid / gid for now
- });
- },lchown:function (path, uid, gid) {
- FS.chown(path, uid, gid, true);
- },fchown:function (fd, uid, gid) {
- var stream = FS.getStream(fd);
- if (!stream) {
- throw new FS.ErrnoError(ERRNO_CODES.EBADF);
- }
- FS.chown(stream.node, uid, gid);
- },truncate:function (path, len) {
- if (len < 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- var node;
- if (typeof path === 'string') {
- var lookup = FS.lookupPath(path, { follow: true });
- node = lookup.node;
- } else {
- node = path;
- }
- if (!node.node_ops.setattr) {
- throw new FS.ErrnoError(ERRNO_CODES.EPERM);
- }
- if (FS.isDir(node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
- }
- if (!FS.isFile(node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- var err = FS.nodePermissions(node, 'w');
- if (err) {
- throw new FS.ErrnoError(err);
- }
- node.node_ops.setattr(node, {
- size: len,
- timestamp: Date.now()
- });
- },ftruncate:function (fd, len) {
- var stream = FS.getStream(fd);
- if (!stream) {
- throw new FS.ErrnoError(ERRNO_CODES.EBADF);
- }
- if ((stream.flags & 2097155) === 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- FS.truncate(stream.node, len);
- },utime:function (path, atime, mtime) {
- var lookup = FS.lookupPath(path, { follow: true });
- var node = lookup.node;
- node.node_ops.setattr(node, {
- timestamp: Math.max(atime, mtime)
- });
- },open:function (path, flags, mode, fd_start, fd_end) {
- flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
- mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
- if ((flags & 64)) {
- mode = (mode & 4095) | 32768;
- } else {
- mode = 0;
- }
- var node;
- if (typeof path === 'object') {
- node = path;
- } else {
- path = PATH.normalize(path);
- try {
- var lookup = FS.lookupPath(path, {
- follow: !(flags & 131072)
- });
- node = lookup.node;
- } catch (e) {
- // ignore
- }
- }
- // perhaps we need to create the node
- if ((flags & 64)) {
- if (node) {
- // if O_CREAT and O_EXCL are set, error out if the node already exists
- if ((flags & 128)) {
- throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
- }
- } else {
- // node doesn't exist, try to create it
- node = FS.mknod(path, mode, 0);
- }
- }
- if (!node) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
- }
- // can't truncate a device
- if (FS.isChrdev(node.mode)) {
- flags &= ~512;
- }
- // check permissions
- var err = FS.mayOpen(node, flags);
- if (err) {
- throw new FS.ErrnoError(err);
- }
- // do truncation if necessary
- if ((flags & 512)) {
- FS.truncate(node, 0);
- }
- // we've already handled these, don't pass down to the underlying vfs
- flags &= ~(128 | 512);
-
- // register the stream with the filesystem
- var stream = FS.createStream({
- node: node,
- path: FS.getPath(node), // we want the absolute path to the node
- flags: flags,
- seekable: true,
- position: 0,
- stream_ops: node.stream_ops,
- // used by the file family libc calls (fopen, fwrite, ferror, etc.)
- ungotten: [],
- error: false
- }, fd_start, fd_end);
- // call the new stream's open function
- if (stream.stream_ops.open) {
- stream.stream_ops.open(stream);
- }
- if (Module['logReadFiles'] && !(flags & 1)) {
- if (!FS.readFiles) FS.readFiles = {};
- if (!(path in FS.readFiles)) {
- FS.readFiles[path] = 1;
- Module['printErr']('read file: ' + path);
- }
- }
- return stream;
- },close:function (stream) {
- try {
- if (stream.stream_ops.close) {
- stream.stream_ops.close(stream);
- }
- } catch (e) {
- throw e;
- } finally {
- FS.closeStream(stream.fd);
- }
- },llseek:function (stream, offset, whence) {
- if (!stream.seekable || !stream.stream_ops.llseek) {
- throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
- }
- return stream.stream_ops.llseek(stream, offset, whence);
- },read:function (stream, buffer, offset, length, position) {
- if (length < 0 || position < 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- if ((stream.flags & 2097155) === 1) {
- throw new FS.ErrnoError(ERRNO_CODES.EBADF);
- }
- if (FS.isDir(stream.node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
- }
- if (!stream.stream_ops.read) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- var seeking = true;
- if (typeof position === 'undefined') {
- position = stream.position;
- seeking = false;
- } else if (!stream.seekable) {
- throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
- }
- var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
- if (!seeking) stream.position += bytesRead;
- return bytesRead;
- },write:function (stream, buffer, offset, length, position, canOwn) {
- if (length < 0 || position < 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- if ((stream.flags & 2097155) === 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EBADF);
- }
- if (FS.isDir(stream.node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
- }
- if (!stream.stream_ops.write) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- var seeking = true;
- if (typeof position === 'undefined') {
- position = stream.position;
- seeking = false;
- } else if (!stream.seekable) {
- throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
- }
- if (stream.flags & 1024) {
- // seek to the end before writing in append mode
- FS.llseek(stream, 0, 2);
- }
- var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
- if (!seeking) stream.position += bytesWritten;
- return bytesWritten;
- },allocate:function (stream, offset, length) {
- if (offset < 0 || length <= 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- if ((stream.flags & 2097155) === 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EBADF);
- }
- if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
- }
- if (!stream.stream_ops.allocate) {
- throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
- }
- stream.stream_ops.allocate(stream, offset, length);
- },mmap:function (stream, buffer, offset, length, position, prot, flags) {
- // TODO if PROT is PROT_WRITE, make sure we have write access
- if ((stream.flags & 2097155) === 1) {
- throw new FS.ErrnoError(ERRNO_CODES.EACCES);
- }
- if (!stream.stream_ops.mmap) {
- throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
- }
- return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
- },ioctl:function (stream, cmd, arg) {
- if (!stream.stream_ops.ioctl) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
- }
- return stream.stream_ops.ioctl(stream, cmd, arg);
- },readFile:function (path, opts) {
- opts = opts || {};
- opts.flags = opts.flags || 'r';
- opts.encoding = opts.encoding || 'binary';
- if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
- throw new Error('Invalid encoding type "' + opts.encoding + '"');
- }
- var ret;
- var stream = FS.open(path, opts.flags);
- var stat = FS.stat(path);
- var length = stat.size;
- var buf = new Uint8Array(length);
- FS.read(stream, buf, 0, length, 0);
- if (opts.encoding === 'utf8') {
- ret = '';
- var utf8 = new Runtime.UTF8Processor();
- for (var i = 0; i < length; i++) {
- ret += utf8.processCChar(buf[i]);
- }
- } else if (opts.encoding === 'binary') {
- ret = buf;
- }
- FS.close(stream);
- return ret;
- },writeFile:function (path, data, opts) {
- opts = opts || {};
- opts.flags = opts.flags || 'w';
- opts.encoding = opts.encoding || 'utf8';
- if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
- throw new Error('Invalid encoding type "' + opts.encoding + '"');
- }
- var stream = FS.open(path, opts.flags, opts.mode);
- if (opts.encoding === 'utf8') {
- var utf8 = new Runtime.UTF8Processor();
- var buf = new Uint8Array(utf8.processJSString(data));
- FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
- } else if (opts.encoding === 'binary') {
- FS.write(stream, data, 0, data.length, 0, opts.canOwn);
- }
- FS.close(stream);
- },cwd:function () {
- return FS.currentPath;
- },chdir:function (path) {
- var lookup = FS.lookupPath(path, { follow: true });
- if (!FS.isDir(lookup.node.mode)) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
- }
- var err = FS.nodePermissions(lookup.node, 'x');
- if (err) {
- throw new FS.ErrnoError(err);
- }
- FS.currentPath = lookup.path;
- },createDefaultDirectories:function () {
- FS.mkdir('/tmp');
- },createDefaultDevices:function () {
- // create /dev
- FS.mkdir('/dev');
- // setup /dev/null
- FS.registerDevice(FS.makedev(1, 3), {
- read: function() { return 0; },
- write: function() { return 0; }
- });
- FS.mkdev('/dev/null', FS.makedev(1, 3));
- // setup /dev/tty and /dev/tty1
- // stderr needs to print output using Module['printErr']
- // so we register a second tty just for it.
- TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
- TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
- FS.mkdev('/dev/tty', FS.makedev(5, 0));
- FS.mkdev('/dev/tty1', FS.makedev(6, 0));
- // we're not going to emulate the actual shm device,
- // just create the tmp dirs that reside in it commonly
- FS.mkdir('/dev/shm');
- FS.mkdir('/dev/shm/tmp');
- },createStandardStreams:function () {
- // TODO deprecate the old functionality of a single
- // input / output callback and that utilizes FS.createDevice
- // and instead require a unique set of stream ops
-
- // by default, we symlink the standard streams to the
- // default tty devices. however, if the standard streams
- // have been overwritten we create a unique device for
- // them instead.
- if (Module['stdin']) {
- FS.createDevice('/dev', 'stdin', Module['stdin']);
- } else {
- FS.symlink('/dev/tty', '/dev/stdin');
- }
- if (Module['stdout']) {
- FS.createDevice('/dev', 'stdout', null, Module['stdout']);
- } else {
- FS.symlink('/dev/tty', '/dev/stdout');
- }
- if (Module['stderr']) {
- FS.createDevice('/dev', 'stderr', null, Module['stderr']);
- } else {
- FS.symlink('/dev/tty1', '/dev/stderr');
- }
-
- // open default streams for the stdin, stdout and stderr devices
- var stdin = FS.open('/dev/stdin', 'r');
- HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
- assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
-
- var stdout = FS.open('/dev/stdout', 'w');
- HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
- assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
-
- var stderr = FS.open('/dev/stderr', 'w');
- HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
- assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
- },ensureErrnoError:function () {
- if (FS.ErrnoError) return;
- FS.ErrnoError = function ErrnoError(errno) {
- this.errno = errno;
- for (var key in ERRNO_CODES) {
- if (ERRNO_CODES[key] === errno) {
- this.code = key;
- break;
- }
- }
- this.message = ERRNO_MESSAGES[errno];
- };
- FS.ErrnoError.prototype = new Error();
- FS.ErrnoError.prototype.constructor = FS.ErrnoError;
- // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
- [ERRNO_CODES.ENOENT].forEach(function(code) {
- FS.genericErrors[code] = new FS.ErrnoError(code);
- FS.genericErrors[code].stack = '<generic error, no stack>';
- });
- },staticInit:function () {
- FS.ensureErrnoError();
-
- FS.nameTable = new Array(4096);
-
- FS.mount(MEMFS, {}, '/');
-
- FS.createDefaultDirectories();
- FS.createDefaultDevices();
- },init:function (input, output, error) {
- assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
- FS.init.initialized = true;
-
- FS.ensureErrnoError();
-
- // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
- Module['stdin'] = input || Module['stdin'];
- Module['stdout'] = output || Module['stdout'];
- Module['stderr'] = error || Module['stderr'];
-
- FS.createStandardStreams();
- },quit:function () {
- FS.init.initialized = false;
- for (var i = 0; i < FS.streams.length; i++) {
- var stream = FS.streams[i];
- if (!stream) {
- continue;
- }
- FS.close(stream);
- }
- },getMode:function (canRead, canWrite) {
- var mode = 0;
- if (canRead) mode |= 292 | 73;
- if (canWrite) mode |= 146;
- return mode;
- },joinPath:function (parts, forceRelative) {
- var path = PATH.join.apply(null, parts);
- if (forceRelative && path[0] == '/') path = path.substr(1);
- return path;
- },absolutePath:function (relative, base) {
- return PATH.resolve(base, relative);
- },standardizePath:function (path) {
- return PATH.normalize(path);
- },findObject:function (path, dontResolveLastLink) {
- var ret = FS.analyzePath(path, dontResolveLastLink);
- if (ret.exists) {
- return ret.object;
- } else {
- ___setErrNo(ret.error);
- return null;
- }
- },analyzePath:function (path, dontResolveLastLink) {
- // operate from within the context of the symlink's target
- try {
- var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
- path = lookup.path;
- } catch (e) {
- }
- var ret = {
- isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
- parentExists: false, parentPath: null, parentObject: null
- };
- try {
- var lookup = FS.lookupPath(path, { parent: true });
- ret.parentExists = true;
- ret.parentPath = lookup.path;
- ret.parentObject = lookup.node;
- ret.name = PATH.basename(path);
- lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
- ret.exists = true;
- ret.path = lookup.path;
- ret.object = lookup.node;
- ret.name = lookup.node.name;
- ret.isRoot = lookup.path === '/';
- } catch (e) {
- ret.error = e.errno;
- };
- return ret;
- },createFolder:function (parent, name, canRead, canWrite) {
- var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
- var mode = FS.getMode(canRead, canWrite);
- return FS.mkdir(path, mode);
- },createPath:function (parent, path, canRead, canWrite) {
- parent = typeof parent === 'string' ? parent : FS.getPath(parent);
- var parts = path.split('/').reverse();
- while (parts.length) {
- var part = parts.pop();
- if (!part) continue;
- var current = PATH.join2(parent, part);
- try {
- FS.mkdir(current);
- } catch (e) {
- // ignore EEXIST
- }
- parent = current;
- }
- return current;
- },createFile:function (parent, name, properties, canRead, canWrite) {
- var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
- var mode = FS.getMode(canRead, canWrite);
- return FS.create(path, mode);
- },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
- var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
- var mode = FS.getMode(canRead, canWrite);
- var node = FS.create(path, mode);
- if (data) {
- if (typeof data === 'string') {
- var arr = new Array(data.length);
- for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
- data = arr;
- }
- // make sure we can write to the file
- FS.chmod(node, mode | 146);
- var stream = FS.open(node, 'w');
- FS.write(stream, data, 0, data.length, 0, canOwn);
- FS.close(stream);
- FS.chmod(node, mode);
- }
- return node;
- },createDevice:function (parent, name, input, output) {
- var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
- var mode = FS.getMode(!!input, !!output);
- if (!FS.createDevice.major) FS.createDevice.major = 64;
- var dev = FS.makedev(FS.createDevice.major++, 0);
- // Create a fake device that a set of stream ops to emulate
- // the old behavior.
- FS.registerDevice(dev, {
- open: function(stream) {
- stream.seekable = false;
- },
- close: function(stream) {
- // flush any pending line data
- if (output && output.buffer && output.buffer.length) {
- output(10);
- }
- },
- read: function(stream, buffer, offset, length, pos /* ignored */) {
- var bytesRead = 0;
- for (var i = 0; i < length; i++) {
- var result;
- try {
- result = input();
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EIO);
- }
- if (result === undefined && bytesRead === 0) {
- throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
- }
- if (result === null || result === undefined) break;
- bytesRead++;
- buffer[offset+i] = result;
- }
- if (bytesRead) {
- stream.node.timestamp = Date.now();
- }
- return bytesRead;
- },
- write: function(stream, buffer, offset, length, pos) {
- for (var i = 0; i < length; i++) {
- try {
- output(buffer[offset+i]);
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EIO);
- }
- }
- if (length) {
- stream.node.timestamp = Date.now();
- }
- return i;
- }
- });
- return FS.mkdev(path, mode, dev);
- },createLink:function (parent, name, target, canRead, canWrite) {
- var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
- return FS.symlink(target, path);
- },forceLoadFile:function (obj) {
- if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
- var success = true;
- if (typeof XMLHttpRequest !== 'undefined') {
- throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
- } else if (Module['read']) {
- // Command-line.
- try {
- // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
- // read() will try to parse UTF8.
- obj.contents = intArrayFromString(Module['read'](obj.url), true);
- } catch (e) {
- success = false;
- }
- } else {
- throw new Error('Cannot load without read() or XMLHttpRequest.');
- }
- if (!success) ___setErrNo(ERRNO_CODES.EIO);
- return success;
- },createLazyFile:function (parent, name, url, canRead, canWrite) {
- // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
- function LazyUint8Array() {
- this.lengthKnown = false;
- this.chunks = []; // Loaded chunks. Index is the chunk number
- }
- LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
- if (idx > this.length-1 || idx < 0) {
- return undefined;
- }
- var chunkOffset = idx % this.chunkSize;
- var chunkNum = Math.floor(idx / this.chunkSize);
- return this.getter(chunkNum)[chunkOffset];
- }
- LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
- this.getter = getter;
- }
- LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
- // Find length
- var xhr = new XMLHttpRequest();
- xhr.open('HEAD', url, false);
- xhr.send(null);
- if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
- var datalength = Number(xhr.getResponseHeader("Content-length"));
- var header;
- var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
- var chunkSize = 1024*1024; // Chunk size in bytes
-
- if (!hasByteServing) chunkSize = datalength;
-
- // Function to get a range from the remote URL.
- var doXHR = (function(from, to) {
- if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
- if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
-
- // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
- var xhr = new XMLHttpRequest();
- xhr.open('GET', url, false);
- if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
-
- // Some hints to the browser that we want binary data.
- if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
- if (xhr.overrideMimeType) {
- xhr.overrideMimeType('text/plain; charset=x-user-defined');
- }
-
- xhr.send(null);
- if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
- if (xhr.response !== undefined) {
- return new Uint8Array(xhr.response || []);
- } else {
- return intArrayFromString(xhr.responseText || '', true);
- }
- });
- var lazyArray = this;
- lazyArray.setDataGetter(function(chunkNum) {
- var start = chunkNum * chunkSize;
- var end = (chunkNum+1) * chunkSize - 1; // including this byte
- end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
- if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
- lazyArray.chunks[chunkNum] = doXHR(start, end);
- }
- if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
- return lazyArray.chunks[chunkNum];
- });
-
- this._length = datalength;
- this._chunkSize = chunkSize;
- this.lengthKnown = true;
- }
- if (typeof XMLHttpRequest !== 'undefined') {
- if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
- var lazyArray = new LazyUint8Array();
- Object.defineProperty(lazyArray, "length", {
- get: function() {
- if(!this.lengthKnown) {
- this.cacheLength();
- }
- return this._length;
- }
- });
- Object.defineProperty(lazyArray, "chunkSize", {
- get: function() {
- if(!this.lengthKnown) {
- this.cacheLength();
- }
- return this._chunkSize;
- }
- });
-
- var properties = { isDevice: false, contents: lazyArray };
- } else {
- var properties = { isDevice: false, url: url };
- }
-
- var node = FS.createFile(parent, name, properties, canRead, canWrite);
- // This is a total hack, but I want to get this lazy file code out of the
- // core of MEMFS. If we want to keep this lazy file concept I feel it should
- // be its own thin LAZYFS proxying calls to MEMFS.
- if (properties.contents) {
- node.contents = properties.contents;
- } else if (properties.url) {
- node.contents = null;
- node.url = properties.url;
- }
- // override each stream op with one that tries to force load the lazy file first
- var stream_ops = {};
- var keys = Object.keys(node.stream_ops);
- keys.forEach(function(key) {
- var fn = node.stream_ops[key];
- stream_ops[key] = function forceLoadLazyFile() {
- if (!FS.forceLoadFile(node)) {
- throw new FS.ErrnoError(ERRNO_CODES.EIO);
- }
- return fn.apply(null, arguments);
- };
- });
- // use a custom read function
- stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
- if (!FS.forceLoadFile(node)) {
- throw new FS.ErrnoError(ERRNO_CODES.EIO);
- }
- var contents = stream.node.contents;
- if (position >= contents.length)
- return 0;
- var size = Math.min(contents.length - position, length);
- assert(size >= 0);
- if (contents.slice) { // normal array
- for (var i = 0; i < size; i++) {
- buffer[offset + i] = contents[position + i];
- }
- } else {
- for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
- buffer[offset + i] = contents.get(position + i);
- }
- }
- return size;
- };
- node.stream_ops = stream_ops;
- return node;
- },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
- Browser.init();
- // TODO we should allow people to just pass in a complete filename instead
- // of parent and name being that we just join them anyways
- var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
- function processData(byteArray) {
- function finish(byteArray) {
- if (!dontCreateFile) {
- FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
- }
- if (onload) onload();
- removeRunDependency('cp ' + fullname);
- }
- var handled = false;
- Module['preloadPlugins'].forEach(function(plugin) {
- if (handled) return;
- if (plugin['canHandle'](fullname)) {
- plugin['handle'](byteArray, fullname, finish, function() {
- if (onerror) onerror();
- removeRunDependency('cp ' + fullname);
- });
- handled = true;
- }
- });
- if (!handled) finish(byteArray);
- }
- addRunDependency('cp ' + fullname);
- if (typeof url == 'string') {
- Browser.asyncLoad(url, function(byteArray) {
- processData(byteArray);
- }, onerror);
- } else {
- processData(url);
- }
- },indexedDB:function () {
- return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
- },DB_NAME:function () {
- return 'EM_FS_' + window.location.pathname;
- },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
- onload = onload || function(){};
- onerror = onerror || function(){};
- var indexedDB = FS.indexedDB();
- try {
- var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
- } catch (e) {
- return onerror(e);
- }
- openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
- console.log('creating db');
- var db = openRequest.result;
- db.createObjectStore(FS.DB_STORE_NAME);
- };
- openRequest.onsuccess = function openRequest_onsuccess() {
- var db = openRequest.result;
- var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
- var files = transaction.objectStore(FS.DB_STORE_NAME);
- var ok = 0, fail = 0, total = paths.length;
- function finish() {
- if (fail == 0) onload(); else onerror();
- }
- paths.forEach(function(path) {
- var putRequest = files.put(FS.analyzePath(path).object.contents, path);
- putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
- putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
- });
- transaction.onerror = onerror;
- };
- openRequest.onerror = onerror;
- },loadFilesFromDB:function (paths, onload, onerror) {
- onload = onload || function(){};
- onerror = onerror || function(){};
- var indexedDB = FS.indexedDB();
- try {
- var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
- } catch (e) {
- return onerror(e);
- }
- openRequest.onupgradeneeded = onerror; // no database to load from
- openRequest.onsuccess = function openRequest_onsuccess() {
- var db = openRequest.result;
- try {
- var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
- } catch(e) {
- onerror(e);
- return;
- }
- var files = transaction.objectStore(FS.DB_STORE_NAME);
- var ok = 0, fail = 0, total = paths.length;
- function finish() {
- if (fail == 0) onload(); else onerror();
- }
- paths.forEach(function(path) {
- var getRequest = files.get(path);
- getRequest.onsuccess = function getRequest_onsuccess() {
- if (FS.analyzePath(path).exists) {
- FS.unlink(path);
- }
- FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
- ok++;
- if (ok + fail == total) finish();
- };
- getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
- });
- transaction.onerror = onerror;
- };
- openRequest.onerror = onerror;
- }};
-
-
-
-
- function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
- return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
- },createSocket:function (family, type, protocol) {
- var streaming = type == 1;
- if (protocol) {
- assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
- }
-
- // create our internal socket structure
- var sock = {
- family: family,
- type: type,
- protocol: protocol,
- server: null,
- peers: {},
- pending: [],
- recv_queue: [],
- sock_ops: SOCKFS.websocket_sock_ops
- };
-
- // create the filesystem node to store the socket structure
- var name = SOCKFS.nextname();
- var node = FS.createNode(SOCKFS.root, name, 49152, 0);
- node.sock = sock;
-
- // and the wrapping stream that enables library functions such
- // as read and write to indirectly interact with the socket
- var stream = FS.createStream({
- path: name,
- node: node,
- flags: FS.modeStringToFlags('r+'),
- seekable: false,
- stream_ops: SOCKFS.stream_ops
- });
-
- // map the new stream to the socket structure (sockets have a 1:1
- // relationship with a stream)
- sock.stream = stream;
-
- return sock;
- },getSocket:function (fd) {
- var stream = FS.getStream(fd);
- if (!stream || !FS.isSocket(stream.node.mode)) {
- return null;
- }
- return stream.node.sock;
- },stream_ops:{poll:function (stream) {
- var sock = stream.node.sock;
- return sock.sock_ops.poll(sock);
- },ioctl:function (stream, request, varargs) {
- var sock = stream.node.sock;
- return sock.sock_ops.ioctl(sock, request, varargs);
- },read:function (stream, buffer, offset, length, position /* ignored */) {
- var sock = stream.node.sock;
- var msg = sock.sock_ops.recvmsg(sock, length);
- if (!msg) {
- // socket is closed
- return 0;
- }
- buffer.set(msg.buffer, offset);
- return msg.buffer.length;
- },write:function (stream, buffer, offset, length, position /* ignored */) {
- var sock = stream.node.sock;
- return sock.sock_ops.sendmsg(sock, buffer, offset, length);
- },close:function (stream) {
- var sock = stream.node.sock;
- sock.sock_ops.close(sock);
- }},nextname:function () {
- if (!SOCKFS.nextname.current) {
- SOCKFS.nextname.current = 0;
- }
- return 'socket[' + (SOCKFS.nextname.current++) + ']';
- },websocket_sock_ops:{createPeer:function (sock, addr, port) {
- var ws;
-
- if (typeof addr === 'object') {
- ws = addr;
- addr = null;
- port = null;
- }
-
- if (ws) {
- // for sockets that've already connected (e.g. we're the server)
- // we can inspect the _socket property for the address
- if (ws._socket) {
- addr = ws._socket.remoteAddress;
- port = ws._socket.remotePort;
- }
- // if we're just now initializing a connection to the remote,
- // inspect the url property
- else {
- var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
- if (!result) {
- throw new Error('WebSocket URL must be in the format ws(s)://address:port');
- }
- addr = result[1];
- port = parseInt(result[2], 10);
- }
- } else {
- // create the actual websocket object and connect
- try {
- // runtimeConfig gets set to true if WebSocket runtime configuration is available.
- var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
-
- // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
- // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
- var url = 'ws:#'.replace('#', '//');
-
- if (runtimeConfig) {
- if ('string' === typeof Module['websocket']['url']) {
- url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
- }
- }
-
- if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
- url = url + addr + ':' + port;
- }
-
- // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
- var subProtocols = 'binary'; // The default value is 'binary'
-
- if (runtimeConfig) {
- if ('string' === typeof Module['websocket']['subprotocol']) {
- subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
- }
- }
-
- // The regex trims the string (removes spaces at the beginning and end, then splits the string by
- // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
- subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
-
- // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
- var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
-
- // If node we use the ws library.
- var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
- ws = new WebSocket(url, opts);
- ws.binaryType = 'arraybuffer';
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
- }
- }
-
-
- var peer = {
- addr: addr,
- port: port,
- socket: ws,
- dgram_send_queue: []
- };
-
- SOCKFS.websocket_sock_ops.addPeer(sock, peer);
- SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
-
- // if this is a bound dgram socket, send the port number first to allow
- // us to override the ephemeral port reported to us by remotePort on the
- // remote end.
- if (sock.type === 2 && typeof sock.sport !== 'undefined') {
- peer.dgram_send_queue.push(new Uint8Array([
- 255, 255, 255, 255,
- 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
- ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
- ]));
- }
-
- return peer;
- },getPeer:function (sock, addr, port) {
- return sock.peers[addr + ':' + port];
- },addPeer:function (sock, peer) {
- sock.peers[peer.addr + ':' + peer.port] = peer;
- },removePeer:function (sock, peer) {
- delete sock.peers[peer.addr + ':' + peer.port];
- },handlePeerEvents:function (sock, peer) {
- var first = true;
-
- var handleOpen = function () {
- try {
- var queued = peer.dgram_send_queue.shift();
- while (queued) {
- peer.socket.send(queued);
- queued = peer.dgram_send_queue.shift();
- }
- } catch (e) {
- // not much we can do here in the way of proper error handling as we've already
- // lied and said this data was sent. shut it down.
- peer.socket.close();
- }
- };
-
- function handleMessage(data) {
- assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
- data = new Uint8Array(data); // make a typed array view on the array buffer
-
-
- // if this is the port message, override the peer's port with it
- var wasfirst = first;
- first = false;
- if (wasfirst &&
- data.length === 10 &&
- data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
- data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
- // update the peer's port and it's key in the peer map
- var newport = ((data[8] << 8) | data[9]);
- SOCKFS.websocket_sock_ops.removePeer(sock, peer);
- peer.port = newport;
- SOCKFS.websocket_sock_ops.addPeer(sock, peer);
- return;
- }
-
- sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
- };
-
- if (ENVIRONMENT_IS_NODE) {
- peer.socket.on('open', handleOpen);
- peer.socket.on('message', function(data, flags) {
- if (!flags.binary) {
- return;
- }
- handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
- });
- peer.socket.on('error', function() {
- // don't throw
- });
- } else {
- peer.socket.onopen = handleOpen;
- peer.socket.onmessage = function peer_socket_onmessage(event) {
- handleMessage(event.data);
- };
- }
- },poll:function (sock) {
- if (sock.type === 1 && sock.server) {
- // listen sockets should only say they're available for reading
- // if there are pending clients.
- return sock.pending.length ? (64 | 1) : 0;
- }
-
- var mask = 0;
- var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
- SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
- null;
-
- if (sock.recv_queue.length ||
- !dest || // connection-less sockets are always ready to read
- (dest && dest.socket.readyState === dest.socket.CLOSING) ||
- (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
- mask |= (64 | 1);
- }
-
- if (!dest || // connection-less sockets are always ready to write
- (dest && dest.socket.readyState === dest.socket.OPEN)) {
- mask |= 4;
- }
-
- if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
- (dest && dest.socket.readyState === dest.socket.CLOSED)) {
- mask |= 16;
- }
-
- return mask;
- },ioctl:function (sock, request, arg) {
- switch (request) {
- case 21531:
- var bytes = 0;
- if (sock.recv_queue.length) {
- bytes = sock.recv_queue[0].data.length;
- }
- HEAP32[((arg)>>2)]=bytes;
- return 0;
- default:
- return ERRNO_CODES.EINVAL;
- }
- },close:function (sock) {
- // if we've spawned a listen server, close it
- if (sock.server) {
- try {
- sock.server.close();
- } catch (e) {
- }
- sock.server = null;
- }
- // close any peer connections
- var peers = Object.keys(sock.peers);
- for (var i = 0; i < peers.length; i++) {
- var peer = sock.peers[peers[i]];
- try {
- peer.socket.close();
- } catch (e) {
- }
- SOCKFS.websocket_sock_ops.removePeer(sock, peer);
- }
- return 0;
- },bind:function (sock, addr, port) {
- if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
- }
- sock.saddr = addr;
- sock.sport = port || _mkport();
- // in order to emulate dgram sockets, we need to launch a listen server when
- // binding on a connection-less socket
- // note: this is only required on the server side
- if (sock.type === 2) {
- // close the existing server if it exists
- if (sock.server) {
- sock.server.close();
- sock.server = null;
- }
- // swallow error operation not supported error that occurs when binding in the
- // browser where this isn't supported
- try {
- sock.sock_ops.listen(sock, 0);
- } catch (e) {
- if (!(e instanceof FS.ErrnoError)) throw e;
- if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
- }
- }
- },connect:function (sock, addr, port) {
- if (sock.server) {
- throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
- }
-
- // TODO autobind
- // if (!sock.addr && sock.type == 2) {
- // }
-
- // early out if we're already connected / in the middle of connecting
- if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
- var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
- if (dest) {
- if (dest.socket.readyState === dest.socket.CONNECTING) {
- throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
- } else {
- throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
- }
- }
- }
-
- // add the socket to our peer list and set our
- // destination address / port to match
- var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
- sock.daddr = peer.addr;
- sock.dport = peer.port;
-
- // always "fail" in non-blocking mode
- throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
- },listen:function (sock, backlog) {
- if (!ENVIRONMENT_IS_NODE) {
- throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
- }
- if (sock.server) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
- }
- var WebSocketServer = require('ws').Server;
- var host = sock.saddr;
- sock.server = new WebSocketServer({
- host: host,
- port: sock.sport
- // TODO support backlog
- });
-
- sock.server.on('connection', function(ws) {
- if (sock.type === 1) {
- var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
-
- // create a peer on the new socket
- var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
- newsock.daddr = peer.addr;
- newsock.dport = peer.port;
-
- // push to queue for accept to pick up
- sock.pending.push(newsock);
- } else {
- // create a peer on the listen socket so calling sendto
- // with the listen socket and an address will resolve
- // to the correct client
- SOCKFS.websocket_sock_ops.createPeer(sock, ws);
- }
- });
- sock.server.on('closed', function() {
- sock.server = null;
- });
- sock.server.on('error', function() {
- // don't throw
- });
- },accept:function (listensock) {
- if (!listensock.server) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- var newsock = listensock.pending.shift();
- newsock.stream.flags = listensock.stream.flags;
- return newsock;
- },getname:function (sock, peer) {
- var addr, port;
- if (peer) {
- if (sock.daddr === undefined || sock.dport === undefined) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
- }
- addr = sock.daddr;
- port = sock.dport;
- } else {
- // TODO saddr and sport will be set for bind()'d UDP sockets, but what
- // should we be returning for TCP sockets that've been connect()'d?
- addr = sock.saddr || 0;
- port = sock.sport || 0;
- }
- return { addr: addr, port: port };
- },sendmsg:function (sock, buffer, offset, length, addr, port) {
- if (sock.type === 2) {
- // connection-less sockets will honor the message address,
- // and otherwise fall back to the bound destination address
- if (addr === undefined || port === undefined) {
- addr = sock.daddr;
- port = sock.dport;
- }
- // if there was no address to fall back to, error out
- if (addr === undefined || port === undefined) {
- throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
- }
- } else {
- // connection-based sockets will only use the bound
- addr = sock.daddr;
- port = sock.dport;
- }
-
- // find the peer for the destination address
- var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
-
- // early out if not connected with a connection-based socket
- if (sock.type === 1) {
- if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
- throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
- } else if (dest.socket.readyState === dest.socket.CONNECTING) {
- throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
- }
- }
-
- // create a copy of the incoming data to send, as the WebSocket API
- // doesn't work entirely with an ArrayBufferView, it'll just send
- // the entire underlying buffer
- var data;
- if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
- data = buffer.slice(offset, offset + length);
- } else { // ArrayBufferView
- data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
- }
-
- // if we're emulating a connection-less dgram socket and don't have
- // a cached connection, queue the buffer to send upon connect and
- // lie, saying the data was sent now.
- if (sock.type === 2) {
- if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
- // if we're not connected, open a new connection
- if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
- dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
- }
- dest.dgram_send_queue.push(data);
- return length;
- }
- }
-
- try {
- // send the actual data
- dest.socket.send(data);
- return length;
- } catch (e) {
- throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
- }
- },recvmsg:function (sock, length) {
- // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
- if (sock.type === 1 && sock.server) {
- // tcp servers should not be recv()'ing on the listen socket
- throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
- }
-
- var queued = sock.recv_queue.shift();
- if (!queued) {
- if (sock.type === 1) {
- var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
-
- if (!dest) {
- // if we have a destination address but are not connected, error out
- throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
- }
- else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
- // return null if the socket has closed
- return null;
- }
- else {
- // else, our socket is in a valid state but truly has nothing available
- throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
- }
- } else {
- throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
- }
- }
-
- // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
- // requeued TCP data it'll be an ArrayBufferView
- var queuedLength = queued.data.byteLength || queued.data.length;
- var queuedOffset = queued.data.byteOffset || 0;
- var queuedBuffer = queued.data.buffer || queued.data;
- var bytesRead = Math.min(length, queuedLength);
- var res = {
- buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
- addr: queued.addr,
- port: queued.port
- };
-
-
- // push back any unread data for TCP connections
- if (sock.type === 1 && bytesRead < queuedLength) {
- var bytesRemaining = queuedLength - bytesRead;
- queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
- sock.recv_queue.unshift(queued);
- }
-
- return res;
- }}};function _send(fd, buf, len, flags) {
- var sock = SOCKFS.getSocket(fd);
- if (!sock) {
- ___setErrNo(ERRNO_CODES.EBADF);
- return -1;
- }
- // TODO honor flags
- return _write(fd, buf, len);
- }
-
- function _pwrite(fildes, buf, nbyte, offset) {
- // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
- var stream = FS.getStream(fildes);
- if (!stream) {
- ___setErrNo(ERRNO_CODES.EBADF);
- return -1;
- }
- try {
- var slab = HEAP8;
- return FS.write(stream, slab, buf, nbyte, offset);
- } catch (e) {
- FS.handleFSError(e);
- return -1;
- }
- }function _write(fildes, buf, nbyte) {
- // ssize_t write(int fildes, const void *buf, size_t nbyte);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
- var stream = FS.getStream(fildes);
- if (!stream) {
- ___setErrNo(ERRNO_CODES.EBADF);
- return -1;
- }
-
-
- try {
- var slab = HEAP8;
- return FS.write(stream, slab, buf, nbyte);
- } catch (e) {
- FS.handleFSError(e);
- return -1;
- }
- }
-
- function _fileno(stream) {
- // int fileno(FILE *stream);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
- stream = FS.getStreamFromPtr(stream);
- if (!stream) return -1;
- return stream.fd;
- }function _fwrite(ptr, size, nitems, stream) {
- // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
- var bytesToWrite = nitems * size;
- if (bytesToWrite == 0) return 0;
- var fd = _fileno(stream);
- var bytesWritten = _write(fd, ptr, bytesToWrite);
- if (bytesWritten == -1) {
- var streamObj = FS.getStreamFromPtr(stream);
- if (streamObj) streamObj.error = true;
- return 0;
- } else {
- return Math.floor(bytesWritten / size);
- }
- }
-
-
-
- Module["_strlen"] = _strlen;
-
- function __reallyNegative(x) {
- return x < 0 || (x === 0 && (1/x) === -Infinity);
- }function __formatString(format, varargs) {
- var textIndex = format;
- var argIndex = 0;
- function getNextArg(type) {
- // NOTE: Explicitly ignoring type safety. Otherwise this fails:
- // int x = 4; printf("%c\n", (char)x);
- var ret;
- if (type === 'double') {
- ret = HEAPF64[(((varargs)+(argIndex))>>3)];
- } else if (type == 'i64') {
- ret = [HEAP32[(((varargs)+(argIndex))>>2)],
- HEAP32[(((varargs)+(argIndex+4))>>2)]];
-
- } else {
- type = 'i32'; // varargs are always i32, i64, or double
- ret = HEAP32[(((varargs)+(argIndex))>>2)];
- }
- argIndex += Runtime.getNativeFieldSize(type);
- return ret;
- }
-
- var ret = [];
- var curr, next, currArg;
- while(1) {
- var startTextIndex = textIndex;
- curr = HEAP8[(textIndex)];
- if (curr === 0) break;
- next = HEAP8[((textIndex+1)|0)];
- if (curr == 37) {
- // Handle flags.
- var flagAlwaysSigned = false;
- var flagLeftAlign = false;
- var flagAlternative = false;
- var flagZeroPad = false;
- var flagPadSign = false;
- flagsLoop: while (1) {
- switch (next) {
- case 43:
- flagAlwaysSigned = true;
- break;
- case 45:
- flagLeftAlign = true;
- break;
- case 35:
- flagAlternative = true;
- break;
- case 48:
- if (flagZeroPad) {
- break flagsLoop;
- } else {
- flagZeroPad = true;
- break;
- }
- case 32:
- flagPadSign = true;
- break;
- default:
- break flagsLoop;
- }
- textIndex++;
- next = HEAP8[((textIndex+1)|0)];
- }
-
- // Handle width.
- var width = 0;
- if (next == 42) {
- width = getNextArg('i32');
- textIndex++;
- next = HEAP8[((textIndex+1)|0)];
- } else {
- while (next >= 48 && next <= 57) {
- width = width * 10 + (next - 48);
- textIndex++;
- next = HEAP8[((textIndex+1)|0)];
- }
- }
-
- // Handle precision.
- var precisionSet = false, precision = -1;
- if (next == 46) {
- precision = 0;
- precisionSet = true;
- textIndex++;
- next = HEAP8[((textIndex+1)|0)];
- if (next == 42) {
- precision = getNextArg('i32');
- textIndex++;
- } else {
- while(1) {
- var precisionChr = HEAP8[((textIndex+1)|0)];
- if (precisionChr < 48 ||
- precisionChr > 57) break;
- precision = precision * 10 + (precisionChr - 48);
- textIndex++;
- }
- }
- next = HEAP8[((textIndex+1)|0)];
- }
- if (precision < 0) {
- precision = 6; // Standard default.
- precisionSet = false;
- }
-
- // Handle integer sizes. WARNING: These assume a 32-bit architecture!
- var argSize;
- switch (String.fromCharCode(next)) {
- case 'h':
- var nextNext = HEAP8[((textIndex+2)|0)];
- if (nextNext == 104) {
- textIndex++;
- argSize = 1; // char (actually i32 in varargs)
- } else {
- argSize = 2; // short (actually i32 in varargs)
- }
- break;
- case 'l':
- var nextNext = HEAP8[((textIndex+2)|0)];
- if (nextNext == 108) {
- textIndex++;
- argSize = 8; // long long
- } else {
- argSize = 4; // long
- }
- break;
- case 'L': // long long
- case 'q': // int64_t
- case 'j': // intmax_t
- argSize = 8;
- break;
- case 'z': // size_t
- case 't': // ptrdiff_t
- case 'I': // signed ptrdiff_t or unsigned size_t
- argSize = 4;
- break;
- default:
- argSize = null;
- }
- if (argSize) textIndex++;
- next = HEAP8[((textIndex+1)|0)];
-
- // Handle type specifier.
- switch (String.fromCharCode(next)) {
- case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
- // Integer.
- var signed = next == 100 || next == 105;
- argSize = argSize || 4;
- var currArg = getNextArg('i' + (argSize * 8));
- var argText;
- // Flatten i64-1 [low, high] into a (slightly rounded) double
- if (argSize == 8) {
- currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
- }
- // Truncate to requested size.
- if (argSize <= 4) {
- var limit = Math.pow(256, argSize) - 1;
- currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
- }
- // Format the number.
- var currAbsArg = Math.abs(currArg);
- var prefix = '';
- if (next == 100 || next == 105) {
- argText = reSign(currArg, 8 * argSize, 1).toString(10);
- } else if (next == 117) {
- argText = unSign(currArg, 8 * argSize, 1).toString(10);
- currArg = Math.abs(currArg);
- } else if (next == 111) {
- argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
- } else if (next == 120 || next == 88) {
- prefix = (flagAlternative && currArg != 0) ? '0x' : '';
- if (currArg < 0) {
- // Represent negative numbers in hex as 2's complement.
- currArg = -currArg;
- argText = (currAbsArg - 1).toString(16);
- var buffer = [];
- for (var i = 0; i < argText.length; i++) {
- buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
- }
- argText = buffer.join('');
- while (argText.length < argSize * 2) argText = 'f' + argText;
- } else {
- argText = currAbsArg.toString(16);
- }
- if (next == 88) {
- prefix = prefix.toUpperCase();
- argText = argText.toUpperCase();
- }
- } else if (next == 112) {
- if (currAbsArg === 0) {
- argText = '(nil)';
- } else {
- prefix = '0x';
- argText = currAbsArg.toString(16);
- }
- }
- if (precisionSet) {
- while (argText.length < precision) {
- argText = '0' + argText;
- }
- }
-
- // Add sign if needed
- if (currArg >= 0) {
- if (flagAlwaysSigned) {
- prefix = '+' + prefix;
- } else if (flagPadSign) {
- prefix = ' ' + prefix;
- }
- }
-
- // Move sign to prefix so we zero-pad after the sign
- if (argText.charAt(0) == '-') {
- prefix = '-' + prefix;
- argText = argText.substr(1);
- }
-
- // Add padding.
- while (prefix.length + argText.length < width) {
- if (flagLeftAlign) {
- argText += ' ';
- } else {
- if (flagZeroPad) {
- argText = '0' + argText;
- } else {
- prefix = ' ' + prefix;
- }
- }
- }
-
- // Insert the result into the buffer.
- argText = prefix + argText;
- argText.split('').forEach(function(chr) {
- ret.push(chr.charCodeAt(0));
- });
- break;
- }
- case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
- // Float.
- var currArg = getNextArg('double');
- var argText;
- if (isNaN(currArg)) {
- argText = 'nan';
- flagZeroPad = false;
- } else if (!isFinite(currArg)) {
- argText = (currArg < 0 ? '-' : '') + 'inf';
- flagZeroPad = false;
- } else {
- var isGeneral = false;
- var effectivePrecision = Math.min(precision, 20);
-
- // Convert g/G to f/F or e/E, as per:
- // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
- if (next == 103 || next == 71) {
- isGeneral = true;
- precision = precision || 1;
- var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
- if (precision > exponent && exponent >= -4) {
- next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
- precision -= exponent + 1;
- } else {
- next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
- precision--;
- }
- effectivePrecision = Math.min(precision, 20);
- }
-
- if (next == 101 || next == 69) {
- argText = currArg.toExponential(effectivePrecision);
- // Make sure the exponent has at least 2 digits.
- if (/[eE][-+]\d$/.test(argText)) {
- argText = argText.slice(0, -1) + '0' + argText.slice(-1);
- }
- } else if (next == 102 || next == 70) {
- argText = currArg.toFixed(effectivePrecision);
- if (currArg === 0 && __reallyNegative(currArg)) {
- argText = '-' + argText;
- }
- }
-
- var parts = argText.split('e');
- if (isGeneral && !flagAlternative) {
- // Discard trailing zeros and periods.
- while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
- (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
- parts[0] = parts[0].slice(0, -1);
- }
- } else {
- // Make sure we have a period in alternative mode.
- if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
- // Zero pad until required precision.
- while (precision > effectivePrecision++) parts[0] += '0';
- }
- argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
-
- // Capitalize 'E' if needed.
- if (next == 69) argText = argText.toUpperCase();
-
- // Add sign.
- if (currArg >= 0) {
- if (flagAlwaysSigned) {
- argText = '+' + argText;
- } else if (flagPadSign) {
- argText = ' ' + argText;
- }
- }
- }
-
- // Add padding.
- while (argText.length < width) {
- if (flagLeftAlign) {
- argText += ' ';
- } else {
- if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
- argText = argText[0] + '0' + argText.slice(1);
- } else {
- argText = (flagZeroPad ? '0' : ' ') + argText;
- }
- }
- }
-
- // Adjust case.
- if (next < 97) argText = argText.toUpperCase();
-
- // Insert the result into the buffer.
- argText.split('').forEach(function(chr) {
- ret.push(chr.charCodeAt(0));
- });
- break;
- }
- case 's': {
- // String.
- var arg = getNextArg('i8*');
- var argLength = arg ? _strlen(arg) : '(null)'.length;
- if (precisionSet) argLength = Math.min(argLength, precision);
- if (!flagLeftAlign) {
- while (argLength < width--) {
- ret.push(32);
- }
- }
- if (arg) {
- for (var i = 0; i < argLength; i++) {
- ret.push(HEAPU8[((arg++)|0)]);
- }
- } else {
- ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
- }
- if (flagLeftAlign) {
- while (argLength < width--) {
- ret.push(32);
- }
- }
- break;
- }
- case 'c': {
- // Character.
- if (flagLeftAlign) ret.push(getNextArg('i8'));
- while (--width > 0) {
- ret.push(32);
- }
- if (!flagLeftAlign) ret.push(getNextArg('i8'));
- break;
- }
- case 'n': {
- // Write the length written so far to the next parameter.
- var ptr = getNextArg('i32*');
- HEAP32[((ptr)>>2)]=ret.length;
- break;
- }
- case '%': {
- // Literal percent sign.
- ret.push(curr);
- break;
- }
- default: {
- // Unknown specifiers remain untouched.
- for (var i = startTextIndex; i < textIndex + 2; i++) {
- ret.push(HEAP8[(i)]);
- }
- }
- }
- textIndex += 2;
- // TODO: Support a/A (hex float) and m (last error) specifiers.
- // TODO: Support %1${specifier} for arg selection.
- } else {
- ret.push(curr);
- textIndex += 1;
- }
- }
- return ret;
- }function _fprintf(stream, format, varargs) {
- // int fprintf(FILE *restrict stream, const char *restrict format, ...);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
- var result = __formatString(format, varargs);
- var stack = Runtime.stackSave();
- var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
- Runtime.stackRestore(stack);
- return ret;
- }function _printf(format, varargs) {
- // int printf(const char *restrict format, ...);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
- var stdout = HEAP32[((_stdout)>>2)];
- return _fprintf(stdout, format, varargs);
- }
-
- var _sinf=Math_sin;
-
-
- var _sqrtf=Math_sqrt;
-
- var _floorf=Math_floor;
-
-
- function _fputs(s, stream) {
- // int fputs(const char *restrict s, FILE *restrict stream);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputs.html
- var fd = _fileno(stream);
- return _write(fd, s, _strlen(s));
- }
-
- function _fputc(c, stream) {
- // int fputc(int c, FILE *stream);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
- var chr = unSign(c & 0xFF);
- HEAP8[((_fputc.ret)|0)]=chr;
- var fd = _fileno(stream);
- var ret = _write(fd, _fputc.ret, 1);
- if (ret == -1) {
- var streamObj = FS.getStreamFromPtr(stream);
- if (streamObj) streamObj.error = true;
- return -1;
- } else {
- return chr;
- }
- }function _puts(s) {
- // int puts(const char *s);
- // http://pubs.opengroup.org/onlinepubs/000095399/functions/puts.html
- // NOTE: puts() always writes an extra newline.
- var stdout = HEAP32[((_stdout)>>2)];
- var ret = _fputs(s, stdout);
- if (ret < 0) {
- return ret;
- } else {
- var newlineRet = _fputc(10, stdout);
- return (newlineRet < 0) ? -1 : ret + 1;
- }
- }
-
- function _clock() {
- if (_clock.start === undefined) _clock.start = Date.now();
- return Math.floor((Date.now() - _clock.start) * (1000000/1000));
- }
-
-
- var ___cxa_caught_exceptions=[];function ___cxa_begin_catch(ptr) {
- __ZSt18uncaught_exceptionv.uncaught_exception--;
- ___cxa_caught_exceptions.push(___cxa_last_thrown_exception);
- return ptr;
- }
-
- function ___errno_location() {
- return ___errno_state;
- }
-
-
- function _emscripten_memcpy_big(dest, src, num) {
- HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
- return dest;
- }
- Module["_memcpy"] = _memcpy;
-
- function __ZNSt9exceptionD2Ev() {}
-
- var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
- Browser.mainLoop.shouldPause = true;
- },resume:function () {
- if (Browser.mainLoop.paused) {
- Browser.mainLoop.paused = false;
- Browser.mainLoop.scheduler();
- }
- Browser.mainLoop.shouldPause = false;
- },updateStatus:function () {
- if (Module['setStatus']) {
- var message = Module['statusMessage'] || 'Please wait...';
- var remaining = Browser.mainLoop.remainingBlockers;
- var expected = Browser.mainLoop.expectedBlockers;
- if (remaining) {
- if (remaining < expected) {
- Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
- } else {
- Module['setStatus'](message);
- }
- } else {
- Module['setStatus']('');
- }
- }
- }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
- if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
-
- if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
- Browser.initted = true;
-
- try {
- new Blob();
- Browser.hasBlobConstructor = true;
- } catch(e) {
- Browser.hasBlobConstructor = false;
- console.log("warning: no blob constructor, cannot create blobs with mimetypes");
- }
- Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
- Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
- if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
- console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
- Module.noImageDecoding = true;
- }
-
- // Support for plugins that can process preloaded files. You can add more of these to
- // your app by creating and appending to Module.preloadPlugins.
- //
- // Each plugin is asked if it can handle a file based on the file's name. If it can,
- // it is given the file's raw data. When it is done, it calls a callback with the file's
- // (possibly modified) data. For example, a plugin might decompress a file, or it
- // might create some side data structure for use later (like an Image element, etc.).
-
- var imagePlugin = {};
- imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
- return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
- };
- imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
- var b = null;
- if (Browser.hasBlobConstructor) {
- try {
- b = new Blob([byteArray], { type: Browser.getMimetype(name) });
- if (b.size !== byteArray.length) { // Safari bug #118630
- // Safari's Blob can only take an ArrayBuffer
- b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
- }
- } catch(e) {
- Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
- }
- }
- if (!b) {
- var bb = new Browser.BlobBuilder();
- bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
- b = bb.getBlob();
- }
- var url = Browser.URLObject.createObjectURL(b);
- var img = new Image();
- img.onload = function img_onload() {
- assert(img.complete, 'Image ' + name + ' could not be decoded');
- var canvas = document.createElement('canvas');
- canvas.width = img.width;
- canvas.height = img.height;
- var ctx = canvas.getContext('2d');
- ctx.drawImage(img, 0, 0);
- Module["preloadedImages"][name] = canvas;
- Browser.URLObject.revokeObjectURL(url);
- if (onload) onload(byteArray);
- };
- img.onerror = function img_onerror(event) {
- console.log('Image ' + url + ' could not be decoded');
- if (onerror) onerror();
- };
- img.src = url;
- };
- Module['preloadPlugins'].push(imagePlugin);
-
- var audioPlugin = {};
- audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
- return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
- };
- audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
- var done = false;
- function finish(audio) {
- if (done) return;
- done = true;
- Module["preloadedAudios"][name] = audio;
- if (onload) onload(byteArray);
- }
- function fail() {
- if (done) return;
- done = true;
- Module["preloadedAudios"][name] = new Audio(); // empty shim
- if (onerror) onerror();
- }
- if (Browser.hasBlobConstructor) {
- try {
- var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
- } catch(e) {
- return fail();
- }
- var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
- var audio = new Audio();
- audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
- audio.onerror = function audio_onerror(event) {
- if (done) return;
- console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
- function encode64(data) {
- var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
- var PAD = '=';
- var ret = '';
- var leftchar = 0;
- var leftbits = 0;
- for (var i = 0; i < data.length; i++) {
- leftchar = (leftchar << 8) | data[i];
- leftbits += 8;
- while (leftbits >= 6) {
- var curr = (leftchar >> (leftbits-6)) & 0x3f;
- leftbits -= 6;
- ret += BASE[curr];
- }
- }
- if (leftbits == 2) {
- ret += BASE[(leftchar&3) << 4];
- ret += PAD + PAD;
- } else if (leftbits == 4) {
- ret += BASE[(leftchar&0xf) << 2];
- ret += PAD;
- }
- return ret;
- }
- audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
- finish(audio); // we don't wait for confirmation this worked - but it's worth trying
- };
- audio.src = url;
- // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
- Browser.safeSetTimeout(function() {
- finish(audio); // try to use it even though it is not necessarily ready to play
- }, 10000);
- } else {
- return fail();
- }
- };
- Module['preloadPlugins'].push(audioPlugin);
-
- // Canvas event setup
-
- var canvas = Module['canvas'];
-
- // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
- // Module['forcedAspectRatio'] = 4 / 3;
-
- canvas.requestPointerLock = canvas['requestPointerLock'] ||
- canvas['mozRequestPointerLock'] ||
- canvas['webkitRequestPointerLock'] ||
- canvas['msRequestPointerLock'] ||
- function(){};
- canvas.exitPointerLock = document['exitPointerLock'] ||
- document['mozExitPointerLock'] ||
- document['webkitExitPointerLock'] ||
- document['msExitPointerLock'] ||
- function(){}; // no-op if function does not exist
- canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
-
- function pointerLockChange() {
- Browser.pointerLock = document['pointerLockElement'] === canvas ||
- document['mozPointerLockElement'] === canvas ||
- document['webkitPointerLockElement'] === canvas ||
- document['msPointerLockElement'] === canvas;
- }
-
- document.addEventListener('pointerlockchange', pointerLockChange, false);
- document.addEventListener('mozpointerlockchange', pointerLockChange, false);
- document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
- document.addEventListener('mspointerlockchange', pointerLockChange, false);
-
- if (Module['elementPointerLock']) {
- canvas.addEventListener("click", function(ev) {
- if (!Browser.pointerLock && canvas.requestPointerLock) {
- canvas.requestPointerLock();
- ev.preventDefault();
- }
- }, false);
- }
- },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
- var ctx;
- var errorInfo = '?';
- function onContextCreationError(event) {
- errorInfo = event.statusMessage || errorInfo;
- }
- try {
- if (useWebGL) {
- var contextAttributes = {
- antialias: false,
- alpha: false
- };
-
- if (webGLContextAttributes) {
- for (var attribute in webGLContextAttributes) {
- contextAttributes[attribute] = webGLContextAttributes[attribute];
- }
- }
-
-
- canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
- try {
- ['experimental-webgl', 'webgl'].some(function(webglId) {
- return ctx = canvas.getContext(webglId, contextAttributes);
- });
- } finally {
- canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
- }
- } else {
- ctx = canvas.getContext('2d');
- }
- if (!ctx) throw ':(';
- } catch (e) {
- Module.print('Could not create canvas: ' + [errorInfo, e]);
- return null;
- }
- if (useWebGL) {
- // Set the background of the WebGL canvas to black
- canvas.style.backgroundColor = "black";
-
- // Warn on context loss
- canvas.addEventListener('webglcontextlost', function(event) {
- alert('WebGL context lost. You will need to reload the page.');
- }, false);
- }
- if (setInModule) {
- GLctx = Module.ctx = ctx;
- Module.useWebGL = useWebGL;
- Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
- Browser.init();
- }
- return ctx;
- },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
- Browser.lockPointer = lockPointer;
- Browser.resizeCanvas = resizeCanvas;
- if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
- if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
-
- var canvas = Module['canvas'];
- function fullScreenChange() {
- Browser.isFullScreen = false;
- var canvasContainer = canvas.parentNode;
- if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
- document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
- document['fullScreenElement'] || document['fullscreenElement'] ||
- document['msFullScreenElement'] || document['msFullscreenElement'] ||
- document['webkitCurrentFullScreenElement']) === canvasContainer) {
- canvas.cancelFullScreen = document['cancelFullScreen'] ||
- document['mozCancelFullScreen'] ||
- document['webkitCancelFullScreen'] ||
- document['msExitFullscreen'] ||
- document['exitFullscreen'] ||
- function() {};
- canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
- if (Browser.lockPointer) canvas.requestPointerLock();
- Browser.isFullScreen = true;
- if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
- } else {
-
- // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
- canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
- canvasContainer.parentNode.removeChild(canvasContainer);
-
- if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
- }
- if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
- Browser.updateCanvasDimensions(canvas);
- }
-
- if (!Browser.fullScreenHandlersInstalled) {
- Browser.fullScreenHandlersInstalled = true;
- document.addEventListener('fullscreenchange', fullScreenChange, false);
- document.addEventListener('mozfullscreenchange', fullScreenChange, false);
- document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
- document.addEventListener('MSFullscreenChange', fullScreenChange, false);
- }
-
- // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
- var canvasContainer = document.createElement("div");
- canvas.parentNode.insertBefore(canvasContainer, canvas);
- canvasContainer.appendChild(canvas);
-
- // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
- canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
- canvasContainer['mozRequestFullScreen'] ||
- canvasContainer['msRequestFullscreen'] ||
- (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
- canvasContainer.requestFullScreen();
- },requestAnimationFrame:function requestAnimationFrame(func) {
- if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
- setTimeout(func, 1000/60);
- } else {
- if (!window.requestAnimationFrame) {
- window.requestAnimationFrame = window['requestAnimationFrame'] ||
- window['mozRequestAnimationFrame'] ||
- window['webkitRequestAnimationFrame'] ||
- window['msRequestAnimationFrame'] ||
- window['oRequestAnimationFrame'] ||
- window['setTimeout'];
- }
- window.requestAnimationFrame(func);
- }
- },safeCallback:function (func) {
- return function() {
- if (!ABORT) return func.apply(null, arguments);
- };
- },safeRequestAnimationFrame:function (func) {
- return Browser.requestAnimationFrame(function() {
- if (!ABORT) func();
- });
- },safeSetTimeout:function (func, timeout) {
- return setTimeout(function() {
- if (!ABORT) func();
- }, timeout);
- },safeSetInterval:function (func, timeout) {
- return setInterval(function() {
- if (!ABORT) func();
- }, timeout);
- },getMimetype:function (name) {
- return {
- 'jpg': 'image/jpeg',
- 'jpeg': 'image/jpeg',
- 'png': 'image/png',
- 'bmp': 'image/bmp',
- 'ogg': 'audio/ogg',
- 'wav': 'audio/wav',
- 'mp3': 'audio/mpeg'
- }[name.substr(name.lastIndexOf('.')+1)];
- },getUserMedia:function (func) {
- if(!window.getUserMedia) {
- window.getUserMedia = navigator['getUserMedia'] ||
- navigator['mozGetUserMedia'];
- }
- window.getUserMedia(func);
- },getMovementX:function (event) {
- return event['movementX'] ||
- event['mozMovementX'] ||
- event['webkitMovementX'] ||
- 0;
- },getMovementY:function (event) {
- return event['movementY'] ||
- event['mozMovementY'] ||
- event['webkitMovementY'] ||
- 0;
- },getMouseWheelDelta:function (event) {
- return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
- },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
- if (Browser.pointerLock) {
- // When the pointer is locked, calculate the coordinates
- // based on the movement of the mouse.
- // Workaround for Firefox bug 764498
- if (event.type != 'mousemove' &&
- ('mozMovementX' in event)) {
- Browser.mouseMovementX = Browser.mouseMovementY = 0;
- } else {
- Browser.mouseMovementX = Browser.getMovementX(event);
- Browser.mouseMovementY = Browser.getMovementY(event);
- }
-
- // check if SDL is available
- if (typeof SDL != "undefined") {
- Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
- Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
- } else {
- // just add the mouse delta to the current absolut mouse position
- // FIXME: ideally this should be clamped against the canvas size and zero
- Browser.mouseX += Browser.mouseMovementX;
- Browser.mouseY += Browser.mouseMovementY;
- }
- } else {
- // Otherwise, calculate the movement based on the changes
- // in the coordinates.
- var rect = Module["canvas"].getBoundingClientRect();
- var x, y;
-
- // Neither .scrollX or .pageXOffset are defined in a spec, but
- // we prefer .scrollX because it is currently in a spec draft.
- // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
- var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
- var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
- if (event.type == 'touchstart' ||
- event.type == 'touchend' ||
- event.type == 'touchmove') {
- var t = event.touches.item(0);
- if (t) {
- x = t.pageX - (scrollX + rect.left);
- y = t.pageY - (scrollY + rect.top);
- } else {
- return;
- }
- } else {
- x = event.pageX - (scrollX + rect.left);
- y = event.pageY - (scrollY + rect.top);
- }
-
- // the canvas might be CSS-scaled compared to its backbuffer;
- // SDL-using content will want mouse coordinates in terms
- // of backbuffer units.
- var cw = Module["canvas"].width;
- var ch = Module["canvas"].height;
- x = x * (cw / rect.width);
- y = y * (ch / rect.height);
-
- Browser.mouseMovementX = x - Browser.mouseX;
- Browser.mouseMovementY = y - Browser.mouseY;
- Browser.mouseX = x;
- Browser.mouseY = y;
- }
- },xhrLoad:function (url, onload, onerror) {
- var xhr = new XMLHttpRequest();
- xhr.open('GET', url, true);
- xhr.responseType = 'arraybuffer';
- xhr.onload = function xhr_onload() {
- if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
- onload(xhr.response);
- } else {
- onerror();
- }
- };
- xhr.onerror = onerror;
- xhr.send(null);
- },asyncLoad:function (url, onload, onerror, noRunDep) {
- Browser.xhrLoad(url, function(arrayBuffer) {
- assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
- onload(new Uint8Array(arrayBuffer));
- if (!noRunDep) removeRunDependency('al ' + url);
- }, function(event) {
- if (onerror) {
- onerror();
- } else {
- throw 'Loading data file "' + url + '" failed.';
- }
- });
- if (!noRunDep) addRunDependency('al ' + url);
- },resizeListeners:[],updateResizeListeners:function () {
- var canvas = Module['canvas'];
- Browser.resizeListeners.forEach(function(listener) {
- listener(canvas.width, canvas.height);
- });
- },setCanvasSize:function (width, height, noUpdates) {
- var canvas = Module['canvas'];
- Browser.updateCanvasDimensions(canvas, width, height);
- if (!noUpdates) Browser.updateResizeListeners();
- },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
- // check if SDL is available
- if (typeof SDL != "undefined") {
- var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
- flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
- HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
- }
- Browser.updateResizeListeners();
- },setWindowedCanvasSize:function () {
- // check if SDL is available
- if (typeof SDL != "undefined") {
- var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
- flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
- HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
- }
- Browser.updateResizeListeners();
- },updateCanvasDimensions:function (canvas, wNative, hNative) {
- if (wNative && hNative) {
- canvas.widthNative = wNative;
- canvas.heightNative = hNative;
- } else {
- wNative = canvas.widthNative;
- hNative = canvas.heightNative;
- }
- var w = wNative;
- var h = hNative;
- if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
- if (w/h < Module['forcedAspectRatio']) {
- w = Math.round(h * Module['forcedAspectRatio']);
- } else {
- h = Math.round(w / Module['forcedAspectRatio']);
- }
- }
- if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
- document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
- document['fullScreenElement'] || document['fullscreenElement'] ||
- document['msFullScreenElement'] || document['msFullscreenElement'] ||
- document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
- var factor = Math.min(screen.width / w, screen.height / h);
- w = Math.round(w * factor);
- h = Math.round(h * factor);
- }
- if (Browser.resizeCanvas) {
- if (canvas.width != w) canvas.width = w;
- if (canvas.height != h) canvas.height = h;
- if (typeof canvas.style != 'undefined') {
- canvas.style.removeProperty( "width");
- canvas.style.removeProperty("height");
- }
- } else {
- if (canvas.width != wNative) canvas.width = wNative;
- if (canvas.height != hNative) canvas.height = hNative;
- if (typeof canvas.style != 'undefined') {
- if (w != wNative || h != hNative) {
- canvas.style.setProperty( "width", w + "px", "important");
- canvas.style.setProperty("height", h + "px", "important");
- } else {
- canvas.style.removeProperty( "width");
- canvas.style.removeProperty("height");
- }
- }
- }
- }};
-
- function _sbrk(bytes) {
- // Implement a Linux-like 'memory area' for our 'process'.
- // Changes the size of the memory area by |bytes|; returns the
- // address of the previous top ('break') of the memory area
- // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
- var self = _sbrk;
- if (!self.called) {
- DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
- self.called = true;
- assert(Runtime.dynamicAlloc);
- self.alloc = Runtime.dynamicAlloc;
- Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
- }
- var ret = DYNAMICTOP;
- if (bytes != 0) self.alloc(bytes);
- return ret; // Previous break location.
- }
-
- function _sysconf(name) {
- // long sysconf(int name);
- // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
- switch(name) {
- case 30: return PAGE_SIZE;
- case 132:
- case 133:
- case 12:
- case 137:
- case 138:
- case 15:
- case 235:
- case 16:
- case 17:
- case 18:
- case 19:
- case 20:
- case 149:
- case 13:
- case 10:
- case 236:
- case 153:
- case 9:
- case 21:
- case 22:
- case 159:
- case 154:
- case 14:
- case 77:
- case 78:
- case 139:
- case 80:
- case 81:
- case 79:
- case 82:
- case 68:
- case 67:
- case 164:
- case 11:
- case 29:
- case 47:
- case 48:
- case 95:
- case 52:
- case 51:
- case 46:
- return 200809;
- case 27:
- case 246:
- case 127:
- case 128:
- case 23:
- case 24:
- case 160:
- case 161:
- case 181:
- case 182:
- case 242:
- case 183:
- case 184:
- case 243:
- case 244:
- case 245:
- case 165:
- case 178:
- case 179:
- case 49:
- case 50:
- case 168:
- case 169:
- case 175:
- case 170:
- case 171:
- case 172:
- case 97:
- case 76:
- case 32:
- case 173:
- case 35:
- return -1;
- case 176:
- case 177:
- case 7:
- case 155:
- case 8:
- case 157:
- case 125:
- case 126:
- case 92:
- case 93:
- case 129:
- case 130:
- case 131:
- case 94:
- case 91:
- return 1;
- case 74:
- case 60:
- case 69:
- case 70:
- case 4:
- return 1024;
- case 31:
- case 42:
- case 72:
- return 32;
- case 87:
- case 26:
- case 33:
- return 2147483647;
- case 34:
- case 1:
- return 47839;
- case 38:
- case 36:
- return 99;
- case 43:
- case 37:
- return 2048;
- case 0: return 2097152;
- case 3: return 65536;
- case 28: return 32768;
- case 44: return 32767;
- case 75: return 16384;
- case 39: return 1000;
- case 89: return 700;
- case 71: return 256;
- case 40: return 255;
- case 2: return 100;
- case 180: return 64;
- case 25: return 20;
- case 5: return 16;
- case 6: return 6;
- case 73: return 4;
- case 84: return 1;
- }
- ___setErrNo(ERRNO_CODES.EINVAL);
- return -1;
- }
-
- function _emscripten_run_script(ptr) {
- eval(Pointer_stringify(ptr));
- }
-
-
- function _malloc(bytes) {
- /* Over-allocate to make sure it is byte-aligned by 8.
- * This will leak memory, but this is only the dummy
- * implementation (replaced by dlmalloc normally) so
- * not an issue.
- */
- var ptr = Runtime.dynamicAlloc(bytes + 8);
- return (ptr+8) & 0xFFFFFFF8;
- }
- Module["_malloc"] = _malloc;function ___cxa_allocate_exception(size) {
- var ptr = _malloc(size + ___cxa_exception_header_size);
- return ptr + ___cxa_exception_header_size;
- }
-
- function _emscripten_cancel_main_loop() {
- Browser.mainLoop.scheduler = null;
- Browser.mainLoop.shouldPause = true;
- }
-
- var __ZTISt9exception=allocate([allocate([1,0,0,0,0,0,0], "i8", ALLOC_STATIC)+8, 0], "i32", ALLOC_STATIC);
-FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
-___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
-__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
-if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
-__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
-_fputc.ret = allocate([0], "i8", ALLOC_STATIC);
-Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
- Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
- Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
- Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
- Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
- Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
-STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
-
-staticSealed = true; // seal the static portion of memory
-
-STACK_MAX = STACK_BASE + 5242880;
-
-DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
-
-assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
-
-
-var Math_min = Math.min;
-function invoke_iiii(index,a1,a2,a3) {
- try {
- return Module["dynCall_iiii"](index,a1,a2,a3);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_viiiii(index,a1,a2,a3,a4,a5) {
- try {
- Module["dynCall_viiiii"](index,a1,a2,a3,a4,a5);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_vi(index,a1) {
- try {
- Module["dynCall_vi"](index,a1);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_vii(index,a1,a2) {
- try {
- Module["dynCall_vii"](index,a1,a2);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_ii(index,a1) {
- try {
- return Module["dynCall_ii"](index,a1);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_viii(index,a1,a2,a3) {
- try {
- Module["dynCall_viii"](index,a1,a2,a3);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_v(index) {
- try {
- Module["dynCall_v"](index);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_viid(index,a1,a2,a3) {
- try {
- Module["dynCall_viid"](index,a1,a2,a3);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_viiiiii(index,a1,a2,a3,a4,a5,a6) {
- try {
- Module["dynCall_viiiiii"](index,a1,a2,a3,a4,a5,a6);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_iii(index,a1,a2) {
- try {
- return Module["dynCall_iii"](index,a1,a2);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_iiiiii(index,a1,a2,a3,a4,a5) {
- try {
- return Module["dynCall_iiiiii"](index,a1,a2,a3,a4,a5);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function invoke_viiii(index,a1,a2,a3,a4) {
- try {
- Module["dynCall_viiii"](index,a1,a2,a3,a4);
- } catch(e) {
- if (typeof e !== 'number' && e !== 'longjmp') throw e;
- asm["setThrew"](1, 0);
- }
-}
-
-function asmPrintInt(x, y) {
- Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
-}
-function asmPrintFloat(x, y) {
- Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
-}
-// EMSCRIPTEN_START_ASM
-var asm = (function(global, env, buffer) {
- 'use asm';
- var HEAP8 = new global.Int8Array(buffer);
- var HEAP16 = new global.Int16Array(buffer);
- var HEAP32 = new global.Int32Array(buffer);
- var HEAPU8 = new global.Uint8Array(buffer);
- var HEAPU16 = new global.Uint16Array(buffer);
- var HEAPU32 = new global.Uint32Array(buffer);
- var HEAPF32 = new global.Float32Array(buffer);
- var HEAPF64 = new global.Float64Array(buffer);
-
- var STACKTOP=env.STACKTOP|0;
- var STACK_MAX=env.STACK_MAX|0;
- var tempDoublePtr=env.tempDoublePtr|0;
- var ABORT=env.ABORT|0;
- var __ZTISt9exception=env.__ZTISt9exception|0;
-
- var __THREW__ = 0;
- var threwValue = 0;
- var setjmpId = 0;
- var undef = 0;
- var nan = +env.NaN, inf = +env.Infinity;
- var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
-
- var tempRet0 = 0;
- var tempRet1 = 0;
- var tempRet2 = 0;
- var tempRet3 = 0;
- var tempRet4 = 0;
- var tempRet5 = 0;
- var tempRet6 = 0;
- var tempRet7 = 0;
- var tempRet8 = 0;
- var tempRet9 = 0;
- var Math_floor=global.Math.floor;
- var Math_abs=global.Math.abs;
- var Math_sqrt=global.Math.sqrt;
- var Math_pow=global.Math.pow;
- var Math_cos=global.Math.cos;
- var Math_sin=global.Math.sin;
- var Math_tan=global.Math.tan;
- var Math_acos=global.Math.acos;
- var Math_asin=global.Math.asin;
- var Math_atan=global.Math.atan;
- var Math_atan2=global.Math.atan2;
- var Math_exp=global.Math.exp;
- var Math_log=global.Math.log;
- var Math_ceil=global.Math.ceil;
- var Math_imul=global.Math.imul;
- var abort=env.abort;
- var assert=env.assert;
- var asmPrintInt=env.asmPrintInt;
- var asmPrintFloat=env.asmPrintFloat;
- var Math_min=env.min;
- var invoke_iiii=env.invoke_iiii;
- var invoke_viiiii=env.invoke_viiiii;
- var invoke_vi=env.invoke_vi;
- var invoke_vii=env.invoke_vii;
- var invoke_ii=env.invoke_ii;
- var invoke_viii=env.invoke_viii;
- var invoke_v=env.invoke_v;
- var invoke_viid=env.invoke_viid;
- var invoke_viiiiii=env.invoke_viiiiii;
- var invoke_iii=env.invoke_iii;
- var invoke_iiiiii=env.invoke_iiiiii;
- var invoke_viiii=env.invoke_viiii;
- var ___cxa_throw=env.___cxa_throw;
- var _emscripten_run_script=env._emscripten_run_script;
- var _cosf=env._cosf;
- var _send=env._send;
- var __ZSt9terminatev=env.__ZSt9terminatev;
- var __reallyNegative=env.__reallyNegative;
- var ___cxa_is_number_type=env.___cxa_is_number_type;
- var ___assert_fail=env.___assert_fail;
- var ___cxa_allocate_exception=env.___cxa_allocate_exception;
- var ___cxa_find_matching_catch=env.___cxa_find_matching_catch;
- var _fflush=env._fflush;
- var _pwrite=env._pwrite;
- var ___setErrNo=env.___setErrNo;
- var _sbrk=env._sbrk;
- var ___cxa_begin_catch=env.___cxa_begin_catch;
- var _sinf=env._sinf;
- var _fileno=env._fileno;
- var ___resumeException=env.___resumeException;
- var __ZSt18uncaught_exceptionv=env.__ZSt18uncaught_exceptionv;
- var _sysconf=env._sysconf;
- var _clock=env._clock;
- var _emscripten_memcpy_big=env._emscripten_memcpy_big;
- var _puts=env._puts;
- var _mkport=env._mkport;
- var _floorf=env._floorf;
- var _sqrtf=env._sqrtf;
- var _write=env._write;
- var _emscripten_set_main_loop=env._emscripten_set_main_loop;
- var ___errno_location=env.___errno_location;
- var __ZNSt9exceptionD2Ev=env.__ZNSt9exceptionD2Ev;
- var _printf=env._printf;
- var ___cxa_does_inherit=env.___cxa_does_inherit;
- var __exit=env.__exit;
- var _fputc=env._fputc;
- var _abort=env._abort;
- var _fwrite=env._fwrite;
- var _time=env._time;
- var _fprintf=env._fprintf;
- var _emscripten_cancel_main_loop=env._emscripten_cancel_main_loop;
- var __formatString=env.__formatString;
- var _fputs=env._fputs;
- var _exit=env._exit;
- var ___cxa_pure_virtual=env.___cxa_pure_virtual;
- var tempFloat = 0.0;
-
-// EMSCRIPTEN_START_FUNCS
-function _malloc(i12) {
- i12 = i12 | 0;
- var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
- i1 = STACKTOP;
- do {
- if (i12 >>> 0 < 245) {
- if (i12 >>> 0 < 11) {
- i12 = 16;
- } else {
- i12 = i12 + 11 & -8;
- }
- i20 = i12 >>> 3;
- i18 = HEAP32[1790] | 0;
- i21 = i18 >>> i20;
- if ((i21 & 3 | 0) != 0) {
- i6 = (i21 & 1 ^ 1) + i20 | 0;
- i5 = i6 << 1;
- i3 = 7200 + (i5 << 2) | 0;
- i5 = 7200 + (i5 + 2 << 2) | 0;
- i7 = HEAP32[i5 >> 2] | 0;
- i2 = i7 + 8 | 0;
- i4 = HEAP32[i2 >> 2] | 0;
- do {
- if ((i3 | 0) != (i4 | 0)) {
- if (i4 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i8 = i4 + 12 | 0;
- if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
- HEAP32[i8 >> 2] = i3;
- HEAP32[i5 >> 2] = i4;
- break;
- } else {
- _abort();
- }
- } else {
- HEAP32[1790] = i18 & ~(1 << i6);
- }
- } while (0);
- i32 = i6 << 3;
- HEAP32[i7 + 4 >> 2] = i32 | 3;
- i32 = i7 + (i32 | 4) | 0;
- HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
- i32 = i2;
- STACKTOP = i1;
- return i32 | 0;
- }
- if (i12 >>> 0 > (HEAP32[7168 >> 2] | 0) >>> 0) {
- if ((i21 | 0) != 0) {
- i7 = 2 << i20;
- i7 = i21 << i20 & (i7 | 0 - i7);
- i7 = (i7 & 0 - i7) + -1 | 0;
- i2 = i7 >>> 12 & 16;
- i7 = i7 >>> i2;
- i6 = i7 >>> 5 & 8;
- i7 = i7 >>> i6;
- i5 = i7 >>> 2 & 4;
- i7 = i7 >>> i5;
- i4 = i7 >>> 1 & 2;
- i7 = i7 >>> i4;
- i3 = i7 >>> 1 & 1;
- i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
- i7 = i3 << 1;
- i4 = 7200 + (i7 << 2) | 0;
- i7 = 7200 + (i7 + 2 << 2) | 0;
- i5 = HEAP32[i7 >> 2] | 0;
- i2 = i5 + 8 | 0;
- i6 = HEAP32[i2 >> 2] | 0;
- do {
- if ((i4 | 0) != (i6 | 0)) {
- if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i8 = i6 + 12 | 0;
- if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
- HEAP32[i8 >> 2] = i4;
- HEAP32[i7 >> 2] = i6;
- break;
- } else {
- _abort();
- }
- } else {
- HEAP32[1790] = i18 & ~(1 << i3);
- }
- } while (0);
- i6 = i3 << 3;
- i4 = i6 - i12 | 0;
- HEAP32[i5 + 4 >> 2] = i12 | 3;
- i3 = i5 + i12 | 0;
- HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
- HEAP32[i5 + i6 >> 2] = i4;
- i6 = HEAP32[7168 >> 2] | 0;
- if ((i6 | 0) != 0) {
- i5 = HEAP32[7180 >> 2] | 0;
- i8 = i6 >>> 3;
- i9 = i8 << 1;
- i6 = 7200 + (i9 << 2) | 0;
- i7 = HEAP32[1790] | 0;
- i8 = 1 << i8;
- if ((i7 & i8 | 0) != 0) {
- i7 = 7200 + (i9 + 2 << 2) | 0;
- i8 = HEAP32[i7 >> 2] | 0;
- if (i8 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- i28 = i7;
- i27 = i8;
- }
- } else {
- HEAP32[1790] = i7 | i8;
- i28 = 7200 + (i9 + 2 << 2) | 0;
- i27 = i6;
- }
- HEAP32[i28 >> 2] = i5;
- HEAP32[i27 + 12 >> 2] = i5;
- HEAP32[i5 + 8 >> 2] = i27;
- HEAP32[i5 + 12 >> 2] = i6;
- }
- HEAP32[7168 >> 2] = i4;
- HEAP32[7180 >> 2] = i3;
- i32 = i2;
- STACKTOP = i1;
- return i32 | 0;
- }
- i18 = HEAP32[7164 >> 2] | 0;
- if ((i18 | 0) != 0) {
- i2 = (i18 & 0 - i18) + -1 | 0;
- i31 = i2 >>> 12 & 16;
- i2 = i2 >>> i31;
- i30 = i2 >>> 5 & 8;
- i2 = i2 >>> i30;
- i32 = i2 >>> 2 & 4;
- i2 = i2 >>> i32;
- i6 = i2 >>> 1 & 2;
- i2 = i2 >>> i6;
- i3 = i2 >>> 1 & 1;
- i3 = HEAP32[7464 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
- i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
- i6 = i3;
- while (1) {
- i5 = HEAP32[i6 + 16 >> 2] | 0;
- if ((i5 | 0) == 0) {
- i5 = HEAP32[i6 + 20 >> 2] | 0;
- if ((i5 | 0) == 0) {
- break;
- }
- }
- i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
- i4 = i6 >>> 0 < i2 >>> 0;
- i2 = i4 ? i6 : i2;
- i6 = i5;
- i3 = i4 ? i5 : i3;
- }
- i6 = HEAP32[7176 >> 2] | 0;
- if (i3 >>> 0 < i6 >>> 0) {
- _abort();
- }
- i4 = i3 + i12 | 0;
- if (!(i3 >>> 0 < i4 >>> 0)) {
- _abort();
- }
- i5 = HEAP32[i3 + 24 >> 2] | 0;
- i7 = HEAP32[i3 + 12 >> 2] | 0;
- do {
- if ((i7 | 0) == (i3 | 0)) {
- i8 = i3 + 20 | 0;
- i7 = HEAP32[i8 >> 2] | 0;
- if ((i7 | 0) == 0) {
- i8 = i3 + 16 | 0;
- i7 = HEAP32[i8 >> 2] | 0;
- if ((i7 | 0) == 0) {
- i26 = 0;
- break;
- }
- }
- while (1) {
- i10 = i7 + 20 | 0;
- i9 = HEAP32[i10 >> 2] | 0;
- if ((i9 | 0) != 0) {
- i7 = i9;
- i8 = i10;
- continue;
- }
- i10 = i7 + 16 | 0;
- i9 = HEAP32[i10 >> 2] | 0;
- if ((i9 | 0) == 0) {
- break;
- } else {
- i7 = i9;
- i8 = i10;
- }
- }
- if (i8 >>> 0 < i6 >>> 0) {
- _abort();
- } else {
- HEAP32[i8 >> 2] = 0;
- i26 = i7;
- break;
- }
- } else {
- i8 = HEAP32[i3 + 8 >> 2] | 0;
- if (i8 >>> 0 < i6 >>> 0) {
- _abort();
- }
- i6 = i8 + 12 | 0;
- if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
- _abort();
- }
- i9 = i7 + 8 | 0;
- if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
- HEAP32[i6 >> 2] = i7;
- HEAP32[i9 >> 2] = i8;
- i26 = i7;
- break;
- } else {
- _abort();
- }
- }
- } while (0);
- do {
- if ((i5 | 0) != 0) {
- i7 = HEAP32[i3 + 28 >> 2] | 0;
- i6 = 7464 + (i7 << 2) | 0;
- if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
- HEAP32[i6 >> 2] = i26;
- if ((i26 | 0) == 0) {
- HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i7);
- break;
- }
- } else {
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i6 = i5 + 16 | 0;
- if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
- HEAP32[i6 >> 2] = i26;
- } else {
- HEAP32[i5 + 20 >> 2] = i26;
- }
- if ((i26 | 0) == 0) {
- break;
- }
- }
- if (i26 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- HEAP32[i26 + 24 >> 2] = i5;
- i5 = HEAP32[i3 + 16 >> 2] | 0;
- do {
- if ((i5 | 0) != 0) {
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i26 + 16 >> 2] = i5;
- HEAP32[i5 + 24 >> 2] = i26;
- break;
- }
- }
- } while (0);
- i5 = HEAP32[i3 + 20 >> 2] | 0;
- if ((i5 | 0) != 0) {
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i26 + 20 >> 2] = i5;
- HEAP32[i5 + 24 >> 2] = i26;
- break;
- }
- }
- }
- } while (0);
- if (i2 >>> 0 < 16) {
- i32 = i2 + i12 | 0;
- HEAP32[i3 + 4 >> 2] = i32 | 3;
- i32 = i3 + (i32 + 4) | 0;
- HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
- } else {
- HEAP32[i3 + 4 >> 2] = i12 | 3;
- HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
- HEAP32[i3 + (i2 + i12) >> 2] = i2;
- i6 = HEAP32[7168 >> 2] | 0;
- if ((i6 | 0) != 0) {
- i5 = HEAP32[7180 >> 2] | 0;
- i8 = i6 >>> 3;
- i9 = i8 << 1;
- i6 = 7200 + (i9 << 2) | 0;
- i7 = HEAP32[1790] | 0;
- i8 = 1 << i8;
- if ((i7 & i8 | 0) != 0) {
- i7 = 7200 + (i9 + 2 << 2) | 0;
- i8 = HEAP32[i7 >> 2] | 0;
- if (i8 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- i25 = i7;
- i24 = i8;
- }
- } else {
- HEAP32[1790] = i7 | i8;
- i25 = 7200 + (i9 + 2 << 2) | 0;
- i24 = i6;
- }
- HEAP32[i25 >> 2] = i5;
- HEAP32[i24 + 12 >> 2] = i5;
- HEAP32[i5 + 8 >> 2] = i24;
- HEAP32[i5 + 12 >> 2] = i6;
- }
- HEAP32[7168 >> 2] = i2;
- HEAP32[7180 >> 2] = i4;
- }
- i32 = i3 + 8 | 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- }
- } else {
- if (!(i12 >>> 0 > 4294967231)) {
- i24 = i12 + 11 | 0;
- i12 = i24 & -8;
- i26 = HEAP32[7164 >> 2] | 0;
- if ((i26 | 0) != 0) {
- i25 = 0 - i12 | 0;
- i24 = i24 >>> 8;
- if ((i24 | 0) != 0) {
- if (i12 >>> 0 > 16777215) {
- i27 = 31;
- } else {
- i31 = (i24 + 1048320 | 0) >>> 16 & 8;
- i32 = i24 << i31;
- i30 = (i32 + 520192 | 0) >>> 16 & 4;
- i32 = i32 << i30;
- i27 = (i32 + 245760 | 0) >>> 16 & 2;
- i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
- i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
- }
- } else {
- i27 = 0;
- }
- i30 = HEAP32[7464 + (i27 << 2) >> 2] | 0;
- L126 : do {
- if ((i30 | 0) == 0) {
- i29 = 0;
- i24 = 0;
- } else {
- if ((i27 | 0) == 31) {
- i24 = 0;
- } else {
- i24 = 25 - (i27 >>> 1) | 0;
- }
- i29 = 0;
- i28 = i12 << i24;
- i24 = 0;
- while (1) {
- i32 = HEAP32[i30 + 4 >> 2] & -8;
- i31 = i32 - i12 | 0;
- if (i31 >>> 0 < i25 >>> 0) {
- if ((i32 | 0) == (i12 | 0)) {
- i25 = i31;
- i29 = i30;
- i24 = i30;
- break L126;
- } else {
- i25 = i31;
- i24 = i30;
- }
- }
- i31 = HEAP32[i30 + 20 >> 2] | 0;
- i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
- i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
- if ((i30 | 0) == 0) {
- break;
- } else {
- i28 = i28 << 1;
- }
- }
- }
- } while (0);
- if ((i29 | 0) == 0 & (i24 | 0) == 0) {
- i32 = 2 << i27;
- i26 = i26 & (i32 | 0 - i32);
- if ((i26 | 0) == 0) {
- break;
- }
- i32 = (i26 & 0 - i26) + -1 | 0;
- i28 = i32 >>> 12 & 16;
- i32 = i32 >>> i28;
- i27 = i32 >>> 5 & 8;
- i32 = i32 >>> i27;
- i30 = i32 >>> 2 & 4;
- i32 = i32 >>> i30;
- i31 = i32 >>> 1 & 2;
- i32 = i32 >>> i31;
- i29 = i32 >>> 1 & 1;
- i29 = HEAP32[7464 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
- }
- if ((i29 | 0) != 0) {
- while (1) {
- i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
- i26 = i27 >>> 0 < i25 >>> 0;
- i25 = i26 ? i27 : i25;
- i24 = i26 ? i29 : i24;
- i26 = HEAP32[i29 + 16 >> 2] | 0;
- if ((i26 | 0) != 0) {
- i29 = i26;
- continue;
- }
- i29 = HEAP32[i29 + 20 >> 2] | 0;
- if ((i29 | 0) == 0) {
- break;
- }
- }
- }
- if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[7168 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
- i4 = HEAP32[7176 >> 2] | 0;
- if (i24 >>> 0 < i4 >>> 0) {
- _abort();
- }
- i2 = i24 + i12 | 0;
- if (!(i24 >>> 0 < i2 >>> 0)) {
- _abort();
- }
- i3 = HEAP32[i24 + 24 >> 2] | 0;
- i6 = HEAP32[i24 + 12 >> 2] | 0;
- do {
- if ((i6 | 0) == (i24 | 0)) {
- i6 = i24 + 20 | 0;
- i5 = HEAP32[i6 >> 2] | 0;
- if ((i5 | 0) == 0) {
- i6 = i24 + 16 | 0;
- i5 = HEAP32[i6 >> 2] | 0;
- if ((i5 | 0) == 0) {
- i22 = 0;
- break;
- }
- }
- while (1) {
- i8 = i5 + 20 | 0;
- i7 = HEAP32[i8 >> 2] | 0;
- if ((i7 | 0) != 0) {
- i5 = i7;
- i6 = i8;
- continue;
- }
- i7 = i5 + 16 | 0;
- i8 = HEAP32[i7 >> 2] | 0;
- if ((i8 | 0) == 0) {
- break;
- } else {
- i5 = i8;
- i6 = i7;
- }
- }
- if (i6 >>> 0 < i4 >>> 0) {
- _abort();
- } else {
- HEAP32[i6 >> 2] = 0;
- i22 = i5;
- break;
- }
- } else {
- i5 = HEAP32[i24 + 8 >> 2] | 0;
- if (i5 >>> 0 < i4 >>> 0) {
- _abort();
- }
- i7 = i5 + 12 | 0;
- if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
- _abort();
- }
- i4 = i6 + 8 | 0;
- if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
- HEAP32[i7 >> 2] = i6;
- HEAP32[i4 >> 2] = i5;
- i22 = i6;
- break;
- } else {
- _abort();
- }
- }
- } while (0);
- do {
- if ((i3 | 0) != 0) {
- i4 = HEAP32[i24 + 28 >> 2] | 0;
- i5 = 7464 + (i4 << 2) | 0;
- if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
- HEAP32[i5 >> 2] = i22;
- if ((i22 | 0) == 0) {
- HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i4);
- break;
- }
- } else {
- if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i4 = i3 + 16 | 0;
- if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
- HEAP32[i4 >> 2] = i22;
- } else {
- HEAP32[i3 + 20 >> 2] = i22;
- }
- if ((i22 | 0) == 0) {
- break;
- }
- }
- if (i22 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- HEAP32[i22 + 24 >> 2] = i3;
- i3 = HEAP32[i24 + 16 >> 2] | 0;
- do {
- if ((i3 | 0) != 0) {
- if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i22 + 16 >> 2] = i3;
- HEAP32[i3 + 24 >> 2] = i22;
- break;
- }
- }
- } while (0);
- i3 = HEAP32[i24 + 20 >> 2] | 0;
- if ((i3 | 0) != 0) {
- if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i22 + 20 >> 2] = i3;
- HEAP32[i3 + 24 >> 2] = i22;
- break;
- }
- }
- }
- } while (0);
- L204 : do {
- if (!(i25 >>> 0 < 16)) {
- HEAP32[i24 + 4 >> 2] = i12 | 3;
- HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
- HEAP32[i24 + (i25 + i12) >> 2] = i25;
- i4 = i25 >>> 3;
- if (i25 >>> 0 < 256) {
- i6 = i4 << 1;
- i3 = 7200 + (i6 << 2) | 0;
- i5 = HEAP32[1790] | 0;
- i4 = 1 << i4;
- if ((i5 & i4 | 0) != 0) {
- i5 = 7200 + (i6 + 2 << 2) | 0;
- i4 = HEAP32[i5 >> 2] | 0;
- if (i4 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- i21 = i5;
- i20 = i4;
- }
- } else {
- HEAP32[1790] = i5 | i4;
- i21 = 7200 + (i6 + 2 << 2) | 0;
- i20 = i3;
- }
- HEAP32[i21 >> 2] = i2;
- HEAP32[i20 + 12 >> 2] = i2;
- HEAP32[i24 + (i12 + 8) >> 2] = i20;
- HEAP32[i24 + (i12 + 12) >> 2] = i3;
- break;
- }
- i3 = i25 >>> 8;
- if ((i3 | 0) != 0) {
- if (i25 >>> 0 > 16777215) {
- i3 = 31;
- } else {
- i31 = (i3 + 1048320 | 0) >>> 16 & 8;
- i32 = i3 << i31;
- i30 = (i32 + 520192 | 0) >>> 16 & 4;
- i32 = i32 << i30;
- i3 = (i32 + 245760 | 0) >>> 16 & 2;
- i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
- i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
- }
- } else {
- i3 = 0;
- }
- i6 = 7464 + (i3 << 2) | 0;
- HEAP32[i24 + (i12 + 28) >> 2] = i3;
- HEAP32[i24 + (i12 + 20) >> 2] = 0;
- HEAP32[i24 + (i12 + 16) >> 2] = 0;
- i4 = HEAP32[7164 >> 2] | 0;
- i5 = 1 << i3;
- if ((i4 & i5 | 0) == 0) {
- HEAP32[7164 >> 2] = i4 | i5;
- HEAP32[i6 >> 2] = i2;
- HEAP32[i24 + (i12 + 24) >> 2] = i6;
- HEAP32[i24 + (i12 + 12) >> 2] = i2;
- HEAP32[i24 + (i12 + 8) >> 2] = i2;
- break;
- }
- i4 = HEAP32[i6 >> 2] | 0;
- if ((i3 | 0) == 31) {
- i3 = 0;
- } else {
- i3 = 25 - (i3 >>> 1) | 0;
- }
- L225 : do {
- if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
- i3 = i25 << i3;
- while (1) {
- i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
- i5 = HEAP32[i6 >> 2] | 0;
- if ((i5 | 0) == 0) {
- break;
- }
- if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
- i18 = i5;
- break L225;
- } else {
- i3 = i3 << 1;
- i4 = i5;
- }
- }
- if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i6 >> 2] = i2;
- HEAP32[i24 + (i12 + 24) >> 2] = i4;
- HEAP32[i24 + (i12 + 12) >> 2] = i2;
- HEAP32[i24 + (i12 + 8) >> 2] = i2;
- break L204;
- }
- } else {
- i18 = i4;
- }
- } while (0);
- i4 = i18 + 8 | 0;
- i3 = HEAP32[i4 >> 2] | 0;
- i5 = HEAP32[7176 >> 2] | 0;
- if (i18 >>> 0 < i5 >>> 0) {
- _abort();
- }
- if (i3 >>> 0 < i5 >>> 0) {
- _abort();
- } else {
- HEAP32[i3 + 12 >> 2] = i2;
- HEAP32[i4 >> 2] = i2;
- HEAP32[i24 + (i12 + 8) >> 2] = i3;
- HEAP32[i24 + (i12 + 12) >> 2] = i18;
- HEAP32[i24 + (i12 + 24) >> 2] = 0;
- break;
- }
- } else {
- i32 = i25 + i12 | 0;
- HEAP32[i24 + 4 >> 2] = i32 | 3;
- i32 = i24 + (i32 + 4) | 0;
- HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
- }
- } while (0);
- i32 = i24 + 8 | 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- }
- } else {
- i12 = -1;
- }
- }
- } while (0);
- i18 = HEAP32[7168 >> 2] | 0;
- if (!(i12 >>> 0 > i18 >>> 0)) {
- i3 = i18 - i12 | 0;
- i2 = HEAP32[7180 >> 2] | 0;
- if (i3 >>> 0 > 15) {
- HEAP32[7180 >> 2] = i2 + i12;
- HEAP32[7168 >> 2] = i3;
- HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
- HEAP32[i2 + i18 >> 2] = i3;
- HEAP32[i2 + 4 >> 2] = i12 | 3;
- } else {
- HEAP32[7168 >> 2] = 0;
- HEAP32[7180 >> 2] = 0;
- HEAP32[i2 + 4 >> 2] = i18 | 3;
- i32 = i2 + (i18 + 4) | 0;
- HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
- }
- i32 = i2 + 8 | 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- i18 = HEAP32[7172 >> 2] | 0;
- if (i12 >>> 0 < i18 >>> 0) {
- i31 = i18 - i12 | 0;
- HEAP32[7172 >> 2] = i31;
- i32 = HEAP32[7184 >> 2] | 0;
- HEAP32[7184 >> 2] = i32 + i12;
- HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
- HEAP32[i32 + 4 >> 2] = i12 | 3;
- i32 = i32 + 8 | 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- do {
- if ((HEAP32[1908] | 0) == 0) {
- i18 = _sysconf(30) | 0;
- if ((i18 + -1 & i18 | 0) == 0) {
- HEAP32[7640 >> 2] = i18;
- HEAP32[7636 >> 2] = i18;
- HEAP32[7644 >> 2] = -1;
- HEAP32[7648 >> 2] = -1;
- HEAP32[7652 >> 2] = 0;
- HEAP32[7604 >> 2] = 0;
- HEAP32[1908] = (_time(0) | 0) & -16 ^ 1431655768;
- break;
- } else {
- _abort();
- }
- }
- } while (0);
- i20 = i12 + 48 | 0;
- i25 = HEAP32[7640 >> 2] | 0;
- i21 = i12 + 47 | 0;
- i22 = i25 + i21 | 0;
- i25 = 0 - i25 | 0;
- i18 = i22 & i25;
- if (!(i18 >>> 0 > i12 >>> 0)) {
- i32 = 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- i24 = HEAP32[7600 >> 2] | 0;
- if ((i24 | 0) != 0 ? (i31 = HEAP32[7592 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
- i32 = 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- L269 : do {
- if ((HEAP32[7604 >> 2] & 4 | 0) == 0) {
- i26 = HEAP32[7184 >> 2] | 0;
- L271 : do {
- if ((i26 | 0) != 0) {
- i24 = 7608 | 0;
- while (1) {
- i27 = HEAP32[i24 >> 2] | 0;
- if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
- break;
- }
- i24 = HEAP32[i24 + 8 >> 2] | 0;
- if ((i24 | 0) == 0) {
- i13 = 182;
- break L271;
- }
- }
- if ((i24 | 0) != 0) {
- i25 = i22 - (HEAP32[7172 >> 2] | 0) & i25;
- if (i25 >>> 0 < 2147483647) {
- i13 = _sbrk(i25 | 0) | 0;
- i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
- i22 = i13;
- i24 = i25;
- i23 = i26 ? i13 : -1;
- i25 = i26 ? i25 : 0;
- i13 = 191;
- } else {
- i25 = 0;
- }
- } else {
- i13 = 182;
- }
- } else {
- i13 = 182;
- }
- } while (0);
- do {
- if ((i13 | 0) == 182) {
- i23 = _sbrk(0) | 0;
- if ((i23 | 0) != (-1 | 0)) {
- i24 = i23;
- i22 = HEAP32[7636 >> 2] | 0;
- i25 = i22 + -1 | 0;
- if ((i25 & i24 | 0) == 0) {
- i25 = i18;
- } else {
- i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
- }
- i24 = HEAP32[7592 >> 2] | 0;
- i26 = i24 + i25 | 0;
- if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
- i22 = HEAP32[7600 >> 2] | 0;
- if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
- i25 = 0;
- break;
- }
- i22 = _sbrk(i25 | 0) | 0;
- i13 = (i22 | 0) == (i23 | 0);
- i24 = i25;
- i23 = i13 ? i23 : -1;
- i25 = i13 ? i25 : 0;
- i13 = 191;
- } else {
- i25 = 0;
- }
- } else {
- i25 = 0;
- }
- }
- } while (0);
- L291 : do {
- if ((i13 | 0) == 191) {
- i13 = 0 - i24 | 0;
- if ((i23 | 0) != (-1 | 0)) {
- i17 = i23;
- i14 = i25;
- i13 = 202;
- break L269;
- }
- do {
- if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[7640 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
- if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
- _sbrk(i13 | 0) | 0;
- break L291;
- } else {
- i24 = i19 + i24 | 0;
- break;
- }
- }
- } while (0);
- if ((i22 | 0) != (-1 | 0)) {
- i17 = i22;
- i14 = i24;
- i13 = 202;
- break L269;
- }
- }
- } while (0);
- HEAP32[7604 >> 2] = HEAP32[7604 >> 2] | 4;
- i13 = 199;
- } else {
- i25 = 0;
- i13 = 199;
- }
- } while (0);
- if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
- i14 = i14 ? i15 : i25;
- i13 = 202;
- }
- if ((i13 | 0) == 202) {
- i15 = (HEAP32[7592 >> 2] | 0) + i14 | 0;
- HEAP32[7592 >> 2] = i15;
- if (i15 >>> 0 > (HEAP32[7596 >> 2] | 0) >>> 0) {
- HEAP32[7596 >> 2] = i15;
- }
- i15 = HEAP32[7184 >> 2] | 0;
- L311 : do {
- if ((i15 | 0) != 0) {
- i21 = 7608 | 0;
- while (1) {
- i16 = HEAP32[i21 >> 2] | 0;
- i19 = i21 + 4 | 0;
- i20 = HEAP32[i19 >> 2] | 0;
- if ((i17 | 0) == (i16 + i20 | 0)) {
- i13 = 214;
- break;
- }
- i18 = HEAP32[i21 + 8 >> 2] | 0;
- if ((i18 | 0) == 0) {
- break;
- } else {
- i21 = i18;
- }
- }
- if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
- HEAP32[i19 >> 2] = i20 + i14;
- i2 = (HEAP32[7172 >> 2] | 0) + i14 | 0;
- i3 = i15 + 8 | 0;
- if ((i3 & 7 | 0) == 0) {
- i3 = 0;
- } else {
- i3 = 0 - i3 & 7;
- }
- i32 = i2 - i3 | 0;
- HEAP32[7184 >> 2] = i15 + i3;
- HEAP32[7172 >> 2] = i32;
- HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
- HEAP32[i15 + (i2 + 4) >> 2] = 40;
- HEAP32[7188 >> 2] = HEAP32[7648 >> 2];
- break;
- }
- if (i17 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- HEAP32[7176 >> 2] = i17;
- }
- i19 = i17 + i14 | 0;
- i16 = 7608 | 0;
- while (1) {
- if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
- i13 = 224;
- break;
- }
- i18 = HEAP32[i16 + 8 >> 2] | 0;
- if ((i18 | 0) == 0) {
- break;
- } else {
- i16 = i18;
- }
- }
- if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
- HEAP32[i16 >> 2] = i17;
- i6 = i16 + 4 | 0;
- HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
- i6 = i17 + 8 | 0;
- if ((i6 & 7 | 0) == 0) {
- i6 = 0;
- } else {
- i6 = 0 - i6 & 7;
- }
- i7 = i17 + (i14 + 8) | 0;
- if ((i7 & 7 | 0) == 0) {
- i13 = 0;
- } else {
- i13 = 0 - i7 & 7;
- }
- i15 = i17 + (i13 + i14) | 0;
- i8 = i6 + i12 | 0;
- i7 = i17 + i8 | 0;
- i10 = i15 - (i17 + i6) - i12 | 0;
- HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
- L348 : do {
- if ((i15 | 0) != (HEAP32[7184 >> 2] | 0)) {
- if ((i15 | 0) == (HEAP32[7180 >> 2] | 0)) {
- i32 = (HEAP32[7168 >> 2] | 0) + i10 | 0;
- HEAP32[7168 >> 2] = i32;
- HEAP32[7180 >> 2] = i7;
- HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
- HEAP32[i17 + (i32 + i8) >> 2] = i32;
- break;
- }
- i12 = i14 + 4 | 0;
- i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
- if ((i18 & 3 | 0) == 1) {
- i11 = i18 & -8;
- i16 = i18 >>> 3;
- do {
- if (!(i18 >>> 0 < 256)) {
- i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
- i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
- do {
- if ((i19 | 0) == (i15 | 0)) {
- i19 = i13 | 16;
- i18 = i17 + (i12 + i19) | 0;
- i16 = HEAP32[i18 >> 2] | 0;
- if ((i16 | 0) == 0) {
- i18 = i17 + (i19 + i14) | 0;
- i16 = HEAP32[i18 >> 2] | 0;
- if ((i16 | 0) == 0) {
- i5 = 0;
- break;
- }
- }
- while (1) {
- i20 = i16 + 20 | 0;
- i19 = HEAP32[i20 >> 2] | 0;
- if ((i19 | 0) != 0) {
- i16 = i19;
- i18 = i20;
- continue;
- }
- i19 = i16 + 16 | 0;
- i20 = HEAP32[i19 >> 2] | 0;
- if ((i20 | 0) == 0) {
- break;
- } else {
- i16 = i20;
- i18 = i19;
- }
- }
- if (i18 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i18 >> 2] = 0;
- i5 = i16;
- break;
- }
- } else {
- i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
- if (i18 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i16 = i18 + 12 | 0;
- if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
- _abort();
- }
- i20 = i19 + 8 | 0;
- if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
- HEAP32[i16 >> 2] = i19;
- HEAP32[i20 >> 2] = i18;
- i5 = i19;
- break;
- } else {
- _abort();
- }
- }
- } while (0);
- if ((i9 | 0) != 0) {
- i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
- i18 = 7464 + (i16 << 2) | 0;
- if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
- HEAP32[i18 >> 2] = i5;
- if ((i5 | 0) == 0) {
- HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i16);
- break;
- }
- } else {
- if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i16 = i9 + 16 | 0;
- if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
- HEAP32[i16 >> 2] = i5;
- } else {
- HEAP32[i9 + 20 >> 2] = i5;
- }
- if ((i5 | 0) == 0) {
- break;
- }
- }
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- HEAP32[i5 + 24 >> 2] = i9;
- i15 = i13 | 16;
- i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
- do {
- if ((i9 | 0) != 0) {
- if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i5 + 16 >> 2] = i9;
- HEAP32[i9 + 24 >> 2] = i5;
- break;
- }
- }
- } while (0);
- i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
- if ((i9 | 0) != 0) {
- if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i5 + 20 >> 2] = i9;
- HEAP32[i9 + 24 >> 2] = i5;
- break;
- }
- }
- }
- } else {
- i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
- i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
- i18 = 7200 + (i16 << 1 << 2) | 0;
- if ((i5 | 0) != (i18 | 0)) {
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
- _abort();
- }
- }
- if ((i12 | 0) == (i5 | 0)) {
- HEAP32[1790] = HEAP32[1790] & ~(1 << i16);
- break;
- }
- if ((i12 | 0) != (i18 | 0)) {
- if (i12 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- }
- i16 = i12 + 8 | 0;
- if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
- i9 = i16;
- } else {
- _abort();
- }
- } else {
- i9 = i12 + 8 | 0;
- }
- HEAP32[i5 + 12 >> 2] = i12;
- HEAP32[i9 >> 2] = i5;
- }
- } while (0);
- i15 = i17 + ((i11 | i13) + i14) | 0;
- i10 = i11 + i10 | 0;
- }
- i5 = i15 + 4 | 0;
- HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
- HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
- HEAP32[i17 + (i10 + i8) >> 2] = i10;
- i5 = i10 >>> 3;
- if (i10 >>> 0 < 256) {
- i10 = i5 << 1;
- i2 = 7200 + (i10 << 2) | 0;
- i9 = HEAP32[1790] | 0;
- i5 = 1 << i5;
- if ((i9 & i5 | 0) != 0) {
- i9 = 7200 + (i10 + 2 << 2) | 0;
- i5 = HEAP32[i9 >> 2] | 0;
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- i3 = i9;
- i4 = i5;
- }
- } else {
- HEAP32[1790] = i9 | i5;
- i3 = 7200 + (i10 + 2 << 2) | 0;
- i4 = i2;
- }
- HEAP32[i3 >> 2] = i7;
- HEAP32[i4 + 12 >> 2] = i7;
- HEAP32[i17 + (i8 + 8) >> 2] = i4;
- HEAP32[i17 + (i8 + 12) >> 2] = i2;
- break;
- }
- i3 = i10 >>> 8;
- if ((i3 | 0) != 0) {
- if (i10 >>> 0 > 16777215) {
- i3 = 31;
- } else {
- i31 = (i3 + 1048320 | 0) >>> 16 & 8;
- i32 = i3 << i31;
- i30 = (i32 + 520192 | 0) >>> 16 & 4;
- i32 = i32 << i30;
- i3 = (i32 + 245760 | 0) >>> 16 & 2;
- i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
- i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
- }
- } else {
- i3 = 0;
- }
- i4 = 7464 + (i3 << 2) | 0;
- HEAP32[i17 + (i8 + 28) >> 2] = i3;
- HEAP32[i17 + (i8 + 20) >> 2] = 0;
- HEAP32[i17 + (i8 + 16) >> 2] = 0;
- i9 = HEAP32[7164 >> 2] | 0;
- i5 = 1 << i3;
- if ((i9 & i5 | 0) == 0) {
- HEAP32[7164 >> 2] = i9 | i5;
- HEAP32[i4 >> 2] = i7;
- HEAP32[i17 + (i8 + 24) >> 2] = i4;
- HEAP32[i17 + (i8 + 12) >> 2] = i7;
- HEAP32[i17 + (i8 + 8) >> 2] = i7;
- break;
- }
- i4 = HEAP32[i4 >> 2] | 0;
- if ((i3 | 0) == 31) {
- i3 = 0;
- } else {
- i3 = 25 - (i3 >>> 1) | 0;
- }
- L444 : do {
- if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
- i3 = i10 << i3;
- while (1) {
- i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
- i9 = HEAP32[i5 >> 2] | 0;
- if ((i9 | 0) == 0) {
- break;
- }
- if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
- i2 = i9;
- break L444;
- } else {
- i3 = i3 << 1;
- i4 = i9;
- }
- }
- if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i5 >> 2] = i7;
- HEAP32[i17 + (i8 + 24) >> 2] = i4;
- HEAP32[i17 + (i8 + 12) >> 2] = i7;
- HEAP32[i17 + (i8 + 8) >> 2] = i7;
- break L348;
- }
- } else {
- i2 = i4;
- }
- } while (0);
- i4 = i2 + 8 | 0;
- i3 = HEAP32[i4 >> 2] | 0;
- i5 = HEAP32[7176 >> 2] | 0;
- if (i2 >>> 0 < i5 >>> 0) {
- _abort();
- }
- if (i3 >>> 0 < i5 >>> 0) {
- _abort();
- } else {
- HEAP32[i3 + 12 >> 2] = i7;
- HEAP32[i4 >> 2] = i7;
- HEAP32[i17 + (i8 + 8) >> 2] = i3;
- HEAP32[i17 + (i8 + 12) >> 2] = i2;
- HEAP32[i17 + (i8 + 24) >> 2] = 0;
- break;
- }
- } else {
- i32 = (HEAP32[7172 >> 2] | 0) + i10 | 0;
- HEAP32[7172 >> 2] = i32;
- HEAP32[7184 >> 2] = i7;
- HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
- }
- } while (0);
- i32 = i17 + (i6 | 8) | 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- i3 = 7608 | 0;
- while (1) {
- i2 = HEAP32[i3 >> 2] | 0;
- if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
- break;
- }
- i3 = HEAP32[i3 + 8 >> 2] | 0;
- }
- i3 = i2 + (i11 + -39) | 0;
- if ((i3 & 7 | 0) == 0) {
- i3 = 0;
- } else {
- i3 = 0 - i3 & 7;
- }
- i2 = i2 + (i11 + -47 + i3) | 0;
- i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
- i3 = i2 + 8 | 0;
- i4 = i17 + 8 | 0;
- if ((i4 & 7 | 0) == 0) {
- i4 = 0;
- } else {
- i4 = 0 - i4 & 7;
- }
- i32 = i14 + -40 - i4 | 0;
- HEAP32[7184 >> 2] = i17 + i4;
- HEAP32[7172 >> 2] = i32;
- HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
- HEAP32[i17 + (i14 + -36) >> 2] = 40;
- HEAP32[7188 >> 2] = HEAP32[7648 >> 2];
- HEAP32[i2 + 4 >> 2] = 27;
- HEAP32[i3 + 0 >> 2] = HEAP32[7608 >> 2];
- HEAP32[i3 + 4 >> 2] = HEAP32[7612 >> 2];
- HEAP32[i3 + 8 >> 2] = HEAP32[7616 >> 2];
- HEAP32[i3 + 12 >> 2] = HEAP32[7620 >> 2];
- HEAP32[7608 >> 2] = i17;
- HEAP32[7612 >> 2] = i14;
- HEAP32[7620 >> 2] = 0;
- HEAP32[7616 >> 2] = i3;
- i4 = i2 + 28 | 0;
- HEAP32[i4 >> 2] = 7;
- if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
- while (1) {
- i3 = i4 + 4 | 0;
- HEAP32[i3 >> 2] = 7;
- if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
- i4 = i3;
- } else {
- break;
- }
- }
- }
- if ((i2 | 0) != (i15 | 0)) {
- i2 = i2 - i15 | 0;
- i3 = i15 + (i2 + 4) | 0;
- HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
- HEAP32[i15 + 4 >> 2] = i2 | 1;
- HEAP32[i15 + i2 >> 2] = i2;
- i3 = i2 >>> 3;
- if (i2 >>> 0 < 256) {
- i4 = i3 << 1;
- i2 = 7200 + (i4 << 2) | 0;
- i5 = HEAP32[1790] | 0;
- i3 = 1 << i3;
- if ((i5 & i3 | 0) != 0) {
- i4 = 7200 + (i4 + 2 << 2) | 0;
- i3 = HEAP32[i4 >> 2] | 0;
- if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- i7 = i4;
- i8 = i3;
- }
- } else {
- HEAP32[1790] = i5 | i3;
- i7 = 7200 + (i4 + 2 << 2) | 0;
- i8 = i2;
- }
- HEAP32[i7 >> 2] = i15;
- HEAP32[i8 + 12 >> 2] = i15;
- HEAP32[i15 + 8 >> 2] = i8;
- HEAP32[i15 + 12 >> 2] = i2;
- break;
- }
- i3 = i2 >>> 8;
- if ((i3 | 0) != 0) {
- if (i2 >>> 0 > 16777215) {
- i3 = 31;
- } else {
- i31 = (i3 + 1048320 | 0) >>> 16 & 8;
- i32 = i3 << i31;
- i30 = (i32 + 520192 | 0) >>> 16 & 4;
- i32 = i32 << i30;
- i3 = (i32 + 245760 | 0) >>> 16 & 2;
- i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
- i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
- }
- } else {
- i3 = 0;
- }
- i7 = 7464 + (i3 << 2) | 0;
- HEAP32[i15 + 28 >> 2] = i3;
- HEAP32[i15 + 20 >> 2] = 0;
- HEAP32[i15 + 16 >> 2] = 0;
- i4 = HEAP32[7164 >> 2] | 0;
- i5 = 1 << i3;
- if ((i4 & i5 | 0) == 0) {
- HEAP32[7164 >> 2] = i4 | i5;
- HEAP32[i7 >> 2] = i15;
- HEAP32[i15 + 24 >> 2] = i7;
- HEAP32[i15 + 12 >> 2] = i15;
- HEAP32[i15 + 8 >> 2] = i15;
- break;
- }
- i4 = HEAP32[i7 >> 2] | 0;
- if ((i3 | 0) == 31) {
- i3 = 0;
- } else {
- i3 = 25 - (i3 >>> 1) | 0;
- }
- L499 : do {
- if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
- i3 = i2 << i3;
- while (1) {
- i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
- i5 = HEAP32[i7 >> 2] | 0;
- if ((i5 | 0) == 0) {
- break;
- }
- if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
- i6 = i5;
- break L499;
- } else {
- i3 = i3 << 1;
- i4 = i5;
- }
- }
- if (i7 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
- _abort();
- } else {
- HEAP32[i7 >> 2] = i15;
- HEAP32[i15 + 24 >> 2] = i4;
- HEAP32[i15 + 12 >> 2] = i15;
- HEAP32[i15 + 8 >> 2] = i15;
- break L311;
- }
- } else {
- i6 = i4;
- }
- } while (0);
- i4 = i6 + 8 | 0;
- i3 = HEAP32[i4 >> 2] | 0;
- i2 = HEAP32[7176 >> 2] | 0;
- if (i6 >>> 0 < i2 >>> 0) {
- _abort();
- }
- if (i3 >>> 0 < i2 >>> 0) {
- _abort();
- } else {
- HEAP32[i3 + 12 >> 2] = i15;
- HEAP32[i4 >> 2] = i15;
- HEAP32[i15 + 8 >> 2] = i3;
- HEAP32[i15 + 12 >> 2] = i6;
- HEAP32[i15 + 24 >> 2] = 0;
- break;
- }
- }
- } else {
- i32 = HEAP32[7176 >> 2] | 0;
- if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
- HEAP32[7176 >> 2] = i17;
- }
- HEAP32[7608 >> 2] = i17;
- HEAP32[7612 >> 2] = i14;
- HEAP32[7620 >> 2] = 0;
- HEAP32[7196 >> 2] = HEAP32[1908];
- HEAP32[7192 >> 2] = -1;
- i2 = 0;
- do {
- i32 = i2 << 1;
- i31 = 7200 + (i32 << 2) | 0;
- HEAP32[7200 + (i32 + 3 << 2) >> 2] = i31;
- HEAP32[7200 + (i32 + 2 << 2) >> 2] = i31;
- i2 = i2 + 1 | 0;
- } while ((i2 | 0) != 32);
- i2 = i17 + 8 | 0;
- if ((i2 & 7 | 0) == 0) {
- i2 = 0;
- } else {
- i2 = 0 - i2 & 7;
- }
- i32 = i14 + -40 - i2 | 0;
- HEAP32[7184 >> 2] = i17 + i2;
- HEAP32[7172 >> 2] = i32;
- HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
- HEAP32[i17 + (i14 + -36) >> 2] = 40;
- HEAP32[7188 >> 2] = HEAP32[7648 >> 2];
- }
- } while (0);
- i2 = HEAP32[7172 >> 2] | 0;
- if (i2 >>> 0 > i12 >>> 0) {
- i31 = i2 - i12 | 0;
- HEAP32[7172 >> 2] = i31;
- i32 = HEAP32[7184 >> 2] | 0;
- HEAP32[7184 >> 2] = i32 + i12;
- HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
- HEAP32[i32 + 4 >> 2] = i12 | 3;
- i32 = i32 + 8 | 0;
- STACKTOP = i1;
- return i32 | 0;
- }
- }
- HEAP32[(___errno_location() | 0) >> 2] = 12;
- i32 = 0;
- STACKTOP = i1;
- return i32 | 0;
-}
-function __ZN12b2EPCollider7CollideEP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK14b2PolygonShapeS7_(i12, i2, i16, i5, i8, i6) {
- i12 = i12 | 0;
- i2 = i2 | 0;
- i16 = i16 | 0;
- i5 = i5 | 0;
- i8 = i8 | 0;
- i6 = i6 | 0;
- var i1 = 0, i3 = 0, i4 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, d27 = 0.0, d28 = 0.0, i29 = 0, d30 = 0.0, d31 = 0.0, d32 = 0.0, d33 = 0.0, i34 = 0, i35 = 0, d36 = 0.0, d37 = 0.0, i38 = 0, d39 = 0.0, i40 = 0, i41 = 0;
- i1 = STACKTOP;
- STACKTOP = STACKTOP + 144 | 0;
- i18 = i1 + 128 | 0;
- i11 = i1 + 24 | 0;
- i9 = i1 + 72 | 0;
- i10 = i1 + 48 | 0;
- i3 = i1;
- i4 = i12 + 132 | 0;
- d28 = +HEAPF32[i5 + 12 >> 2];
- d37 = +HEAPF32[i6 + 8 >> 2];
- d23 = +HEAPF32[i5 + 8 >> 2];
- d27 = +HEAPF32[i6 + 12 >> 2];
- d22 = d28 * d37 - d23 * d27;
- d27 = d37 * d23 + d28 * d27;
- d37 = +d22;
- d26 = +d27;
- d25 = +HEAPF32[i6 >> 2] - +HEAPF32[i5 >> 2];
- d36 = +HEAPF32[i6 + 4 >> 2] - +HEAPF32[i5 + 4 >> 2];
- d24 = d28 * d25 + d23 * d36;
- d25 = d28 * d36 - d23 * d25;
- d23 = +d24;
- d36 = +d25;
- i5 = i4;
- HEAPF32[i5 >> 2] = d23;
- HEAPF32[i5 + 4 >> 2] = d36;
- i5 = i12 + 140 | 0;
- HEAPF32[i5 >> 2] = d37;
- HEAPF32[i5 + 4 >> 2] = d26;
- i5 = i12 + 144 | 0;
- d26 = +HEAPF32[i8 + 12 >> 2];
- i7 = i12 + 140 | 0;
- d37 = +HEAPF32[i8 + 16 >> 2];
- d24 = d24 + (d27 * d26 - d22 * d37);
- i6 = i12 + 136 | 0;
- d25 = d26 * d22 + d27 * d37 + d25;
- d37 = +d24;
- d27 = +d25;
- i34 = i12 + 148 | 0;
- HEAPF32[i34 >> 2] = d37;
- HEAPF32[i34 + 4 >> 2] = d27;
- i34 = i16 + 28 | 0;
- i29 = HEAP32[i34 >> 2] | 0;
- i34 = HEAP32[i34 + 4 >> 2] | 0;
- i14 = i12 + 156 | 0;
- HEAP32[i14 >> 2] = i29;
- HEAP32[i14 + 4 >> 2] = i34;
- i14 = i12 + 164 | 0;
- i17 = i16 + 12 | 0;
- i40 = HEAP32[i17 >> 2] | 0;
- i17 = HEAP32[i17 + 4 >> 2] | 0;
- i13 = i14;
- HEAP32[i13 >> 2] = i40;
- HEAP32[i13 + 4 >> 2] = i17;
- i13 = i12 + 172 | 0;
- i20 = i16 + 20 | 0;
- i41 = HEAP32[i20 >> 2] | 0;
- i20 = HEAP32[i20 + 4 >> 2] | 0;
- i38 = i13;
- HEAP32[i38 >> 2] = i41;
- HEAP32[i38 + 4 >> 2] = i20;
- i38 = i16 + 36 | 0;
- i35 = HEAP32[i38 >> 2] | 0;
- i38 = HEAP32[i38 + 4 >> 2] | 0;
- i19 = i12 + 180 | 0;
- HEAP32[i19 >> 2] = i35;
- HEAP32[i19 + 4 >> 2] = i38;
- i19 = (HEAP8[i16 + 44 | 0] | 0) != 0;
- i21 = (HEAP8[i16 + 45 | 0] | 0) != 0;
- d27 = (HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
- d37 = (HEAP32[tempDoublePtr >> 2] = i40, +HEAPF32[tempDoublePtr >> 2]);
- d22 = d27 - d37;
- d26 = (HEAP32[tempDoublePtr >> 2] = i20, +HEAPF32[tempDoublePtr >> 2]);
- i20 = i12 + 168 | 0;
- d36 = (HEAP32[tempDoublePtr >> 2] = i17, +HEAPF32[tempDoublePtr >> 2]);
- d23 = d26 - d36;
- d28 = +Math_sqrt(+(d22 * d22 + d23 * d23));
- d33 = (HEAP32[tempDoublePtr >> 2] = i29, +HEAPF32[tempDoublePtr >> 2]);
- d32 = (HEAP32[tempDoublePtr >> 2] = i34, +HEAPF32[tempDoublePtr >> 2]);
- d31 = (HEAP32[tempDoublePtr >> 2] = i35, +HEAPF32[tempDoublePtr >> 2]);
- d30 = (HEAP32[tempDoublePtr >> 2] = i38, +HEAPF32[tempDoublePtr >> 2]);
- if (!(d28 < 1.1920928955078125e-7)) {
- d39 = 1.0 / d28;
- d22 = d22 * d39;
- d23 = d23 * d39;
- }
- i16 = i12 + 196 | 0;
- d28 = -d22;
- HEAPF32[i16 >> 2] = d23;
- i17 = i12 + 200 | 0;
- HEAPF32[i17 >> 2] = d28;
- d28 = (d24 - d37) * d23 + (d25 - d36) * d28;
- if (i19) {
- d37 = d37 - d33;
- d36 = d36 - d32;
- d39 = +Math_sqrt(+(d37 * d37 + d36 * d36));
- if (!(d39 < 1.1920928955078125e-7)) {
- d39 = 1.0 / d39;
- d37 = d37 * d39;
- d36 = d36 * d39;
- }
- d39 = -d37;
- HEAPF32[i12 + 188 >> 2] = d36;
- HEAPF32[i12 + 192 >> 2] = d39;
- i29 = d23 * d37 - d22 * d36 >= 0.0;
- d32 = (d24 - d33) * d36 + (d25 - d32) * d39;
- } else {
- i29 = 0;
- d32 = 0.0;
- }
- L10 : do {
- if (!i21) {
- if (!i19) {
- i41 = d28 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (i41) {
- i15 = 64;
- break;
- } else {
- i15 = 65;
- break;
- }
- }
- i19 = d32 >= 0.0;
- if (i29) {
- if (!i19) {
- i41 = d28 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (!i41) {
- d37 = +-d23;
- d39 = +d22;
- i38 = i19;
- HEAPF32[i38 >> 2] = d37;
- HEAPF32[i38 + 4 >> 2] = d39;
- i38 = i16;
- i40 = HEAP32[i38 >> 2] | 0;
- i38 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 228 | 0;
- HEAP32[i41 >> 2] = i40;
- HEAP32[i41 + 4 >> 2] = i38;
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = -(HEAP32[tempDoublePtr >> 2] = i40, +HEAPF32[tempDoublePtr >> 2]);
- HEAPF32[i41 + 4 >> 2] = d39;
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 1;
- i19 = i12 + 212 | 0;
- }
- i41 = i16;
- i40 = HEAP32[i41 + 4 >> 2] | 0;
- i38 = i19;
- HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
- HEAP32[i38 + 4 >> 2] = i40;
- i38 = i12 + 188 | 0;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 228 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- d37 = +-+HEAPF32[i16 >> 2];
- d39 = +-+HEAPF32[i17 >> 2];
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break;
- } else {
- if (i19) {
- i41 = d28 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (i41) {
- i38 = i16;
- i41 = HEAP32[i38 >> 2] | 0;
- i38 = HEAP32[i38 + 4 >> 2] | 0;
- i40 = i19;
- HEAP32[i40 >> 2] = i41;
- HEAP32[i40 + 4 >> 2] = i38;
- i40 = i12 + 228 | 0;
- HEAP32[i40 >> 2] = i41;
- HEAP32[i40 + 4 >> 2] = i38;
- d37 = +-(HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
- d39 = +d22;
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 0;
- i19 = i12 + 212 | 0;
- }
- d39 = +-d23;
- d37 = +d22;
- i38 = i19;
- HEAPF32[i38 >> 2] = d39;
- HEAPF32[i38 + 4 >> 2] = d37;
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 228 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- d37 = +-+HEAPF32[i12 + 188 >> 2];
- d39 = +-+HEAPF32[i12 + 192 >> 2];
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break;
- }
- } else {
- d33 = d31 - d27;
- d31 = d30 - d26;
- d30 = +Math_sqrt(+(d33 * d33 + d31 * d31));
- if (d30 < 1.1920928955078125e-7) {
- d30 = d33;
- } else {
- d39 = 1.0 / d30;
- d30 = d33 * d39;
- d31 = d31 * d39;
- }
- d39 = -d30;
- i34 = i12 + 204 | 0;
- HEAPF32[i34 >> 2] = d31;
- i35 = i12 + 208 | 0;
- HEAPF32[i35 >> 2] = d39;
- i38 = d22 * d31 - d23 * d30 > 0.0;
- d24 = (d24 - d27) * d31 + (d25 - d26) * d39;
- if (!i19) {
- i19 = d28 >= 0.0;
- if (!i21) {
- HEAP8[i12 + 248 | 0] = i19 & 1;
- i15 = i12 + 212 | 0;
- if (i19) {
- i19 = i15;
- i15 = 64;
- break;
- } else {
- i19 = i15;
- i15 = 65;
- break;
- }
- }
- if (i38) {
- if (!i19) {
- i41 = d24 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (!i41) {
- d37 = +-d23;
- d39 = +d22;
- i38 = i19;
- HEAPF32[i38 >> 2] = d37;
- HEAPF32[i38 + 4 >> 2] = d39;
- i38 = i12 + 228 | 0;
- HEAPF32[i38 >> 2] = d37;
- HEAPF32[i38 + 4 >> 2] = d39;
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 1;
- i19 = i12 + 212 | 0;
- }
- i41 = i16;
- i40 = HEAP32[i41 + 4 >> 2] | 0;
- i38 = i19;
- HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
- HEAP32[i38 + 4 >> 2] = i40;
- d37 = +-+HEAPF32[i16 >> 2];
- d39 = +-+HEAPF32[i17 >> 2];
- i38 = i12 + 228 | 0;
- HEAPF32[i38 >> 2] = d37;
- HEAPF32[i38 + 4 >> 2] = d39;
- i38 = i12 + 204 | 0;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- } else {
- if (i19) {
- i41 = d24 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (i41) {
- i40 = i16;
- i38 = HEAP32[i40 >> 2] | 0;
- i40 = HEAP32[i40 + 4 >> 2] | 0;
- i41 = i19;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- d37 = +-(HEAP32[tempDoublePtr >> 2] = i38, +HEAPF32[tempDoublePtr >> 2]);
- d39 = +d22;
- i41 = i12 + 228 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 0;
- i19 = i12 + 212 | 0;
- }
- d39 = +-d23;
- d37 = +d22;
- i38 = i19;
- HEAPF32[i38 >> 2] = d39;
- HEAPF32[i38 + 4 >> 2] = d37;
- d37 = +-+HEAPF32[i12 + 204 >> 2];
- d39 = +-+HEAPF32[i12 + 208 >> 2];
- i38 = i12 + 228 | 0;
- HEAPF32[i38 >> 2] = d37;
- HEAPF32[i38 + 4 >> 2] = d39;
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- }
- }
- if (i29 & i38) {
- if (!(d32 >= 0.0) & !(d28 >= 0.0)) {
- i41 = d24 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (!i41) {
- d37 = +-d23;
- d39 = +d22;
- i41 = i19;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- i41 = i12 + 228 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 1;
- i19 = i12 + 212 | 0;
- }
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i19;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- i41 = i12 + 188 | 0;
- i40 = HEAP32[i41 + 4 >> 2] | 0;
- i38 = i12 + 228 | 0;
- HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
- HEAP32[i38 + 4 >> 2] = i40;
- i38 = i12 + 204 | 0;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- }
- if (i29) {
- do {
- if (!(d32 >= 0.0)) {
- if (d28 >= 0.0) {
- i41 = d24 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (i41) {
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 0;
- i19 = i12 + 212 | 0;
- }
- d37 = +-d23;
- d39 = +d22;
- i41 = i19;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- d39 = +-+HEAPF32[i34 >> 2];
- d37 = +-+HEAPF32[i35 >> 2];
- i41 = i12 + 228 | 0;
- HEAPF32[i41 >> 2] = d39;
- HEAPF32[i41 + 4 >> 2] = d37;
- d37 = +-+HEAPF32[i16 >> 2];
- d39 = +-+HEAPF32[i17 >> 2];
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break L10;
- } else {
- HEAP8[i12 + 248 | 0] = 1;
- i19 = i12 + 212 | 0;
- }
- } while (0);
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i19;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- i41 = i12 + 188 | 0;
- i40 = HEAP32[i41 + 4 >> 2] | 0;
- i38 = i12 + 228 | 0;
- HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
- HEAP32[i38 + 4 >> 2] = i40;
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- }
- if (!i38) {
- if (!(!(d32 >= 0.0) | !(d28 >= 0.0))) {
- i41 = d24 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (i41) {
- i40 = i16;
- i38 = HEAP32[i40 >> 2] | 0;
- i40 = HEAP32[i40 + 4 >> 2] | 0;
- i41 = i19;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- i41 = i12 + 228 | 0;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 0;
- i19 = i12 + 212 | 0;
- }
- d37 = +-d23;
- d39 = +d22;
- i41 = i19;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- d39 = +-+HEAPF32[i34 >> 2];
- d37 = +-+HEAPF32[i35 >> 2];
- i41 = i12 + 228 | 0;
- HEAPF32[i41 >> 2] = d39;
- HEAPF32[i41 + 4 >> 2] = d37;
- d37 = +-+HEAPF32[i12 + 188 >> 2];
- d39 = +-+HEAPF32[i12 + 192 >> 2];
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break;
- }
- do {
- if (!(d24 >= 0.0)) {
- if (d32 >= 0.0) {
- i41 = d28 >= 0.0;
- HEAP8[i12 + 248 | 0] = i41 & 1;
- i19 = i12 + 212 | 0;
- if (i41) {
- break;
- }
- } else {
- HEAP8[i12 + 248 | 0] = 0;
- i19 = i12 + 212 | 0;
- }
- d37 = +-d23;
- d39 = +d22;
- i41 = i19;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- d39 = +-+HEAPF32[i16 >> 2];
- d37 = +-+HEAPF32[i17 >> 2];
- i41 = i12 + 228 | 0;
- HEAPF32[i41 >> 2] = d39;
- HEAPF32[i41 + 4 >> 2] = d37;
- d37 = +-+HEAPF32[i12 + 188 >> 2];
- d39 = +-+HEAPF32[i12 + 192 >> 2];
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- break L10;
- } else {
- HEAP8[i12 + 248 | 0] = 1;
- i19 = i12 + 212 | 0;
- }
- } while (0);
- i38 = i16;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i19;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- i41 = i16;
- i40 = HEAP32[i41 + 4 >> 2] | 0;
- i38 = i12 + 228 | 0;
- HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
- HEAP32[i38 + 4 >> 2] = i40;
- i38 = i12 + 204 | 0;
- i40 = HEAP32[i38 + 4 >> 2] | 0;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
- HEAP32[i41 + 4 >> 2] = i40;
- }
- } while (0);
- if ((i15 | 0) == 64) {
- i38 = i16;
- i41 = HEAP32[i38 >> 2] | 0;
- i38 = HEAP32[i38 + 4 >> 2] | 0;
- i40 = i19;
- HEAP32[i40 >> 2] = i41;
- HEAP32[i40 + 4 >> 2] = i38;
- d37 = +-(HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
- d39 = +d22;
- i41 = i12 + 228 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- i41 = i12 + 236 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- } else if ((i15 | 0) == 65) {
- d37 = +-d23;
- d39 = +d22;
- i40 = i19;
- HEAPF32[i40 >> 2] = d37;
- HEAPF32[i40 + 4 >> 2] = d39;
- i40 = i16;
- i38 = HEAP32[i40 >> 2] | 0;
- i40 = HEAP32[i40 + 4 >> 2] | 0;
- i41 = i12 + 228 | 0;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- i41 = i12 + 236 | 0;
- HEAP32[i41 >> 2] = i38;
- HEAP32[i41 + 4 >> 2] = i40;
- }
- i21 = i8 + 148 | 0;
- i34 = i12 + 128 | 0;
- HEAP32[i34 >> 2] = HEAP32[i21 >> 2];
- if ((HEAP32[i21 >> 2] | 0) > 0) {
- i19 = 0;
- do {
- d33 = +HEAPF32[i5 >> 2];
- d37 = +HEAPF32[i8 + (i19 << 3) + 20 >> 2];
- d39 = +HEAPF32[i7 >> 2];
- d36 = +HEAPF32[i8 + (i19 << 3) + 24 >> 2];
- d32 = +(+HEAPF32[i4 >> 2] + (d33 * d37 - d39 * d36));
- d36 = +(d37 * d39 + d33 * d36 + +HEAPF32[i6 >> 2]);
- i41 = i12 + (i19 << 3) | 0;
- HEAPF32[i41 >> 2] = d32;
- HEAPF32[i41 + 4 >> 2] = d36;
- d36 = +HEAPF32[i5 >> 2];
- d32 = +HEAPF32[i8 + (i19 << 3) + 84 >> 2];
- d33 = +HEAPF32[i7 >> 2];
- d39 = +HEAPF32[i8 + (i19 << 3) + 88 >> 2];
- d37 = +(d36 * d32 - d33 * d39);
- d39 = +(d32 * d33 + d36 * d39);
- i41 = i12 + (i19 << 3) + 64 | 0;
- HEAPF32[i41 >> 2] = d37;
- HEAPF32[i41 + 4 >> 2] = d39;
- i19 = i19 + 1 | 0;
- } while ((i19 | 0) < (HEAP32[i21 >> 2] | 0));
- }
- i21 = i12 + 244 | 0;
- HEAPF32[i21 >> 2] = .019999999552965164;
- i19 = i2 + 60 | 0;
- HEAP32[i19 >> 2] = 0;
- i29 = i12 + 248 | 0;
- i35 = HEAP32[i34 >> 2] | 0;
- if ((i35 | 0) <= 0) {
- STACKTOP = i1;
- return;
- }
- d23 = +HEAPF32[i12 + 164 >> 2];
- d26 = +HEAPF32[i20 >> 2];
- d24 = +HEAPF32[i12 + 212 >> 2];
- d27 = +HEAPF32[i12 + 216 >> 2];
- d22 = 3.4028234663852886e+38;
- i20 = 0;
- do {
- d25 = d24 * (+HEAPF32[i12 + (i20 << 3) >> 2] - d23) + d27 * (+HEAPF32[i12 + (i20 << 3) + 4 >> 2] - d26);
- d