/drivers/peripheral/user_auth/hdi_service/utils/src/ |
H A D | linked_list.c | 45 node->next = list->head; in InsertNode() 68 node = node->next; in RemoveNode() 74 list->head = node->next; in RemoveNode() 76 pre->next = node->next; in RemoveNode() 79 node->next = NULL; in RemoveNode() 114 iterator->current = current->next; in IteratorNext() 131 iterator->next = IteratorNext; in CreateIterator() 186 list->head = node->next; in DestroyLinkedList()
|
/third_party/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions 93 stage->next->tri( stage->next, &tmp ); in twoside_tri() 96 stage->next->tri( stage->next, header ); in twoside_tri() 148 stage->next->flush( stage->next, flags ); in twoside_flush() 154 stage->next->reset_stipple_counter( stage->next ); in twoside_reset_stipple_counter() 176 twoside->stage.next in draw_twoside_stage() [all...] |
H A D | draw_pipe_wide_line.c | 15 * next paragraph) shall be included in all copies or substantial portions 132 stage->next->tri( stage->next, &tri ); in wideline_line() 137 stage->next->tri( stage->next, &tri ); in wideline_line() 167 stage->next->flush( stage->next, flags ); in wideline_flush() 180 stage->next->reset_stipple_counter( stage->next ); in wideline_reset_stipple_counter() 199 wide->stage.next in draw_wide_line_stage() [all...] |
/third_party/pulseaudio/src/pulse/ |
H A D | mainloop-signal.c | 56 pa_signal_event *previous, *next; member 82 for (s = signals; s; s = s->next) in dispatch() 166 for (e = signals; e; e = e->next) in pa_signal_new() 189 e->next = signals; in pa_signal_new() 201 if (e->next) in pa_signal_free() 202 e->next->previous = e->previous; in pa_signal_free() 204 e->previous->next = e->next; in pa_signal_free() 206 signals = e->next; in pa_signal_free()
|
/third_party/skia/third_party/externals/microhttpd/src/examples/ |
H A D | mhd2spdy_structures.h | 74 struct SPDY_Connection *next; member 110 struct Proxy *next; member 192 * element are structs with prev and next fields. 199 (element)->next = (head); \ 211 * with prev and next fields. 219 (head) = (element)->next; \ 221 (element)->prev->next = (element)->next; \ 222 if ((element)->next == NULL) \ 225 (element)->next [all...] |
/third_party/skia/src/sksl/lex/ |
H A D | NFAtoDFA.h | 79 for (int next : state.fData) { in add() 80 this->add(next, states); in add() 92 void addTransition(char c, int start, int next) { in addTransition() argument 100 row[start] = next; in addTransition() 106 std::vector<int> next; in scanState() local 115 this->add(nextState, &next); in scanState() 119 std::sort(next.begin(), next.end()); in scanState() 120 DFAState* nextState = this->getState(DFAState::Label(next)); in scanState()
|
/third_party/vk-gl-cts/framework/delibs/decpp/ |
H A D | deAppendList.hpp | 46 * current block runs out, allocation of next block will happen in a single 72 Block* volatile next; member 78 , next (DE_NULL) in Block() 120 m_curBlock = m_curBlock->next; in operator ++() 182 curBlock = delBlock->next; in ~AppendList() 206 curBlock = delBlock->next; in clear() 219 m_first->next = DE_NULL; in clear() 239 if (curBlock->next) in append() 240 curBlock = curBlock->next; in append() 256 // they are being blocked by curBlock->next bein in append() [all...] |
/third_party/node/deps/v8/src/parsing/ |
H A D | scanner.h | 63 // Returns and advances past the next UTF-16 code unit in the input 71 // Returns and advances past the next UTF-16 code unit in the input stream 283 // Returns the next token and advances input. 320 Token::Value peek() const { return next().token; } in peek() 322 const Location& peek_location() const { return next().location; } in peek_location() 329 return LiteralContainsEscapes(next()); in next_literal_contains_escapes() 352 DCHECK(next().CanAccessLiteral()); in NextLiteralExactlyEquals() 359 base::Vector<const uint8_t> next = next_literal_one_byte_string(); in NextLiteralExactlyEquals() 360 const char* chars = reinterpret_cast<const char*>(next.begin()); in NextLiteralExactlyEquals() 361 return next in NextLiteralExactlyEquals() 568 Select(base::uc32 next, Token::Value then, Token::Value else_) Select() argument 714 TokenDesc& next() { return *next_; } next() function in v8::internal::Scanner 717 const TokenDesc& next() const { return *next_; } next() function in v8::internal::Scanner [all...] |
H A D | scanner.cc | 108 next().after_line_terminator = true; in Initialize() 165 // Either we already have the next token lined up, in which case next_next_ in Next() 185 DCHECK(next().token != Token::DIV); in PeekAhead() 186 DCHECK(next().token != Token::ASSIGN_DIV); in PeekAhead() 193 next().after_line_terminator = false; in PeekAhead() 279 if (!next().after_line_terminator) { in SkipMultiLineComment() 298 next().after_line_terminator = true; in SkipMultiLineComment() 355 // the "next" token. The "current" token will be invalid. in SeekForward() 356 if (pos == next().location.beg_pos) return; in SeekForward() 358 DCHECK_EQ(next() in SeekForward() [all...] |
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | TextTrieMap.java | 148 * @see java.util.Iterator#next() 151 public Character next() { in next() method in TextTrieMap.CharIterator 155 Character next; in next() 157 next = _remainingChar; in next() 165 next = chars[0]; in next() 170 next = _text.charAt(_nextIdx); in next() 174 return next; in next() 265 buf.append(chitr.next()); in add() 281 Character ch = chitr.next(); in findMatch() 333 Node next in add() [all...] |
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
H A D | TextTrieMap.java | 156 * @see java.util.Iterator#next() 159 public Character next() { in next() method in TextTrieMap.CharIterator 163 Character next; in next() 165 next = _remainingChar; in next() 173 next = chars[0]; in next() 178 next = _text.charAt(_nextIdx); in next() 182 return next; in next() 274 buf.append(chitr.next()); in add() 290 Character ch = chitr.next(); in findMatch() 342 Node next in add() [all...] |
/third_party/node/deps/v8/third_party/zlib/ |
H A D | gzread.c | 159 state->x.next = state->out; 161 memcpy(state->x.next, strm->next_in, strm->avail_in); 171 On return, state->x.have and state->x.next point to the just decompressed 173 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 213 state->x.next = strm->next_out - state->x.have; 246 state->x.next = state->out; 272 state->x.next += n; 325 memcpy(buf, state->x.next, n); 326 state->x.next += n; 471 return *(state->x.next) [all...] |
/third_party/node/deps/zlib/ |
H A D | gzread.c | 142 state->x.next = state->out; in gz_look() 143 memcpy(state->x.next, strm->next_in, strm->avail_in); in gz_look() 152 On return, state->x.have and state->x.next point to the just decompressed 154 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 192 state->x.next = strm->next_out - state->x.have; in gz_decomp() 223 state->x.next = state->out; in gz_fetch() 246 state->x.next += n; in gz_skip() 295 memcpy(buf, state->x.next, n); in gz_read() 296 state->x.next += n; in gz_read() 430 return *(state->x.next) in gzgetc() [all...] |
/third_party/nghttp2/lib/ |
H A D | nghttp2_buf.c | 100 (*chain)->next = NULL; in buf_chain_new() 192 next_chain = chain->next; in nghttp2_bufs_free() 211 chain->next = NULL; in nghttp2_bufs_wrap_init() 247 cur_chain->next = NULL; in nghttp2_bufs_wrap_init2() 251 dst_chain = &cur_chain->next; in nghttp2_bufs_wrap_init2() 282 for (ci = bufs->cur; ci; ci = ci->next) { in nghttp2_bufs_seek_last_present() 296 for (ci = bufs->head; ci; ci = ci->next) { in nghttp2_bufs_len() 307 if (bufs->cur->next) { in bufs_alloc_chain() 308 bufs->cur = bufs->cur->next; in bufs_alloc_chain() 327 bufs->cur->next in bufs_alloc_chain() [all...] |
/third_party/node/deps/nghttp2/lib/ |
H A D | nghttp2_buf.c | 100 (*chain)->next = NULL; in buf_chain_new() 192 next_chain = chain->next; in nghttp2_bufs_free() 211 chain->next = NULL; in nghttp2_bufs_wrap_init() 247 cur_chain->next = NULL; in nghttp2_bufs_wrap_init2() 251 dst_chain = &cur_chain->next; in nghttp2_bufs_wrap_init2() 282 for (ci = bufs->cur; ci; ci = ci->next) { in nghttp2_bufs_seek_last_present() 296 for (ci = bufs->head; ci; ci = ci->next) { in nghttp2_bufs_len() 307 if (bufs->cur->next) { in bufs_alloc_chain() 308 bufs->cur = bufs->cur->next; in bufs_alloc_chain() 327 bufs->cur->next in bufs_alloc_chain() [all...] |
/third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_scene.c | 15 * next paragraph) shall be included in all copies or substantial portions 48 struct resource_ref *next; member 56 struct shader_ref *next; member 154 bin->tail->next = NULL; in lp_scene_bin_reset() 255 for (struct resource_ref *ref = scene->resources; ref; ref = ref->next) { in lp_scene_end_rasterization() 271 ref = ref->next) { in lp_scene_end_rasterization() 294 for (struct shader_ref *ref = scene->frag_shaders; ref; ref = ref->next) { in lp_scene_end_rasterization() 311 tmp = block->next; in lp_scene_end_rasterization() 317 list->head->next = NULL; in lp_scene_end_rasterization() 345 bin->tail->next in lp_scene_new_cmd_block() [all...] |
/third_party/lwip/src/core/ipv4/ |
H A D | igmp.c | 167 struct igmp_group *next = group->next; /* avoid use-after-free below */ in igmp_stop() local 180 /* move to "next" */ in igmp_stop() 181 group = next; in igmp_stop() 200 group = group->next; in igmp_report_groups() 205 group = group->next; in igmp_report_groups() 226 group = group->next; in igmp_lookfor_group() 270 group->next = NULL; in igmp_lookup_group() 276 group->next = list_head->next; in igmp_lookup_group() [all...] |
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/sem_init/ |
H A D | s-c1.c | 89 /* The next structure is used to save the tests measures */ 96 struct __mes_t *next; member 109 struct __test_t *next; member 132 m_cur->next = NULL; in main() 139 sems_cur->next = NULL; in main() 235 sems_cur->next = sems_tmp; in main() 237 sems_cur->next = NULL; in main() 255 m_tmp->next = NULL; in main() 257 m_cur->next = m_tmp; in main() 317 free(sems_cur->next); in main() [all...] |
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_broadcast/ |
H A D | 1-2.c | 55 while (children->next != NULL) { \ 56 tmp = children->next; \ 57 children->next = tmp->next; \ 67 while (children->next != NULL) { \ 68 tmp = children->next; \ 69 children->next = tmp->next; \ 229 struct _children *next; member 232 static children_t sentinel = {.next [all...] |
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/sem_open/ |
H A D | s-c1.c | 88 /* The next structure is used to save the tests measures */ 95 struct __mes_t *next; member 108 struct __test_t *next; member 132 m_cur->next = NULL; in main() 139 sems_cur->next = NULL; in main() 239 sems_cur->next = sems_tmp; in main() 241 sems_cur->next = NULL; in main() 259 m_tmp->next = NULL; in main() 261 m_cur->next = m_tmp; in main() 327 free(sems_cur->next); in main() [all...] |
/third_party/lwip/src/include/lwip/priv/ |
H A D | tcp_priv.h | 102 (((tpcb)->unsent != NULL) && (((tpcb)->unsent->next != NULL) || \ 254 struct tcp_seg *next; /* used when putting segments on a queue */ member 363 tcp_tmp_pcb = tcp_tmp_pcb->next) { \ 367 (npcb)->next = *(pcbs); \ 368 LWIP_ASSERT("TCP_REG: npcb->next != npcb", (npcb)->next != (npcb)); \ 378 *(pcbs) = (*pcbs)->next; \ 379 } else for (tcp_tmp_pcb = *(pcbs); tcp_tmp_pcb != NULL; tcp_tmp_pcb = tcp_tmp_pcb->next) { \ 380 if(tcp_tmp_pcb->next == (npcb)) { \ 381 tcp_tmp_pcb->next [all...] |
/third_party/skia/third_party/externals/zlib/ |
H A D | gzread.c | 159 state->x.next = state->out; 161 memcpy(state->x.next, strm->next_in, strm->avail_in); 171 On return, state->x.have and state->x.next point to the just decompressed 173 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 213 state->x.next = strm->next_out - state->x.have; 246 state->x.next = state->out; 272 state->x.next += n; 325 memcpy(buf, state->x.next, n); 326 state->x.next += n; 472 return *(state->x.next) [all...] |
/third_party/zlib/ |
H A D | gzread.c | 161 state->x.next = state->out; in gz_look() 162 memcpy(state->x.next, strm->next_in, strm->avail_in); in gz_look() 171 On return, state->x.have and state->x.next point to the just decompressed 173 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 214 state->x.next = strm->next_out - state->x.have; in gz_decomp() 252 state->x.next = state->out; in gz_fetch() 278 state->x.next += n; in gz_skip() 340 memcpy(buf, state->x.next, n); in gz_read() 341 state->x.next += n; in gz_read() 494 return *(state->x.next) in gzgetc() [all...] |
/third_party/elfutils/libdwfl/ |
H A D | dwfl_end.c | 52 Dwfl_Module *next = dwfl->modulelist; in dwfl_end() local 53 while (next != NULL) in dwfl_end() 55 Dwfl_Module *dead = next; in dwfl_end() 56 next = dead->next; in dwfl_end()
|
/third_party/musl/porting/liteos_a/kernel/src/stdio/ |
H A D | fclose.c | 27 if (f->prev) f->prev->next = f->next; in fclose() 28 if (f->next) f->next->prev = f->prev; in fclose() 29 if (*head == f) *head = f->next; in fclose()
|