HomeSort by relevance Sort by last modified time
    Searched defs:code (Results 401 - 425 of 878) sorted by null

<<11121314151617181920>>

  /external/ppp/pppd/
chap-new.c 10 * 1. Redistributions of source code must retain the above copyright
120 static void chap_handle_response(struct chap_server_state *ss, int code,
128 static void chap_handle_status(struct chap_client_state *cs, int code, int id,
209 if (dp->code == digest_code)
239 if (dp->code == digest_code)
380 auth_peer_success(0, PPP_CHAP, ss->digest->code,
476 chap_handle_status(struct chap_client_state *cs, int code, int id,
486 if (code == CHAP_SUCCESS) {
490 code = CHAP_FAILURE;
505 if (code == CHAP_SUCCESS
518 unsigned char code, id; local
575 int code, id, len; local
    [all...]
upap.c 10 * 1. Redistributions of source code must retain the above copyright
320 u_char code, id; local
324 * Parse header (code, id and length).
332 GETCHAR(code, inp);
346 * Action depends on code.
348 switch (code) {
361 default: /* XXX Need code reject */
584 upap_sresp(u, code, id, msg, msglen)
586 u_char code, id;
597 PUTCHAR(code, outp)
619 int code, id, len; local
    [all...]
  /external/protobuf/src/google/protobuf/io/
tokenizer.cc 3 // http://code.google.com/p/protobuf/
9 // * Redistributions of source code must retain the above copyright
42 // integrate cleanly with C++ code, especially abstract code or code meant
49 // use regular expressions. And, indeed, I did. I have code which
55 // a lot of code that ends up basically as complex as the hand-coded
68 // - PCRE is fast, but there's still more overhead involved than the code
77 // our code, but that obligates us to keep it up-to-date and just seems
78 // like a big waste just to save 200 lines of code
649 int code = DigitValue(*ptr); local
663 int code = 0; local
    [all...]
  /external/qemu/android/
qemulator.c 373 unsigned code = keycodes[nn].kcode; local
375 code |= 0x200;
376 user_event_keycode( code );
516 /* special code to deal with Alt-F4 properly */
523 /* special code to deal with Command-Q properly */
  /external/qemu/android/skin/
file.c 119 AndroidKeyCode code; member in struct:__anon9265
213 return ki->code;
480 dprint( "### WARNING: invalid skin layout event format: '%s', should be '<TYPE>:<CODE>:<VALUE>'", event );
keyboard.c 98 unsigned code,
101 android_keycodes_add_key_event(&kb->keycodes, code, down);
222 AndroidKeyCode code = 0; local
232 case SDLK_LEFT: code = kKeyCodeDpadLeft; break;
233 case SDLK_RIGHT: code = kKeyCodeDpadRight; break;
234 case SDLK_UP: code = kKeyCodeDpadUp; break;
235 case SDLK_DOWN: code = kKeyCodeDpadDown; break;
239 if (code != 0) {
265 skin_keyboard_add_key_event(keyboard, code, down);
273 code = 0
427 unsigned code; local
    [all...]
  /external/qemu/slirp/
ip_input.c 8 * 1. Redistributions of source code must retain the above copyright
282 * would confuse code below.
507 /* int opt, optlen, cnt, off, code, type = ICMP_PARAMPROB, forward = 0; */
508 int opt, optlen, cnt, off, code, type, forward = 0; local
525 code = &cp[IPOPT_OLEN] - (u_char *)ip;
546 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
555 code = ICMP_UNREACH_SRCFAIL;
586 code = ICMP_UNREACH_SRCFAIL;
601 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
619 code = ICMP_UNREACH_HOST
    [all...]
tcp_input.c 8 * 1. Redistributions of source code must retain the above copyright
635 * But a bit of spaghetti code never hurt anybody :)
672 u_char code=ICMP_UNREACH_NET; local
680 if(errno == EHOSTUNREACH) code=ICMP_UNREACH_HOST;
688 icmp_error(m, ICMP_UNREACH,code, 0,strerror(errno));
    [all...]
  /external/qemu/slirp-android/
ip_input.c 8 * 1. Redistributions of source code must retain the above copyright
282 * would confuse code below.
507 /* int opt, optlen, cnt, off, code, type = ICMP_PARAMPROB, forward = 0; */
508 int opt, optlen, cnt, off, code, type, forward = 0; local
525 code = &cp[IPOPT_OLEN] - (u_char *)ip;
546 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
555 code = ICMP_UNREACH_SRCFAIL;
586 code = ICMP_UNREACH_SRCFAIL;
601 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
619 code = ICMP_UNREACH_HOST
    [all...]
socket.c 297 * There's a lot duplicated code here, but...
467 u_char code=ICMP_UNREACH_PORT; local
469 if(errno == EHOSTUNREACH) code=ICMP_UNREACH_HOST;
470 else if(errno == ENETUNREACH) code=ICMP_UNREACH_NET;
474 icmp_error(so->so_m, ICMP_UNREACH,code, 0,errno_str);
508 u_char code=ICMP_UNREACH_PORT; local
510 if(errno == EHOSTUNREACH) code=ICMP_UNREACH_HOST;
511 else if(errno == ENETUNREACH) code=ICMP_UNREACH_NET;
513 DEBUG_MISC((dfd," rx error, tx icmp ICMP_UNREACH:%i\n", code));
514 icmp_error(so->so_m, ICMP_UNREACH,code, 0,errno_str)
    [all...]
tcp_input.c 8 * 1. Redistributions of source code must retain the above copyright
640 * But a bit of spaghetti code never hurt anybody :)
678 u_char code=ICMP_UNREACH_NET; local
686 if(errno == EHOSTUNREACH) code=ICMP_UNREACH_HOST;
694 icmp_error(m, ICMP_UNREACH,code, 0,errno_str);
    [all...]
  /external/srec/srec/include/
srec_arb.h 65 asr_uint16_t code; member in struct:__anon11193
98 phonemeID phoneme_index[NUM_PHONEME_INDICES]; /* from short code to phoneme index */
  /external/v8/src/
compiler.cc 6 // * Redistributions of source code must retain the above copyright
117 // Determine whether to use the full compiler for all code. If the flag
120 // the code from the full compiler supports mode precise break points. For the
121 // crankshaft adaptive compiler debugging the optimized code is not possible at
167 // code as non-optimizable. The marker on the shared function info
168 // is there because we flush non-optimized code thereby loosing the
169 // non-optimizable information for the code. When the code is
175 Handle<Code> code = Handle<Code>(shared->code()) local
376 Code* code = it.frame()->LookupCode(); local
621 Handle<Code> code = info->code(); local
708 Handle<Code> code = info.isolate()->builtins()->LazyCompile(); local
773 Handle<Code> code = info->code(); local
    [all...]
disassembler.cc 6 // * Redistributions of source code must retain the above copyright
30 #include "code-stubs.h"
62 explicit V8NameConverter(Code* code) : code_(code) {}
65 Code* code() const { return code_; } function in class:v8::internal::V8NameConverter
67 Code* code_;
82 // print as code offset, if it seems reasonable
94 // The V8NameConverter is used for well known code, so we can "safely
238 Code* code = Code::GetCodeFromTargetAddress(relocinfo.target_address()); local
    [all...]
  /external/v8/src/mips/
disasm-mips.cc 6 // * Redistributions of source code must retain the above copyright
28 // A Disassembler object is used to disassemble a block of code instruction by
32 // The example below will disassemble a block of code and print it to stdout.
45 // of code into a FILE*, meaning that the above functionality could also be
270 int32_t code = instr->Bits(25, 6); local
272 "0x%05x (%d)", code, code);
281 int32_t code = instr->Bits(15, 6); local
283 OS::SNPrintF(out_buffer_ + out_buffer_pos_, "0x%03x", code);
348 case 'c': { // 'code for break or trap instruction
    [all...]
  /external/v8/test/cctest/
test-accessors.cc 6 // * Redistributions of source code must retain the above copyright
400 i::Code* code = frame->LookupCode(); local
401 CHECK(code->IsCode());
403 CHECK(code->contains(pc));
test-log-stack-tracer.cc 6 // * Redistributions of source code must retain the above copyright
85 // pure JS code is being executed
205 i::Code* code = function->code(); local
206 return code->contains(addr);
278 // execution of a native function called from JS code. In this case,
320 // execution of JS code. However, as calling StackTracer requires
321 // entering native code, we can only emulate pure JS by erasing
394 // pure native code. StackTracer only unrolls JS code, so we can'
    [all...]
  /external/valgrind/main/coregrind/m_demangle/
cp-demangle.h 39 const char *code; member in struct:demangle_operator_info
  /external/webkit/Source/JavaScriptCore/assembler/
LinkBuffer.h 7 * 1. Redistributions of source code must retain the above copyright
41 // This class assists in linking code generated by the macro assembler, once code generation
42 // has been completed, and the code has been copied to is final location in memory. At this
43 // time pointers to labels within the code may be resolved, and relative offsets to external
50 // * The address of a Label pointing into the code may be resolved.
91 // These methods are used to link or set values at code generation time.
97 MacroAssembler::linkCall(code(), call, function);
103 MacroAssembler::linkJump(code(), jump, label);
115 MacroAssembler::linkPointer(code(), target, value)
204 void* code() function in class:JSC::LinkBuffer
    [all...]
  /external/webkit/Source/ThirdParty/ANGLE/src/libGLESv2/
Shader.cpp 3 // Use of this source code is governed by a BSD-style license that can be
90 char *code = mSource; local
105 strncpy(code, string[i], stringLength);
106 code += stringLength;
  /external/webkit/Source/WebCore/dom/
ExceptionCode.h 97 int code; // numeric value of the exception within a particular type member in struct:WebCore::ExceptionCodeDescription
  /external/webkit/Source/WebCore/plugins/mac/
PluginPackageMac.cpp 9 * 1. Redistributions of source code must retain the above copyright
85 SInt32 code; local
86 if (!CFURLCreateDataAndPropertiesFromResource(kCFAllocatorDefault, url.get(), &resource, 0, 0, &code))
  /external/webkit/Source/WebCore/xml/
XPathParser.cpp 10 * 1. Redistributions of source code must retain the above copyright
151 Token Parser::makeTokenAndAdvance(int code, int advance)
154 return Token(code);
157 Token Parser::makeTokenAndAdvance(int code, NumericOp::Opcode val, int advance)
160 return Token(code, val);
163 Token Parser::makeTokenAndAdvance(int code, EqTestOp::Opcode val, int advance)
166 return Token(code, val);
278 char code = peekCurHelper(); local
279 switch (code) {
282 return makeTokenAndAdvance(code);
    [all...]
  /external/webkit/Source/WebKit/efl/ewk/
ewk_frame.h 88 int code; /**< numeric error code */ member in struct:_Ewk_Frame_Load_Error
  /external/webkit/Source/WebKit/qt/WebCoreSupport/
InspectorServerQt.cpp 257 int code = 200; local
282 code = 404;
287 QHttpResponseHeader responseHeader(code, text, 1, 0);

Completed in 832 milliseconds

<<11121314151617181920>>