| /Linux-v5.4/ipc/ |
| D | syscall.c | 20 int ksys_ipc(unsigned int call, int first, unsigned long second, in ksys_ipc() argument
30 return ksys_semtimedop(first, (struct sembuf __user *)ptr, in ksys_ipc()
34 return ksys_semtimedop(first, ptr, second, in ksys_ipc()
37 return compat_ksys_semtimedop(first, ptr, second, in ksys_ipc()
43 return ksys_semget(first, second, third); in ksys_ipc()
50 return ksys_old_semctl(first, second, third, arg); in ksys_ipc()
54 return ksys_msgsnd(first, (struct msgbuf __user *) ptr, in ksys_ipc()
67 return ksys_msgrcv(first, tmp.msgp, second, in ksys_ipc()
71 return ksys_msgrcv(first, in ksys_ipc()
76 return ksys_msgget((key_t) first, second); in ksys_ipc()
[all …]
|
| /Linux-v5.4/lib/ |
| D | siphash.c | 120 * @first: first u64
123 u64 siphash_1u64(const u64 first, const siphash_key_t *key) in siphash_1u64() argument
126 v3 ^= first; in siphash_1u64()
129 v0 ^= first; in siphash_1u64()
136 * @first: first u64
140 u64 siphash_2u64(const u64 first, const u64 second, const siphash_key_t *key) in siphash_2u64() argument
143 v3 ^= first; in siphash_2u64()
146 v0 ^= first; in siphash_2u64()
157 * @first: first u64
162 u64 siphash_3u64(const u64 first, const u64 second, const u64 third, in siphash_3u64() argument
[all …]
|
| D | llist.c | 20 * @new_first: first entry in batch to be added
29 struct llist_node *first; in llist_add_batch() local
32 new_last->next = first = READ_ONCE(head->first); in llist_add_batch()
33 } while (cmpxchg(&head->first, first, new_first) != first); in llist_add_batch()
35 return !first; in llist_add_batch()
40 * llist_del_first - delete the first entry of lock-less list
43 * If list is empty, return NULL, otherwise, return the first entry
49 * llist_add) sequence in another user may change @head->first->next,
50 * but keep @head->first. If multiple consumers are needed, please
57 entry = smp_load_acquire(&head->first); in llist_del_first()
[all …]
|
| /Linux-v5.4/drivers/mfd/ |
| D | ab8500-debugfs.c | 113 * @first: the first address of the range
118 u8 first; member
171 .first = 0x00,
175 .first = 0x42,
179 .first = 0x80,
188 .first = 0x00,
192 .first = 0x0F,
196 .first = 0x30,
200 .first = 0x32,
209 .first = 0x00,
[all …]
|
| /Linux-v5.4/tools/power/cpupower/lib/ |
| D | cpufreq.c | 264 struct cpufreq_available_governors *first = NULL; in cpufreq_get_available_governors() local
286 first = malloc(sizeof(*first)); in cpufreq_get_available_governors()
287 if (!first) in cpufreq_get_available_governors()
289 current = first; in cpufreq_get_available_governors()
291 current->first = first; in cpufreq_get_available_governors()
304 return first; in cpufreq_get_available_governors()
307 while (first) { in cpufreq_get_available_governors()
308 current = first->next; in cpufreq_get_available_governors()
309 if (first->governor) in cpufreq_get_available_governors()
310 free(first->governor); in cpufreq_get_available_governors()
[all …]
|
| /Linux-v5.4/Documentation/admin-guide/ |
| D | devices.txt | 21 0 = /dev/ram0 First RAM disk
32 0 = /dev/ptyp0 First PTY master
107 0 = /dev/ttyp0 First PTY slave
115 3 block First MFM, RLL and IDE hard disk/CD-ROM interface
121 1 = /dev/hd?1 First partition
134 1 = /dev/tty1 First virtual console
137 64 = /dev/ttyS0 First UART serial port
192 0 = /dev/loop0 First loop device
201 0 = /dev/sda First SCSI disk whole disk
212 0 = /dev/st0 First SCSI tape, mode 0
[all …]
|
| /Linux-v5.4/drivers/net/ethernet/ibm/ |
| D | ibmvnic.h | 212 u8 first; member
230 u8 first; member
257 u8 first; member
269 u8 first; member
277 u8 first; member
290 u8 first; member
306 u8 first; member
311 u8 first; member
326 u8 first; member
333 u8 first; member
[all …]
|
| /Linux-v5.4/drivers/video/fbdev/core/ |
| D | sysfillrect.c | 28 unsigned long first, last; in bitfill_aligned() local
33 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_aligned()
39 first &= last; in bitfill_aligned()
40 *dst = comp(pat, *dst, first); in bitfill_aligned()
45 if (first!= ~0UL) { in bitfill_aligned()
46 *dst = comp(pat, *dst, first); in bitfill_aligned()
84 unsigned long first, last; in bitfill_unaligned() local
89 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_unaligned()
95 first &= last; in bitfill_unaligned()
96 *dst = comp(pat, *dst, first); in bitfill_unaligned()
[all …]
|
| D | cfbfillrect.c | 38 unsigned long first, last; in bitfill_aligned() local
43 first = fb_shifted_pixels_mask_long(p, dst_idx, bswapmask); in bitfill_aligned()
49 first &= last; in bitfill_aligned()
50 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_aligned()
55 if (first!= ~0UL) { in bitfill_aligned()
56 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_aligned()
95 unsigned long first, last; in bitfill_unaligned() local
100 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_unaligned()
106 first &= last; in bitfill_unaligned()
107 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_unaligned()
[all …]
|
| D | syscopyarea.c | 31 unsigned long first, last; in bitcpy() local
35 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitcpy()
43 first &= last; in bitcpy()
44 *dst = comp(*src, *dst, first); in bitcpy()
48 if (first != ~0UL) { in bitcpy()
49 *dst = comp(*src, *dst, first); in bitcpy()
86 first &= last; in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
92 *dst = comp(*src >> right, *dst, first); in bitcpy()
98 first); in bitcpy()
[all …]
|
| /Linux-v5.4/arch/mips/jazz/ |
| D | jazzdma.c | 47 * the first 16 Mbytes of main memory and declare all
95 * Allocate DMA pagetables using a simple first-fit algorithm
99 int first, last, pages, frame, i; in vdma_alloc() local
121 first = 0; in vdma_alloc()
123 while (pgtbl[first].owner != VDMA_PAGE_EMPTY && in vdma_alloc()
124 first < VDMA_PGTBL_ENTRIES) first++; in vdma_alloc()
125 if (first + pages > VDMA_PGTBL_ENTRIES) { /* nothing free */ in vdma_alloc()
130 last = first + 1; in vdma_alloc()
132 && last - first < pages) in vdma_alloc()
135 if (last - first == pages) in vdma_alloc()
[all …]
|
| /Linux-v5.4/include/linux/ |
| D | list_bl.h | 13 * For modification operations, the 0 bit of hlist_bl_head->first
35 struct hlist_bl_node *first; member
42 ((ptr)->first = NULL)
60 ((unsigned long)h->first & ~LIST_BL_LOCKMASK); in hlist_bl_first()
67 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != in hlist_bl_set_first()
69 h->first = (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK); in hlist_bl_set_first()
74 return !((unsigned long)READ_ONCE(h->first) & ~LIST_BL_LOCKMASK); in hlist_bl_empty()
80 struct hlist_bl_node *first = hlist_bl_first(h); in hlist_bl_add_head() local
82 n->next = first; in hlist_bl_add_head()
83 if (first) in hlist_bl_add_head()
[all …]
|
| D | list_nulls.h | 22 struct hlist_nulls_node *first; member
30 ((ptr)->first = (struct hlist_nulls_node *) NULLS_MARKER(nulls))
66 return is_a_nulls(READ_ONCE(h->first)); in hlist_nulls_empty()
72 struct hlist_nulls_node *first = h->first; in hlist_nulls_add_head() local
74 n->next = first; in hlist_nulls_add_head()
75 n->pprev = &h->first; in hlist_nulls_add_head()
76 h->first = n; in hlist_nulls_add_head()
77 if (!is_a_nulls(first)) in hlist_nulls_add_head()
78 first->pprev = &n->next; in hlist_nulls_add_head()
106 for (pos = (head)->first; \
|
| D | list.h | 220 * @first: first entry to move
221 * @last: last entry to move, can be the same as first
223 * Move all entries between @first and including @last before @head.
227 struct list_head *first, in list_bulk_move_tail() argument
230 first->prev->next = last->next; in list_bulk_move_tail()
231 last->next->prev = first->prev; in list_bulk_move_tail()
233 head->prev->next = first; in list_bulk_move_tail()
234 first->prev = head->prev; in list_bulk_move_tail()
241 * list_is_first -- tests whether @list is the first entry in list @head
296 struct list_head *first; in list_rotate_left() local
[all …]
|
| /Linux-v5.4/Documentation/media/uapi/v4l/ |
| D | field-order.rst | 37 even) fields, the *spatial order*: The first line of the top field is
38 the first line of an interlaced frame, the first line of the bottom
56 captured first (is the older field), the top field is also transmitted
57 first on the bus.
115 - Images contain both fields, the top field lines are stored first
117 are always stored in temporal order, the older one first in
122 first in memory, immediately followed by the top field lines.
123 Fields are always stored in temporal order, the older one first in
128 temporal order, i. e. the older one first. To indicate the field
143 first. The top field is the older field.
[all …]
|
| /Linux-v5.4/arch/alpha/lib/ |
| D | csum_partial_copy.c | 143 unsigned long first; in csum_partial_cfu_dest_aligned() local
148 err |= __get_user_u(first,src); in csum_partial_cfu_dest_aligned()
154 extql(first, soff, word); in csum_partial_cfu_dest_aligned()
157 extqh(second, soff, first); in csum_partial_cfu_dest_aligned()
159 word |= first; in csum_partial_cfu_dest_aligned()
160 first = second; in csum_partial_cfu_dest_aligned()
173 extql(first, soff, word); in csum_partial_cfu_dest_aligned()
174 extqh(second, soff, first); in csum_partial_cfu_dest_aligned()
175 word |= first; in csum_partial_cfu_dest_aligned()
257 unsigned long first; in csum_partial_cfu_unaligned() local
[all …]
|
| /Linux-v5.4/fs/reiserfs/ |
| D | lbalance.c | 36 * length of all record to be copied and first byte of in leaf_copy_dir_entries()
52 /* when copy last to first, dest buffer can contain 0 items */ in leaf_copy_dir_entries()
59 * if there are no items in dest or the first/last item in in leaf_copy_dir_entries()
128 * Copy the first (if last_first == FIRST_TO_LAST) or last
147 * if ( DEST is empty or first item of SOURCE and last item of in leaf_copy_boundary_item()
174 * copy part of the body of the first item of SOURCE in leaf_copy_boundary_item()
196 * merge first item (or its part) of src buffer with the last in leaf_copy_boundary_item()
217 * (DEST is empty or last item of SOURCE and first item of DEST in leaf_copy_boundary_item()
244 * begin of the body of the first item of the DEST; part defined in leaf_copy_boundary_item()
246 * change first item key of the DEST; don't create new item header in leaf_copy_boundary_item()
[all …]
|
| /Linux-v5.4/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
| D | phy_shim.h | 80 /* Index for first 20MHz OFDM SISO rate */
82 /* Index for first 20MHz OFDM CDD rate */
84 /* Index for first 40MHz OFDM SISO rate */
86 /* Index for first 40MHz OFDM CDD rate */
89 /* Index for first 20MHz MCS SISO rate */
91 /* Index for first 20MHz MCS CDD rate */
93 /* Index for first 20MHz MCS STBC rate */
95 /* Index for first 20MHz MCS SDM rate */
97 /* Index for first 40MHz MCS SISO rate */
99 /* Index for first 40MHz MCS CDD rate */
[all …]
|
| /Linux-v5.4/fs/xfs/libxfs/ |
| D | xfs_types.c | 64 /* Calculate the first and last possible inode number in an AG. */
69 xfs_agino_t *first, in xfs_agino_range() argument
78 * Calculate the first inode, which will be in the first in xfs_agino_range()
82 *first = XFS_AGB_TO_AGINO(mp, bno); in xfs_agino_range()
102 xfs_agino_t first; in xfs_verify_agino() local
105 xfs_agino_range(mp, agno, &first, &last); in xfs_verify_agino()
106 return agino >= first && agino <= last; in xfs_verify_agino()
188 /* root, rtbitmap, rtsum all live in the first chunk */ in xfs_icount_range()
192 xfs_agino_t first, last; in xfs_icount_range() local
194 xfs_agino_range(mp, agno, &first, &last); in xfs_icount_range()
[all …]
|
| /Linux-v5.4/fs/afs/ |
| D | write.c | 233 pgoff_t first, pgoff_t last) in afs_kill_pages() argument
240 vnode->fid.vid, vnode->fid.vnode, first, last); in afs_kill_pages()
245 _debug("kill %lx-%lx", first, last); in afs_kill_pages()
247 count = last - first + 1; in afs_kill_pages()
250 pv.nr = find_get_pages_contig(mapping, first, count, pv.pages); in afs_kill_pages()
258 if (page->index >= first) in afs_kill_pages()
259 first = page->index + 1; in afs_kill_pages()
266 } while (first <= last); in afs_kill_pages()
276 pgoff_t first, pgoff_t last) in afs_redirty_pages() argument
283 vnode->fid.vid, vnode->fid.vnode, first, last); in afs_redirty_pages()
[all …]
|
| /Linux-v5.4/tools/include/linux/ |
| D | list.h | 217 struct list_head *first; in list_rotate_left() local
220 first = head->next; in list_rotate_left()
221 list_move_tail(first, head); in list_rotate_left()
278 struct list_head *first = list->next; in __list_splice() local
281 first->prev = prev; in __list_splice()
282 prev->next = first; in __list_splice()
291 * @head: the place to add it in the first list.
303 * @head: the place to add it in the first list.
315 * @head: the place to add it in the first list.
331 * @head: the place to add it in the first list.
[all …]
|
| /Linux-v5.4/tools/testing/selftests/kvm/lib/ |
| D | sparsebit.c | 55 * The index of the first bit set needs to be obtained via
86 * The idx member contains the bit index of the first bit described by this
87 * node, while the mask member stores the setting of the first 32-bits.
617 * by first remembering the location of the next in node_reduce()
975 /* First clear any bits already set in the destination */ in sparsebit_copy()
993 /* With num > 0, the first bit must be set. */ in sparsebit_is_set_num()
1024 /* With num > 0, the first bit must be cleared. */ in sparsebit_is_clear_num()
1085 /* Returns the index of the first set bit. Abort if no bits are set.
1098 /* Returns the index of the first cleared bit. Abort if
1108 /* If no nodes or first node index > 0 then lowest cleared is 0 */ in sparsebit_first_clear()
[all …]
|
| /Linux-v5.4/drivers/crypto/marvell/ |
| D | tdma.c | 51 writel_relaxed(dreq->chain.first->cur_dma, in mv_cesa_dma_step()
62 for (tdma = dreq->chain.first; tdma;) { in mv_cesa_dma_cleanup()
75 dreq->chain.first = NULL; in mv_cesa_dma_cleanup()
84 for (tdma = dreq->chain.first; tdma; tdma = tdma->next) { in mv_cesa_dma_prepare()
99 if (engine->chain.first == NULL && engine->chain.last == NULL) { in mv_cesa_tdma_chain()
100 engine->chain.first = dreq->chain.first; in mv_cesa_tdma_chain()
106 last->next = dreq->chain.first; in mv_cesa_tdma_chain()
116 !(dreq->chain.first->flags & CESA_TDMA_SET_STATE)) in mv_cesa_tdma_chain()
117 last->next_dma = dreq->chain.first->cur_dma; in mv_cesa_tdma_chain()
130 for (tdma = engine->chain.first; tdma; tdma = next) { in mv_cesa_tdma_process()
[all …]
|
| /Linux-v5.4/tools/perf/util/ |
| D | evsel_fprintf.c | 15 static int comma_fprintf(FILE *fp, bool *first, const char *fmt, ...) in comma_fprintf() argument
20 if (!*first) { in comma_fprintf()
24 *first = false; in comma_fprintf()
41 bool first = true; in perf_evsel__fprintf() local
66 __print_attr__fprintf, &first); in perf_evsel__fprintf()
73 printed += comma_fprintf(fp, &first, " %s=%" PRIu64, in perf_evsel__fprintf()
81 printed += comma_fprintf(fp, &first, " (not a tracepoint)"); in perf_evsel__fprintf()
87 printed += comma_fprintf(fp, &first, " (no trace field)"); in perf_evsel__fprintf()
91 printed += comma_fprintf(fp, &first, " trace_fields: %s", field->name); in perf_evsel__fprintf()
95 printed += comma_fprintf(fp, &first, "%s", field->name); in perf_evsel__fprintf()
[all …]
|
| /Linux-v5.4/arch/sh/mm/ |
| D | tlb-sh5.c | 26 cpu_data->dtlb.first = DTLB_FIXED | cpu_data->dtlb.step; in sh64_tlb_init()
27 cpu_data->dtlb.next = cpu_data->dtlb.first; in sh64_tlb_init()
37 cpu_data->itlb.first = ITLB_FIXED | cpu_data->itlb.step; in sh64_tlb_init()
38 cpu_data->itlb.next = cpu_data->itlb.first; in sh64_tlb_init()
61 cpu_data->dtlb.first += cpu_data->dtlb.step; in sh64_get_wired_dtlb_entry()
72 * Works like a stack, last one to allocate must be first one to free.
81 * has to be the first one to be freed. in sh64_put_wired_dtlb_entry()
97 * entry beneath the first 'free' entry! in sh64_put_wired_dtlb_entry()
99 if (entry < (cpu_data->dtlb.first - cpu_data->dtlb.step)) in sh64_put_wired_dtlb_entry()
103 cpu_data->dtlb.first -= cpu_data->dtlb.step; in sh64_put_wired_dtlb_entry()
[all …]
|
