Home
last modified time | relevance | path

Searched +full:free +full:- +full:running (Results 1 – 25 of 1023) sorted by relevance

12345678910>>...41

/linux/drivers/net/ethernet/google/gve/
H A Dgve.h1 /* SPDX-License-Identifier: (GPL-2.0 OR MIT)
4 * Copyright (C) 2015-2024 Google LLC
10 #include <linux/dma-mapping.h>
49 #define GVE_DATA_SLOT_ADDR_PAGE_MASK (~(PAGE_SIZE - 1))
69 (GVE_ADMINQ_BUFFER_SIZE / sizeof(((struct gve_adminq_queried_flow_rule *)0)->location))
84 /* 2K buffers for DQO-QPL */
89 /* If number of free/recyclable buffers are less than this threshold; driver
90 * allocs and uses a non-qpl page on the receive path of DQO QPL to free
184 * which point every other offset is free to be reused.
188 /* Linked list index to next element in the list, or -1 if none */
[all …]
/linux/drivers/video/fbdev/
H A Dpxa3xx-gcu.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * pxa3xx-gcu.c - Linux kernel module for PXA3xx graphics controllers
22 #include <linux/dma-mapping.h>
36 #include "pxa3xx-gcu.h"
38 #define DRV_NAME "pxa3xx-gcu"
97 struct pxa3xx_gcu_batch *free; member
100 struct pxa3xx_gcu_batch *running; member
106 return __raw_readl(priv->mmio_base + off); in gc_readl()
112 __raw_writel(val, priv->mmio_base + off); in gc_writel()
118 struct pxa3xx_gcu_shared *shared = priv->shared; \
[all …]
/linux/drivers/input/serio/
H A Duserio.c6 * This program is free software; you can redistribute it and/or modify it
8 * the Free Software Foundation; either version 2 of the License, or (at
39 bool running; member
51 * userio_device_write - Write data from serio to a userio device in userspace
57 struct userio_device *userio = id->port_data; in userio_device_write()
59 scoped_guard(spinlock_irqsave, &userio->buf_lock) { in userio_device_write()
60 userio->buf[userio->head] = val; in userio_device_write()
61 userio->head = (userio->head + 1) % USERIO_BUFSIZE; in userio_device_write()
63 if (userio->head == userio->tail) in userio_device_write()
68 wake_up_interruptible(&userio->waitq); in userio_device_write()
[all …]
/linux/tools/testing/selftests/media_tests/
H A Dmedia_device_test.c1 // SPDX-License-Identifier: GPL-2.0
4 * media_device_test.c - Media Controller Device ioctl loop Test
23 * sudo ./media_device_test -d /dev/mediaX
25 * While test is running, remove the device and
26 * ensure there are no use after free errors and
28 * config option for use-after-free error detection.
54 printf("Usage: %s [-d </dev/mediaX>]\n", argv[0]); in main()
55 exit(-1); in main()
59 while ((opt = getopt(argc, argv, "d:")) != -1) { in main()
62 strncpy(media_device, optarg, sizeof(media_device) - 1); in main()
[all …]
H A Dvideo_device_test.c1 // SPDX-License-Identifier: GPL-2.0
4 * video_device_test - Video Device Test
20 * sudo ./video_device_test -d /dev/videoX
22 * While test is running, remove the device or unbind the driver and
23 * ensure there are no use after free errors and other Oops in the
25 * When possible, enable KaSan kernel config option for use-after-free
53 return -1; in priority_test()
59 return -1; in priority_test()
64 result = -1; in priority_test()
68 printf("Priority wasn't set - test failed\n"); in priority_test()
[all …]
/linux/Documentation/devicetree/bindings/net/
H A Dadi,adin.yaml1 # SPDX-License-Identifier: GPL-2.0+
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Alexandru Tachici <alexandru.tachici@analog.com>
16 - $ref: ethernet-phy.yaml#
19 adi,rx-internal-delay-ps:
22 internal delay (phy-mode is 'rgmii-id' or 'rgmii-rxid') in pico-seconds.
26 adi,tx-internal-delay-ps:
29 internal delay (phy-mode is 'rgmii-id' or 'rgmii-txid') in pico-seconds.
33 adi,fifo-depth-bits:
[all …]
/linux/tools/testing/selftests/cgroup/
H A Dtest_freezer.c1 /* SPDX-License-Identifier: GPL-2.0 */
32 return -1; in cg_check_frozen()
40 return -1; in cg_check_frozen()
62 int fd, ret = -1; in cg_enter_and_wait_for_frozen()
95 int fd, ret = -1; in cg_freeze_wait()
118 * A simple process running in a sleep loop until being
119 * re-parented.
133 * running processes and freeze it. Then unfreeze it. Then it kills all
169 free(cgroup); in test_cgfreezer_simple()
329 for (i = 9; i >= 0 && cgroup[i]; i--) { in test_cgfreezer_tree()
[all …]
/linux/drivers/clocksource/
H A Dtimer-orion.c1 // SPDX-License-Identifier: GPL-2.0
7 * Timer 0 is used as free-running clocksource, while timer 1 is
53 * Free-running clocksource handling.
68 /* setup and enable one-shot timer */ in orion_clkevt_next_event()
87 writel(ticks_per_jiffy - 1, timer_base + TIMER1_RELOAD); in orion_clkevt_set_periodic()
88 writel(ticks_per_jiffy - 1, timer_base + TIMER1_VAL); in orion_clkevt_set_periodic()
124 return -ENXIO; in orion_timer_init()
143 ret = -EINVAL; in orion_timer_init()
149 /* setup timer0 as free-running clocksource */ in orion_timer_init()
189 TIMER_OF_DECLARE(orion_timer, "marvell,orion-timer", orion_timer_init);
/linux/Documentation/devicetree/bindings/timer/
H A Dbrcm,bcm2835-system-timer.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/timer/brcm,bcm2835-system-timer.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Stefan Wahren <wahrenst@gmx.net>
11 - Raspberry Pi Kernel Maintenance <kernel-list@raspberrypi.com>
14 The System Timer peripheral provides four 32-bit timer channels and a
15 single 64-bit free running counter. Each channel has an output compare
17 free running counter values, and generates an interrupt.
21 const: brcm,bcm2835-system-timer
[all …]
/linux/fs/btrfs/
H A Ddiscard.c1 // SPDX-License-Identifier: GPL-2.0
11 #include "block-group.h"
13 #include "free-space-cache.h"
19 * Async discard manages trimming of free space outside of transaction commit.
20 * Discarding is done by managing the block_groups on a LRU list based on free
32 * The first list is special to manage discarding of fully free block groups.
33 * This is necessary because we issue a final trim for a full free block group
39 * The in-memory free space cache serves as the backing state for discard.
44 * As the free space cache uses bitmaps, there exists a tradeoff between
73 return &discard_ctl->discard_list[block_group->discard_index]; in get_discard_list()
[all …]
/linux/arch/arm/mach-pxa/
H A Dsmemc.h1 /* SPDX-License-Identifier: GPL-2.0-only */
21 #define SXLCR (SMEMC_VIRT + 0x18) /* LCR value to be written to SDRAM-Timing Synchronous Flash */
31 #define BOOT_DEF (SMEMC_VIRT + 0x44) /* Read-Only Boot-Time Register. Contains BOOT_SEL and PKG_SE…
49 #define MECR_NOS (1 << 0) /* Number Of Sockets: 0 -> 1 sock, 1 -> 2 sock */
50 #define MECR_CIT (1 << 1) /* Card Is There: 0 -> no card, 1 -> card inserted */
58 #define MDREFR_K2FREE (1 << 25) /* SDRAM Free-Running Control */
59 #define MDREFR_K1FREE (1 << 24) /* SDRAM Free-Running Control */
60 #define MDREFR_K0FREE (1 << 23) /* SDRAM Free-Running Control */
61 #define MDREFR_SLFRSH (1 << 22) /* SDRAM Self-Refresh Control/Status */
62 #define MDREFR_APD (1 << 20) /* SDRAM/SSRAM Auto-Power-Down Enable */
/linux/Documentation/admin-guide/mm/damon/
H A Dreclaim.rst1 .. SPDX-License-Identifier: GPL-2.0
4 DAMON-based Reclamation
7 DAMON-based Reclamation (DAMON_RECLAIM) is a static kernel module that aimed to
9 It doesn't aim to replace the LRU-list based page_granularity reclamation, but
15 On general memory over-committed systems, proactively reclaiming cold pages
20 Free Pages Reporting [3]_ based memory over-commit virtualization systems are
21 good example of the cases. In such systems, the guest VMs reports their free
24 guests could be not so memory-frugal, mainly because some kernel subsystems and
25 user-space applications are designed to use as much memory as available. Then,
26 guests could report only small amount of memory as free to host, results in
[all …]
H A Dlru_sort.rst1 .. SPDX-License-Identifier: GPL-2.0
4 DAMON-based LRU-lists Sorting
7 DAMON-based LRU-lists Sorting (DAMON_LRU_SORT) is a static kernel module that
9 (de)prioritization of pages on their LRU-lists for making LRU-lists a more
12 Where Proactive LRU-lists Sorting is Required?
15 As page-granularity access checking overhead could be significant on huge
23 Because DAMON can identify access patterns of best-effort accuracy while
24 inducing only user-specified range of overhead, proactively running
32 rates that higher than a user-specified threshold) and cold pages (pages of
34 user-specified threshold) using DAMON, and prioritizes hot pages while
[all …]
/linux/tools/testing/selftests/powerpc/math/
H A Dfpu_preempt.c1 // SPDX-License-Identifier: GPL-2.0-or-later
36 int running; variable
38 extern int preempt_fpu(double *darray, int *threads_starting, int *running);
46 rc = preempt_fpu(darray, &threads_starting, &running); in preempt_fpu_c()
60 running = true; in test_preempt_fpu()
81 * r5 will have loaded the value of running. in test_preempt_fpu()
83 running = 0; in test_preempt_fpu()
98 free(tids); in test_preempt_fpu()
H A Dfpu_signal.c1 // SPDX-License-Identifier: GPL-2.0-or-later
35 int running; variable
37 extern long preempt_fpu(double *darray, int *threads_starting, int *running);
43 mcontext_t *mc = &uc->uc_mcontext; in signal_fpu_sig()
47 if (mc->fp_regs[i] != darray[i]) { in signal_fpu_sig()
66 rc = preempt_fpu(darray, &threads_starting, &running); in signal_fpu_c()
81 running = true; in test_signal_fpu()
104 running = 0; in test_signal_fpu()
120 free(tids); in test_signal_fpu()
/linux/drivers/misc/lkdtm/
H A Dheap.c1 // SPDX-License-Identifier: GPL-2.0
18 * about this value. This means compile-time length checks involving
19 * this variable cannot be performed; only run-time checks.
46 * This tries to stay within the next largest power-of-2 kmalloc cache
71 * The slub allocator uses the first word to store the free in lkdtm_WRITE_AFTER_FREE()
73 * allocation to avoid running into the freelist in lkdtm_WRITE_AFTER_FREE()
80 pr_info("Allocated memory %p-%p\n", base, &base[offset * 2]); in lkdtm_WRITE_AFTER_FREE()
98 * the middle of the allocation to store the free pointer, in lkdtm_READ_AFTER_FREE()
100 * avoid running into the freelist. in lkdtm_READ_AFTER_FREE()
119 pr_info("Value in memory before free: %x\n", base[offset]); in lkdtm_READ_AFTER_FREE()
[all …]
/linux/fs/btrfs/tests/
H A Dfree-space-tests.c1 // SPDX-License-Identifier: GPL-2.0
7 #include "btrfs-tests.h"
9 #include "../disk-io.h"
10 #include "../free-space-cache.h"
11 #include "../block-group.h"
24 test_msg("running extent only tests"); in test_extents()
41 return -1; in test_extents()
71 return -1; in test_extents()
76 return -1; in test_extents()
81 return -1; in test_extents()
[all …]
/linux/arch/arm/mach-mmp/
H A Dtime.c1 // SPDX-License-Identifier: GPL-2.0-only
3 * linux/arch/arm/mach-mmp/time.c
10 * 2008-04-11: Jason Chagas <Jason.chagas@marvell.com>
11 * 2008-10-08: Bin Yang <bin.yang@marvell.com>
14 * three match comparators. Timer #0 is used here in free-running mode as
32 #include "regs-timers.h"
52 while (delay--) in timer_read()
77 c->event_handler(c); in timer_interrupt()
103 __raw_writel(delta - 1, mmp_timer_base + TMR_TN_MM(0, 0)); in timer_set_next_event()
160 /* set timer 0 to periodic mode, and timer 1 to free-running mode */ in timer_config()
[all …]
/linux/include/uapi/linux/
H A Dmembarrier.h11 * Permission is hereby granted, free of charge, to any person obtaining a copy
31 * enum membarrier_cmd - membarrier system call command
34 * @MEMBARRIER_CMD_GLOBAL: Execute a memory barrier on all running threads.
36 * is ensured that all running threads have passed
38 * user-space addresses match program order between
40 * (non-running threads are de facto in such a
42 * running on the system. This command returns 0.
44 * Execute a memory barrier on all running threads
48 * is ensured that all running threads have passed
50 * user-space addresses match program order between
[all …]
/linux/tools/testing/selftests/kvm/lib/
H A Dmemstress.c1 // SPDX-License-Identifier: GPL-2.0
28 /* Set to true once the vCPU thread is up and running. */
29 bool running; member
38 /* Set to true once all vCPU threads are up and running. */
50 struct memstress_vcpu_args *vcpu_args = &args->vcpu_args[vcpu_idx]; in memstress_guest_code()
60 gva = vcpu_args->gva; in memstress_guest_code()
61 pages = vcpu_args->pages; in memstress_guest_code()
64 GUEST_ASSERT(vcpu_args->vcpu_idx == vcpu_idx); in memstress_guest_code()
67 for (i = 0; i < sizeof(memstress_args); i += args->guest_page_size) in memstress_guest_code()
71 if (args->random_access) in memstress_guest_code()
[all …]
/linux/include/linux/
H A Dkvm_dirty_ring.h9 * @dirty_index: free running counter that points to the next slot in
10 * dirty_ring->dirty_gfns, where a new dirty page should go
11 * @reset_index: free running counter that points to the next dirty page
12 * in dirty_ring->dirty_gfns for which dirty trap needs to
14 * @size: size of the compact list, dirty_ring->dirty_gfns
81 * called with kvm->slots_lock held, returns the number of
/linux/samples/bpf/
H A Dtrace_event_kern.c3 * This program is free software; you can redistribute it and/or
5 * License as published by the Free Software Foundation.
40 char time_fmt1[] = "Time Enabled: %llu, Time Running: %llu"; in bpf_prog1()
43 char fmt[] = "CPU-%d period %lld ip %llx"; in bpf_prog1()
50 if (ctx->sample_period < 10000) in bpf_prog1()
57 bpf_trace_printk(fmt, sizeof(fmt), cpu, ctx->sample_period, in bpf_prog1()
58 PT_REGS_IP(&ctx->regs)); in bpf_prog1()
64 bpf_trace_printk(time_fmt1, sizeof(time_fmt1), value_buf.enabled, value_buf.running); in bpf_prog1()
68 if (ctx->addr != 0) in bpf_prog1()
69 bpf_trace_printk(addr_fmt, sizeof(addr_fmt), ctx->addr); in bpf_prog1()
/linux/Documentation/driver-api/dmaengine/
H A Dclient.rst8 ``Documentation/crypto/async-tx-api.rst``
11 Below is a guide to device driver writers on how to use the Slave-DMA API of the
19 - Allocate a DMA slave channel
21 - Set slave and controller specific parameters
23 - Get a descriptor for transaction
25 - Submit the transaction
27 - Issue pending requests and wait for callback notification
40 .. code-block:: c
66 .. code-block:: c
79 DMA-engine are:
[all …]
/linux/Documentation/timers/
H A Dno_hz.rst2 NO_HZ: Reducing Scheduling-Clock Ticks
7 reduce the number of scheduling-clock interrupts, thereby improving energy
9 some types of computationally intensive high-performance computing (HPC)
10 applications and for real-time applications.
12 There are three main ways of managing scheduling-clock interrupts
13 (also known as "scheduling-clock ticks" or simply "ticks"):
15 1. Never omit scheduling-clock ticks (CONFIG_HZ_PERIODIC=y or
16 CONFIG_NO_HZ=n for older kernels). You normally will -not-
19 2. Omit scheduling-clock ticks on idle CPUs (CONFIG_NO_HZ_IDLE=y or
23 3. Omit scheduling-clock ticks on CPUs that are either idle or that
[all …]
/linux/drivers/edac/
H A Dedac_device.c44 edac_dev, edac_dev->dev_idx); in edac_device_dump_device()
45 edac_dbg(4, "\tedac_dev->edac_check = %p\n", edac_dev->edac_check); in edac_device_dump_device()
46 edac_dbg(3, "\tdev = %p\n", edac_dev->dev); in edac_device_dump_device()
48 edac_dev->mod_name, edac_dev->ctl_name); in edac_device_dump_device()
49 edac_dbg(3, "\tpvt_info = %p\n\n", edac_dev->pvt_info); in edac_device_dump_device()
76 goto free; in edac_device_alloc_ctl_info()
78 dev_ctl->instances = dev_inst; in edac_device_alloc_ctl_info()
82 goto free; in edac_device_alloc_ctl_info()
84 dev_ctl->blocks = dev_blk; in edac_device_alloc_ctl_info()
89 goto free; in edac_device_alloc_ctl_info()
[all …]

12345678910>>...41