Revision: 5519
Author: [email protected]
Date: Fri Sep 24 01:25:31 2010
Log: Fix some inconsistent formatting.
I noticed we sometimes had extra spaces before and after the "const"
keyword. Probably the result of a search and replace gone wrong.
This is a whitespace only change.
Review URL: http://codereview.chromium.org/3427021
http://code.google.com/p/v8/source/detail?r=5519
Modified:
/branches/bleeding_edge/src/arm/assembler-arm.h
/branches/bleeding_edge/src/arm/codegen-arm.h
/branches/bleeding_edge/src/assembler.h
/branches/bleeding_edge/src/ast.h
/branches/bleeding_edge/src/hashmap.h
/branches/bleeding_edge/src/ia32/assembler-ia32.h
/branches/bleeding_edge/src/list.h
/branches/bleeding_edge/src/mips/assembler-mips.h
/branches/bleeding_edge/src/mips/codegen-mips.h
/branches/bleeding_edge/src/parser.cc
/branches/bleeding_edge/src/rewriter.cc
/branches/bleeding_edge/src/scanner.h
/branches/bleeding_edge/src/scopeinfo.h
/branches/bleeding_edge/src/scopes.h
/branches/bleeding_edge/src/variables.h
/branches/bleeding_edge/src/x64/assembler-x64.h
=======================================
--- /branches/bleeding_edge/src/arm/assembler-arm.h Thu Aug 26 01:53:00 2010
+++ /branches/bleeding_edge/src/arm/assembler-arm.h Fri Sep 24 01:25:31 2010
@@ -69,13 +69,13 @@
//
// Core register
struct Register {
- bool is_valid() const { return 0 <= code_ && code_ < 16; }
- bool is(Register reg) const { return code_ == reg.code_; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 16; }
+ bool is(Register reg) const { return code_ == reg.code_; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
@@ -110,17 +110,17 @@
// Single word VFP register.
struct SwVfpRegister {
- bool is_valid() const { return 0 <= code_ && code_ < 32; }
- bool is(SwVfpRegister reg) const { return code_ == reg.code_; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 32; }
+ bool is(SwVfpRegister reg) const { return code_ == reg.code_; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
- void split_code(int* vm, int* m) const {
+ void split_code(int* vm, int* m) const {
ASSERT(is_valid());
*m = code_ & 0x1;
*vm = code_ >> 1;
@@ -133,31 +133,31 @@
// Double word VFP register.
struct DwVfpRegister {
// Supporting d0 to d15, can be later extended to d31.
- bool is_valid() const { return 0 <= code_ && code_ < 16; }
- bool is(DwVfpRegister reg) const { return code_ == reg.code_; }
- SwVfpRegister low() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 16; }
+ bool is(DwVfpRegister reg) const { return code_ == reg.code_; }
+ SwVfpRegister low() const {
SwVfpRegister reg;
reg.code_ = code_ * 2;
ASSERT(reg.is_valid());
return reg;
}
- SwVfpRegister high() const {
+ SwVfpRegister high() const {
SwVfpRegister reg;
reg.code_ = (code_ * 2) + 1;
ASSERT(reg.is_valid());
return reg;
}
- int code() const {
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
- void split_code(int* vm, int* m) const {
+ void split_code(int* vm, int* m) const {
ASSERT(is_valid());
*m = (code_ & 0x10) >> 4;
*vm = code_ & 0x0F;
@@ -222,13 +222,13 @@
// Coprocessor register
struct CRegister {
- bool is_valid() const { return 0 <= code_ && code_ < 16; }
- bool is(CRegister creg) const { return code_ == creg.code_; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 16; }
+ bool is(CRegister creg) const { return code_ == creg.code_; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
=======================================
--- /branches/bleeding_edge/src/arm/codegen-arm.h Tue Sep 14 07:52:53 2010
+++ /branches/bleeding_edge/src/arm/codegen-arm.h Fri Sep 24 01:25:31 2010
@@ -307,9 +307,9 @@
int NumberOfSlot(Slot* slot);
// State
- bool has_cc() const { return cc_reg_ != al; }
- JumpTarget* true_target() const { return state_->true_target(); }
- JumpTarget* false_target() const { return state_->false_target(); }
+ bool has_cc() const { return cc_reg_ != al; }
+ JumpTarget* true_target() const { return state_->true_target(); }
+ JumpTarget* false_target() const { return state_->false_target(); }
// Track loop nesting level.
int loop_nesting() const { return loop_nesting_; }
=======================================
--- /branches/bleeding_edge/src/assembler.h Wed Sep 15 04:43:12 2010
+++ /branches/bleeding_edge/src/assembler.h Fri Sep 24 01:25:31 2010
@@ -57,7 +57,7 @@
INLINE(void Unuse()) { pos_ = 0; }
- INLINE(bool is_bound() const) { return pos_ < 0; }
+ INLINE(bool is_bound() const) { return pos_ < 0; }
INLINE(bool is_unused() const) { return pos_ == 0; }
INLINE(bool is_linked() const) { return pos_ > 0; }
@@ -232,10 +232,10 @@
static inline int ModeMask(Mode mode) { return 1 << mode; }
// Accessors
- byte* pc() const { return pc_; }
+ byte* pc() const { return pc_; }
void set_pc(byte* pc) { pc_ = pc; }
Mode rmode() const { return rmode_; }
- intptr_t data() const { return data_; }
+ intptr_t data() const { return data_; }
// Apply a relocation by delta bytes
INLINE(void apply(intptr_t delta));
@@ -390,7 +390,7 @@
explicit RelocIterator(const CodeDesc& desc, int mode_mask = -1);
// Iteration
- bool done() const { return done_; }
+ bool done() const { return done_; }
void next();
// Return pointer valid until next next().
=======================================
--- /branches/bleeding_edge/src/ast.h Fri Sep 24 00:53:59 2010
+++ /branches/bleeding_edge/src/ast.h Fri Sep 24 01:25:31 2010
@@ -330,7 +330,7 @@
void AddStatement(Statement* statement) { statements_.Add(statement); }
ZoneList<Statement*>* statements() { return &statements_; }
- bool is_initializer_block() const { return is_initializer_block_; }
+ bool is_initializer_block() const { return is_initializer_block_; }
private:
ZoneList<Statement*> statements_;
@@ -351,9 +351,9 @@
virtual void Accept(AstVisitor* v);
- VariableProxy* proxy() const { return proxy_; }
- Variable::Mode mode() const { return mode_; }
- FunctionLiteral* fun() const { return fun_; } // may be NULL
+ VariableProxy* proxy() const { return proxy_; }
+ Variable::Mode mode() const { return mode_; }
+ FunctionLiteral* fun() const { return fun_; } // may be NULL
private:
VariableProxy* proxy_;
@@ -454,11 +454,11 @@
virtual void Accept(AstVisitor* v);
- Statement* init() const { return init_; }
+ Statement* init() const { return init_; }
void set_init(Statement* stmt) { init_ = stmt; }
- Expression* cond() const { return cond_; }
+ Expression* cond() const { return cond_; }
void set_cond(Expression* expr) { cond_ = expr; }
- Statement* next() const { return next_; }
+ Statement* next() const { return next_; }
void set_next(Statement* stmt) { next_ = stmt; }
bool may_have_function_literal() const {
@@ -531,7 +531,7 @@
virtual void Accept(AstVisitor* v);
- IterationStatement* target() const { return target_; }
+ IterationStatement* target() const { return target_; }
private:
IterationStatement* target_;
@@ -545,7 +545,7 @@
virtual void Accept(AstVisitor* v);
- BreakableStatement* target() const { return target_; }
+ BreakableStatement* target() const { return target_; }
private:
BreakableStatement* target_;
@@ -576,7 +576,7 @@
virtual void Accept(AstVisitor* v);
- Expression* expression() const { return expression_; }
+ Expression* expression() const { return expression_; }
bool is_catch_block() const { return is_catch_block_; }
@@ -598,13 +598,13 @@
public:
CaseClause(Expression* label, ZoneList<Statement*>* statements);
- bool is_default() const { return label_ == NULL; }
- Expression* label() const {
+ bool is_default() const { return label_ == NULL; }
+ Expression* label() const {
CHECK(!is_default());
return label_;
}
JumpTarget* body_target() { return &body_target_; }
- ZoneList<Statement*>* statements() const { return statements_; }
+ ZoneList<Statement*>* statements() const { return statements_; }
private:
Expression* label_;
@@ -624,8 +624,8 @@
virtual void Accept(AstVisitor* v);
- Expression* tag() const { return tag_; }
- ZoneList<CaseClause*>* cases() const { return cases_; }
+ Expression* tag() const { return tag_; }
+ ZoneList<CaseClause*>* cases() const { return cases_; }
private:
Expression* tag_;
@@ -719,8 +719,8 @@
virtual void Accept(AstVisitor* v);
- VariableProxy* catch_var() const { return catch_var_; }
- Block* catch_block() const { return catch_block_; }
+ VariableProxy* catch_var() const { return catch_var_; }
+ Block* catch_block() const { return catch_block_; }
private:
VariableProxy* catch_var_;
@@ -987,10 +987,10 @@
return (variable == NULL) ? false : variable->is_arguments();
}
- Handle<String> name() const { return name_; }
- Variable* var() const { return var_; }
- bool is_this() const { return is_this_; }
- bool inside_with() const { return inside_with_; }
+ Handle<String> name() const { return name_; }
+ Variable* var() const { return var_; }
+ bool is_this() const { return is_this_; }
+ bool inside_with() const { return inside_with_; }
void MarkAsTrivial() { is_trivial_ = true; }
@@ -1457,9 +1457,9 @@
// Type testing & conversion
virtual FunctionLiteral* AsFunctionLiteral() { return this; }
- Handle<String> name() const { return name_; }
- Scope* scope() const { return scope_; }
- ZoneList<Statement*>* body() const { return body_; }
+ Handle<String> name() const { return name_; }
+ Scope* scope() const { return scope_; }
+ ZoneList<Statement*>* body() const { return body_; }
void set_function_token_position(int pos) { function_token_position_ =
pos; }
int function_token_position() const { return function_token_position_; }
int start_position() const { return start_position_; }
@@ -1479,7 +1479,7 @@
bool AllowsLazyCompilation();
- Handle<String> inferred_name() const { return inferred_name_; }
+ Handle<String> inferred_name() const { return inferred_name_; }
void set_inferred_name(Handle<String> inferred_name) {
inferred_name_ = inferred_name;
}
=======================================
--- /branches/bleeding_edge/src/hashmap.h Mon May 25 03:05:56 2009
+++ /branches/bleeding_edge/src/hashmap.h Fri Sep 24 01:25:31 2010
@@ -83,12 +83,12 @@
void Clear();
// The number of (non-empty) entries in the table.
- uint32_t occupancy() const { return occupancy_; }
+ uint32_t occupancy() const { return occupancy_; }
// The capacity of the table. The implementation
// makes sure that occupancy is at most 80% of
// the table capacity.
- uint32_t capacity() const { return capacity_; }
+ uint32_t capacity() const { return capacity_; }
// Iteration
//
@@ -108,7 +108,7 @@
uint32_t capacity_;
uint32_t occupancy_;
- Entry* map_end() const { return map_ + capacity_; }
+ Entry* map_end() const { return map_ + capacity_; }
Entry* Probe(void* key, uint32_t hash);
void Initialize(uint32_t capacity);
void Resize();
=======================================
--- /branches/bleeding_edge/src/ia32/assembler-ia32.h Thu Sep 23 02:15:26
2010
+++ /branches/bleeding_edge/src/ia32/assembler-ia32.h Fri Sep 24 01:25:31
2010
@@ -64,15 +64,15 @@
// and best performance in optimized code.
//
struct Register {
- bool is_valid() const { return 0 <= code_ && code_ < 8; }
- bool is(Register reg) const { return code_ == reg.code_; }
+ bool is_valid() const { return 0 <= code_ && code_ < 8; }
+ bool is(Register reg) const { return code_ == reg.code_; }
// eax, ebx, ecx and edx are byte registers, the rest are not.
- bool is_byte_register() const { return code_ <= 3; }
- int code() const {
+ bool is_byte_register() const { return code_ <= 3; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
@@ -93,8 +93,8 @@
struct XMMRegister {
- bool is_valid() const { return 0 <= code_ && code_ < 8; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 8; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
@@ -855,9 +855,9 @@
// Used for inline tables, e.g., jump-tables.
void dd(uint32_t data, RelocInfo::Mode reloc_info);
- int pc_offset() const { return pc_ - buffer_; }
+ int pc_offset() const { return pc_ - buffer_; }
int current_statement_position() const { return
current_statement_position_; }
- int current_position() const { return current_position_; }
+ int current_position() const { return current_position_; }
// Check if there is less than kGap bytes available in the buffer.
// If this is the case, we need to grow the buffer before emitting
=======================================
--- /branches/bleeding_edge/src/list.h Mon Aug 9 04:37:24 2010
+++ /branches/bleeding_edge/src/list.h Fri Sep 24 01:25:31 2010
@@ -67,12 +67,12 @@
// Returns a reference to the element at index i. This reference is
// not safe to use after operations that can change the list's
// backing store (eg, Add).
- inline T& operator[](int i) const {
+ inline T& operator[](int i) const {
ASSERT(0 <= i);
ASSERT(i < length_);
return data_[i];
}
- inline T& at(int i) const { return operator[](i); }
+ inline T& at(int i) const { return operator[](i); }
inline T& last() const { return at(length_ - 1); }
inline T& first() const { return at(0); }
=======================================
--- /branches/bleeding_edge/src/mips/assembler-mips.h Tue Jun 8 05:04:49
2010
+++ /branches/bleeding_edge/src/mips/assembler-mips.h Fri Sep 24 01:25:31
2010
@@ -73,13 +73,13 @@
// Core register.
struct Register {
- bool is_valid() const { return 0 <= code_ && code_ < kNumRegisters; }
- bool is(Register reg) const { return code_ == reg.code_; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < kNumRegisters; }
+ bool is(Register reg) const { return code_ == reg.code_; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
@@ -129,13 +129,13 @@
// Coprocessor register.
struct FPURegister {
- bool is_valid() const { return 0 <= code_ && code_ < kNumFPURegister ; }
- bool is(FPURegister creg) const { return code_ == creg.code_; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < kNumFPURegister ; }
+ bool is(FPURegister creg) const { return code_ == creg.code_; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
ASSERT(is_valid());
return 1 << code_;
}
@@ -665,4 +665,3 @@
} } // namespace v8::internal
#endif // V8_ARM_ASSEMBLER_MIPS_H_
-
=======================================
--- /branches/bleeding_edge/src/mips/codegen-mips.h Wed Sep 1 06:13:31 2010
+++ /branches/bleeding_edge/src/mips/codegen-mips.h Fri Sep 24 01:25:31 2010
@@ -240,10 +240,10 @@
void ProcessDeferred();
// State
- bool has_cc() const { return cc_reg_ != cc_always; }
+ bool has_cc() const { return cc_reg_ != cc_always; }
TypeofState typeof_state() const { return state_->typeof_state(); }
- JumpTarget* true_target() const { return state_->true_target(); }
- JumpTarget* false_target() const { return state_->false_target(); }
+ JumpTarget* true_target() const { return state_->true_target(); }
+ JumpTarget* false_target() const { return state_->false_target(); }
// We don't track loop nesting level on mips yet.
int loop_nesting() const { return 0; }
@@ -280,7 +280,7 @@
MemOperand SlotOperand(Slot* slot, Register tmp);
// Expressions
- MemOperand GlobalObject() const {
+ MemOperand GlobalObject() const {
return ContextOperand(cp, Context::GLOBAL_INDEX);
}
=======================================
--- /branches/bleeding_edge/src/parser.cc Mon Sep 20 01:43:35 2010
+++ /branches/bleeding_edge/src/parser.cc Fri Sep 24 01:25:31 2010
@@ -156,12 +156,12 @@
ScriptDataImpl* pre_data_;
FuncNameInferrer* fni_;
- bool inside_with() const { return with_nesting_level_ > 0; }
- ParserFactory* factory() const { return factory_; }
+ bool inside_with() const { return with_nesting_level_ > 0; }
+ ParserFactory* factory() const { return factory_; }
ParserLog* log() const { return log_; }
Scanner& scanner() { return scanner_; }
- Mode mode() const { return mode_; }
- ScriptDataImpl* pre_data() const { return pre_data_; }
+ Mode mode() const { return mode_; }
+ ScriptDataImpl* pre_data() const { return pre_data_; }
// All ParseXXX functions take as the last argument an *ok parameter
// which is set to false if parsing failed; it is unchanged otherwise.
=======================================
--- /branches/bleeding_edge/src/rewriter.cc Fri Sep 24 00:53:59 2010
+++ /branches/bleeding_edge/src/rewriter.cc Fri Sep 24 01:25:31 2010
@@ -692,7 +692,7 @@
}
void Process(ZoneList<Statement*>* statements);
- bool result_assigned() const { return result_assigned_; }
+ bool result_assigned() const { return result_assigned_; }
private:
VariableProxy* result_;
=======================================
--- /branches/bleeding_edge/src/scanner.h Mon Sep 20 01:43:35 2010
+++ /branches/bleeding_edge/src/scanner.h Fri Sep 24 01:25:31 2010
@@ -297,7 +297,7 @@
Token::Value Next();
// One token look-ahead (past the token returned by Next()).
- Token::Value peek() const { return next_.token; }
+ Token::Value peek() const { return next_.token; }
// Returns true if there was a line terminator before the peek'ed token.
bool has_line_terminator_before_next() const {
@@ -313,8 +313,8 @@
// Returns the location information for the current token
// (the token returned by Next()).
- Location location() const { return current_.location; }
- Location peek_location() const { return next_.location; }
+ Location location() const { return current_.location; }
+ Location peek_location() const { return next_.location; }
// Returns the literal string, if any, for the current token (the
// token returned by Next()). The string is 0-terminated and in
=======================================
--- /branches/bleeding_edge/src/scopeinfo.h Wed Jul 14 04:18:09 2010
+++ /branches/bleeding_edge/src/scopeinfo.h Fri Sep 24 01:25:31 2010
@@ -63,13 +63,13 @@
//
--------------------------------------------------------------------------
// Lookup
- Handle<String> function_name() const { return function_name_; }
-
- Handle<String> parameter_name(int i) const { return parameters_[i]; }
- int number_of_parameters() const { return parameters_.length(); }
-
- Handle<String> stack_slot_name(int i) const { return stack_slots_[i]; }
- int number_of_stack_slots() const { return stack_slots_.length(); }
+ Handle<String> function_name() const { return function_name_; }
+
+ Handle<String> parameter_name(int i) const { return parameters_[i]; }
+ int number_of_parameters() const { return parameters_.length(); }
+
+ Handle<String> stack_slot_name(int i) const { return stack_slots_[i]; }
+ int number_of_stack_slots() const { return stack_slots_.length(); }
Handle<String> context_slot_name(int i) const {
return context_slots_[i - Context::MIN_CONTEXT_SLOTS];
=======================================
--- /branches/bleeding_edge/src/scopes.h Fri Sep 24 00:53:59 2010
+++ /branches/bleeding_edge/src/scopes.h Fri Sep 24 01:25:31 2010
@@ -187,21 +187,21 @@
// Predicates.
// Specific scope types.
- bool is_eval_scope() const { return type_ == EVAL_SCOPE; }
- bool is_function_scope() const { return type_ == FUNCTION_SCOPE; }
- bool is_global_scope() const { return type_ == GLOBAL_SCOPE; }
+ bool is_eval_scope() const { return type_ == EVAL_SCOPE; }
+ bool is_function_scope() const { return type_ == FUNCTION_SCOPE; }
+ bool is_global_scope() const { return type_ == GLOBAL_SCOPE; }
// Information about which scopes calls eval.
- bool calls_eval() const { return scope_calls_eval_; }
- bool outer_scope_calls_eval() const { return outer_scope_calls_eval_; }
+ bool calls_eval() const { return scope_calls_eval_; }
+ bool outer_scope_calls_eval() const { return outer_scope_calls_eval_; }
// Is this scope inside a with statement.
- bool inside_with() const { return scope_inside_with_; }
+ bool inside_with() const { return scope_inside_with_; }
// Does this scope contain a with statement.
- bool contains_with() const { return scope_contains_with_; }
+ bool contains_with() const { return scope_contains_with_; }
// The scope immediately surrounding this scope, or NULL.
- Scope* outer_scope() const { return outer_scope_; }
+ Scope* outer_scope() const { return outer_scope_; }
//
---------------------------------------------------------------------------
// Accessors.
@@ -217,27 +217,27 @@
// The variable holding the function literal for named function
// literals, or NULL.
// Only valid for function scopes.
- Variable* function() const {
+ Variable* function() const {
ASSERT(is_function_scope());
return function_;
}
// Parameters. The left-most parameter has index 0.
// Only valid for function scopes.
- Variable* parameter(int index) const {
+ Variable* parameter(int index) const {
ASSERT(is_function_scope());
return params_[index];
}
- int num_parameters() const { return params_.length(); }
+ int num_parameters() const { return params_.length(); }
// The local variable 'arguments' if we need to allocate it; NULL
otherwise.
// If arguments() exist, arguments_shadow() exists, too.
- Variable* arguments() const { return arguments_; }
+ Variable* arguments() const { return arguments_; }
// The '.arguments' shadow variable if we need to allocate it; NULL
otherwise.
// If arguments_shadow() exist, arguments() exists, too.
- Variable* arguments_shadow() const { return arguments_shadow_; }
+ Variable* arguments_shadow() const { return arguments_shadow_; }
// Declarations list.
ZoneList<Declaration*>* declarations() { return &decls_; }
@@ -262,8 +262,8 @@
void AllocateVariables(Handle<Context> context);
// Result of variable allocation.
- int num_stack_slots() const { return num_stack_slots_; }
- int num_heap_slots() const { return num_heap_slots_; }
+ int num_stack_slots() const { return num_stack_slots_; }
+ int num_heap_slots() const { return num_heap_slots_; }
// Make sure this scope and all outer scopes are eagerly compiled.
void ForceEagerCompilation() { force_eager_compilation_ = true; }
=======================================
--- /branches/bleeding_edge/src/variables.h Fri Sep 24 00:53:59 2010
+++ /branches/bleeding_edge/src/variables.h Fri Sep 24 01:25:31 2010
@@ -131,11 +131,11 @@
// in an outer scope about which we don't know anything (it may not
// be the global scope). scope() is NULL in that case. Currently the
// scope is only used to follow the context chain length.
- Scope* scope() const { return scope_; }
-
- Handle<String> name() const { return name_; }
- Mode mode() const { return mode_; }
- bool is_accessed_from_inner_scope() const {
+ Scope* scope() const { return scope_; }
+
+ Handle<String> name() const { return name_; }
+ Mode mode() const { return mode_; }
+ bool is_accessed_from_inner_scope() const {
return is_accessed_from_inner_scope_;
}
bool is_used() { return is_used_; }
@@ -172,7 +172,7 @@
local_if_not_shadowed_ = local;
}
- Expression* rewrite() const { return rewrite_; }
+ Expression* rewrite() const { return rewrite_; }
StaticType* type() { return &type_; }
=======================================
--- /branches/bleeding_edge/src/x64/assembler-x64.h Wed Sep 15 04:43:12 2010
+++ /branches/bleeding_edge/src/x64/assembler-x64.h Fri Sep 24 01:25:31 2010
@@ -92,13 +92,13 @@
Register r = { code };
return r;
}
- bool is_valid() const { return 0 <= code_ && code_ < 16; }
- bool is(Register reg) const { return code_ == reg.code_; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 16; }
+ bool is(Register reg) const { return code_ == reg.code_; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
- int bit() const {
+ int bit() const {
return 1 << code_;
}
@@ -138,8 +138,8 @@
struct XMMRegister {
- bool is_valid() const { return 0 <= code_ && code_ < 16; }
- int code() const {
+ bool is_valid() const { return 0 <= code_ && code_ < 16; }
+ int code() const {
ASSERT(is_valid());
return code_;
}
@@ -1178,9 +1178,9 @@
void RecordStatementPosition(int pos);
bool WriteRecordedPositions();
- int pc_offset() const { return static_cast<int>(pc_ - buffer_); }
+ int pc_offset() const { return static_cast<int>(pc_ - buffer_); }
int current_statement_position() const { return
current_statement_position_; }
- int current_position() const { return current_position_; }
+ int current_position() const { return current_position_; }
// Check if there is less than kGap bytes available in the buffer.
// If this is the case, we need to grow the buffer before emitting
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
