Searched defs:curr (Results 1 - 11 of 11) sorted by relevance
/net/irda/ |
H A D | discovery.c | 155 discovery_t * curr; local 169 curr = discovery; 173 if ((curr->data.saddr == saddr) && 175 ((jiffies - curr->timestamp) > DISCOVERY_EXPIRE_TIMEOUT))) 194 memcpy(&(buffer[i]), &(curr->data), 199 curr = hashbin_remove_this(log, (irda_queue_t *) curr); 200 kfree(curr);
|
H A D | irlmp.c | 1303 struct lsap_cb *curr; local 1306 curr = (struct lsap_cb *) hashbin_get_first( self->lsaps); 1307 while (NULL != hashbin_find_next(self->lsaps, (long) curr, NULL, 1309 IRDA_ASSERT(curr->magic == LMP_LSAP_MAGIC, return;); 1313 if (curr->notify.status_indication != NULL) 1314 curr->notify.status_indication(curr->notify.instance, 1319 curr = next; 1336 struct lsap_cb *curr; local 1359 curr [all...] |
/net/ipv6/ |
H A D | exthdrs.c | 99 const struct tlvtype_proc *curr; local 145 for (curr = procs; curr->type >= 0; curr++) { 146 if (curr->type == nh[off]) { 150 if (curr->func(skb, off) == false) 155 if (curr->type < 0) {
|
/net/atm/ |
H A D | clip.c | 787 struct clip_vcc *curr) 789 if (!curr) { 790 curr = e->vccs; 791 if (!curr) 793 return curr; 795 if (curr == SEQ_NO_VCC_TOKEN) 798 curr = curr->next; 800 return curr; 786 clip_seq_next_vcc(struct atmarp_entry *e, struct clip_vcc *curr) argument
|
H A D | mpc.c | 220 struct atm_mpoa_qos *curr; local 230 curr = qos_head; 231 while (curr != NULL) { 232 if (curr->next == entry) { 233 curr->next = entry->next; 237 curr = curr->next;
|
/net/batman-adv/ |
H A D | bridge_loop_avoidance.c | 1293 int i, curr, ret = 0; local 1306 curr = (bat_priv->bla.bcast_duplist_curr + i); 1307 curr %= BATADV_DUPLIST_SIZE; 1308 entry = &bat_priv->bla.bcast_duplist[curr]; 1332 curr = (bat_priv->bla.bcast_duplist_curr + BATADV_DUPLIST_SIZE - 1); 1333 curr %= BATADV_DUPLIST_SIZE; 1334 entry = &bat_priv->bla.bcast_duplist[curr]; 1338 bat_priv->bla.bcast_duplist_curr = curr;
|
/net/netfilter/ipset/ |
H A D | ip_set_hash_gen.h | 45 tune_ahash_max(u8 curr, u32 multi) argument 49 if (multi < curr) 50 return curr; 52 n = curr + AHASH_INIT_SIZE; 56 return n > curr && n <= 64 ? n : curr;
|
/net/rfkill/ |
H A D | core.c | 271 bool prev, curr; local 317 curr = rfkill->state & RFKILL_BLOCK_SW; 322 if (prev != curr)
|
/net/sctp/ |
H A D | associola.c | 1243 static struct sctp_transport *sctp_trans_elect_best(struct sctp_transport *curr, argument 1248 if (best == NULL || curr == best) 1249 return curr; 1251 score_curr = sctp_trans_score(curr); 1259 return curr; 1261 return sctp_trans_elect_tie(curr, best);
|
/net/netfilter/ |
H A D | x_tables.c | 990 struct list_head *head, *curr; member in struct:nf_mttg_trav 1014 trav->head = trav->curr = is_target ? 1018 trav->curr = trav->curr->next; 1019 if (trav->curr != trav->head) 1023 trav->head = trav->curr = is_target ? 1028 trav->curr = trav->curr->next; 1029 if (trav->curr != trav->head) 1086 if (trav->curr [all...] |
/net/packet/ |
H A D | af_packet.c | 1009 static void prb_fill_curr_block(char *curr, argument 1016 ppd = (struct tpacket3_hdr *)curr; 1018 pkc->prev = curr; 1035 char *curr, *end; local 1061 curr = pkc->nxt_offset; 1066 if (curr+TOTAL_PKT_LEN_INCL_ALIGN(len) < end) { 1067 prb_fill_curr_block(curr, pkc, pbd, len); 1068 return (void *)curr; 1075 curr = (char *)prb_dispatch_next_block(pkc, po); 1076 if (curr) { 1093 char *curr = NULL; local [all...] |
Completed in 119 milliseconds