| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ExecutionEngine/Orc/ |
| H A D | IndirectionUtils.h | 312 createStubInternal(Entry.first(), Entry.second.first, 323 auto Key = I->second.first; 324 void *StubAddr = IndirectStubsInfos[Key.first].getStub(Key.second); 339 auto Key = I->second.first; 340 void *PtrAddr = IndirectStubsInfos[Key.first].getPtr(Key.second); 353 auto Key = I->second.first; 355 IndirectStubsInfos[Key.first].getPtr(Key.second)); 381 *IndirectStubsInfos[Key.first].getPtr(Key.second) = in createStubInternal() 439 /// This function can be used as the first ste [all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/ |
| H A D | InstrProfWriter.cpp | 146 if (NamedInstrProfRecord::hasCSFlagInHash(ProfileData.first)) in EmitData() 151 LE.write<uint64_t>(ProfileData.first); // Function hash in EmitData() 256 addRecord(I.getKey(), Func.first, std::move(Func.second), 1, Warn); in mergeRecordsFromWriter() 460 return std::tie(A.first, A.second.first) < in writeText() 461 std::tie(B.first, B.second.first); in writeText() 465 const StringRef &Name = record.first; in writeText() 467 writeRecordInText(Name, Func.first, Func.second, Symtab, OS); in writeText()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| H A D | SIFormMemoryClauses.cpp | 131 break; // Only check the first def. in isValidClauseInst() 283 Loc->second.first |= State; in collectRegUses() 376 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) { in runOnMachineFunction() 377 unsigned S = R.second.first | RegState::EarlyClobber; in runOnMachineFunction() 380 B.addDef(R.first, S, SubReg); in runOnMachineFunction() 385 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) { in runOnMachineFunction() 386 B.addUse(R.first, R.second.first & ~RegState::Kill, SubReg); in runOnMachineFunction() 391 unsigned Reg = R.first; in runOnMachineFunction() 400 unsigned Reg = R.first; in runOnMachineFunction() [all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| H A D | HexagonMCTargetDesc.cpp | 152 auto HeadTail = PacketBundle.first.split('\n'); 156 while (!HeadTail.first.empty()) { 158 auto Duplex = HeadTail.first.split('\v'); 160 OS << Indent << Duplex.first << Separator; 162 } else if (!HeadTail.first.trim().startswith("immext")) { 163 InstTxt = Duplex.first; 329 Result.first = Hexagon_MC::selectHexagonCPU(CPU); in selectCPUAndFS() 330 Result.second = selectHexagonFS(Result.first, FS); in selectCPUAndFS() 389 StringRef CPUName = Features.first; in createHexagonMCSubtargetInfo()
|
| /third_party/rust/crates/proc-macro2/src/ |
| H A D | parse.rs | 183 let first = match input.bytes().next() { 184 Some(first) => first, 198 if let Some(open_delimiter) = match first { 210 } else if let Some(close_delimiter) = match first { 661 let first = next_ch!(chars @ '0'..='9' | 'a'..='f' | 'A'..='F'); in backslash_x_nonzero() 663 if first == '0' && second == '0' { in backslash_x_nonzero() 899 let first = match chars.next() { in punct_char() 906 if recognized.contains(first) { in punct_char() 907 Ok((input.advance(first in punct_char() [all...] |
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_set.h | 510 size_t SelectBucketCountForIterRange(InputIter first, InputIter last, 520 static_cast<size_t>(std::distance(first, last))); 551 // - In small mode only the first `capacity()` control bytes after the 564 // pointer to the first empty or deleted slot. 883 raw_hash_set(InputIter first, InputIter last, size_t bucket_count = 0, 886 : raw_hash_set(SelectBucketCountForIterRange(first, last, bucket_count), 888 insert(first, last); 892 raw_hash_set(InputIter first, InputIter last, size_t bucket_count, 894 : raw_hash_set(first, last, bucket_count, hash, key_equal(), alloc) {} 897 raw_hash_set(InputIter first, InputIte [all...] |
| /kernel/linux/linux-5.10/arch/sparc/kernel/ |
| H A D | unaligned_64.c | 451 u64 first = 0, second = 0; in handle_ldf_stq() local 461 first = *(u64 *)&f->regs[freg]; in handle_ldf_stq() 475 u64 tmp = __swab64p(&first); in handle_ldf_stq() 477 first = __swab64p(&second); in handle_ldf_stq() 488 if (put_user (first >> 32, (u32 __user *)addr) || in handle_ldf_stq() 489 __put_user ((u32)first, (u32 __user *)(addr + 4)) || in handle_ldf_stq() 614 u32 first, second; in handle_lddfmna() local 620 first = second = 0; in handle_lddfmna() 621 err = get_user(first, (u32 __user *)sfar); in handle_lddfmna() 627 first in handle_lddfmna() [all...] |
| /kernel/linux/linux-6.6/arch/sparc/kernel/ |
| H A D | unaligned_64.c | 451 u64 first = 0, second = 0; in handle_ldf_stq() local 461 first = *(u64 *)&f->regs[freg]; in handle_ldf_stq() 475 u64 tmp = __swab64p(&first); in handle_ldf_stq() 477 first = __swab64p(&second); in handle_ldf_stq() 488 if (put_user (first >> 32, (u32 __user *)addr) || in handle_ldf_stq() 489 __put_user ((u32)first, (u32 __user *)(addr + 4)) || in handle_ldf_stq() 614 u32 first, second; in handle_lddfmna() local 620 first = second = 0; in handle_lddfmna() 621 err = get_user(first, (u32 __user *)sfar); in handle_lddfmna() 627 first in handle_lddfmna() [all...] |
| /kernel/linux/linux-5.10/fs/xfs/libxfs/ |
| H A D | xfs_rtbitmap.c | 90 * Searching backward from start to limit, find the first block whose 107 xfs_rtblock_t firstbit; /* first useful bit in the word */ in xfs_rtfind_back() 125 * Get the first word's index & point to it. in xfs_rtfind_back() 142 * Calculate first (leftmost) bit number to look at, in xfs_rtfind_back() 237 * Calculate first (leftmost) bit number to look at, in xfs_rtfind_back() 265 * Searching forward from start to limit, find the first block whose 300 * Get the first word's index & point to it. in xfs_rtfind_forw() 478 * If there was an old one, get rid of it first. in xfs_rtmodify_summary_int() 497 uint first = (uint)((char *)sp - (char *)bp->b_addr); in xfs_rtmodify_summary_int() local 506 xfs_trans_log_buf(tp, bp, first, firs in xfs_rtmodify_summary_int() 545 xfs_rtword_t *first; /* first used word in the buffer */ xfs_rtmodify_range() local [all...] |
| /kernel/linux/linux-5.10/fs/reiserfs/ |
| H A D | prints.c | 442 static int print_internal(struct buffer_head *bh, int first, int last) in print_internal() argument 454 if (first == -1) { in print_internal() 458 from = first; in print_internal() 477 static int print_leaf(struct buffer_head *bh, int print_mode, int first, in print_leaf() argument 504 if (first < 0 || first > nr - 1) in print_leaf() 507 from = first; in print_leaf() 585 printk("Journal block (first) %d\n", sb_jp_journal_1st_block(rs)); in print_super_block() 610 /* ..., int print_mode, int first, int last) */ 614 int mode, first, las in print_block() local [all...] |
| /kernel/linux/linux-6.6/fs/xfs/libxfs/ |
| H A D | xfs_rtbitmap.c | 90 * Searching backward from start to limit, find the first block whose 107 xfs_rtblock_t firstbit; /* first useful bit in the word */ in xfs_rtfind_back() 125 * Get the first word's index & point to it. in xfs_rtfind_back() 142 * Calculate first (leftmost) bit number to look at, in xfs_rtfind_back() 237 * Calculate first (leftmost) bit number to look at, in xfs_rtfind_back() 265 * Searching forward from start to limit, find the first block whose 300 * Get the first word's index & point to it. in xfs_rtfind_forw() 478 * If there was an old one, get rid of it first. in xfs_rtmodify_summary_int() 497 uint first = (uint)((char *)sp - (char *)bp->b_addr); in xfs_rtmodify_summary_int() local 506 xfs_trans_log_buf(tp, bp, first, firs in xfs_rtmodify_summary_int() 545 xfs_rtword_t *first; /* first used word in the buffer */ xfs_rtmodify_range() local [all...] |
| /kernel/linux/linux-6.6/fs/reiserfs/ |
| H A D | prints.c | 442 static int print_internal(struct buffer_head *bh, int first, int last) in print_internal() argument 454 if (first == -1) { in print_internal() 458 from = first; in print_internal() 477 static int print_leaf(struct buffer_head *bh, int print_mode, int first, in print_leaf() argument 504 if (first < 0 || first > nr - 1) in print_leaf() 507 from = first; in print_leaf() 585 printk("Journal block (first) %d\n", sb_jp_journal_1st_block(rs)); in print_super_block() 610 /* ..., int print_mode, int first, int last) */ 614 int mode, first, las in print_block() local [all...] |
| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_buf_item.c | 66 void *first, *last; in xfs_buf_item_straddle() local 68 first = xfs_buf_offset(bp, offset + (first_bit << XFS_BLF_SHIFT)); in xfs_buf_item_straddle() 72 if (last - first != nbits * XFS_BLF_CHUNK) in xfs_buf_item_straddle() 135 /* Count the first bit we jumped out of the above loop from */ in xfs_buf_item_size_segment() 392 * given log buf item. It fills the first entry with a buf log 892 * Mark bytes first through last inclusive as dirty in the buf 897 uint first, in xfs_buf_item_log_segment() 911 ASSERT(first < XFS_BLF_DATAMAP_SIZE * XFS_BLF_CHUNK * NBWORD); in xfs_buf_item_log_segment() 917 first_bit = first >> XFS_BLF_SHIFT; in xfs_buf_item_log_segment() 926 * Get a pointer to the first wor in xfs_buf_item_log_segment() 896 xfs_buf_item_log_segment( uint first, uint last, uint *map) xfs_buf_item_log_segment() argument 980 xfs_buf_item_log( struct xfs_buf_log_item *bip, uint first, uint last) xfs_buf_item_log() argument [all...] |
| /third_party/gn/src/gn/ |
| H A D | scope.cc | 141 return found->first; in GetStorageKey() 188 if (IsPrivateVar(cur.first)) in RemovePrivateIdentifiers() 189 to_remove.push_back(cur.first); in RemovePrivateIdentifiers() 229 excluded_values.find(std::string(cur.first)) != excluded_values.end()) { in MarkAllUsed() 259 "You set the variable \"" + std::string(pair.first) + in CheckForUnusedVars() 289 (*output)[pair.first] = pair.second.value; in GetCurrentScopeValues() 301 const Value* v = other->GetValue(pair.first); in CheckCurrentScopeValuesEqual() 316 const std::string_view current_name = pair.first; in NonRecursiveMergeTo() 353 const std::string& current_name = pair.first; in NonRecursiveMergeTo() 399 const std::string& current_name = pair.first; in NonRecursiveMergeTo() [all...] |
| /third_party/pulseaudio/src/pulsecore/ |
| H A D | core.c | 645 * bool first: is cause_to_check the first cause to be written? 649 #define CHECK_CAUSE(p, first, cause_bitfield, cause_to_check) \ 652 if (!first) { \ 656 first = false; \ 663 bool first = true; in pa_suspend_cause_to_string() local 665 CHECK_CAUSE(p, first, cause_bitfield, USER); in pa_suspend_cause_to_string() 666 CHECK_CAUSE(p, first, cause_bitfield, APPLICATION); in pa_suspend_cause_to_string() 667 CHECK_CAUSE(p, first, cause_bitfield, IDLE); in pa_suspend_cause_to_string() 668 CHECK_CAUSE(p, first, cause_bitfiel in pa_suspend_cause_to_string() [all...] |
| /third_party/python/Lib/test/test_email/ |
| H A D | test_message.py | 9 def first(iterable): function 43 # The first argument is a triple (related, html, plain) of indices into the 46 # when passed to get_body (ie: the "first" part of that type in the 50 # that should be returned by a call to 'iter_parts'. Note that the first 357 # first one if there isn't any start parameter. That is, this is a 456 self.assertEqual(m.get_body(), first(expected)) 459 first(expected)) 461 first(expected[related:html+1])) 463 first([expected[related], expected[plain]])) 465 first(expecte [all...] |
| /kernel/linux/linux-5.10/arch/c6x/platforms/ |
| H A D | timer64.c | 171 struct device_node *np, *first = NULL; in timer64_init() local 182 } else if (!first) in timer64_init() 183 first = np; in timer64_init() 186 /* try first one with no core-mask */ in timer64_init() 187 if (first) in timer64_init() 188 np = of_node_get(first); in timer64_init()
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/ |
| H A D | intel_gt_requests.c | 92 struct intel_timeline *first; in add_retire() local 104 first = READ_ONCE(engine->retire); in add_retire() 106 tl->retire = ptr_pack_bits(first, 1, 1); in add_retire() 107 while (!try_cmpxchg(&engine->retire, &first, tl)); in add_retire() 109 return !first; in add_retire()
|
| /kernel/linux/linux-5.10/kernel/ |
| H A D | async.c | 83 struct async_entry *first = NULL; in lowest_in_progress() local 91 first = list_first_entry(&domain->pending, in lowest_in_progress() 95 first = list_first_entry(&async_global_pending, in lowest_in_progress() 99 if (first) in lowest_in_progress() 100 ret = first->cookie; in lowest_in_progress() 107 * pick the first pending entry and run it
|
| /kernel/linux/linux-6.6/kernel/ |
| H A D | async.c | 89 struct async_entry *first = NULL; in lowest_in_progress() local 97 first = list_first_entry(&domain->pending, in lowest_in_progress() 101 first = list_first_entry(&async_global_pending, in lowest_in_progress() 105 if (first) in lowest_in_progress() 106 ret = first->cookie; in lowest_in_progress() 113 * pick the first pending entry and run it
|
| /third_party/cups-filters/filter/foomatic-rip/ |
| H A D | pdf.c | 113 * Extract pages 'first' through 'last' from the pdf and write them into a 118 int first, in pdf_extract_pages() 125 _log("Extracting pages %d through %d\n", first, last); in pdf_extract_pages() 136 if (first > 1) in pdf_extract_pages() 138 snprintf(first_arg, 50, "-dFirstPage=%d", first); in pdf_extract_pages() 139 if (last >= first) in pdf_extract_pages() 194 * first/last page on the command line */ in render_pages_with_ghostscript() 116 pdf_extract_pages(char filename[PATH_MAX], const char *pdffilename, int first, int last) pdf_extract_pages() argument
|
| /third_party/icu/icu4c/source/common/unicode/ |
| H A D | normalizer2.h | 238 * This function calls edits->reset() first unless 251 * Appends the normalized form of the second string to the first string 252 * (merging them at the boundary) and returns the first string. 253 * The result is normalized if the first string was normalized. 254 * The first and second strings must be different objects. 255 * @param first string, should be normalized 261 * @return first 265 normalizeSecondAndAppend(UnicodeString &first, 269 * Appends the second string to the first string 270 * (merging them at the boundary) and returns the first strin [all...] |
| /third_party/node/lib/internal/source_map/ |
| H A D | source_map.js | 177 let first = 0; 181 const middle = first + step; 187 first = middle; 191 const entry = this.#mappings[first]; 192 if (!first && entry && (lineOffset < entry[0] ||
|
| /third_party/musl/porting/linux/user/src/thread/ |
| H A D | pthread_cond_timedwait.c | 174 /* Lock barrier first to control wake order. */ in __pthread_cond_timedwait() 224 struct waiter *p, *first = 0; in __private_cond_signal() local 244 if (!first) { in __private_cond_signal() 245 first = p; in __private_cond_signal() 268 /* Allow first signaled waiter, if any, to proceed. */ in __private_cond_signal() 269 if (first) { in __private_cond_signal() 270 unlock(&first->barrier); in __private_cond_signal()
|
| /third_party/node/deps/icu-small/source/common/unicode/ |
| H A D | normalizer2.h | 260 * This function calls edits->reset() first unless 273 * Appends the normalized form of the second string to the first string 274 * (merging them at the boundary) and returns the first string. 275 * The result is normalized if the first string was normalized. 276 * The first and second strings must be different objects. 277 * @param first string, should be normalized 283 * @return first 287 normalizeSecondAndAppend(UnicodeString &first, 291 * Appends the second string to the first string 292 * (merging them at the boundary) and returns the first strin [all...] |