Home
last modified time | relevance | path

Searched refs:snode (Results 1 – 7 of 7) sorted by relevance

/linux/tools/perf/util/
H A Dstrlist.c20 struct str_node *snode = malloc(sizeof(*snode)); in strlist__node_new() local
22 if (snode != NULL) { in strlist__node_new()
28 snode->s = s; in strlist__node_new()
29 rc = &snode->rb_node; in strlist__node_new()
35 free(snode); in strlist__node_new()
39 static void str_node__delete(struct str_node *snode, bool dupstr) in str_node__delete() argument
42 zfree((char **)&snode->s); in str_node__delete()
43 free(snode); in str_node__delete()
50 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_delete() local
52 str_node__delete(snode, slist->dupstr); in strlist__node_delete()
[all …]
/linux/drivers/accel/amdxdna/
H A Daie2_solver.c184 struct solver_node *snode, in get_free_partition() argument
191 for (i = 0; i < snode->cols_len; i++) { in get_free_partition()
192 col = snode->start_cols[i]; in get_free_partition()
197 if (i == snode->cols_len) in get_free_partition()
217 snode->pt_node = pt_node; in get_free_partition()
223 struct solver_node *snode, in allocate_partition() argument
229 ret = get_free_partition(xrs, snode, req); in allocate_partition()
241 for (idx = 0; idx < snode->cols_len; idx++) { in allocate_partition()
242 if (snode->start_cols[idx] != pt_node->start_col) in allocate_partition()
257 snode->pt_node = rpt_node; in allocate_partition()
[all …]
/linux/drivers/net/
H A Damt.c92 struct amt_source_node *snode; in __amt_source_gc_work() local
100 hlist_for_each_entry_safe(snode, t, &gc_list, node) { in __amt_source_gc_work()
101 hlist_del_rcu(&snode->node); in __amt_source_gc_work()
102 kfree_rcu(snode, rcu); in __amt_source_gc_work()
128 static bool amt_status_filter(struct amt_source_node *snode, in amt_status_filter() argument
135 if (snode->status == AMT_SOURCE_STATUS_FWD && in amt_status_filter()
136 snode->flags == AMT_SOURCE_OLD) in amt_status_filter()
140 if (snode->status == AMT_SOURCE_STATUS_D_FWD && in amt_status_filter()
141 snode->flags == AMT_SOURCE_OLD) in amt_status_filter()
145 if (snode->status == AMT_SOURCE_STATUS_FWD && in amt_status_filter()
[all …]
/linux/kernel/trace/
H A Dtrace_stat.c49 struct stat_node *snode, *n; in __reset_stat_session() local
51 rbtree_postorder_for_each_entry_safe(snode, n, &session->stat_root, node) { in __reset_stat_session()
53 session->ts->stat_release(snode->stat); in __reset_stat_session()
54 kfree(snode); in __reset_stat_session()
/linux/kernel/bpf/
H A Dbpf_local_storage.c56 return !hlist_unhashed_lockless(&selem->snode); in selem_linked_to_storage_lockless()
61 return !hlist_unhashed(&selem->snode); in selem_linked_to_storage()
303 free_local_storage = hlist_is_singular_node(&selem->snode, in bpf_selem_unlink_storage_nolock()
326 hlist_del_init_rcu(&selem->snode); in bpf_selem_unlink_storage_nolock()
367 selem = hlist_entry(n, struct bpf_local_storage_elem, snode); in check_storage_bpf_ma()
409 hlist_add_head_rcu(&selem->snode, &local_storage->list); in bpf_selem_link_storage_nolock()
759 hlist_for_each_entry_safe(selem, n, &local_storage->list, snode) { in bpf_local_storage_destroy()
/linux/net/core/
H A Dbpf_sk_storage.c171 hlist_for_each_entry_rcu(selem, &sk_storage->list, snode) { in bpf_sk_storage_clone()
595 hlist_for_each_entry_rcu(selem, &sk_storage->list, snode) { in bpf_sk_storage_diag_put_all()
/linux/security/selinux/ss/
H A Dservices.c634 struct ebitmap_node *snode, *tnode; in context_struct_compute_av() local
659 ebitmap_for_each_positive_bit(sattr, snode, i) { in context_struct_compute_av()
1040 struct ebitmap_node *snode, *tnode; in security_compute_xperms_decision() local
1089 ebitmap_for_each_positive_bit(sattr, snode, i) { in security_compute_xperms_decision()