Fix missing spaces

src/types.cc

 // Copyright 2013 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 488 matching lines @@
   if (is_bitset()) {
     int val = as_bitset();
     const char* composed_name = GetComposedName(val);
     if (composed_name != NULL) {
       PrintF(out, "%s", composed_name);
       return;
     }
     bool first_entry = true;
     PrintF(out, "{");
     for (unsigned i = 0; i < sizeof(val)*8; ++i) {
-      int mask = (1<<i);
+      int mask = (1 << i);
       if ((val & mask) != 0) {
         if (!first_entry) PrintF(out, ",");
         first_entry = false;
         PrintF(out, "%s", GetPrimitiveName(mask));
       }
     }
     PrintF(out, "}");
   } else if (is_constant()) {
     PrintF(out, "Constant(%p)", reinterpret_cast<void*>(*as_constant()));
   } else if (is_class()) {
     PrintF(out, "Class(%p)", reinterpret_cast<void*>(*as_class()));
   } else if (is_union()) {
     PrintF(out, "{");
     Handle<Unioned> unioned = as_union();
     for (int i = 0; i < unioned->length(); ++i) {
       Handle<Type> type_i = union_get(unioned, i);
       if (i > 0) PrintF(out, ",");
       type_i->TypePrint(out);
     }
     PrintF(out, "}");
   }
 }
 #endif
 
 
 } }  // namespace v8::internal