| /Linux-v5.10/arch/xtensa/lib/ |
| D | checksum.S | 29 * This function assumes 2- or 4-byte alignment. Other alignments will fail!
35 bgeu sum, val, 99f ; \
44 * is aligned on either a 2-byte or 4-byte boundary.
47 extui a5, a2, 0, 2
48 bnez a5, 8f /* branch if 2-byte aligned */
53 loopgtz a5, 2f
55 beqz a5, 2f
80 2:
81 extui a5, a3, 2, 3 /* remaining 4-byte chunks */
83 loopgtz a5, 3f
[all …]
|
| D | usercopy.S | 32 * 8B, 4B, 2B, and 1B copies conditional on the length.
36 * copying 1B and 2B and then retest.
68 bbsi.l a2, 0, .Ldst1mod2 # if dst is 1 mod 2
69 bbsi.l a2, 1, .Ldst2mod4 # if dst is 2 mod 4
88 EX(10f) l8ui a6, a3, 0
90 EX(10f) s8i a6, a5, 0
96 # copy 2 bytes
98 EX(10f) l8ui a6, a3, 0
99 EX(10f) l8ui a7, a3, 1
100 addi a3, a3, 2
[all …]
|
| /Linux-v5.10/arch/csky/abiv2/ |
| D | strcmp.S | 12 bnez a2, 7f
14 bnez t1, 5f
20 /* If s1[i] != s2[i], goto 2f. */
22 bt 2f
25 /* If at the end, goto 3f (finish comparing). */
26 bf 3f
31 bt 2f
33 bf 3f
38 bt 2f
40 bf 3f
[all …]
|
| /Linux-v5.10/arch/m68k/math-emu/ |
| D | fp_cond.S | 12 * 2. Redistributions in binary form must reproduce the above copyright
56 lea (-2,%a0,%d2.w),%a0
57 jra 1f
65 lea (-2,%a0,%d0.l),%a0
71 jeq 1f
82 printf PDECODE,"d%d,%x\n",2,%d0,%a1
85 jne 2f
89 jcs 1f
92 2: jra fp_end
147 jmp ([0f:w,%pc,%d0*4])
[all …]
|
| D | fp_decode.h | 12 * 2. Redistributions in binary form must reproduce the above copyright
73 bfextu %d2{#8,#2},%d0
74 jmp ([0f:w,%pc,%d0*4])
78 | .long "f<op>","fscc/fdbcc"
86 jmp ([0f:w,%pc,%d0*4])
90 | .long "f<op> fpx,fpx","invalid instr"
91 | .long "f<op> <ea>,fpx","fmove fpx,<ea>"
116 jmp ([0f:w,%pc,%d0*4])
143 jne 1\@f
146 jra 2\@f
[all …]
|
| D | fp_util.S | 12 * 2. Redistributions in binary form must reproduce the above copyright
64 jmi 1f
66 jmi 1f
68 jpl 2f
70 2: clr.l %d0
98 printf PCONV,"l2e: %p -> %p(",2,%d0,%a0
102 jpl 1f | positive?
129 printf PCONV,"s2e: %p -> %p(",2,%d0,%a0
240 jpl 9f | zero is closer
244 jeq 9f | round to zero
[all …]
|
| /Linux-v5.10/drivers/media/test-drivers/vivid/ |
| D | vivid-touch-cap.c | 16 struct v4l2_pix_format *f = &dev->tch_format; in touch_cap_queue_setup() local
17 unsigned int size = f->sizeimage; in touch_cap_queue_setup()
26 if (vq->num_buffers + *nbuffers < 2) in touch_cap_queue_setup()
27 *nbuffers = 2 - vq->num_buffers; in touch_cap_queue_setup()
36 struct v4l2_pix_format *f = &dev->tch_format; in touch_cap_buf_prepare() local
37 unsigned int size = f->sizeimage; in touch_cap_buf_prepare()
120 int vivid_enum_fmt_tch(struct file *file, void *priv, struct v4l2_fmtdesc *f) in vivid_enum_fmt_tch() argument
122 if (f->index) in vivid_enum_fmt_tch()
125 f->pixelformat = V4L2_TCH_FMT_DELTA_TD16; in vivid_enum_fmt_tch()
129 int vivid_g_fmt_tch(struct file *file, void *priv, struct v4l2_format *f) in vivid_g_fmt_tch() argument
[all …]
|
| /Linux-v5.10/tools/testing/selftests/rseq/ |
| D | rseq-arm64.h | 37 case 2: \
67 case 2: \
136 " b 222f\n" \
175 RSEQ_INJECT_ASM(2) \
197 " cbz %[" __rseq_str(len) "], 333f\n" \
213 RSEQ_ASM_DEFINE_TABLE(1, 2f, 3f, 4f) in rseq_cmpeqv_storev()
214 RSEQ_ASM_DEFINE_EXIT_POINT(2f, %l[cmpfail]) in rseq_cmpeqv_storev()
216 RSEQ_ASM_DEFINE_EXIT_POINT(2f, %l[error1]) in rseq_cmpeqv_storev()
217 RSEQ_ASM_DEFINE_EXIT_POINT(2f, %l[error2]) in rseq_cmpeqv_storev()
219 RSEQ_ASM_STORE_RSEQ_CS(2, 1b, rseq_cs) in rseq_cmpeqv_storev()
[all …]
|
| D | rseq-arm.h | 122 RSEQ_INJECT_ASM(2) \
159 RSEQ_ASM_DEFINE_TABLE(9, 1f, 2f, 4f) /* start, commit, abort */ in rseq_cmpeqv_storev()
160 RSEQ_ASM_DEFINE_EXIT_POINT(1f, %l[cmpfail]) in rseq_cmpeqv_storev()
162 RSEQ_ASM_DEFINE_EXIT_POINT(1f, %l[error1]) in rseq_cmpeqv_storev()
163 RSEQ_ASM_DEFINE_EXIT_POINT(1f, %l[error2]) in rseq_cmpeqv_storev()
166 RSEQ_ASM_STORE_RSEQ_CS(1, 3f, rseq_cs) in rseq_cmpeqv_storev()
167 RSEQ_ASM_CMP_CPU_ID(cpu_id, current_cpu_id, 4f) in rseq_cmpeqv_storev()
181 "2:\n\t" in rseq_cmpeqv_storev()
183 "b 5f\n\t" in rseq_cmpeqv_storev()
184 RSEQ_ASM_DEFINE_ABORT(3, 4, "", abort, 1b, 2b, 4f) in rseq_cmpeqv_storev()
[all …]
|
| D | rseq-mips.h | 128 RSEQ_INJECT_ASM(2) \
166 RSEQ_ASM_DEFINE_TABLE(9, 1f, 2f, 4f) /* start, commit, abort */ in rseq_cmpeqv_storev()
167 RSEQ_ASM_DEFINE_EXIT_POINT(1f, %l[cmpfail]) in rseq_cmpeqv_storev()
169 RSEQ_ASM_DEFINE_EXIT_POINT(1f, %l[error1]) in rseq_cmpeqv_storev()
170 RSEQ_ASM_DEFINE_EXIT_POINT(1f, %l[error2]) in rseq_cmpeqv_storev()
173 RSEQ_ASM_STORE_RSEQ_CS(1, 3f, rseq_cs) in rseq_cmpeqv_storev()
174 RSEQ_ASM_CMP_CPU_ID(cpu_id, current_cpu_id, 4f) in rseq_cmpeqv_storev()
186 "2:\n\t" in rseq_cmpeqv_storev()
188 "b 5f\n\t" in rseq_cmpeqv_storev()
189 RSEQ_ASM_DEFINE_ABORT(3, 4, "", abort, 1b, 2b, 4f) in rseq_cmpeqv_storev()
[all …]
|
| /Linux-v5.10/drivers/media/pci/ivtv/ |
| D | ivtv-yuv.c | 32 struct yuv_frame_info *f = &yi->new_frame_info[frame]; in ivtv_yuv_prep_user_dma() local
40 y_decode_height = uv_decode_height = f->src_h + f->src_y; in ivtv_yuv_prep_user_dma()
42 if (f->offset_y) in ivtv_yuv_prep_user_dma()
122 if (f->offset_y && yi->blanking_dmaptr) { in ivtv_yuv_prep_user_dma()
211 static void ivtv_yuv_handle_horizontal(struct ivtv *itv, struct yuv_frame_info *f) in ivtv_yuv_handle_horizontal() argument
224 f->tru_w, f->src_w, f->dst_w, f->src_x, f->dst_x); in ivtv_yuv_handle_horizontal()
227 x_cutoff = f->src_w + f->src_x; in ivtv_yuv_handle_horizontal()
230 reg_2834 = f->dst_w; in ivtv_yuv_handle_horizontal()
234 reg_2890 = f->dst_x; in ivtv_yuv_handle_horizontal()
245 if (f->vis_w == 720) { in ivtv_yuv_handle_horizontal()
[all …]
|
| /Linux-v5.10/drivers/video/fbdev/ |
| D | atafb_utils.h | 55 " lsr.l #1,%1 ; jcc 1f ; move.b %2,-(%0)\n" in fb_memclear_small()
56 "1: lsr.l #1,%1 ; jcc 1f ; move.w %2,-(%0)\n" in fb_memclear_small()
57 "1: lsr.l #1,%1 ; jcc 1f ; move.l %2,-(%0)\n" in fb_memclear_small()
58 "1: lsr.l #1,%1 ; jcc 1f ; move.l %2,-(%0) ; move.l %2,-(%0)\n" in fb_memclear_small()
64 " jcs 3f\n" in fb_memclear_small()
65 " move.l %2,%%d4; move.l %2,%%d5; move.l %2,%%d6\n" in fb_memclear_small()
66 "2: movem.l %2/%%d4/%%d5/%%d6,-(%0)\n" in fb_memclear_small()
67 " dbra %1,2b\n" in fb_memclear_small()
85 " lsr.l #1,%1 ; jcc 1f ; clr.b (%0)+\n" in fb_memclear()
86 "1: lsr.l #1,%1 ; jcc 1f ; clr.w (%0)+\n" in fb_memclear()
[all …]
|
| /Linux-v5.10/net/netfilter/ |
| D | nft_set_pipapo.c | 37 * can be converted into b * 2 netmasks, from Theorem 3 in [Rottenstreich 2010],
91 * Example: 8 groups, 2^4 buckets:
96 * group 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
99 * 2
111 * Example: 2 entries, 10.0.0.5:1024 and 192.168.1.0-192.168.2.1:2048
114 * - rule #2: 192.168.2.0/31
125 * - rule #2: 192.168.2.0/31 mapping to buckets
126 * < 12 0 10 8 0 2 0 < 0..1 > >
133 * group 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
134 * 0 0 1,2
[all …]
|
| D | nf_conntrack_h323_asn1.c | 40 #define OID 2
70 #define DECODE 2
110 static int decode_nul(struct bitstr *bs, const struct field_t *f, char *base, int level);
111 static int decode_bool(struct bitstr *bs, const struct field_t *f, char *base, int level);
112 static int decode_oid(struct bitstr *bs, const struct field_t *f, char *base, int level);
113 static int decode_int(struct bitstr *bs, const struct field_t *f, char *base, int level);
114 static int decode_enum(struct bitstr *bs, const struct field_t *f, char *base, int level);
115 static int decode_bitstr(struct bitstr *bs, const struct field_t *f, char *base, int level);
116 static int decode_numstr(struct bitstr *bs, const struct field_t *f, char *base, int level);
117 static int decode_octstr(struct bitstr *bs, const struct field_t *f, char *base, int level);
[all …]
|
| /Linux-v5.10/arch/powerpc/crypto/ |
| D | md5-asm.S | 67 and rT0,b,c; /* 1: f = b and c */ \
69 andc rT1,d,b; /* 1: f' = ~b and d */ \
71 or rT0,rT0,rT1; /* 1: f = f or f' */ \
73 add a,a,rT0; /* 1: a = a + f */ \
75 addis w1,w1,k1h; /* 2: wk = w + k */ \
77 addi w1,w1,k1l; /* 2: wk = w + k' */ \
79 add d,d,w1; /* 2: a = a + wk */ \
81 and rT0,a,b; /* 2: f = b and c */ \
82 andc rT1,c,a; /* 2: f' = ~b and d */ \
83 or rT0,rT0,rT1; /* 2: f = f or f' */ \
[all …]
|
| D | sha1-spe-asm.S | 108 and rT2,b,c; /* 1: F' = B and C */ \
110 andc rT1,d,b; /* 1: F" = ~B and D */ \
112 or rT2,rT2,rT1; /* 1: F = F' or F" */ \
114 rotrwi b,b,2; /* 1: B = B rotl 30 */ \
116 LOAD_DATA(w1, off+4) /* 2: W */ \
117 add e,e,rT2; /* 1: E = E + F */ \
118 and rT1,a,b; /* 2: F' = B and C */ \
120 andc rT2,c,a; /* 2: F" = ~B and D */ \
121 add d,d,rK; /* 2: E = E + K */ \
122 or rT2,rT2,rT1; /* 2: F = F' or F" */ \
[all …]
|
| /Linux-v5.10/include/linux/ceph/ |
| D | rados.h | 30 #define CEPH_NOSNAP ((__u64)(-2)) /* "head", "live" revision */
43 #define CEPH_OBJECT_LAYOUT_LINEAR 2
51 #define CEPH_PG_LAYOUT_LINEAR 2
86 #define CEPH_POOL_TYPE_RAID4 2 /* never implemented */
93 * containing power of 2 minus 1.
95 * b <= bmask and bmask=(2**n)-1
129 #define CEPH_OSD_AUTOOUT (1<<2) /* osd was automatically marked out */
150 #define CEPH_OSDMAP_PAUSERD (1<<2) /* pause all reads */
203 #define __CEPH_FORALL_OSD_OPS(f) \ argument
206 f(READ, __CEPH_OSD_OP(RD, DATA, 1), "read") \
[all …]
|
| /Linux-v5.10/arch/sh/include/asm/ |
| D | romimage-macros.h | 11 mov.l 1f, r1
12 mov.l 2f, r0
14 bra 3f
16 .align 2
18 2 : .long \data
24 mov.l 1f, r1
25 mov.l 2f, r0
27 bra 3f
29 .align 2
31 2 : .long \data
[all …]
|
| /Linux-v5.10/arch/powerpc/lib/ |
| D | copy_32.S | 30 8 ## n ## 2: \
46 b 104f; \
49 b 105f; \
52 EX_TABLE(8 ## n ## 2b,9 ## n ## 0b); \
60 .stabs "arch/powerpc/lib/",N_SO,0,0,0f
61 .stabs "copy_32.S",N_SO,0,0,0f
72 beq- 2f
77 2: andi. r0, r5, 1
95 blt 7f
110 5: b 2f
[all …]
|
| D | memcpy_64.S | 13 /* For big-endian, 0 == most CPUs, 1 == POWER6, 2 == Cell */
71 bf cr7*4+0,2f
75 blt cr1,3f
78 2: ldu r8,16(r4)
82 beq 3f
85 bf cr7*4+1,1f
90 1: bf cr7*4+2,2f
92 addi r4,r4,2
94 addi r3,r3,2
95 2: bf cr7*4+3,3f
[all …]
|
| /Linux-v5.10/tools/testing/selftests/powerpc/copyloops/ |
| D | memcpy_64.S | 13 /* For big-endian, 0 == most CPUs, 1 == POWER6, 2 == Cell */
71 bf cr7*4+0,2f
75 blt cr1,3f
78 2: ldu r8,16(r4)
82 beq 3f
85 bf cr7*4+1,1f
90 1: bf cr7*4+2,2f
92 addi r4,r4,2
94 addi r3,r3,2
95 2: bf cr7*4+3,3f
[all …]
|
| /Linux-v5.10/arch/sh/lib/ |
| D | checksum.S | 43 * is aligned on either a 2-byte or 4-byte boundary. We get at
45 * Fortunately, it is easy to convert 2-byte alignment to 4-byte
50 bt/s 2f ! Jump if alignment is ok.
54 bt 21f ! Jump if alignment is boundary of 2bytes.
59 bt 9f
69 tst #2, r0
70 bt 2f
72 ! buf is 2 byte aligned (len could be 0)
73 add #-2, r5 ! Alignment uses up two bytes.
75 bt/s 1f ! Jump if we had at least two bytes.
[all …]
|
| /Linux-v5.10/arch/x86/lib/ |
| D | checksum_32.S | 44 * is aligned on either a 2-byte or 4-byte boundary. We get at
46 * Fortunately, it is easy to convert 2-byte alignment to 4-byte
56 jz 2f # Jump if alignment is ok.
58 jz 10f # Jump if alignment is boundary of 2 bytes.
62 jl 8f
67 testl $2, %esi
68 jz 2f
70 subl $2, %ecx # Alignment uses up two bytes.
71 jae 1f # Jump if we had at least two bytes.
72 addl $2, %ecx # ecx was < 2. Deal with it.
[all …]
|
| /Linux-v5.10/drivers/staging/media/atomisp/pci/ |
| D | css_trace.h | 8 * version 2, as published by the Free Software Foundation.
34 #define MAX_CMD_DATA 2
42 /* 2nd field: command + data */
43 /* 2nd dword */
73 2: added ISP + 24-bit fields.
106 #define TRACE_ISP_SIZE (TRACE_BUFF_SIZE / 2)
107 #elif (TRACE_ENABLE_SP0 + TRACE_ENABLE_SP1 + TRACE_ENABLE_ISP == 2)
109 #define TRACE_SP0_SIZE (TRACE_BUFF_SIZE / 2)
114 #define TRACE_SP1_SIZE (TRACE_BUFF_SIZE / 2)
119 #define TRACE_ISP_SIZE (TRACE_BUFF_SIZE / 2)
[all …]
|
| /Linux-v5.10/drivers/gpu/drm/lima/ |
| D | lima_gp.c | 107 u32 *f = frame->frame; in lima_gp_task_validate() local
110 if (f[LIMA_GP_VSCL_START_ADDR >> 2] > in lima_gp_task_validate()
111 f[LIMA_GP_VSCL_END_ADDR >> 2] || in lima_gp_task_validate()
112 f[LIMA_GP_PLBUCL_START_ADDR >> 2] > in lima_gp_task_validate()
113 f[LIMA_GP_PLBUCL_END_ADDR >> 2] || in lima_gp_task_validate()
114 f[LIMA_GP_PLBU_ALLOC_START_ADDR >> 2] > in lima_gp_task_validate()
115 f[LIMA_GP_PLBU_ALLOC_END_ADDR >> 2]) in lima_gp_task_validate()
118 if (f[LIMA_GP_VSCL_START_ADDR >> 2] == in lima_gp_task_validate()
119 f[LIMA_GP_VSCL_END_ADDR >> 2] && in lima_gp_task_validate()
120 f[LIMA_GP_PLBUCL_START_ADDR >> 2] == in lima_gp_task_validate()
[all …]
|
