/third_party/vk-gl-cts/framework/delibs/decpp/ |
H A D | deDirectoryIterator.hpp | 60 void next (void);
|
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/wpa_supplicant/ |
H A D | ibss_rsn.h | 30 struct ibss_rsn_peer *next; member
|
/third_party/vulkan-loader/loader/ |
H A D | cJSON.h | 46 struct cJSON *next, *prev; /* next/prev allow you to walk array/object member
|
/device/soc/hisilicon/hi3516dv300/sdk_linux/drv/interdrv/common/hi_irq/kernel/ |
H A D | hiirq.c | 85 struct irq_strct *next; member 103 tmp->next = head; in add_list() 113 tmp = head->next; in free_list() 132 tmp = tmp->next; in get_list_node() 257 tmp2 = tmp->next; in del_list()
|
/device/soc/rockchip/common/sdk_linux/include/trace/events/ |
H A D | sched.h | 119 TP_PROTO(bool preempt, struct task_struct *prev, struct task_struct *next),
121 TP_ARGS(preempt, prev, next),
127 TP_fast_assign(memcpy(__entry->next_comm, next->comm, TASK_COMM_LEN); __entry->prev_pid = prev->pid;
130 memcpy(__entry->prev_comm, prev->comm, TASK_COMM_LEN); __entry->next_pid = next->pid;
131 __entry->next_prio = next->prio;
|
/third_party/ffmpeg/libavcodec/ |
H A D | h263dec.c | 407 "discarding %d junk bits at end, next would be %X\n", in decode_slice() 453 int next; in ff_h263_decode_frame() local 456 next = ff_mpeg4_find_frame_end(&s->parse_context, buf, buf_size); in ff_h263_decode_frame() 458 next = ff_h263_find_frame_end(&s->parse_context, buf, buf_size); in ff_h263_decode_frame() 460 next = ff_h263_find_frame_end(&s->parse_context, buf, buf_size); in ff_h263_decode_frame() 467 if (ff_combine_frame(&s->parse_context, next, (const uint8_t **)&buf, in ff_h263_decode_frame()
|
/third_party/elfutils/src/ |
H A D | elfcompress.c | 62 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 D | elfcmp.c | 103 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 D | dwfl_segment_report_module.c | 75 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 D | arecordmidi.c | 39 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 D | mixer.c | 618 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 D | rbbi.cpp | 597 * 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 D | pushbuf.c | 43 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 D | sb_bc_finalize.cpp | 11 * 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 D | rbbi.cpp | 567 * 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 D | gencnvex.c | 942 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 D | Ppmd7.c | 188 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 D | RangeTable.java | 901 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 D | traceback.c | 44 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 D | sljitLir.h | 270 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 D | dis.py | 396 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 D | RegisterScavenging.cpp | 183 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 D | gencnvex.c | 941 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 D | test_weakset.py | 359 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 D | rbbi.cpp | 583 * 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...] |