/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/webkit/Source/WebCore/platform/graphics/gpu/ |
PODArena.h | 146 m_chunks.append(adoptPtr(new Chunk(m_allocator.get(), m_currentChunkSize))); 160 // Manages a chunk of memory and individual allocations out of it. 161 class Chunk { 162 WTF_MAKE_NONCOPYABLE(Chunk); 166 Chunk(Allocator* allocator, size_t size) 176 ~Chunk() 182 // Chunk could not satisfy the allocation. 205 Chunk* m_current; 207 Vector<OwnPtr<Chunk> > m_chunks;
|
/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/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;
|
/external/v8/src/ |
bignum.h | 97 typedef uint32_t Chunk; 100 static const int kChunkSize = sizeof(Chunk) * 8; 105 static const Chunk kBigitMask = (1 << kBigitSize) - 1; 125 Chunk BigitAt(int index) const; 128 Chunk bigits_buffer_[kBigitCapacity]; 131 Vector<Chunk> bigits_;
|
/frameworks/compile/mclinker/include/mcld/Support/ |
Allocators.h | 22 /** \class Chunk 23 * \brief Chunk is the basic unit of the storage of the LinearAllocator 28 class Chunk 33 Chunk() 49 Chunk* next; 55 class Chunk<DataType, 0> 61 Chunk() 69 ~Chunk() { 88 Chunk* next; 95 size_t Chunk<DataType, 0>::m_Size = 0 [all...] |
/external/llvm/lib/Target/ARM/ |
Thumb1RegisterInfo.cpp | 146 unsigned Chunk = ((1 << NumBits) - 1) * Scale; 149 unsigned ThisVal = (Bytes > Chunk) ? Chunk : Bytes; 154 Chunk = ((1 << NumBits) - 1) * Scale; 157 NumMIs += Bytes / Chunk; 158 if ((Bytes % Chunk) != 0) 238 unsigned Chunk = (1 << 3) - 1; 239 unsigned ThisVal = (Bytes > Chunk) ? Chunk : Bytes; 254 unsigned Chunk = ((1 << NumBits) - 1) * Scale [all...] |
/external/webkit/Source/WebCore/bindings/v8/ |
IntrusiveDOMWrapperMap.h | 47 m_chunks = new Chunk(m_chunks); 65 Chunk* toDelete = m_chunks; 79 Chunk* last = m_chunks; 81 Chunk* previous = last->m_previous; 100 for (Chunk* chunk = m_chunks->m_previous; chunk; chunk = chunk->m_previous) 101 visitEntries(store, chunk->m_entries, chunk->m_entries + CHUNK_SIZE, visitor) [all...] |
/frameworks/base/core/java/android/webkit/ |
ByteArrayBuilder.java | 34 private static final LinkedList<SoftReference<Chunk>> sPool = 35 new LinkedList<SoftReference<Chunk>>(); 37 private static final ReferenceQueue<Chunk> sQueue = 38 new ReferenceQueue<Chunk>(); 40 private LinkedList<Chunk> mChunks; 43 mChunks = new LinkedList<Chunk>(); 48 Chunk c = null; 69 * chunks. This returns the first chunk. Note: this pulls the 70 * chunk out of the queue. The caller must call Chunk.release() t [all...] |
/external/clang/lib/Sema/ |
CodeCompleteConsumer.cpp | 82 CodeCompletionString::Chunk::Chunk(ChunkKind Kind, const char *Text) 156 CodeCompletionString::Chunk 157 CodeCompletionString::Chunk::CreateText(const char *Text) { 158 return Chunk(CK_Text, Text); 161 CodeCompletionString::Chunk 162 CodeCompletionString::Chunk::CreateOptional(CodeCompletionString *Optional) { 163 Chunk Result; 169 CodeCompletionString::Chunk 170 CodeCompletionString::Chunk::CreatePlaceholder(const char *Placeholder) [all...] |
SemaTemplateVariadic.cpp | 744 const DeclaratorChunk &Chunk = D.getTypeObject(I); 745 switch (Chunk.Kind) { 758 llvm_unreachable("Could not have seen this kind of declarator chunk"); 761 if (Chunk.Mem.Scope().getScopeRep() && 762 Chunk.Mem.Scope().getScopeRep()->containsUnexpandedParameterPack())
|
SemaExprCXX.cpp | [all...] |
SemaType.cpp | 121 /// The index of the declarator chunk we're currently processing. 308 /// Given the index of a declarator chunk, check whether that chunk 352 llvm_unreachable("bad declarator chunk kind"); 358 llvm_unreachable("bad declarator chunk kind"); 380 DeclaratorChunk &chunk = declarator.getTypeObject(i-1); local 381 switch (chunk.Kind) { 390 if (!destChunk) destChunk = &chunk; 437 DeclaratorChunk &chunk = declarator.getTypeObject(i); local 438 switch (chunk.Kind) 496 DeclaratorChunk &chunk = declarator.getTypeObject(i-1); local 528 DeclaratorChunk &chunk = declarator.getTypeObject(i); local 1793 DeclaratorChunk &chunk = declarator.getTypeObject(chunkIndex); local 3034 DeclaratorChunk &chunk = D.getTypeObject(chunkIndex); local 3071 DeclaratorChunk &chunk = D.getTypeObject(i); local [all...] |
SemaDecl.cpp | [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...] |
/libcore/luni/src/main/java/java/util/jar/ |
Manifest.java | 65 static class Chunk { 69 Chunk(int start, int end) { 75 private HashMap<String, Chunk> chunks; 118 chunks = new HashMap<String, Chunk>(); 281 Chunk getChunk(String name) {
|
/frameworks/av/libvideoeditor/vss/3gpwriter/inc/ |
M4MP4W_Types.h | 195 M4OSA_UChar** Chunk; 237 M4OSA_UChar** Chunk;
|
/external/clang/include/clang/Sema/ |
CodeCompleteConsumer.h | 390 struct Chunk { 397 /// CK_Informative, or CK_Comma chunk. 398 /// The string is owned by the chunk and will be deallocated 399 /// (with delete[]) when the chunk is destroyed. 402 /// \brief The code completion string associated with a CK_Optional chunk. 403 /// The optional code completion string is owned by the chunk, and will 404 /// be deallocated (with delete) when the chunk is destroyed. 408 Chunk() : Kind(CK_Text), Text(0) { } 410 explicit Chunk(ChunkKind Kind, const char *Text = ""); 412 /// \brief Create a new text chunk [all...] |
/external/webp/src/demux/ |
demux.c | 31 size_t riff_end_; // riff chunk end location, can be > end_. 53 typedef struct Chunk { 55 struct Chunk* next_; 56 } Chunk; 68 Chunk* chunks_; // non-image chunks 124 // Return true if 'size' exceeds the end of the RIFF chunk. 170 // Secondary chunk parsing 172 static void AddChunk(WebPDemuxer* const dmux, Chunk* const chunk) { 173 Chunk** c = &dmux->chunks_ 376 Chunk* const chunk = (Chunk*)calloc(1, sizeof(*chunk)); local 891 const Chunk* const chunk = GetChunk(dmux, fourcc, chunk_num); local [all...] |
/external/clang/lib/Basic/ |
SourceManager.cpp | [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
AsmPrinter.cpp | [all...] |
/external/tinyxml2/ |
tinyxml2.h | 268 block->chunk[i].next = &block->chunk[i+1];
270 block->chunk[COUNT-1].next = 0;
271 root = block->chunk;
284 Chunk* chunk = (Chunk*)mem;
local 285 memset( chunk, 0xfe, sizeof(Chunk) );
286 chunk->next = root; 301 Chunk chunk[COUNT]; member in struct:tinyxml2::MemPoolT::Block [all...] |