[respect] Clean compiler and codegen directories
Bug: v8:10619 Change-Id: I9097e203404ca36301a08665a7383c9585301a67 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/2264359 Commit-Queue: Maya Lekova <mslekova@chromium.org> Commit-Queue: Michael Stanton <mvstanton@chromium.org> Auto-Submit: Maya Lekova <mslekova@chromium.org> Reviewed-by: Michael Stanton <mvstanton@chromium.org> Cr-Commit-Position: refs/heads/master@{#68518}
This commit is contained in:
parent
57817760e0
commit
f569be617a
@ -20,7 +20,7 @@ class Assembler;
|
||||
// Code comments section layout:
|
||||
// byte count content
|
||||
// ------------------------------------------------------------------------
|
||||
// 4 size as uint32_t (only for sanity check)
|
||||
// 4 size as uint32_t (only for a check)
|
||||
// [Inline array of CodeCommentEntry in increasing pc_offset order]
|
||||
// ┌ 4 pc_offset of entry as uint32_t
|
||||
// ├ 4 length of the comment including terminating '\0'
|
||||
|
@ -1318,7 +1318,7 @@ void MacroAssembler::InvokePrologue(Register expected_parameter_count,
|
||||
|
||||
// The code below is made a lot easier because the calling code already sets
|
||||
// up actual and expected registers according to the contract.
|
||||
// ARM has some sanity checks as per below, considering add them for PPC
|
||||
// ARM has some checks as per below, considering add them for PPC
|
||||
// DCHECK_EQ(actual_parameter_count, r3);
|
||||
// DCHECK_EQ(expected_parameter_count, r5);
|
||||
|
||||
|
@ -1349,7 +1349,7 @@ void MacroAssembler::InvokePrologue(Register expected_parameter_count,
|
||||
|
||||
// The code below is made a lot easier because the calling code already sets
|
||||
// up actual and expected registers according to the contract.
|
||||
// ARM has some sanity checks as per below, considering add them for S390
|
||||
// ARM has some checks as per below, considering add them for S390
|
||||
DCHECK_EQ(actual_parameter_count, r2);
|
||||
DCHECK_EQ(expected_parameter_count, r4);
|
||||
|
||||
|
@ -2210,7 +2210,7 @@ void JSObjectData::SerializeRecursiveAsBoilerplate(JSHeapBroker* broker,
|
||||
Handle<JSObject> boilerplate = Handle<JSObject>::cast(object());
|
||||
|
||||
// We only serialize boilerplates that pass the IsInlinableFastLiteral
|
||||
// check, so we only do a sanity check on the depth here.
|
||||
// check, so we only do a check on the depth here.
|
||||
CHECK_GT(depth, 0);
|
||||
CHECK(!boilerplate->map().is_deprecated());
|
||||
|
||||
|
@ -402,7 +402,7 @@ void Node::RemoveUse(Use* use) {
|
||||
|
||||
#if DEBUG
|
||||
void Node::Verify() {
|
||||
// Check basic sanity of input data structures.
|
||||
// Check basic validity of input data structures.
|
||||
fflush(stdout);
|
||||
int count = this->InputCount();
|
||||
// Avoid quadratic explosion for mega nodes; only verify if the input
|
||||
|
@ -148,7 +148,7 @@ RepresentationChanger::RepresentationChanger(JSGraph* jsgraph,
|
||||
type_error_(false) {}
|
||||
|
||||
// Changes representation from {output_rep} to {use_rep}. The {truncation}
|
||||
// parameter is only used for sanity checking - if the changer cannot figure
|
||||
// parameter is only used for checking - if the changer cannot figure
|
||||
// out signedness for the word32->float64 conversion, then we check that the
|
||||
// uses truncate to word32 (so they do not care about signedness).
|
||||
Node* RepresentationChanger::GetRepresentationFor(
|
||||
|
@ -325,7 +325,7 @@ class V8_EXPORT_PRIVATE RepresentationChanger final {
|
||||
RepresentationChanger(JSGraph* jsgraph, JSHeapBroker* broker);
|
||||
|
||||
// Changes representation from {output_type} to {use_rep}. The {truncation}
|
||||
// parameter is only used for sanity checking - if the changer cannot figure
|
||||
// parameter is only used for checking - if the changer cannot figure
|
||||
// out signedness for the word32->float64 conversion, then we check that the
|
||||
// uses truncate to word32 (so they do not care about signedness).
|
||||
Node* GetRepresentationFor(Node* node, MachineRepresentation output_rep,
|
||||
|
@ -387,7 +387,7 @@ UnobservablesSet RedundantStoreFinder::RecomputeUseIntersection(Node* node) {
|
||||
IrOpcode::Value opcode = node->opcode();
|
||||
// List of opcodes that may end this effect chain. The opcodes are not
|
||||
// important to the soundness of this optimization; this serves as a
|
||||
// general sanity check. Add opcodes to this list as it suits you.
|
||||
// general check. Add opcodes to this list as it suits you.
|
||||
//
|
||||
// Everything is observable after these opcodes; return the empty set.
|
||||
DCHECK_EXTRA(
|
||||
|
Loading…
Reference in New Issue
Block a user