HomeSort by relevance Sort by last modified time
    Searched defs:code (Results 576 - 600 of 3111) sorted by null

<<21222324252627282930>>

  /external/pdfium/xfa/src/fxbarcode/oned/
BC_OnedCodaBarWriter.cpp 2 // Use of this source code is governed by a BSD-style license that can be
5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
6 // Original code is licensed as follows:
186 int32_t code = 0; local
190 code = CodaBarR.CHARACTER_ENCODINGS[i];
200 if (((code >> (6 - bit)) & 1) == 0 || counter == m_iWideNarrRatio - 1) {
223 uint8_t* code,
227 CBC_OneDimWriter::RenderResult(encodedContents(contents), code, codeLength, local
  /external/ppp/pppd/
cbcp.c 10 * 1. Redistributions of source code must retain the above copyright
101 static void cbcp_send __P((cbcp_state *us, int code, u_char *buf, int len));
160 u_char code, id; local
173 GETCHAR(code, inp);
185 switch(code) {
233 int code, opt, id, len, olen, delay; local
239 GETCHAR(code, p);
245 if (code >= 1 && code <= sizeof(cbcp_codenames) / sizeof(char *))
246 printer(arg, " %s", cbcp_codenames[code-1])
    [all...]
fsm.c 10 * 1. Redistributions of source code must retain the above copyright
340 u_char code, id; local
344 * Parse header (code, id and length).
352 GETCHAR(code, inp);
372 * Action depends on code.
374 switch (code) {
385 fsm_rconfnakrej(f, code, id, inp, len);
402 || !(*f->callbacks->extcode)(f, code, id, inp, len) )
419 int code, reject_if_disagree; local
447 * to protocol-specific code for checking
684 u_char code, id; local
    [all...]
  /external/proguard/src/proguard/classfile/attribute/
CodeAttribute.java 29 * This Attribute represents a code attribute.
38 public byte[] code; field in class:CodeAttribute
60 byte[] code,
71 this.code = code;
120 Instruction instruction = InstructionFactory.create(code, offset);
136 Instruction instruction = InstructionFactory.create(code, offset);
  /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowUriMatcher.java 17 public int code = UriMatcher.NO_MATCH; field in class:ShadowUriMatcher.MatchNode
22 public MatchNode(int code) {
23 this.code = code;
29 public void __constructor__(int code) {
30 rootNode = new MatchNode(code);
34 public void addURI(String authority, String path, int code) {
37 authNode = new MatchNode(rootNode.code);
42 addNodes(authNode, Arrays.asList(segments), code);
51 return rootNode.code;
    [all...]
  /external/toybox/toys/pending/
getty.c 52 speed_t code; member in struct:speed_mapper
90 for (sp = speedtab; sp->speed; sp++) if (sp->speed == speed) return sp->code;
  /external/tpm2/
TpmFail.c 16 // command code values.
32 TPM_RC code; member in struct:__anon23336
39 UINT32 code; member in struct:__anon23337::__anon23338
124 header->code = ucode;
154 int line, int code
162 s_failCode = code;
163 // if asserts are enabled, then do an assert unless the failure mode code
168 // Jump to the failure mode code.
178 // This function is called by the interface code when the platform is in failure mode.
206 switch (header.code) {
    [all...]
  /external/v8/src/compiler/
live-range-separator.cc 2 // Use of this source code is governed by a BSD-style license that can be
63 const InstructionSequence *code = data->code(); local
72 code->GetInstructionBlock(interval->FirstGapIndex());
74 code->GetInstructionBlock(interval->LastGapIndex());
79 code->InstructionBlockAt(RpoNumber::FromInt(block_id));
114 if (!data()->code()->GetInstructionBlock(first_instr)->IsDeferred()) {
122 const InstructionSequence *code = data()->code(); local
138 code->InstructionBlockCount())
    [all...]
  /external/v8/src/debug/
debug-frames.cc 2 // Use of this source code is governed by a BSD-style license that can be
78 Code* code = frame_->LookupCode(); local
79 int offset = static_cast<int>(frame_->pc() - code->instruction_start());
80 return code->SourcePosition(offset);
  /external/v8/src/
disassembler.cc 2 // Use of this source code is governed by a BSD-style license that can be
7 #include "src/code-stubs.h"
24 explicit V8NameConverter(Code* code) : code_(code) {}
27 Code* code() const { return code_; } function in class:v8::internal::V8NameConverter
29 Code* code_;
46 // print as code offset, if it seems reasonable
58 // The V8NameConverter is used for well known code, so we can "safely
201 Code* code = Code::GetCodeFromTargetAddress(relocinfo.target_address()); local
    [all...]
fast-accessor-assembler.cc 2 // Use of this source code is governed by a BSD-style license that can be
8 #include "src/code-stub-assembler.h"
9 #include "src/code-stubs.h" // For CallApiCallbackStub.
23 Code::ComputeFlags(Code::STUB),
196 MaybeHandle<Code> FastAccessorAssembler::Build() {
198 Handle<Code> code = assembler_->GenerateCode(); local
199 state_ = !code.is_null() ? kBuilt : kError;
201 return code;
    [all...]
  /external/v8/src/regexp/ppc/
regexp-macro-assembler-ppc.cc 2 // Use of this source code is governed by a BSD-style license that can be
10 #include "src/code-stubs.h"
25 * - r26: Pointer to current code object (Code*) including heap object tag.
50 * - fp[-4] direct_call (if 1, direct call from JavaScript code,
77 * code and the remaining arguments are passed in registers, e.g. by calling the
78 * code entry as cast to a function with the signature:
90 * When calling as a non-direct call (i.e., from C++ code), the return address
91 * area is overwritten with the LR register by the RegExp code. When doing a
92 * direct call from generated code, the return address is placed there b
940 Handle<Code> code = isolate()->factory()->NewCode( member in namespace:v8::internal
    [all...]
  /external/v8/test/cctest/compiler/
function-tester.h 2 // Use of this source code is governed by a BSD-style license that can be
45 FunctionTester(Handle<Code> code, int param_count)
51 function->ReplaceCode(*code);
54 FunctionTester(const CallInterfaceDescriptor& descriptor, Handle<Code> code)
55 : FunctionTester(code, descriptor.GetParameterCount()) {}
227 Handle<Code> code = Pipeline::GenerateCodeForTesting(&info); local
228 CHECK(!code.is_null())
258 Handle<Code> code = Pipeline::GenerateCodeForTesting(&info, graph); local
    [all...]
test-code-assembler.cc 2 // Use of this source code is governed by a BSD-style license that can be
5 #include "src/compiler/code-assembler.h"
7 #include "test/cctest/compiler/code-assembler-tester.h"
43 Handle<Code> code = m.GenerateCode(); local
44 FunctionTester ft(descriptor, code);
55 Handle<Code> code = m.GenerateCode(); local
56 FunctionTester ft(descriptor, code);
67 Handle<Code> code = m.GenerateCode() local
80 Handle<Code> code = m.GenerateCode(); local
93 Handle<Code> code = m.GenerateCode(); local
107 Handle<Code> code = m.GenerateCode(); local
121 Handle<Code> code = m.GenerateCode(); local
157 Handle<Code> code = m.GenerateCode(); local
180 Handle<Code> code = m.GenerateCode(); local
204 Handle<Code> code = m.GenerateCode(); local
    [all...]
  /external/v8/test/cctest/
test-assembler-x87.cc 6 // * Redistributions of source code must retain the above copyright
64 Handle<Code> code = isolate->factory()->NewCode( local
65 desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
68 code->Print(os);
70 F2 f = FUNCTION_CAST<F2>(code->entry());
101 Handle<Code> code = isolate->factory()->NewCode local
142 Handle<Code> code = isolate->factory()->NewCode( local
173 Handle<Code> code = isolate->factory()->NewCode( local
222 Handle<Code> code = isolate->factory()->NewCode( local
306 Handle<Code> code = isolate->factory()->NewCode( local
348 Handle<Code> code = isolate->factory()->NewCode( local
396 Handle<Code> code = isolate->factory()->NewCode( local
    [all...]
  /external/v8/test/cctest/wasm/
test-run-wasm-js.cc 2 // Use of this source code is governed by a BSD-style license that can be
24 byte code[] = {__VA_ARGS__}; \
25 r.Build(code, code + arraysize(code)); \
174 std::vector<byte> code; local
177 ADD_CODE(code, WASM_F64(inputs.arg_d(i)));
180 ADD_CODE(code, kExprCallFunction, static_cast<byte>(num_params),
183 size_t end = code.size();
184 code.push_back(0)
355 std::vector<byte> code; local
    [all...]
  /external/valgrind/none/tests/
faultstatus.c 47 int code; member in struct:test
73 static int testcode(int code, int want)
75 if (code != want) {
76 fprintf(stderr, " FAIL: expected si_code==%d, not %d\n", want, code);
103 ok = ok && testcode(si->si_code, cur_test->code);
166 #define T(n, sig, code, addr) { test##n, sig, code, addr }
  /external/valgrind/none/tests/mips32/
round_fpu64.c 98 int code; member in struct:test
  /external/valgrind/none/tests/x86/
faultstatus.c 16 int code; member in struct:test
42 static int testcode(int code, int want)
44 if (code != want) {
45 fprintf(stderr, " FAIL: expected si_code==%d, not %d\n", want, code);
66 ok = ok && testcode(si->si_code, cur_test->code);
134 #define T(n, sig, code, addr) { test##n, sig, code, addr }
  /external/webrtc/talk/app/webrtc/
dtmfsender.cc 8 * 1. Redistributions of source code must retain the above copyright notice,
45 // | Event | Code | Type | Volume? |
53 // 2 seconds before processing the next tone. We use -1 as its code.
66 // Get DTMF code from the DTMF event character.
67 bool GetDtmfCode(char tone, int* code) {
74 *code = p - kDtmfTonesTable - 1;
198 int code = 0; local
208 if (!GetDtmfCode(tone, &code)) {
216 if (code == kDtmfCodeTwoSecondDelay) {
227 if (!provider_->InsertDtmf(track_->id(), code, duration_))
    [all...]
  /external/webrtc/webrtc/base/
natserver.cc 4 * Use of this source code is governed by a BSD-style license
77 char code = err ? 1 : 0; variable
78 BufferedReadAdapter::DirectSend(&code, sizeof(char));
  /external/webrtc/webrtc/modules/audio_coding/codecs/g722/
g722_decode.c 11 * to this code in the public domain for the benefit of all mankind -
256 int code; local
267 /* Unpack the code bits */
273 code = s->in_buffer & ((1 << s->bits_per_sample) - 1);
279 code = g722_data[j++];
286 wd1 = code & 0x3F;
287 ihigh = (code >> 6) & 0x03;
292 wd1 = code & 0x1F;
293 ihigh = (code >> 5) & 0x03;
298 wd1 = code & 0x0F
    [all...]
  /external/zlib/src/examples/
enough.c 1 /* enough.c -- determine the maximum size of inflate's Huffman code tables over
19 Clean up code indentation
24 maximum code length in bits to determine the maximum table size for zilb's
29 in the same code for the counting, as do permutations of the assignments of
32 We build a code from shorter to longer lengths, determining how many symbols
34 be coded, what the last code length used was, and how many bit patterns of
35 that length remain unused. Then we add one to the code length and double the
36 number of unused patterns to graduate to the next code length. We then
37 assign all portions of the remaining symbols to that code length that
38 preserve the properties of a correct and eventually complete code. Thos
174 local int *code; \/* number of symbols assigned to each bit length *\/ variable
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/
dec_amr.cpp 22 ANSI-C code for the Adaptive Multi-Rate (AMR) speech codec
154 PSEUDO-CODE
208 When the code is written for a specific target processor the
307 PSEUDO-CODE
375 When the code is written for a specific target processor the
533 PSEUDO-CODE
562 Word16 code[L_SUBFR];
709 * - decode algebraic code *
837 decode_2i40_9bits (subfrNr, i, index, code);
846 decode_2i40_11bits (i, index, code);
1360 Word16 code[L_SUBFR]; local
    [all...]
  /frameworks/av/media/libstagefright/codecs/avc/enc/src/
residual.cpp 33 uint code; local
54 code = *((uint*)pSrc);
56 *((uint*)pDst) = code;
58 status = BitstreamWriteBits(stream, 32, code);
63 code = *((uint*)pSrc);
65 *((uint*)pDst) = code;
67 status = BitstreamWriteBits(stream, 16, code);
87 code = *((uint*)pSrc);
89 *((uint*)pDst) = code;
91 status = BitstreamWriteBits(stream, 32, code);
    [all...]

Completed in 1744 milliseconds

<<21222324252627282930>>