Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2010 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2010 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "courgette/encoded_program.h" | 5 #include "courgette/encoded_program.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 #include <map> | 8 #include <map> |
| 9 #include <string> | 9 #include <string> |
| 10 #include <vector> | 10 #include <vector> |
| (...skipping 215 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 226 void EncodedProgram::AddRel32(int label_index) { | 226 void EncodedProgram::AddRel32(int label_index) { |
| 227 ops_.push_back(REL32); | 227 ops_.push_back(REL32); |
| 228 rel32_ix_.push_back(label_index); | 228 rel32_ix_.push_back(label_index); |
| 229 } | 229 } |
| 230 | 230 |
| 231 void EncodedProgram::AddMakeRelocs() { | 231 void EncodedProgram::AddMakeRelocs() { |
| 232 ops_.push_back(MAKE_BASE_RELOCATION_TABLE); | 232 ops_.push_back(MAKE_BASE_RELOCATION_TABLE); |
| 233 } | 233 } |
| 234 | 234 |
| 235 void EncodedProgram::DebuggingSummary() { | 235 void EncodedProgram::DebuggingSummary() { |
| 236 LOG(INFO) << "EncodedProgram Summary"; | 236 VLOG(1) << "EncodedProgram Summary\n" |
| 237 LOG(INFO) << " image base " << image_base_; | 237 << " image base " << image_base_ |
|
sra1
2010/10/21 00:08:49
You could put it back one per line, or if you don'
| |
| 238 LOG(INFO) << " abs32 rvas " << abs32_rva_.size(); | 238 << "\n abs32 rvas " << abs32_rva_.size() |
| 239 LOG(INFO) << " rel32 rvas " << rel32_rva_.size(); | 239 << "\n rel32 rvas " << rel32_rva_.size() |
| 240 LOG(INFO) << " ops " << ops_.size(); | 240 << "\n ops " << ops_.size() |
| 241 LOG(INFO) << " origins " << origins_.size(); | 241 << "\n origins " << origins_.size() |
| 242 LOG(INFO) << " copy_counts " << copy_counts_.size(); | 242 << "\n copy_counts " << copy_counts_.size() |
| 243 LOG(INFO) << " copy_bytes " << copy_bytes_.size(); | 243 << "\n copy_bytes " << copy_bytes_.size() |
| 244 LOG(INFO) << " abs32_ix " << abs32_ix_.size(); | 244 << "\n abs32_ix " << abs32_ix_.size() |
| 245 LOG(INFO) << " rel32_ix " << rel32_ix_.size(); | 245 << "\n rel32_ix " << rel32_ix_.size(); |
| 246 } | 246 } |
| 247 | 247 |
| 248 //////////////////////////////////////////////////////////////////////////////// | 248 //////////////////////////////////////////////////////////////////////////////// |
| 249 | 249 |
| 250 // For algorithm refinement purposes it is useful to write subsets of the file | 250 // For algorithm refinement purposes it is useful to write subsets of the file |
| 251 // format. This gives us the ability to estimate the entropy of the | 251 // format. This gives us the ability to estimate the entropy of the |
| 252 // differential compression of the individual streams, which can provide | 252 // differential compression of the individual streams, which can provide |
| 253 // invaluable insights. The default, of course, is to include all the streams. | 253 // invaluable insights. The default, of course, is to include all the streams. |
| 254 // | 254 // |
| 255 enum FieldSelect { | 255 enum FieldSelect { |
| (...skipping 304 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 560 if (assembled) | 560 if (assembled) |
| 561 return C_OK; | 561 return C_OK; |
| 562 return C_ASSEMBLY_FAILED; | 562 return C_ASSEMBLY_FAILED; |
| 563 } | 563 } |
| 564 | 564 |
| 565 void DeleteEncodedProgram(EncodedProgram* encoded) { | 565 void DeleteEncodedProgram(EncodedProgram* encoded) { |
| 566 delete encoded; | 566 delete encoded; |
| 567 } | 567 } |
| 568 | 568 |
| 569 } // end namespace | 569 } // end namespace |
| OLD | NEW |