Make cpplint happy.
TBR=machenbach@chromium.org Review URL: https://codereview.chromium.org/783913003 Cr-Commit-Position: refs/heads/master@{#25699}
This commit is contained in:
parent
1a05ece305
commit
11b52971d9
@ -332,9 +332,9 @@ enum NeonSize {
|
||||
// standard SoftwareInterrupCode. Bit 23 is reserved for the stop feature.
|
||||
enum SoftwareInterruptCodes {
|
||||
// transition to C code
|
||||
kCallRtRedirected= 0x10,
|
||||
kCallRtRedirected = 0x10,
|
||||
// break point
|
||||
kBreakpoint= 0x20,
|
||||
kBreakpoint = 0x20,
|
||||
// stop
|
||||
kStopCode = 1 << 23
|
||||
};
|
||||
|
@ -503,7 +503,7 @@ MemOperand::MemOperand(Register base, const Operand& offset, AddrMode addrmode)
|
||||
DCHECK(addrmode == Offset);
|
||||
|
||||
regoffset_ = offset.reg();
|
||||
shift_= offset.shift();
|
||||
shift_ = offset.shift();
|
||||
shift_amount_ = offset.shift_amount();
|
||||
|
||||
extend_ = NO_EXTEND;
|
||||
@ -520,7 +520,7 @@ MemOperand::MemOperand(Register base, const Operand& offset, AddrMode addrmode)
|
||||
extend_ = offset.extend();
|
||||
shift_amount_ = offset.shift_amount();
|
||||
|
||||
shift_= NO_SHIFT;
|
||||
shift_ = NO_SHIFT;
|
||||
offset_ = 0;
|
||||
|
||||
// These assertions match those in the extended-register constructor.
|
||||
|
@ -413,7 +413,7 @@ void Simulator::ResetState() {
|
||||
|
||||
// Reset debug helpers.
|
||||
breakpoints_.empty();
|
||||
break_on_next_= false;
|
||||
break_on_next_ = false;
|
||||
}
|
||||
|
||||
|
||||
|
@ -3356,7 +3356,7 @@ HOptimizedGraphBuilder::HOptimizedGraphBuilder(CompilationInfo* info)
|
||||
// This is not initialized in the initializer list because the
|
||||
// constructor for the initial state relies on function_state_ == NULL
|
||||
// to know it's the initial state.
|
||||
function_state_= &initial_function_state_;
|
||||
function_state_ = &initial_function_state_;
|
||||
InitializeAstVisitor(info->zone());
|
||||
if (FLAG_hydrogen_track_positions) {
|
||||
SetSourcePosition(info->shared_info()->start_position());
|
||||
@ -10345,7 +10345,7 @@ bool HGraphBuilder::MatchRotateRight(HValue* left,
|
||||
!ShiftAmountsAllowReplaceByRotate(shr->right(), shl->right())) {
|
||||
return false;
|
||||
}
|
||||
*operand= shr->left();
|
||||
*operand = shr->left();
|
||||
*shift_amount = shr->right();
|
||||
return true;
|
||||
}
|
||||
|
@ -560,52 +560,49 @@ enum SecondaryField {
|
||||
// because 'NegateCondition' function flips LSB to negate condition.
|
||||
enum Condition {
|
||||
// Any value < 0 is considered no_condition.
|
||||
kNoCondition = -1,
|
||||
|
||||
overflow = 0,
|
||||
no_overflow = 1,
|
||||
Uless = 2,
|
||||
Ugreater_equal= 3,
|
||||
equal = 4,
|
||||
not_equal = 5,
|
||||
Uless_equal = 6,
|
||||
Ugreater = 7,
|
||||
negative = 8,
|
||||
positive = 9,
|
||||
parity_even = 10,
|
||||
parity_odd = 11,
|
||||
less = 12,
|
||||
kNoCondition = -1,
|
||||
overflow = 0,
|
||||
no_overflow = 1,
|
||||
Uless = 2,
|
||||
Ugreater_equal = 3,
|
||||
equal = 4,
|
||||
not_equal = 5,
|
||||
Uless_equal = 6,
|
||||
Ugreater = 7,
|
||||
negative = 8,
|
||||
positive = 9,
|
||||
parity_even = 10,
|
||||
parity_odd = 11,
|
||||
less = 12,
|
||||
greater_equal = 13,
|
||||
less_equal = 14,
|
||||
greater = 15,
|
||||
ueq = 16, // Unordered or Equal.
|
||||
nue = 17, // Not (Unordered or Equal).
|
||||
|
||||
cc_always = 18,
|
||||
less_equal = 14,
|
||||
greater = 15,
|
||||
ueq = 16, // Unordered or Equal.
|
||||
nue = 17, // Not (Unordered or Equal).
|
||||
cc_always = 18,
|
||||
|
||||
// Aliases.
|
||||
carry = Uless,
|
||||
not_carry = Ugreater_equal,
|
||||
zero = equal,
|
||||
eq = equal,
|
||||
not_zero = not_equal,
|
||||
ne = not_equal,
|
||||
nz = not_equal,
|
||||
sign = negative,
|
||||
not_sign = positive,
|
||||
mi = negative,
|
||||
pl = positive,
|
||||
hi = Ugreater,
|
||||
ls = Uless_equal,
|
||||
ge = greater_equal,
|
||||
lt = less,
|
||||
gt = greater,
|
||||
le = less_equal,
|
||||
hs = Ugreater_equal,
|
||||
lo = Uless,
|
||||
al = cc_always,
|
||||
|
||||
cc_default = kNoCondition
|
||||
carry = Uless,
|
||||
not_carry = Ugreater_equal,
|
||||
zero = equal,
|
||||
eq = equal,
|
||||
not_zero = not_equal,
|
||||
ne = not_equal,
|
||||
nz = not_equal,
|
||||
sign = negative,
|
||||
not_sign = positive,
|
||||
mi = negative,
|
||||
pl = positive,
|
||||
hi = Ugreater,
|
||||
ls = Uless_equal,
|
||||
ge = greater_equal,
|
||||
lt = less,
|
||||
gt = greater,
|
||||
le = less_equal,
|
||||
hs = Ugreater_equal,
|
||||
lo = Uless,
|
||||
al = cc_always,
|
||||
cc_default = kNoCondition
|
||||
};
|
||||
|
||||
|
||||
|
@ -574,52 +574,49 @@ enum SecondaryField {
|
||||
// because 'NegateCondition' function flips LSB to negate condition.
|
||||
enum Condition {
|
||||
// Any value < 0 is considered no_condition.
|
||||
kNoCondition = -1,
|
||||
|
||||
overflow = 0,
|
||||
no_overflow = 1,
|
||||
Uless = 2,
|
||||
Ugreater_equal= 3,
|
||||
equal = 4,
|
||||
not_equal = 5,
|
||||
Uless_equal = 6,
|
||||
Ugreater = 7,
|
||||
negative = 8,
|
||||
positive = 9,
|
||||
parity_even = 10,
|
||||
parity_odd = 11,
|
||||
less = 12,
|
||||
kNoCondition = -1,
|
||||
overflow = 0,
|
||||
no_overflow = 1,
|
||||
Uless = 2,
|
||||
Ugreater_equal = 3,
|
||||
equal = 4,
|
||||
not_equal = 5,
|
||||
Uless_equal = 6,
|
||||
Ugreater = 7,
|
||||
negative = 8,
|
||||
positive = 9,
|
||||
parity_even = 10,
|
||||
parity_odd = 11,
|
||||
less = 12,
|
||||
greater_equal = 13,
|
||||
less_equal = 14,
|
||||
greater = 15,
|
||||
ueq = 16, // Unordered or Equal.
|
||||
nue = 17, // Not (Unordered or Equal).
|
||||
|
||||
cc_always = 18,
|
||||
less_equal = 14,
|
||||
greater = 15,
|
||||
ueq = 16, // Unordered or Equal.
|
||||
nue = 17, // Not (Unordered or Equal).
|
||||
cc_always = 18,
|
||||
|
||||
// Aliases.
|
||||
carry = Uless,
|
||||
not_carry = Ugreater_equal,
|
||||
zero = equal,
|
||||
eq = equal,
|
||||
not_zero = not_equal,
|
||||
ne = not_equal,
|
||||
nz = not_equal,
|
||||
sign = negative,
|
||||
not_sign = positive,
|
||||
mi = negative,
|
||||
pl = positive,
|
||||
hi = Ugreater,
|
||||
ls = Uless_equal,
|
||||
ge = greater_equal,
|
||||
lt = less,
|
||||
gt = greater,
|
||||
le = less_equal,
|
||||
hs = Ugreater_equal,
|
||||
lo = Uless,
|
||||
al = cc_always,
|
||||
|
||||
cc_default = kNoCondition
|
||||
carry = Uless,
|
||||
not_carry = Ugreater_equal,
|
||||
zero = equal,
|
||||
eq = equal,
|
||||
not_zero = not_equal,
|
||||
ne = not_equal,
|
||||
nz = not_equal,
|
||||
sign = negative,
|
||||
not_sign = positive,
|
||||
mi = negative,
|
||||
pl = positive,
|
||||
hi = Ugreater,
|
||||
ls = Uless_equal,
|
||||
ge = greater_equal,
|
||||
lt = less,
|
||||
gt = greater,
|
||||
le = less_equal,
|
||||
hs = Ugreater_equal,
|
||||
lo = Uless,
|
||||
al = cc_always,
|
||||
cc_default = kNoCondition
|
||||
};
|
||||
|
||||
|
||||
|
@ -6516,7 +6516,7 @@ JSRegExp::Flags JSRegExp::GetFlags() {
|
||||
String* JSRegExp::Pattern() {
|
||||
DCHECK(this->data()->IsFixedArray());
|
||||
Object* data = this->data();
|
||||
String* pattern= String::cast(FixedArray::cast(data)->get(kSourceIndex));
|
||||
String* pattern = String::cast(FixedArray::cast(data)->get(kSourceIndex));
|
||||
return pattern;
|
||||
}
|
||||
|
||||
|
@ -27,7 +27,7 @@ base::Atomic32 g_locker_was_ever_used_ = 0;
|
||||
// the lock for a given isolate.
|
||||
void Locker::Initialize(v8::Isolate* isolate) {
|
||||
DCHECK(isolate != NULL);
|
||||
has_lock_= false;
|
||||
has_lock_ = false;
|
||||
top_level_ = true;
|
||||
isolate_ = reinterpret_cast<i::Isolate*>(isolate);
|
||||
// Record that the Locker has been used at least once.
|
||||
|
@ -4701,7 +4701,7 @@ TEST(Regress357137) {
|
||||
CcTest::InitializeVM();
|
||||
v8::Isolate* isolate = CcTest::isolate();
|
||||
v8::HandleScope hscope(isolate);
|
||||
v8::Handle<v8::ObjectTemplate> global =v8::ObjectTemplate::New(isolate);
|
||||
v8::Handle<v8::ObjectTemplate> global = v8::ObjectTemplate::New(isolate);
|
||||
global->Set(v8::String::NewFromUtf8(isolate, "interrupt"),
|
||||
v8::FunctionTemplate::New(isolate, RequestInterrupt));
|
||||
v8::Local<v8::Context> context = v8::Context::New(isolate, NULL, global);
|
||||
|
Loading…
Reference in New Issue
Block a user