Home
last modified time | relevance | path

Searched refs:r_ (Results 1 – 7 of 7) sorted by relevance

/linux-6.12.1/drivers/gpu/drm/xe/regs/
Dxe_reg_defs.h103 #define XE_REG_INITIALIZER(r_, ...) { .addr = r_, __VA_ARGS__ } argument
112 #define XE_REG(r_, ...) ((const struct xe_reg)XE_REG_INITIALIZER(r_, ##__VA_ARGS__)) argument
121 #define XE_REG_EXT(r_, ...) \ argument
122 ((const struct xe_reg)XE_REG_INITIALIZER(r_, ##__VA_ARGS__, .ext = 1))
130 #define XE_REG_MCR(r_, ...) ((const struct xe_reg_mcr){ \ argument
131 .__reg = XE_REG_INITIALIZER(r_, ##__VA_ARGS__, .mcr = 1) \
/linux-6.12.1/drivers/gpu/drm/nouveau/nvkm/subdev/fb/
Dramseq.h8 #define ram_have(s,r) ((s)->r_##r.addr != 0x000000)
9 #define ram_rd32(s,r) hwsq_rd32(&(s)->base, &(s)->r_##r)
10 #define ram_wr32(s,r,d) hwsq_wr32(&(s)->base, &(s)->r_##r, (d))
11 #define ram_nuke(s,r) hwsq_nuke(&(s)->base, &(s)->r_##r)
12 #define ram_mask(s,r,m,d) hwsq_mask(&(s)->base, &(s)->r_##r, (m), (d))
Dramfuc.h166 #define ram_have(s,r) ((s)->r_##r.addr != 0x000000)
167 #define ram_rd32(s,r) ramfuc_rd32(&(s)->base, &(s)->r_##r)
168 #define ram_wr32(s,r,d) ramfuc_wr32(&(s)->base, &(s)->r_##r, (d))
169 #define ram_nuke(s,r) ramfuc_nuke(&(s)->base, &(s)->r_##r)
170 #define ram_mask(s,r,m,d) ramfuc_mask(&(s)->base, &(s)->r_##r, (m), (d))
Dramgk104.c249 gk104_ram_nuts((s), &(s)->fuc.r_##r, (m), (d), (c))
/linux-6.12.1/drivers/gpu/drm/nouveau/nvkm/subdev/clk/
Dseq.h8 #define clk_have(s,r) ((s)->r_##r.addr != 0x000000)
9 #define clk_rd32(s,r) hwsq_rd32(&(s)->base, &(s)->r_##r)
10 #define clk_wr32(s,r,d) hwsq_wr32(&(s)->base, &(s)->r_##r, (d))
11 #define clk_mask(s,r,m,d) hwsq_mask(&(s)->base, &(s)->r_##r, (m), (d))
/linux-6.12.1/arch/sh/include/asm/
Dio.h49 #define readb(a) ({ u8 r_ = readb_relaxed(a); rmb(); r_; })
50 #define readw(a) ({ u16 r_ = readw_relaxed(a); rmb(); r_; })
51 #define readl(a) ({ u32 r_ = readl_relaxed(a); rmb(); r_; })
52 #define readq(a) ({ u64 r_ = readq_relaxed(a); rmb(); r_; })
/linux-6.12.1/Documentation/scheduler/
Dsched-deadline.rst336 A real-time task can be periodic with period P if r_{j+1} = r_j + P, or
337 sporadic with minimum inter-arrival time P is r_{j+1} >= r_j + P. Finally,