/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrClipMaskManager.cpp | 88 bool GrClipMaskManager::useSWOnlyPath(const ElementList& elements) { argument 95 for (ElementList::Iter iter(elements.headIter()); iter.get(); iter.next()) { 110 bool GrClipMaskManager::installClipEffects(const ElementList& elements, argument 124 ElementList::Iter iter(elements); 135 SkASSERT(iter.get() == elements.head()); 220 ElementList elements(16); 239 &elements, 244 if (elements.isEmpty()) { 267 if (elements.count() <= 4) { 270 if (elements 543 createAlphaClipMask(int32_t elementsGenID, InitialState initialState, const ElementList& elements, const SkIRect& clipSpaceIBounds) argument 694 createStencilClipMask(int32_t elementsGenID, InitialState initialState, const ElementList& elements, const SkIRect& clipSpaceIBounds, const SkIPoint& clipSpaceToStencilOffset) argument 1043 createSoftwareClipMask(int32_t elementsGenID, GrReducedClip::InitialState initialState, const GrReducedClip::ElementList& elements, const SkIRect& clipSpaceIBounds) argument [all...] |
/external/chromium_org/v8/src/arm/ |
H A D | codegen-arm.cc | 417 Register elements = r4; local 428 elements, length, array, scratch2)); 431 __ JumpIfJSArrayHasAllocationMemento(receiver, elements, fail); 436 __ ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset)); 437 __ CompareRoot(elements, Heap::kEmptyFixedArrayRootIndex); 441 __ ldr(length, FieldMemOperand(elements, FixedArray::kLengthOffset)); 442 // length: number of elements (smi-tagged) 448 __ Allocate(lr, array, elements, scratch2, &gc_required, DOUBLE_ALIGNMENT); 450 __ ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset)); 481 __ add(scratch1, elements, Operan 559 Register elements = r4; local [all...] |
/external/chromium_org/v8/src/compiler/ |
H A D | js-typed-lowering.cc | 546 Node* elements = graph()->NewNode( local 550 elements = graph()->NewNode( 552 elements, NodeProperties::GetEffectInput(node)); 559 graph()->NewNode(simplified()->LoadElement(element_access), elements, 586 Node* elements = graph()->NewNode( local 590 elements = graph()->NewNode( 592 elements, NodeProperties::GetEffectInput(node)); 606 graph()->NewNode(simplified()->StoreElement(element_access), elements,
|
/external/chromium_org/v8/src/ic/arm/ |
H A D | ic-arm.cc | 40 // elements: Property dictionary. It is not clobbered if a jump to the miss 45 // label is not done. Can be the same as elements or name clobbering 47 // The two scratch registers need to be different from elements, name and 52 Register elements, Register name, 62 NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements, 67 __ bind(&done); // scratch2 == elements + 4 * index 84 // elements: Property dictionary. It is not clobbered if a jump to the miss 89 // The two scratch registers need to be different from elements, name and 94 Register elements, Register name, 104 NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements, 51 GenerateDictionaryLoad(MacroAssembler* masm, Label* miss, Register elements, Register name, Register result, Register scratch1, Register scratch2) argument 93 GenerateDictionaryStore(MacroAssembler* masm, Label* miss, Register elements, Register name, Register value, Register scratch1, Register scratch2) argument 162 GenerateFastArrayLoad(MacroAssembler* masm, Register receiver, Register key, Register elements, Register scratch1, Register scratch2, Register result, Label* not_fast_array, Label* out_of_range) argument 627 KeyedStoreGenerateGenericHelper( MacroAssembler* masm, Label* fast_object, Label* fast_double, Label* slow, KeyedStoreCheckMap check_map, KeyedStoreIncrementLength increment_length, Register value, Register key, Register receiver, Register receiver_map, Register elements_map, Register elements) argument 789 Register elements = r9; // Elements array of the receiver. local [all...] |
/external/chromium_org/v8/src/ic/mips/ |
H A D | ic-mips.cc | 38 // elements: Property dictionary. It is not clobbered if a jump to the miss 43 // label is not done. Can be the same as elements or name clobbering 45 // The two scratch registers need to be different from elements, name and 52 Register elements, Register name, 62 NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements, 67 __ bind(&done); // scratch2 == elements + 4 * index. 85 // elements: Property dictionary. It is not clobbered if a jump to the miss 90 // The two scratch registers need to be different from elements, name and 97 Register elements, Register name, 107 NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements, 51 GenerateDictionaryLoad(MacroAssembler* masm, Label* miss, Register elements, Register name, Register result, Register scratch1, Register scratch2) argument 96 GenerateDictionaryStore(MacroAssembler* masm, Label* miss, Register elements, Register name, Register value, Register scratch1, Register scratch2) argument 164 GenerateFastArrayLoad(MacroAssembler* masm, Register receiver, Register key, Register elements, Register scratch1, Register scratch2, Register result, Label* not_fast_array, Label* out_of_range) argument 623 KeyedStoreGenerateGenericHelper( MacroAssembler* masm, Label* fast_object, Label* fast_double, Label* slow, KeyedStoreCheckMap check_map, KeyedStoreIncrementLength increment_length, Register value, Register key, Register receiver, Register receiver_map, Register elements_map, Register elements) argument 788 Register elements = t3; // Elements array of the receiver. local [all...] |
/external/chromium_org/v8/src/ic/mips64/ |
H A D | ic-mips64.cc | 38 // elements: Property dictionary. It is not clobbered if a jump to the miss 43 // label is not done. Can be the same as elements or name clobbering 45 // The two scratch registers need to be different from elements, name and 52 Register elements, Register name, 62 NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements, 67 __ bind(&done); // scratch2 == elements + 4 * index. 85 // elements: Property dictionary. It is not clobbered if a jump to the miss 90 // The two scratch registers need to be different from elements, name and 97 Register elements, Register name, 107 NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements, 51 GenerateDictionaryLoad(MacroAssembler* masm, Label* miss, Register elements, Register name, Register result, Register scratch1, Register scratch2) argument 96 GenerateDictionaryStore(MacroAssembler* masm, Label* miss, Register elements, Register name, Register value, Register scratch1, Register scratch2) argument 163 GenerateFastArrayLoad(MacroAssembler* masm, Register receiver, Register key, Register elements, Register scratch1, Register scratch2, Register result, Label* not_fast_array, Label* out_of_range) argument 628 KeyedStoreGenerateGenericHelper( MacroAssembler* masm, Label* fast_object, Label* fast_double, Label* slow, KeyedStoreCheckMap check_map, KeyedStoreIncrementLength increment_length, Register value, Register key, Register receiver, Register receiver_map, Register elements_map, Register elements) argument 797 Register elements = a7; // Elements array of the receiver. local [all...] |
/external/chromium_org/v8/src/ |
H A D | json-stringifier.h | 370 FixedArray* elements = FixedArray::cast(stack_->elements()); local 372 if (elements->get(i) == *object) { 383 FixedArray::cast(stack_->elements())->set(length, *object); 553 Handle<FixedArray> elements( 554 FixedArray::cast(object->elements()), isolate_); 557 SerializeSmi(Smi::cast(elements->get(i))); 564 Handle<FixedDoubleArray> elements( 565 FixedDoubleArray::cast(object->elements()), isolate_); 568 SerializeDouble(elements [all...] |
/external/chromium_org/v8/src/mips/ |
H A D | codegen-mips.cc | 699 Register elements = t0; local 711 elements, length, array, scratch2)); 716 __ JumpIfJSArrayHasAllocationMemento(receiver, elements, fail); 721 __ lw(elements, FieldMemOperand(receiver, JSObject::kElementsOffset)); 723 __ Branch(&only_change_map, eq, at, Operand(elements)); 726 __ lw(length, FieldMemOperand(elements, FixedArray::kLengthOffset)); 727 // elements: source FixedArray 728 // length: number of elements (smi-tagged) 765 __ Addu(scratch1, elements, 772 Register hole_lower = elements; 849 Register elements = t0; local [all...] |
/external/chromium_org/v8/src/mips64/ |
H A D | codegen-mips64.cc | 593 Register elements = a4; local 605 elements, length, array, scratch2)); 609 __ JumpIfJSArrayHasAllocationMemento(receiver, elements, fail); 614 __ ld(elements, FieldMemOperand(receiver, JSObject::kElementsOffset)); 616 __ Branch(&only_change_map, eq, at, Operand(elements)); 619 __ ld(length, FieldMemOperand(elements, FixedArray::kLengthOffset)); 620 // elements: source FixedArray 621 // length: number of elements (smi-tagged) 658 __ Daddu(scratch1, elements, 665 Register hole_lower = elements; 741 Register elements = a4; local [all...] |
/external/freetype/src/psaux/ |
H A D | psobjs.c | 60 /* count :: The table size = the maximum number of elements. */ 77 if ( FT_NEW_ARRAY( table->elements, count ) || 92 FT_FREE( table->elements ); 103 FT_Byte** offset = table->elements; 131 /* copy elements and shift offsets */ 214 table->elements[idx] = table->block + table->cursor; 272 FT_FREE( table->elements ); 719 /* the number of array elements */ 1302 T1_TokenRec elements[T1_MAX_TABLE_ELEMENTS]; local 1316 ps_parser_to_token_array( parser, elements, [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | Iterators.java | 81 // Casting to any type is safe since there are no actual elements. 108 // Casting to any type is safe since there are no actual elements. 145 * Returns the number of elements remaining in {@code iterator}. The iterator 184 * @param removeFrom the iterator to (potentially) remove elements from 185 * @param elementsToRemove the elements to remove 206 * @param removeFrom the iterator to (potentially) remove elements from 209 * @return {@code true} if any elements were removed from the iterator 230 * @param removeFrom the iterator to (potentially) remove elements from 231 * @param elementsToRetain the elements to retain 248 * Determines whether two iterators contain equal elements i 444 cycle(T... elements) argument [all...] |
H A D | MinMaxPriorityQueue.java | 45 * natural order of elements is used. 59 * queues, which either block or reject new elements when full. 64 * it stores elements in a single array, as compact as the traditional heap data 67 * <p>This class is not thread-safe, and does not accept null elements. 102 * and initially containing the given elements. 112 * least and greatest elements. 121 * expectedSize} elements. 131 * elements. Each time a queue grows beyond this bound, it immediately 181 * that are limited to {@code maximumSize} elements. Each time a queue grows 201 * options, and having the given initial elements 805 containsExact(Iterable<E> elements, E target) argument [all...] |
H A D | Multisets.java | 328 * elements. 468 * Returns the expected number of distinct elements given the specified 469 * elements. The number of distinct elements is only computed if {@code 470 * elements} is an instance of {@code Multiset}; otherwise the default value 473 static int inferDistinctElements(Iterable<?> elements) { argument 474 if (elements instanceof Multiset) { 475 return ((Multiset<?>) elements).elementSet().size(); 569 * all occurrences of elements that appear at all in {@code 570 * multisetToRetain}, and deletes all occurrences of all other elements 731 addAllImpl( Multiset<E> self, Collection<? extends E> elements) argument [all...] |
H A D | Sets.java | 68 * Returns an immutable set instance containing the given enum elements. 72 * order, not the order in which the elements are provided to the method. 74 * @param anElement one of the elements the set should contain 75 * @param otherElements the rest of the elements the set should contain 76 * @return an immutable set containing those elements, minus duplicates 86 * Returns an immutable set instance containing the given enum elements. 90 * order, not the order in which the elements appear in the given collection. 92 * @param elements the elements, all of the same {@code enum} type, that the 94 * @return an immutable set containing those elements, minu 98 immutableEnumSet( Iterable<E> elements) argument 174 newHashSet(E... elements) argument 210 newHashSet(Iterable<? extends E> elements) argument 229 newHashSet(Iterator<? extends E> elements) argument 281 newLinkedHashSet( Iterable<? extends E> elements) argument 323 newTreeSet( Iterable<? extends E> elements) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | Iterators.java | 79 // Casting to any type is safe since there are no actual elements. 106 // Casting to any type is safe since there are no actual elements. 143 * Returns the number of elements remaining in {@code iterator}. The iterator 182 * @param removeFrom the iterator to (potentially) remove elements from 183 * @param elementsToRemove the elements to remove 204 * @param removeFrom the iterator to (potentially) remove elements from 207 * @return {@code true} if any elements were removed from the iterator 228 * @param removeFrom the iterator to (potentially) remove elements from 229 * @param elementsToRetain the elements to retain 246 * Determines whether two iterators contain equal elements i 426 cycle(T... elements) argument [all...] |
H A D | Sets.java | 65 * Returns an immutable set instance containing the given enum elements. 69 * order, not the order in which the elements are provided to the method. 71 * @param anElement one of the elements the set should contain 72 * @param otherElements the rest of the elements the set should contain 73 * @return an immutable set containing those elements, minus duplicates 83 * Returns an immutable set instance containing the given enum elements. 87 * order, not the order in which the elements appear in the given collection. 89 * @param elements the elements, all of the same {@code enum} type, that the 91 * @return an immutable set containing those elements, minu 95 immutableEnumSet( Iterable<E> elements) argument 171 newHashSet(E... elements) argument 207 newHashSet(Iterable<? extends E> elements) argument 226 newHashSet(Iterator<? extends E> elements) argument 278 newLinkedHashSet( Iterable<? extends E> elements) argument 320 newTreeSet( Iterable<? extends E> elements) argument [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ImmutableListTest.java | 93 @Override protected List<String> create(String[] elements) { 95 ImmutableList.copyOf(elements)); 432 elements(), 437 elements(), 442 elements(), 447 elements(), 452 elements(1), 457 elements(1), 462 elements(1, 2), 467 elements( 487 elements(Integer... elements) argument 491 ops(ListFrobber... elements) argument [all...] |
H A D | OrderingTest.java | 167 // comparing any pair of elements gives the answer we expect. 185 // Don't let the elements be in such a predictable order 191 // comparing any pair of elements gives the answer we expect. 528 int iterations, int elements, int seeds) { 534 for (int j = 0; j < elements; j++) { 527 runLeastOfComparison( int iterations, int elements, int seeds) argument
|
/external/icu/icu4c/source/common/ |
H A D | uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are 60 * coordinated with the ratio between successive elements of the 222 p = hash->elements = (UHashElement*) 225 if (hash->elements == NULL) { 338 UHashElement *elements = hash->elements; local 344 tableHash = elements[theIndex].hashcode; 346 if ((*hash->keyComparator)(key, elements[theIndex].key)) { 347 return &(elements[theIndex]); 380 return &(elements[theInde [all...] |
/external/ltrace/sysdeps/linux-gnu/x86/ |
H A D | fetch.c | 391 enum arg_class classes[], size_t elements, 402 for (i = 0; i < elements; ++i) 412 start_2nd, elements, getter) < 0) 426 0, elements, getter); 389 classify_eightbytes(struct process *proc, struct fetch_context *context, struct arg_type_info *info, enum arg_class classes[], size_t elements, size_t eightbytes, struct arg_type_info *(*getter)(struct arg_type_info *, size_t)) argument
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_context.c | 335 const struct pipe_vertex_element *elements) 343 memcpy(draw->pt.vertex_element, elements, count * sizeof(elements[0])); 609 * Tell the draw module where vertex indexes/elements are located, and 617 const void *elements, unsigned elem_size) 623 draw->pt.user.elts = elements; 333 draw_set_vertex_elements(struct draw_context *draw, unsigned count, const struct pipe_vertex_element *elements) argument 616 draw_set_indexes(struct draw_context *draw, const void *elements, unsigned elem_size) argument
|
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11app/ |
H A D | d3d11u.h | 91 const D3D11_INPUT_ELEMENT_DESC *elements, unsigned num_elements, 97 dev->CreateInputLayout(elements, num_elements, vs, vs_size, &layout); 166 D3D11_INPUT_ELEMENT_DESC elements[2] = local 173 elements, 2, 90 mesh(ID3D11Device* dev, D3D11_PRIMITIVE_TOPOLOGY topology, const D3D11_INPUT_ELEMENT_DESC *elements, unsigned num_elements, const void* vs, unsigned vs_size, const void* vertices, unsigned vertex_size, unsigned num_vertices, const void* indices = 0, unsigned index_size = 0, unsigned num_indices = 0) argument
|
/external/mesa3d/src/mesa/vbo/ |
H A D | vbo_exec_array.c | 81 * Compute min and max elements by scanning the index buffer for 184 * Compute min and max elements for nr_prims 287 const void *elements, GLint basevertex) 298 elements = ADD_POINTERS(elements, elemMap); 307 j = ((const GLubyte *) elements)[i]; 310 j = ((const GLushort *) elements)[i]; 313 j = ((const GLuint *) elements)[i]; 286 check_draw_elements_data(struct gl_context *ctx, GLsizei count, GLenum elemType, const void *elements, GLint basevertex) argument
|
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/http/ |
H A D | JavaApiConverter.java | 679 private static <T> List<T> nullSafeImmutableList(T[] elements) { argument 680 return elements == null ? Collections.<T>emptyList() : Util.immutableList(elements);
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/psaux/ |
H A D | psobjs.c | 60 /* count :: The table size = the maximum number of elements. */ 77 if ( FT_NEW_ARRAY( table->elements, count ) || 92 FT_FREE( table->elements ); 103 FT_Byte** offset = table->elements; 131 /* copy elements and shift offsets */ 214 table->elements[idx] = table->block + table->cursor; 272 FT_FREE( table->elements ); 719 /* the number of array elements */ 1302 T1_TokenRec elements[T1_MAX_TABLE_ELEMENTS]; local 1316 ps_parser_to_token_array( parser, elements, [all...] |