Home
last modified time | relevance | path

Searched refs:first (Results 601 - 625 of 5813) sorted by relevance

1...<<21222324252627282930>>...233

/third_party/python/Lib/idlelib/
H A Dsearch.py35 pat = text.get("sel.first", "sel.last")
102 first = "%d.%d" % (line, i)
105 selfirst = text.index("sel.first")
107 if selfirst == first and sellast == last:
113 text.tag_add("sel", first, last)
114 text.mark_set("insert", self.engine.isback() and first or last)
125 Again does), this first resets the pattern to the currently
129 pat = text.get("sel.first", "sel.last")
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/CodeView/
H A DDebugStringTableSubsection.cpp53 IdToString.insert({P.first->getValue(), P.first->getKey()}); in insert()
57 return P.first->second; in insert()
92 Result.push_back(Entry.first); in sortedIds()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugAbbrev.cpp88 while (I != AbbrDeclSets.end() && I->first < Offset) in parse()
108 OS << format("Abbrev table for offset: 0x%8.8" PRIx64 "\n", I.first); in dump()
116 if (PrevAbbrOffsetPos != End && PrevAbbrOffsetPos->first == CUAbbrOffset) { in getAbbreviationDeclarationSet()
133 .first; in getAbbreviationDeclarationSet()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-set.h110 hb_codepoint_t first,
119 hb_codepoint_t first,
171 /* Pass HB_SET_VALUE_INVALID for first and last to get started. */
174 hb_codepoint_t *first,
177 /* Pass HB_SET_VALUE_INVALID for first and last to get started. */
180 hb_codepoint_t *first,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp17 // The transformation works by first assigning some initial values to the entry
106 // Edge includes information about the source. Hence ignore the first in run()
111 if (!Edge.first) in run()
113 assert(isa<Instruction>(Edge.first)); in run()
114 CallSite CS(cast<Instruction>(Edge.first)); in run()
141 Entry.first->setEntryCount(ProfileCount( in run()
H A DFunctionImport.cpp85 cl::desc("Only import first N functions if N>=0 (default -1)"));
169 /// FIXME: select "best" instead of first that fits. But what is "best"?
373 ValueInfo VI = Edge.first; in computeImportForFunction()
408 auto &ProcessedThreshold = std::get<0>(IT.first->second); in computeImportForFunction()
409 auto &CalleeSummary = std::get<1>(IT.first->second); in computeImportForFunction()
410 auto &FailureInfo = std::get<2>(IT.first->second); in computeImportForFunction()
502 // This is the first time this function was exported from its source in computeImportForFunction()
509 ExportList.insert(Edge.first); in computeImportForFunction()
553 auto VI = Index.getValueInfo(GVSummary.first); in ComputeImportForModule()
658 IsReadOrWriteOnlyVar(ExportPerModule.first(), V in checkVariableImport()
[all...]
H A DWholeProgramDevirt.cpp717 auto &VI = T.first; in updateIndexWPDForExports()
846 // Find the first non-available_externally linkage vtable initializer. in tryFindVirtualCallTargets()
1416 // least one argument, does not use its first argument (which we assume is in tryVirtualConstProp()
1435 if (!tryEvaluateFunctionsWithArgs(TargetsForSlot, CSByConstantArg.first)) in tryVirtualConstProp()
1440 ResByArg = &Res->ResByArg[CSByConstantArg.first]; in tryVirtualConstProp()
1446 ResByArg, Slot, CSByConstantArg.first)) in tryVirtualConstProp()
1489 exportConstant(Slot, CSByConstantArg.first, "byte", OffsetByte, in tryVirtualConstProp()
1491 exportConstant(Slot, CSByConstantArg.first, "bit", 1ULL << OffsetBit, in tryVirtualConstProp()
1720 auto I = Res.ResByArg.find(CSByConstantArg.first); in importResolution()
1734 importGlobal(Slot, CSByConstantArg.first, "unique_membe in importResolution()
[all...]
/third_party/rust/crates/regex/src/
H A Dre_bytes.rs146 /// Returns the start and end byte range of the leftmost-first match in
155 /// Find the start and end location of the first word with exactly 13
192 /// Returns the capture groups corresponding to the leftmost-first
331 /// Get the first two words in some text:
349 /// Replaces the leftmost-first match with the replacement provided. The
416 /// let re = Regex::new(r"(?P<last>[^,\s]+),\s+(?P<first>\S+)").unwrap();
417 /// let result = re.replace(b"Springsteen, Bruce", &b"$first $last"[..]);
422 /// Note that using `$2` instead of `$first` or `$1` instead of `$last`
433 /// let re = Regex::new(r"(?P<first>\w+)\s+(?P<second>\w+)").unwrap();
434 /// let result = re.replace(b"deep fried", &b"${first}
[all...]
H A Dre_unicode.rs201 /// Returns the start and end byte range of the leftmost-first match in
210 /// Find the start and end location of the first word with exactly 13
248 /// Returns the capture groups corresponding to the leftmost-first
384 /// Get the first two words in some text:
402 /// Replaces the leftmost-first match with the replacement provided.
465 /// let re = Regex::new(r"(?P<last>[^,\s]+),\s+(?P<first>\S+)").unwrap();
466 /// let result = re.replace("Springsteen, Bruce", "$first $last");
471 /// Note that using `$2` instead of `$first` or `$1` instead of `$last`
482 /// let re = Regex::new(r"(?P<first>\w+)\s+(?P<second>\w+)").unwrap();
483 /// let result = re.replace("deep fried", "${first}
[all...]
/third_party/protobuf/src/google/protobuf/
H A Ddescriptor_database.cc166 // symbol name. Since upper_bound() returns the *first* key that sorts
220 if (IsSubSymbol(iter->first, name)) { in AddSymbol()
224 << iter->first << "\"."; in AddSymbol()
230 // be so is the first symbol that is greater than the new symbol. Since in AddSymbol()
235 if (iter != by_symbol_.end() && IsSubSymbol(name, iter->first)) { in AddSymbol()
239 << iter->first << "\"."; in AddSymbol()
303 return (iter != by_symbol_.end() && IsSubSymbol(iter->first, name)) in FindSymbol()
322 for (; it != by_extension_.end() && it->first.first == containing_type; in FindAllExtensionNumbers()
324 output->push_back(it->first in FindAllExtensionNumbers()
[all...]
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-regalloc.cc161 ControlNode* first = in ComputePostDominatingHoles() local
171 while (first != second) { in ComputePostDominatingHoles()
173 if (first->id() > second->id()) std::swap(first, second); in ComputePostDominatingHoles()
175 // If the first branch returns or jumps back, we've found highest in ComputePostDominatingHoles()
178 if (first->Is<Return>() || first->Is<Deopt>() || in ComputePostDominatingHoles()
179 first->Is<JumpLoop>()) { in ComputePostDominatingHoles()
188 first = first in ComputePostDominatingHoles()
199 bool first = true; PrintLiveRegs() local
[all...]
/third_party/libabigail/src/
H A Dabg-reporter-priv.cc717 /// @param first the first type to consider.
727 report_size_and_alignment_changes(type_or_decl_base_sptr first, in report_size_and_alignment_changes() argument
733 type_base_sptr f = dynamic_pointer_cast<type_base>(first), in report_size_and_alignment_changes()
739 class_or_union_sptr first_class = is_class_or_union_type(first), in report_size_and_alignment_changes()
751 array_type_def_sptr first_array = is_array_type(is_type(first)), in report_size_and_alignment_changes()
878 /// @param first the first type to consider.
888 report_name_size_and_alignment_changes(decl_base_sptr first, in report_name_size_and_alignment_changes() argument
894 string fn = first in report_name_size_and_alignment_changes()
[all...]
H A Dabg-symtab-reader.cc332 const char* first = strings_data + offset; in load_()
334 const char* limit = std::find(first, last, 0); in load_()
338 if (first < limit) in load_()
340 name.substr(12), std::string(first, limit - first)).second); in load_()
424 const auto r = name_symbol_map_.find(crc_entry.first); in load_()
435 const auto r = name_symbol_map_.find(namespace_entry.first); in load_()
572 result.first->second->get_main_symbol()->add_alias(symbol_sptr);
630 const addr_symbol_map_type::const_iterator it = result.first;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DMCCodeView.cpp52 Filename = FilenameOffset.first; in addFile()
64 Filename = FilenameOffset.first; in addFile()
153 std::make_pair(Insertion.first->first(), Insertion.first->second); in addToStringTable()
156 Contents.append(Ret.first.begin(), Ret.first.end() + 1); in addToStringTable()
270 I.first->second.second = Offset + 1; in addLineEntry()
280 for (size_t Idx = I->second.first, End = I->second.second; Idx != End; in getFunctionLineEntries()
470 unsigned ChildId = KV.first;
[all...]
/third_party/typescript/tests/baselines/reference/tsbuild/outfile-concat/
H A DstripInternal.js17 //// [/src/first/first_PART1.ts]
31 //// [/src/first/first_part2.ts]
35 //// [/src/first/first_part3.ts]
40 //// [/src/first/tsconfig.json]
49 "outFile": "./bin/first-output.js",
150 { "path": "../first", "prepend": true },
161 * src/first/tsconfig.json
165 [12:00:10 AM] Project 'src/first/tsconfig.json' is out of date because output file 'src/first/bin/first
[all...]
/third_party/mesa3d/src/amd/vulkan/winsys/amdgpu/
H A Dradv_amdgpu_bo.c119 int first = 0, last; in radv_amdgpu_winsys_bo_virtual_bind() local
128 * will first unmap all existing VA that overlap the requested range and then map. in radv_amdgpu_winsys_bo_virtual_bind()
171 * [first, last] is exactly the range of ranges that either overlap the in radv_amdgpu_winsys_bo_virtual_bind()
175 while (first + 1 < parent->range_count && in radv_amdgpu_winsys_bo_virtual_bind()
176 parent->ranges[first].offset + parent->ranges[first].size < offset) in radv_amdgpu_winsys_bo_virtual_bind()
177 ++first; in radv_amdgpu_winsys_bo_virtual_bind()
179 last = first; in radv_amdgpu_winsys_bo_virtual_bind()
183 /* Whether the first or last range are going to be totally removed or just in radv_amdgpu_winsys_bo_virtual_bind()
184 * resized/left alone. Note that in the case of first in radv_amdgpu_winsys_bo_virtual_bind()
[all...]
/kernel/linux/linux-5.10/drivers/mtd/tests/
H A Dtorturetest.c376 int bytes, bits, pages, first; in report_corrupt() local
397 first = countdiffs(written, read, i, pgsize, &bytes, in report_corrupt()
399 if (first < 0) in report_corrupt()
408 bytes, bits, first); in report_corrupt()
410 offset = first & ~0x7; in report_corrupt()
411 len = ((first + bytes) | 0x7) + 1 - offset; in report_corrupt()
448 * Count the number of differing bytes and bits and return the first differing
456 int first = -1; in countdiffs() local
460 first = i; in countdiffs()
477 return first; in countdiffs()
[all...]
/kernel/linux/linux-6.6/drivers/mtd/tests/
H A Dtorturetest.c374 int bytes, bits, pages, first; in report_corrupt() local
395 first = countdiffs(written, read, i, pgsize, &bytes, in report_corrupt()
397 if (first < 0) in report_corrupt()
406 bytes, bits, first); in report_corrupt()
408 offset = first & ~0x7; in report_corrupt()
409 len = ((first + bytes) | 0x7) + 1 - offset; in report_corrupt()
446 * Count the number of differing bytes and bits and return the first differing
454 int first = -1; in countdiffs() local
458 first = i; in countdiffs()
475 return first; in countdiffs()
[all...]
/kernel/linux/linux-6.6/drivers/crypto/rockchip/
H A Drk3288_crypto.c36 struct rk_crypto_info *first; in get_rk_crypto() local
39 first = list_first_entry_or_null(&rocklist.dev_list, in get_rk_crypto()
43 return first; in get_rk_crypto()
319 struct rk_crypto_info *crypto_info, *first; in rk_crypto_probe() local
382 first = list_first_entry_or_null(&rocklist.dev_list, in rk_crypto_probe()
387 if (!first) { in rk_crypto_probe()
411 struct rk_crypto_info *first; in rk_crypto_remove() local
415 first = list_first_entry_or_null(&rocklist.dev_list, in rk_crypto_remove()
419 if (!first) { in rk_crypto_remove()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/rbbi/
H A DBreakIteratorTest.java51 for (int k = tb.first(); k != BreakIterator.DONE; k = tb.next()) in doOtherInvariantTest()
79 for (int k = tb.first(); k != BreakIterator.DONE; k = tb.next()) in doOtherInvariantTest()
186 if (wb.first() != 0) in TestEndBehavior()
347 filteredBI.first(); in TestFilteredBreakIteratorBuilder()
369 filteredBI.first(); in TestFilteredBreakIteratorBuilder()
391 filteredBI.first(); in TestFilteredBreakIteratorBuilder()
464 filteredBI.first(); in assertFrenchBreakBehavior()
477 filteredBI.first(); in assertEnglishBreakBehavior()
492 filteredBI.first(); in assertDefaultBreakBehavior()
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/
H A DBreakIteratorTest.java48 for (int k = tb.first(); k != BreakIterator.DONE; k = tb.next()) in doOtherInvariantTest()
76 for (int k = tb.first(); k != BreakIterator.DONE; k = tb.next()) in doOtherInvariantTest()
183 if (wb.first() != 0) in TestEndBehavior()
344 filteredBI.first(); in TestFilteredBreakIteratorBuilder()
366 filteredBI.first(); in TestFilteredBreakIteratorBuilder()
388 filteredBI.first(); in TestFilteredBreakIteratorBuilder()
461 filteredBI.first(); in assertFrenchBreakBehavior()
474 filteredBI.first(); in assertEnglishBreakBehavior()
489 filteredBI.first(); in assertDefaultBreakBehavior()
/third_party/libwebsockets/lib/jose/jwk/
H A Djose_key.c44 * The first version is used to parse a detached single jwk that don't have any
196 * there is no requirement for kty to be given first and eg, in cb_jwk()
198 * order - where kty is not first. in cb_jwk()
318 /* note: kty is not necessarily first... we have to keep track of in cb_jwk()
457 int n, m, limit, first = 1, asym = 0; in lws_jwk_export() local
498 if (!first) in lws_jwk_export()
500 first = 0; in lws_jwk_export()
505 if (!first) in lws_jwk_export()
507 first = 0; in lws_jwk_export()
548 if (!first) in lws_jwk_export()
[all...]
/third_party/mesa3d/src/compiler/nir/tests/
H A Dnegative_equal_tests.cpp29 nir_alu_type full_type, int first);
318 nir_alu_type full_type, int first) in count_sequence()
323 c[i].u16 = _mesa_float_to_half(float(i + first)); in count_sequence()
329 c[i].f32 = float(i + first); in count_sequence()
335 c[i].f64 = double(i + first); in count_sequence()
342 c[i].i8 = i + first; in count_sequence()
349 c[i].i16 = i + first; in count_sequence()
356 c[i].i32 = i + first; in count_sequence()
363 c[i].i64 = i + first; in count_sequence()
317 count_sequence(nir_const_value c[NIR_MAX_VEC_COMPONENTS], nir_alu_type full_type, int first) count_sequence() argument
/third_party/node/src/
H A Dnode_options-inl.h217 options_.emplace(pair.first, Convert(pair.second, get_child)); in Insert()
220 implications_.emplace(pair.first, Convert(pair.second, get_child)); in Insert()
240 // Generally, the idea here is that the first entry in `*underlying` stores
260 std::string& first() { in first() function
265 std::string ret = std::move(first()); in pop_first()
291 // The first entry is the process name. Make sure it ends up in the V8 argv, in Parse()
298 if (args.first().size() <= 1 || args.first()[0] != '-') break; in Parse()
353 !args.first().empty() && in Parse()
354 args.first()[ in Parse()
[all...]
/third_party/python/Lib/ctypes/test/
H A Dtest_callbacks.py256 ('first', c_ulong),
262 check.first = s.first
269 s.first = s.second = s.third = 0x0badf00d
273 s.first = 0xdeadbeef
284 self.assertEqual(check.first, s.first)
287 self.assertEqual(check.first, 0xdeadbeef)
292 self.assertEqual(s.first, check.first)
[all...]

Completed in 72 milliseconds

1...<<21222324252627282930>>...233