/external/kernel-headers/original/linux/netfilter_ipv4/ |
H A D | ipt_owner.h | 4 /* match and invert flags */ 17 u_int8_t match, invert; /* flags */ member in struct:ipt_owner_info
|
/external/kernel-headers/original/linux/netfilter_ipv6/ |
H A D | ip6t_owner.h | 4 /* match and invert flags */ 15 u_int8_t match, invert; /* flags */ member in struct:ip6t_owner_info
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ |
H A D | AllowEventsParser.java | 78 this.lexer.match(TokenTypes.ID); 85 this.lexer.match(','); 89 this.lexer.match(TokenTypes.ID); 97 this.lexer.match('\n');
|
H A D | AllowParser.java | 77 this.lexer.match(TokenTypes.ID); 84 this.lexer.match(','); 88 this.lexer.match(TokenTypes.ID); 96 this.lexer.match('\n');
|
H A D | ViaParser.java | 56 lexer.match(TokenTypes.ID); 61 lexer.match('/'); 63 lexer.match(TokenTypes.ID); 70 lexer.match('/'); 72 lexer.match(TokenTypes.ID); 149 lexer.match(LexerCore.ID); 172 lexer.match(LexerCore.ID); 203 this.lexer.match(TokenTypes.VIA); 205 this.lexer.match(':'); // expect a colon. 220 this.lexer.match('\ [all...] |
H A D | RetryAfterParser.java | 95 this.lexer.match(';'); 97 lexer.match(TokenTypes.ID); 101 this.lexer.match('='); 114 this.lexer.match('='); 116 lexer.match(TokenTypes.ID);
|
/external/oprofile/libpp/ |
H A D | filename_spec.cpp | 35 bool filename_spec::match(filename_spec const & rhs, function in class:filename_spec 38 if (!tid.match(rhs.tid) || !cpu.match(rhs.cpu) || 39 !tgid.match(rhs.tgid) || count != rhs.count || 47 // PP:3.3 if binary is not empty we must match either the
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
H A D | regress-105972.js | 23 * "/^.*?$/ will not match anything" 45 * The bug: this match was coming up null in Rhino and SpiderMonkey. 46 * It should match the whole string. The reason: 49 * at the simplest match it can find. But the pattern here asks us 50 * to match till the end of the string. So the simplest match must 56 actualmatch = string.match(pattern); 63 * Unlike the above pattern, we don't have to match till the end of 69 actualmatch = string.match(pattern); 79 * the match wil [all...] |
H A D | regress-72964.js | 45 // 4 low Unicode chars = Latin1; whole string should match 48 actualmatch = string.match(pattern); 52 // Now put a space in the middle; first half of string should match 55 actualmatch = string.match(pattern); 60 // 4 high Unicode chars = non-Latin1; whole string should match 63 actualmatch = string.match(pattern); 67 // Now put a space in the middle; first half of string should match 70 actualmatch = string.match(pattern);
|
H A D | regress-78156.js | 53 actualmatch = string.match(pattern); 59 actualmatch = string.match(pattern); 66 actualmatch = string.match(pattern); 72 actualmatch = string.match(pattern);
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/regexp/ |
H A D | RegExp_object.js | 44 testcases[count++] = new TestCase ( SECTION, "'Test SSN is 123-34-4567'.match(SSN_pattern))", 45 String(["123-34-4567"]), String('Test SSN is 123-34-4567'.match(SSN_pattern))); 48 testcases[count++] = new TestCase ( SECTION, "'Test SSN is 123-34-4567'.match(SSN_pattern))", 49 String(["123-34-4567"]), String('Test SSN is 123-34-4567'.match(SSN_pattern))); 53 testcases[count++] = new TestCase ( SECTION, "'Our phone number is (408)345-2345.'.match(PHONE_pattern))", 54 String(["(408)345-2345","408","345","2345"]), String('Our phone number is (408)345-2345.'.match(PHONE_pattern))); 57 testcases[count++] = new TestCase ( SECTION, "'The phone number is 408-345-2345!'.match(PHONE_pattern))", 58 String(["408-345-2345","408","345","2345"]), String('The phone number is 408-345-2345!'.match(PHONE_pattern)));
|
H A D | everything.js | 41 // 'Sally and Fred are sure to come.'.match(/^[a-z\s]*/i) 42 testcases[count++] = new TestCase ( SECTION, "'Sally and Fred are sure to come'.match(/^[a-z\\s]*/i)", 43 String(["Sally and Fred are sure to come"]), String('Sally and Fred are sure to come'.match(/^[a-z\s]*/i))); 45 // 'test123W+xyz'.match(new RegExp('^[a-z]*[0-9]+[A-Z]?.(123|xyz)$')) 46 testcases[count++] = new TestCase ( SECTION, "'test123W+xyz'.match(new RegExp('^[a-z]*[0-9]+[A-Z]?.(123|xyz)$'))", 47 String(["test123W+xyz","xyz"]), String('test123W+xyz'.match(new RegExp('^[a-z]*[0-9]+[A-Z]?.(123|xyz)$')))); 49 // 'number one 12365 number two 9898'.match(/(\d+)\D+(\d+)/) 50 testcases[count++] = new TestCase ( SECTION, "'number one 12365 number two 9898'.match(/(\d+)\D+(\d+)/)", 51 String(["12365 number two 9898","12365","9898"]), String('number one 12365 number two 9898'.match(/(\d+)\D+(\d+)/))); 54 // 'See Spot run.'.match(simpleSentenc [all...] |
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
H A D | SearchSymbol.h | 29 bool match; member in class:sh::SearchSymbol
|
/external/webkit/Source/WebCore/html/ |
H A D | BaseTextInputType.cpp | 48 int matchOffset = RegularExpression(pattern, TextCaseSensitive).match(value, 0, &matchLength);
|
/external/webkit/Source/WebKit/chromium/public/ |
H A D | WebRegularExpression.h | 48 WEBKIT_API int match(const WebString&, int startFrom = 0, int* matchLength = 0) const;
|
/external/webkit/Source/WebKit/chromium/src/gtk/ |
H A D | WebFontInfo.cpp | 152 FcPattern* match = FcFontMatch(0, pattern, &result); local 157 if (!match) { 158 FcPatternDestroy(match); 165 if (FcPatternGetBool(match, FC_ANTIALIAS, 0, &b) == FcResultMatch) 167 if (FcPatternGetBool(match, FC_EMBEDDED_BITMAP, 0, &b) == FcResultMatch) 169 if (FcPatternGetBool(match, FC_AUTOHINT, 0, &b) == FcResultMatch) 171 if (FcPatternGetBool(match, FC_HINTING, 0, &b) == FcResultMatch) 173 if (FcPatternGetInteger(match, FC_HINT_STYLE, 0, &i) == FcResultMatch) 175 if (FcPatternGetInteger(match, FC_RGBA, 0, &i) == FcResultMatch) { 193 FcPatternDestroy(match); [all...] |
/external/chromium/chrome/browser/content_settings/ |
H A D | content_settings_pattern.cc | 77 const size_t match = local 80 return (match != std::string::npos) && 81 (match == 0 || host[match - 1] == '.') && 82 (match + pattern_.length() - kDomainWildcardLength == host.length());
|
/external/iproute2/include/ |
H A D | ip6tables.h | 11 struct ip6tables_match *match; member in struct:ip6tables_rule_match 23 /* Size of match data. */ 26 /* Size of match data relevent for userspace comparison purposes */ 32 /* Initialize the match. */ 40 struct ip6t_entry_match **match); 45 /* Prints out the match iff non-NULL: put space at end */ 47 const struct ip6t_entry_match *match, int numeric); 51 const struct ip6t_entry_match *match); 134 extern struct ip6tables_match *find_match(const char *name, enum ip6t_tryload, struct ip6tables_rule_match **match);
|
/external/webkit/Tools/Scripts/webkitpy/thirdparty/simplejson/ |
H A D | scanner.py | 35 Yield match, end_idx for each match 37 match = self.scanner.scanner(string, idx).match 42 m = match() 54 match = self.scanner.scanner(string, matchend).match
|
/external/doclava/src/com/google/doclava/parser/ |
H A D | JavaLexer.java | 248 match('0'); 287 match('0'); 399 match("0x"); 407 match("0X"); 508 match('.'); 558 match('.'); 746 match('.'); 1055 match('\''); 1118 match('\''); 1141 match('\"'); [all...] |
/external/iproute2/examples/diffserv/ |
H A D | Edge32-ca-u32 | 58 match ip tos 0x88 0xfc \ 62 match ip tos 0x88 0xfc \ 71 match ip tos 0x88 0xfc \ 75 match ip tos 0x88 0xfc \ 83 match ip tos 0x88 0xfc \ 87 match ip tos 0x88 0xfc \ 98 match ip tos 0x90 0xfc \ 102 match ip tos 0x90 0xfc \ 110 match ip tos 0x90 0xfc \ 114 match i [all...] |
/external/iptables/extensions/ |
H A D | libip6t_mh.c | 66 "mh match options:\n" 67 "[!] --mh-type type[:type] match mh type\n"); 82 unsigned int match = limit; local 88 if (match == limit || len == namelen) 89 match = i; 93 if (match != limit) { 94 return mh_names[match].type; 175 static void mh_print(const void *ip, const struct xt_entry_match *match, argument 178 const struct ip6t_mh *mhinfo = (struct ip6t_mh *)match->data; 189 static void mh_save(const void *ip, const struct xt_entry_match *match) argument [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
H A D | SimpleCLexer.java | 55 match(';'); 75 match('('); 95 match(','); 115 match(')'); 135 match('{'); 155 match('}'); 175 match("for"); 196 match("int"); 217 match("char"); 238 match("voi [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
H A D | SimpleCLexer.java | 55 match(';'); 75 match('('); 95 match(','); 115 match(')'); 135 match('{'); 155 match('}'); 175 match("for"); 196 match("int"); 217 match("char"); 238 match("voi [all...] |
/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_index.cc | 19 // Used when finding the set of bookmarks that match a query. Each match 27 // when we match only one term, and is filled in when we get more than one 93 // We use a QueryParser to fill in match positions for us. It's not the most 127 const Match& match, 130 for (NodeSet::const_iterator i = match.nodes_begin(); 131 i != match.nodes_end(); ++i) { 149 // ["thi"] will match the bookmark titled [Thinking], but since 150 // ["thi"] is quoted we don't want to do a prefix match. 166 // Term is too short for prefix match, compar 125 ExtractBookmarkNodePairs( history::URLDatabase* url_db, const Match& match, NodeTypedCountPairs* node_typed_counts) const argument 171 Match match; local 183 Match match; local 206 Match* match = &((*matches)[i]); local 225 const Match& match = current_matches[i]; local [all...] |