Home
last modified time | relevance | path

Searched refs:match (Results 276 - 300 of 6458) sorted by relevance

1...<<11121314151617181920>>...259

/third_party/libphonenumber/cpp/src/phonenumbers/
H A Dphonenumbermatcher.cc171 // extension to match the last group of the subscriber number. Note the in AllNumberGroupsRemainGrouped()
235 // A cache for popular reg-exps of leading digits used to match formatting
252 // Pattern to check that brackets match. Opening brackets should be closed
264 // Note that if there is a match, we will always check any text found up to
265 // the first match as well.
336 // consider it part of the phone number. Will match a pattern like in PhoneNumberMatcherRegExps()
465 PhoneNumberMatch* match) { in ParseAndVerify()
466 DCHECK(match); in ParseAndVerify()
516 match->set_start(offset); in ParseAndVerify()
517 match in ParseAndVerify()
464 ParseAndVerify(const string& candidate, int offset, PhoneNumberMatch* match) ParseAndVerify() argument
583 ExtractInnerMatch(const string& candidate, int offset, PhoneNumberMatch* match) ExtractInnerMatch() argument
619 ExtractMatch(const string& candidate, int offset, PhoneNumberMatch* match) ExtractMatch() argument
668 Next(PhoneNumberMatch* match) Next() argument
680 Find(int index, PhoneNumberMatch* match) Find() argument
[all...]
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.c18 * string matches are performed only when the previous match ends. So it
22 * is used to find longer strings when a small match has been found.
113 local void check_match OF((deflate_state *s, IPos start, IPos match,
140 ush good_length; /* reduce lazy search above this match length */
141 ush max_lazy; /* do not perform lazy search above this match length */
142 ush nice_length; /* quit search above this match length */
1245 * Initialize the "longest match" routines for a new zlib stream
1277 * Set match_start to the longest match starting at the given string and
1283 * OUT assertion: the match length is not greater than s->lookahead.
1286 /* For 80x86 and 680x0, an optimized version will be provided in match
1295 register Bytef *match; /* matched string */ global() local
1461 register Bytef *match; /* matched string */ global() local
[all...]
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.c18 * string matches are performed only when the previous match ends. So it
22 * is used to find longer strings when a small match has been found.
113 local void check_match OF((deflate_state *s, IPos start, IPos match,
140 ush good_length; /* reduce lazy search above this match length */
141 ush max_lazy; /* do not perform lazy search above this match length */
142 ush nice_length; /* quit search above this match length */
1237 * Initialize the "longest match" routines for a new zlib stream
1269 * Set match_start to the longest match starting at the given string and
1275 * OUT assertion: the match length is not greater than s->lookahead.
1278 /* For 80x86 and 680x0, an optimized version will be provided in match
1287 register Bytef *match; /* matched string */ global() local
1453 register Bytef *match; /* matched string */ global() local
[all...]
/kernel/linux/linux-5.10/drivers/base/power/
H A Dtrace.c165 * the match is valid).
185 int match; in show_file_hash() local
188 match = 0; in show_file_hash()
197 match++; in show_file_hash()
199 return match; in show_file_hash()
204 int match = 0; in show_dev_hash() local
214 match++; in show_dev_hash()
219 return match; in show_dev_hash()
231 * It's possible that multiple devices will match the hash and we can't in show_trace_dev_match()
/kernel/linux/linux-6.6/drivers/regulator/
H A Dmtk-dvfsrc-regulator.c17 #define MT_DVFSRC_REGULAR(match, _name, _volt_table) \
20 .name = match, \
21 .of_match = of_match_ptr(match), \
160 const struct of_device_id *match; in dvfsrc_vcore_regulator_probe() local
168 match = of_match_node(mtk_dvfsrc_regulator_match, dev->parent->of_node); in dvfsrc_vcore_regulator_probe()
170 if (!match) { in dvfsrc_vcore_regulator_probe()
175 regulator_init_data = match->data; in dvfsrc_vcore_regulator_probe()
/kernel/linux/linux-6.6/drivers/base/power/
H A Dtrace.c165 * the match is valid).
185 int match; in show_file_hash() local
188 match = 0; in show_file_hash()
197 match++; in show_file_hash()
199 return match; in show_file_hash()
204 int match = 0; in show_dev_hash() local
214 match++; in show_dev_hash()
219 return match; in show_dev_hash()
231 * It's possible that multiple devices will match the hash and we can't in show_trace_dev_match()
/kernel/linux/linux-6.6/arch/x86/include/asm/
H A Dtext-patching.h201 bool match;
204 match = regs->flags & jcc_mask[cc >> 1];
206 match = ((regs->flags & X86_EFLAGS_SF) >> X86_EFLAGS_SF_BIT) ^
209 match = match || (regs->flags & X86_EFLAGS_ZF);
212 if ((match && !invert) || (!match && invert))
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceClFlags.h164 return ForceO2.match(Name, Number); in matchForceO2()
167 return SplitInsts.match(Name, Number); in matchSplitInsts()
170 return TestStatus.match(Name, Number); in matchTestStatus()
173 return TimingFocus.match(Name, Number); in matchTimingFocus()
176 return TranslateOnly.match(Name, Number); in matchTranslateOnly()
179 return VerboseFocus.match(Name, Number); in matchVerboseFocusOn()
182 return VerboseFocus.match(Name, Number); in matchVerboseFocusOn()
/third_party/node/deps/v8/tools/wasm/
H A Dcode-size-factors.py24 match(line, liftoff_regex, liftoff_values)
25 match(line, turbofan_regex, turbofan_values)
33 def match(line, regex, array): function
34 m = regex.match(line)
40 m = wasm2js_regex.match(line)
/third_party/node/deps/npm/node_modules/spdx-expression-parse/
H A Dscan.js21 var match = chars.match(value)
22 if (match) {
23 index += match[0].length
24 return match[0]
/third_party/python/Tools/scripts/
H A Dfindnocoding.py39 match = decl_re.match(line)
40 if match:
41 return match.group(1)
63 blank_re.match(line1) and get_declaration(line2)):
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dmemutil.cc96 const char* match; in memmatch() local
100 while ((match = static_cast<const char*>( in memmatch()
102 if (memcmp(match, pneedle, neelen) == 0) in memmatch()
103 return match; in memmatch()
105 phaystack = match + 1; in memmatch()
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/
H A DIcuDataDumper.java179 LineMatch match = LineType.match(line, inBlockComment); in processLine()
180 checkState(match.getType().isValidTransitionFrom(lastType), in processLine()
181 "invalid state transition: %s --//-> %s", lastType, match.getType()); in processLine()
183 switch (match.getType()) { in processLine()
193 headerComment.add(match.get(0)); in processLine()
203 getPathFromStack().extendBy(getSegment(match.get(0))), in processLine()
204 RbValue.of(unquote(match.get(1)))); in processLine()
210 name = match.get(0); in processLine()
213 pathStack.push(getSegment(match in processLine()
356 static LineMatch match(String line, boolean inBlockComment) { match() method in IcuDataDumper.IcuDataParser.LineType
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp86 if (RotL.match(V) && L0 == R0 && L1 == R1) { in foldGuardedRotateToFunnelShift()
95 if (RotR.match(V) && L0 == R0 && L1 == R1) { in foldGuardedRotateToFunnelShift()
116 "Pattern must match funnel shift left or right"); in foldGuardedRotateToFunnelShift()
127 if (!match(TermI, m_Br(m_ICmp(Pred, m_Specific(RotAmt), m_ZeroInt()), in foldGuardedRotateToFunnelShift()
182 if (match(V, m_And(m_Value(Op0), m_One()))) { in matchAndOrChain()
186 if (match(V, m_And(m_Value(Op0), m_Value(Op1)))) in matchAndOrChain()
190 if (match(V, m_Or(m_Value(Op0), m_Value(Op1)))) in matchAndOrChain()
198 if (!match(V, m_LShr(m_Value(Candidate), m_ConstantInt(BitIndex)))) in matchAndOrChain()
223 // The 'any-bits-set' ('or' chain) pattern is simpler to match because the in foldAnyOrAllBitsSet()
226 if (match( in foldAnyOrAllBitsSet()
[all...]
/third_party/skia/third_party/externals/tint/tools/src/cmd/intrinsic-gen/parser/
H A Dparser.go86 for p.err == nil && p.match(tok.Rbrace) == nil {
105 if p.match(tok.Or) == nil {
127 if p.match(tok.Ldeco) == nil {
134 if p.match(tok.Lparen) != nil {
137 if p.match(tok.Comma) == nil {
168 if p.match(tok.Arrow) != nil {
178 if p.match(tok.Rparen) == nil {
181 if p.match(tok.Comma) == nil {
217 if p.match(tok.Lt) != nil {
220 if p.match(to
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Ddmi.c62 /* also match on somewhat unique bios-version */
73 /* also match on somewhat unique bios-version */
151 /* Above strings are too generic, also match on BIOS date */
161 const struct dmi_system_id *match; in brcmf_dmi_probe() local
169 for (match = dmi_first_match(dmi_platform_data); in brcmf_dmi_probe()
170 match; in brcmf_dmi_probe()
171 match = dmi_first_match(match + 1)) { in brcmf_dmi_probe()
172 data = match->driver_data; in brcmf_dmi_probe()
/kernel/linux/linux-6.6/drivers/platform/x86/intel/int3472/
H A Dtps68470_board_data.c197 const struct dmi_system_id *match; in int3472_tps68470_get_board_data() local
199 for (match = dmi_first_match(int3472_tps68470_board_data_table); in int3472_tps68470_get_board_data()
200 match; in int3472_tps68470_get_board_data()
201 match = dmi_first_match(match + 1)) { in int3472_tps68470_get_board_data()
202 board_data = match->driver_data; in int3472_tps68470_get_board_data()
/kernel/linux/linux-6.6/drivers/cpufreq/
H A Dsun50i-cpufreq-nvmem.c169 const struct of_device_id *match; in sun50i_cpufreq_match_node() local
173 match = of_match_node(sun50i_cpufreq_match_list, np); in sun50i_cpufreq_match_node()
176 return match; in sun50i_cpufreq_match_node()
186 const struct of_device_id *match; in sun50i_cpufreq_init() local
189 match = sun50i_cpufreq_match_node(); in sun50i_cpufreq_init()
190 if (!match) in sun50i_cpufreq_init()
/kernel/linux/linux-6.6/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Ddmi.c69 /* also match on somewhat unique bios-version */
80 /* also match on somewhat unique bios-version */
91 /* Above strings are too generic, also match on BIOS date */
169 /* Above strings are too generic, also match on BIOS date */
179 const struct dmi_system_id *match; in brcmf_dmi_probe() local
187 for (match = dmi_first_match(dmi_platform_data); in brcmf_dmi_probe()
188 match; in brcmf_dmi_probe()
189 match = dmi_first_match(match + 1)) { in brcmf_dmi_probe()
190 data = match in brcmf_dmi_probe()
[all...]
/kernel/linux/linux-6.6/tools/testing/kunit/
H A Dkunit_config.py95 match = config_matcher.match(line)
96 if match:
97 kconfig.add_entry(match.group(1), match.group(2))
100 empty_match = is_not_set_matcher.match(line)
/third_party/astc-encoder/Test/
H A Dastc_profile_valgrind.py52 match = pattern.match(line)
53 if not match:
56 cost = float(match.group(1).replace(",", ""))
57 sourceFile = match.group(2)
58 function = match.group(3)
/third_party/benchmark/tools/
H A Dstrip_asm.py16 m = label_re.match(l)
26 m = label_decl.match(l)
45 m = label_decl.match(l)
108 if reg.match(l) is not None:
112 if reg.match(l) is not None:
116 if fn_label_def.match(l) and len(new_contents) != 0:
/third_party/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
H A DIntDiffer.java24 * @param matchCount The number of items that have to be the same to count as a match
60 * Checks for initial & final match.
87 int match = find(a, aCount-EQUALSIZE, aCount, b, maxSame, bCount); in checkMatch()
88 if (match != -1) { in checkMatch()
90 bTop = match; in checkMatch()
93 match = find(b, bCount-EQUALSIZE, bCount, a, maxSame, aCount); in checkMatch()
94 if (match != -1) { in checkMatch()
96 aTop = match; in checkMatch()
118 return i; // we have a match! in find()
/third_party/node/test/fixtures/wpt/streams/transform-streams/
H A Dlipfuzz.any.js22 const match = partialAtEndRegexp.exec(chunk);
23 if (match) {
24 this.partialChunk = chunk.substring(match.index);
25 chunk = chunk.substring(0, match.index);
36 replaceTag(match, p1, offset) {
153 assert_equals(value, outputChunk, `value should match outputChunk`);
/third_party/node/test/abort/
H A Dtest-addon-uv-handle-leak.js67 (line) => line.match(/libc\.so.+=>\s*(\S+)\s/)).filter((info) => info);
94 assert.match(line, /^uv loop at \[.+\] has open handles:$/);
102 assert.match(line, /^\[.+\] timer( \(active\))?$/);
106 assert.match(line, /^Close callback:/);
110 assert.match(line, /^Data: .+$/);
120 assert.match(line, /Assertion .+ failed/);

Completed in 13 milliseconds

1...<<11121314151617181920>>...259