OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 1524 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1535 CASE(BUILTIN); | 1535 CASE(BUILTIN); |
1536 CASE(LOAD_IC); | 1536 CASE(LOAD_IC); |
1537 CASE(KEYED_LOAD_IC); | 1537 CASE(KEYED_LOAD_IC); |
1538 CASE(STORE_IC); | 1538 CASE(STORE_IC); |
1539 CASE(KEYED_STORE_IC); | 1539 CASE(KEYED_STORE_IC); |
1540 CASE(CALL_IC); | 1540 CASE(CALL_IC); |
1541 CASE(KEYED_CALL_IC); | 1541 CASE(KEYED_CALL_IC); |
1542 CASE(UNARY_OP_IC); | 1542 CASE(UNARY_OP_IC); |
1543 CASE(BINARY_OP_IC); | 1543 CASE(BINARY_OP_IC); |
1544 CASE(COMPARE_IC); | 1544 CASE(COMPARE_IC); |
| 1545 CASE(TO_BOOLEAN_IC); |
1545 } | 1546 } |
1546 } | 1547 } |
1547 | 1548 |
1548 #undef CASE | 1549 #undef CASE |
1549 | 1550 |
1550 PrintF("\n Code kind histograms: \n"); | 1551 PrintF("\n Code kind histograms: \n"); |
1551 for (int i = 0; i < Code::NUMBER_OF_KINDS; i++) { | 1552 for (int i = 0; i < Code::NUMBER_OF_KINDS; i++) { |
1552 if (isolate->code_kind_statistics()[i] > 0) { | 1553 if (isolate->code_kind_statistics()[i] > 0) { |
1553 PrintF(" %-20s: %10d bytes\n", table[i], | 1554 PrintF(" %-20s: %10d bytes\n", table[i], |
1554 isolate->code_kind_statistics()[i]); | 1555 isolate->code_kind_statistics()[i]); |
(...skipping 1533 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3088 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { | 3089 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { |
3089 if (obj->IsCode()) { | 3090 if (obj->IsCode()) { |
3090 Code* code = Code::cast(obj); | 3091 Code* code = Code::cast(obj); |
3091 isolate->code_kind_statistics()[code->kind()] += code->Size(); | 3092 isolate->code_kind_statistics()[code->kind()] += code->Size(); |
3092 } | 3093 } |
3093 } | 3094 } |
3094 } | 3095 } |
3095 #endif // DEBUG | 3096 #endif // DEBUG |
3096 | 3097 |
3097 } } // namespace v8::internal | 3098 } } // namespace v8::internal |
OLD | NEW |