Searched refs:head (Results 1 - 25 of 83) sorted by relevance

1234

/vpp/src/vnet/bfd/
H A Dbfd_protocol.c24 return pkt->head.vers_diag >> 5;
30 pkt->head.vers_diag =
31 (version << 5) | (pkt->head.vers_diag & ((1 << 5) - 1));
37 return pkt->head.vers_diag & ((1 << 5) - 1);
43 pkt->head.vers_diag =
44 (pkt->head.vers_diag & ~((1 << 5) - 1)) | (value & ((1 << 5) - 1));
50 return pkt->head.sta_flags >> 6;
56 pkt->head.sta_flags = (value << 6) | (pkt->head.sta_flags & ((1 << 6) - 1));
62 return (pkt->head
[all...]
/vpp/src/vnet/fib/
H A Dfib_node_list.c55 * The head element
84 fib_node_list_head_get_index (fib_node_list_head_t *head) argument
86 return (head - fib_node_list_head_pool);
95 fib_node_list_elt_create (fib_node_list_head_t *head, argument
104 elt->fnle_list = fib_node_list_head_get_index(head);
115 fib_node_list_head_init (fib_node_list_head_t *head) argument
117 head->fnlh_n_elts = 0;
118 head->fnlh_head = FIB_NODE_INDEX_INVALID;
127 fib_node_list_head_t *head; local
129 pool_get(fib_node_list_head_pool, head);
139 fib_node_list_head_t *head; local
162 fib_node_list_head_t *head; local
193 fib_node_list_extract(fib_node_list_head_t *head, fib_node_list_elt_t *elt) argument
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
237 fib_node_list_head_t *head; local
267 fib_node_list_head_t *head; local
315 fib_node_list_head_t *head; local
331 fib_node_list_head_t *head; local
359 fib_node_list_head_t *head; local
[all...]
H A Dfib_node_list.h30 extern u32 fib_node_list_push_front(fib_node_list_t head,
34 extern u32 fib_node_list_push_back(fib_node_list_t head,
38 extern void fib_node_list_remove(fib_node_list_t head,
44 extern int fib_node_list_get_front(fib_node_list_t head,
50 extern u32 fib_node_list_get_size(fib_node_list_t head);
58 extern void fib_node_list_walk(fib_node_list_t head,
/vpp/src/vppinfra/
H A Ddlist.h38 dlist_elt_t *head = pool_elt_at_index (pool, index); local
39 clib_memset (head, 0xFF, sizeof (*head));
45 dlist_elt_t *head = pool_elt_at_index (pool, head_index); local
50 ASSERT (head->value == ~0);
54 if (PREDICT_FALSE (head->next == ~0))
56 head->next = head->prev = new_index;
61 old_last_index = head->prev;
67 head
73 dlist_elt_t *head = pool_elt_at_index (pool, head_index); local
119 dlist_elt_t *head = pool_elt_at_index (pool, head_index); local
135 dlist_elt_t *head = pool_elt_at_index (pool, head_index); local
[all...]
H A Dfifo.c82 void *v_new, *end, *head; local
110 head = v_old + f_old->head_index * elt_bytes;
112 if (head + n_copy_bytes >= end)
114 uword n = end - head;
115 clib_memcpy_fast (v_new, head, n);
119 clib_memcpy_fast (v_new, head, n_copy_bytes);
H A Dtest_dlist.c30 dlist_elt_t *head, *elt; local
35 pool_get (tm->test_pool, head);
36 head_index = head - tm->test_pool;
37 clib_dlist_init (tm->test_pool, head - tm->test_pool);
49 head = pool_elt_at_index (tm->test_pool, head_index);
52 elt_index = head->next;
64 elt_index = head->prev;
82 head = pool_elt_at_index (tm->test_pool, head_index);
85 elt_index = head->next;
97 elt_index = head
[all...]
H A Dtw_timer_template.c121 TWT (tw_timer) * head = pool_elt_at_index (pool, head_index);
128 if (PREDICT_FALSE (head->next == head_index))
130 head->next = head->prev = new_index;
135 old_first_index = head->next;
141 head->next = new_index;
317 TWT (tw_timer) * t, *head;
326 head = pool_elt_at_index (tw->timers, ts->head_index);
327 next_index = head->next;
457 TWT (tw_timer) * head, *
[all...]
H A Ddlmalloc.c647 chunks into bigger chunks fast. The head fields also hold bits
652 the high 31 bits of the head field of its header through the
761 cleared in their head fields. Because they are allocated
772 size_t head; /* Size and inuse bits. */ member in struct:malloc_chunk
822 /* ------------------ Operations on head and foot fields ----------------- */
825 The head field of a chunk is or'ed with PINUSE_BIT when previous
841 /* extraction of fields from head words */
842 #define cinuse(p) ((p)->head & CINUSE_BIT)
843 #define pinuse(p) ((p)->head & PINUSE_BIT)
844 #define flag4inuse(p) ((p)->head
982 size_t head; member in struct:malloc_tree_chunk
1901 tchunkptr head = 0; local
[all...]
/vpp/src/svm/
H A Dsvm_fifo.h75 * Load head and tail optimized for consumer
80 f_load_head_tail_cons (svm_fifo_t * f, u32 * head, u32 * tail) argument
83 *head = f->head;
88 /** Load head and tail optimized for producer
93 f_load_head_tail_prod (svm_fifo_t * f, u32 * head, u32 * tail) argument
98 *head = clib_atomic_load_acq_n (&f->head);
102 * Load head and tail independent of producer/consumer role
107 f_load_head_tail_all_acq (svm_fifo_t * f, u32 * head, u3 argument
121 f_cursize(svm_fifo_t * f, u32 head, u32 tail) argument
132 f_free_count(svm_fifo_t * f, u32 head, u32 tail) argument
404 u32 tail, head; local
418 u32 tail, head; local
433 u32 tail, head; local
508 u32 head, tail; local
524 u32 head, tail; local
538 u32 head, tail; local
[all...]
H A Dsvm_fifo.c176 ooo_segment_add (svm_fifo_t * f, u32 offset, u32 head, u32 tail, u32 length) argument
182 ASSERT (offset + length <= f_free_count (f, head, tail));
235 /* New head */
267 /* Merge at head */
377 f->head = f->tail = f->flags = 0;
509 u32 head, tail, end_chunk; local
511 f_load_head_tail_cons (f, &head, &tail);
512 ASSERT (!f->head_chunk || f_chunk_includes_pos (f->head_chunk, head));
516 f->head_chunk = svm_fifo_find_chunk (f, head);
523 return f_pos_lt (end_chunk, tail) ? end_chunk - head
529 u32 head, tail; local
774 u32 head, tail, head_idx; local
798 f_try_chunk_alloc(svm_fifo_t * f, u32 head, u32 tail, u32 len) argument
838 u32 tail, head, free_count; local
896 u32 tail, head, free_count, enq_pos; local
1009 u32 tail, head, cursize; local
1040 u32 tail, head, cursize, head_idx; local
1063 u32 total_drop_bytes, tail, head, cursize; local
1101 u32 head, tail; local
1121 u32 head, tail; local
1137 u32 cursize, head, tail, head_idx; local
1169 u32 head; local
1190 u32 head, tail; local
1218 svm_fifo_init_pointers(svm_fifo_t * f, u32 head, u32 tail) argument
[all...]
H A Dmessage_queue.c82 ring->cursize = ring->head = ring->tail = 0;
177 if (msg->elt_index == ring->head)
179 ring->head = (ring->head + 1) % ring->nitems;
198 u32 dist1, dist2, tail, head; local
205 head = ring->head;
207 dist1 = ((ring->nitems + msg->elt_index) - head) % ring->nitems;
208 if (tail == head)
211 dist2 = ((ring->nitems + tail) - head)
[all...]
H A Dqueue.c399 headp = (i8 *) (&q->data[0] + q->elsize * q->head);
402 q->head++;
409 if (q->head == q->maxsize)
410 q->head = 0;
433 headp = (i8 *) (&q->data[0] + q->elsize * q->head);
436 q->head++;
440 if (PREDICT_FALSE (q->head == q->maxsize))
441 q->head = 0;
462 headp = (i8 *) (&q->data[0] + q->elsize * q->head);
467 q->head
[all...]
/vpp/src/vnet/util/
H A Dradix.h103 struct radix_node_head *head, struct radix_node nodes[]);
106 struct radix_node_head *head, struct radix_node nodes[]);
108 (const void *v, const void *mask, struct radix_node_head *head);
110 (const void *v, const void *mask, struct radix_node_head *head);
112 (const void *v, struct radix_node_head *head);
114 (const void *v, const void *mask, struct radix_node_head *head);
116 (const void *v, struct radix_node_head *head);
H A Dradix.c134 struct radix_node *head)
139 for (x = head; x->rn_b >= 0;) {
151 struct radix_node *head,
158 for (x = head; x->rn_b >= 0;) {
202 struct radix_node_head *head)
208 if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
212 x = rn_match(v_arg, head);
246 struct radix_node_head *head)
249 struct radix_node *t = head->rnh_treetop;
419 struct radix_node_head *head,
132 rn_search( const void *v_arg, struct radix_node *head) argument
149 rn_search_m( const void *v_arg, struct radix_node *head, const void *m_arg) argument
199 rn_lookup( const void *v_arg, const void *m_arg, struct radix_node_head *head) argument
244 rn_match( const void *v_arg, struct radix_node_head *head) argument
417 rn_insert( const void *v_arg, struct radix_node_head *head, int *dupentry, struct radix_node nodes[2]) argument
602 rn_addroute( const void *v_arg, const void *n_arg, struct radix_node_head *head, struct radix_node treenodes[2]) argument
760 rn_delete1( const void *v_arg, const void *netmask_arg, struct radix_node_head *head, struct radix_node *rn) argument
944 rn_delete( const void *v_arg, const void *netmask_arg, struct radix_node_head *head) argument
1046 rn_inithead(void **head, int off) argument
[all...]
/vpp/src/plugins/unittest/
H A Dllist_test.c71 clib_llist_index_t head, head2, head3; local
86 head = clib_llist_make_head (pelts, ll_test);
87 he = pool_elt_at_index (pelts, head);
89 LLIST_TEST (he->ll_test.next == head, "head next points to itself");
90 LLIST_TEST (he->ll_test.prev == head, "head prev points to itself");
101 he = pool_elt_at_index (pelts, head);
104 LLIST_TEST (e->ll_test.next == head, "next should be head");
[all...]
/vpp/src/vnet/lldp/
H A Dlldp_input.c88 return tlv->head.byte1 >> 1;
94 tlv->head.byte1 = (tlv->head.byte1 & 1) + (code << 1);
100 return (((u16) (tlv->head.byte1 & 1)) << 8) + tlv->head.byte2;
106 tlv->head.byte2 = length & ((1 << 8) - 1);
109 tlv->head.byte1 |= 1;
113 tlv->head.byte1 &= (1 << 8) - 2;
148 tlv = (lldp_tlv_t *) ((u8 *) tlv + STRUCT_SIZE_OF (lldp_tlv_t, head) + l);
168 tlv = (lldp_tlv_t *) ((u8 *) tlv + STRUCT_SIZE_OF (lldp_tlv_t, head)
[all...]
H A Dlldp_protocol.h61 struct lldp_tlv_head head;
94 struct lldp_tlv_head head;
123 struct lldp_tlv_head head;
129 struct lldp_tlv_head head;
H A Dlldp_output.c42 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head) + addr_len + oid_len + 8;
58 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head) + len;
73 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head) + len;
98 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head) + len;
111 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head) + len;
125 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head) + len;
179 *t0p += STRUCT_SIZE_OF (lldp_tlv_t, head);
/vpp/src/vlib/
H A Dinit.c71 * @param head [in/out] address of the listhead to be sorted
76 (_vlib_init_function_list_elt_t ** head)
106 this_reg = *head;
147 this_reg = *head;
261 *head = 0;
268 this_reg->next_init_function = *head;
269 *head = this_reg;
293 * @param head address of the listhead to sort and then invoke
479 _vlib_init_function_list_elt_t *head, *this; local
480 head
75 vlib_sort_init_exit_functions(_vlib_init_function_list_elt_t ** head) argument
498 _vlib_init_function_list_elt_t *head, *this; local
[all...]
/vpp/src/plugins/nsim/
H A Dnsim_input.c89 ep = wp->entries + wp->head;
121 wp->head++;
122 if (wp->head == wp->wheel_size)
123 wp->head = 0;
125 ep = wp->entries + wp->head;
/vpp/src/vnet/mfib/
H A Dmfib_signal.c37 * the dlist indext that is the head of the list
55 dlist_elt_t *head; local
58 pool_get(mfib_signal_dlist_pool, head);
59 hi = head - mfib_signal_dlist_pool;
/vpp/src/plugins/rdma/
H A Drdma.h76 u32 head; member in struct:__anon6
119 u16 head; member in struct:__anon7
147 #define RDMA_TXQ_USED_SZ(head, tail) ((u16)((u16)(tail) - (u16)(head)))
148 #define RDMA_TXQ_AVAIL_SZ(txq, head, tail) ((u16)(RDMA_TXQ_BUF_SZ (txq) - RDMA_TXQ_USED_SZ (head, tail)))
/vpp/src/vnet/tcp/
H A Dtcp_sack.h61 if (sb->head != TCP_INVALID_SACK_HOLE_INDEX)
62 return pool_elt_at_index (sb->holes, sb->head);
H A Dtcp_sack.c40 sb->head = hole->next;
82 sb->head = hole_index;
242 sb->cur_rxt_hole = sb->head;
251 sb->head = TCP_INVALID_SACK_HOLE_INDEX;
264 ASSERT (sb->head == sb->tail && sb->head == TCP_INVALID_SACK_HOLE_INDEX);
318 && sb->head == TCP_INVALID_SACK_HOLE_INDEX)
363 if (sb->head == TCP_INVALID_SACK_HOLE_INDEX)
423 hole = pool_elt_at_index (sb->holes, sb->head);
462 /* Partial 'head' overla
[all...]
/vpp/src/plugins/memif/
H A Dnode.c215 last_slot = (type == MEMIF_RING_S2M) ? ring->head : ring->tail;
522 u16 head = ring->head; local
523 n_slots = ring_size - head + mq->last_tail;
527 u16 s = head++ & mask;
533 ring->head = head;
559 u16 cur_slot, last_slot, ring_size, n_slots, mask, head; local
782 head = ring->head;
[all...]

Completed in 25 milliseconds

1234