Lines Matching refs:Shape
5996 StringShape shape(this);
5999 if (shape.representation_tag() == kConsStringTag) {
6005 shape = StringShape(string);
6007 if (shape.representation_tag() == kSlicedStringTag) {
6011 shape = StringShape(string);
6012 ASSERT(shape.representation_tag() != kConsStringTag &&
6013 shape.representation_tag() != kSlicedStringTag);
6015 if (shape.encoding_tag() == kAsciiStringTag) {
6017 if (shape.representation_tag() == kSeqStringTag) {
6024 ASSERT(shape.encoding_tag() == kTwoByteStringTag);
6026 if (shape.representation_tag() == kSeqStringTag) {
9950 template<typename Shape, typename Key>
9951 void Dictionary<Shape, Key>::Print(FILE* out) {
9952 int capacity = HashTable<Shape, Key>::Capacity();
9954 Object* k = HashTable<Shape, Key>::KeyAt(i);
9955 if (HashTable<Shape, Key>::IsKey(k)) {
9971 template<typename Shape, typename Key>
9972 void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) {
9974 int capacity = HashTable<Shape, Key>::Capacity();
9978 Object* k = Dictionary<Shape, Key>::KeyAt(i);
9979 if (Dictionary<Shape, Key>::IsKey(k)) {
10860 template<typename Shape, typename Key>
10861 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
10866 template<typename Shape, typename Key>
10867 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
10874 template<typename Shape, typename Key>
10875 MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,
10959 template<typename Shape, typename Key>
10960 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
10968 i < kPrefixStartIndex + Shape::kPrefixSize;
10979 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
10982 for (int j = 0; j < Shape::kEntrySize; j++) {
10993 template<typename Shape, typename Key>
10994 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {
11019 template<typename Shape, typename Key>
11020 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
11048 template<typename Shape, typename Key>
11049 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
11957 template<typename Shape, typename Key>
11958 MaybeObject* Dictionary<Shape, Key>::Allocate(int at_least_space_for) {
11961 HashTable<Shape, Key>::Allocate(at_least_space_for);
11965 Dictionary<Shape, Key>::cast(obj)->
11971 template<typename Shape, typename Key>
11972 MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() {
11973 Heap* heap = Dictionary<Shape, Key>::GetHeap();
11974 int length = HashTable<Shape, Key>::NumberOfElements();
11993 int capacity = HashTable<Shape, Key>::Capacity();
11996 if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
12012 capacity = HashTable<Shape, Key>::Capacity();
12015 if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
12029 template<typename Shape, typename Key>
12030 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) {
12032 if (Shape::kIsEnumerable &&
12040 return HashTable<Shape, Key>::EnsureCapacity(n, key);
12044 template<typename Shape, typename Key>
12045 Object* Dictionary<Shape, Key>::DeleteProperty(int entry,
12047 Heap* heap = Dictionary<Shape, Key>::GetHeap();
12054 HashTable<Shape, Key>::ElementRemoved();
12059 template<typename Shape, typename Key>
12060 MaybeObject* Dictionary<Shape, Key>::Shrink(Key key) {
12061 return HashTable<Shape, Key>::Shrink(key);
12065 template<typename Shape, typename Key>
12066 MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) {
12070 if (entry != Dictionary<Shape, Key>::kNotFound) {
12082 { MaybeObject* maybe_k = Shape::AsObject(key);
12087 return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
12088 Dictionary<Shape, Key>::Hash(key));
12092 template<typename Shape, typename Key>
12093 MaybeObject* Dictionary<Shape, Key>::Add(Key key,
12097 SLOW_ASSERT((this->FindEntry(key) == Dictionary<Shape, Key>::kNotFound));
12104 return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
12105 Dictionary<Shape, Key>::Hash(key));
12110 template<typename Shape, typename Key>
12111 MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key,
12117 { MaybeObject* maybe_k = Shape::AsObject(key);
12121 uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);
12123 if (!details.IsDeleted() && details.index() == 0 && Shape::kIsEnumerable) {
12131 ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber()
12132 || Dictionary<Shape, Key>::KeyAt(entry)->IsString()));
12133 HashTable<Shape, Key>::ElementAdded();
12236 template<typename Shape, typename Key>
12237 int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes(
12239 int capacity = HashTable<Shape, Key>::Capacity();
12242 Object* k = HashTable<Shape, Key>::KeyAt(i);
12243 if (HashTable<Shape, Key>::IsKey(k)) {
12254 template<typename Shape, typename Key>
12255 int Dictionary<Shape, Key>::NumberOfEnumElements() {
12261 template<typename Shape, typename Key>
12262 void Dictionary<Shape, Key>::CopyKeysTo(
12265 typename Dictionary<Shape, Key>::SortMode sort_mode) {
12267 int capacity = HashTable<Shape, Key>::Capacity();
12270 Object* k = HashTable<Shape, Key>::KeyAt(i);
12271 if (HashTable<Shape, Key>::IsKey(k)) {
12278 if (sort_mode == Dictionary<Shape, Key>::SORTED) {
12305 template<typename Shape, typename Key>
12306 void Dictionary<Shape, Key>::CopyKeysTo(
12309 typename Dictionary<Shape, Key>::SortMode sort_mode) {
12312 int capacity = HashTable<Shape, Key>::Capacity();
12314 Object* k = HashTable<Shape, Key>::KeyAt(i);
12315 if (HashTable<Shape, Key>::IsKey(k)) {
12321 if (sort_mode == Dictionary<Shape, Key>::SORTED) {
12329 template<typename Shape, typename Key>
12330 Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) {
12331 int capacity = HashTable<Shape, Key>::Capacity();
12333 Object* k = HashTable<Shape, Key>::KeyAt(i);
12334 if (Dictionary<Shape, Key>::IsKey(k)) {
12342 Heap* heap = Dictionary<Shape, Key>::GetHeap();
