| /external/chromium_org/content/browser/speech/ |
| chunked_byte_buffer.h | 18 // Models a chunk-oriented byte buffer. The term chunk is herein defined as an
27 // [----- CHUNK 1 -------] [--- CHUNK 2 ---] [------ CHUNK 3 ------]
42 // If enough data is available, reads and removes the first complete chunk
43 // from the buffer. Returns a NULL pointer if no complete chunk is available.
53 struct Chunk {
54 Chunk();
55 ~Chunk();
[all...] |
| chunked_byte_buffer.cc | 32 : partial_chunk_(new Chunk()),
82 partial_chunk_.reset(new Chunk());
91 partial_chunk_.reset(new Chunk());
109 scoped_ptr<Chunk> chunk(*chunks_.begin());
111 DCHECK_EQ(chunk->header.size(), kHeaderLength);
112 DCHECK_EQ(chunk->content->size(), chunk->ExpectedContentLength());
113 total_bytes_stored_ -= chunk->content->size();
115 return chunk->content.Pass()
[all...] |
| /libcore/dalvik/src/main/java/org/apache/harmony/dalvik/ddmc/ |
| Chunk.java | 22 * A chunk of DDM data. This is really just meant to hold a few pieces
28 public class Chunk {
33 public int type; // chunk type
34 public byte[] data; // chunk data
40 public Chunk() {}
45 public Chunk(int type, byte[] data, int offset, int length) {
53 * Construct from a ByteBuffer. The chunk is assumed to start at
56 public Chunk(int type, ByteBuffer buf) {
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| PODArena.h | 134 m_chunks.append(adoptPtr(new Chunk(m_allocator.get(), m_currentChunkSize)));
148 // Manages a chunk of memory and individual allocations out of it.
149 class Chunk FINAL {
150 WTF_MAKE_NONCOPYABLE(Chunk);
154 Chunk(Allocator* allocator, size_t size)
164 ~Chunk()
170 // Chunk could not satisfy the allocation.
193 Chunk* m_current;
195 Vector<OwnPtr<Chunk> > m_chunks;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64ExpandPseudoInsts.cpp | 63 /// \brief Helper function which extracts the specified 16-bit chunk from a
66 assert(ChunkIdx < 4 && "Out of range chunk index specified!");
71 /// \brief Helper function which replicates a 16-bit chunk within a 64-bit
74 assert((FromIdx < 4) && (ToIdx < 4) && "Out of range chunk index specified!");
77 // Replicate the source chunk to the destination position.
78 const uint64_t Chunk = getChunk(Imm, FromIdx) << ShiftAmt;
79 // Clear the destination chunk.
81 // Insert the replicated chunk.
82 return Imm | Chunk;
91 assert(ChunkIdx < 4 && "Out of range chunk index specified!")
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| chunk.py | 3 An IFF chunk (used in formats such as AIFF, TIFF, RMFF (RealMedia File
15 The ID is a 4-byte string which identifies the type of chunk.
18 gives the size of the whole chunk, including the 8-byte header.
21 usage of the Chunk class defined here is to instantiate an instance at
22 the start of each chunk and read from the instance until it reaches
30 chunk = Chunk(file)
33 chunktype = chunk.getname()
35 data = chunk.read(nbytes)
42 Extra methods are: skip() (called by close, skips to the end of the chunk),
[all...] |
| wave.py | 92 from chunk import Chunk
118 _fmt_chunk_read -- 1 iff the FMT chunk has been read
121 _data_chunk -- instantiation of a chunk class for the DATA chunk
128 self._file = Chunk(file, bigendian = 0)
138 chunk = Chunk(self._file, bigendian = 0)
141 chunkname = chunk.getname()
143 self._read_fmt_chunk(chunk)
[all...] |
| aifc.py | 23 A chunk consists of an identifier (4 bytes) followed by a size (4 bytes,
27 The following chunk types are recognized.
253 from chunk import Chunk
284 # _comm_chunk_read -- 1 iff the COMM chunk has been read
288 # _ssnd_chunk -- instantiation of a chunk class for the SSND chunk
298 chunk = Chunk(file)
299 if chunk.getname() != 'FORM'
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| chunk.py | 3 An IFF chunk (used in formats such as AIFF, TIFF, RMFF (RealMedia File
15 The ID is a 4-byte string which identifies the type of chunk.
18 gives the size of the whole chunk, including the 8-byte header.
21 usage of the Chunk class defined here is to instantiate an instance at
22 the start of each chunk and read from the instance until it reaches
30 chunk = Chunk(file)
33 chunktype = chunk.getname()
35 data = chunk.read(nbytes)
42 Extra methods are: skip() (called by close, skips to the end of the chunk),
[all...] |
| wave.py | 92 from chunk import Chunk
118 _fmt_chunk_read -- 1 iff the FMT chunk has been read
121 _data_chunk -- instantiation of a chunk class for the DATA chunk
128 self._file = Chunk(file, bigendian = 0)
138 chunk = Chunk(self._file, bigendian = 0)
141 chunkname = chunk.getname()
143 self._read_fmt_chunk(chunk)
[all...] |
| aifc.py | 23 A chunk consists of an identifier (4 bytes) followed by a size (4 bytes,
27 The following chunk types are recognized.
253 from chunk import Chunk
284 # _comm_chunk_read -- 1 iff the COMM chunk has been read
288 # _ssnd_chunk -- instantiation of a chunk class for the SSND chunk
298 chunk = Chunk(file)
299 if chunk.getname() != 'FORM'
[all...] |
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator.h | 85 // E F chunk
94 // [ 0 0 0 0 | z1 0 0 0 0] non chunk blocks
95 // [ 0 0 0 0 | 0 0 z3 z4 z5] non chunk blocks
126 // parameter block yi are known as a chunk, and the algorithm operates
127 // on one chunk at a time. The mathematics remains the same since the
129 // linear systems for each chunk. This can be seen by observing two
134 // 2. When E'F is computed, only the terms within a single chunk
241 // Chunk objects store combinatorial information needed to
242 // efficiently eliminate a whole chunk out of the least squares
243 // problem. Consider the first chunk in the example matrix above
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| bignum.h | 99 typedef uint32_t Chunk;
102 static const int kChunkSize = sizeof(Chunk) * 8;
107 static const Chunk kBigitMask = (1 << kBigitSize) - 1;
127 Chunk BigitAt(int index) const;
130 Chunk bigits_buffer_[kBigitCapacity];
133 Vector<Chunk> bigits_;
|
| /external/chromium_org/v8/src/ |
| bignum.h | 74 typedef uint32_t Chunk;
77 static const int kChunkSize = sizeof(Chunk) * 8;
82 static const Chunk kBigitMask = (1 << kBigitSize) - 1;
102 Chunk BigitAt(int index) const;
105 Chunk bigits_buffer_[kBigitCapacity];
108 Vector<Chunk> bigits_;
|
| /external/qemu/distrib/sdl-1.2.15/src/audio/ |
| SDL_wave.h | 44 /* Not saved in the chunk we read:
56 /* The general chunk found in the WAVE file */
57 typedef struct Chunk {
61 } Chunk;
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| Allocators.h | 19 /** \class Chunk
20 * \brief Chunk is the basic unit of the storage of the LinearAllocator
25 class Chunk
30 Chunk()
46 Chunk* next;
52 class Chunk<DataType, 0>
58 Chunk()
66 ~Chunk() {
85 Chunk* next;
92 size_t Chunk<DataType, 0>::m_Size = 0
[all...] |
| /external/llvm/lib/Target/ARM/ |
| Thumb1RegisterInfo.cpp | 144 unsigned Chunk = ((1 << NumBits) - 1) * Scale;
147 unsigned ThisVal = (Bytes > Chunk) ? Chunk : Bytes;
152 Chunk = ((1 << NumBits) - 1) * Scale;
155 NumMIs += Bytes / Chunk;
156 if ((Bytes % Chunk) != 0)
236 unsigned Chunk = (1 << 3) - 1;
237 unsigned ThisVal = (Bytes > Chunk) ? Chunk : Bytes;
252 unsigned Chunk = ((1 << NumBits) - 1) * Scale
[all...] |
| /external/valgrind/main/perf/ |
| many-loss-records.c | 42 struct Chunk {
43 struct Chunk* child;
47 struct Chunk** topblocks;
58 void free_chunks (struct Chunk ** mem)
70 void release (struct Chunk ** mem)
87 int sz = sizeof(struct Chunk*) + malloc_data;
92 struct Chunk *new = NULL; // shut gcc up
93 struct Chunk *prev = NULL;
206 topblocks = malloc(sizeof(struct Chunk*) * stacks * malloc_fan);
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
| parser.py | 277 # Opcodes that unconditionally end the code chunk.
283 # Opcodes that unconditionally begin a new code chunk. By starting new chunks
409 """Split the code object into a list of `Chunk` objects.
411 Each chunk is only entered at its first instruction, though there can
412 be many exits from a chunk.
414 Returns a list of `Chunk` objects.
420 chunk = None
436 # Maybe have to start a new chunk
438 # Start a new chunk for each source line number.
439 if chunk
[all...] |
| /external/clang/lib/Sema/ |
| CodeCompleteConsumer.cpp | 81 CodeCompletionString::Chunk::Chunk(ChunkKind Kind, const char *Text)
155 CodeCompletionString::Chunk
156 CodeCompletionString::Chunk::CreateText(const char *Text) {
157 return Chunk(CK_Text, Text);
160 CodeCompletionString::Chunk
161 CodeCompletionString::Chunk::CreateOptional(CodeCompletionString *Optional) {
162 Chunk Result;
168 CodeCompletionString::Chunk
169 CodeCompletionString::Chunk::CreatePlaceholder(const char *Placeholder)
[all...] |
| SemaTemplateVariadic.cpp | 738 const DeclaratorChunk &Chunk = D.getTypeObject(I);
739 switch (Chunk.Kind) {
752 llvm_unreachable("Could not have seen this kind of declarator chunk");
755 if (Chunk.Mem.Scope().getScopeRep() &&
756 Chunk.Mem.Scope().getScopeRep()->containsUnexpandedParameterPack())
[all...] |
| /frameworks/av/include/media/stagefright/ |
| MPEG4Writer.h | 112 struct Chunk {
118 Chunk(): mTrack(NULL), mTimeStampUs(0) {}
120 Chunk(Track *track, int64_t timeUs, List<MediaBuffer *> samples)
127 List<Chunk> mChunks; // Remaining chunks to be written
129 // Previous chunk timestamp that has been written
140 List<ChunkInfo> mChunkInfos; // Chunk infos
149 // Buffer a single chunk to be written out later.
150 void bufferChunk(const Chunk& chunk);
155 // Retrieve the proper chunk to write if there is on
[all...] |
| /frameworks/base/libs/hwui/ |
| DisplayList.h | 120 struct Chunk {
129 // whether children with non-zero Z in the chunk should be reordered
153 const Vector<Chunk>& getChunks() const {
181 Vector<Chunk> chunks;
|
| /libcore/luni/src/main/java/java/util/jar/ |
| Manifest.java | 47 static final class Chunk {
51 Chunk(int start, int end) {
57 private HashMap<String, Chunk> chunks;
104 chunks = new HashMap<String, Chunk>();
229 Chunk getChunk(String name) {
|
| /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
| rtcp_packet.h | 309 // chunk | SSRC/CSRC_1 |
314 // chunk | SSRC/CSRC_2 |
336 struct Chunk {
351 std::vector<Chunk> chunks_;
|
