Lines Matching refs:shape
7980 StringShape shape(this);
7983 if (shape.representation_tag() == kConsStringTag) {
7989 shape = StringShape(string);
7991 if (shape.representation_tag() == kSlicedStringTag) {
7995 shape = StringShape(string);
7996 ASSERT(shape.representation_tag() != kConsStringTag &&
7997 shape.representation_tag() != kSlicedStringTag);
7999 if (shape.encoding_tag() == kOneByteStringTag) {
8001 if (shape.representation_tag() == kSeqStringTag) {
8008 ASSERT(shape.encoding_tag() == kTwoByteStringTag);
8010 if (shape.representation_tag() == kSeqStringTag) {
12759 template<typename Shape, typename Key>
12760 void Dictionary<Shape, Key>::Print(FILE* out) {
12761 int capacity = HashTable<Shape, Key>::Capacity();
12763 Object* k = HashTable<Shape, Key>::KeyAt(i);
12764 if (HashTable<Shape, Key>::IsKey(k)) {
12780 template<typename Shape, typename Key>
12781 void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) {
12783 int capacity = HashTable<Shape, Key>::Capacity();
12787 Object* k = Dictionary<Shape, Key>::KeyAt(i);
12788 if (Dictionary<Shape, Key>::IsKey(k)) {
13586 template<typename Shape, typename Key>
13587 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
13592 template<typename Shape, typename Key>
13593 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
13600 template<typename Shape, typename Key>
13601 MaybeObject* HashTable<Shape, Key>::Allocate(Heap* heap,
13665 template<typename Shape, typename Key>
13666 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
13674 i < kPrefixStartIndex + Shape::kPrefixSize;
13685 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
13688 for (int j = 0; j < Shape::kEntrySize; j++) {
13699 template<typename Shape, typename Key>
13700 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {
13728 template<typename Shape, typename Key>
13729 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
13760 template<typename Shape, typename Key>
13761 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
14743 template<typename Shape, typename Key>
14744 MaybeObject* Dictionary<Shape, Key>::Allocate(Heap* heap,
14749 HashTable<Shape, Key>::Allocate(
14752 HashTable<Shape, Key>::USE_DEFAULT_MINIMUM_CAPACITY,
14757 Dictionary<Shape, Key>::cast(obj)->
14769 template<typename Shape, typename Key>
14770 MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() {
14771 Heap* heap = Dictionary<Shape, Key>::GetHeap();
14772 int length = HashTable<Shape, Key>::NumberOfElements();
14791 int capacity = HashTable<Shape, Key>::Capacity();
14794 if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
14811 capacity = HashTable<Shape, Key>::Capacity();
14814 if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
14828 template<typename Shape, typename Key>
14829 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) {
14831 if (Shape::kIsEnumerable &&
14839 return HashTable<Shape, Key>::EnsureCapacity(n, key);
14843 template<typename Shape, typename Key>
14844 Object* Dictionary<Shape, Key>::DeleteProperty(int entry,
14846 Heap* heap = Dictionary<Shape, Key>::GetHeap();
14853 HashTable<Shape, Key>::ElementRemoved();
14858 template<typename Shape, typename Key>
14859 MaybeObject* Dictionary<Shape, Key>::Shrink(Key key) {
14860 return HashTable<Shape, Key>::Shrink(key);
14864 template<typename Shape, typename Key>
14865 MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) {
14869 if (entry != Dictionary<Shape, Key>::kNotFound) {
14881 { MaybeObject* maybe_k = Shape::AsObject(this->GetHeap(), key);
14886 return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
14887 Dictionary<Shape, Key>::Hash(key));
14891 template<typename Shape, typename Key>
14892 MaybeObject* Dictionary<Shape, Key>::Add(Key key,
14896 SLOW_ASSERT((this->FindEntry(key) == Dictionary<Shape, Key>::kNotFound));
14903 return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
14904 Dictionary<Shape, Key>::Hash(key));
14909 template<typename Shape, typename Key>
14910 MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key,
14916 { MaybeObject* maybe_k = Shape::AsObject(this->GetHeap(), key);
14920 uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);
14924 Shape::kIsEnumerable) {
14932 ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber() ||
14933 Dictionary<Shape, Key>::KeyAt(entry)->IsName()));
14934 HashTable<Shape, Key>::ElementAdded();
15039 template<typename Shape, typename Key>
15040 int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes(
15042 int capacity = HashTable<Shape, Key>::Capacity();
15045 Object* k = HashTable<Shape, Key>::KeyAt(i);
15046 if (HashTable<Shape, Key>::IsKey(k) &&
15058 template<typename Shape, typename Key>
15059 int Dictionary<Shape, Key>::NumberOfEnumElements() {
15065 template<typename Shape, typename Key>
15066 void Dictionary<Shape, Key>::CopyKeysTo(
15069 typename Dictionary<Shape, Key>::SortMode sort_mode) {
15071 int capacity = HashTable<Shape, Key>::Capacity();
15074 Object* k = HashTable<Shape, Key>::KeyAt(i);
15075 if (HashTable<Shape, Key>::IsKey(k)) {
15082 if (sort_mode == Dictionary<Shape, Key>::SORTED) {
15131 template<typename Shape, typename Key>
15132 void Dictionary<Shape, Key>::CopyKeysTo(
15136 typename Dictionary<Shape, Key>::SortMode sort_mode) {
15139 int capacity = HashTable<Shape, Key>::Capacity();
15141 Object* k = HashTable<Shape, Key>::KeyAt(i);
15142 if (HashTable<Shape, Key>::IsKey(k)) {
15149 if (sort_mode == Dictionary<Shape, Key>::SORTED) {
15157 template<typename Shape, typename Key>
15158 Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) {
15159 int capacity = HashTable<Shape, Key>::Capacity();
15161 Object* k = HashTable<Shape, Key>::KeyAt(i);
15162 if (Dictionary<Shape, Key>::IsKey(k)) {
15170 Heap* heap = Dictionary<Shape, Key>::GetHeap();
