Searched refs:nof (Results 1 – 12 of 12) sorted by relevance
| /external/v8/src/js/ |
| D | collection.js | 163 var nof = ORDERED_HASH_TABLE_ELEMENT_COUNT(table);
166 if ((nof + nod) >= capacity) {
172 nof = ORDERED_HASH_TABLE_ELEMENT_COUNT(table);
175 var entry = nof + nod;
180 ORDERED_HASH_TABLE_SET_ELEMENT_COUNT(table, nof + 1);
211 var nof = ORDERED_HASH_TABLE_ELEMENT_COUNT(table) - 1;
215 ORDERED_HASH_TABLE_SET_ELEMENT_COUNT(table, nof);
217 if (nof < (numBuckets >>> 1)) %SetShrink(this);
344 var nof = ORDERED_HASH_TABLE_ELEMENT_COUNT(table);
347 if ((nof + nod) >= capacity) {
[all …]
|
| /external/v8/src/ |
| D | transitions.cc | 444 int nof = IsSimpleTransition(raw_transitions) ? 1 : 0; in EnsureHasFullTransitionArray() local
445 Handle<TransitionArray> result = Allocate(map->GetIsolate(), nof); in EnsureHasFullTransitionArray()
450 if (new_nof != nof) { in EnsureHasFullTransitionArray()
454 } else if (nof == 1) { in EnsureHasFullTransitionArray()
|
| D | objects.cc | 4635 int nof = map->NumberOfOwnDescriptors(); in AppendCallbackDescriptors() local
4639 nof = AppendUniqueCallbacks<DescriptorArrayAppender>(&callbacks, array, nof); in AppendCallbackDescriptors()
4640 map->SetNumberOfOwnDescriptors(nof); in AppendCallbackDescriptors()
9994 int nof = map->NumberOfOwnDescriptors(); in CopyAddDescriptor() local
9996 DescriptorArray::CopyUpTo(descriptors, nof, 1); in CopyAddDescriptor()
10001 ? LayoutDescriptor::New(map, new_descriptors, nof + 1) in CopyAddDescriptor()
12271 int nof = Min(NumberOfOwnDescriptors(), other->NumberOfOwnDescriptors()); in EquivalentToForTransition() local
12273 nof); in EquivalentToForTransition()
17235 int nof = table->NumberOfElements() + n; in EnsureCapacity() local
17245 nof * 2, in EnsureCapacity()
[all …]
|
| D | objects-inl.h | 2797 int nof = array->number_of_entries(); in Search() local
2798 if (nof == 0) { in Search()
2806 nof <= kMaxElementsForLinearSearch) || in Search()
2809 return LinearSearch<search_mode>(array, name, nof, valid_entries, in Search()
2814 return BinarySearch<search_mode>(array, name, 0, nof - 1, valid_entries, in Search()
3115 void HashTableBase::SetNumberOfElements(int nof) { in SetNumberOfElements() argument
3116 set(kNumberOfElementsIndex, Smi::FromInt(nof)); in SetNumberOfElements()
|
| D | objects.h | 3130 inline void SetNumberOfElements(int nof);
|
| /external/squashfs-tools/squashfs-tools/ |
| D | squashfs_fs.h | 101 #define SQUASHFS_MKFLAGS(noi, nod, nof, nox, no_frag, always_frag, \ argument
103 (nod << 1) | (nof << 3) | (no_frag << 4) | \
|
| /external/clang/test/SemaCXX/ |
| D | cxx1y-variable-templates_top_level.cpp | 355 float nof = arr<float>[3]; // No bounds-check in C++ in bar() local
|
| /external/squashfs-tools/kernel-2.4/include/linux/ |
| D | squashfs_fs.h | 103 #define SQUASHFS_MKFLAGS(noi, nod, check_data, nof, no_frag, always_frag, \ argument
105 | (nof << 3) | (no_frag << 4) | (always_frag << 5) | \
|
| /external/v8/test/cctest/ |
| D | test-unboxed-doubles.cc | 749 int nof = 0; in TestLayoutDescriptorAppendIfFastOrUseFull() local
787 nof++; in TestLayoutDescriptorAppendIfFastOrUseFull()
|
| D | test-api.cc | 13705 const int nof = 2; in THREADED_TEST() local
13706 const char* sources[nof] = { in THREADED_TEST()
13711 for (int i = 0; i < nof; i++) { in THREADED_TEST()
|
| /external/hyphenation-patterns/nb/ |
| D | hyph-nb.pat.txt | 15947 2nof
|
| /external/hyphenation-patterns/nn/ |
| D | hyph-nn.pat.txt | 15947 2nof
|