Home
last modified time | relevance | path

Searched refs:E (Results 1 – 25 of 606) sorted by relevance

12345678910>>...25

/linux-6.6.21/net/netfilter/ipset/
Dpfxlen.c7 #ifdef E
8 #undef E
12 E(0x00000000, 0x00000000, 0x00000000, 0x00000000), \
13 E(0x80000000, 0x00000000, 0x00000000, 0x00000000), \
14 E(0xC0000000, 0x00000000, 0x00000000, 0x00000000), \
15 E(0xE0000000, 0x00000000, 0x00000000, 0x00000000), \
16 E(0xF0000000, 0x00000000, 0x00000000, 0x00000000), \
17 E(0xF8000000, 0x00000000, 0x00000000, 0x00000000), \
18 E(0xFC000000, 0x00000000, 0x00000000, 0x00000000), \
19 E(0xFE000000, 0x00000000, 0x00000000, 0x00000000), \
[all …]
/linux-6.6.21/lib/
Derrname.c16 #define E(err) [err + BUILD_BUG_ON_ZERO(err <= 0 || err > 300)] = "-" #err macro
18 E(E2BIG),
19 E(EACCES),
20 E(EADDRINUSE),
21 E(EADDRNOTAVAIL),
22 E(EADV),
23 E(EAFNOSUPPORT),
24 E(EAGAIN), /* EWOULDBLOCK */
25 E(EALREADY),
26 E(EBADE),
[all …]
/linux-6.6.21/arch/alpha/lib/
Dev6-memcpy.S34 mov $16, $0 # E : copy dest to return
36 xor $16, $17, $1 # E : are source and dest alignments the same?
37 and $1, 7, $1 # E : are they the same mod 8?
41 and $16, 7, $1 # E : Are both 0mod8?
43 nop # E :
53 subq $18, 1, $18 # E : count--
54 addq $17, 1, $17 # E : src++
56 addq $16, 1, $16 # E : dest++
57 and $16, 7, $1 # E : Are we at 0mod8 yet?
62 cmple $18, 127, $1 # E : Can we unroll the loop?
[all …]
Dev6-memset.S53 and $17,255,$1 # E : 00000000000000ch
55 bis $16,$16,$0 # E : return value
58 addq $18,$16,$6 # E : max address to write to
59 bis $1,$2,$17 # E : 000000000000chch
63 or $3,$4,$3 # E : 00000000chch0000
65 xor $16,$6,$1 # E : will complete write be within one quadword?
68 or $17,$3,$17 # E : 00000000chchchch
69 or $2,$5,$2 # E : chchchch00000000
70 bic $1,7,$1 # E : fit within a single quadword?
71 and $16,7,$3 # E : Target addr misalignment
[all …]
Dev6-memchr.S50 and $17, 0xff, $17 # E : L L U U : 00000000000000ch
53 cmpult $18, 9, $4 # E : small (< 1 quad) string?
54 or $2, $17, $17 # E : 000000000000chch
55 lda $3, -1($31) # E : U L L U
58 addq $16, $5, $5 # E : Max search address
59 or $2, $17, $17 # E : 00000000chchchch
62 or $2, $17, $17 # E : chchchchchchchch
68 mov $16, $0 # E :
69 nop # E :
70 or $7, $6, $1 # E : L U L U $1 = quadword starting at $16
[all …]
Dev6-clear_user.S53 and $16, 7, $4 # .. E .. .. : find dest head misalignment
56 addq $0, $4, $1 # .. .. .. E : bias counter
57 and $1, 7, $2 # .. .. E .. : number of misaligned bytes in tail
60 srl $1, 3, $1 # .. E .. .. : number of quadwords to clear
70 addq $16, 8, $16 # E .. .. .. : L U U L
73 subq $1, 1, $1 # .. .. E .. :
74 addq $0, $4, $0 # .. E .. .. : bytes left -= 8 - misalignment
75 subq $0, 8, $0 # E .. .. .. : U L U L
86 subq $1, 16, $4 # .. .. .. E : If < 16, we can not use the huge loop
87 and $16, 0x3f, $2 # .. .. E .. : Forward work for huge loop
[all …]
Dev6-divide.S109 subq $30,STACK,$30 # E :
114 bis $25,$25,divisor # E :
117 bis $24,$24,modulus # E :
119 bis $31,$31,quotient # E :
120 LONGIFY(divisor) # E : U L L U
123 LONGIFY(modulus) # E :
124 bis $31,1,mask # E :
144 1: cmpult divisor,modulus,compare # E :
145 s8addq divisor,$31,divisor # E :
146 s8addq mask,$31,mask # E :
[all …]
Dev6-copy_user.S49 mov $18, $0 # .. .. .. E
50 subq $18, 32, $1 # .. .. E. .. : Is this going to be a small copy?
51 nop # .. E .. ..
54 and $16,7,$3 # .. .. .. E : is leading dest misalignment
57 subq $3, 8, $3 # E .. .. .. : L U U L : trip counter
65 addq $16,1,$16 # .. .. E .. : Section 3.8 in the CWG
66 addq $3,1,$3 # .. E .. .. :
67 nop # E .. .. .. : U L U L
74 addq $17,1,$17 # .. .. E .. : Section 3.8 in the CWG
75 subq $0,1,$0 # .. E .. .. :
[all …]
Dev6-csum_ipv6_magic.S69 and $16,7,$6 # E : src misalignment
79 cmoveq $6,$31,$22 # E : src aligned?
82 addl $19,$7,$19 # E : U L U L : <sign bits>bbaabb00
84 or $0,$22,$0 # E : 1st src word complete
86 or $18,$4,$18 # E : 000000CCDDAABBCC
89 and $17,7,$6 # E : dst misalignment
91 or $1,$5,$1 # E : 2nd src word complete
94 cmoveq $6,$31,$22 # E : dst aligned?
96 addq $20,$0,$20 # E : begin summing the words
100 or $2,$22,$2 # E : 1st dst word complete
[all …]
Dev67-strncat.S38 lda $2, -1($31) # E :
41 andnot $16, 7, $16 # E :
42 nop # E :
43 or $2, $1, $1 # E :
45 nop # E :
46 nop # E :
47 cmpbge $31, $1, $2 # E : bits set iff byte == 0
51 addq $16, 8, $16 # E :
52 cmpbge $31, $1, $2 # E :
56 addq $16, $3, $16 # E :
[all …]
Dev6-stxncpy.S66 lda t2, -1 # E : build a mask against false zero
69 ornot t1, t2, t2 # E : (stall)
72 cmpbge zero, t2, t8 # E : bits set iff null found
73 or t0, t3, t0 # E : (stall)
91 addq a0, 8, a0 # E :
92 subq a2, 1, a2 # E :
96 addq a1, 8, a1 # E :
97 cmpbge zero, t0, t8 # E :
113 negq t8, t12 # E : find low bit set
114 and t8, t12, t12 # E : (stall)
[all …]
Dev6-stxcpy.S58 lda t2, -1 # E : build a mask against false zero
61 ornot t1, t2, t2 # E : (stall)
64 cmpbge zero, t2, t8 # E : bits set iff null found
65 or t0, t3, t1 # E : (stall)
75 addq a0, 8, a0 # E :
80 addq a1, 8, a1 # E :
81 cmpbge zero, t1, t8 # E : (3 cycle stall)
89 negq t8, t6 # E : find low bit set
90 and t8, t6, t12 # E : (stall)
93 and t12, 0x80, t6 # E : (stall)
[all …]
Dev67-strrchr.S35 and a1, 0xff, t2 # E : 00000000000000ch
40 mov zero, t6 # E : t6 is last match aligned addr
41 or t2, t4, a1 # E : 000000000000chch
43 mov zero, t8 # E : t8 is last match byte compare mask
45 andnot a0, 7, v0 # E : align source addr
46 or t5, t3, t3 # E : 00000000chch0000
50 or t4, a1, a1 # E : chch00000000chch
51 or t2, t3, t2 # E : 0000chchchch0000
52 or a1, t2, a1 # E : chchchchchchchch
53 lda t5, -1 # E : build garbage mask
[all …]
Dev67-strchr.S33 and a1, 0xff, t3 # E : 00000000000000ch
38 or t5, t3, a1 # E : 000000000000chch
39 andnot a0, 7, v0 # E : align our loop pointer
40 lda t4, -1 # E : build garbage mask
43 or a2, a3, a2 # E : chch000000000000
44 inswl a1, 2, t5 # E : 00000000chch0000
45 inswl a1, 4, a3 # E : 0000chch00000000
47 or a1, a2, a1 # E : chch00000000chch
48 or a3, t5, t5 # E : 0000chchchch0000
49 cmpbge zero, t0, t2 # E : bits set iff byte == zero
[all …]
/linux-6.6.21/scripts/coccinelle/api/
Dkvmalloc.cocci24 expression E, E1, size;
35 * E = \(kmalloc\|kzalloc\|kcalloc\|kmalloc_node\|kzalloc_node\|
41 * E = \(vmalloc\|vzalloc\|vmalloc_node\|vzalloc_node\)(..., size, ...)
45 * E = \(kmalloc\|kzalloc\|kcalloc\|kmalloc_node\|kzalloc_node\|
48 ... when != E = E1
51 * if (E == NULL)@p {
53 * E = \(vmalloc\|vzalloc\|vmalloc_node\|vzalloc_node\)(..., size, ...)
71 expression E;
75 * if (is_vmalloc_addr(E))@p {
77 * vfree(E)
[all …]
Dkfree_mismatch.cocci18 expression E, E1;
25 E = \(kmalloc\|kzalloc\|krealloc\|kcalloc\|
31 E = \(vmalloc\|vzalloc\|vmalloc_user\|vmalloc_node\|
38 E = \(kmalloc\|kzalloc\|krealloc\|kcalloc\|kmalloc_node\|kzalloc_node\|
40 ... when != E = E1
42 if (E == NULL) {
44 E = \(vmalloc\|vzalloc\|vmalloc_user\|vmalloc_node\|
53 expression E;
57 E = \(kvmalloc\|kvzalloc\|kvcalloc\|kvzalloc_node\|kvmalloc_node\|
60 kvfree(E)@fok
[all …]
/linux-6.6.21/scripts/coccinelle/null/
Dbadzero.cocci27 expression *E;
32 (E = f(...)) ==
36 (E = f(...)) !=
42 == (E = f(...))
46 != (E = f(...))
51 expression *E;
57 (E = f(...)) ==
60 (E = f(...)) !=
64 == (E = f(...))
67 != (E = f(...))
[all …]
Dderef_null.cocci21 expression E;
26 (E != NULL && ...) ? <+...E->f@p1...+> : ...
29 expression E;
35 (E != NULL) && ... && <+...E->f@p2...+>
37 (E == NULL) || ... || <+...E->f@p2...+>
39 sizeof(<+...E->f@p2...+>)
43 expression *E;
48 if@p1 ((E == NULL && ...) || ...) S1 else S2
53 expression subE <= ifm.E;
54 expression *ifm.E;
[all …]
/linux-6.6.21/rust/kernel/
Dinit.rs768 pub unsafe trait PinInit<T: ?Sized, E = Infallible>: Sized {
777 unsafe fn __pinned_init(self, slot: *mut T) -> Result<(), E>; in __pinned_init() argument
818 fn pin_chain<F>(self, f: F) -> ChainPinInit<Self, F, T, E> in pin_chain() argument
820 F: FnOnce(Pin<&mut T>) -> Result<(), E>, in pin_chain()
827 pub struct ChainPinInit<I, F, T: ?Sized, E>(I, F, __internal::Invariant<(E, Box<T>)>);
833 unsafe impl<T: ?Sized, E, I, F> PinInit<T, E> for ChainPinInit<I, F, T, E>
835 I: PinInit<T, E>,
836 F: FnOnce(Pin<&mut T>) -> Result<(), E>,
838 unsafe fn __pinned_init(self, slot: *mut T) -> Result<(), E> { in __pinned_init() argument
883 pub unsafe trait Init<T: ?Sized, E = Infallible>: PinInit<T, E> {
[all …]
/linux-6.6.21/scripts/coccinelle/misc/
Darray_size.cocci30 T[] E;
33 * (sizeof(E)/sizeof(*E))
35 * (sizeof(E)/sizeof(E[...]))
37 * (sizeof(E)/sizeof(T))
46 T[] E;
49 - (sizeof(E)/sizeof(*E))
50 + ARRAY_SIZE(E)
52 - (sizeof(E)/sizeof(E[...]))
53 + ARRAY_SIZE(E)
55 - (sizeof(E)/sizeof(T))
[all …]
/linux-6.6.21/lib/crypto/
Dsha1.c57 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
59 E += TEMP + rol32(A,5) + (fn) + (constant); \
61 TEMP = E; E = D; D = C; C = B; B = A; A = TEMP; } while (0)
63 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
64 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
65 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
66 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
67 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
89 __u32 A, B, C, D, E; in sha1_transform() local
96 E = digest[4]; in sha1_transform()
[all …]
/linux-6.6.21/scripts/coccinelle/free/
Dkfree.cocci20 expression E;
25 kfree@p1(E)
27 kfree_sensitive@p1(E)
32 expression free.E,E2;
39 f(...,c,...,(T)E@p,...)
41 E@p == E2
43 E@p != E2
45 E2 == E@p
47 E2 != E@p
49 !E@p
[all …]
Difnullfree.cocci18 expression E;
20 - if (E != NULL)
22 kfree(E);
24 kvfree(E);
26 kfree_sensitive(E);
28 kvfree_sensitive(E, ...);
30 vfree(E);
32 debugfs_remove(E);
34 debugfs_remove_recursive(E);
36 usb_free_urb(E);
[all …]
/linux-6.6.21/rust/kernel/init/
D__internal.rs21 pub(crate) struct InitClosure<F, T: ?Sized, E>(pub(crate) F, pub(crate) Invariant<(E, T)>);
25 unsafe impl<T: ?Sized, F, E> Init<T, E> for InitClosure<F, T, E>
27 F: FnOnce(*mut T) -> Result<(), E>,
30 unsafe fn __init(self, slot: *mut T) -> Result<(), E> { in __init() argument
37 unsafe impl<T: ?Sized, F, E> PinInit<T, E> for InitClosure<F, T, E>
39 F: FnOnce(*mut T) -> Result<(), E>,
42 unsafe fn __pinned_init(self, slot: *mut T) -> Result<(), E> { in __pinned_init() argument
68 fn make_closure<F, O, E>(self, f: F) -> F in make_closure() argument
70 F: FnOnce(*mut Self::Datee) -> Result<O, E>, in make_closure()
97 fn make_closure<F, O, E>(self, f: F) -> F in make_closure() argument
[all …]
/linux-6.6.21/
DCREDITS4 scripts. The fields are: name (N), email (E), web-address
13 E: mpm@selenic.com
17 E: mea@nic.funet.fi
24 E: thomas.ab@samsung.com
28 E: dragos@iname.com
36 E: madler@alumni.caltech.edu
41 E: magrawal@nortelnetworks.com
48 E: airlied@linux.ie
56 E: tigran@aivazian.fsnet.co.uk
64 E: werner@almesberger.net
[all …]

12345678910>>...25