| /external/skia/src/core/ |
| SkMemory_stdlib.cpp | 32 // size this (as a multiple of 4) so that the total offset to the internal data
87 size_t size = 0; local
91 size_t size = header->fSize; local
94 data, size, size);
95 size >>= 2;
96 size_t ints = size > 4 ? 4 : size;
106 size_t chars = size > 16 ? 16 : size;
244 size_t size = header->fSize + sizeof(SkBlockHeader); local
[all...] |
| /external/qemu/elff/ |
| elf_alloc.cc | 34 void* ElfAllocator::alloc(size_t size) {
36 size = (size + ELFALLOC_ALIGNMENT_MASK) & ~ELFALLOC_ALIGNMENT_MASK;
38 if (current_chunk_ == NULL || current_chunk_->remains < size) {
47 new_chunk->size = ELF_ALLOC_CHUNK_SIZE;
49 new_chunk->remains = new_chunk->size - sizeof(ElfAllocatorChunk);
55 current_chunk_->remains -= size;
56 current_chunk_->avail = INC_PTR(current_chunk_->avail, size);
60 void* DwarfAllocBase::operator new(size_t size, const ElfFile* elf) {
61 return elf->allocator()->alloc(size);
[all...] |
| /external/skia/src/images/ |
| SkFDStream.cpp | 29 size_t SkFDStream::read(void* buffer, size_t size) {
31 if (buffer == NULL && size == 0) { // request total size
39 off_t size = ::lseek(fFD, 0, SEEK_END); local
40 if (size < 0) {
44 size = 0; // error
53 return size;
62 off_t newCurr = ::lseek(fFD, size, SEEK_CUR);
72 ssize_t actual = ::read(fFD, buffer, size);
76 SkDebugf("xxxxxxxxxxxxx read failed %d actual %d\n", size, actual)
[all...] |
| /dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
| ArrayBlockingQueueTest.java | 25 * Create a queue of given size containing consecutive
35 assertEquals(n, q.size());
43 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity());
73 Integer[] ints = new Integer[SIZE];
74 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
85 Integer[] ints = new Integer[SIZE];
86 for (int i = 0; i < SIZE-1; ++i)
88 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
99 Integer[] ints = new Integer[SIZE];
[all...] |
| LinkedBlockingQueueTest.java | 28 * Create a queue of given size containing consecutive
38 assertEquals(n, q.size());
47 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity());
78 Integer[] ints = new Integer[SIZE];
90 Integer[] ints = new Integer[SIZE];
91 for (int i = 0; i < SIZE-1; ++i)
104 Integer[] ints = new Integer[SIZE];
105 for (int i = 0; i < SIZE; ++i)
108 for (int i = 0; i < SIZE; ++i
[all...] |
| PriorityBlockingQueueTest.java | 38 * Create a queue of given size containing consecutive
50 assertEquals(n, q.size());
58 assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity());
88 Integer[] ints = new Integer[SIZE];
100 Integer[] ints = new Integer[SIZE];
101 for (int i = 0; i < SIZE-1; ++i)
114 Integer[] ints = new Integer[SIZE];
115 for (int i = 0; i < SIZE; ++i)
118 for (int i = 0; i < SIZE; ++i)
130 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp)
[all...] |
| LinkedListTest.java | 25 * Create a queue of given size containing consecutive
34 assertEquals(n, q.size());
42 assertEquals(0, new LinkedList().size());
62 Integer[] ints = new Integer[SIZE];
63 for (int i = 0; i < SIZE; ++i)
66 for (int i = 0; i < SIZE; ++i)
87 * size changes when elements added and removed
90 LinkedList q = populatedQueue(SIZE);
91 for (int i = 0; i < SIZE; ++i) {
92 assertEquals(SIZE-i, q.size())
[all...] |
| /external/webkit/WebCore/rendering/ |
| RenderArena.cpp | 53 size_t size; member in struct:WebCore::__anon6527
73 void* RenderArena::allocate(size_t size)
78 void* block = ::malloc(sizeof(RenderArenaDebugHeader) + size);
81 header->size = size;
88 size = ROUNDUP(size, sizeof(void*));
91 if (size < gMaxRecycledSize) {
92 const int index = size >> 2;
104 ARENA_ALLOCATE(result, &m_pool, size);
[all...] |
| /frameworks/base/docs/html/sdk/api_diff/3/changes/ |
| methods_index_changes.html | 47 <div id="indexTableCaption" style="background-color:#eee;padding:0 4px 0 4px;font-size:11px;margin-bottom:.5em;">
51 <br><font size="+2">A</font>
52 <a href="#C"><font size="-2">C</font></a>
53 <a href="#D"><font size="-2">D</font></a>
54 <a href="#F"><font size="-2">F</font></a>
55 <a href="#G"><font size="-2">G</font></a>
56 <a href="#I"><font size="-2">I</font></a>
57 <a href="#L"><font size="-2">L</font></a>
58 <a href="#O"><font size="-2">O</font></a>
59 <a href="#P"><font size="-2">P</font></a>
[all...] |
| /frameworks/base/docs/html/sdk/api_diff/5/changes/ |
| methods_index_changes.html | 47 <div id="indexTableCaption" style="background-color:#eee;padding:0 4px 0 4px;font-size:11px;margin-bottom:.5em;">
51 <br><font size="+2">A</font>
52 <a href="#C"><font size="-2">C</font></a>
53 <a href="#D"><font size="-2">D</font></a>
54 <a href="#E"><font size="-2">E</font></a>
55 <a href="#G"><font size="-2">G</font></a>
56 <a href="#I"><font size="-2">I</font></a>
57 <a href="#L"><font size="-2">L</font></a>
58 <a href="#M"><font size="-2">M</font></a>
59 <a href="#O"><font size="-2">O</font></a>
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| IntList.java | 31 /** {@code >= 0;} current size of the list */
32 private int size; field in class:IntList
90 throw new IllegalArgumentException("size < 0");
93 size = 0;
102 for (int i = 0; i < size; i++) {
126 if (size != otherList.size) {
130 for (int i = 0; i < size; i++) {
142 StringBuffer sb = new StringBuffer(size * 5 + 10);
146 for (int i = 0; i < size; i++)
161 public int size() { method in class:IntList
[all...] |
| /external/skia/include/core/ |
| SkReader32.h | 29 SkReader32(const void* data, size_t size) {
30 this->setMemory(data, size);
33 void setMemory(const void* data, size_t size) {
35 SkASSERT(SkAlign4(size) == size);
38 fStop = (const char*)data + size;
41 uint32_t size() const { return fStop - fBase; } function in class:SkReader32
50 SkASSERT(offset <= this->size());
80 const void* skip(size_t size) {
83 fCurr += SkAlign4(size);
[all...] |
| /frameworks/base/tools/aapt/ |
| printapk.cpp | 30 off_t size; local
50 size = lseek(fd, 0, SEEK_END);
53 if (size < 0 || amt < 0) {
54 fprintf(stderr, "apk: error determining file size: %s\n", filename);
58 buf = malloc(size);
64 amt = read(fd, buf, size);
65 if (amt != size) {
72 zip = init_zipfile(buf, size);
89 size = get_zipentry_size(entry);
90 bufsize = size + (size / 1000) + 1
[all...] |
| /external/junit/ |
| cpl-v10.html | 12 <P><B></B><FONT SIZE="3"></FONT>
13 <P><FONT SIZE="3"></FONT><FONT SIZE="2">THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS COMMON PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.</FONT>
14 <P><FONT SIZE="2"></FONT>
15 <P><FONT SIZE="2"><B>1. DEFINITIONS</B></FONT>
16 <P><FONT SIZE="2">"Contribution" means:</FONT>
18 <UL><FONT SIZE="2">a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and<BR CLEAR="LEFT">
22 <UL><FONT SIZE="2">i) changes to the Program, and</FONT></UL>
25 <UL><FONT SIZE="2">ii) additions to the Program;</FONT></UL>
28 <UL><FONT SIZE="2">where such changes and/or additions to the Program originate from and are distributed by that (…)
[all...] |
| /external/stlport/stlport/stl/ |
| _valarray.c | 37 _Valarray_bool __tmp(this->size(), _Valarray_bool::_NoInit());
38 for (size_t __i = 0; __i < this->size(); ++__i)
46 _STLP_ASSERT(__x._M_slice.size() == this->size())
49 __i < __x._M_slice.size();
57 valarray<_Tp> __tmp(__slice.size(), _NoInit());
60 __i < __slice.size();
68 size_t __dim = _M_indices.size() - 1;
88 if (this->size() != 0) {
100 if (__tmp.size() != 0)
[all...] |
| _valarray.h | 135 // Basic assignment. Note that 'x = y' is undefined if x.size() != y.size()
137 _STLP_ASSERT(__x.size() == this->size())
157 _STLP_ASSERT(__n < this->size())
161 _STLP_ASSERT(__n < this->size())
164 size_t size() const { return this->_M_size; } function in class:valarray
180 valarray<_Tp> __tmp(this->size(), _NoInit());
181 for (size_t __i = 0; __i < this->size(); ++__i)
187 valarray<_Tp> __tmp(this->size(), _NoInit())
[all...] |
| /hardware/ti/wlan/wl1271/platforms/os/linux/src/ |
| osmemapi.c | 66 __u32 size; member in struct:os_mem_block
84 Size - Specifies the size, in bytes, to be allocated.
97 TI_UINT32 Size
101 __u32 total_size = Size + sizeof(struct os_mem_block) + sizeof(__u32);
105 os_printf("MTT:%s:%d ::os_memoryAlloc(0x%p, %lu) : %lu\n",__FUNCTION__, __LINE__,OsContext,Size,total_size);
147 blk->size = Size;
161 Size - Length in bytes of each element
171 TI_UINT32 Size
[all...] |
| /system/wlan/ti/wilink_6_1/platforms/os/linux/src/ |
| osmemapi.c | 66 __u32 size; member in struct:os_mem_block
84 Size - Specifies the size, in bytes, to be allocated.
97 TI_UINT32 Size
101 __u32 total_size = Size + sizeof(struct os_mem_block) + sizeof(__u32);
104 os_printf("MTT:%s:%d ::os_memoryAlloc(0x%p, %lu) : %lu\n",__FUNCTION__, __LINE__,OsContext,Size,total_size);
147 blk->size = Size;
161 Size - Length in bytes of each element
171 TI_UINT32 Size
[all...] |
| /external/freetype/src/truetype/ |
| ttobjs.c | 382 /* SIZE FUNCTIONS */
397 /* size :: A handle to the size object. */
403 tt_size_run_fpgm( TT_Size size )
405 TT_Face face = (TT_Face)size->root.face;
411 if ( size->debug )
412 exec = size->context;
419 TT_Load_Context( exec, face, size );
467 TT_Save_Context( exec, size );
482 /* size :: A handle to the size object. *
544 TT_Size size = (TT_Size)ftsize; local
588 TT_Size size = (TT_Size)ftsize; local
737 TT_Size size = (TT_Size)ttsize; local
766 TT_Size size = (TT_Size)ttsize; local
[all...] |
| /external/skia/tests/ |
| PackBitsTest.cpp | 39 size_t size = 50; local
42 rand_fill(src, size);
44 size_t dstSize = SkPackBits::Pack16(src, size, dst);
45 size_t maxSize = SkPackBits::ComputeMaxSize16(size);
49 REPORTER_ASSERT(reporter, size == srcCount);
50 bool match = memcmp(src, src2, size * sizeof(uint16_t)) == 0;
92 for (size_t size = 1; size <= 512; size += 1) {
96 rand_fill(src, size);
[all...] |
| /sdk/files/ |
| devices.xml | 8 <d:screen-size>normal</d:screen-size>
16 <d:size>320</d:size>
17 <d:size>480</d:size>
39 <d:screen-size>normal</d:screen-size>
48 <d:size>320</d:size>
[all...] |
| /frameworks/base/libs/binder/ |
| MemoryHeapBase.cpp | 49 MemoryHeapBase::MemoryHeapBase(size_t size, uint32_t flags, char const * name)
54 size = ((size + pagesize-1) & ~(pagesize-1));
55 int fd = ashmem_create_region(name == NULL ? "MemoryHeapBase" : name, size);
58 if (mapfd(fd, size) == NO_ERROR) {
66 MemoryHeapBase::MemoryHeapBase(const char* device, size_t size, uint32_t flags)
78 size = ((size + pagesize-1) & ~(pagesize-1));
79 if (mapfd(fd, size) == NO_ERROR) {
85 MemoryHeapBase::MemoryHeapBase(int fd, size_t size, uint32_t flags, uint32_t offset
91 mapfd(dup(fd), size, offset); local
[all...] |
| /frameworks/base/docs/html/sdk/api_diff/7/changes/ |
| methods_index_additions.html | 47 <div id="indexTableCaption" style="background-color:#eee;padding:0 4px 0 4px;font-size:11px;margin-bottom:1em;">
51 <br><font size="+2">A</font>
52 <a href="#C"><font size="-2">C</font></a>
53 <a href="#D"><font size="-2">D</font></a>
54 <a href="#F"><font size="-2">F</font></a>
55 <a href="#G"><font size="-2">G</font></a>
56 <a href="#I"><font size="-2">I</font></a>
57 <a href="#O"><font size="-2">O</font></a>
58 <a href="#R"><font size="-2">R</font></a>
59 <a href="#S"><font size="-2">S</font></a>
[all...] |
| methods_index_all.html | 47 <div id="indexTableCaption" style="background-color:#eee;padding:0 4px 0 4px;font-size:11px;margin-bottom:1em;">
51 <br><font size="+2">A</font>
52 <a href="#C"><font size="-2">C</font></a>
53 <a href="#D"><font size="-2">D</font></a>
54 <a href="#F"><font size="-2">F</font></a>
55 <a href="#G"><font size="-2">G</font></a>
56 <a href="#I"><font size="-2">I</font></a>
57 <a href="#O"><font size="-2">O</font></a>
58 <a href="#R"><font size="-2">R</font></a>
59 <a href="#S"><font size="-2">S</font></a>
[all...] |
| /frameworks/base/docs/html/sdk/api_diff/8/changes/ |
| fields_index_changes.html | 47 <div id="indexTableCaption" style="background-color:#eee;padding:0 4px 0 4px;font-size:11px;margin-bottom:1em;">
51 <br><font size="+2">A</font>
52 <a href="#D"><font size="-2">D</font></a>
53 <a href="#F"><font size="-2">F</font></a>
54 <a href="#J"><font size="-2">J</font></a>
55 <a href="#L"><font size="-2">L</font></a>
56 <a href="#M"><font size="-2">M</font></a>
57 <a href="#N"><font size="-2">N</font></a>
58 <a href="#R"><font size="-2">R</font></a>
59 <a href="#T"><font size="-2">T</font></a>
[all...] |
