| /external/deqp/modules/gles31/functional/ |
| es31fOpaqueTypeIndexingTests.cpp | 361 std::ostringstream global, code; local
393 code << resultPrefix << "" << lookupNdx << " = texture(" << samplersName << "[";
396 code << lookupIndices[lookupNdx];
398 code << "indexBase + " << (lookupIndices[lookupNdx]-1);
400 code << indicesPrefix << lookupNdx;
402 code << "], " << coordsName << ");\n";
407 spec->source = code.str();
722 std::ostringstream global, code; local
755 code << resultPrefix << readNdx << " = " << instanceName << "[";
758 code << readIndices[readNdx]
919 std::ostringstream global, code; local
[all...] |
| /external/elfutils/0.153/libdw/ |
| libdwP.h | 20 additional right to link the code of Red Hat elfutils with code licensed
23 distribution of source code with any binary distribution and to
24 distribute linked combinations of the two. Non-GPL Code permitted under
25 this exception must only link to the code of Red Hat elfutils through
27 found in the source code files (the "Approved Interfaces"). The files
28 of Non-GPL Code may instantiate templates or use macros or inline
35 License in all respects for all of the Red Hat elfutils code and other
36 code used in conjunction with Red Hat elfutils except the Non-GPL Code
215 unsigned int code; member in struct:Dwarf_Abbrev
[all...] |
| /external/freetype/src/truetype/ |
| ttinterp.h | 186 FT_Int curRange; /* current code range number */
187 FT_Byte* code; /* current code range */ member in struct:TT_ExecContextRec_
221 TT_CodeRangeTable codeRangeTable; /* table of valid code ranges */
378 /* FreeType error code. 0 means success. */
|
| /external/icu/icu4c/source/common/ |
| unames.cpp | 53 * and we don't want to make it less compact, so we changed the access code.
101 UChar32 code; member in struct:__anon1360
448 static uint16_t getExtName(uint32_t code, char *buffer, uint16_t bufferLength) {
449 const char *catname = getCharCatName(code);
460 for (cp = code, ndigits = 0; cp; ++ndigits, cp >>= 4)
464 for (cp = code, i = ndigits; (cp || i > 0) && bufferLength; cp >>= 4, bufferLength--) {
477 * Unicode code point "code".
478 * The return value is always a valid Group* that may contain "code"
479 * or else is the highest group before "code"
1079 UChar32 code; local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| coll.cpp | 384 int32_t code; local
387 code = u_getPropertyValueEnum(UCHAR_SCRIPT, scriptName);
389 code = getReorderCode(scriptName);
391 if (code < 0) {
395 codes[codesLength++] = code;
407 int32_t code = getReorderCode(value); local
408 if (code < 0) {
412 coll.setMaxVariable((UColReorderCode)code, errorCode);
|
| /external/icu/icu4c/source/layoutex/ |
| ParagraphLayout.cpp | 945 char code[8] = {0, 0, 0, 0, 0, 0, 0, 0}; local
949 uprv_strcat(code, language);
952 uprv_strcat(code, "_");
953 uprv_strcat(code, country);
957 if (uprv_strcmp(code, languageMap[i].localeCode) == 0) {
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| cldrtest.c | 505 /* TODO: Compare against parent's data too. This code can't handle fallbacks that some tools do already. */
1130 UScriptCode code[MAX_SCRIPTS_PER_LOCALE]; local
[all...] |
| /external/libpcap/ |
| gencode.h | 6 * modification, are permitted provided that: (1) source code distributions
8 * distributions including binary code include the above copyright notice and
33 * 1. Redistributions of source code must retain the above copyright
210 int code; member in struct:stmt
242 int code; member in struct:edge
|
| optimize.c | 6 * modification, are permitted provided that: (1) source code distributions
8 * distributions including binary code include the above copyright notice and
91 * Currently, the use-def code assumes only one definition per instruction.
104 * Rather than traverse the code array, marking each item, 'cur_mark' is
338 register int c = s->code;
383 if (s->code == NOP)
386 switch (BPF_CLASS(s->code)) {
400 return BPF_MISCOP(s->code) == BPF_TAX ? X_ATOM : A_ATOM;
424 if (s->s.code == NOP)
448 if (BPF_CLASS(b->s.code) == BPF_JMP)
509 int code; member in struct:valnode
1271 int code = ep->code; local
[all...] |
| /external/lzma/C/ |
| LzmaDec.c | 17 #define NORMALIZE if (range < kTopValue) { range <<= 8; code = (code << 8) | (*buf++); }
19 #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
21 #define UPDATE_1(p) range -= bound; code -= bound; *(p) = (CLzmaProb)(ttt - (ttt >> kNumMoveBits));
47 #define NORMALIZE_CHECK if (range < kTopValue) { if (buf >= bufLimit) return DUMMY_ERROR; range <<= 8; code = (code << 8) | (*buf++); }
49 #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
51 #define UPDATE_1_CHECK range -= bound; code -= bound;
151 UInt32 code = p->code;
local
490 UInt32 code = p->code; local
[all...] |
| /external/lzma/xz-embedded/ |
| xz_dec_lzma2.c | 97 uint32_t code; member in struct:rc_dec
255 * The order below is important on x86 to reduce code size and
441 rc->code = 0;
446 * Read the first five initial bytes into rc->code if they haven't been
455 rc->code = (rc->code << 8) + b->in[b->in_pos++];
474 return rc->code == 0;
482 rc->code = (rc->code << RC_SHIFT_BITS) + rc->in[rc->in_pos++];
491 * on x86). Using a non-splitted version results in nicer looking code too
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_code.h | 252 } code; member in struct:rX00_fragment_program_code
|
| /external/mesa3d/src/gallium/drivers/r300/ |
| r300_emit.c | 228 struct rc_constant_list *constants = &fs->shader->code.constants;
289 struct rc_constant_list *constants = &fs->shader->code.constants;
999 struct r300_vertex_program_code* code = &vs->code; local
[all...] |
| /external/mesa3d/src/mesa/main/ |
| texcompress_fxt1.c | 194 * and is vaguely based on Texus2 by 3dfx. Note that this code
1641 const GLubyte *code = (const GLubyte *)texture + local
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| SIPClientTransaction.java | 6 * Pursuant to title 15 Untied States Code Section 105, works of NIST
525 * JvB: this is now duplicate with code in the other processResponse
1378 int code = sipResponse.getStatusCode(); local
[all...] |
| /external/opencv/cv/src/ |
| cvcontours.cpp | 19 // * Redistribution's of source code must retain the above copyright notice,
88 int code; local
103 code = *ptr++;
112 reader->code = (schar)code;
113 assert( (code & ~7) == 0 );
114 reader->pt.x = pt.x + icvCodeDeltas[code].x;
115 reader->pt.y = pt.y + icvCodeDeltas[code].y;
[all...] |
| /external/openssl/crypto/ |
| crypto.h | 9 * 1. Redistributions of source code must retain the above copyright
64 * apply to all code found in this distribution, be it the RC4, RSA,
65 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
70 * the code are not to be removed.
79 * 1. Redistributions of source code must retain the copyright
90 * 4. If you include any Windows specific code (or a derivative thereof) from
91 * the apps directory (application code) you must include an acknowledgement:
107 * derivative of this code cannot be changed. i.e. this code cannot simply b
173 int code; member in struct:openssl_item_st
[all...] |
| /external/openssl/include/openssl/ |
| crypto.h | 9 * 1. Redistributions of source code must retain the above copyright
64 * apply to all code found in this distribution, be it the RC4, RSA,
65 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
70 * the code are not to be removed.
79 * 1. Redistributions of source code must retain the copyright
90 * 4. If you include any Windows specific code (or a derivative thereof) from
91 * the apps directory (application code) you must include an acknowledgement:
107 * derivative of this code cannot be changed. i.e. this code cannot simply b
173 int code; member in struct:openssl_item_st
[all...] |
| /dalvik/dx/etc/ |
| jasmin.jar | |
| /art/compiler/dex/quick/arm/ |
| int_arm.cc | 48 ArmConditionCode code = ArmConditionEncoding(ccode); local
49 int cond_bit = code & 1;
68 return NewLIR2(kThumb2It, code, mask);
76 ArmConditionCode code = static_cast<ArmConditionCode>(it->operands[0]); local
77 int cond_bit = code & 1;
206 void ArmMir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
213 if ((true_val == 0 && code == kCondEq) ||
214 (false_val == 0 && code == kCondNe)) {
218 LoadConstant(rs_dest, code == kCondEq ? false_val : true_val);
224 LIR* it = OpIT(code, "E"); // if-convert the tes
[all...] |
| /art/compiler/dex/quick/arm64/ |
| int_arm64.cc | 63 void Arm64Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
101 ArmConditionCode code = ArmConditionEncoding(ccode); local
172 code);
175 void Arm64Mir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
180 GenSelect(true_val, false_val, code, rs_dest, dest_reg_class);
403 bool Arm64Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
447 bool Arm64Mir2Lir::SmallLiteralDivRem64(Instruction::Code dalvik_opcode, bool is_div,
514 bool Arm64Mir2Lir::HandleEasyDivRem(Instruction::Code dalvik_opcode, bool is_div,
521 bool Arm64Mir2Lir::HandleEasyDivRem64(Instruction::Code dalvik_opcode, bool is_div,
[all...] |
| /art/oatdump/ |
| oatdump.cc | 192 DUMP_OAT_HEADER_OFFSET("INTERPRETER TO COMPILED CODE BRIDGE",
303 // We don't know the length of the code for each method, but we need to know where to stop
304 // when disassembling. What we do know is that a region of code will be followed by some other
306 // of a piece of code by using upper_bound to find the start of the next region.
340 // If the last thing in the file is code for a method, there won't be an offset for the "next"
341 // thing. Instead of having a special case in the upper_bound code, let's just add an entry
461 *indent1_os << "DEX CODE:\n";
495 "code offset 0x%08x is past end of file 0x%08zx.\n",
584 *indent1_os << "CODE: ";
588 "code size offset 0x%08x is past end of file 0x%08zx."
592 const void* code = oat_method.GetQuickCode(); local
[all...] |
| /art/runtime/entrypoints/quick/ |
| quick_trampoline_entrypoints.cc | 430 // allows to use the QuickArgumentVisitor constants without moving all the code in its own module.
512 // Push a transition back into managed code onto the linked list in thread.
650 // All naked Object*s should now be in jobjects, so its safe to go into the main invoke code
698 // Lazily resolve a method for quick. Called by stub code.
719 const DexFile::CodeItem* code; local
721 code = caller->GetCodeItem();
722 CHECK_LT(dex_pc, code->insns_size_in_code_units_);
723 const Instruction* instr = Instruction::At(&code->insns_[dex_pc]);
724 Instruction::Code instr_code = instr->Opcode();
794 const void* code = NULL; local
1804 const void* code = method->GetEntryPointFromQuickCompiledCode(); local
1908 const DexFile::CodeItem* code = caller_method->GetCodeItem(); local
1943 const void* code = method->GetEntryPointFromQuickCompiledCode(); local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| Dops.java | 17 package com.android.dexgen.dex.code;
19 import com.android.dexgen.dex.code.form.Form10t;
20 import com.android.dexgen.dex.code.form.Form10x;
21 import com.android.dexgen.dex.code.form.Form11n;
22 import com.android.dexgen.dex.code.form.Form11x;
23 import com.android.dexgen.dex.code.form.Form12x;
24 import com.android.dexgen.dex.code.form.Form20t;
25 import com.android.dexgen.dex.code.form.Form21c;
26 import com.android.dexgen.dex.code.form.Form21h;
27 import com.android.dexgen.dex.code.form.Form21s
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 17 package com.android.dx.cf.code;
20 import com.android.dx.rop.code.AccessFlags;
21 import com.android.dx.rop.code.BasicBlock;
22 import com.android.dx.rop.code.BasicBlockList;
23 import com.android.dx.rop.code.Insn;
24 import com.android.dx.rop.code.InsnList;
25 import com.android.dx.rop.code.PlainCstInsn;
26 import com.android.dx.rop.code.PlainInsn;
27 import com.android.dx.rop.code.RegisterSpec;
28 import com.android.dx.rop.code.RegisterSpecList
[all...] |
