Home
last modified time | relevance | path

Searched refs:entries (Results 1 - 25 of 2878) sorted by relevance

12345678910>>...116

/kernel/linux/linux-6.6/drivers/net/ethernet/engleder/
H A Dtsnep_selftests.c357 qopt = kzalloc(struct_size(qopt, entries, 255), GFP_KERNEL); in tsnep_test_taprio()
361 qopt->entries[i].command = TC_TAPRIO_CMD_SET_GATES; in tsnep_test_taprio()
367 qopt->entries[0].gate_mask = 0x02; in tsnep_test_taprio()
368 qopt->entries[0].interval = 200000; in tsnep_test_taprio()
369 qopt->entries[1].gate_mask = 0x03; in tsnep_test_taprio()
370 qopt->entries[1].interval = 800000; in tsnep_test_taprio()
371 qopt->entries[2].gate_mask = 0x07; in tsnep_test_taprio()
372 qopt->entries[2].interval = 240000; in tsnep_test_taprio()
373 qopt->entries[3].gate_mask = 0x01; in tsnep_test_taprio()
374 qopt->entries[ in tsnep_test_taprio()
[all...]
/kernel/linux/linux-6.6/lib/
H A Dstackdepot.c63 unsigned long entries[]; /* Variable-sized array of frames */ member
126 unsigned long entries = 0; in stack_depot_early_init() local
145 * If stack_bucket_number_order is not set, leave entries as 0 to rely in stack_depot_early_init()
149 entries = 1UL << stack_bucket_number_order; in stack_depot_early_init()
153 entries, in stack_depot_early_init()
173 unsigned long entries; in stack_depot_init() local
186 entries = 1UL << stack_bucket_number_order; in stack_depot_init()
190 entries = nr_free_buffer_pages(); in stack_depot_init()
191 entries = roundup_pow_of_two(entries); in stack_depot_init()
260 depot_alloc_stack(unsigned long *entries, int size, u32 hash, void **prealloc) depot_alloc_stack() argument
320 hash_stack(unsigned long *entries, unsigned int size) hash_stack() argument
343 find_stack(struct stack_record *bucket, unsigned long *entries, int size, u32 hash) find_stack() argument
358 __stack_depot_save(unsigned long *entries, unsigned int nr_entries, gfp_t alloc_flags, bool can_alloc) __stack_depot_save() argument
452 stack_depot_save(unsigned long *entries, unsigned int nr_entries, gfp_t alloc_flags) stack_depot_save() argument
460 stack_depot_fetch(depot_stack_handle_t handle, unsigned long **entries) stack_depot_fetch() argument
500 unsigned long *entries; stack_depot_print() local
512 unsigned long *entries; stack_depot_snprint() local
[all...]
H A Dhashtable_test.c90 /* Both entries should have been visited exactly once. */ in hashtable_test_hash_add()
125 struct hashtable_test_entry entries[3]; in hashtable_test_hash_for_each() local
130 /* Add three entries to the hashtable. */ in hashtable_test_hash_for_each()
132 entries[i].key = i; in hashtable_test_hash_for_each()
133 entries[i].data = i + 10; in hashtable_test_hash_for_each()
134 entries[i].visited = 0; in hashtable_test_hash_for_each()
135 hash_add(hash, &entries[i].node, entries[i].key); in hashtable_test_hash_for_each()
149 KUNIT_EXPECT_EQ(test, entries[j].visited, 1); in hashtable_test_hash_for_each()
154 struct hashtable_test_entry entries[ in hashtable_test_hash_for_each_safe() local
187 struct hashtable_test_entry entries[4]; hashtable_test_hash_for_each_possible() local
241 struct hashtable_test_entry entries[4]; hashtable_test_hash_for_each_possible_safe() local
[all...]
H A Dlist-test.c387 struct list_head entries[3], *cur; in list_test_list_cut_position() local
392 list_add_tail(&entries[0], &list1); in list_test_list_cut_position()
393 list_add_tail(&entries[1], &list1); in list_test_list_cut_position()
394 list_add_tail(&entries[2], &list1); in list_test_list_cut_position()
396 /* before: [list1] -> entries[0] -> entries[1] -> entries[2] */ in list_test_list_cut_position()
397 list_cut_position(&list2, &list1, &entries[1]); in list_test_list_cut_position()
398 /* after: [list2] -> entries[0] -> entries[ in list_test_list_cut_position()
415 struct list_head entries[3], *cur; list_test_list_cut_before() local
443 struct list_head entries[5], *cur; list_test_list_splice() local
468 struct list_head entries[5], *cur; list_test_list_splice_tail() local
493 struct list_head entries[5], *cur; list_test_list_splice_init() local
520 struct list_head entries[5], *cur; list_test_list_splice_tail_init() local
643 struct list_head entries[3], *cur; list_test_list_for_each() local
661 struct list_head entries[3], *cur; list_test_list_for_each_prev() local
679 struct list_head entries[3], *cur, *n; list_test_list_for_each_safe() local
700 struct list_head entries[3], *cur, *n; list_test_list_for_each_prev_safe() local
720 struct list_test_struct entries[5], *cur; list_test_list_for_each_entry() local
741 struct list_test_struct entries[5], *cur; list_test_list_for_each_entry_reverse() local
1030 struct hlist_node entries[3], *cur; hlist_test_for_each() local
1049 struct hlist_node entries[3], *cur, *n; hlist_test_for_each_safe() local
1069 struct hlist_test_struct entries[5], *cur; hlist_test_for_each_entry() local
1092 struct hlist_test_struct entries[5], *cur; hlist_test_for_each_entry_continue() local
1123 struct hlist_test_struct entries[5], *cur; hlist_test_for_each_entry_from() local
1151 struct hlist_test_struct entries[5], *cur; hlist_test_for_each_entry_safe() local
[all...]
/third_party/node/test/fixtures/wpt/user-timing/
H A Dmark.any.js6 function match_entries(entries, index)
8 var entry = entries[index];
38 const entries = self.performance.getEntriesByName("mark");
39 assert_equals(entries.length, 1);
48 const entries = self.performance.getEntriesByName("mark");
49 assert_equals(entries.length, 2);
55 const entries = self.performance.getEntriesByName("mark");
56 assert_equals(entries[index].name, "mark", "Entry has the proper name");
60 const entries = self.performance.getEntriesByName("mark");
61 assert_approx_equals(entries[inde
[all...]
/kernel/linux/linux-5.10/lib/
H A Dlist-test.c348 struct list_head entries[3], *cur; in list_test_list_cut_position() local
353 list_add_tail(&entries[0], &list1); in list_test_list_cut_position()
354 list_add_tail(&entries[1], &list1); in list_test_list_cut_position()
355 list_add_tail(&entries[2], &list1); in list_test_list_cut_position()
357 /* before: [list1] -> entries[0] -> entries[1] -> entries[2] */ in list_test_list_cut_position()
358 list_cut_position(&list2, &list1, &entries[1]); in list_test_list_cut_position()
359 /* after: [list2] -> entries[0] -> entries[ in list_test_list_cut_position()
376 struct list_head entries[3], *cur; list_test_list_cut_before() local
404 struct list_head entries[5], *cur; list_test_list_splice() local
429 struct list_head entries[5], *cur; list_test_list_splice_tail() local
454 struct list_head entries[5], *cur; list_test_list_splice_init() local
481 struct list_head entries[5], *cur; list_test_list_splice_tail_init() local
584 struct list_head entries[3], *cur; list_test_list_for_each() local
602 struct list_head entries[3], *cur; list_test_list_for_each_prev() local
620 struct list_head entries[3], *cur, *n; list_test_list_for_each_safe() local
641 struct list_head entries[3], *cur, *n; list_test_list_for_each_prev_safe() local
661 struct list_test_struct entries[5], *cur; list_test_list_for_each_entry() local
682 struct list_test_struct entries[5], *cur; list_test_list_for_each_entry_reverse() local
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/moduletest/src/
H A Ddistributeddb_nb_predicate_query_test.cpp96 const vector<string> &schemasValue, vector<Entry> &entries, const std::string schemaDefine) in PrepareSchemaDBAndData()
116 entries.push_back({keys[index], value}); in PrepareSchemaDBAndData()
120 EXPECT_EQ(DistributedDBNbTestTools::Put(*delegate, entries[index].key, entries[index].value), OK); in PrepareSchemaDBAndData()
128 vector<Entry> entries; in CheckSchemaQuery() local
130 DBStatus statusGot = delegate->GetEntries(queryNeedCheck, entries); in CheckSchemaQuery()
132 MST_LOG("GetEntries entries result: %d, statusGot: %d", result, statusGot); in CheckSchemaQuery()
133 for (unsigned long index = 0; index < entries.size(); index++) { in CheckSchemaQuery()
135 result = (entries[index].key == expectEntry[index].key) && result; in CheckSchemaQuery()
136 MST_LOG("check entries[ in CheckSchemaQuery()
95 PrepareSchemaDBAndData(KvStoreNbDelegate *&delegate, KvStoreDelegateManager *&manager, const vector<string> &schemasValue, vector<Entry> &entries, const std::string schemaDefine) PrepareSchemaDBAndData() argument
170 vector<Entry> entries; CheckSchemaQueryForOrderBy() local
204 vector<Entry> entries; CheckSchemaNotExist() local
273 vector<Entry> entries; HWTEST_F() local
393 vector<Entry> entries; HWTEST_F() local
427 CheckSchemaBoolNotExist(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaBoolNotExist() argument
479 CheckSchemaBoolExist(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaBoolExist() argument
525 vector<Entry> entries; HWTEST_F() local
608 vector<Entry> entries; HWTEST_F() local
655 CheckSchemaExceptionValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaExceptionValue() argument
715 CheckSchemaIntValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaIntValue() argument
786 vector<Entry> entries; HWTEST_F() local
904 vector<Entry> entries; HWTEST_F() local
950 vector<Entry> entries; HWTEST_F() local
1024 vector<Entry> entries; HWTEST_F() local
1058 CheckSchemaDoubleExceptionValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaDoubleExceptionValue() argument
1113 CheckSchemaDoubleValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaDoubleValue() argument
1168 vector<Entry> entries; HWTEST_F() local
1243 vector<Entry> entries; HWTEST_F() local
1300 vector<Entry> entries; HWTEST_F() local
1353 vector<Entry> entries; HWTEST_F() local
1417 vector<Entry> entries; HWTEST_F() local
1483 vector<Entry> entries; HWTEST_F() local
1561 vector<Entry> entries; HWTEST_F() local
1613 vector<Entry> entries; HWTEST_F() local
1682 vector<Entry> entries; HWTEST_F() local
1746 vector<Entry> entries; HWTEST_F() local
1807 vector<Entry> entries; HWTEST_F() local
1840 vector<Entry> entries; HWTEST_F() local
1927 vector<Entry> entries; HWTEST_F() local
[all...]
/third_party/libexif/libexif/huawei/
H A Dexif-mnote-data-huawei.c46 if (n->entries) { in exif_mnote_data_huawei_clear()
48 if (n->entries[i].data) { in exif_mnote_data_huawei_clear()
49 exif_mem_free(d->mem, n->entries[i].data); in exif_mnote_data_huawei_clear()
50 n->entries[i].data = NULL; in exif_mnote_data_huawei_clear()
51 n->entries[i].size = 0; in exif_mnote_data_huawei_clear()
54 if (n->entries[i].md) { in exif_mnote_data_huawei_clear()
55 exif_mnote_data_huawei_clear((ExifMnoteDataHuawei *) n->entries[i].md); in exif_mnote_data_huawei_clear()
56 exif_mem_free(d->mem, n->entries[i].md); in exif_mnote_data_huawei_clear()
57 n->entries[i].md = NULL; in exif_mnote_data_huawei_clear()
61 exif_mem_free (d->mem, n->entries); in exif_mnote_data_huawei_clear()
266 MnoteHuaweiEntry* entries = exif_mem_alloc (ne->mem, sizeof (MnoteHuaweiEntry) * count); exif_mnote_data_huawei_load_data() local
707 MnoteHuaweiEntry *entries = exif_mem_realloc (ne->mem, exif_mnote_data_add_entry() local
833 MnoteHuaweiEntry *entries = n->entries; print_huawei_md() local
[all...]
/third_party/rust/crates/rustix/tests/fs/
H A Dreaddir.rs16 let entries = read_entries(&mut dir); in dir_entries()
17 assert_eq!(entries.len(), 0, "no files in directory"); in dir_entries()
21 let entries = read_entries(&mut dir); in dir_entries()
23 entries.get("file1").is_some(), in dir_entries()
25 entries in dir_entries()
27 assert_eq!(entries.len(), 1); in dir_entries()
30 let entries = read_entries(&mut dir); in dir_entries()
32 entries.get("file1").is_some(), in dir_entries()
34 entries in dir_entries()
37 entries in dir_entries()
[all...]
/third_party/libexif/libexif/apple/
H A Dexif-mnote-data-apple.c42 if (d->entries) { in exif_mnote_data_apple_free()
44 if (d->entries[i].data) { in exif_mnote_data_apple_free()
45 exif_mem_free(md->mem, d->entries[i].data); in exif_mnote_data_apple_free()
48 exif_mem_free(md->mem, d->entries); in exif_mnote_data_apple_free()
49 d->entries = NULL; in exif_mnote_data_apple_free()
107 d->entries = exif_mem_alloc(md->mem, sizeof(MnoteAppleEntry) * tcount); in exif_mnote_data_apple_load()
108 if (!d->entries) { in exif_mnote_data_apple_load()
113 memset(d->entries, 0, sizeof(MnoteAppleEntry) * tcount); in exif_mnote_data_apple_load()
121 d->entries[i].tag = exif_get_short(buf + ofs, d->order); in exif_mnote_data_apple_load()
122 d->entries[ in exif_mnote_data_apple_load()
[all...]
/third_party/libexif/libexif/canon/
H A Dexif-mnote-data-canon.c46 if (n->entries) { in exif_mnote_data_canon_clear()
48 if (n->entries[i].data) { in exif_mnote_data_canon_clear()
49 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_canon_clear()
50 n->entries[i].data = NULL; in exif_mnote_data_canon_clear()
52 exif_mem_free (d->mem, n->entries); in exif_mnote_data_canon_clear()
53 n->entries = NULL; in exif_mnote_data_canon_clear()
74 to = from + mnote_canon_entry_count_values (&dc->entries[*m]); in exif_mnote_data_canon_get_tags()
92 return mnote_canon_entry_get_value (&dc->entries[m], s, val, maxlen); in exif_mnote_data_canon_get_value()
107 if (n->entries[i].components && (n->entries[ in exif_mnote_data_canon_set_byte_order()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/pm/powerplay/hwmgr/
H A Dsmu_helper.c224 vvalue = vol_table->entries[i].value; in phm_trim_voltage_table()
228 if (vvalue == table->entries[j].value) { in phm_trim_voltage_table()
235 table->entries[table->count].value = vvalue; in phm_trim_voltage_table()
236 table->entries[table->count].smio_low = in phm_trim_voltage_table()
237 vol_table->entries[i].smio_low; in phm_trim_voltage_table()
265 vol_table->entries[i].value = dep_table->entries[i].mvdd; in phm_get_svi2_mvdd_voltage_table()
266 vol_table->entries[i].smio_low = 0; in phm_get_svi2_mvdd_voltage_table()
293 vol_table->entries[i].value = dep_table->entries[ in phm_get_svi2_vddci_voltage_table()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DuseObjectValuesAndEntries1.js8 var entries = Object.entries(o); // [string, number][]
11 var entries1 = Object.entries(1); // [string, any][]
14 var entries2 = Object.entries({ a: true, b: 2 }); // [string, number|boolean][]
17 var entries3 = Object.entries({}); // [string, {}][]
21 var entries4 = Object.entries(a); // [string, string][]
25 var entries5 = Object.entries(E); // [string, any][]
30 var entries6 = Object.entries(i); // [string, any][]
39 var entries = Object.entries(
[all...]
/third_party/libexif/libexif/pentax/
H A Dexif-mnote-data-pentax.c41 if (n->entries) { in exif_mnote_data_pentax_clear()
43 if (n->entries[i].data) { in exif_mnote_data_pentax_clear()
44 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_pentax_clear()
45 n->entries[i].data = NULL; in exif_mnote_data_pentax_clear()
47 exif_mem_free (d->mem, n->entries); in exif_mnote_data_pentax_clear()
48 n->entries = NULL; in exif_mnote_data_pentax_clear()
68 return mnote_pentax_entry_get_value (&n->entries[i], val, maxlen); in exif_mnote_data_pentax_get_value()
92 * Allocate enough memory for header, the number of entries, entries, in exif_mnote_data_pentax_save()
141 * such, just has a fixed number of entries equa in exif_mnote_data_pentax_save()
[all...]
/third_party/libexif/libexif/fuji/
H A Dexif-mnote-data-fuji.c45 if (n->entries) { in exif_mnote_data_fuji_clear()
47 if (n->entries[i].data) { in exif_mnote_data_fuji_clear()
48 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_fuji_clear()
49 n->entries[i].data = NULL; in exif_mnote_data_fuji_clear()
51 exif_mem_free (d->mem, n->entries); in exif_mnote_data_fuji_clear()
52 n->entries = NULL; in exif_mnote_data_fuji_clear()
75 mnote_fuji_tag_get_name (n->entries[i].tag)); in exif_mnote_data_fuji_get_value()
77 return mnote_fuji_entry_get_value (&n->entries[i], val, maxlen); in exif_mnote_data_fuji_get_value()
92 * Allocate enough memory for all entries and the number in exif_mnote_data_fuji_save()
93 * of entries in exif_mnote_data_fuji_save()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/pm/powerplay/hwmgr/
H A Dsmu_helper.c224 vvalue = vol_table->entries[i].value; in phm_trim_voltage_table()
228 if (vvalue == table->entries[j].value) { in phm_trim_voltage_table()
235 table->entries[table->count].value = vvalue; in phm_trim_voltage_table()
236 table->entries[table->count].smio_low = in phm_trim_voltage_table()
237 vol_table->entries[i].smio_low; in phm_trim_voltage_table()
265 vol_table->entries[i].value = dep_table->entries[i].mvdd; in phm_get_svi2_mvdd_voltage_table()
266 vol_table->entries[i].smio_low = 0; in phm_get_svi2_mvdd_voltage_table()
293 vol_table->entries[i].value = dep_table->entries[ in phm_get_svi2_vddci_voltage_table()
[all...]
/third_party/rust/crates/nix/src/
H A Dmacros.rs107 entries: [$($entries:tt)*],
113 $($entries)*
123 entries: [$($entries:tt)*],
131 $($entries)*
152 $entries:tt,
161 entries: $entries,
174 $entries
[all...]
/third_party/pulseaudio/src/tests/
H A Dhashmap-test.c83 /* remove_all_test checks that pa_hashmap_remove_all really removes all entries
88 struct int_entry entries[1000]; in START_TEST() local
92 entries[i].key = i; in START_TEST()
93 entries[i].value = i; in START_TEST()
99 pa_hashmap_put(map, &entries[i].key, &entries[i]); in START_TEST()
121 struct int_entry entries[1000]; in START_TEST() local
127 entries[i].key = i; in START_TEST()
129 entries[i].value = i; in START_TEST()
136 if ((put_ret = pa_hashmap_put(map, &entries[ in START_TEST()
173 struct int_entry entries[1000]; START_TEST() local
[all...]
/kernel/linux/linux-5.10/tools/lib/api/fd/
H A Darray.c15 fda->entries = NULL; in fdarray__init()
27 struct pollfd *entries = realloc(fda->entries, size); in fdarray__grow() local
29 if (entries == NULL) in fdarray__grow()
34 free(entries); in fdarray__grow()
38 memset(&entries[fda->nr_alloc], 0, sizeof(struct pollfd) * nr); in fdarray__grow()
42 fda->entries = entries; in fdarray__grow()
65 free(fda->entries); in fdarray__exit()
84 fda->entries[fd in fdarray__add()
[all...]
/kernel/linux/linux-5.10/kernel/events/
H A Dcallchain.c50 struct callchain_cpus_entries *entries; in release_callchain_buffers_rcu() local
53 entries = container_of(head, struct callchain_cpus_entries, rcu_head); in release_callchain_buffers_rcu()
56 kfree(entries->cpu_entries[cpu]); in release_callchain_buffers_rcu()
58 kfree(entries); in release_callchain_buffers_rcu()
63 struct callchain_cpus_entries *entries; in release_callchain_buffers() local
65 entries = callchain_cpus_entries; in release_callchain_buffers()
67 call_rcu(&entries->rcu_head, release_callchain_buffers_rcu); in release_callchain_buffers()
74 struct callchain_cpus_entries *entries; in alloc_callchain_buffers() local
83 entries = kzalloc(size, GFP_KERNEL); in alloc_callchain_buffers()
84 if (!entries) in alloc_callchain_buffers()
155 struct callchain_cpus_entries *entries; get_callchain_entry() local
[all...]
/kernel/linux/linux-6.6/kernel/events/
H A Dcallchain.c50 struct callchain_cpus_entries *entries; in release_callchain_buffers_rcu() local
53 entries = container_of(head, struct callchain_cpus_entries, rcu_head); in release_callchain_buffers_rcu()
56 kfree(entries->cpu_entries[cpu]); in release_callchain_buffers_rcu()
58 kfree(entries); in release_callchain_buffers_rcu()
63 struct callchain_cpus_entries *entries; in release_callchain_buffers() local
65 entries = callchain_cpus_entries; in release_callchain_buffers()
67 call_rcu(&entries->rcu_head, release_callchain_buffers_rcu); in release_callchain_buffers()
74 struct callchain_cpus_entries *entries; in alloc_callchain_buffers() local
83 entries = kzalloc(size, GFP_KERNEL); in alloc_callchain_buffers()
84 if (!entries) in alloc_callchain_buffers()
155 struct callchain_cpus_entries *entries; get_callchain_entry() local
[all...]
/third_party/toybox/toys/posix/
H A Dxargs.c42 long entries, bytes;
47 // If !entry count TT.bytes and TT.entries, stopping at max.
67 if (TT.n && TT.entries >= TT.n) in handle_entries()
82 if (entry) entry[TT.entries] = save; in handle_entries()
83 ++TT.entries; in handle_entries()
89 if ((TT.s && TT.bytes >= TT.s) || (TT.n && TT.entries >= TT.n)) return data; in handle_entries()
90 if (entry) entry[TT.entries] = data; in handle_entries()
91 TT.entries++; in handle_entries()
100 int entries, bytes, done = 0, ran_once = 0, status; in xargs_main() local
121 // count entries in xargs_main()
[all...]
/kernel/linux/linux-6.6/arch/powerpc/mm/book3s64/
H A Diommu_api.c34 u64 entries; /* number of entries in hpas/hpages[] */ member
57 unsigned long entries, unsigned long dev_hpa, in mm_iommu_do_alloc()
66 ret = account_locked_vm(mm, entries, true); in mm_iommu_do_alloc()
70 locked_entries = entries; in mm_iommu_do_alloc()
80 mem->pageshift = __ffs(dev_hpa | (entries << PAGE_SHIFT)); in mm_iommu_do_alloc()
88 * we use @ua and @entries natural alignment to allow IOMMU pages in mm_iommu_do_alloc()
91 mem->pageshift = __ffs(ua | (entries << PAGE_SHIFT)); in mm_iommu_do_alloc()
92 mem->hpas = vzalloc(array_size(entries, sizeof(mem->hpas[0]))); in mm_iommu_do_alloc()
102 chunk = min(chunk, entries); in mm_iommu_do_alloc()
56 mm_iommu_do_alloc(struct mm_struct *mm, unsigned long ua, unsigned long entries, unsigned long dev_hpa, struct mm_iommu_table_group_mem_t **pmem) mm_iommu_do_alloc() argument
186 mm_iommu_new(struct mm_struct *mm, unsigned long ua, unsigned long entries, struct mm_iommu_table_group_mem_t **pmem) mm_iommu_new() argument
194 mm_iommu_newdev(struct mm_struct *mm, unsigned long ua, unsigned long entries, unsigned long dev_hpa, struct mm_iommu_table_group_mem_t **pmem) mm_iommu_newdev() argument
308 mm_iommu_get(struct mm_struct *mm, unsigned long ua, unsigned long entries) mm_iommu_get() argument
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/netronome/nfp/nfpcore/
H A Dnfp_nsp_eth.c281 union eth_table_entry *entries; in __nfp_eth_read_ports() local
285 entries = kzalloc(NSP_ETH_TABLE_SIZE, GFP_KERNEL); in __nfp_eth_read_ports()
286 if (!entries) in __nfp_eth_read_ports()
289 ret = nfp_nsp_read_eth_table(nsp, entries, NSP_ETH_TABLE_SIZE); in __nfp_eth_read_ports()
296 if (entries[i].port & NSP_ETH_PORT_LANES_MASK) in __nfp_eth_read_ports()
304 nfp_err(cpp, "table entry count reported (%d) does not match entries present (%d)\n", in __nfp_eth_read_ports()
315 if (entries[i].port & NSP_ETH_PORT_LANES_MASK) in __nfp_eth_read_ports()
316 nfp_eth_port_translate(nsp, &entries[i], i, in __nfp_eth_read_ports()
325 kfree(entries); in __nfp_eth_read_ports()
330 kfree(entries); in __nfp_eth_read_ports()
336 union eth_table_entry *entries; nfp_eth_config_start() local
373 union eth_table_entry *entries = nfp_nsp_config_entries(nsp); nfp_eth_config_cleanup_end() local
397 union eth_table_entry *entries = nfp_nsp_config_entries(nsp); nfp_eth_config_commit_end() local
426 union eth_table_entry *entries; nfp_eth_set_mod_enable() local
465 union eth_table_entry *entries; nfp_eth_set_configured() local
502 union eth_table_entry *entries = nfp_nsp_config_entries(nsp); nfp_eth_set_bit_config() local
533 union eth_table_entry *entries; nfp_eth_set_idmode() local
[all...]
/foundation/filemanagement/storage_service/services/storage_daemon/file_sharing/src/
H A Dacl.cpp28 for (const auto &e : entries) { in ReCalcMaskPerm()
38 return entries.empty(); in IsEmpty()
43 if (!entries.count(ACL_TAG::USER_OBJ) || !entries.count(ACL_TAG::GROUP_OBJ) || in IsValid()
44 !entries.count(ACL_TAG::OTHER)) { in IsValid()
47 if (maskDemand && !entries.count(ACL_TAG::MASK)) { in IsValid()
55 if (entries.count(entry)) { in CompareInsertEntry()
56 auto it = entries.find(entry); in CompareInsertEntry()
57 entries.erase(it); in CompareInsertEntry()
60 entries in CompareInsertEntry()
[all...]

Completed in 15 milliseconds

12345678910>>...116