Lines Matching defs:new
220 struct mask_array *new;
223 new = kzalloc(sizeof(struct mask_array) +
226 if (!new)
229 new->masks_usage_zero_cntr = (u64 *)((u8 *)new +
234 new->masks_usage_stats = __alloc_percpu(sizeof(struct mask_array_stats) +
237 if (!new->masks_usage_stats) {
238 kfree(new);
242 new->count = 0;
243 new->max = size;
245 return new;
251 struct mask_array *new;
253 new = tbl_mask_array_alloc(size);
254 if (!new)
263 new->masks[new->count++] = old->masks[i];
268 rcu_assign_pointer(tbl->mask_array, new);
274 struct sw_flow_mask *new)
288 * every new mask gets a fair chance of being prioritized.
295 rcu_assign_pointer(ma->masks[ma_count], new);
365 struct mask_cache *new;
374 new = kzalloc(sizeof(*new), GFP_KERNEL);
375 if (!new)
378 new->cache_size = size;
379 if (new->cache_size > 0) {
381 new->cache_size),
384 kfree(new);
389 new->mask_cache = cache;
390 return new;
395 struct mask_cache *new;
404 new = tbl_mask_cache_alloc(size);
405 if (!new)
408 rcu_assign_pointer(table->mask_cache, new);
580 struct table_instance *new, bool ufid)
586 new->node_ver = !old_ver;
588 /* Insert in new table. */
597 ufid_table_instance_insert(new, flow);
602 table_instance_insert(new, flow);
1010 const struct sw_flow_mask *new)
1014 mask = flow_mask_find(tbl, new);
1016 /* Allocate a new mask if none exists. */
1020 mask->key = new->key;
1021 mask->range = new->range;
1112 struct mask_array *new;
1172 /* Rebuilt the new list in order of usage. */
1173 new = tbl_mask_array_alloc(ma->max);
1174 if (!new)
1181 new->masks[new->count++] = ma->masks[index];
1184 rcu_assign_pointer(table->mask_array, new);