Code formatting changes.

src/codegen.cc

 // Copyright 2007-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 327 matching lines @@
       if (node->name()->IsEqualTo(CStrVector(entry->name))) {
         ((*this).*(entry->method))(args);
         return true;
       }
     }
   }
   return false;
 }
 
 
-void CodeGenerator::GenerateFastCaseSwitchStatement(
-    SwitchStatement *node, int min_index, int range, int default_index) {
-
+void CodeGenerator::GenerateFastCaseSwitchStatement(SwitchStatement* node,
+                                                    int min_index,
+                                                    int range,
+                                                    int default_index) {
   ZoneList<CaseClause*>* cases = node->cases();
   int length = cases->length();
 
   // Label pointer per number in range
   SmartPointer<Label*> case_targets(NewArray<Label*>(range));
 
   // Label per switch case
   SmartPointer<Label> case_labels(NewArray<Label>(length));
 
-  Label* fail_label = (default_index >= 0 ? &(case_labels[default_index])
-                                          : node->break_target());
+  Label* fail_label = default_index >= 0 ? &(case_labels[default_index])
+                                         : node->break_target();
 
   // Populate array of label pointers for each number in the range.
   // Initally put the failure label everywhere.
   for (int i = 0; i < range; i++) {
     case_targets[i] = fail_label;
   }
 
   // Overwrite with label of a case for the number value of that case.
   // (In reverse order, so that if the same label occurs twice, the
   // first one wins).
   for (int i = length-1; i >= 0 ; i--) {
     CaseClause* clause = cases->at(i);
     if (!clause->is_default()) {
       Object* label_value = *(clause->label()->AsLiteral()->handle());
       int case_value = Smi::cast(label_value)->value();
       case_targets[case_value - min_index] = &(case_labels[i]);
     }
   }
 
   GenerateFastCaseSwitchJumpTable(node, min_index, range, fail_label,
                                   case_targets, case_labels);
 }
 
+
 void CodeGenerator::GenerateFastCaseSwitchCases(
-    SwitchStatement* node, SmartPointer<Label> &case_labels) {
-
+    SwitchStatement* node,
+    SmartPointer<Label>& case_labels) {
   ZoneList<CaseClause*>* cases = node->cases();
   int length = cases->length();
 
   for (int i = 0; i < length; i++) {
-    Comment cmnt(masm(), "[ case clause");
+    Comment cmnt(masm(), "[ Case clause");
     masm()->bind(&(case_labels[i]));
     VisitStatements(cases->at(i)->statements());
   }
 
   masm()->bind(node->break_target());
 }
 
 
 bool CodeGenerator::TryGenerateFastCaseSwitchStatement(SwitchStatement* node) {
   ZoneList<CaseClause*>* cases = node->cases();
@@ skipping 56 matching lines @@
 void ArgumentsAccessStub::Generate(MacroAssembler* masm) {
   switch (type_) {
     case READ_LENGTH: GenerateReadLength(masm); break;
     case READ_ELEMENT: GenerateReadElement(masm); break;
     case NEW_OBJECT: GenerateNewObject(masm); break;
   }
 }
 
 
 } }  // namespace v8::internal