Home
last modified time | relevance | path

Searched refs:entries (Results 51 - 75 of 2878) sorted by relevance

12345678910>>...116

/kernel/linux/linux-5.10/lib/
H A Dtest_rhashtable.c31 MODULE_PARM_DESC(parm_entries, "Number of entries to add (default: 50000)");
73 unsigned int entries; member
138 unsigned int entries) in test_rht_lookup()
142 for (i = 0; i < entries; i++) { in test_rht_lookup()
175 static void test_bucket_stats(struct rhashtable *ht, unsigned int entries) in test_bucket_stats() argument
201 pr_info(" Traversal complete: counted=%u, nelems=%u, entries=%d, table-jumps=%u\n", in test_bucket_stats()
202 total, atomic_read(&ht->nelems), entries, chain_len); in test_bucket_stats()
204 if (total != atomic_read(&ht->nelems) || total != entries) in test_bucket_stats()
209 unsigned int entries) in test_rhashtable()
218 * Insert entries int in test_rhashtable()
137 test_rht_lookup(struct rhashtable *ht, struct test_obj *array, unsigned int entries) test_rht_lookup() argument
208 test_rhashtable(struct rhashtable *ht, struct test_obj *array, unsigned int entries) test_rhashtable() argument
269 test_rhltable(unsigned int entries) test_rhltable() argument
448 test_rhashtable_max(struct test_obj *array, unsigned int entries) test_rhashtable_max() argument
603 unsigned int entries = tdata->entries; thread_lookup_test() local
698 unsigned int entries; test_rht_init() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dtest_rhashtable.c31 MODULE_PARM_DESC(parm_entries, "Number of entries to add (default: 50000)");
73 unsigned int entries; member
138 unsigned int entries) in test_rht_lookup()
142 for (i = 0; i < entries; i++) { in test_rht_lookup()
175 static void test_bucket_stats(struct rhashtable *ht, unsigned int entries) in test_bucket_stats() argument
201 pr_info(" Traversal complete: counted=%u, nelems=%u, entries=%d, table-jumps=%u\n", in test_bucket_stats()
202 total, atomic_read(&ht->nelems), entries, chain_len); in test_bucket_stats()
204 if (total != atomic_read(&ht->nelems) || total != entries) in test_bucket_stats()
209 unsigned int entries) in test_rhashtable()
218 * Insert entries int in test_rhashtable()
137 test_rht_lookup(struct rhashtable *ht, struct test_obj *array, unsigned int entries) test_rht_lookup() argument
208 test_rhashtable(struct rhashtable *ht, struct test_obj *array, unsigned int entries) test_rhashtable() argument
269 test_rhltable(unsigned int entries) test_rhltable() argument
434 test_rhashtable_max(struct test_obj *array, unsigned int entries) test_rhashtable_max() argument
588 unsigned int entries = tdata->entries; thread_lookup_test() local
683 unsigned int entries; test_rht_init() local
[all...]
/kernel/linux/linux-5.10/tools/perf/trace/beauty/
H A Dioctl.c41 if (nr < strarray__ioctl_tty_cmd.nr_entries && strarray__ioctl_tty_cmd.entries[nr] != NULL) in ioctl__scnprintf_tty_cmd()
42 return scnprintf(bf, size, "%s", strarray__ioctl_tty_cmd.entries[nr]); in ioctl__scnprintf_tty_cmd()
52 if (nr < strarray__drm_ioctl_cmds.nr_entries && strarray__drm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_drm_cmd()
53 return scnprintf(bf, size, "DRM_%s", strarray__drm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_drm_cmd()
63 if (nr < strarray__sndrv_pcm_ioctl_cmds.nr_entries && strarray__sndrv_pcm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_sndrv_pcm_cmd()
64 return scnprintf(bf, size, "SNDRV_PCM_%s", strarray__sndrv_pcm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_sndrv_pcm_cmd()
74 if (nr < strarray__sndrv_ctl_ioctl_cmds.nr_entries && strarray__sndrv_ctl_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_sndrv_ctl_cmd()
75 return scnprintf(bf, size, "SNDRV_CTL_%s", strarray__sndrv_ctl_ioctl_cmds.entries[nr]); in ioctl__scnprintf_sndrv_ctl_cmd()
85 if (nr < strarray__kvm_ioctl_cmds.nr_entries && strarray__kvm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_kvm_cmd()
86 return scnprintf(bf, size, "KVM_%s", strarray__kvm_ioctl_cmds.entries[n in ioctl__scnprintf_kvm_cmd()
[all...]
/kernel/linux/linux-6.6/tools/perf/trace/beauty/
H A Dioctl.c41 if (nr < strarray__ioctl_tty_cmd.nr_entries && strarray__ioctl_tty_cmd.entries[nr] != NULL) in ioctl__scnprintf_tty_cmd()
42 return scnprintf(bf, size, "%s", strarray__ioctl_tty_cmd.entries[nr]); in ioctl__scnprintf_tty_cmd()
52 if (nr < strarray__drm_ioctl_cmds.nr_entries && strarray__drm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_drm_cmd()
53 return scnprintf(bf, size, "DRM_%s", strarray__drm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_drm_cmd()
63 if (nr < strarray__sndrv_pcm_ioctl_cmds.nr_entries && strarray__sndrv_pcm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_sndrv_pcm_cmd()
64 return scnprintf(bf, size, "SNDRV_PCM_%s", strarray__sndrv_pcm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_sndrv_pcm_cmd()
74 if (nr < strarray__sndrv_ctl_ioctl_cmds.nr_entries && strarray__sndrv_ctl_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_sndrv_ctl_cmd()
75 return scnprintf(bf, size, "SNDRV_CTL_%s", strarray__sndrv_ctl_ioctl_cmds.entries[nr]); in ioctl__scnprintf_sndrv_ctl_cmd()
85 if (nr < strarray__kvm_ioctl_cmds.nr_entries && strarray__kvm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_kvm_cmd()
86 return scnprintf(bf, size, "KVM_%s", strarray__kvm_ioctl_cmds.entries[n in ioctl__scnprintf_kvm_cmd()
[all...]
/third_party/libexif/libexif/
H A Dexif-content.c107 exif_entry_unref (content->entries[i]); in exif_content_free()
108 exif_mem_free (mem, content->entries); in exif_content_free()
132 printf ("%sDumping exif content (%u entries)...\n", buf, in exif_content_dump()
135 exif_entry_dump (content->entries[i], indent + 1); in exif_content_dump()
141 ExifEntry **entries; in exif_content_add_entry() local
153 entries = exif_mem_realloc (c->priv->mem, in exif_content_add_entry()
154 c->entries, sizeof (ExifEntry*) * (c->count + 1)); in exif_content_add_entry()
155 if (!entries) return; in exif_content_add_entry()
157 entries[c->count++] = entry; in exif_content_add_entry()
158 c->entries in exif_content_add_entry()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/util/
H A Du_log.c35 struct page_entry *entries; member
165 struct page_entry *new_entries = REALLOC(page->entries, in u_log_chunk()
166 page->max_entries * sizeof(*page->entries), in u_log_chunk()
167 new_max_entries * sizeof(*page->entries)); in u_log_chunk()
171 page->entries = new_entries; in u_log_chunk()
175 page->entries[page->num_entries].type = type; in u_log_chunk()
176 page->entries[page->num_entries].data = data; in u_log_chunk()
224 if (page->entries[i].type->destroy) in u_log_page_destroy()
225 page->entries[i].type->destroy(page->entries[ in u_log_page_destroy()
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/
H A De820.c28 * the first 128 E820 memory entries in boot_params.e820_table and the remaining
29 * (if any) entries of the SETUP_E820_EXT nodes. We use this to:
83 struct e820_entry *entry = &table->entries[i]; in _e820__mapped_any()
118 struct e820_entry *entry = &e820_table->entries[i]; in __e820__mapped_all()
170 if (x >= ARRAY_SIZE(table->entries)) { in __e820__range_add()
171 pr_err("too many entries; ignoring [mem %#010llx-%#010llx]\n", in __e820__range_add()
176 table->entries[x].addr = start; in __e820__range_add()
177 table->entries[x].size = size; in __e820__range_add()
178 table->entries[x].type = type; in __e820__range_add()
210 e820_table->entries[ in e820__print_table()
324 struct e820_entry *entries = table->entries; e820__update_table() local
422 __append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) __append_e820_table() argument
453 append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) append_e820_table() argument
726 int entries; e820__memory_setup_extended() local
[all...]
/kernel/linux/linux-6.6/arch/x86/kernel/
H A De820.c28 * the first 128 E820 memory entries in boot_params.e820_table and the remaining
29 * (if any) entries of the SETUP_E820_EXT nodes. We use this to:
83 struct e820_entry *entry = &table->entries[i]; in _e820__mapped_any()
118 struct e820_entry *entry = &e820_table->entries[i]; in __e820__mapped_all()
170 if (x >= ARRAY_SIZE(table->entries)) { in __e820__range_add()
171 pr_err("too many entries; ignoring [mem %#010llx-%#010llx]\n", in __e820__range_add()
176 table->entries[x].addr = start; in __e820__range_add()
177 table->entries[x].size = size; in __e820__range_add()
178 table->entries[x].type = type; in __e820__range_add()
210 e820_table->entries[ in e820__print_table()
324 struct e820_entry *entries = table->entries; e820__update_table() local
422 __append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) __append_e820_table() argument
453 append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) append_e820_table() argument
726 int entries; e820__memory_setup_extended() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/pm/legacy-dpm/
H A Dlegacy_dpm.c193 amdgpu_table->entries = kzalloc(size, GFP_KERNEL); in amdgpu_parse_clk_voltage_dep_table()
194 if (!amdgpu_table->entries) in amdgpu_parse_clk_voltage_dep_table()
197 entry = &atom_table->entries[0]; in amdgpu_parse_clk_voltage_dep_table()
199 amdgpu_table->entries[i].clk = le16_to_cpu(entry->usClockLow) | in amdgpu_parse_clk_voltage_dep_table()
201 amdgpu_table->entries[i].v = le16_to_cpu(entry->usVoltage); in amdgpu_parse_clk_voltage_dep_table()
312 le16_to_cpu(clk_v->entries[0].usSclkLow) | in amdgpu_parse_extended_power_table()
313 (clk_v->entries[0].ucSclkHigh << 16); in amdgpu_parse_extended_power_table()
315 le16_to_cpu(clk_v->entries[0].usMclkLow) | in amdgpu_parse_extended_power_table()
316 (clk_v->entries[0].ucMclkHigh << 16); in amdgpu_parse_extended_power_table()
318 le16_to_cpu(clk_v->entries[ in amdgpu_parse_extended_power_table()
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/storage/src/kv/
H A Dkvdb_commit_notify_filterable_data.cpp35 std::list<Entry> entries; in GetInsertedEntries() local
37 return entries; in GetInsertedEntries()
42 std::list<Entry> entries; in GetUpdatedEntries() local
44 return entries; in GetUpdatedEntries()
49 std::list<Entry> entries; in GetDeletedEntries() local
51 return entries; in GetDeletedEntries()
56 std::list<KvDBConflictEntry> entries; in GetCommitConflicts() local
58 return entries; in GetCommitConflicts()
/kernel/linux/linux-5.10/drivers/misc/vmw_vmci/
H A Dvmci_handle_array.c68 array->entries[array->size] = handle; in vmci_handle_arr_append_entry()
84 if (vmci_handle_is_equal(array->entries[i], entry_handle)) { in vmci_handle_arr_remove_entry()
85 handle = array->entries[i]; in vmci_handle_arr_remove_entry()
87 array->entries[i] = array->entries[array->size]; in vmci_handle_arr_remove_entry()
88 array->entries[array->size] = VMCI_INVALID_HANDLE; in vmci_handle_arr_remove_entry()
105 handle = array->entries[array->size]; in vmci_handle_arr_remove_tail()
106 array->entries[array->size] = VMCI_INVALID_HANDLE; in vmci_handle_arr_remove_tail()
121 return array->entries[index]; in vmci_handle_arr_get_entry()
130 if (vmci_handle_is_equal(array->entries[ in vmci_handle_arr_has_entry()
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Drb_resort.h6 * a new sort criteria, that must be present in the entries of the source
15 * fields to be present in each of the entries in the new, sorted, rb_tree.
18 * pre-calculating them from multiple entries in the original 'entry' from
19 * the rb_tree used as a source for the entries to be sorted:
72 struct rb_root entries; \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
92 struct rb_root *entries) \
96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
103 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \
[all...]
/kernel/linux/linux-6.6/drivers/misc/vmw_vmci/
H A Dvmci_handle_array.c68 array->entries[array->size] = handle; in vmci_handle_arr_append_entry()
84 if (vmci_handle_is_equal(array->entries[i], entry_handle)) { in vmci_handle_arr_remove_entry()
85 handle = array->entries[i]; in vmci_handle_arr_remove_entry()
87 array->entries[i] = array->entries[array->size]; in vmci_handle_arr_remove_entry()
88 array->entries[array->size] = VMCI_INVALID_HANDLE; in vmci_handle_arr_remove_entry()
105 handle = array->entries[array->size]; in vmci_handle_arr_remove_tail()
106 array->entries[array->size] = VMCI_INVALID_HANDLE; in vmci_handle_arr_remove_tail()
121 return array->entries[index]; in vmci_handle_arr_get_entry()
130 if (vmci_handle_is_equal(array->entries[ in vmci_handle_arr_has_entry()
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Drb_resort.h6 * a new sort criteria, that must be present in the entries of the source
15 * fields to be present in each of the entries in the new, sorted, rb_tree.
18 * pre-calculating them from multiple entries in the original 'entry' from
19 * the rb_tree used as a source for the entries to be sorted:
72 struct rb_root entries; \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
92 struct rb_root *entries) \
96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
103 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \
[all...]
/third_party/node/test/parallel/
H A Dtest-performance-resourcetimingbufferfull.js59 const entries = performance.getEntriesByType('resource');
60 assert.strictEqual(entries.length, 1);
61 assert.strictEqual(entries[0].startTime, 2);
89 const entries = performance.getEntriesByType('resource');
90 assert.strictEqual(entries.length, 2);
91 assert.strictEqual(entries[0].startTime, 4);
92 assert.strictEqual(entries[1].startTime, 5);
120 const entries = performance.getEntriesByType('resource');
121 assert.strictEqual(entries.length, 2);
122 assert.strictEqual(entries[
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/cpu/
H A Dintel.c299 * the TLB when any changes are made to any of the page table entries. in early_init_intel()
793 { 0xb1, TLB_INST_2M_4M, 4, " TLB_INST 2M pages, 4-way, 8 entries or 4M pages, 4-way entries" },
823 if (tlb_lli_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
824 tlb_lli_4k[ENTRIES] = intel_tlb_table[k].entries; in intel_tlb_lookup()
825 if (tlb_lld_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
826 tlb_lld_4k[ENTRIES] = intel_tlb_table[k].entries; in intel_tlb_lookup()
829 if (tlb_lli_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
830 tlb_lli_4k[ENTRIES] = intel_tlb_table[k].entries; in intel_tlb_lookup()
831 if (tlb_lld_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
[all...]
/kernel/linux/linux-6.6/arch/x86/kernel/cpu/
H A Dintel.c389 * the TLB when any changes are made to any of the page table entries. in early_init_intel()
802 { 0xb1, TLB_INST_2M_4M, 4, " TLB_INST 2M pages, 4-way, 8 entries or 4M pages, 4-way entries" },
832 if (tlb_lli_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
833 tlb_lli_4k[ENTRIES] = intel_tlb_table[k].entries; in intel_tlb_lookup()
834 if (tlb_lld_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
835 tlb_lld_4k[ENTRIES] = intel_tlb_table[k].entries; in intel_tlb_lookup()
838 if (tlb_lli_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
839 tlb_lli_4k[ENTRIES] = intel_tlb_table[k].entries; in intel_tlb_lookup()
840 if (tlb_lld_4k[ENTRIES] < intel_tlb_table[k].entries) in intel_tlb_lookup()
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/innerkitsimpl/distributeddatafwk/test/unittest/
H A Dsingle_kvstore_client_test.cpp212 EXPECT_EQ(results.size(), sum) << "entries size is not equal 10."; in HWTEST_F()
260 EXPECT_EQ(results.size(), sum) << "entries size is not equal 10."; in HWTEST_F()
303 EXPECT_EQ(results.size(), 0) << "entries size is not empty."; in HWTEST_F()
496 // store entries to kvstore. in HWTEST_F()
497 std::vector<Entry> entries; in HWTEST_F() local
505 entries.push_back(entry1); in HWTEST_F()
506 entries.push_back(entry2); in HWTEST_F()
507 entries.push_back(entry3); in HWTEST_F()
509 Status status = singleKvStore->PutBatch(entries); in HWTEST_F()
599 std::vector<Entry> entries; in HWTEST_F() local
626 std::vector<Entry> entries; HWTEST_F() local
663 std::vector<Entry> entries; HWTEST_F() local
696 std::vector<Entry> entries; HWTEST_F() local
739 std::vector<Entry> entries; HWTEST_F() local
779 std::vector<Entry> entries; HWTEST_F() local
820 std::vector<Entry> entries; HWTEST_F() local
860 std::vector<Entry> entries; HWTEST_F() local
905 std::vector<Entry> entries; HWTEST_F() local
959 std::vector<Entry> entries; HWTEST_F() local
1016 std::vector<Entry> entries; HWTEST_F() local
[all...]
H A Ddevice_kvstore_test.cpp210 * @tc.desc: get entries and result set by data query.
235 EXPECT_EQ(results.size(), sum) << "entries size is not equal 10."; in HWTEST_F()
264 * @tc.desc: get entries and result set by prefix query.
291 EXPECT_EQ(results.size(), sum) << "entries size is not equal 10."; in HWTEST_F()
320 * @tc.desc: get entries and result set by prefix query.
373 * @tc.desc: get entries and result set by prefix.
391 EXPECT_EQ(results.size(), sum) << "entries size is not equal 10."; in HWTEST_F()
607 // store entries to kvstore. in HWTEST_F()
608 std::vector<Entry> entries; in HWTEST_F() local
616 entries in HWTEST_F()
710 std::vector<Entry> entries; HWTEST_F() local
738 std::vector<Entry> entries; HWTEST_F() local
774 std::vector<Entry> entries; HWTEST_F() local
807 std::vector<Entry> entries; HWTEST_F() local
850 std::vector<Entry> entries; HWTEST_F() local
890 std::vector<Entry> entries; HWTEST_F() local
931 std::vector<Entry> entries; HWTEST_F() local
972 std::vector<Entry> entries; HWTEST_F() local
1018 std::vector<Entry> entries; HWTEST_F() local
1072 std::vector<Entry> entries; HWTEST_F() local
1129 std::vector<Entry> entries; HWTEST_F() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/display/dc/dml/dcn302/
H A Ddcn302_fpu.c220 if (bw_params->clk_table.entries[0].memclk_mhz) { in dcn302_fpu_update_bw_bounding_box()
224 if (bw_params->clk_table.entries[i].dcfclk_mhz > max_dcfclk_mhz) in dcn302_fpu_update_bw_bounding_box()
225 max_dcfclk_mhz = bw_params->clk_table.entries[i].dcfclk_mhz; in dcn302_fpu_update_bw_bounding_box()
226 if (bw_params->clk_table.entries[i].dispclk_mhz > max_dispclk_mhz) in dcn302_fpu_update_bw_bounding_box()
227 max_dispclk_mhz = bw_params->clk_table.entries[i].dispclk_mhz; in dcn302_fpu_update_bw_bounding_box()
228 if (bw_params->clk_table.entries[i].dppclk_mhz > max_dppclk_mhz) in dcn302_fpu_update_bw_bounding_box()
229 max_dppclk_mhz = bw_params->clk_table.entries[i].dppclk_mhz; in dcn302_fpu_update_bw_bounding_box()
230 if (bw_params->clk_table.entries[i].phyclk_mhz > max_phyclk_mhz) in dcn302_fpu_update_bw_bounding_box()
231 max_phyclk_mhz = bw_params->clk_table.entries[i].phyclk_mhz; in dcn302_fpu_update_bw_bounding_box()
262 dcn302_get_optimal_dcfclk_fclk_for_uclk(bw_params->clk_table.entries[ in dcn302_fpu_update_bw_bounding_box()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/display/dc/dml/dcn303/
H A Ddcn303_fpu.c216 if (bw_params->clk_table.entries[0].memclk_mhz) { in dcn303_fpu_update_bw_bounding_box()
220 if (bw_params->clk_table.entries[i].dcfclk_mhz > max_dcfclk_mhz) in dcn303_fpu_update_bw_bounding_box()
221 max_dcfclk_mhz = bw_params->clk_table.entries[i].dcfclk_mhz; in dcn303_fpu_update_bw_bounding_box()
222 if (bw_params->clk_table.entries[i].dispclk_mhz > max_dispclk_mhz) in dcn303_fpu_update_bw_bounding_box()
223 max_dispclk_mhz = bw_params->clk_table.entries[i].dispclk_mhz; in dcn303_fpu_update_bw_bounding_box()
224 if (bw_params->clk_table.entries[i].dppclk_mhz > max_dppclk_mhz) in dcn303_fpu_update_bw_bounding_box()
225 max_dppclk_mhz = bw_params->clk_table.entries[i].dppclk_mhz; in dcn303_fpu_update_bw_bounding_box()
226 if (bw_params->clk_table.entries[i].phyclk_mhz > max_phyclk_mhz) in dcn303_fpu_update_bw_bounding_box()
227 max_phyclk_mhz = bw_params->clk_table.entries[i].phyclk_mhz; in dcn303_fpu_update_bw_bounding_box()
256 dcn303_get_optimal_dcfclk_fclk_for_uclk(bw_params->clk_table.entries[ in dcn303_fpu_update_bw_bounding_box()
[all...]
/third_party/protobuf/js/compatibility_tests/v3.1.0/
H A Dmaps_test.js44 * Helper: check that the given map has exactly this set of (sorted) entries.
46 * @param {!Array<!Array<?>>} entries
48 function checkMapEquals(map, entries) {
50 assertEquals(arr.length, entries.length);
52 assertElementsEquals(arr[i], entries[i]);
151 var entries = toArray(msg.getMapStringMsgMap().entries());
152 assertEquals(entries.length, 2);
153 entries.forEach(function(entry) {
186 var it = m.entries();
[all...]
/third_party/rust/crates/syn/src/
H A Dbuffer.rs18 // Group entries contain the offset to the matching End entry.
23 // End entries contain the offset (negative) to the start of the buffer.
33 entries: Box<[Entry]>,
37 fn recursive_new(entries: &mut Vec<Entry>, stream: TokenStream) { in recursive_new()
40 TokenTree::Ident(ident) => entries.push(Entry::Ident(ident)), in recursive_new()
41 TokenTree::Punct(punct) => entries.push(Entry::Punct(punct)), in recursive_new()
42 TokenTree::Literal(literal) => entries.push(Entry::Literal(literal)), in recursive_new()
44 let group_start_index = entries.len(); in recursive_new()
45 entries.push(Entry::End(0)); // we replace this below in recursive_new()
46 Self::recursive_new(entries, grou in recursive_new()
67 let mut entries = Vec::new(); new2() variables
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/moduletest/src/
H A Ddistributeddb_nb_cursor_testcase.cpp139 std::vector<DistributedDB::Entry> entries; in ResultSetDb001() local
141 GenerateAppointPrefixAndSizeRecords(entries, entrySize, ONE_HUNDRED_RECORDS); in ResultSetDb001()
143 EXPECT_TRUE(delegate->Put(entries[index].key, entries[index].value) == OK); in ResultSetDb001()
226 std::vector<DistributedDB::Entry> entries; in ResultSetDb002() local
228 GenerateAppointPrefixAndSizeRecords(entries, entrySize, ONE_HUNDRED_RECORDS); in ResultSetDb002()
230 EXPECT_TRUE(delegate->Put(entries[index].key, entries[index].value) == OK); in ResultSetDb002()
239 sort(entries.begin(), entries in ResultSetDb002()
296 std::vector<DistributedDB::Entry> entries; ResultSetDb003() local
372 std::vector<DistributedDB::Entry> entries; ResultSetDb004() local
446 std::vector<DistributedDB::Entry> entries; ResultSetDb005() local
527 std::vector<DistributedDB::Entry> entries; ResultSetDb006() local
588 std::vector<DistributedDB::Entry> entries; ResultSetDb007() local
642 std::vector<DistributedDB::Entry> entries; ResultSetDb008() local
708 std::vector<DistributedDB::Entry> entries; ResultSetDb009() local
791 std::vector<DistributedDB::Entry> entries; ResultSetDb010() local
840 std::vector<DistributedDB::Entry> entries; ResultSetDb011() local
898 std::vector<DistributedDB::Entry> entries; ResultSetDb012() local
966 std::vector<DistributedDB::Entry> entries; ResultSetDb013() local
1033 std::vector<DistributedDB::Entry> entries; ResultSetDb014() local
1104 std::vector<DistributedDB::Entry> entries; ResultSetDb015() local
1167 std::vector<DistributedDB::Entry> entries; ResultSetDb016() local
1230 vector<Entry> entries; ResultSetDb017() local
1455 vector<Entry> entries; ResultSetDb020() local
1469 vector<Entry> entries; ResultSetDb021() local
[all...]
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dx_name.c96 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL) in x509_name_ex_new()
107 sk_X509_NAME_ENTRY_free(ret->entries); in x509_name_ex_new()
122 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free); in x509_name_ex_free()
157 STACK_OF(X509_NAME_ENTRY) *entries; in x509_name_ex_d2i()
183 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); in x509_name_ex_d2i()
184 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { in x509_name_ex_d2i()
185 entry = sk_X509_NAME_ENTRY_value(entries, j); in x509_name_ex_d2i()
187 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) in x509_name_ex_d2i()
189 (void)sk_X509_NAME_ENTRY_set(entries, j, NULL); in x509_name_ex_d2i()
243 STACK_OF(X509_NAME_ENTRY) *entries in x509_name_encode()
[all...]

Completed in 16 milliseconds

12345678910>>...116