Home
last modified time | relevance | path

Searched refs:entries (Results 76 - 100 of 819) sorted by relevance

12345678910>>...33

/third_party/jerryscript/tests/unit-core/
H A Dtest-api-value-type.cpp78 test_entry_t entries[] = in HWTEST_F() local
106 for (size_t idx = 0; idx < sizeof (entries) / sizeof (entries[0]); idx++) in HWTEST_F()
108 jerry_type_t type_info = jerry_value_get_type (entries[idx].value); in HWTEST_F()
111 TEST_ASSERT (type_info == entries[idx].type_info); in HWTEST_F()
113 jerry_release_value (entries[idx].value); in HWTEST_F()
/third_party/node/deps/uv/src/win/
H A Dfs-fd-hash-inl.h59 struct uv__fd_hash_entry_s entries[UV__FD_HASH_GROUP_SIZE]; member
102 if (group_ptr->entries[i].fd == fd) { \
103 entry_ptr = &group_ptr->entries[i]; \
158 entry_ptr = &bucket_ptr->data->entries[i]; in uv__fd_hash_add()
180 if (entry_ptr != &bucket_ptr->data->entries[i]) { in uv__fd_hash_remove()
181 *entry_ptr = bucket_ptr->data->entries[i]; in uv__fd_hash_remove()
/third_party/python/Lib/test/
H A Dtest_spwd.py17 entries = spwd.getspall()
18 self.assertIsInstance(entries, list)
19 for entry in entries:
23 entries = spwd.getspall()
24 if not entries:
26 random_name = entries[0].sp_namp
H A Dtest_pwd.py11 entries = pwd.getpwall()
13 for e in entries:
30 # The following won't work, because of duplicate entries
33 # instead of this collect all entries for one uid
37 entries = pwd.getpwall()
41 if len(entries) > 1000: # Huge passwd file (NIS?) -- skip this test
44 for e in entries:
50 for e in entries:
52 continue # skip NIS entries etc.
/test/xts/acts/distributeddatamgr/distributedKVStoretest/distributedKVStorejstest/hap/entry/src/ohosTest/js/test/
H A DSchemaJsTest.js28 let entries = [];
30 entries.push({
38 return entries;
56 let entries = putBatchString(10, 'test_key_');
57 kvStore.putBatch(entries).then((data) => {
73 await kvStore.getEntries(query).then((entries) => {
74 console.info('testPutAndGet get success : ' + JSON.stringify(entries));
75 expect(entries.length == 10).assertTrue();
247 await kvStore.getEntries(query).then((entries) => {
248 console.info('SUB_DDM_DKV_SCHEMA_TOJSONSTRING_0300 get success : ' + JSON.stringify(entries));
[all...]
H A DDeviceKvStoreKVPromiseJsTest.js47 let entries = [];
56 entries.push(entry);
58 return entries;
1242 let entries = putBatchString(10, 'batch_test_string_key');
1243 console.info('SUB_DDM_DKV_DEVICEKVSTORE_PUTBATCH_PROMISE_0100 entries: ' + JSON.stringify(entries));
1244 await kvStore.putBatch(entries).then(async (err) => {
1279 let entries = [];
1289 entries.push(entry);
1291 console.info('SUB_DDM_DKV_DEVICEKVSTORE_PUTBATCH_PROMISE_0200 entries
[all...]
H A DSingleKvStoreKVCallbackJsTest.js46 let entries = [];
55 entries.push(entry);
57 return entries;
1088 let entries = [];
1098 entries.push(entry);
1100 console.info('SingleKvStorePutBatchEntryCallbackTest001 entries: ' + JSON.stringify(entries));
1101 await kvStore.putBatch(entries, async function (err,data) {
1129 let entries = [];
1139 entries
[all...]
/test/xts/acts/distributeddatamgr/kvStoretest/kvStorejstest/hap/entry/src/ohosTest/js/test/
H A DSchemaJsunit.test.js25 let entries = [];
27 entries.push({
35 return entries;
53 let entries = putBatchString(10, 'test_key_');
54 kvStore.putBatch(entries).then((data) => {
70 await kvStore.getEntries(query).then((entries) => {
71 console.info('testPutAndGet get success : ' + JSON.stringify(entries));
72 expect(entries.length == 10).assertTrue();
249 await kvStore.getEntries(query).then((entries) => {
250 console.info('testToJsonString003 get success : ' + JSON.stringify(entries));
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_vec4_copy_propagation.cpp468 struct copy_entry entries[alloc.total_size]; in opt_copy_propagation() local
470 memset(&entries, 0, sizeof(entries)); in opt_copy_propagation()
481 memset(&entries, 0, sizeof(entries)); in opt_copy_propagation()
504 const copy_entry &entry = entries[reg]; in opt_copy_propagation()
522 entries[reg].saturatemask &= ~inst->dst.writemask; in opt_copy_propagation()
525 entries[reg].value[i] = direct_copy ? &inst->src[0] : NULL; in opt_copy_propagation()
526 entries[reg].saturatemask |= in opt_copy_propagation()
535 memset(&entries, in opt_copy_propagation()
[all...]
/third_party/mesa3d/src/gallium/drivers/d3d12/
H A Dd3d12_pipeline_state.cpp99 D3D12_SO_DECLARATION_ENTRY *entries, UINT *num_entries, in fill_so_declaration()
111 /* Mesa doesn't store entries for gl_SkipComponents in the Outputs[] in fill_so_declaration()
115 * DirectX12 requires that we create gap entries. in fill_so_declaration()
120 entries[*num_entries].Stream = output->stream; in fill_so_declaration()
121 entries[*num_entries].SemanticName = NULL; in fill_so_declaration()
122 entries[*num_entries].ComponentCount = skip_components; in fill_so_declaration()
123 entries[*num_entries].OutputSlot = buffer; in fill_so_declaration()
129 entries[*num_entries].Stream = output->stream; in fill_so_declaration()
133 entries[*num_entries].SemanticName = get_semantic_name(var->data.location, in fill_so_declaration()
135 entries[*num_entrie in fill_so_declaration()
97 fill_so_declaration(const struct pipe_stream_output_info *info, nir_shader *last_vertex_stage, D3D12_SO_DECLARATION_ENTRY *entries, UINT *num_entries, UINT *strides, UINT *num_strides) fill_so_declaration() argument
223 D3D12_SO_DECLARATION_ENTRY entries[PIPE_MAX_SO_OUTPUTS] = {}; create_gfx_pipeline_state() local
[all...]
/third_party/mesa3d/src/asahi/compiler/
H A Dagx_lower_parallel_copy.c69 /* For each physreg, the number of pending copy entries that use it as a
78 struct agx_copy entries[AGX_NUM_REGS]; member
106 struct agx_copy *new_entry = &ctx->entries[ctx->entry_count++]; in split_32bit_copy()
134 ctx->entries[i] = *entry; in agx_emit_parallel_copies()
160 struct agx_copy *entry = &ctx->entries[i]; in agx_emit_parallel_copies()
187 struct agx_copy *entry = &ctx->entries[i]; in agx_emit_parallel_copies()
237 struct agx_copy *entry = &ctx->entries[i]; in agx_emit_parallel_copies()
256 struct agx_copy *blocking = &ctx->entries[j]; in agx_emit_parallel_copies()
275 struct agx_copy *blocking = &ctx->entries[j]; in agx_emit_parallel_copies()
/third_party/f2fs-tools/fsck/
H A Dsload.c49 int entries, struct dentry *de) in f2fs_make_directory()
54 for (i = 0; i < entries; i++) { in f2fs_make_directory()
207 int entries = 0; in build_directory() local
212 entries = scandir(full_path, &namelist, filter_dot, (void *)alphasort); in build_directory()
213 if (entries < 0) { in build_directory()
214 ERR_MSG("No entries in %s\n", full_path); in build_directory()
218 dentries = calloc(entries, sizeof(struct dentry)); in build_directory()
221 for (i = 0; i < entries; i++) { in build_directory()
244 ret = f2fs_make_directory(sbi, entries, dentries); in build_directory()
248 for (i = 0; i < entries; in build_directory()
48 f2fs_make_directory(struct f2fs_sb_info *sbi, int entries, struct dentry *de) f2fs_make_directory() argument
[all...]
/third_party/node/deps/npm/node_modules/ignore-walk/lib/
H A Dindex.js23 this.entries = null
53 fs.readdir(this.path, (er, entries) =>
54 er ? this.emit('error', er) : this.onReaddir(entries))
64 onReaddir (entries) {
65 this.entries = entries
66 if (entries.length === 0) {
72 const hasIg = this.entries.some(e =>
84 const newIg = this.entries
124 // entries i
[all...]
/third_party/jerryscript/tests/jerry/es2015/
H A Dtypedarray-prototype-entires.js28 e.prototype.entries.call (undefined);
37 var iterator = e.entries ();
64 iterator = e.entries ();
71 assert ([].entries ().toString () === "[object Array Iterator]");
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_callstack.cpp86 int entries; in update_max_depth() local
131 entries = (elements + (entry_size - 1)) / entry_size; in update_max_depth()
133 if (entries > stack.max_entries) in update_max_depth()
134 stack.max_entries = entries; in update_max_depth()
/third_party/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.c74 /** Max entries in the cache */
77 /** Array [size] of entries */
78 struct util_cache_entry *entries; member
80 /** Number of entries in the cache */
94 * Create a new cache with 'size' entries. Also provide functions for
118 cache->entries = CALLOC(size, sizeof(struct util_cache_entry)); in util_cache_create()
119 if (!cache->entries) { in util_cache_create()
150 struct util_cache_entry *current = &cache->entries[i]; in util_cache_entry_get()
258 * Remove all entries from the cache. The 'destroy' function will be called
271 util_cache_entry_destroy(cache, &cache->entries[ in util_cache_clear()
[all...]
/applications/standard/app_samples/code/SuperFeature/DistributedAppDev/DistributeCalc/entry/src/main/js/MainAbility/common/
H A DkvstoreModel.js110 let entries = data.insertEntries.length > 0 ? data.insertEntries : data.updateEntries
111 this.simplify(entries, msg, refreshdata)
120 simplify(entries, msg, refreshdata) {
121 for (let i = 0; i < entries.length; i++) {
122 if (entries[i].key === msg) {
123 let value = entries[i].value.value
/third_party/skia/third_party/externals/harfbuzz/util/
H A Doptions.hh109 void add_group (GOptionEntry *entries, in add_group()
118 g_option_group_add_entries (group, entries); in add_group()
125 void add_main_group (GOptionEntry *entries, in add_main_group()
130 g_option_group_add_entries (group, entries); in add_main_group()
192 GOptionEntry entries[] = in add_options() local
198 g_option_context_add_main_entries (context, entries, nullptr); in add_options()
/third_party/pulseaudio/src/pulsecore/
H A Dipacl.c61 PA_LLIST_HEAD(struct acl_entry, entries);
72 PA_LLIST_HEAD_INIT(struct acl_entry, acl->entries); in pa_ip_acl_new()
141 PA_LLIST_PREPEND(struct acl_entry, acl->entries, n); in pa_ip_acl_new()
158 while (acl->entries) { in pa_ip_acl_free()
159 struct acl_entry *e = acl->entries; in pa_ip_acl_free()
160 PA_LLIST_REMOVE(struct acl_entry, acl->entries, e); in pa_ip_acl_free()
194 for (e = acl->entries; e; e = e->next) { in pa_ip_acl_check()
/third_party/ffmpeg/libavformat/
H A Dmovenchint.c251 AVIOContext *out, int *entries) in output_immediate()
265 (*entries)++; in output_immediate()
270 int match_offset, int match_len, int *entries) in output_match()
279 (*entries)++; in output_match()
283 AVIOContext *out, int *entries, in describe_payload()
292 output_immediate(data, pos, out, entries); in describe_payload()
295 output_match(out, match_sample, match_offset, match_len, entries); in describe_payload()
299 output_immediate(data, size, out, entries); in describe_payload()
319 int count = 0, entries; in write_hint_packets() local
381 entries in write_hint_packets()
250 output_immediate(const uint8_t *data, int size, AVIOContext *out, int *entries) output_immediate() argument
269 output_match(AVIOContext *out, int match_sample, int match_offset, int match_len, int *entries) output_match() argument
282 describe_payload(const uint8_t *data, int size, AVIOContext *out, int *entries, HintSampleQueue *queue) describe_payload() argument
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dloop_dependence.h134 explicit DistanceVector(size_t size) : entries(size, DistanceEntry{}) {} in DistanceVector()
137 : entries(entries_) {} in DistanceVector()
139 DistanceEntry& GetEntry(size_t index) { return entries[index]; } in GetEntry()
140 const DistanceEntry& GetEntry(size_t index) const { return entries[index]; } in GetEntry()
142 std::vector<DistanceEntry>& GetEntries() { return entries; } in GetEntries()
143 const std::vector<DistanceEntry>& GetEntries() const { return entries; } in GetEntries()
146 if (entries.size() != rhs.entries.size()) { in operator ==()
149 for (size_t i = 0; i < entries.size(); ++i) { in operator ==()
150 if (entries[ in operator ==()
159 std::vector<DistanceEntry> entries; global() member in spvtools::opt::DistanceVector
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dloop_dependence.h134 explicit DistanceVector(size_t size) : entries(size, DistanceEntry{}) {} in DistanceVector()
137 : entries(entries_) {} in DistanceVector()
139 DistanceEntry& GetEntry(size_t index) { return entries[index]; } in GetEntry()
140 const DistanceEntry& GetEntry(size_t index) const { return entries[index]; } in GetEntry()
142 std::vector<DistanceEntry>& GetEntries() { return entries; } in GetEntries()
143 const std::vector<DistanceEntry>& GetEntries() const { return entries; } in GetEntries()
146 if (entries.size() != rhs.entries.size()) { in operator ==()
149 for (size_t i = 0; i < entries.size(); ++i) { in operator ==()
150 if (entries[ in operator ==()
159 std::vector<DistanceEntry> entries; global() member in spvtools::opt::DistanceVector
[all...]
/third_party/spirv-tools/source/opt/
H A Dloop_dependence.h134 explicit DistanceVector(size_t size) : entries(size, DistanceEntry{}) {} in DistanceVector()
137 : entries(entries_) {} in DistanceVector()
139 DistanceEntry& GetEntry(size_t index) { return entries[index]; } in GetEntry()
140 const DistanceEntry& GetEntry(size_t index) const { return entries[index]; } in GetEntry()
142 std::vector<DistanceEntry>& GetEntries() { return entries; } in GetEntries()
143 const std::vector<DistanceEntry>& GetEntries() const { return entries; } in GetEntries()
146 if (entries.size() != rhs.entries.size()) { in operator ==()
149 for (size_t i = 0; i < entries.size(); ++i) { in operator ==()
150 if (entries[ in operator ==()
159 std::vector<DistanceEntry> entries; global() member in spvtools::opt::DistanceVector
[all...]
/third_party/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/test/
H A DUnicodeKnownIssues.java131 List<String> entries = entry.getValue(); in printKnownIssues()
132 int issuesToShow = entries.size(); in printKnownIssues()
137 logFn.accept(" - " + entries.get(i)); in printKnownIssues()
139 if (entries.size() > issuesToShow) { in printKnownIssues()
142 (entries.size() - issuesToShow) + " more"); in printKnownIssues()
/third_party/node/lib/internal/
H A Dv8_prof_polyfill.js47 // Filter out vdso and vsyscall entries.
143 let entries = out.match(FUNC_RE);
144 if (entries === null)
147 entries = entries.map((entry) => entry.replace(CLEAN_RE, ''));
152 input: entries.join('\n'),

Completed in 15 milliseconds

12345678910>>...33