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 1038 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1049 p->InsertAfter(anchor_.prev_page()); | 1049 p->InsertAfter(anchor_.prev_page()); |
1050 | 1050 |
1051 return true; | 1051 return true; |
1052 } | 1052 } |
1053 | 1053 |
1054 | 1054 |
1055 intptr_t PagedSpace::SizeOfFirstPage() { | 1055 intptr_t PagedSpace::SizeOfFirstPage() { |
1056 int size = 0; | 1056 int size = 0; |
1057 switch (identity()) { | 1057 switch (identity()) { |
1058 case OLD_POINTER_SPACE: | 1058 case OLD_POINTER_SPACE: |
1059 size = 64 * kPointerSize * KB; | 1059 size = 72 * kPointerSize * KB; |
1060 break; | 1060 break; |
1061 case OLD_DATA_SPACE: | 1061 case OLD_DATA_SPACE: |
1062 size = 192 * KB; | 1062 size = 192 * KB; |
1063 break; | 1063 break; |
1064 case MAP_SPACE: | 1064 case MAP_SPACE: |
1065 size = 16 * kPointerSize * KB; | 1065 size = 16 * kPointerSize * KB; |
1066 break; | 1066 break; |
1067 case CELL_SPACE: | 1067 case CELL_SPACE: |
1068 size = 16 * kPointerSize * KB; | 1068 size = 16 * kPointerSize * KB; |
1069 break; | 1069 break; |
1070 case PROPERTY_CELL_SPACE: | 1070 case PROPERTY_CELL_SPACE: |
1071 size = 8 * kPointerSize * KB; | 1071 size = 8 * kPointerSize * KB; |
1072 break; | 1072 break; |
1073 case CODE_SPACE: | 1073 case CODE_SPACE: |
1074 if (heap()->isolate()->code_range()->exists()) { | 1074 if (heap()->isolate()->code_range()->exists()) { |
1075 // When code range exists, code pages are allocated in a special way | 1075 // When code range exists, code pages are allocated in a special way |
1076 // (from the reserved code range). That part of the code is not yet | 1076 // (from the reserved code range). That part of the code is not yet |
1077 // upgraded to handle small pages. | 1077 // upgraded to handle small pages. |
1078 size = AreaSize(); | 1078 size = AreaSize(); |
1079 } else { | 1079 } else { |
1080 size = 384 * KB; | 1080 size = 512 * KB; |
1081 } | 1081 } |
1082 break; | 1082 break; |
1083 default: | 1083 default: |
1084 UNREACHABLE(); | 1084 UNREACHABLE(); |
1085 } | 1085 } |
1086 return Min(size, AreaSize()); | 1086 return Min(size, AreaSize()); |
1087 } | 1087 } |
1088 | 1088 |
1089 | 1089 |
1090 int PagedSpace::CountTotalPages() { | 1090 int PagedSpace::CountTotalPages() { |
(...skipping 2130 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3221 object->ShortPrint(); | 3221 object->ShortPrint(); |
3222 PrintF("\n"); | 3222 PrintF("\n"); |
3223 } | 3223 } |
3224 printf(" --------------------------------------\n"); | 3224 printf(" --------------------------------------\n"); |
3225 printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes()); | 3225 printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes()); |
3226 } | 3226 } |
3227 | 3227 |
3228 #endif // DEBUG | 3228 #endif // DEBUG |
3229 | 3229 |
3230 } } // namespace v8::internal | 3230 } } // namespace v8::internal |
OLD | NEW |