| /frameworks/base/core/java/android/hardware/camera2/ |
| Size.java | 23 public final class Size {
25 * Create a new immutable Size instance
27 * @param width The width to store in the Size instance
28 * @param height The height to store in the Size instance
30 public Size(int width, int height) {
51 if (obj instanceof Size) {
52 Size other = (Size) obj;
|
| /frameworks/base/media/mca/filterfw/native/core/ |
| native_frame.h | 30 NativeFrame(int size);
34 // Set the frame data and size in bytes. The NativeFrame object takes ownership of the data.
36 bool SetData(uint8_t* data, int size);
38 // Write the specified data of the given size to the frame at the specified offset. The
40 bool WriteData(const uint8_t* data, int offset, int size);
52 // Resize the frame. You can only resize to a size that fits within the frame's capacity.
56 // Returns the size of the frame in bytes.
57 int Size() {
73 // Size of data buffer in bytes.
|
| vertex_frame.cpp | 32 VertexFrame::VertexFrame(int size)
34 size_(size) {
46 bool VertexFrame::WriteData(const uint8_t* data, int size) {
59 if (first_upload && size == size_)
60 glBufferData(GL_ARRAY_BUFFER, size, data, GL_STATIC_DRAW);
61 else if (!first_upload && size <= size_)
62 glBufferSubData(GL_ARRAY_BUFFER, 0, size, data);
65 "inside the vertex frame (%d bytes)!", size, size_);
73 // Subsequent uploads are now bound to the size given here
74 size_ = size;
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| ReaderWriter_2_9.h | 107 /// uint32_t BitcodeSize; // Size of traditional bitcode file.
117 KnownHeaderSize = 4*4, // Size of header we read.
119 SizeField = 3*4 // Offset in bytes to Size field.
129 unsigned Size = ( BufPtr[SizeField ] |
134 // Verify that Offset+Size fits in the file.
135 if (Offset+Size > unsigned(BufEnd-BufPtr))
138 BufEnd = BufPtr+Size;
|
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| ReaderWriter_2_9_func.h | 107 /// uint32_t BitcodeSize; // Size of traditional bitcode file.
117 KnownHeaderSize = 4*4, // Size of header we read.
119 SizeField = 3*4 // Offset in bytes to Size field.
129 unsigned Size = ( BufPtr[SizeField ] |
134 // Verify that Offset+Size fits in the file.
135 if (Offset+Size > unsigned(BufEnd-BufPtr))
138 BufEnd = BufPtr+Size;
|
| /frameworks/compile/slang/BitWriter_3_2/ |
| ReaderWriter_3_2.h | 107 /// uint32_t BitcodeSize; // Size of traditional bitcode file.
117 KnownHeaderSize = 4*4, // Size of header we read.
119 SizeField = 3*4 // Offset in bytes to Size field.
129 unsigned Size = ( BufPtr[SizeField ] |
134 // Verify that Offset+Size fits in the file.
135 if (Offset+Size > unsigned(BufEnd-BufPtr))
138 BufEnd = BufPtr+Size;
|
| /external/ceres-solver/examples/ |
| fields_of_experts.h | 93 // Creates an empty object with size() == 0.
96 // sets size() == 0.
99 // Side length of a square filter in this FoE. They are all of the same size.
100 int Size() const {
|
| /external/chromium/net/disk_cache/ |
| bitmap.h | 24 // bits in the bitmap, and |num_words| is the size of |map| in 32-bit words.
30 // If |num_bits| < Size(), the extra bits will be discarded.
31 // If |num_bits| > Size(), the extra bits will be filled with zeros if
37 int Size() const { return num_bits_; }
63 // Directly sets the whole internal map. |size| is the number of 32-bit words
64 // to set from |map|. If |size| > array_size(), it ignores the end of |map|.
65 void SetMap(const uint32* map, int size);
74 // 0 <= |begin| <= |end| <= Size() is required.
80 // Requires |limit| <= Size().
106 // returns 0. Requires |limit| <= Size()
[all...] |
| /external/chromium_org/net/disk_cache/ |
| bitmap.h | 24 // bits in the bitmap, and |num_words| is the size of |map| in 32-bit words.
30 // If |num_bits| < Size(), the extra bits will be discarded.
31 // If |num_bits| > Size(), the extra bits will be filled with zeros if
37 int Size() const { return num_bits_; }
63 // Directly sets the whole internal map. |size| is the number of 32-bit words
64 // to set from |map|. If |size| > array_size(), it ignores the end of |map|.
65 void SetMap(const uint32* map, int size);
74 // 0 <= |begin| <= |end| <= Size() is required.
80 // Requires |limit| <= Size().
106 // returns 0. Requires |limit| <= Size()
[all...] |
| /external/chromium_org/net/quic/congestion_control/ |
| quic_max_sized_map.h | 33 size_t Size() const {
34 return table_.size();
38 if (Size() == MaxSize()) {
|
| /external/chromium_org/third_party/WebKit/public/platform/ |
| WebSize.h | 41 #include <ui/gfx/size.h>
84 WebSize(const gfx::Size& s)
96 WebSize& operator=(const gfx::Size& s)
110 operator gfx::Size() const
112 return gfx::Size(std::max(0, width), std::max(0, height));
|
| /external/chromium_org/third_party/angle/src/compiler/ |
| MapLongVariableNames.cpp | 13 ASSERT(name.size() > MAX_SHORTENED_IDENTIFIER_SIZE);
21 stream << name.substr(0, MAX_SHORTENED_IDENTIFIER_SIZE - stream.str().size());
73 size_t LongNameMap::Size() const
75 return mLongNameMap.size();
87 if (symbol->getSymbol().size() > MAX_SHORTENED_IDENTIFIER_SIZE) {
111 size_t id = mGlobalMap->Size();
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| atomicops.h | 40 // A single-producer, single-consumer, fixed-size queue.
136 // Clears the current items in the queue and sets the new (fixed) size. This
151 size_t Size() const { return pushed_count_ - popped_count_; }
153 // Returns the capacity of the queue (max size).
|
| /external/chromium_org/third_party/sfntly/cpp/src/sfntly/data/ |
| byte_array.cc | 30 int32_t ByteArray::Size() { return storage_length_; }
43 return Get(index, &((*b)[0]), 0, b->size());
59 if (index < 0 || index >= Size()) {
73 return Put(index, &((*b)[0]), 0, b->size());
81 if (index < 0 || index >= Size()) {
89 int32_t actual_length = std::min<int32_t>(length, Size() - index);
106 if (array->Size() < dst_offset + length) { // insufficient space
121 buffer_length = std::min<int32_t>(b.size(), remaining_length);
138 buffer_length = std::min<int32_t>(b.size(), length - index);
158 buffer_length = std::min<int32_t>(b.size(), length)
[all...] |
| /external/clang/include/clang/AST/ |
| CommentSema.h | 82 size_t Size = Source.size();
83 if (Size != 0) {
84 T *Mem = Allocator.Allocate<T>(Size);
86 return llvm::makeArrayRef(Mem, Size);
|
| /external/clang/lib/Rewrite/Core/ |
| RewriteRope.cpp | 83 /// Size - This is the number of bytes of file this node (including any
85 unsigned Size;
91 RopePieceBTreeNode(bool isLeaf) : Size(0), IsLeaf(isLeaf) {}
96 unsigned size() const { return Size; } function in class:__anon18620::RopePieceBTreeNode
162 Size = 0;
193 /// FullRecomputeSizeLocally - This method recomputes the 'Size' field by
194 /// summing the size of all RopePieces.
196 Size = 0;
198 Size += getPiece(i).size()
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_mutexset.h | 38 uptr Size() const;
59 uptr MutexSet::Size() const { return 0; }
|
| tsan_vector.h | 47 uptr Size() const {
62 EnsureSize(Size() + 1);
72 void Resize(uptr size) {
73 uptr old_size = Size();
74 EnsureSize(size);
75 if (old_size < size) {
76 for (uptr i = old_size; i < size; i++)
87 void EnsureSize(uptr size) {
88 if (size <= Size())
[all...] |
| /external/llvm/include/llvm/MC/MCParser/ |
| MCAsmParser.h | 39 unsigned Length, Size, Type;
45 Size = 0;
|
| /external/llvm/lib/CodeGen/ |
| CallingConvLower.cpp | 40 // by value. The size and alignment information of the argument is encoded in
47 unsigned Size = ArgFlags.getByValSize();
48 if (MinSize > (int)Size)
49 Size = MinSize;
53 TM.getTargetLowering()->HandleByVal(this, Size, Align);
54 unsigned Offset = AllocateStack(Size, Align);
69 unsigned NumArgs = Ins.size();
89 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
103 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
120 unsigned NumOps = Outs.size();
[all...] |
| /external/llvm/lib/IR/ |
| GCOV.cpp | 51 assert(i < Functions.size() && ".gcda data does not match .gcno data");
139 uint32_t Size = Buff.getCursor() + LineTableLength*4;
144 while (Buff.getCursor() != (Size - 4)) {
146 if (Buff.getCursor() == (Size - 4)) break;
269 for (unsigned i = 0, e = L.size(); i != e; ++i) {
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCallingConvLower.cpp | 38 // value. The size and alignment information of the argument is encoded in its
45 unsigned Size = ArgFlags.getByValSize();
46 if (MinSize > (int)Size)
47 Size = MinSize;
50 unsigned Offset = AllocateStack(Size, Align);
70 unsigned NumArgs = Ins.size();
116 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
136 unsigned NumOps = Outs.size();
164 unsigned NumOps = ArgVTs.size();
184 for (unsigned i = 0, e = Ins.size(); i != e; ++i)
[all...] |
| /external/llvm/lib/Target/SystemZ/MCTargetDesc/ |
| SystemZMCAsmBackend.cpp | 104 unsigned Size = (getFixupKindInfo(Kind).TargetSize + 7) / 8;
106 assert(Offset + Size <= DataSize && "Invalid fixup offset!");
108 // Big-endian insertion of Size bytes.
110 unsigned ShiftValue = (Size * 8) - 8;
111 for (unsigned I = 0; I != Size; ++I) {
|
| /external/llvm/utils/TableGen/ |
| CallingConvEmitter.cpp | 43 for (unsigned i = 0, e = CCs.size(); i != e; ++i) {
46 << std::string(CCs[i]->getName().size()+13, ' ')
48 << std::string(CCs[i]->getName().size()+13, ' ')
53 for (unsigned i = 0, e = CCs.size(); i != e; ++i)
64 << std::string(CC->getName().size()+13, ' ')
66 << std::string(CC->getName().size()+13, ' ')
173 int Size = Action->getValueAsInt("Size");
178 if (Size)
179 O << Size << ", ";
[all...] |
| /external/sfntly/cpp/src/sfntly/data/ |
| byte_array.cc | 30 int32_t ByteArray::Size() { return storage_length_; }
43 return Get(index, &((*b)[0]), 0, b->size());
59 if (index < 0 || index >= Size()) {
73 return Put(index, &((*b)[0]), 0, b->size());
81 if (index < 0 || index >= Size()) {
89 int32_t actual_length = std::min<int32_t>(length, Size() - index);
106 if (array->Size() < dst_offset + length) { // insufficient space
121 buffer_length = std::min<int32_t>(b.size(), remaining_length);
138 buffer_length = std::min<int32_t>(b.size(), length - index);
158 buffer_length = std::min<int32_t>(b.size(), length)
[all...] |
