| /external/llvm/lib/MC/ |
| MCELFStreamer.cpp | 409 SmallString<256> Code;
410 raw_svector_ostream VecOS(Code);
446 CEIF->getContents().append(Code.begin(), Code.end());
471 DF->getContents().append(Code.begin(), Code.end());
|
| MCObjectStreamer.cpp | 231 SmallString<128> Code;
232 raw_svector_ostream VecOS(Code);
236 IF->getContents().append(Code.begin(), Code.end());
|
| /external/llvm/tools/llvm-bcanalyzer/ |
| llvm-bcanalyzer.cpp | 57 cl::desc("Do not print per-code histogram"));
115 /// GetCodeName - Return a symbolic code name if known, otherwise return
304 /// CodeFreq - Keep track of the number of times we see each code.
418 unsigned Code = Stream.readRecord(Entry.ID, Record, &Blob);
420 // Increment the # occurrences of this code.
421 if (BlockStats.CodeFreq.size() <= Code)
422 BlockStats.CodeFreq.resize(Code+1);
423 BlockStats.CodeFreq[Code].NumInstances++;
424 BlockStats.CodeFreq[Code].TotalBits +=
427 BlockStats.CodeFreq[Code].NumAbbrev++
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherEmitter.cpp | 10 // This file contains code to generate C++ code for a matcher.
28 // To reduce generated source code size.
162 // We need to encode the child and the offset of the failure code before
303 // We need to encode the opcode and the offset of the case code before
304 // emitting the case code. Handle this by buffering the output into a
641 // Emit the predicate code corresponding to this pattern.
644 assert(!PredFn.isAlwaysTrue() && "No code in this predicate");
707 const std::string &Code = Entry.second;
720 OS << Code << "\n }\n"
[all...] |
| /external/lzma/C/ |
| MtCoder.h | 69 SRes (*Code)(void *p, unsigned index, Byte *dest, size_t *destSize,
|
| Ppmd7.h | 3 This code is based on PPMd var.H (2001): Dmitry Shkarin : Public domain */
5 /* This code supports virtual RangeDecoder and includes the implementation
111 UInt32 Code;
117 #define Ppmd7z_RangeDec_IsFinishedOK(p) ((p)->Code == 0)
|
| Xz.h | 138 CODER_STATUS_NOT_SPECIFIED, /* use main error code instead */
156 SRes (*Code)(void *p, Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen,
|
| /external/lzma/CPP/7zip/Compress/ |
| Bcj2Coder.cpp | 253 STDMETHODIMP CEncoder::Code(ISequentialInStream **inStreams, const UInt64 **inSizes, UInt32 numInStreams,
373 STDMETHODIMP CDecoder::Code(ISequentialInStream **inStreams, const UInt64 **inSizes, UInt32 numInStreams,
|
| /external/lzma/CS/7zip/Compress/LZMA/ |
| LzmaDecoder.cs | 230 public void Code(System.IO.Stream inStream, System.IO.Stream outStream,
|
| /external/lzma/Java/SevenZip/ |
| LzmaAlone.java | 223 encoder.Code(inStream, outStream, -1, -1, null);
242 if (!decoder.Code(inStream, outStream, outSize))
|
| LzmaBench.java | 345 encoder.Code(inStream, compressedStream, -1, -1, progressInfo);
367 if (!decoder.Code(inputCompressedStream, crcOutStream, outSize))
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| r500_fragprog_emit.c | 49 struct r500_fragment_program_code *code = &c->code->code.r500
78 struct r500_fragment_program_code * Code;
194 static void use_temporary(struct r500_fragment_program_code* code, unsigned int index)
196 if (index > code->max_temp_idx)
197 code->max_temp_idx = index;
200 static unsigned int use_source(struct r500_fragment_program_code* code, struct rc_pair_instruction_source src)
211 use_temporary(code, src.Index);
227 if ((code->inst[ip].inst0 & 0x3) != R500_INST_TYPE_TEX)
627 struct r500_fragment_program_code *code = &compiler->code->code.r500; local
[all...] |
| /external/chromium_org/third_party/skia/forth/ |
| Forth.cpp | 5 * Use of this source code is governed by a BSD-style license that can be
103 reading an initial 32bit value from the code stream:
113 11 -- switch (value >>> 2) for Code
137 enum Code {
143 static unsigned MakeCode(Code code) {
144 return (code << kCodeShift) | kCodeShift2_Bits;
202 // record the offset in the data part of the if-code
217 // record the offset in the data part of the code
268 // we assume ownership of code[]
[all...] |
| /external/clang/lib/ASTMatchers/Dynamic/ |
| Parser.cpp | 60 : Code(MatcherCode), StartOfLine(MatcherCode), Line(1), Error(Error),
67 : Code(MatcherCode), StartOfLine(MatcherCode), Line(1), Error(Error),
90 if (CodeCompletionLocation && CodeCompletionLocation <= Code.data()) {
97 if (Code.empty()) {
103 switch (Code[0]) {
106 Result.Text = Code.substr(0, 1);
107 Code = Code.drop_front();
111 Result.Text = Code.substr(0, 1);
112 Code = Code.drop_front()
[all...] |
| /external/llvm/lib/MC/MCParser/ |
| COFFAsmParser.cpp | 161 Code = 1 << 1,
203 if ((SecFlags & Code) == 0)
222 SecFlags |= Code;
243 if (SecFlags & Code)
687 bool Code = false;
693 if (CodeID != "code")
694 return Error(startLoc, "expected @code");
695 Code = true;
703 getStreamer().EmitWinCFIPushFrame(Code);
741 // violation so this validation code is disabled
[all...] |
| /external/llvm/lib/TableGen/ |
| TGLexer.h | 46 Bit, Bits, Class, Code, Dag, Def, Foreach, Defm, Field, In, Int, Let, List,
112 /// LexToken - Read the next token and return its code.
|
| /external/lzma/CPP/7zip/Archive/ |
| LzmaHandler.cpp | 79 HRESULT Code(const CHeader &header, ISequentialOutStream *outStream, ICompressProgressInfo *progress);
123 HRESULT CDecoder::Code(const CHeader &header, ISequentialOutStream *outStream,
389 result = decoder.Code(st, outStream, progress);
|
| /external/chromium_org/third_party/zlib/ |
| deflate.h | 20 the crc code when it is not needed. For shared libraries, gzip encoding
31 /* number of length codes, not counting the special END_BLOCK code */
37 /* number of Literal or Length codes, including the END_BLOCK code */
61 /* Data structure describing a single value and its code string. */
65 ush code; /* bit string */ member in union:ct_data_s::__anon101
74 #define Code fc.code
82 int max_code; /* largest code with non zero frequency */
234 * example a binary file with poorly compressible code followed by
244 /* Buffer for distances. To simplify the code, d_buf and l_buf hav
[all...] |
| /external/chromium_org/v8/tools/ |
| ll_prof.py | 8 # * Redistributions of source code must retain the above copyright
84 class Code(object):
85 """Code object."""
94 self.id = Code._id
95 Code._id += 1
106 self.codetype = Code.OPTIMIZED
108 self.codetype = Code.FULL_CODEGEN
110 self.codetype = Code.V8INTERNAL
112 self.codetype = Code.UNKNOWN
208 """Group of adjacent code objects.""
[all...] |
| /external/clang/lib/Serialization/ |
| GlobalModuleIndex.cpp | 575 unsigned Code = InStream.readRecord(Entry.ID, Record, &Blob);
578 if (State == ControlBlock && Code == IMPORTS) {
618 if (State == ASTBlock && Code == IDENTIFIER_TABLE && Record[0] > 0) {
|
| /external/clang/unittests/ASTMatchers/ |
| ASTMatchersTest.cpp | [all...] |
| /external/dexmaker/src/main/java/com/google/dexmaker/ |
| Code.java | 19 import com.android.dx.rop.code.BasicBlockList;
20 import com.android.dx.rop.code.Insn;
21 import com.android.dx.rop.code.PlainCstInsn;
22 import com.android.dx.rop.code.PlainInsn;
23 import com.android.dx.rop.code.RegisterSpecList;
24 import com.android.dx.rop.code.Rop;
25 import static com.android.dx.rop.code.Rop.BRANCH_GOTO;
26 import static com.android.dx.rop.code.Rop.BRANCH_NONE;
27 import static com.android.dx.rop.code.Rop.BRANCH_RETURN;
28 import com.android.dx.rop.code.Rops
[all...] |
| /external/llvm/include/llvm/Bitcode/ |
| BitstreamReader.h | 185 // CurCodeSize - This is the declared size of code values used for the current
285 unsigned Code = ReadCode();
286 if (Code == bitc::END_BLOCK) {
293 if (Code == bitc::ENTER_SUBBLOCK)
296 if (Code == bitc::DEFINE_ABBREV &&
304 return BitstreamEntry::getRecord(Code);
465 /// ReadSubBlockID - Having read the ENTER_SUBBLOCK code, read the BlockID for
476 // don't care what code widths are used inside of it.
|
| /external/lzma/Java/SevenZip/Compression/LZMA/ |
| Decoder.java | 201 public boolean Code(java.io.InputStream inStream, java.io.OutputStream outStream,
|
| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| deflate.h | 20 the crc code when it is not needed. For shared libraries, gzip encoding
31 /* number of length codes, not counting the special END_BLOCK code */
37 /* number of Literal or Length codes, including the END_BLOCK code */
64 /* Data structure describing a single value and its code string. */
68 ush code; /* bit string */ member in union:ct_data_s::__anon12281
77 #define Code fc.code
85 int max_code; /* largest code with non zero frequency */
232 * example a binary file with poorly compressible code followed by
242 /* Buffer for distances. To simplify the code, d_buf and l_buf hav
[all...] |
