Home
last modified time | relevance | path

Searched refs:next (Results 5826 - 5850 of 12994) sorted by relevance

1...<<231232233234235236237238239240>>...520

/third_party/elfutils/src/
H A Delfcompress.c62 struct section_pattern *next; member
72 p->next = patterns; in add_pattern()
83 pattern = p->next; in free_patterns()
149 if (foutput != NULL && state->argc - state->next > 1) in parse_opt()
169 pattern = pattern->next; in section_name_matches()
H A Delfcmp.c103 struct region *next; member
295 newp->next = regions; in main()
574 ehdr_region.next = &phdr_region; in main()
578 phdr_region.next = regions; in main()
605 regions = regions->next; in main()
/third_party/elfutils/libdwfl/
H A Ddwfl_segment_report_module.c75 addr_segndx (Dwfl *dwfl, size_t segment, GElf_Addr addr, bool next) in addr_segndx() argument
83 return next ? ndx + 1 : ndx; in addr_segndx()
87 if (next) in addr_segndx()
722 module != NULL; module = module->next) in dwfl_segment_report_module()
750 module != NULL; module = module->next) in dwfl_segment_report_module()
/third_party/alsa-utils/seq/aplaymidi/
H A Darecordmidi.c39 struct buffer *next; member
396 track->cur_buf->next = calloc(1, sizeof(struct buffer)); in add_byte()
397 if (!track->cur_buf->next) in add_byte()
399 track->cur_buf = track->cur_buf->next; in add_byte()
656 for (buf = &tracks[i].first_buf; buf; buf = buf->next) in write_file()
/third_party/alsa-lib/src/mixer/
H A Dmixer.c618 c = list_entry(mixer->classes.next, snd_mixer_class_t, list); in snd_mixer_close()
628 s = list_entry(mixer->slaves.next, snd_mixer_slave_t, list); in snd_mixer_close()
804 return list_entry(mixer->elems.next, snd_mixer_elem_t, list); in snd_mixer_first_elem()
821 * \brief get next mixer element
823 * \return pointer to next element
828 if (elem->list.next == &elem->class->mixer->elems) in snd_mixer_elem_next()
830 return list_entry(elem->list.next, snd_mixer_elem_t, list); in snd_mixer_elem_next()
/third_party/icu/icu4c/source/common/
H A Drbbi.cpp597 * equivalent to repeatedly calling next() or previous().
603 int32_t RuleBasedBreakIterator::next(int32_t n) { in next() function in RuleBasedBreakIterator
607 result = next(); in next()
620 * Advances the iterator to the next boundary position.
623 int32_t RuleBasedBreakIterator::next(void) { in next() function in RuleBasedBreakIterator
624 fBreakCache->next(); in next()
723 next(); in isBoundary()
899 // State Transition - move machine to its next state in handleNext()
949 // Advance to the next character. in handleNext()
951 // the input position. The next iteratio in handleNext()
[all...]
/third_party/libdrm/nouveau/
H A Dpushbuf.c43 struct nouveau_pushbuf_krec *next; member
391 krec = krec->next; in pushbuf_submit()
411 krec->next = malloc(sizeof(*krec)); in pushbuf_flush()
412 nvpb->krec = krec->next; in pushbuf_flush()
624 nvpb->list = krec->next; in nouveau_pushbuf_del()
654 /* switch to next buffer if insufficient space in the current one */ in nouveau_pushbuf_space()
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_bc_finalize.cpp11 * The above copyright notice and this permission notice (including the next
216 bool has_else = n_if->next; in finalize_if()
980 if (c->jump_target->next == NULL) { in cf_peephole()
983 last_cf = static_cast<cf_node*>(c->jump_target->next); in cf_peephole()
985 c->jump_target = static_cast<cf_node*>(c->jump_target->next); in cf_peephole()
999 } else if (c->is_cf_op(CF_OP_JUMP) && c->jump_target == c->next) { in cf_peephole()
/third_party/node/deps/icu-small/source/common/
H A Drbbi.cpp567 * equivalent to repeatedly calling next() or previous().
573 int32_t RuleBasedBreakIterator::next(int32_t n) { in next() function in RuleBasedBreakIterator
577 result = next(); in next()
590 * Advances the iterator to the next boundary position.
593 int32_t RuleBasedBreakIterator::next() { in next() function in RuleBasedBreakIterator
594 fBreakCache->next(); in next()
693 next(); in isBoundary()
869 // State Transition - move machine to its next state in handleNext()
919 // Advance to the next character. in handleNext()
921 // the input position. The next iteratio in handleNext()
[all...]
/third_party/icu/icu4c/source/tools/makeconv/
H A Dgencnvex.c942 UChar32 c, next; in generateFromUTrie() local
959 next=codePoints[0]; in generateFromUTrie()
964 c=next; in generateFromUTrie()
965 while(next==c && ++subLimit<mapLength) { in generateFromUTrie()
968 next=codePoints[0]; in generateFromUTrie()
/third_party/lzma/C/
H A DPpmd7.c188 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i]; in Ppmd7_GlueFreeBlocks() local
190 while (next != 0) in Ppmd7_GlueFreeBlocks()
193 CPpmd7_Node_Union *un = (CPpmd7_Node_Union *)NODE(next); in Ppmd7_GlueFreeBlocks()
194 const CPpmd7_Node_Ref tmp = next; in Ppmd7_GlueFreeBlocks()
195 next = un->NextRef; in Ppmd7_GlueFreeBlocks()
495 // All new RAW-Successors will point to next position in RAW text in Ppmd7_CreateSuccessors()
643 // So the next context will be one order higher than MinContext. in Ppmd7_UpdateModel()
687 And next context will be same 0-order root Context. in Ppmd7_UpdateModel()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeTable.java901 private static Row of(RangeTree row, Column<?> col, Optional<?> val, Row next) { in of() argument
904 row, new AutoValue_RangeTable_Cell(Assignment.ofOptional(col, val), next.head())); in of()
929 public Assignment<?> next() { in iterator()
934 cur = cur.next(); in iterator()
949 @Nullable abstract Cell next(); in next() method in RangeTable.Cell
/third_party/python/Python/
H A Dtraceback.c44 tb_create_raw(PyTracebackObject *next, PyFrameObject *frame, int lasti, in tb_create_raw() argument
48 if ((next != NULL && !PyTraceBack_Check(next)) || in tb_create_raw()
55 Py_XINCREF(next); in tb_create_raw()
56 tb->tb_next = next; in tb_create_raw()
/third_party/pcre2/pcre2/src/sljit/
H A DsljitLir.h270 stored in SLJIT_S0, the next one in SLJIT_S1, and so on. The integer
377 struct sljit_memory_fragment *next; member
384 struct sljit_label *next; member
391 struct sljit_jump *next; member
402 struct sljit_put_label *next; member
409 struct sljit_const *next; member
/third_party/python/Lib/
H A Ddis.py396 b = next(iterator)
400 b = next(iterator)
451 positions = Positions(*next(co_positions, ()))
501 next(co_positions, ())
516 Positions(*next(co_positions, ()))
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DRegisterScavenging.cpp183 MBBI = std::next(MBBI); in forward()
410 // add the regs used/defed by std::next(From) to the set. in findSurvivorBackwards()
412 Used.accumulate(*std::next(From)); in findSurvivorBackwards()
607 RestoreAfter ? std::next(MBBI) : MBBI; in scavengeRegisterBackwards()
608 MachineBasicBlock::iterator ReloadBefore = std::next(ReloadAfter); in scavengeRegisterBackwards()
688 // Move RegScavenger to the position between *I and *std::next(I). in scavengeFrameVirtualRegsInBlock()
691 // Look for unassigned vregs in the uses of *std::next(I). in scavengeFrameVirtualRegsInBlock()
693 MachineBasicBlock::iterator N = std::next(I); in scavengeFrameVirtualRegsInBlock()
727 // step in the next iteration if there was none. in scavengeFrameVirtualRegsInBlock()
/third_party/skia/third_party/externals/icu/source/tools/makeconv/
H A Dgencnvex.c941 UChar32 c, next; in generateFromUTrie() local
958 next=codePoints[0]; in generateFromUTrie()
963 c=next; in generateFromUTrie()
964 while(next==c && ++subLimit<mapLength) { in generateFromUTrie()
967 next=codePoints[0]; in generateFromUTrie()
/third_party/python/Lib/test/
H A Dtest_weakset.py359 next(it) # Trigger internal iteration
378 yielded = ustr(str(next(it)))
384 next(it)
413 next(it)
436 # All items will be collected at next garbage collection pass
439 next(it)
/third_party/skia/third_party/externals/icu/source/common/
H A Drbbi.cpp583 * equivalent to repeatedly calling next() or previous().
589 int32_t RuleBasedBreakIterator::next(int32_t n) { in next() function in RuleBasedBreakIterator
593 result = next(); in next()
606 * Advances the iterator to the next boundary position.
609 int32_t RuleBasedBreakIterator::next(void) { in next() function in RuleBasedBreakIterator
610 fBreakCache->next(); in next()
709 next(); in isBoundary()
885 // State Transition - move machine to its next state in handleNext()
935 // Advance to the next character. in handleNext()
937 // the input position. The next iteratio in handleNext()
[all...]
/third_party/rust/crates/proc-macro2/src/
H A Dfallback.rs815 let first = chars.next().unwrap(); in validate_ident()
983 while let Some(ch) = chars.next() { in string()
988 .starts_with(|next| '0' <= next && next <= '7') in string()
1023 while let Some(&b) = bytes.next() { in byte_string()
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/crypto/
H A Dcrypto_linux.c609 u8 pkey[8], next, tmp; in des_encrypt() local
621 next = 0; in des_encrypt()
624 pkey[i] = (tmp >> i) | next | 1; in des_encrypt()
625 next = tmp << (7 - i); in des_encrypt()
627 pkey[i] = next | 1; in des_encrypt()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/crypto/
H A Dcrypto_linux.c609 u8 pkey[8], next, tmp; in des_encrypt() local
621 next = 0; in des_encrypt()
624 pkey[i] = (tmp >> i) | next | 1; in des_encrypt()
625 next = tmp << (7 - i); in des_encrypt()
627 pkey[i] = next | 1; in des_encrypt()
/third_party/vulkan-loader/loader/
H A Dunknown_ext_chain_gas_x86.S25 # jump to the next function in the call chain
60 cmp qword ptr [rax + (DISPATCH_OFFSET_ICD_TERM + (PTR_SIZE * \num))], 0 # Check if the next function in the chain is NULL
63 jmp [rax + (DISPATCH_OFFSET_ICD_TERM + (PTR_SIZE * \num))] # Jump to the next function in the chain
113 cmp dword ptr [eax + (DISPATCH_OFFSET_ICD_TERM + (PTR_SIZE * \num))], 0 # Check if the next function in the chain is NULL
117 jmp [eax + (DISPATCH_OFFSET_ICD_TERM + (PTR_SIZE * \num))] # Jump to the next function in the chain
/kernel/linux/linux-5.10/tools/perf/util/
H A Dprobe-event.c1719 fieldp = &(*fieldp)->next; in parse_perf_probe_arg()
1971 field = field->next; in synthesize_perf_probe_arg()
2061 if (ref->next) { in __synthesize_probe_trace_arg_ref()
2062 depth = __synthesize_probe_trace_arg_ref(ref->next, buf, in __synthesize_probe_trace_arg_ref()
2090 ref = ref->next; in synthesize_probe_trace_arg()
2304 struct perf_probe_arg_field *field, *next; in clear_perf_probe_event() local
2318 next = field->next; in clear_perf_probe_event()
2321 field = next; in clear_perf_probe_event()
2365 field = field->next; in perf_probe_arg__copy()
2403 struct probe_trace_arg_ref *ref, *next; clear_probe_trace_event() local
[all...]
/kernel/linux/linux-5.10/mm/
H A Dshmem.c105 pgoff_t next; /* the next page offset to be fallocated */ member
524 LIST_HEAD(list), *pos, *next; in shmem_unused_huge_shrink() local
536 list_for_each_safe(pos, next, &sbinfo->shrinklist) { in shmem_unused_huge_shrink()
545 goto next; in shmem_unused_huge_shrink()
552 goto next; in shmem_unused_huge_shrink()
556 next: in shmem_unused_huge_shrink()
563 list_for_each_safe(pos, next, &to_remove) { in shmem_unused_huge_shrink()
570 list_for_each_safe(pos, next, &list) { in shmem_unused_huge_shrink()
713 next in shmem_add_to_page_cache()
1322 struct shmem_inode_info *info, *next; shmem_unuse() local
[all...]

Completed in 48 milliseconds

1...<<231232233234235236237238239240>>...520