| 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 188 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 199 | 199 |
| 200 template<typename T, class P> | 200 template<typename T, class P> |
| 201 size_t GetMemoryUsedByList(const List<T, P>& list) { | 201 size_t GetMemoryUsedByList(const List<T, P>& list) { |
| 202 return list.length() * sizeof(T) + sizeof(list); | 202 return list.length() * sizeof(T) + sizeof(list); |
| 203 } | 203 } |
| 204 | 204 |
| 205 | 205 |
| 206 class Map; | 206 class Map; |
| 207 template<class> class TypeImpl; | 207 template<class> class TypeImpl; |
| 208 class HeapTypeConfig; | 208 class HeapTypeConfig; |
| 209 typedef TypeImpl<HeapTypeConfig> Type; | 209 typedef TypeImpl<HeapTypeConfig> HeapType; |
| 210 class Code; | 210 class Code; |
| 211 template<typename T> class Handle; | 211 template<typename T> class Handle; |
| 212 typedef List<Map*> MapList; | 212 typedef List<Map*> MapList; |
| 213 typedef List<Code*> CodeList; | 213 typedef List<Code*> CodeList; |
| 214 typedef List<Handle<Map> > MapHandleList; | 214 typedef List<Handle<Map> > MapHandleList; |
| 215 typedef List<Handle<Type> > TypeHandleList; | 215 typedef List<Handle<HeapType> > TypeHandleList; |
| 216 typedef List<Handle<Code> > CodeHandleList; | 216 typedef List<Handle<Code> > CodeHandleList; |
| 217 | 217 |
| 218 // Perform binary search for an element in an already sorted | 218 // Perform binary search for an element in an already sorted |
| 219 // list. Returns the index of the element of -1 if it was not found. | 219 // list. Returns the index of the element of -1 if it was not found. |
| 220 // |cmp| is a predicate that takes a pointer to an element of the List | 220 // |cmp| is a predicate that takes a pointer to an element of the List |
| 221 // and returns +1 if it is greater, -1 if it is less than the element | 221 // and returns +1 if it is greater, -1 if it is less than the element |
| 222 // being searched. | 222 // being searched. |
| 223 template <typename T, class P> | 223 template <typename T, class P> |
| 224 int SortedListBSearch(const List<T>& list, P cmp); | 224 int SortedListBSearch(const List<T>& list, P cmp); |
| 225 template <typename T> | 225 template <typename T> |
| 226 int SortedListBSearch(const List<T>& list, T elem); | 226 int SortedListBSearch(const List<T>& list, T elem); |
| 227 | 227 |
| 228 | 228 |
| 229 } } // namespace v8::internal | 229 } } // namespace v8::internal |
| 230 | 230 |
| 231 | 231 |
| 232 #endif // V8_LIST_H_ | 232 #endif // V8_LIST_H_ |
| OLD | NEW |