HomeSort by relevance Sort by last modified time
    Searched defs:size (Results 2201 - 2225 of 11184) sorted by null

<<81828384858687888990>>

  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/editors/
EditorColorBorderTabletUI.java 72 BasicParameterInt size; local
73 size = (BasicParameterInt) mRep.getParam(FilterColorBorderRepresentation.PARAM_SIZE);
74 mCBSizeSeekBar.setMax(size.getMaximum() - size.getMinimum());
75 mCBSizeSeekBar.setProgress(size.getValue());
121 BasicParameterInt size = (BasicParameterInt) mRep.getParam(type);
122 size.setValue(progress + size.getMinimum());
123 mCBSizeValue.setText(Integer.toString(size.getValue()));
141 BasicParameterInt size = (BasicParameterInt) mRep.getParam(type)
    [all...]
EditorDrawTabletUI.java 76 BasicParameterInt size; local
77 size = (BasicParameterInt) mRep.getParam(FilterDrawRepresentation.PARAM_SIZE);
78 mdrawSizeSeekBar.setMax(size.getMaximum() - size.getMinimum());
79 mdrawSizeSeekBar.setProgress(size.getValue());
120 BasicParameterInt size;
121 size = (BasicParameterInt) mRep.getParam(FilterDrawRepresentation.PARAM_SIZE);
122 size.setValue(progress + size.getMinimum());
124 int val = progress + size.getMinimum()
    [all...]
  /packages/apps/Messaging/src/com/android/messaging/datamodel/media/
CompositeImageRequest.java 59 Assert.equals(descriptors.size(), targetRects.size());
60 Assert.isTrue(descriptors.size() > 1);
62 for (int i = 0; i < descriptors.size(); i++) {
72 // Draw the bitmap into a smaller size with a circle mask.
  /external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/
ContentResolverTest.java 68 assertThat(shadowContentResolver.getInsertStatements().size(), is(1));
75 assertThat(shadowContentResolver.getInsertStatements().size(), is(2));
84 assertThat(shadowContentResolver.getUpdateStatements().size(), is(1));
93 assertThat(shadowContentResolver.getUpdateStatements().size(), is(2));
102 assertThat(shadowContentResolver.getDeletedUris().size(), equalTo(0));
106 assertThat(shadowContentResolver.getDeletedUris().size(), equalTo(1));
110 assertThat(shadowContentResolver.getDeletedUris().size(), equalTo(2));
115 assertThat(shadowContentResolver.getDeleteStatements().size(), equalTo(0));
118 assertThat(shadowContentResolver.getDeleteStatements().size(), equalTo(1));
124 assertThat(shadowContentResolver.getDeleteStatements().size(), equalTo(2))
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
CalendarTest.java 978 assertTrue(allResult.size() >= shortResult.size());
979 assertTrue(allResult.size() >= longResult.size());
980 assertTrue(allResult.size() <= shortResult.size()
981 + longResult.size());
988 assertTrue(allResult.size() >= shortResult.size());
989 assertTrue(allResult.size() >= longResult.size())
    [all...]
  /packages/providers/CallLogProvider/src/com/android/calllogbackup/
CallLogBackupAgent.java 278 // Read the size.
279 int size = dataInput.readInt(); local
282 for (int i = 0; i < size; i++) {
300 // size + callIds
301 dataOutput.writeInt(state.callIds.size());
428 output.writeEntityHeader(Integer.toString(call.id), baos.size());
429 output.writeEntityData(baos.toByteArray(), baos.size());
453 // Versioning and size-prefixing the data should be done here as needed.
  /art/compiler/jni/quick/x86/
calling_convention_x86.cc 128 if (entry_spills_.size() == 0) {
134 int32_t size = IsParamADouble(itr_args_) ? 8 : 4; local
136 ManagedRegisterSpill spill(in_reg, size, spill_offset);
143 ManagedRegisterSpill spill2(in_reg, size, spill_offset + 4);
182 // Method*, return address and callee save area size, local reference segment state
184 (2 + CalleeSaveRegisters().size()) * kFramePointerSize;
187 // Plus return value spill area size
  /art/compiler/jni/quick/x86_64/
calling_convention_x86_64.cc 107 if (entry_spills_.size() == 0) {
112 int32_t size = IsParamALongOrDouble(itr_args_)? 8 : 4; local
114 ManagedRegisterSpill spill(in_reg, size, spill_offset);
150 // Method*, return address and callee save area size, local reference segment state
152 (2 + CalleeSaveRegisters().size()) * kFramePointerSize;
155 // Plus return value spill area size
  /art/compiler/optimizing/
stack_map_test.cc 58 size_t size = stream.PrepareForFillIn(); local
59 void* memory = arena.Alloc(size, kArenaAllocMisc);
60 MemoryRegion region(memory, size);
74 ASSERT_EQ(expected_location_catalog_size, location_catalog.Size());
95 ASSERT_EQ(expected_dex_register_map_size, dex_register_map.Size());
170 size_t size = stream.PrepareForFillIn(); local
171 void* memory = arena.Alloc(size, kArenaAllocMisc);
172 MemoryRegion region(memory, size);
186 ASSERT_EQ(expected_location_catalog_size, location_catalog.Size());
209 ASSERT_EQ(expected_dex_register_map_size, dex_register_map.Size());
424 size_t size = stream.PrepareForFillIn(); local
516 size_t size = stream.PrepareForFillIn(); local
577 size_t size = stream.PrepareForFillIn(); local
626 size_t size = stream.PrepareForFillIn(); local
727 size_t size = stream.PrepareForFillIn(); local
    [all...]
  /art/compiler/utils/
array_ref.h 64 template <size_t size>
65 explicit constexpr ArrayRef(T (&array)[size])
66 : array_(array), size_(size) {
69 template <typename U, size_t size>
70 explicit constexpr ArrayRef(U (&array)[size],
73 : array_(array), size_(size) {
84 : array_(v.data()), size_(v.size()) {
93 : array_(v.data()), size_(v.size()) {
129 // Size.
130 size_type size() const { return size_; function in class:art::ArrayRef
    [all...]
swap_space.h 38 void* Alloc(size_t size) REQUIRES(!lock_);
39 void Free(void* ptr, size_t size) REQUIRES(!lock_);
49 size_t size; member in struct:art::SwapSpace::SpaceChunk
55 return reinterpret_cast<uintptr_t>(ptr) + size;
68 // Map size to an iterator to free_by_start_'s entry.
91 // Map start of a free chunk to its size.
93 // Free chunks ordered by size.
  /art/compiler/utils/mips64/
assembler_mips64_test.cc 67 // The GNU linker unconditionally pads the code segment with NOPs to a size that is a multiple
71 size_t pad_size = RoundUp(data.size(), 16u) - data.size();
80 if (registers_.size() == 0) {
857 WarnOnCombinations(reg1_registers.size() * reg2_registers.size() * 33 * 16);
862 for (int32_t size = 1; size <= 32; size++) {
863 __ Dext(*reg1, *reg2, pos, size);
864 expected << "dext $" << *reg1 << ", $" << *reg2 << ", " << pos << ", " << size << "\\n"; local
883 expected << "dinsu $" << *reg1 << ", $" << *reg2 << ", " << pos << ", " << size << "\\n"; local
    [all...]
  /art/runtime/gc/space/
malloc_space.cc 75 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the initial size ("
95 LOG(ERROR) << "Failed to allocate pages for alloc space (" << name << ") of size "
125 if (Size() > growth_limit_) {
150 size_t size = -increment; local
151 CHECK_MEMORY_CALL(madvise, (new_end, size, MADV_DONTNEED), GetName());
152 CHECK_MEMORY_CALL(mprotect, (new_end, size, PROT_NONE), GetName());
171 size_t size = RoundUp(Size(), kPageSize); local
174 // Remaining size is for the new alloc space.
175 const size_t growth_limit = growth_limit_ - size;
    [all...]
  /art/runtime/jdwp/
jdwp_event.h 77 int size; /* JdwpStepSize */ member in struct:art::JDWP::JdwpEventMod::__anon110
  /art/runtime/
mem_map_test.cc 37 static uint8_t* GetValidMapAddress(size_t size, bool low_4gb) {
42 size,
53 // Cast the page size to size_t.
66 size_t size0 = m0->Size();
67 EXPECT_EQ(m0->Size(), 2 * page_size);
78 EXPECT_EQ(m0->Size(), page_size);
82 size_t size1 = m1->Size();
212 ASSERT_EQ(map->Size(), kMapSize);
274 constexpr size_t size = 0x100000; local
279 for (; start_addr <= std::numeric_limits<uint32_t>::max() - size; start_addr += size)
    [all...]
memory_region.h 42 size_t size() const { return size_; } function in class:art::FINAL
152 CHECK_GE(this->size(), size_in);
153 CHECK_LE(offset, this->size() - size_in);
160 size_ = (region.size() + extra);
166 CHECK_GE(size(), sizeof(T));
167 CHECK_LE(offset, size() - sizeof(T));
reference_table.cc 45 if (entries_.size() >= max_size_) {
54 for (int i = entries_.size() - 1; i >= 0; --i) {
109 size_t ReferenceTable::Size() const {
110 return entries_.size();
119 // Compare GC roots, first by class, then size, then address.
140 // ...then by size...
158 size_t count = entries.size();
176 size_t size = ref->SizeOf(); local
177 os << StringPrintf(" %5d: %p (raw) (%zd bytes)\n", idx, ref, size);
safe_map.h 68 size_type size() const { return map_.size(); } function in class:art::SafeMap
  /art/runtime/mirror/
string-inl.h 147 size_t size = sizeof(String) + (sizeof(uint16_t) * GetLength<kVerifyFlags>()); local
152 return RoundUp(size, kObjectAlignment);
163 size_t size = header_size + data_size; local
167 size_t alloc_size = RoundUp(size, kObjectAlignment);
203 // It is a caller error to have a count less than the actual array's size.
  /art/test/080-oom-throw/src/
Main.java 90 int size = 32 * 1024 * 1024; local
93 holder[i] = new char[size];
96 size = size / 2;
97 if (size == 0) {
  /art/tools/ahat/src/
HeapTable.java 64 boolean showTotal = heaps.size() > 1;
85 long size = config.getSize(elem, heap); local
86 total += size;
87 vals.add(DocString.format("%,14d", size));
116 long size = summary.get(heap); local
117 total += size;
118 vals.add(DocString.format("%,14d", size));
133 // Returns true if the given heap has a non-zero size entry.
  /art/tools/dexfuzz/src/dexfuzz/program/mutators/
NonsenseStringPrinter.java 153 int size = rng.nextInt(10); local
157 for (int i = 0; i < size; i++) {
  /art/tools/dexfuzz/src/dexfuzz/rawdex/
MapItem.java 42 public int size; field in class:MapItem
49 size = file.readUInt();
61 file.writeUInt(size);
  /bionic/libc/kernel/uapi/linux/
cramfs_fs.h 36 __u32 size : CRAMFS_SIZE_WIDTH, gid : CRAMFS_GID_WIDTH; member in struct:cramfs_inode
50 __u32 size; member in struct:cramfs_super
romfs_fs.h 40 __be32 size; member in struct:romfs_super_block
49 __be32 size; member in struct:romfs_inode

Completed in 515 milliseconds

<<81828384858687888990>>