Searched refs:code (Results 151 - 175 of 3769) sorted by relevance

1234567891011>>

/external/skia/src/core/
H A DSkErrorInternals.h5 * Use of this source code is governed by a BSD-style license that can be
18 static void SetError(SkError code, const char *fmt, ...);
22 static void DefaultErrorCallback(SkError code, void *context);
/external/wpa_supplicant_8/hostapd/src/eap_common/
H A Deap_wsc_common.c17 struct wpabuf * eap_wsc_build_frag_ack(u8 id, u8 code) argument
21 msg = eap_msg_alloc(EAP_VENDOR_WFA, EAP_VENDOR_TYPE_WSC, 2, code, id);
/external/wpa_supplicant_8/src/eap_common/
H A Deap_wsc_common.c17 struct wpabuf * eap_wsc_build_frag_ack(u8 id, u8 code) argument
21 msg = eap_msg_alloc(EAP_VENDOR_WFA, EAP_VENDOR_TYPE_WSC, 2, code, id);
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/
H A Deap_wsc_common.c17 struct wpabuf * eap_wsc_build_frag_ack(u8 id, u8 code) argument
21 msg = eap_msg_alloc(EAP_VENDOR_WFA, EAP_VENDOR_TYPE_WSC, 2, code, id);
/external/zlib/src/contrib/infback9/
H A Dinflate9.h16 LEN, /* i: waiting for length/lit code */
39 unsigned ncode; /* number of code length code lengths */
40 unsigned nlen; /* number of length code lengths */
41 unsigned ndist; /* number of distance code lengths */
42 unsigned have; /* number of code lengths in lens[] */
43 code FAR *next; /* next available space in codes[] */
44 unsigned short lens[320]; /* temporary storage for code lengths */
45 unsigned short work[288]; /* work area for code table building */
46 code code
[all...]
H A Dinftree9.h12 information needed to do the operation requested by the code that
14 table that indexes more bits of the code. op indicates whether
16 distance, an end-of-block, or an invalid code. For a table
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
26 unsigned char bits; /* bits in this part of the code */
27 unsigned short val; /* offset in table or code value */
28 } code; typedef in typeref:struct:__anon34340
35 01000000 - invalid code
[all...]
/external/zlib/src/
H A Dinftrees.h12 information needed to do the operation requested by the code that
14 table that indexes more bits of the code. op indicates whether
16 distance, an end-of-block, or an invalid code. For a table
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
26 unsigned char bits; /* bits in this part of the code */
27 unsigned short val; /* offset in table or code value */
28 } code; typedef in typeref:struct:__anon34356
35 01000000 - invalid code
[all...]
/external/chromium_org/remoting/client/plugin/
H A Dnormalizing_input_filter_cros.cc2 // Use of this source code is governed by a BSD-style license that can be
14 static bool IsOsKey(unsigned int code) { argument
17 return code == kUsbLeftOsKey || code == kUsbRightOsKey;
21 static bool IsLeftAltKey(unsigned int code) { argument
23 return code == kUsbLeftAltKey;
27 static bool IsRewrittenFunctionKey(unsigned int code) { argument
30 return code >= kUsbFunctionKeyMin && code <= kUsbFunctionKeyMax;
34 static bool IsRewrittenExtendedKey(unsigned int code) { argument
41 IsRewrittenKey(unsigned int code) argument
[all...]
/external/chromium_org/chrome/test/chromedriver/chrome/
H A Dstatus.h2 // Use of this source code is governed by a BSD-style license that can be
42 explicit Status(StatusCode code);
43 Status(StatusCode code, const std::string& details);
44 Status(StatusCode code, const Status& cause);
45 Status(StatusCode code, const std::string& details, const Status& cause);
53 StatusCode code() const;
H A Djavascript_dialog_manager_unittest.cc2 // Use of this source code is governed by a BSD-style license that can be
19 ASSERT_EQ(kNoAlertOpen, manager.GetDialogMessage(&message).code());
22 ASSERT_EQ(kNoAlertOpen, manager.HandleDialog(false, NULL).code());
56 manager.OnEvent(&client, "Page.javascriptDialogOpening", params).code());
58 ASSERT_EQ(kOk, manager.HandleDialog(false, &given_text).code());
72 manager.OnEvent(&client, "Page.javascriptDialogOpening", params).code());
73 ASSERT_EQ(kOk, manager.HandleDialog(false, NULL).code());
85 manager.OnEvent(&client, "Page.javascriptDialogOpening", params).code());
88 ASSERT_EQ(kOk, manager.GetDialogMessage(&message).code());
93 ASSERT_EQ(kNoAlertOpen, manager.GetDialogMessage(&message).code());
[all...]
/external/chromium_org/third_party/WebKit/Source/modules/geolocation/
H A DPositionError.h7 * 1. Redistributions of source code must retain the above copyright
44 static PositionError* create(ErrorCode code, const String& message) { return new PositionError(code, message); } argument
47 ErrorCode code() const { return m_code; } function in class:blink::PositionError
53 PositionError(ErrorCode code, const String& message) argument
54 : m_code(code)
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-instruction.cc2 // Use of this source code is governed by a BSD-style license that can be
8 #include "src/compiler/code-generator.h"
26 // A testing helper for the register code abstraction.
36 code(NULL) {}
38 ~InstructionTester() { delete code; }
47 TestInstrSeq* code; member in class:InstructionTester
57 code = new TestInstrSeq(&linkage, &graph, &schedule);
87 return code->AddInstruction(instr, block);
115 CHECK_EQ(R.graph.NodeCount(), R.code->ValueCount());
118 CHECK_EQ(static_cast<int>(blocks->size()), R.code
[all...]
/external/dexmaker/src/test/java/com/google/dexmaker/examples/
H A DFibonacciMaker.java40 Code code = dexMaker.declare(fib, Modifier.PUBLIC | Modifier.STATIC);
42 Local<Integer> i = code.getParameter(0, TypeId.INT);
43 Local<Integer> constant1 = code.newLocal(TypeId.INT);
44 Local<Integer> constant2 = code.newLocal(TypeId.INT);
45 Local<Integer> a = code.newLocal(TypeId.INT);
46 Local<Integer> b = code.newLocal(TypeId.INT);
47 Local<Integer> c = code.newLocal(TypeId.INT);
48 Local<Integer> d = code.newLocal(TypeId.INT);
49 Local<Integer> result = code.newLocal(TypeId.INT);
51 code
[all...]
H A DHelloWorldMaker.java45 // Execute our newly-generated code in-process.
70 Code code = dexMaker.declare(hello, Modifier.STATIC | Modifier.PUBLIC);
73 Local<Integer> a = code.newLocal(TypeId.INT);
74 Local<Integer> b = code.newLocal(TypeId.INT);
75 Local<Integer> c = code.newLocal(TypeId.INT);
76 Local<String> s = code.newLocal(TypeId.STRING);
77 Local<PrintStream> localSystemOut = code.newLocal(printStreamType);
80 code.loadConstant(a, 0xabcd);
83 code.loadConstant(b, 0xaaaa);
86 code
[all...]
/external/chromium_org/third_party/libevent/
H A Devent_rpcgen.py6 # Generates marshaling code based on libevent.
52 def PrintIdented(self, file, ident, code):
54 for entry in code:
354 code = [ 'int %s(struct %s *, %s *);' % (
356 return code
359 code = (
369 code = '\n'.join(code)
370 code = code
[all...]
/external/e2fsprogs/lib/ss/
H A Dtest_ss.c85 int c, code; local
107 (char *)NULL, &test_cmds, &code);
108 if (code) {
109 ss_perror(sci_idx, code, "creating invocation");
113 (void) ss_add_request_table (sci_idx, &ss_std_requests, 1, &code);
114 if (code) {
115 ss_perror (sci_idx, code, "adding standard requests");
123 code = ss_execute_line(sci_idx, request);
124 if (code) {
125 ss_perror(sci_idx, code, reques
[all...]
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DCodeGenTreeWalker.g13 1. Redistributions of source code must retain the above copyright
33 /** Walk a grammar and generate code by gradually building up
375 if ( $rST.code != null )
377 recognizerST.add("rules", $rST.code);
378 outputFileST.add("rules", $rST.code);
379 headerFileST.add("rules", $rST.code);
396 rule returns [ST code=null]
409 // For syn preds, we don't want any AST code etc... in there.
435 $b.code.add("description", description);
461 $code
[all...]
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowUriMatcher.java17 public int code = UriMatcher.NO_MATCH; field in class:ShadowUriMatcher.MatchNode
22 public MatchNode(int code) { argument
23 this.code = code;
29 public void __constructor__(int code) { argument
30 rootNode = new MatchNode(code);
34 public void addURI(String authority, String path, int code) { argument
37 authNode = new MatchNode(rootNode.code);
42 addNodes(authNode, Arrays.asList(segments), code);
51 return rootNode.code;
82 addNodes(MatchNode baseNode, List<String> segments, int code) argument
[all...]
/external/guava/guava/src/com/google/common/primitives/
H A Dgenerate.sh61 * Static utility methods pertaining to {@code primtyp} primitives, that are not
72 * The number of bytes required to represent a primitive {@code primtyp}
78 * Returns a hash code for {@code value}; equal to the result of invoking
79 * {@code ((WrapperCl) value).hashCode()}.
81 * @param value a primitive {@code primtyp} value
82 * @return a hash code for the value
89 * Returns the {@code primtyp} value that is equal to {@code value}, if
92 * @param value any value in the range of the {@code primty
[all...]
/external/libcxx/test/re/re.badexp/
H A Dregex_error.pass.cpp18 // regex_constants::error_type code() const;
28 assert(e.code() == std::regex_constants::error_collate);
33 assert(e.code() == std::regex_constants::error_ctype);
38 assert(e.code() == std::regex_constants::error_escape);
44 assert(e.code() == std::regex_constants::error_backref);
49 assert(e.code() == std::regex_constants::error_brack);
54 assert(e.code() == std::regex_constants::error_paren);
59 assert(e.code() == std::regex_constants::error_brace);
64 assert(e.code() == std::regex_constants::error_badbrace);
69 assert(e.code()
[all...]
/external/chromium_org/chrome/android/java/src/org/chromium/chrome/browser/sync/
H A DGoogleServiceAuthError.java2 // Use of this source code is governed by a BSD-style license that can be
60 State(int code, int message) { argument
61 mCode = code;
65 public static State fromCode(int code) { argument
67 if (state.mCode == code) {
71 throw new IllegalArgumentException("No state for code: " + code);
81 GoogleServiceAuthError(int code) { argument
82 mState = State.fromCode(code);
/external/chromium_org/components/translate/core/language_detection/
H A Dlanguage_detection_util.cc2 // Use of this source code is governed by a BSD-style license that can be
28 // Similar language code list. Some languages are very similar and difficult
31 const char* const code; member in struct:__anon6887::SimilarLanguageCode
42 // Checks |kSimilarLanguageCodes| and returns group code.
45 if (language.find(kSimilarLanguageCodes[i].code) != 0)
60 // Applies a series of language code modification in proper order.
61 void ApplyLanguageCodeCorrection(std::string* code) { argument
63 translate::CorrectLanguageCodeTypo(code);
65 if (!translate::IsValidLanguageCode(*code)) {
66 *code
198 DeterminePageLanguage(const std::string& code, const std::string& html_lang, const base::string16& contents, std::string* cld_language_p, bool* is_cld_reliable_p) argument
276 CorrectLanguageCodeTypo(std::string* code) argument
301 IsValidLanguageCode(const std::string& code) argument
[all...]
/external/chromium_org/v8/src/ic/
H A Daccess-compiler.cc2 // Use of this source code is governed by a BSD-style license that can be
16 // Create code object in the heap.
19 Handle<Code> code = factory()->NewCode(desc, flags, masm()->CodeObject()); local
20 if (code->IsCodeStubOrIC()) code->set_stub_key(CodeStub::NoCacheKey());
24 code->Disassemble(name, os);
27 return code;
42 Handle<Code> code(masm->isolate()->builtins()->builtin(name));
43 GenerateTailCall(masm, code);
/external/llvm/lib/Support/
H A Dregerror.c2 * This code is derived from OpenBSD's libc/regex, original license follows:
8 * This code is derived from software contributed to Berkeley by
14 * 1. Redistributions of source code must retain the above copyright
55 int code; member in struct:rerr
75 { 0, "", "*** unknown regexp error code ***" }
95 for (r = rerrs; r->code != 0; r++)
96 if (r->code == target)
100 if (r->code != 0) {
127 for (r = rerrs; r->code != 0; r++)
130 if (r->code
[all...]
/external/strace/linux/
H A Dioctlsort.c16 unsigned long code; member in struct:ioctlent
26 unsigned long code1 = ((struct ioctlent *) a)->code;
27 unsigned long code2 = ((struct ioctlent *) b)->code;
38 ioctls[i].code &= (_IOC_NRMASK << _IOC_NRSHIFT) |
44 if (i == 0 || ioctls[i].code != ioctls[i-1].code ||
47 ioctls[i].header, ioctls[i].name, ioctls[i].code);

Completed in 1421 milliseconds

1234567891011>>