OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 4980 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4991 | 4991 |
4992 // Find an object in a stub with a specified map | 4992 // Find an object in a stub with a specified map |
4993 Object* FindNthObject(int n, Map* match_map); | 4993 Object* FindNthObject(int n, Map* match_map); |
4994 void ReplaceNthObject(int n, Map* match_map, Object* replace_with); | 4994 void ReplaceNthObject(int n, Map* match_map, Object* replace_with); |
4995 | 4995 |
4996 // Find the first map in an IC stub. | 4996 // Find the first map in an IC stub. |
4997 Map* FindFirstMap(); | 4997 Map* FindFirstMap(); |
4998 void FindAllMaps(MapHandleList* maps); | 4998 void FindAllMaps(MapHandleList* maps); |
4999 void ReplaceFirstMap(Map* replace); | 4999 void ReplaceFirstMap(Map* replace); |
5000 | 5000 |
5001 // Find the first code in an IC stub. | 5001 // Find the first handler in an IC stub. |
5002 Code* FindFirstCode(); | 5002 Code* FindFirstHandler(); |
5003 void FindAllCode(CodeHandleList* code_list, int length); | 5003 |
| 5004 // Find |length| handlers and put them into |code_list|. Returns false if not |
| 5005 // enough handlers can be found. |
| 5006 MUST_USE_RESULT bool FindHandlers(CodeHandleList* code_list, int length); |
5004 | 5007 |
5005 // Find the first name in an IC stub. | 5008 // Find the first name in an IC stub. |
5006 Name* FindFirstName(); | 5009 Name* FindFirstName(); |
5007 | 5010 |
5008 void ReplaceNthCell(int n, Cell* replace_with); | 5011 void ReplaceNthCell(int n, Cell* replace_with); |
5009 | 5012 |
5010 class ExtraICStateStrictMode: public BitField<StrictModeFlag, 0, 1> {}; | 5013 class ExtraICStateStrictMode: public BitField<StrictModeFlag, 0, 1> {}; |
5011 class ExtraICStateKeyedAccessStoreMode: | 5014 class ExtraICStateKeyedAccessStoreMode: |
5012 public BitField<KeyedAccessStoreMode, 1, 4> {}; // NOLINT | 5015 public BitField<KeyedAccessStoreMode, 1, 4> {}; // NOLINT |
5013 | 5016 |
(...skipping 5220 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
10234 } else { | 10237 } else { |
10235 value &= ~(1 << bit_position); | 10238 value &= ~(1 << bit_position); |
10236 } | 10239 } |
10237 return value; | 10240 return value; |
10238 } | 10241 } |
10239 }; | 10242 }; |
10240 | 10243 |
10241 } } // namespace v8::internal | 10244 } } // namespace v8::internal |
10242 | 10245 |
10243 #endif // V8_OBJECTS_H_ | 10246 #endif // V8_OBJECTS_H_ |
OLD | NEW |