Home
last modified time | relevance | path

Searched refs:used (Results 76 - 100 of 1954) sorted by relevance

12345678910>>...79

/third_party/ltp/testcases/commands/df/
H A Ddf01.sh79 local used=$((total-free))
83 local used=$((total-free))
86 used=$((($used * $bsize + 512) / 1024))
89 grep $TST_DEVICE output | grep -q "${total}.*${used}"
91 echo "total: ${total}, used: ${used}"
/third_party/python/Objects/
H A Dsetobject.c7 The basic lookup function used by all operations.
38 /* Object used as dummy key to fill deleted entries */
165 so->used++; in set_add_entry()
172 so->used++; in set_add_entry()
177 return set_table_resize(so, so->used>50000 ? so->used*2 : so->used*4); in set_add_entry()
189 Internal routine used by set_table_resize() to insert an item which is
194 the setobject's fill and used fields.
258 if (so->fill == so->used) { in set_table_resize()
402 Py_ssize_t used = so->used; set_clear_internal() local
486 Py_ssize_t used = so->used; set_dealloc() local
[all...]
/kernel/linux/linux-5.10/tools/virtio/
H A Dvringh_test.c190 vrh.vring.desc, vrh.vring.avail, vrh.vring.used); in parallel_test()
254 if (riov.used) { in parallel_test()
260 assert(riov.i == riov.used); in parallel_test()
267 assert(wiov.i == wiov.used); in parallel_test()
447 struct vring_used_elem used[RINGSIZE]; in main() local
496 vrh.vring.desc, vrh.vring.avail, vrh.vring.used); in main()
527 assert(riov.used == 1); in main()
531 assert(wiov.used == 1); in main()
535 assert(wiov.used == 2); in main()
554 assert(wiov.i == wiov.used); in main()
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/hfi1/
H A Daffinity.c31 * contributors may be used to endorse or promote products derived
78 cpumask_clear(&set->used); in init_cpu_mask_set()
85 if (cpumask_equal(&set->mask, &set->used)) { in _cpu_mask_set_gen_inc()
87 * We've used up all the CPUs, bump up the generation in _cpu_mask_set_gen_inc()
88 * and reset the 'used' map in _cpu_mask_set_gen_inc()
91 cpumask_clear(&set->used); in _cpu_mask_set_gen_inc()
97 if (cpumask_empty(&set->used) && set->gen) { in _cpu_mask_set_gen_dec()
99 cpumask_copy(&set->used, &set->mask); in _cpu_mask_set_gen_dec()
114 cpumask_andnot(diff, &set->mask, &set->used); in cpu_mask_set_get_first()
120 cpumask_set_cpu(cpu, &set->used); in cpu_mask_set_get_first()
[all...]
/kernel/linux/linux-6.6/drivers/infiniband/hw/hfi1/
H A Daffinity.c36 cpumask_clear(&set->used); in init_cpu_mask_set()
43 if (cpumask_equal(&set->mask, &set->used)) { in _cpu_mask_set_gen_inc()
45 * We've used up all the CPUs, bump up the generation in _cpu_mask_set_gen_inc()
46 * and reset the 'used' map in _cpu_mask_set_gen_inc()
49 cpumask_clear(&set->used); in _cpu_mask_set_gen_inc()
55 if (cpumask_empty(&set->used) && set->gen) { in _cpu_mask_set_gen_dec()
57 cpumask_copy(&set->used, &set->mask); in _cpu_mask_set_gen_dec()
72 cpumask_andnot(diff, &set->mask, &set->used); in cpu_mask_set_get_first()
78 cpumask_set_cpu(cpu, &set->used); in cpu_mask_set_get_first()
88 cpumask_clear_cpu(cpu, &set->used); in cpu_mask_set_put()
[all...]
/kernel/linux/linux-6.6/tools/virtio/
H A Dvringh_test.c190 vrh.vring.desc, vrh.vring.avail, vrh.vring.used); in parallel_test()
254 if (riov.used) { in parallel_test()
260 assert(riov.i == riov.used); in parallel_test()
267 assert(wiov.i == wiov.used); in parallel_test()
447 struct vring_used_elem used[RINGSIZE]; in main() local
496 vrh.vring.desc, vrh.vring.avail, vrh.vring.used); in main()
527 assert(riov.used == 1); in main()
531 assert(wiov.used == 1); in main()
535 assert(wiov.used == 2); in main()
554 assert(wiov.i == wiov.used); in main()
[all...]
/kernel/linux/linux-6.6/drivers/mtd/ubi/
H A Dfastmap-wl.c23 * find_anchor_wl_entry - find wear-leveling entry to used as anchor PEB.
60 for (i = pool->used; i < pool->size; i++) { in return_unused_pool_pebs()
69 * @anchor: This PEB will be used as anchor PEB by fastmap
192 wl_pool->used = 0; in ubi_refill_pools()
193 pool->used = 0; in ubi_refill_pools()
242 if (pool->used == pool->size || wl_pool->used == wl_pool->size) { in ubi_wl_get_peb()
255 if (pool->used == pool->size) { in ubi_wl_get_peb()
272 ubi_assert(pool->used < pool->size); in ubi_wl_get_peb()
273 ret = pool->pebs[pool->used in ubi_wl_get_peb()
[all...]
/third_party/ffmpeg/libavfilter/
H A Daf_axcorrelate.c44 int used; member
114 int used; \
123 used = s->used; \
124 if (!used) { \
127 used = 1; \
144 return used; \
156 int used; \
166 used = s->used; \
[all...]
/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A Dfastmap-wl.c23 * find_anchor_wl_entry - find wear-leveling entry to used as anchor PEB.
60 for (i = pool->used; i < pool->size; i++) { in return_unused_pool_pebs()
69 * @anchor: This PEB will be used as anchor PEB by fastmap
192 wl_pool->used = 0; in ubi_refill_pools()
193 pool->used = 0; in ubi_refill_pools()
242 if (pool->used == pool->size || wl_pool->used == wl_pool->size) { in ubi_wl_get_peb()
255 if (pool->used == pool->size) { in ubi_wl_get_peb()
272 ubi_assert(pool->used < pool->size); in ubi_wl_get_peb()
273 ret = pool->pebs[pool->used in ubi_wl_get_peb()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dvringh.h28 /* Guest publishes used event idx (note: we always do). */
37 /* Last index we used. */
82 * Remaining data is iov + i, of used - i elements.
87 unsigned i, used, max_num; member
94 * Remaining data is iov + i, of used - i elements.
99 unsigned i, used, max_num; member
110 vring_used_t __user *used);
115 iov->used = iov->i = 0; in vringh_iov_init()
133 iov->max_num = iov->used = iov->i = iov->consumed = 0; in vringh_iov_cleanup()
152 /* Mark a descriptor as used
[all...]
/third_party/typescript/tests/baselines/reference/tscWatch/emitAndErrorUpdates/isolatedModules/transitive-exports/no-circular-import/
H A Dexport-with-incremental.js83 /a/lib/lib.d.ts (used version)
84 /user/username/projects/myproject/lib1/tools/tools.interface.ts (used version)
85 /user/username/projects/myproject/lib1/tools/public.ts (used version)
86 /user/username/projects/myproject/lib1/public.ts (used version)
87 /user/username/projects/myproject/lib2/data.ts (used version)
88 /user/username/projects/myproject/lib2/public.ts (used version)
89 /user/username/projects/myproject/app.ts (used version)
371 /user/username/projects/myproject/lib1/tools/public.ts (used version)
372 /user/username/projects/myproject/lib1/public.ts (used version)
373 /user/username/projects/myproject/lib2/data.ts (used versio
[all...]
H A Dexport.js83 /a/lib/lib.d.ts (used version)
84 /user/username/projects/myproject/lib1/tools/tools.interface.ts (used version)
85 /user/username/projects/myproject/lib1/tools/public.ts (used version)
86 /user/username/projects/myproject/lib1/public.ts (used version)
87 /user/username/projects/myproject/lib2/data.ts (used version)
88 /user/username/projects/myproject/lib2/public.ts (used version)
89 /user/username/projects/myproject/app.ts (used version)
260 /user/username/projects/myproject/lib1/tools/public.ts (used version)
261 /user/username/projects/myproject/lib1/public.ts (used version)
262 /user/username/projects/myproject/lib2/data.ts (used versio
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dspace-info.c38 * 3) btrfs_calc*_size. These are the worst case calculations we used based
312 found->bytes_used += block_group->used; in btrfs_add_bg_to_space_info()
313 found->disk_used += block_group->used * factor; in btrfs_add_bg_to_space_info()
361 * space is actually usable. For raid56, the space info used in calc_available_free_space()
385 u64 used; in btrfs_can_overcommit() local
391 used = btrfs_space_info_used(space_info, true); in btrfs_can_overcommit()
394 if (used + bytes < space_info->total_bytes + avail) in btrfs_can_overcommit()
425 u64 used = btrfs_space_info_used(space_info, true); in btrfs_try_granting_tickets() local
430 if ((used + ticket->bytes <= space_info->total_bytes) || in btrfs_try_granting_tickets()
498 "space_info total=%llu, used in __btrfs_dump_space_info()
815 u64 used; btrfs_calc_reclaim_metadata_size() local
843 u64 used; need_preemptive_reclaim() local
1614 u64 used; __reserve_bytes() local
[all...]
/third_party/typescript/tests/baselines/reference/
H A DnoUnusedLocals_writeOnly.js12 let used = 1;
13 ({ x = used } = { x: b ? 1 : undefined });
40 var used = 1; variable
41 (_b = { x: b ? 1 : undefined }.x, x = _b === void 0 ? used : _b);
/kernel/linux/linux-5.10/drivers/usb/misc/
H A Dchaoskey.c85 int used; /* bytes of buf consumed */ member
327 dev->used = 0; in chaos_read_callback()
348 if (dev->valid != dev->used) { in _chaoskey_fill()
349 usb_dbg(dev->interface, "not empty yet (valid %d used %d)", in _chaoskey_fill()
350 dev->valid, dev->used); in _chaoskey_fill()
438 if (dev->valid == dev->used) { in chaoskey_read()
446 this_time = dev->valid - dev->used; in chaoskey_read()
450 remain = copy_to_user(buffer, dev->buf + dev->used, this_time); in chaoskey_read()
457 dev->used += this_time - remain; in chaoskey_read()
465 dev->used in chaoskey_read()
[all...]
/kernel/linux/linux-6.6/drivers/usb/misc/
H A Dchaoskey.c85 int used; /* bytes of buf consumed */ member
326 dev->used = 0; in chaos_read_callback()
347 if (dev->valid != dev->used) { in _chaoskey_fill()
348 usb_dbg(dev->interface, "not empty yet (valid %d used %d)", in _chaoskey_fill()
349 dev->valid, dev->used); in _chaoskey_fill()
437 if (dev->valid == dev->used) { in chaoskey_read()
445 this_time = dev->valid - dev->used; in chaoskey_read()
449 remain = copy_to_user(buffer, dev->buf + dev->used, this_time); in chaoskey_read()
456 dev->used += this_time - remain; in chaoskey_read()
464 dev->used in chaoskey_read()
[all...]
/third_party/skia/third_party/externals/freetype/src/base/
H A Dmd5.c221 unsigned long used, available; in MD5_Update() local
228 used = saved_lo & 0x3f; in MD5_Update()
230 if (used) { in MD5_Update()
231 available = 64 - used; in MD5_Update()
234 memcpy(&ctx->buffer[used], data, size); in MD5_Update()
238 memcpy(&ctx->buffer[used], data, available); in MD5_Update()
260 unsigned long used, available; in MD5_Final() local
262 used = ctx->lo & 0x3f; in MD5_Final()
264 ctx->buffer[used++] = 0x80; in MD5_Final()
266 available = 64 - used; in MD5_Final()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DMD5.cpp191 unsigned long used, free; in update() local
200 used = saved_lo & 0x3f; in update()
202 if (used) { in update()
203 free = 64 - used; in update()
206 memcpy(&buffer[used], Ptr, Size); in update()
210 memcpy(&buffer[used], Ptr, free); in update()
235 unsigned long used, free; in final() local
237 used = lo & 0x3f; in final()
239 buffer[used++] = 0x80; in final()
241 free = 64 - used; in final()
[all...]
/kernel/linux/linux-5.10/drivers/soc/amlogic/
H A Dmeson-canvas.c37 u8 used[NUM_CANVAS]; member
99 if (!canvas->used[canvas_index]) { in meson_canvas_config()
137 if (!canvas->used[i]) { in meson_canvas_alloc()
138 canvas->used[i] = 1; in meson_canvas_alloc()
156 if (!canvas->used[canvas_index]) { in meson_canvas_free()
162 canvas->used[canvas_index] = 0; in meson_canvas_free()
/kernel/linux/linux-6.6/drivers/soc/amlogic/
H A Dmeson-canvas.c38 u8 used[NUM_CANVAS]; member
100 if (!canvas->used[canvas_index]) { in meson_canvas_config()
138 if (!canvas->used[i]) { in meson_canvas_alloc()
139 canvas->used[i] = 1; in meson_canvas_alloc()
157 if (!canvas->used[canvas_index]) { in meson_canvas_free()
163 canvas->used[canvas_index] = 0; in meson_canvas_free()
/third_party/python/Tools/scripts/
H A Dgenerate_opcode_h.py87 used = [ False ] * 256
91 used[op] = True
96 while used[next_op]:
100 used[next_op] = True
103 used[255] = True
164 for i, flag in enumerate(used):
/third_party/skia/tests/
H A DPathOpsLineIntersectionTest.cpp89 for (int i = 0; i < ts.used(); ++i) { in check_results()
96 REPORTER_ASSERT(reporter, ts.used() != 1); in check_results()
115 REPORTER_ASSERT(reporter, pts == i.used()); in testOne()
158 REPORTER_ASSERT(reporter, pts == i.used()); in testOneCoincident()
169 REPORTER_ASSERT(reporter, pts == ts.used()); in testOneCoincident()
178 REPORTER_ASSERT(reporter, pts == ts.used()); in testOneCoincident()
187 REPORTER_ASSERT(reporter, pts == ts.used()); in testOneCoincident()
196 REPORTER_ASSERT(reporter, pts == ts.used()); in testOneCoincident()
220 REPORTER_ASSERT(reporter, pts == ts.used()); in DEF_TEST()
/kernel/linux/linux-5.10/tools/testing/selftests/powerpc/nx-gzip/
H A Dgunz_test.c13 * Definitions of acronyms used here. See
72 #define fifo_used_bytes(used) (used)
73 #define fifo_free_bytes(used, len) ((len)-(used))
75 #define fifo_free_first_bytes(cur, used, len) ((((cur)+(used)) <= (len)) \
76 ? (len)-((cur)+(used)) : 0)
77 #define fifo_free_last_bytes(cur, used, len) ((((cur)+(used)) <
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dspace-info.c34 * 3) btrfs_calc*_size. These are the worst case calculations we used based
315 * space is actually usable. For raid56, the space info used in calc_available_free_space()
339 u64 used; in btrfs_can_overcommit() local
345 used = btrfs_space_info_used(space_info, true); in btrfs_can_overcommit()
348 if (used + bytes < space_info->total_bytes + avail) in btrfs_can_overcommit()
379 u64 used = btrfs_space_info_used(space_info, true); in btrfs_try_granting_tickets() local
384 if ((used + ticket->bytes <= space_info->total_bytes) || in btrfs_try_granting_tickets()
426 "space_info total=%llu, used=%llu, pinned=%llu, reserved=%llu, may_use=%llu, readonly=%llu", in __btrfs_dump_space_info()
458 "block group %llu has %llu bytes, %llu used %llu pinned %llu reserved %s", in btrfs_dump_space_info()
459 cache->start, cache->length, cache->used, cach in btrfs_dump_space_info()
756 u64 used; btrfs_calc_reclaim_metadata_size() local
801 need_do_async_reclaim(struct btrfs_fs_info *fs_info, struct btrfs_space_info *space_info, u64 used) need_do_async_reclaim() argument
1318 u64 used; __reserve_bytes() local
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/powerpc/nx-gzip/
H A Dgunz_test.c13 * Definitions of acronyms used here. See
72 #define fifo_used_bytes(used) (used)
73 #define fifo_free_bytes(used, len) ((len)-(used))
75 #define fifo_free_first_bytes(cur, used, len) ((((cur)+(used)) <= (len)) \
76 ? (len)-((cur)+(used)) : 0)
77 #define fifo_free_last_bytes(cur, used, len) ((((cur)+(used)) <
[all...]

Completed in 17 milliseconds

12345678910>>...79