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 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
91 V(Symbol) \ | 91 V(Symbol) \ |
92 V(Oddball) \ | 92 V(Oddball) \ |
93 V(Code) \ | 93 V(Code) \ |
94 V(Map) \ | 94 V(Map) \ |
95 V(Cell) \ | 95 V(Cell) \ |
96 V(PropertyCell) \ | 96 V(PropertyCell) \ |
97 V(SharedFunctionInfo) \ | 97 V(SharedFunctionInfo) \ |
98 V(JSFunction) \ | 98 V(JSFunction) \ |
99 V(JSWeakMap) \ | 99 V(JSWeakMap) \ |
100 V(JSWeakSet) \ | 100 V(JSWeakSet) \ |
| 101 V(JSMapIterator) \ |
| 102 V(JSSetIterator) \ |
101 V(JSArrayBuffer) \ | 103 V(JSArrayBuffer) \ |
102 V(JSTypedArray) \ | 104 V(JSTypedArray) \ |
103 V(JSDataView) \ | 105 V(JSDataView) \ |
104 V(JSRegExp) | 106 V(JSRegExp) |
105 | 107 |
106 // For data objects, JS objects and structs along with generic visitor which | 108 // For data objects, JS objects and structs along with generic visitor which |
107 // can visit object of any size we provide visitors specialized by | 109 // can visit object of any size we provide visitors specialized by |
108 // object size in words. | 110 // object size in words. |
109 // Ids of specialized visitors are declared in a linear order (without | 111 // Ids of specialized visitors are declared in a linear order (without |
110 // holes) starting from the id of visitor specialized for 2 words objects | 112 // holes) starting from the id of visitor specialized for 2 words objects |
(...skipping 382 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
493 // access the next-element pointers. | 495 // access the next-element pointers. |
494 template <class T> | 496 template <class T> |
495 Object* VisitWeakList(Heap* heap, | 497 Object* VisitWeakList(Heap* heap, |
496 Object* list, | 498 Object* list, |
497 WeakObjectRetainer* retainer, | 499 WeakObjectRetainer* retainer, |
498 bool record_slots); | 500 bool record_slots); |
499 | 501 |
500 } } // namespace v8::internal | 502 } } // namespace v8::internal |
501 | 503 |
502 #endif // V8_OBJECTS_VISITING_H_ | 504 #endif // V8_OBJECTS_VISITING_H_ |
OLD | NEW |