Home
last modified time | relevance | path

Searched full:oldest (Results 1 – 25 of 268) sorted by relevance

1234567891011

/linux-6.8/tools/perf/pmu-events/arch/powerpc/power10/
Dpipeline.json5 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline suffered a TLB miss or…
55 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was waiting for a load…
60 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline finished at dispatch a…
85 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was waiting for a load…
90 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was executing in the s…
95 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was a lwsync waiting t…
125 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was dispatched but not…
140 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was executing in the L…
145 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline required special handl…
155 …"BriefDescription": "Cycles in which the oldest instruction in the pipeline was waiting for a load…
[all …]
/linux-6.8/tools/perf/pmu-events/arch/arm64/fujitsu/a64fx/
Dother.json9 …his event counts every cycle that no operation was committed because the oldest and uncommitted lo…
12 …his event counts every cycle that no operation was committed because the oldest and uncommitted lo…
15 …s event counts every cycle that no instruction was committed because the oldest and uncommitted in…
18 …s event counts every cycle that no instruction was committed because the oldest and uncommitted in…
21 …s event counts every cycle that no instruction was committed because the oldest and uncommitted lo…
24 …s event counts every cycle that no instruction was committed because the oldest and uncommitted lo…
27 …s event counts every cycle that no instruction was committed because the oldest and uncommitted in…
30 …s event counts every cycle that no instruction was committed because the oldest and uncommitted in…
33 …s event counts every cycle that no instruction was committed because the oldest and uncommitted lo…
36 …s event counts every cycle that no instruction was committed because the oldest and uncommitted lo…
[all …]
/linux-6.8/tools/perf/pmu-events/arch/x86/alderlaken/
Dmemory.json3 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer is…
10 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer is…
17 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
24 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
27 …"PublicDescription": "Counts the number of cycles that the head (oldest load) of the load buffer a…
32 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
39 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
/linux-6.8/net/rds/
Dib_ring.c144 * returns the oldest allocated ring entry. This will be the next one
156 u32 rds_ib_ring_completed(struct rds_ib_work_ring *ring, u32 wr_id, u32 oldest) in rds_ib_ring_completed() argument
160 if (oldest <= (unsigned long long)wr_id) in rds_ib_ring_completed()
161 ret = (unsigned long long)wr_id - oldest + 1; in rds_ib_ring_completed()
163 ret = ring->w_nr - oldest + (unsigned long long)wr_id + 1; in rds_ib_ring_completed()
165 rdsdebug("ring %p ret %u wr_id %u oldest %u\n", ring, ret, in rds_ib_ring_completed()
166 wr_id, oldest); in rds_ib_ring_completed()
/linux-6.8/include/linux/
Dllist.h38 * The order of deleted entries is from the newest to the oldest added
39 * one. If you want to traverse from the oldest to the newest, you
139 * traverse order is from the newest to the oldest added entry. If
140 * you want to traverse from the oldest to the newest, you must
158 * traverse order is from the newest to the oldest added entry. If
159 * you want to traverse from the oldest to the newest, you must
176 * traverse order is from the newest to the oldest added entry. If
177 * you want to traverse from the oldest to the newest, you must
198 * traverse order is from the newest to the oldest added entry. If
199 * you want to traverse from the oldest to the newest, you must
[all …]
/linux-6.8/tools/perf/pmu-events/arch/x86/alderlake/
Dmemory.json12 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer is…
20 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer is…
28 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
36 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
39 …"PublicDescription": "Counts the number of cycles that the head (oldest load) of the load buffer a…
45 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
53 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
/linux-6.8/Documentation/userspace-api/media/v4l/
Ddev-event.rst40 full, then the oldest event in that queue will be dropped.
43 the oldest event that is about to be dropped will be merged with the
44 payload of the next oldest event. Thus ensuring that no information
Dfunc-read.rst58 single or multiple buffers and discarding the oldest or newest frames
70 depends on the discarding policy. A driver discarding the oldest frames
/linux-6.8/drivers/net/wireless/mediatek/mt76/mt7996/
Dcoredump.c121 u32 oldest, i, idx; in mt7996_coredump_fw_stack() local
139 oldest = (u32)mt76_get_field(dev, MT_MCU_WM_EXCP_PC_CTRL, in mt7996_coredump_fw_stack()
142 idx = ((oldest + 2 * i + 1) % 32); in mt7996_coredump_fw_stack()
147 oldest = (u32)mt76_get_field(dev, MT_MCU_WM_EXCP_LR_CTRL, in mt7996_coredump_fw_stack()
150 idx = ((oldest + 2 * i + 1) % 32); in mt7996_coredump_fw_stack()
/linux-6.8/tools/perf/pmu-events/arch/x86/meteorlake/
Dmemory.json21 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer is…
29 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer is…
37 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
45 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
48 …"PublicDescription": "Counts the number of cycles that the head (oldest load) of the load buffer a…
54 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
62 …"BriefDescription": "Counts the number of cycles that the head (oldest load) of the load buffer an…
/linux-6.8/drivers/net/xen-netback/
Dhash.c38 struct xenvif_hash_cache_entry *new, *entry, *oldest; in xenvif_add_hash() local
53 oldest = NULL; in xenvif_add_hash()
60 if (!oldest || entry->seq < oldest->seq) in xenvif_add_hash()
61 oldest = entry; in xenvif_add_hash()
69 list_del_rcu(&oldest->link); in xenvif_add_hash()
71 kfree_rcu(oldest, rcu); in xenvif_add_hash()
/linux-6.8/drivers/staging/media/atomisp/pci/base/circbuf/src/
Dcircbuf.c26 * @brief Read the oldest element from the circular buffer.
27 * Read the oldest element WITHOUT checking whehter the
28 * circular buffer is empty or not. The oldest element is
33 * @return the oldest element.
268 * @brief Read the oldest element from the circular buffer.
/linux-6.8/drivers/input/
Dinput-mt.c199 struct input_mt_slot *oldest; in input_mt_report_pointer_emulation() local
205 oldest = NULL; in input_mt_report_pointer_emulation()
216 oldest = ps; in input_mt_report_pointer_emulation()
241 if (oldest) { in input_mt_report_pointer_emulation()
242 int x = input_mt_get_value(oldest, ABS_MT_POSITION_X); in input_mt_report_pointer_emulation()
243 int y = input_mt_get_value(oldest, ABS_MT_POSITION_Y); in input_mt_report_pointer_emulation()
249 int p = input_mt_get_value(oldest, ABS_MT_PRESSURE); in input_mt_report_pointer_emulation()
/linux-6.8/fs/ceph/
Daddr.c542 * Get ref for the oldest snapc for an inode with dirty data... that is, the
648 struct ceph_snap_context *snapc, *oldest; in writepage_nounlock() local
672 oldest = get_oldest_context(inode, &ceph_wbc, snapc); in writepage_nounlock()
673 if (snapc->seq > oldest->seq) { in writepage_nounlock()
678 ceph_put_snap_context(oldest); in writepage_nounlock()
682 ceph_put_snap_context(oldest); in writepage_nounlock()
777 oldest = detach_page_private(page); in writepage_nounlock()
778 WARN_ON_ONCE(oldest != snapc); in writepage_nounlock()
971 /* find oldest snap context with dirty data */ in ceph_writepages_start()
979 doutc(cl, " oldest snapc is %p seq %lld (%d snaps)\n", snapc, in ceph_writepages_start()
[all …]
/linux-6.8/tools/perf/pmu-events/arch/x86/amdzen4/
Dcore.json62 "BriefDescription": "Cycles with no retire while the oldest op is waiting to be executed.",
80 "BriefDescription": "Cycles with no retire while the oldest op is waiting for load data.",
/linux-6.8/drivers/staging/media/ipu3/
Dipu3-css-pool.c59 * Allocate a new parameter via recycling the oldest entry in the pool.
63 /* Get the oldest entry */ in imgu_css_pool_get()
/linux-6.8/drivers/md/bcache/
Djournal.c103 * i->j.seq, the node on head has the smallest (oldest) in journal_read_bucket()
109 * Check from the oldest jset for last_seq. If in journal_read_bucket()
110 * i->j.seq < j->last_seq, it means the oldest jset in journal_read_bucket()
435 /* get the oldest journal entry and check its refcount */ in btree_flush_write()
442 * the oldest journal entry in btree_flush_write()
464 * If the oldest journal entry is reclaimed and front in btree_flush_write()
496 * the oldest journal entry. in btree_flush_write()
503 * they are clean now (this is why and how the oldest in btree_flush_write()
522 * the oldest journal entry, try to flush them next in btree_flush_write()
/linux-6.8/drivers/gpu/drm/amd/amdgpu/
Damdgpu_sa.c34 * progression was is after last is the oldest bo we allocated and thus
41 * If we are asked to block we wait on all the oldest fence of all
/linux-6.8/net/netfilter/
Dnf_conntrack_ftp.c348 unsigned int i, oldest; in update_nl_seq() local
350 /* Look for oldest: if we find exact match, we're done. */ in update_nl_seq()
360 oldest = 0; in update_nl_seq()
362 oldest = 1; in update_nl_seq()
364 if (after(nl_seq, info->seq_aft_nl[dir][oldest])) in update_nl_seq()
365 info->seq_aft_nl[dir][oldest] = nl_seq; in update_nl_seq()
/linux-6.8/net/rxrpc/
Dcall_event.c119 ktime_t now, max_age, oldest, ack_ts; in rxrpc_resend() local
128 oldest = now; in rxrpc_resend()
204 if (ktime_before(txb->last_sent, oldest)) in rxrpc_resend()
205 oldest = txb->last_sent; in rxrpc_resend()
220 resend_at = nsecs_to_jiffies(ktime_to_ns(ktime_sub(now, oldest))); in rxrpc_resend()
/linux-6.8/Documentation/driver-api/media/
Dv4l2-event.rst32 :c:type:`v4l2_kevent` ringbuffer, then the oldest event will be dropped
68 The ``merge()`` callback allows you to merge the oldest event payload into
69 that of the second-oldest event payload. It is called when
/linux-6.8/fs/bcachefs/
Dalloc_foreground.c1233 struct write_point *wp, *oldest; in writepoint_find() local
1254 oldest = NULL; in writepoint_find()
1257 if (!oldest || time_before64(wp->last_used, oldest->last_used)) in writepoint_find()
1258 oldest = wp; in writepoint_find()
1260 bch2_trans_mutex_lock_norelock(trans, &oldest->lock); in writepoint_find()
1262 if (oldest >= c->write_points + c->write_points_nr || in writepoint_find()
1265 mutex_unlock(&oldest->lock); in writepoint_find()
1270 if (wp && wp != oldest) { in writepoint_find()
1272 mutex_unlock(&oldest->lock); in writepoint_find()
1276 wp = oldest; in writepoint_find()
/linux-6.8/drivers/hwtracing/intel_th/
Dmsu.c83 * @start_win: oldest window
86 * @start_block: oldest block in the window
383 * msc_oldest_window() - locate the window with oldest data
389 * Return: the oldest window with valid data
406 * msc_win_oldest_sg() - locate the oldest block in a given window
409 * Return: index of the block with the oldest data
417 /* without wrapping, first block is the oldest */ in msc_win_oldest_sg()
423 * oldest data for this window. in msc_win_oldest_sg()
490 * start with the block with oldest data; if data has wrapped in msc_iter_block_start()
569 * the oldest data) and work its way to the current window, calling @fn
[all …]
/linux-6.8/drivers/gpu/drm/radeon/
Dradeon_sa.c34 * progression was is after last is the oldest bo we allocated and thus
41 * If we are asked to block we wait on all the oldest fence of all
/linux-6.8/drivers/gpu/drm/bridge/adv7511/
Dadv7511_cec.c151 * 1 = buffer contains oldest received frame (if applicable) in adv7511_cec_irq_process()
152 * 2 = buffer contains second oldest received frame (if applicable) in adv7511_cec_irq_process()
153 * 3 = buffer contains third oldest received frame (if applicable) in adv7511_cec_irq_process()

1234567891011