| /external/clang/test/ |
| make_test_dirs.pl | 11 $next_indent_level = length($MATCH);
|
| /external/oprofile/libutil/ |
| op_file.c | 126 * filter match, so for simplicity, we perform this match for all recursion
127 * types and logically OR the match result with the value of the passed
131 #define MATCH 1
136 int match; local
145 match = 1;
147 match = 0;
149 switch (recursion | match) {
154 case NO_RECURSION + MATCH:
157 case MATCH_ANY_ENTRY_RECURSION + MATCH
[all...] |
| /external/chromium_org/chrome/browser/autocomplete/ |
| shortcuts_provider_unittest.cc | 153 // results' destination URLs match those provided. |expected_urls| does not
281 // Scores high because of visit count but less match span,
353 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[1].style);
363 EXPECT_EQ(ACMatchClassification::MATCH, spans_b[1].style);
367 EXPECT_EQ(ACMatchClassification::MATCH, spans_b[3].style);
371 EXPECT_EQ(ACMatchClassification::MATCH, spans_b[5].style);
382 EXPECT_EQ(ACMatchClassification::MATCH, spans_c[1].style);
386 EXPECT_EQ(ACMatchClassification::MATCH, spans_c[3].style);
390 EXPECT_EQ(ACMatchClassification::MATCH, spans_c[5].style);
396 // ACMatch spans should match first two letters of the "news"
[all...] |
| history_quick_provider_unittest.cc | 133 // results' destination URLs match those provided. |expected_urls| does not
308 // to be the default match. Remove this test.
393 // First check that a mid-word match yield no results.
396 // Then check that we get results when the match is at a word start
418 // Simulates matches: '.xx.xxx..xx...xxxxx..' which will test no match at
432 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[1].style);
436 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[3].style);
440 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[5].style);
444 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[7].style);
457 EXPECT_EQ(ACMatchClassification::MATCH | ACMatchClassification::URL
[all...] |
| autocomplete_match.h | 39 // with some kind of classification. Even if a match has no distinct
46 // 11,match 0,match
56 MATCH = 1 << 1, // A match for the user's search term
77 // The type of this match.
89 AutocompleteMatch(const AutocompleteMatch& match);
93 AutocompleteMatch& operator=(const AutocompleteMatch& match);
103 // Comparison function for determining when one match is better than another.
118 // and marking the first instance of |find_text| as a match. (This matc
[all...] |
| /external/chromium_org/third_party/zlib/ |
| inflate.h | 45 MATCH, /* o: waiting for output space to copy string */
74 LENEXT -> DIST -> DISTEXT -> MATCH -> LEN
121 unsigned was; /* initial length of match */
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inflate.h | 43 MATCH, /* o: waiting for output space to copy string */
70 LENEXT -> DIST -> DISTEXT -> MATCH -> LEN
|
| /external/zlib/src/ |
| inflate.h | 45 MATCH, /* o: waiting for output space to copy string */
74 LENEXT -> DIST -> DISTEXT -> MATCH -> LEN
121 unsigned was; /* initial length of match */
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ir_reader.cpp | 134 if (MATCH(expr, pat)) {
220 if (!MATCH(expr, pat)) {
259 "don't match prototype", f->name, badvar);
265 "match prototype", f->name);
374 if (!MATCH(expr, pat)) {
439 if (!MATCH(expr, pat)) {
468 if (!MATCH(expr, pat)) {
493 if (MATCH(expr, return_value_pat)) {
500 } else if (MATCH(expr, return_void_pat)) {
549 if (!MATCH(expr, pat4) && !MATCH(expr, pat5))
[all...] |
| s_expression.h | 42 #define MATCH(list, pat) s_match(list, Elements(pat), pat, false)
151 * Part of a pattern to match - essentially a record holding a pointer to the
152 * storage for the component to match, along with the appropriate type.
163 bool match(s_expression *expr);
|
| /external/mesa3d/src/glsl/ |
| ir_reader.cpp | 134 if (MATCH(expr, pat)) {
220 if (!MATCH(expr, pat)) {
259 "don't match prototype", f->name, badvar);
265 "match prototype", f->name);
374 if (!MATCH(expr, pat)) {
439 if (!MATCH(expr, pat)) {
468 if (!MATCH(expr, pat)) {
493 if (MATCH(expr, return_value_pat)) {
500 } else if (MATCH(expr, return_void_pat)) {
549 if (!MATCH(expr, pat4) && !MATCH(expr, pat5))
[all...] |
| s_expression.h | 42 #define MATCH(list, pat) s_match(list, Elements(pat), pat, false)
151 * Part of a pattern to match - essentially a record holding a pointer to the
152 * storage for the component to match, along with the appropriate type.
163 bool match(s_expression *expr);
|
| /external/chromium/chrome/browser/autocomplete/ |
| history_quick_provider_unittest.cc | 105 // results' destination URLs match those provided. |expected_urls| does not
292 // Simulates matches: '.xx.xxx..xx...xxxxx..' which will test no match at
306 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[1].style);
310 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[3].style);
314 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[5].style);
318 EXPECT_EQ(ACMatchClassification::MATCH, spans_a[7].style);
331 EXPECT_EQ(ACMatchClassification::MATCH, spans_b[0].style);
335 EXPECT_EQ(ACMatchClassification::MATCH, spans_b[2].style);
|
| autocomplete_match.h | 32 // with some kind of classification. Even if a match has no distinct
39 // 11,match 0,match
49 MATCH = 1 << 1, // A match for the user's search term
66 // The type of this match.
99 // Comparison function for determining when one match is better than another.
111 // and marking the first instance of |find_text| as a match. (This match
120 // when find() would be misleading (e.g. you want to mark the second match i
[all...] |
| builtin_provider.cc | 37 AutocompleteMatch match(this, kRelevance, false,
39 match.fill_into_edit = *i;
40 match.destination_url = GURL(*i);
41 match.contents = match.fill_into_edit;
42 match.contents_class.push_back(ACMatchClassification(0,
43 ACMatchClassification::MATCH | ACMatchClassification::URL));
44 if (match.contents.length() > input.text().length()) {
45 match.contents_class.push_back(
49 matches_.push_back(match);
[all...] |
| autocomplete_match.cc | 133 // Mark pre-match portion of string (if any).
140 // No match, above classification will suffice for whole string.
143 // Classifying an empty match makes no sense and will lead to validation
147 (style | ACMatchClassification::MATCH) & ~ACMatchClassification::DIM));
149 // Mark post-match portion of string (if any).
|
| /external/chromium_org/v8/tools/ |
| common-includes.sh | 61 local MATCH=$(git branch | grep "$1" | awk '{print $NF}' | grep -x $1)
62 if [ "$MATCH" == "$1" ] ; then
|
| /external/v8/tools/ |
| common-includes.sh | 63 local MATCH=$(git branch | grep "$1" | awk '{print $NF}' | grep -x $1)
64 if [ "$MATCH" == "$1" ] ; then
|
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| omnibox_provider.cc | 25 if (styles & ACMatchClassification::MATCH)
26 tag_styles |= SearchResult::Tag::MATCH;
66 OmniboxResult(Profile* profile, const AutocompleteMatch& match)
68 match_(match) {
69 set_id(match.destination_url.spec());
74 set_relevance(match.relevance / 1500.0);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Exchanger.java | 168 * changed, but cannot yet proceed until match is set. In the
171 * the linearization point to be a CAS of the match field (as done
221 * slot CASes, it would also be legal for the write to Node.match
258 * The bound for spins while waiting for a match. The actual
288 volatile Object match; // Item provided by releasing thread field in class:Exchanger.Node
342 q.match = item;
354 Object v = p.match;
356 U.putOrderedObject(p, MATCH, null);
370 spins = SPINS; // releaser hasn't set match yet
437 q.match = item
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_init.c | 275 #define MATCH(line, name) \
288 if (MATCH(buf, "domain")) {
304 if (MATCH(buf, "search")) {
341 if (MATCH(buf, "nameserver") && nserv < MAXNS) {
375 if (MATCH(buf, "sortlist")) {
417 if (MATCH(buf, "options")) {
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPath.java | 146 /** Represents a match type expression. */
147 public static final int MATCH = 1;
158 * @param type one of {@link #SELECT} or {@link #MATCH}.
179 else if (MATCH == type)
206 * @param type one of {@link #SELECT} or {@link #MATCH}.
228 else if (MATCH == type)
258 * @param type one of {@link #SELECT} or {@link #MATCH}.
463 * match pattern testing. */
467 * Get the match score of the given node.
613 * The match score if no match is made
[all...] |
| /external/chromium_org/ui/app_list/ |
| search_result.h | 38 MATCH = 1 << 1,
|
| /ndk/sources/host-tools/nawk-20071023/ |
| maketab.c | 73 { MATCH, "matchop", " ~ " },
|
| /external/chromium/chrome/browser/extensions/ |
| extension_omnibox_unittest.cc | 14 const int kMatch = ACMatchClassification::MATCH;
38 // Test output key: n = character with no styling, d = dim, m = match, u = url
47 AppendStyle("match", 1, 4, &styles_value);
65 AppendStyle("match", 1, 4, &styles_value);
81 AppendStyle("match", 9, 2, &styles_value);
82 AppendStyle("match", 0, 4, &styles_value);
98 // Try moving the "dim/match" style pair at offset 9. Output should be the
102 AppendStyle("match", 0, 4, &styles_value);
104 AppendStyle("match", 9, 2, &styles_value);
120 AppendStyle("match", 0, 5, &styles_value)
[all...] |
