Searched refs:prev (Results 1 - 25 of 41) sorted by relevance

12

/fuchsia/zircon/third_party/ulib/ngunwind/src/mi/
H A Ddyn-cancel.c35 if (di->prev)
36 di->prev->next = di->next;
41 di->next->prev = di->prev;
45 di->next = di->prev = NULL;
H A Ddyn-register.c38 di->prev = NULL;
40 di->next->prev = di;
/fuchsia/zircon/third_party/ulib/musl/src/stdio/
H A Dfclose.c12 if (f->prev)
13 f->prev->next = f->next;
15 f->next->prev = f->prev;
H A Dofl_add.c7 (*head)->prev = f;
/fuchsia/zircon/system/public/zircon/
H A Dlistnode.h18 list_node_t* prev; member in struct:list_node
28 list->prev = list->next = list;
32 item->prev = item->next = 0;
36 if (item->prev == 0 && item->next == 0)
44 item->prev = list;
45 list->next->prev = item;
52 item->prev = list->prev;
54 list->prev->next = item;
55 list->prev
[all...]
/fuchsia/zircon/third_party/ulib/musl/src/thread/
H A Dcnd_timedwait.c12 struct waiter *prev, *next; member in struct:waiter
46 node.next->prev = &node;
85 else if (node.prev)
86 node.prev->next = node.next;
88 c->_c_tail = node.prev;
90 node.next->prev = node.prev;
130 * It is therefore safe now to read node.next and node.prev without
133 if (oldstate != WAITING && node.prev) {
137 unlock_requeue(&node.prev
[all...]
/fuchsia/zircon/third_party/ulib/musl/src/process/
H A Dfdop.h10 struct fdop *next, *prev; member in struct:fdop
H A Dposix_spawn_file_actions_adddup2.c14 op->next->prev = op;
15 op->prev = 0;
H A Dposix_spawn_file_actions_addclose.c13 op->next->prev = op;
14 op->prev = 0;
H A Dposix_spawn_file_actions_addopen.c18 op->next->prev = op;
19 op->prev = 0;
/fuchsia/zircon/third_party/uapp/dash/src/
H A Dinput.h47 struct strpush *prev; /* preceding string on stack */ member in struct:strpush
66 struct parsefile *prev; /* preceding file on stack */ member in struct:parsefile
H A Dmemalloc.c103 struct stack_block *prev; member in struct:stack_block
133 sp->prev = stackp;
184 stackp = sp->prev;
222 prevstackp = sp->prev;
225 sp->prev = prevstackp;
H A Dinput.c359 sp->prev = parsefile->strpush;
402 parsefile->strpush = sp->prev;
483 pf->prev = parsefile;
486 pf->basestrpush.prev = NULL;
504 parsefile = pf->prev;
/fuchsia/zircon/third_party/ulib/musl/pthread/
H A Dpthread_cond_timedwait.c21 struct waiter *prev, *next; member in struct:waiter
60 node.next->prev = &node;
99 else if (node.prev)
100 node.prev->next = node.next;
102 c->_c_tail = node.prev;
104 node.next->prev = node.prev;
147 * It is therefore safe now to read node.next and node.prev without
157 if (node.prev)
158 unlock_requeue(&node.prev
[all...]
/fuchsia/zircon/system/ulib/hid/
H A Dhid.c24 void hid_kbd_pressed_keys(const hid_keys_t* prev, const hid_keys_t* cur, hid_keys_t* pressed) { argument
27 pressed->keymask[i] = (prev->keymask[i] ^ cur->keymask[i]) & cur->keymask[i];
31 void hid_kbd_released_keys(const hid_keys_t* prev, const hid_keys_t* cur, hid_keys_t* released) { argument
34 released->keymask[i] = (prev->keymask[i] ^ cur->keymask[i]) & prev->keymask[i];
/fuchsia/zircon/system/ulib/hid/include/hid/
H A Dhid.h26 void hid_kbd_pressed_keys(const hid_keys_t* prev, const hid_keys_t* cur, hid_keys_t* pressed);
27 void hid_kbd_released_keys(const hid_keys_t* prev, const hid_keys_t* cur, hid_keys_t* released);
/fuchsia/zircon/system/utest/fbl/include/fbl/tests/intrusive_containers/
H A Dordered_associative_container_test_environment.h75 for (auto prev = iter++; iter.IsValid(); prev = iter++) {
79 ASSERT_TRUE(prev.IsValid(), "");
82 auto prev_key = KeyTraits::GetKey(*prev);
114 for (auto prev = iter--; iter.IsValid(); prev = iter--) {
118 ASSERT_TRUE(prev.IsValid(), "");
121 auto prev_key = KeyTraits::GetKey(*prev);
165 { .key = KeyTraits::GetKey(*ptr) - 1, .bound = nullptr }, // prev (key - 1)
172 // bound this/prev/nex
[all...]
/fuchsia/zircon/third_party/ulib/jemalloc/test/unit/
H A Dph.c77 "auxelm's prev doesn't link to auxelm");
107 "sibling's prev doesn't link to sibling");
128 "auxelm's prev doesn't link to auxelm");
237 node_t *prev = NULL; local
242 if (prev != NULL) {
244 prev), 0,
247 prev = node;
251 node_t *prev = NULL; local
256 if (prev != NULL) {
258 prev),
[all...]
/fuchsia/zircon/third_party/ulib/uboringssl/crypto/fipsmodule/rand/
H A Drand.c70 // next and prev form a NULL-terminated, double-linked list of all states in
72 struct rand_thread_state *next, *prev; member in struct:rand_thread_state
108 if (state->prev != NULL) {
109 state->prev->next = state->next;
115 state->next->prev = state->prev;
290 state->next->prev = state;
292 state->prev = NULL;
/fuchsia/zircon/system/ulib/async-testutils/
H A Dtest_loop_dispatcher.cpp40 for (node = task_list->prev; node != task_list; node = node->prev) {
231 tail->next->prev = &task_list_;
233 head->prev = &due_list_;
234 due_list_.prev = tail;
/fuchsia/zircon/system/utest/util/
H A Dlistnode.cpp139 list_split_after(&first_list, list_peek_tail(&first_list)->prev->prev,
/fuchsia/zircon/system/uapp/display-test/
H A Dimage.cpp136 uint32_t prev = interpolate(height_, prev_step, kRenderPeriod); local
138 start = fbl::min(cur, prev);
139 end = fbl::max(cur, prev);
140 draw_stripe = cur > prev;
/fuchsia/zircon/kernel/vm/
H A Dvm_address_region.cpp409 auto prev = subregions_.upper_bound(base); local
410 auto next = prev--;
412 if (prev.IsValid()) {
414 if (add_overflow(prev->base(), prev->size() - 1, &prev_last_byte)) {
434 bool VmAddressRegion::CheckGapLocked(const ChildList::iterator& prev, argument
449 if (prev.IsValid()) {
450 if (add_overflow(prev->base(), prev->size(), &gap_beg) ||
491 prev_arch_mmu_flags = (prev
[all...]
/fuchsia/zircon/system/dev/misc/intel-rtc/
H A Dintel-rtc.c195 rtc_t rtc, prev; local
198 memcpy(&prev, &rtc, sizeof(rtc_t));
200 } while (memcmp(&rtc, &prev, sizeof(rtc_t)));
/fuchsia/zircon/system/utest/fs/
H A Dtest-random-op.c683 thread_list_t* prev = NULL; local
688 if (prev) {
689 free(prev);
691 prev = next;
693 if (prev) {
694 free(prev);

Completed in 139 milliseconds

12