Home
last modified time | relevance | path

Searched full:track (Results 1 – 25 of 1553) sorted by relevance

12345678910>>...63

/linux/drivers/gpu/drm/radeon/
H A Dr200.c150 struct r100_cs_track *track; in r200_packet0_check() local
160 track = (struct r100_cs_track *)p->track; in r200_packet0_check()
188 track->zb.robj = reloc->robj; in r200_packet0_check()
189 track->zb.offset = idx_value; in r200_packet0_check()
190 track->zb_dirty = true; in r200_packet0_check()
201 track->cb[0].robj = reloc->robj; in r200_packet0_check()
202 track->cb[0].offset = idx_value; in r200_packet0_check()
203 track->cb_dirty = true; in r200_packet0_check()
231 track->textures[i].robj = reloc->robj; in r200_packet0_check()
232 track->tex_dirty = true; in r200_packet0_check()
[all …]
H A Dr600_cs.c43 /* value we track */
299 static void r600_cs_track_init(struct r600_cs_track *track) in r600_cs_track_init() argument
304 track->sq_config = DX9_CONSTS; in r600_cs_track_init()
306 track->cb_color_base_last[i] = 0; in r600_cs_track_init()
307 track->cb_color_size[i] = 0; in r600_cs_track_init()
308 track->cb_color_size_idx[i] = 0; in r600_cs_track_init()
309 track->cb_color_info[i] = 0; in r600_cs_track_init()
310 track->cb_color_view[i] = 0xFFFFFFFF; in r600_cs_track_init()
311 track->cb_color_bo[i] = NULL; in r600_cs_track_init()
312 track->cb_color_bo_offset[i] = 0xFFFFFFFF; in r600_cs_track_init()
[all …]
H A Devergreen_cs.c48 /* value we track */
119 static void evergreen_cs_track_init(struct evergreen_cs_track *track) in evergreen_cs_track_init() argument
124 track->cb_color_fmask_bo[i] = NULL; in evergreen_cs_track_init()
125 track->cb_color_cmask_bo[i] = NULL; in evergreen_cs_track_init()
126 track->cb_color_cmask_slice[i] = 0; in evergreen_cs_track_init()
127 track->cb_color_fmask_slice[i] = 0; in evergreen_cs_track_init()
131 track->cb_color_bo[i] = NULL; in evergreen_cs_track_init()
132 track->cb_color_bo_offset[i] = 0xFFFFFFFF; in evergreen_cs_track_init()
133 track->cb_color_info[i] = 0; in evergreen_cs_track_init()
134 track->cb_color_view[i] = 0xFFFFFFFF; in evergreen_cs_track_init()
[all …]
H A Dr300.c632 struct r100_cs_track *track; in r300_packet0_check() local
640 track = (struct r100_cs_track *)p->track; in r300_packet0_check()
672 track->cb[i].robj = reloc->robj; in r300_packet0_check()
673 track->cb[i].offset = idx_value; in r300_packet0_check()
674 track->cb_dirty = true; in r300_packet0_check()
685 track->zb.robj = reloc->robj; in r300_packet0_check()
686 track->zb.offset = idx_value; in r300_packet0_check()
687 track->zb_dirty = true; in r300_packet0_check()
730 track->textures[i].robj = reloc->robj; in r300_packet0_check()
731 track->tex_dirty = true; in r300_packet0_check()
[all …]
H A Dr100.c1336 struct r100_cs_track *track; in r100_packet3_load_vbpntr() local
1342 track = (struct r100_cs_track *)p->track; in r100_packet3_load_vbpntr()
1350 track->num_arrays = c; in r100_packet3_load_vbpntr()
1362 track->arrays[i + 0].esize = idx_value >> 8; in r100_packet3_load_vbpntr()
1363 track->arrays[i + 0].robj = reloc->robj; in r100_packet3_load_vbpntr()
1364 track->arrays[i + 0].esize &= 0x7F; in r100_packet3_load_vbpntr()
1373 track->arrays[i + 1].robj = reloc->robj; in r100_packet3_load_vbpntr()
1374 track->arrays[i + 1].esize = idx_value >> 24; in r100_packet3_load_vbpntr()
1375 track->arrays[i + 1].esize &= 0x7F; in r100_packet3_load_vbpntr()
1387 track->arrays[i + 0].robj = reloc->robj; in r100_packet3_load_vbpntr()
[all …]
/linux/net/netfilter/
H A Dnft_bitwise.c394 static bool nft_bitwise_reduce(struct nft_regs_track *track, in nft_bitwise_reduce() argument
403 if (!track->regs[priv->sreg].selector) in nft_bitwise_reduce()
406 bitwise = nft_expr_priv(track->regs[priv->dreg].selector); in nft_bitwise_reduce()
407 if (track->regs[priv->sreg].selector == track->regs[priv->dreg].selector && in nft_bitwise_reduce()
408 track->regs[priv->sreg].num_reg == 0 && in nft_bitwise_reduce()
409 track->regs[priv->dreg].bitwise && in nft_bitwise_reduce()
410 track->regs[priv->dreg].bitwise->ops == expr->ops && in nft_bitwise_reduce()
419 track->cur = expr; in nft_bitwise_reduce()
423 if (track->regs[priv->sreg].bitwise || in nft_bitwise_reduce()
424 track->regs[priv->sreg].num_reg != 0) { in nft_bitwise_reduce()
[all …]
H A Dnft_osf.c130 static bool nft_osf_reduce(struct nft_regs_track *track, in nft_osf_reduce() argument
136 if (!nft_reg_track_cmp(track, expr, priv->dreg)) { in nft_osf_reduce()
137 nft_reg_track_update(track, expr, priv->dreg, NFT_OSF_MAXGENRELEN); in nft_osf_reduce()
141 osf = nft_expr_priv(track->regs[priv->dreg].selector); in nft_osf_reduce()
144 nft_reg_track_update(track, expr, priv->dreg, NFT_OSF_MAXGENRELEN); in nft_osf_reduce()
148 if (!track->regs[priv->dreg].bitwise) in nft_osf_reduce()
H A Dnft_hash.c169 static bool nft_jhash_reduce(struct nft_regs_track *track, in nft_jhash_reduce() argument
174 nft_reg_track_cancel(track, priv->dreg, sizeof(u32)); in nft_jhash_reduce()
199 static bool nft_symhash_reduce(struct nft_regs_track *track, in nft_symhash_reduce() argument
205 if (!nft_reg_track_cmp(track, expr, priv->dreg)) { in nft_symhash_reduce()
206 nft_reg_track_update(track, expr, priv->dreg, sizeof(u32)); in nft_symhash_reduce()
210 symhash = nft_expr_priv(track->regs[priv->dreg].selector); in nft_symhash_reduce()
213 nft_reg_track_update(track, expr, priv->dreg, sizeof(u32)); in nft_symhash_reduce()
217 if (!track->regs[priv->dreg].bitwise) in nft_symhash_reduce()
H A Dnft_fib.c165 bool nft_fib_reduce(struct nft_regs_track *track, in nft_fib_reduce() argument
188 if (!nft_reg_track_cmp(track, expr, priv->dreg)) { in nft_fib_reduce()
189 nft_reg_track_update(track, expr, priv->dreg, len); in nft_fib_reduce()
193 fib = nft_expr_priv(track->regs[priv->dreg].selector); in nft_fib_reduce()
196 nft_reg_track_update(track, expr, priv->dreg, len); in nft_fib_reduce()
200 if (!track->regs[priv->dreg].bitwise) in nft_fib_reduce()
H A Dnft_socket.c252 static bool nft_socket_reduce(struct nft_regs_track *track, in nft_socket_reduce() argument
258 if (!nft_reg_track_cmp(track, expr, priv->dreg)) { in nft_socket_reduce()
259 nft_reg_track_update(track, expr, priv->dreg, priv->len); in nft_socket_reduce()
263 socket = nft_expr_priv(track->regs[priv->dreg].selector); in nft_socket_reduce()
267 nft_reg_track_update(track, expr, priv->dreg, priv->len); in nft_socket_reduce()
271 if (!track->regs[priv->dreg].bitwise) in nft_socket_reduce()
274 return nft_expr_reduce_bitwise(track, expr); in nft_socket_reduce()
/linux/mm/kfence/
H A Dreport.c110 const struct kfence_track *track = show_alloc ? &meta->alloc_track : &meta->free_track; in kfence_print_stack()
111 u64 ts_sec = track->ts_nsec; in kfence_print_stack()
113 u64 interval_nsec = local_clock() - track->ts_nsec; in kfence_print_stack()
119 "rcu freeing" : "freed", track->pid, in kfence_print_stack()
120 track->cpu, (unsigned long)ts_sec, rem_nsec / 1000, in kfence_print_stack()
123 if (track->num_stack_entries) { in kfence_print_stack()
125 int i = get_stack_skipnr(track->stack_entries, track->num_stack_entries, NULL); in kfence_print_stack()
128 for (; i < track->num_stack_entries; i++) in kfence_print_stack()
129 seq_con_printf(seq, " %pS\n", (void *)track in kfence_print_stack()
109 const struct kfence_track *track = show_alloc ? &meta->alloc_track : &meta->free_track; kfence_print_stack() local
287 kfence_to_kp_stack(const struct kfence_track * track,void ** kp_stack) kfence_to_kp_stack() argument
[all...]
/linux/Documentation/sound/designs/
H A Dcompress-offload.rst209 delay and padding and directly move from one track content to another. The end
211 switching from one track to another
219 switch from one track to another and start using data for second track.
225 decoder to strip the silence. This needs to be set before the data in the track
230 correspond to subsequent track
235 data would belong to next track
241 - Set metadata of the first track
242 - Fill data of the first track
245 - Indicate next track data by sending set_next_track
246 - Set metadata of the next track
[all …]
/linux/drivers/gpu/drm/i915/
H A Di915_active.h24 * is reading them. We also track fences at a higher level to provide
30 * In order to use a fence, the object must track the fence it needs to
31 * serialise with. For example, GEM objects want to track both read and
35 * object then embeds a #i915_active_fence to track the most recent (in
38 * track the most recent fence request, typically this is done as part of
53 * @fence: initial fence to track, can be NULL
134 * often though we want to track the status of a bunch of tasks, for example
137 * track every single request associated with the task, but knowing that
139 * timeline must wait for earlier requests), we need only track the
146 * different resources that need to track their associated GPU activity to
/linux/scripts/gdb/linux/
H A Dslab.py34 track_type = gdb.lookup_type('struct track')
64 p += gdb.lookup_type('struct track').sizeof * 2
117 def add_location(loc_track, cache, track, orig_size): argument
119 age = jiffies - track['when']
122 pid = int(track['pid'])
123 cpuid = int(track['cpu'])
124 addr = track['addr']
126 handle = track['handle']
131 if track['when']:
173 track = gdb.Value(p).cast(track_type.pointer())
[all …]
/linux/tools/perf/pmu-events/arch/x86/jaketown/
H A Duncore-power.json160track up to 4 configurable bands. One can use edge detect in conjunction with this event to track
169track up to 4 configurable bands. One can use edge detect in conjunction with this event to track
178track up to 4 configurable bands. One can use edge detect in conjunction with this event to track
187track up to 4 configurable bands. One can use edge detect in conjunction with this event to track
H A Duncore-memory.json184 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
194 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
204 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
214 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
224 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
234 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
244 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
254 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
411track the requests. Requests allocate into the RPQ soon after they enter the memory controller, a…
420 … This queue is used to schedule reads out to the memory controller and to track the requests. Req…
[all …]
/linux/include/uapi/linux/
H A Dfd.h16 sect, /* sectors per track */
18 track, /* nr of tracks */ member
19 stretch; /* bit 0 !=0 means double track steps */
74 unsigned int device,head,track; member
80 /* format the specified track */
92 * entire track at once */
217 short track; /* current track */ member
219 short maxtrack; /* id of highest half track read */
279 unsigned char track[4]; member
382 int track; member
H A Dfdreg.h68 #define ST3_TZ 0x10 /* Track Zero signal (1=track 0) */
74 #define FD_RECALIBRATE 0x07 /* move to track 0 */
75 #define FD_SEEK 0x0F /* seek track */
80 #define FD_FORMAT 0x4D /* format one track */
107 * pack more sectors on a track) */
/linux/arch/s390/include/uapi/asm/
H A Dvtoc.h78 __u16 DS4DEVTK; /* device track length */
84 __u8 DS4DEVDT; /* number of DSCB's per track */
85 __u8 DS4DEVDB; /* number of directory blocks per track */
115 struct vtoc_ttr DS1LSTAR; /* last used track and block on track */
116 __u16 DS1TRBAL; /* space remaining on last used track */
130 struct vtoc_cchh DS4HCCHH; /* CCHH of next available alternate track */
159 __u16 t; /* RTA of the first track of free extent */
/linux/drivers/of/unittest-data/
H A Doverlay.dtso25 track@30 {
29 track@40 {
48 ride_200_left: track@10 {
52 ride_200_right: track@20 {
/linux/drivers/block/
H A Dswim.c32 unsigned char track; member
186 int track; member
426 static inline int swim_track(struct floppy_state *fs, int track) in swim_track() argument
431 ret = swim_seek(base, track - fs->track); in swim_track()
434 fs->track = track; in swim_track()
437 fs->track = 0; in swim_track()
458 int side, int track, in swim_read_sector() argument
467 swim_track(fs, track); in swim_read_sector()
487 if ((header.side != side) || (header.track != track) || in swim_read_sector()
500 int side, track, sector; in floppy_read_sectors() local
[all …]
/linux/fs/btrfs/
H A Ddelayed-ref.h75 /* seq number to keep track of insertion order */
93 * track of the total mods done to the reference count.
143 * This is used to track the final ref_mod from all the refs associated
145 * this is meant to track if we need to do the csum accounting or not.
164 * Track reserved bytes when setting must_insert_reserved. On success
203 * Track head references.
215 * Track dirty extent records.
237 * Track space reserved for deleting csums of data extents.
245 * Track from which bytenr to start searching ref heads.
/linux/drivers/cdrom/
H A Dgdrom.c297 static int get_entry_lba(int track) in get_entry_lba() argument
299 return (cpu_to_be32(track & 0xffffff00) - GD_SESSION_OFFSET); in get_entry_lba()
302 static int get_entry_q_ctrl(int track) in get_entry_q_ctrl() argument
304 return (track & 0x000000f0) >> 4; in get_entry_q_ctrl()
307 static int get_entry_track(int track) in get_entry_track() argument
309 return (track & 0x0000ff00) >> 8; in get_entry_track()
315 int fentry, lentry, track, data, err; in gdrom_get_last_session() local
333 /* Find the first data track */ in gdrom_get_last_session()
334 track = get_entry_track(gd.toc->last); in gdrom_get_last_session()
336 data = gd.toc->entry[track - 1]; in gdrom_get_last_session()
[all …]
/linux/drivers/media/usb/pvrusb2/
H A Dpvrusb2-debug.h17 #define PVR2_TRACE_TOLERANCE (1 << 2) /* track tolerance-affected errors */
38 #define PVR2_TRACE_BUF_POOL (1 << 23) /* Track buffer pool management */
39 #define PVR2_TRACE_BUF_FLOW (1 << 24) /* Track buffer flow in system */
40 #define PVR2_TRACE_DATA_FLOW (1 << 25) /* Track data flow */
/linux/tools/perf/pmu-events/arch/x86/snowridgex/
H A Duncore-memory.json265 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
276 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
287 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
298 …ather than doing accumulation. Multiple counters will need to be used to track multiple ranks sim…
472track the requests. Requests allocate into the RPQ soon after they enter the memory controller, a…
483track the requests. Requests allocate into the RPQ soon after they enter the memory controller, a…
493 … This queue is used to schedule reads out to the memory controller and to track the requests. Req…
503 … This queue is used to schedule reads out to the memory controller and to track the requests. Req…
513 …). The RPQ is used to schedule reads out to the memory controller and to track the requests. Req…
522 …). The RPQ is used to schedule reads out to the memory controller and to track the requests. Req…
[all …]

12345678910>>...63