Add attributions so printf like functions can have their arguments checked.

runtime/vm/flow_graph_optimizer.cc

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/flow_graph_optimizer.h"
 
 #include "vm/cha.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/hash_map.h"
 #include "vm/il_printer.h"
@@ skipping 20 matching lines @@
     BlockEntryInstr* entry = block_order_[i];
     entry->Accept(this);
     for (ForwardInstructionIterator it(entry); !it.Done(); it.Advance()) {
       Definition* defn = it.Current()->AsDefinition();
       if (defn != NULL) {
         Definition* result = defn->Canonicalize();
         if (result != defn) {
           if (result != NULL) {
             defn->ReplaceUsesWith(result);
             if (FLAG_trace_optimization) {
-              OS::Print("Replacing v%d with v%d\n",
+              OS::Print("Replacing v%"Pd" with v%"Pd"\n",
                         defn->ssa_temp_index(),
                         result->ssa_temp_index());
             }
           } else if (FLAG_trace_optimization) {
-              OS::Print("Removing v%d.\n", defn->ssa_temp_index());
+              OS::Print("Removing v%"Pd".\n", defn->ssa_temp_index());
           }
           it.RemoveCurrentFromGraph();
         }
       }
     }
   }
 }
 
 
 static Definition* CreateConversion(Representation from,
@@ skipping 853 matching lines @@
 
     Value* use = instr->value();
     ASSERT(use != NULL);
     Definition* result = use->definition();
     ASSERT(result != NULL);
     // Replace uses and remove the current instruction via the iterator.
     instr->ReplaceUsesWith(result);
     ASSERT(current_iterator()->Current() == instr);
     current_iterator()->RemoveCurrentFromGraph();
     if (FLAG_trace_optimization) {
-      OS::Print("Replacing v%d with v%d\n",
+      OS::Print("Replacing v%"Pd" with v%"Pd"\n",
                 instr->ssa_temp_index(),
                 result->ssa_temp_index());
     }
 
     if (FLAG_trace_type_check_elimination) {
       FlowGraphPrinter::PrintTypeCheck(parsed_function(),
                                        instr->token_pos(),
                                        instr->value(),
                                        instr->dst_type(),
                                        instr->dst_name(),
@@ skipping 20 matching lines @@
     instr->eliminate();
 
     Value* use = instr->value();
     Definition* result = use->definition();
     ASSERT(result != NULL);
     // Replace uses and remove the current instruction via the iterator.
     instr->ReplaceUsesWith(result);
     ASSERT(current_iterator()->Current() == instr);
     current_iterator()->RemoveCurrentFromGraph();
     if (FLAG_trace_optimization) {
-      OS::Print("Replacing v%d with v%d\n",
+      OS::Print("Replacing v%"Pd" with v%"Pd"\n",
                 instr->ssa_temp_index(),
                 result->ssa_temp_index());
     }
 
     if (FLAG_trace_type_check_elimination) {
       const String& name = String::Handle(Symbols::New("boolean expression"));
       FlowGraphPrinter::PrintTypeCheck(parsed_function(),
                                        instr->token_pos(),
                                        instr->value(),
                                        Type::Handle(Type::BoolType()),
@@ skipping 18 matching lines @@
       !instr->value()->BindsToConstantNull() &&
       instr->value()->CompileTypeIsMoreSpecificThan(instr->type())) {
     Value* use = instr->value();
     Definition* result = use->definition();
     ASSERT(result != NULL);
     // Replace uses and remove the current instruction via the iterator.
     instr->ReplaceUsesWith(result);
     ASSERT(current_iterator()->Current() == instr);
     current_iterator()->RemoveCurrentFromGraph();
     if (FLAG_trace_optimization) {
-      OS::Print("Replacing v%d with v%d\n",
+      OS::Print("Replacing v%"Pd" with v%"Pd"\n",
                 instr->ssa_temp_index(),
                 result->ssa_temp_index());
     }
 
     if (FLAG_trace_type_check_elimination) {
       const String& name = String::Handle(Symbols::New("InstanceOf"));
       FlowGraphPrinter::PrintTypeCheck(parsed_function(),
                                        instr->token_pos(),
                                        instr->value(),
                                        instr->type(),
@@ skipping 149 matching lines @@
     if ((defn == NULL) || defn->HasSideEffect()) continue;
     Definition* result = map->Lookup(defn);
     if (result == NULL) {
       map->Insert(defn);
       continue;
     }
     // Replace current with lookup result.
     defn->ReplaceUsesWith(result);
     it.RemoveCurrentFromGraph();
     if (FLAG_trace_optimization) {
-      OS::Print("Replacing v%d with v%d\n",
+      OS::Print("Replacing v%"Pd" with v%"Pd"\n",
                 defn->ssa_temp_index(),
                 result->ssa_temp_index());
     }
   }
 
   // Process children in the dominator tree recursively.
   intptr_t num_children = block->dominated_blocks().length();
   for (intptr_t i = 0; i < num_children; ++i) {
     BlockEntryInstr* child = block->dominated_blocks()[i];
     if (i  < num_children - 1) {
       DirectChainedHashMap<Definition*> child_map(*map);  // Copy map.
       OptimizeRecursive(child, &child_map);
     } else {
       OptimizeRecursive(child, map);  // Reuse map for the last child.
     }
   }
 }
 
 
 }  // namespace dart