Searched refs:new (Results 1 - 25 of 104) sorted by relevance

12345

/net/irda/irnet/
H A Dirnet_irda.c338 /* Close the last instance of IrIAP, and open a new one.
345 /* Create a new IAP instance */
751 irnet_socket * new = (irnet_socket *) NULL; local
770 new = (irnet_socket *) hashbin_find(irnet_server.list,
772 if(new)
774 new, new->rname);
781 if(new == (irnet_socket *) NULL)
783 new = (irnet_socket *) hashbin_get_first(irnet_server.list);
784 while(new !
832 irnet_connect_socket(irnet_socket * server, irnet_socket * new, struct qos_info * qos, __u32 max_sdu_size, __u8 max_header_size) argument
1341 irnet_socket * new = (irnet_socket *) NULL; local
[all...]
/net/dccp/ccids/lib/
H A Dloss_interval.c108 * subsequent packets as belonging to a new loss interval. This
122 /* Determine if `new_loss' does begin a new loss interval [RFC 4342, 10.2] */
131 * tfrc_lh_interval_add - Insert new record into the Loss Interval database
137 * Updates I_mean and returns 1 if a new interval has in fact been added to @lh.
142 struct tfrc_loss_interval *cur = tfrc_lh_peek(lh), *new; local
147 new = tfrc_lh_demand_next(lh);
148 if (unlikely(new == NULL)) {
153 new->li_seqno = tfrc_rx_hist_loss_prev(rh)->tfrchrx_seqno;
154 new->li_ccval = tfrc_rx_hist_loss_prev(rh)->tfrchrx_ccval;
155 new
[all...]
/net/x25/
H A Dx25_facilities.c5 * randomly fail to work with new releases, misbehave and/or generally
271 struct x25_facilities *new, struct x25_dte_facilities *dte)
279 memcpy(new, ours, sizeof(*new));
293 new->reverse = theirs.reverse;
302 new->throughput = (new->throughput & 0xf0) | theirs_in;
307 new->throughput = (new->throughput & 0x0f) | theirs_out;
314 new
270 x25_negotiate_facilities(struct sk_buff *skb, struct sock *sk, struct x25_facilities *new, struct x25_dte_facilities *dte) argument
[all...]
/net/netfilter/
H A Dnf_conntrack_extend.c75 struct nf_ct_ext *old, *new; local
97 new = __krealloc(old, newlen, gfp);
98 if (!new)
101 if (new != old) {
109 t->move((void *)new + new->offset[i],
114 ct->ext = new;
117 new->offset[id] = newoff;
118 new->len = newlen;
119 memset((void *)new
[all...]
H A Dnf_conntrack_ecache.c171 struct nf_ct_event_notifier *new)
183 rcu_assign_pointer(net->ct.nf_conntrack_event_cb, new);
193 struct nf_ct_event_notifier *new)
200 BUG_ON(notify != new);
207 struct nf_exp_event_notifier *new)
219 rcu_assign_pointer(net->ct.nf_expect_event_cb, new);
229 struct nf_exp_event_notifier *new)
236 BUG_ON(notify != new);
170 nf_conntrack_register_notifier(struct net *net, struct nf_ct_event_notifier *new) argument
192 nf_conntrack_unregister_notifier(struct net *net, struct nf_ct_event_notifier *new) argument
206 nf_ct_expect_register_notifier(struct net *net, struct nf_exp_event_notifier *new) argument
228 nf_ct_expect_unregister_notifier(struct net *net, struct nf_exp_event_notifier *new) argument
H A Dnf_conntrack_labels.c52 static void replace_u32(u32 *address, u32 mask, u32 new) argument
58 tmp = (old & mask) ^ new;
/net/sched/
H A Dcls_cgroup.c101 struct cls_cgroup_head *new; local
115 new = kzalloc(sizeof(*head), GFP_KERNEL);
116 if (!new)
119 tcf_exts_init(&new->exts, TCA_CGROUP_ACT, TCA_CGROUP_POLICE);
121 new->handle = head->handle;
123 new->handle = handle;
125 new->tp = tp;
142 tcf_exts_change(tp, &new->exts, &e);
143 tcf_em_tree_change(tp, &new->ematches, &t);
145 rcu_assign_pointer(tp->root, new);
[all...]
H A Dcls_u32.c379 * shared between the old and new copies to allow readers to
644 struct tc_u_knode *new; local
647 new = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key),
650 if (!new)
653 RCU_INIT_POINTER(new->next, n->next);
654 new->handle = n->handle;
655 RCU_INIT_POINTER(new->ht_up, n->ht_up);
658 new->ifindex = n->ifindex;
660 new->fshift = n->fshift;
661 new
716 struct tc_u_knode *new; local
[all...]
H A Dsch_mq.c148 static int mq_graft(struct Qdisc *sch, unsigned long cl, struct Qdisc *new, argument
157 *old = dev_graft_qdisc(dev_queue, new);
158 if (new)
159 new->flags |= TCQ_F_ONETXQUEUE;
H A Dsch_dsmark.c56 struct Qdisc *new, struct Qdisc **old)
60 pr_debug("%s(sch %p,[qdisc %p],new %p,old %p)\n",
61 __func__, sch, p, new, old);
63 if (new == NULL) {
64 new = qdisc_create_dflt(sch->dev_queue, &pfifo_qdisc_ops,
66 if (new == NULL)
67 new = &noop_qdisc;
72 p->q = new;
55 dsmark_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new, struct Qdisc **old) argument
/net/irda/
H A Ddiscovery.c48 * Add a new discovery to the cachelog, and remove any old discoveries
54 * discovered is "new" or just the same old one. They can't rely there
55 * on a binary flag (new/old), because not all discovery events are
57 * miss some new devices popping up...
60 void irlmp_add_discovery(hashbin_t *cachelog, discovery_t *new) argument
65 /* Set time of first discovery if node is new (see below) */
66 new->firststamp = new->timestamp;
83 if ((node->data.saddr == new->data.saddr) &&
84 ((node->data.daddr == new
[all...]
/net/sctp/
H A Dauth.c72 /* Create a new key structure of a given length */
93 /* Create a new shared key container with a give key id */
96 struct sctp_shared_key *new; local
99 new = kzalloc(sizeof(struct sctp_shared_key), gfp);
100 if (!new)
103 INIT_LIST_HEAD(&new->key_list);
104 new->key_id = key_id;
106 return new;
193 struct sctp_auth_bytes *new; local
205 new
362 struct sctp_shared_key *new; local
[all...]
H A Dtsnmap.c358 unsigned long *new; local
368 new = kzalloc(len>>3, GFP_ATOMIC);
369 if (!new)
372 bitmap_copy(new, map->tsn_map,
375 map->tsn_map = new;
/net/sunrpc/auth_gss/
H A Dsvcauth_gss.c81 static struct rsi *rsi_update(struct cache_detail *cd, struct rsi *new, struct rsi *old);
129 struct rsi *new = container_of(cnew, struct rsi, h); local
132 new->out_handle.data = NULL;
133 new->out_handle.len = 0;
134 new->out_token.data = NULL;
135 new->out_token.len = 0;
136 new->in_handle.len = item->in_handle.len;
138 new->in_token.len = item->in_token.len;
140 new->in_handle.data = item->in_handle.data;
142 new
148 struct rsi *new = container_of(cnew, struct rsi, h); local
292 rsi_update(struct cache_detail *cd, struct rsi *new, struct rsi *old) argument
363 struct rsc *new = container_of(a, struct rsc, h); local
372 struct rsc *new = container_of(cnew, struct rsc, h); local
386 struct rsc *new = container_of(cnew, struct rsc, h); local
549 rsc_update(struct cache_detail *cd, struct rsc *new, struct rsc *old) argument
775 struct gss_domain *new; local
[all...]
H A Dgss_mech_switch.c73 char *new; local
75 new = kmalloc(strlen(name) + strlen(prefix) + 1, GFP_KERNEL);
76 if (new) {
77 strcpy(new, prefix);
78 strcat(new, name);
80 return new;
/net/core/
H A Dnetprio_cgroup.c39 struct netprio_map *old, *new; local
48 * Determine the new size. Let's keep it power-of-two. We start
55 sizeof(new->priomap[0]);
65 new = kzalloc(new_sz, GFP_KERNEL);
66 if (!new)
70 memcpy(new->priomap, old->priomap,
73 new->priomap_len = new_len;
75 /* install the new priomap */
76 rcu_assign_pointer(dev->priomap, new);
H A Ddst.c29 * new entries from both BH and non-BH context.
300 unsigned long prev, new; local
304 new = (unsigned long) p;
305 prev = cmpxchg(&dst->_metrics, old, new);
321 unsigned long prev, new; local
323 new = ((unsigned long) dst_default_metrics) | DST_METRICS_READ_ONLY;
324 prev = cmpxchg(&dst->_metrics, old, new);
/net/sunrpc/
H A Dsvcauth_unix.c51 struct unix_domain *new = NULL; local
56 if (new && rv != &new->h)
57 svcauth_unix_domain_release(&new->h);
66 new = kmalloc(sizeof(*new), GFP_KERNEL);
67 if (new == NULL)
69 kref_init(&new->h.ref);
70 new->h.name = kstrdup(name, GFP_KERNEL);
71 if (new
114 struct ip_map *new = container_of(cnew, struct ip_map, h); local
120 struct ip_map *new = container_of(cnew, struct ip_map, h); local
128 struct ip_map *new = container_of(cnew, struct ip_map, h); local
435 struct unix_gid *new = container_of(cnew, struct unix_gid, h); local
440 struct unix_gid *new = container_of(cnew, struct unix_gid, h); local
446 struct unix_gid *new = container_of(cnew, struct unix_gid, h); local
[all...]
H A Dauth.c328 struct rpc_cred_cache *new; local
331 new = kmalloc(sizeof(*new), GFP_KERNEL);
332 if (!new)
334 new->hashbits = auth_hashbits;
335 hashsize = 1U << new->hashbits;
336 new->hashtable = kcalloc(hashsize, sizeof(new->hashtable[0]), GFP_KERNEL);
337 if (!new->hashtable)
339 spin_lock_init(&new
551 *entry, *new; local
693 struct rpc_cred *new; local
[all...]
H A Dsvcauth.c117 * it's second argument 'new'. If this is non-null, it will
139 auth_domain_lookup(char *name, struct auth_domain *new) argument
155 if (new)
156 hlist_add_head(&new->hash, head);
158 return new;
/net/6lowpan/
H A Diphc.c177 struct sk_buff *new; local
180 new = skb_copy_expand(skb, sizeof(struct ipv6hdr), skb_tailroom(skb),
184 if (!new)
187 skb_push(new, sizeof(struct ipv6hdr));
188 skb_reset_network_header(new);
189 skb_copy_to_linear_data(new, hdr, sizeof(struct ipv6hdr));
191 new->protocol = htons(ETH_P_IPV6);
192 new->pkt_type = PACKET_HOST;
193 new->dev = dev;
196 new
463 struct sk_buff *new; local
[all...]
/net/mac80211/
H A Drc80211_minstrel.h29 minstrel_ewma(int old, int new, int weight) argument
31 return (new * (EWMA_DIV - weight) + old * weight) / EWMA_DIV;
H A Dkey.c255 struct ieee80211_key *new)
260 /* caller must provide at least one old/new */
261 if (WARN_ON(!new && !old))
264 if (new)
265 list_add_tail(&new->list, &sdata->key_list);
267 WARN_ON(new && old && new->conf.keyidx != old->conf.keyidx);
272 idx = new->conf.keyidx;
276 rcu_assign_pointer(sta->ptk[idx], new);
279 rcu_assign_pointer(sta->gtk[idx], new);
251 ieee80211_key_replace(struct ieee80211_sub_if_data *sdata, struct sta_info *sta, bool pairwise, struct ieee80211_key *old, struct ieee80211_key *new) argument
[all...]
/net/dccp/
H A Dfeat.c182 * Other features: add cases for new feature types here after adding
395 struct dccp_feat_entry *new; local
401 new = kmemdup(original, sizeof(struct dccp_feat_entry), gfp_any());
402 if (new == NULL)
405 if (type == FEAT_SP && dccp_feat_clone_sp_val(&new->val,
408 kfree(new);
411 return new;
487 struct dccp_feat_entry *new = dccp_feat_entry_new(fn_list, feat, local); local
489 if (new == NULL)
492 new
515 struct dccp_feat_entry *new = dccp_feat_entry_new(fn_list, feat, local); local
557 struct dccp_feat_entry *entry, *new; local
[all...]
H A Dackvec.c193 * dccp_ackvec_add_new - Record one or more new entries in Ack Vector buffer
352 struct dccp_ackvec_parsed *new = kmalloc(sizeof(*new), GFP_ATOMIC); local
354 if (new == NULL)
356 new->vec = vec;
357 new->len = len;
358 new->nonce = nonce;
360 list_add_tail(&new->node, head);

Completed in 634 milliseconds

12345