/external/valgrind/main/coregrind/m_gdbserver/ |
H A D | valgrind-low-ppc64.c | 177 transfer_direction dir, int size, Bool *mod) 189 case 0: VG_(transfer) (&ppc64->guest_GPR0, buf, dir, size, mod); break; 190 case 1: VG_(transfer) (&ppc64->guest_GPR1, buf, dir, size, mod); break; 191 case 2: VG_(transfer) (&ppc64->guest_GPR2, buf, dir, size, mod); break; 192 case 3: VG_(transfer) (&ppc64->guest_GPR3, buf, dir, size, mod); break; 193 case 4: VG_(transfer) (&ppc64->guest_GPR4, buf, dir, size, mod); break; 194 case 5: VG_(transfer) (&ppc64->guest_GPR5, buf, dir, size, mod); break; 195 case 6: VG_(transfer) (&ppc64->guest_GPR6, buf, dir, size, mod); break; 196 case 7: VG_(transfer) (&ppc64->guest_GPR7, buf, dir, size, mod); break; 197 case 8: VG_(transfer) (&ppc64->guest_GPR8, buf, dir, size, mo 176 transfer_register(ThreadId tid, int abs_regno, void * buf, transfer_direction dir, int size, Bool *mod) argument [all...] |
H A D | valgrind-low-arm.c | 147 Char fnname[200]; // ??? max size 181 transfer_direction dir, int size, Bool *mod) 193 case 0: VG_(transfer) (&arm->guest_R0, buf, dir, size, mod); break; 194 case 1: VG_(transfer) (&arm->guest_R1, buf, dir, size, mod); break; 195 case 2: VG_(transfer) (&arm->guest_R2, buf, dir, size, mod); break; 196 case 3: VG_(transfer) (&arm->guest_R3, buf, dir, size, mod); break; 197 case 4: VG_(transfer) (&arm->guest_R4, buf, dir, size, mod); break; 198 case 5: VG_(transfer) (&arm->guest_R5, buf, dir, size, mod); break; 199 case 6: VG_(transfer) (&arm->guest_R6, buf, dir, size, mod); break; 200 case 7: VG_(transfer) (&arm->guest_R7, buf, dir, size, mo 180 transfer_register(ThreadId tid, int abs_regno, void * buf, transfer_direction dir, int size, Bool *mod) argument [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_map.cpp | 16 int size = m.size(); local 19 Scalar* array1 = ei_aligned_new<Scalar>(size); 20 Scalar* array2 = ei_aligned_new<Scalar>(size); 21 Scalar* array3 = new Scalar[size+1]; 24 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size); 25 Map<VectorType>(array2, size) = Map<VectorType>(array1, size); 26 Map<VectorType>(array3unaligned, size) 42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local 70 int size = m.size(); local [all...] |
H A D | eigen2_mixingtypes.cpp | 22 template<int SizeAtCompileType> void mixingtypes(int size = SizeAtCompileType) 33 Mat_f mf(size,size); 34 Mat_d md(size,size); 35 Mat_cf mcf(size,size); 36 Mat_cd mcd(size,size); 37 Vec_f vf(size, [all...] |
/external/webkit/Source/WebKit2/UIProcess/ |
H A D | WebBackForwardList.cpp | 42 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size()); 52 size_t size = m_entries.size(); local 53 for (size_t i = 0; i < size; ++i) 62 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size()); 72 removedItems.reserveCapacity(m_entries.size() - targetSize); 73 while (m_entries.size() > targetSize) { 83 if (m_entries.size() == m_capacity && (m_current != 0 || m_capacity == 1)) { 97 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size()); 102 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size()); 179 unsigned size = std::min(backListSize, limit); local 197 unsigned size = std::min(static_cast<unsigned>(forwardListCount()), limit); local [all...] |
/external/guava/guava/src/com/google/common/base/ |
H A D | Preconditions.java | 268 * list or string of size {@code size}. An element index may range from zero, 269 * inclusive, to {@code size}, exclusive. 273 * @param size the size of that array, list or string 276 * less than {@code size} 277 * @throws IllegalArgumentException if {@code size} is negative 279 public static int checkElementIndex(int index, int size) { argument 280 return checkElementIndex(index, size, "index"); 285 * list or string of size { 297 checkElementIndex( int index, int size, @Nullable String desc) argument 306 badElementIndex(int index, int size, String desc) argument 329 checkPositionIndex(int index, int size) argument 347 checkPositionIndex( int index, int size, @Nullable String desc) argument 356 badPositionIndex(int index, int size, String desc) argument 381 checkPositionIndexes(int start, int end, int size) argument 388 badPositionIndexes(int start, int end, int size) argument [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | RegularImmutableList.java | 35 private final transient int size; field in class:RegularImmutableList 38 RegularImmutableList(Object[] array, int offset, int size) { argument 40 this.size = size; 49 public int size() { method in class:RegularImmutableList 50 return size; 58 return offset != 0 || size != array.length; 68 return (UnmodifiableIterator<E>) Iterators.forArray(array, offset, size); 72 Object[] newArray = new Object[size()]; 73 System.arraycopy(array, offset, newArray, 0, size); [all...] |
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
H A D | RawHeightMap.java | 75 * @param size
76 * the size of the RAW (must be square).
78 * if the filename is null or not RAW, and if the size is 0 or
81 public RawHeightMap(String filename, int size) throws Exception {
argument 82 this(filename, size, FORMAT_8BIT, false);
87 this.size = (int) FastMath.sqrt(heightData.length);
91 public RawHeightMap(String filename, int size, int format, boolean swapxy) throws Exception {
argument 92 // varify that filename and size are valid.
93 if (null == filename || size <= 0) {
95 + "size (> 104 RawHeightMap(InputStream stream, int size, int format, boolean swapxy) argument 108 RawHeightMap(URL resource, int size, int format, boolean swapxy) argument 123 setup(InputStream stream, int size, int format, boolean swapxy) argument [all...] |
H A D | HillHeightMap.java | 39 * Algorithm. Terrain is generatd by growing hills of random size and height at
50 private float minRadius; // the minimum size of a hill radius
51 private float maxRadius; // the maximum size of a hill radius
58 * @param size
59 * size the size of the terrain to be generated
70 * if size of the terrain is not greater that zero, or number of
73 public HillHeightMap(int size, int iterations, float minRadius,
argument 75 if (size <= 0 || iterations <= 0 || minRadius <= 0 || maxRadius <= 0
78 "Either size o 111 HillHeightMap(int size, int iterations, float minRadius, float maxRadius) argument [all...] |
H A D | MidpointDisplacementHeightMap.java | 64 * @param size
65 * The size of the heightmap, must be 2^N+1
75 * @throw JMException if size is not a power of two plus one.
77 public MidpointDisplacementHeightMap(int size, float range, float persistence, long seed) throws Exception {
argument 78 if (size < 0 || !FastMath.isPowerOfTwo(size - 1)) {
79 throw new JMException("The size is negative or not of the form 2^N +1"
82 this.size = size;
97 * @param size
108 MidpointDisplacementHeightMap(int size, float range, float persistence) argument [all...] |
/external/webkit/Source/WebKit2/Shared/ |
H A D | ShareableBitmap.cpp | 60 PassRefPtr<ShareableBitmap> ShareableBitmap::create(const IntSize& size, Flags flags) argument 62 size_t numBytes = numBytesForSize(size); 68 return adoptRef(new ShareableBitmap(size, flags, data)); 71 PassRefPtr<ShareableBitmap> ShareableBitmap::createShareable(const IntSize& size, Flags flags) argument 73 size_t numBytes = numBytesForSize(size); 79 return adoptRef(new ShareableBitmap(size, flags, sharedMemory)); 82 PassRefPtr<ShareableBitmap> ShareableBitmap::create(const IntSize& size, Flags flags, PassRefPtr<SharedMemory> sharedMemory) argument 86 size_t numBytes = numBytesForSize(size); 87 ASSERT_UNUSED(numBytes, sharedMemory->size() >= numBytes); 89 return adoptRef(new ShareableBitmap(size, flag 113 ShareableBitmap(const IntSize& size, Flags flags, void* data) argument 120 ShareableBitmap(const IntSize& size, Flags flags, PassRefPtr<SharedMemory> sharedMemory) argument 134 resize(const IntSize& size) argument [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | Memory.h | 15 inline void* ei_aligned_malloc(size_t size) { return internal::aligned_malloc(size); } argument 18 inline void* ei_handmade_aligned_malloc(size_t size) { return internal::handmade_aligned_malloc(size); } argument 21 template<bool Align> inline void* ei_conditional_aligned_malloc(size_t size) argument 23 return internal::conditional_aligned_malloc<Align>(size); 34 template<typename T> inline T* ei_aligned_new(size_t size) argument 36 return internal::aligned_new<T>(size); 38 template<typename T> inline void ei_aligned_delete(T *ptr, size_t size) argument 40 return internal::aligned_delete(ptr, size); [all...] |
H A D | LeastSquares.h | 67 This vector must be of the same type and size as the 92 const int size = points[0]->size(); local 93 result->resize(size); 94 HyperplaneType h(size); 98 for(int i = funcOfOthers; i < size; i++) 116 * Thus, the vector \a retCoefficients has size \f$n+1\f$, which is another 139 int size = points[0]->size(); local 140 ei_assert(size [all...] |
/external/qemu/elff/ |
H A D | elf_alloc.cc | 34 void* ElfAllocator::alloc(size_t size) {
argument 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) {
argument 61 return elf->allocator()->alloc(size);
[all...] |
/external/regex-re2/util/ |
H A D | arena.h | 48 void* GetMemoryFallback(const size_t size, const int align); 51 void* GetMemory(const size_t size, const int align) { argument 52 if ( size > 0 && size < remaining_ && align == 1 ) { // common case 54 freestart_ += size; 55 remaining_ -= size; 58 return GetMemoryFallback(size, align); 64 size_t size; member in struct:re2::UnsafeArena::AllocatedBlock 96 inline void* operator new(size_t size, argument 99 return reinterpret_cast<char*>(arena->GetMemory(size, [all...] |
/external/v8/test/mjsunit/ |
H A D | big-object-literal.js | 31 function testLiteral(size, array_in_middle) { 32 print(size); 39 for (var i = 0; i < size; i++) { 45 for (var i = 0; i < size; i++) { 47 if (i < size - 1) { 60 for (var i = 0; i < size; i++) { 73 for (var i = 0; i < size; i++) { 95 function testLiteralAndCatch(size) { 98 testLiteral(size, false); 103 testLiteral(size, tru [all...] |
/external/webkit/Source/WebCore/platform/text/mac/ |
H A D | StringMac.mm | 32 CFIndex size = CFStringGetLength(reinterpret_cast<CFStringRef>(str)); 33 if (size == 0) 36 Vector<UChar, 1024> buffer(size); 37 CFStringGetCharacters(reinterpret_cast<CFStringRef>(str), CFRangeMake(0, size), buffer.data()); 38 m_impl = StringImpl::create(buffer.data(), size);
|
/external/skia/legacy/src/core/ |
H A D | SkStream.cpp | 30 size_t SkStream::skip(size_t size) argument 32 /* Check for size == 0, and just return 0. If we passed that 34 size of the stream. 36 return size ? this->read(NULL, size) : 0; 110 return this->write(tmp.c_str(), tmp.size()); 117 return this->write(tmp.c_str(), tmp.size()); 124 return this->write(tmp.c_str(), tmp.size()); 131 return this->write(tmp.c_str(), tmp.size()); 192 this->write(data->data(), data->size()); 240 read(void* buffer, size_t size) argument 254 newFromParams(const void* src, size_t size, bool copyData) argument 267 SkMemoryStream(size_t size) argument 272 SkMemoryStream(const void* src, size_t size, bool copyData) argument 281 setMemoryOwned(const void* src, size_t size) argument 287 setMemory(const void* src, size_t size, bool copyData) argument 313 read(void* buffer, size_t size) argument 412 read(void* buffer, size_t size) argument 515 write(const void* buffer, size_t size) argument 538 SkMemoryWStream(void* buffer, size_t size) argument 543 write(const void* buffer, size_t size) argument 569 init(size_t size) argument 576 append(const void* data, size_t size) argument 617 size_t size; local 652 size_t size = block->written(); local 673 size_t size = block->written(); local 696 size_t size = block->written(); local 740 write(const void* buffer, size_t size) argument [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | vmbuf.c | 53 vmalloc(size) 54 size_t size; 61 var->l = size; 62 if (size == 0) { 65 var->v = (caddr_t)racoon_calloc(1, size); 76 vrealloc(ptr, size) 78 size_t size; 85 return vmalloc(size); /* zero-fill it? */ 88 if ((v = (caddr_t)racoon_realloc(ptr->v, size)) == NULL) { 93 if ( size > pt [all...] |
/external/open-vcdiff/src/ |
H A D | jsonwriter.cc | 38 out->append(output_.data(), output_.size()); 50 size_t size, 52 for (size_t i = 0; i < size; ++i) { 75 void JSONCodeTableWriter::Add(const char* data, size_t size) { argument 77 JSONEscape(data, size, &output_); 79 target_length_ += size; 82 void JSONCodeTableWriter::Copy(int32_t offset, size_t size) { argument 84 copy_code << offset << "," << size << ","; local 86 target_length_ += size; 89 void JSONCodeTableWriter::Run(size_t size, unsigne argument 49 JSONEscape(const char* data, size_t size, string* out) argument [all...] |
H A D | encodetable.cc | 151 // instructions_and_sizes_, followed by a representation of its size 152 // if the opcode does not implicitly give the instruction size. 155 // of which contains the opcode 0x02 (ADD size 1). Because that was the 157 // EncodeInstruction is then called with inst = VCD_COPY, size = 4, mode = 0. 159 // opcode 0xA3 (ADD size 1 + COPY size 4 mode 0). 162 // have implicit sizes, meaning that the size of the instruction will not 166 // double-instruction opcode (say, COPY size 0 mode 0 + ADD size 0) 167 // followed by the size o 172 EncodeInstruction(VCDiffInstructionType inst, size_t size, unsigned char mode) argument 242 Add(const char* data, size_t size) argument 248 Copy(int32_t offset, size_t size) argument 273 Run(size_t size, unsigned char byte) argument 279 CalculateLengthOfSizeAsVarint(size_t size) argument 283 AppendSizeToString(size_t size, string* out) argument 287 AppendSizeToOutputString( size_t size, OutputStringInterface* out) argument [all...] |
/external/webkit/Source/WebCore/css/ |
H A D | CSSValueList.cpp | 39 size_t size = list->size(); local 40 for (unsigned i = 0; i < size; ++i) 51 if (index >= m_values.size()) 76 for (size_t index = 0; index < m_values.size(); index++) { 90 for (size_t index = 0; index < m_values.size(); index++) { 100 for (size_t index = 0; index < m_values.size(); index++) 109 unsigned size = m_values.size(); local 110 for (unsigned i = 0; i < size; 125 size_t size = m_values.size(); local [all...] |
/external/libvpx/libvpx/vpx_mem/ |
H A D | vpx_mem.h | 56 vpx_mem_set_heap_size(size_t size) 57 size - size in bytes for the memory manager to allocate for its heap 58 Sets the memory manager's initial heap size 65 int vpx_mem_set_heap_size(size_t size); 67 void *vpx_memalign(size_t align, size_t size); 68 void *vpx_malloc(size_t size); 69 void *vpx_calloc(size_t num, size_t size); 70 void *vpx_realloc(void *memblk, size_t size); 78 void *vpx_mem_alloc(int id, size_t size, size_ [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | Bitmap.h | 29 template<size_t size> 50 static const WordType words = (size + wordSize - 1) / wordSize; 53 // version of the correct size when doing the calculations because if 62 template<size_t size> 63 inline Bitmap<size>::Bitmap() 68 template<size_t size> 69 inline bool Bitmap<size>::get(size_t n) const 74 template<size_t size> 75 inline void Bitmap<size>::set(size_t n) 80 template<size_t size> [all...] |
/external/stlport/test/unit/ |
H A D | copy_test.cpp | 52 const size_t size = sizeof(a) / sizeof(a[0]); local 53 volatile int va[size]; 54 copy(a, a + size, va); 55 for (size_t i = 0; i != size; ++i) { 62 const size_t size = sizeof(a) / sizeof(a[0]); local 63 volatile int va[size]; 64 copy(a, a + size, va); 65 for (size_t i = 0; i != size; ++i) { 74 const size_t size = sizeof(a) / sizeof(a[0]); 75 const volatile int va[size] [all...] |