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

12

/vpp/src/vppinfra/
H A Ddlist.h31 u32 prev; member in struct:__anon625
56 head->next = head->prev = new_index;
57 new->next = new->prev = head_index;
61 old_last_index = head->prev;
65 new->prev = old_last_index;
67 head->prev = new_index;
84 head->next = head->prev = new_index;
85 new->next = new->prev = head_index;
93 new->prev = old_first->prev;
[all...]
H A Dptclosure.c94 u8 **prev, **cur; local
97 prev = clib_ptclosure_alloc (n);
100 clib_ptclosure_copy (prev, orig);
108 cur[i][j] = prev[i][j] || (prev[i][k] && prev[k][j]);
111 clib_ptclosure_copy (prev, cur);
113 clib_ptclosure_free (prev);
H A Dtest_dlist.c64 elt_index = head->prev;
71 elt_index = elt->prev;
97 elt_index = head->prev;
104 elt_index = elt->prev;
125 elt_index = head->prev;
132 elt_index = elt->prev;
156 elt_index = head->prev;
163 elt_index = elt->prev;
H A Dvalloc.c78 new_ch->prev = ~0;
79 ch->prev = new_ch - vam->chunks;
83 new_ch->next = new_ch->prev = ~0;
110 new_ch->prev = index;
184 new_ch->next = new_ch->prev = ~0;
191 new_ch->prev = ch - vam->chunks;
196 next_ch->prev = new_ch - vam->chunks;
255 if (ch->prev != ~0)
257 prev_ch = pool_elt_at_index (vam->chunks, ch->prev);
271 next_ch->prev
[all...]
H A Dvalloc.h31 u32 prev; /**< previous chunk pool index */ member in struct:__anon2304
H A Dgraph.c44 l = graph_dir_get_link_to_node (&dst_node->prev, src);
54 li_prev = graph_dir_add_link (&dst_node->prev, src, distance);
59 l = vec_elt_at_index (dst_node->prev.links, li_prev);
91 graph_dir_del_link (&n->prev, src);
94 vec_foreach (l, src_node->prev.links)
101 graph_dir_free (&src_node->prev);
H A Dpmalloc.c113 u32 i, start = 0, prev = ~0; local
119 c->prev = prev;
122 if (prev == ~0)
125 pp->chunks[prev].next = c - pp->chunks;
126 prev = c - pp->chunks;
163 c->prev = offset_chunk_index;
179 ct->prev = alloc_chunk_index;
185 pool_elt_at_index (pp->chunks, ct->next)->prev = tail_chunk_index;
188 pool_elt_at_index (pp->chunks, c->next)->prev
575 clib_pmalloc_chunk_t *prev = get_chunk (pp, c->prev); local
[all...]
H A Dtw_timer_template.c130 head->next = head->prev = new_index;
131 new->next = new->prev = head_index;
139 new->prev = old_first->prev;
140 old_first->prev = new_index;
152 prev_elt = pool_elt_at_index (pool, elt->prev);
154 next_elt->prev = elt->prev;
157 elt->prev = elt->next = ~0;
435 t->next = t->prev
[all...]
H A Dllist.h31 clib_llist_index_t prev; member in struct:clib_llist_anchor
42 * Local macros to grab llist anchor next and prev from pool entry
45 #define _lprev(E,name) ((E)->name).prev
55 * Get prev list entry index
131 && (E)->name.prev != CLIB_LLIST_INVALID_INDEX)
H A Dheap.c123 n->prev = 0;
134 n->prev = p - n;
156 new->prev = 0;
158 p->prev = new - p;
163 new->prev = p - new;
165 e->prev = new - e;
182 new->prev = e - new;
188 new->prev = e - new;
191 n->prev = new - n;
738 ASSERT (first (h)->prev
[all...]
H A Dgraph.h89 graph_dir_t next, prev; member in struct:__anon2182
H A Dpmalloc.h28 u32 start, prev, next; member in struct:__anon3
H A Dheap.h78 i32 next, prev; member in struct:__anon376
105 return e + e->prev;
H A Dtw_timer_template.h122 u32 prev; member in struct:__anon1
/vpp/src/vnet/tcp/
H A Dtcp_bt.c40 return bt_get_sample (bt, bts->prev);
63 bts->next = bts->prev = TCP_BTS_INVALID_INDEX;
74 if (bts->prev != TCP_BTS_INVALID_INDEX)
76 tcp_bt_sample_t *prev = bt_prev_sample (bt, bts); local
77 prev->next = bts->next;
85 next->prev = bts->prev;
88 bt->tail = bts->prev;
115 next->prev = bt_sample_index (bt, ns);
120 ns->prev
126 bt_merge_sample(tcp_byte_tracker_t * bt, tcp_bt_sample_t * prev, tcp_bt_sample_t * cur) argument
141 rb_node_t *cur, *prev; local
340 tcp_bt_sample_t *bts, *next, *cur, *prev, *nbts; local
515 tcp_bt_sample_t *cur, *prev, *next; local
[all...]
H A Dtcp_sack.c21 sack_scoreboard_hole_t *next, *prev; local
26 next->prev = hole->prev;
30 sb->tail = hole->prev;
33 if (hole->prev != TCP_INVALID_SACK_HOLE_INDEX)
35 prev = pool_elt_at_index (sb->holes, hole->prev);
36 prev->next = hole->next;
57 sack_scoreboard_hole_t *hole, *next, *prev; local
67 prev
[all...]
H A Dtcp_sack.h53 if (hole->prev != TCP_INVALID_SACK_HOLE_INDEX)
54 return pool_elt_at_index (sb->holes, hole->prev);
/vpp/src/vnet/ip/
H A Dip_interface.c42 ip_interface_address_t *a, *prev; local
67 prev = 0;
70 prev = pool_elt_at_index (lm->if_address_pool, pi);
71 pi = prev->next_this_sw_interface;
73 pi = prev ? prev - lm->if_address_pool : (u32) ~ 0;
82 if (prev)
83 prev->next_this_sw_interface = ai;
99 ip_interface_address_t *a, *prev, *next; local
115 prev
[all...]
H A Dip6_packet.h543 ip6_ext_header_t *prev = NULL; local
557 prev = (void *) (ip6_header + 1);
558 while (ip6_ext_hdr (prev->next_hdr) && prev->next_hdr != header_type)
560 prev = ip6_ext_next_header (prev);
561 if (!vlib_object_within_buffer_data (vm, b, prev,
562 ip6_ext_header_len (prev)))
564 prev = NULL;
568 if (prev
[all...]
/vpp/src/vnet/fib/
H A Dfib_node_list.c17 * Since we cannot use C pointers, due to memeory reallocs, the next/prev
196 fib_node_list_elt_t *next, *prev; local
206 prev = fib_node_list_elt_get(elt->fnle_prev);
207 prev->fnle_next = elt->fnle_next;
218 fib_node_list_elt_t *prev,
223 elt->fnle_next = prev->fnle_next;
224 if (FIB_NODE_INDEX_INVALID != prev->fnle_next)
226 next = fib_node_list_elt_get(prev->fnle_next);
229 prev->fnle_next = fib_node_list_elt_get_index(elt);
230 elt->fnle_prev = fib_node_list_elt_get_index(prev);
217 fib_node_list_insert_after(fib_node_list_head_t *head, fib_node_list_elt_t *prev, fib_node_list_elt_t *elt) argument
[all...]
/vpp/src/svm/
H A Dsvm_fifo.c119 if (s->prev == OOO_SEGMENT_INVALID_INDEX)
121 return pool_elt_at_index (f->ooo_segments, s->prev);
141 s->prev = s->next = OOO_SEGMENT_INVALID_INDEX;
149 ooo_segment_t *cur, *prev = 0, *next = 0; local
155 next->prev = cur->prev;
158 if (cur->prev != OOO_SEGMENT_INVALID_INDEX)
160 prev = pool_elt_at_index (f->ooo_segments, cur->prev);
161 prev
178 ooo_segment_t *s, *new_s, *prev, *next, *it; local
370 svm_fifo_chunk_t *c, *prev; local
540 rb_node_t *cur, *prev; local
800 svm_fifo_chunk_t *c, *cur, *prev; local
957 svm_fifo_chunk_t *start, *prev = 0, *c; local
1305 svm_fifo_chunk_t *c, *prev = 0, *tmp; local
[all...]
H A Dfifo_types.h42 u32 prev; /**< Previous linked-list element pool index */ member in struct:__anon1
75 struct _svm_fifo *prev; /**< prev in active chain */ member in struct:_svm_fifo
/vpp/src/plugins/unittest/
H A Dllist_test.c47 && E->name.prev == (P) - pl \
49 && N->name.prev == (E) - pl)
60 LLIST_TEST (0, "invalid elt %u prev %u/%u next %u/%u", e - pl, \
61 e->name.prev, clib_llist_prev (pl,name,e) - pl, \
90 LLIST_TEST (he->ll_test.prev == head, "head prev points to itself");
105 LLIST_TEST (e->ll_test.prev == head, "prev should be head");
106 LLIST_TEST (he->ll_test.prev == e - pelts, "prev shoul
[all...]
/vpp/src/vlib/
H A Dinit.h142 _vlib_init_function_list_elt_t *this, *prev; \
151 prev = this; \
157 prev->next_init_function = \
161 prev = this; \
/vpp/extras/deprecated/vppinfra/
H A Dfheap.c61 fheap_node_t *prev, *next; local
66 prev = vec_elt_at_index (f->nodes, m->prev_sibling);
68 ASSERT (prev->next_sibling == si);
201 fheap_node_t *prev = fheap_get_node (f, prev_ni); local
212 if (prev)
214 ASSERT (prev->next_sibling == ni);
215 prev->next_sibling = next_ni;

Completed in 17 milliseconds

12