Home
last modified time | relevance | path

Searched +full:- +full:e (Results 1 – 25 of 1051) sorted by relevance

12345678910>>...43

/linux/lib/
H A Derrname.c1 // SPDX-License-Identifier: GPL-2.0
13 * on mips), so this wastes a bit of space on those - though we
16 #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 */
[all …]
/linux/scripts/coccinelle/api/
H A Dstring_choices.cocci1 // SPDX-License-Identifier: GPL-2.0-only
5 // Options: --no-includes --include-headers
11 expression E;
14 - ((E == 1) ? "" : "s")
15 + str_plural(E)
17 - ((E > 1) ? "s" : "")
18 + str_plural(E)
22 expression E;
26 * (E@P == 1) ? "" : "s"
28 * (E@P > 1) ? "s" : ""
[all …]
H A Dkvmalloc.cocci1 // SPDX-License-Identifier: GPL-2.0-only
8 // Options: --no-includes --include-headers
24 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;
[all …]
H A Dkfree_mismatch.cocci1 // SPDX-License-Identifier: GPL-2.0-only
9 // Options: --no-includes --include-headers
18 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;
[all …]
/linux/drivers/net/ethernet/chelsio/cxgb4/
H A Dl2t.c4 * Copyright (c) 2003-2014 Chelsio Communications, Inc. All rights reserved.
16 * - Redistributions of source code must retain the above
20 * - Redistributions in binary form must reproduce the above
65 static inline unsigned int vlan_prio(const struct l2t_entry *e) in vlan_prio() argument
67 return e->vlan >> VLAN_PRIO_SHIFT; in vlan_prio()
70 static inline void l2t_hold(struct l2t_data *d, struct l2t_entry *e) in l2t_hold() argument
72 if (atomic_add_return(1, &e->refcnt) == 1) /* 0 -> 1 transition */ in l2t_hold()
73 atomic_dec(&d->nfree); in l2t_hold()
89 unsigned int l2t_size_half = d->l2t_size / 2; in arp_hash()
97 unsigned int l2t_size_half = d->l2t_size / 2; in ipv6_hash()
[all …]
H A Dsmt.c16 * - Redistributions of source code must retain the above
20 * - Redistributions in binary form must reproduce the above
53 s->smt_size = smt_size; in t4_init_smt()
54 rwlock_init(&s->lock); in t4_init_smt()
55 for (i = 0; i < s->smt_size; ++i) { in t4_init_smt()
56 s->smtab[i].idx = i; in t4_init_smt()
57 s->smtab[i].state = SMT_STATE_UNUSED; in t4_init_smt()
58 eth_zero_addr(s->smtab[i].src_mac); in t4_init_smt()
59 spin_lock_init(&s->smtab[i].lock); in t4_init_smt()
60 s->smtab[i].refcnt = 0; in t4_init_smt()
[all …]
/linux/tools/testing/selftests/powerpc/pmu/
H A Devent.c1 // SPDX-License-Identifier: GPL-2.0-only
24 static void __event_init_opts(struct event *e, u64 config, in __event_init_opts() argument
27 memset(e, 0, sizeof(*e)); in __event_init_opts()
29 e->name = name; in __event_init_opts()
31 e->attr.type = type; in __event_init_opts()
32 e->attr.config = config; in __event_init_opts()
33 e->attr.size = sizeof(e->attr); in __event_init_opts()
35 e->attr.read_format = PERF_FORMAT_TOTAL_TIME_ENABLED | \ in __event_init_opts()
38 e->attr.sample_period = 1000; in __event_init_opts()
39 e->attr.sample_type = PERF_SAMPLE_REGS_INTR; in __event_init_opts()
[all …]
/linux/drivers/net/ethernet/chelsio/cxgb3/
H A Dl2t.c2 * Copyright (c) 2003-2008 Chelsio, Inc. All rights reserved.
14 * - Redistributions of source code must retain the above
18 * - Redistributions in binary form must reproduce the above
63 static inline unsigned int vlan_prio(const struct l2t_entry *e) in vlan_prio() argument
65 return e->vlan >> 13; in vlan_prio()
71 return jhash_2words(key, ifindex, 0) & (d->nentries - 1); in arp_hash()
74 static inline void neigh_replace(struct l2t_entry *e, struct neighbour *n) in neigh_replace() argument
77 if (e->neigh) in neigh_replace()
78 neigh_release(e->neigh); in neigh_replace()
79 e->neigh = n; in neigh_replace()
[all …]
/linux/net/netfilter/ipset/
H A Dpfxlen.c1 // SPDX-License-Identifier: GPL-2.0-only
7 #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), \
[all …]
/linux/security/apparmor/
H A Dpolicy_unpack_test.c1 // SPDX-License-Identifier: GPL-2.0-only
52 struct aa_ext *e; member
60 struct aa_ext *e; in build_aa_ext_struct() local
65 e = kunit_kmalloc(test, sizeof(*e), GFP_USER); in build_aa_ext_struct()
66 KUNIT_EXPECT_NOT_ERR_OR_NULL(test, e); in build_aa_ext_struct()
68 e->start = buf; in build_aa_ext_struct()
69 e->end = e->start + buf_size; in build_aa_ext_struct()
70 e->pos = e->start; in build_aa_ext_struct()
74 strscpy(buf + 3, TEST_STRING_NAME, e->end - (void *)(buf + 3)); in build_aa_ext_struct()
76 buf = e->start + TEST_STRING_BUF_OFFSET; in build_aa_ext_struct()
[all …]
H A Dpolicy_unpack.c1 // SPDX-License-Identifier: GPL-2.0-only
8 * Copyright (C) 1998-2008 Novell/SUSE
9 * Copyright 2009-2010 Canonical Ltd.
12 * policy format documentation see Documentation/admin-guide/LSM/apparmor.rst
40 if (ad->iface.ns) { in audit_cb()
42 audit_log_untrustedstring(ab, ad->iface.ns); in audit_cb()
44 if (ad->nam in audit_cb()
64 audit_iface(struct aa_profile * new,const char * ns_name,const char * name,const char * info,struct aa_ext * e,int error) audit_iface() argument
179 aa_inbounds(struct aa_ext * e,size_t size) aa_inbounds() argument
192 aa_unpack_u16_chunk(struct aa_ext * e,char ** chunk) aa_unpack_u16_chunk() argument
214 aa_unpack_X(struct aa_ext * e,enum aa_code code) aa_unpack_X() argument
241 aa_unpack_nameX(struct aa_ext * e,enum aa_code code,const char * name) aa_unpack_nameX() argument
272 unpack_u8(struct aa_ext * e,u8 * data,const char * name) unpack_u8() argument
290 aa_unpack_u32(struct aa_ext * e,u32 * data,const char * name) aa_unpack_u32() argument
309 aa_unpack_u64(struct aa_ext * e,u64 * data,const char * name) aa_unpack_u64() argument
328 aa_unpack_cap_low(struct aa_ext * e,kernel_cap_t * data,const char * name) aa_unpack_cap_low() argument
338 aa_unpack_cap_high(struct aa_ext * e,kernel_cap_t * data,const char * name) aa_unpack_cap_high() argument
348 aa_unpack_array(struct aa_ext * e,const char * name,u16 * size) aa_unpack_array() argument
366 aa_unpack_blob(struct aa_ext * e,char ** blob,const char * name) aa_unpack_blob() argument
389 aa_unpack_str(struct aa_ext * e,const char ** string,const char * name) aa_unpack_str() argument
413 aa_unpack_strdup(struct aa_ext * e,char ** string,const char * name) aa_unpack_strdup() argument
441 unpack_dfa(struct aa_ext * e,int flags) unpack_dfa() argument
527 unpack_strs_table(struct aa_ext * e,const char * name,bool multi,struct aa_str_table * strs) unpack_strs_table() argument
589 unpack_xattrs(struct aa_ext * e,struct aa_profile * profile) unpack_xattrs() argument
620 unpack_secmark(struct aa_ext * e,struct aa_ruleset * rules) unpack_secmark() argument
665 unpack_rlimits(struct aa_ext * e,struct aa_ruleset * rules) unpack_rlimits() argument
777 unpack_tagsets(struct aa_ext * e,struct aa_tags_struct * tags) unpack_tagsets() argument
810 unpack_tag_header_ent(struct aa_ext * e,struct aa_tags_header * h) unpack_tag_header_ent() argument
818 unpack_tag_headers(struct aa_ext * e,struct aa_tags_struct * tags) unpack_tag_headers() argument
852 unpack_tags(struct aa_ext * e,struct aa_tags_struct * tags,const char ** info) unpack_tags() argument
899 unpack_perm(struct aa_ext * e,u32 version,struct aa_perms * perm) unpack_perm() argument
923 unpack_perms_table(struct aa_ext * e,struct aa_perms ** perms) unpack_perms_table() argument
966 unpack_pdb(struct aa_ext * e,struct aa_policydb ** policy,bool required_dfa,bool required_trans,const char ** info) unpack_pdb() argument
1114 unpack_profile(struct aa_ext * e,char ** ns_name) unpack_profile() argument
1435 verify_header(struct aa_ext * e,int required,const char ** ns) verify_header() argument
1734 struct aa_ext e = { aa_unpack() local
[all...]
/linux/arch/alpha/lib/
H A Dev6-memcpy.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-memcpy.S
4 * 21264 version by Rick Gorton <rick.gorton@alpha-processor.com>
8 * - memory accessed as aligned quadwords only
9 * - uses bcmpge to compare 8 bytes in parallel
14 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
16 * E - either cluster
17 * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
18 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
21 * $1,$2, - scratch
[all …]
H A Dev6-memchr.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-memchr.S
5 * 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com>
9 * - memory accessed as aligned quadwords only
10 * - uses cmpbge to compare 8 bytes in parallel
11 * - does binary search to find 0 byte in last
18 * - only minimum number of quadwords may be accessed
19 * - the third argument is an unsigned long
24 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
26 * E - either cluster
[all …]
H A Dev67-strrchr.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev67-strrchr.S
4 * 21264 version by Rick Gorton <rick.gorton@alpha-processor.com>
6 * Finds length of a 0-terminated string. Optimized for the
9 * - memory accessed as aligned quadwords only
10 * - uses bcmpge to compare 8 bytes in parallel
15 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
17 * E - either cluster
18 * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
19 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
[all …]
H A Dev6-memset.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-memset.S
8 * 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com>
13 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
15 * E - either cluster
16 * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
17 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
48 * undertake a major re-write to interleave the constant materialization
49 * with other parts of the fall-through code. This is important, even
53 and $17,255,$1 # E : 00000000000000ch
[all …]
H A Dev6-stxncpy.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-stxncpy.S
4 * 21264 version contributed by Rick Gorton <rick.gorton@api-networks.com>
6 * Copy no more than COUNT bytes of the null-terminated string from
29 * Furthermore, v0, a3-a5, t11, and $at are untouched.
34 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
36 * E - either cluster
37 * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
38 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
66 lda t2, -1 # E : build a mask against false zero
[all …]
H A Dev6-clear_user.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-clear_user.S
4 * 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com>
8 * We have to make sure that $0 is always up-to-date and contains the
16 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
18 * E - either cluster
19 * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
20 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
25 * it's going to be worth the effort to hand-unroll a big loop, and use wh64.
37 .long 99b - .; \
[all …]
H A Dev6-divide.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-divide.S
5 * 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com>
14 * __divqu: 64-bit unsigned long divide
15 * __remqu: 64-bit unsigned long remainder
16 * __divqs/__remqs: signed 64-bit
17 * __divlu/__remlu: unsigned 32-bit
18 * __divls/__remls: signed 32-bit
27 * This is a rather simple bit-at-a-time algorithm: it's very good
28 * at dividing random 64-bit numbers, but the more usual case where
[all …]
/linux/scripts/coccinelle/null/
H A Dbadzero.cocci1 // SPDX-License-Identifier: GPL-2.0-only
2 /// Compare pointer-typed values to NULL rather than 0
7 //# using the option -all_includes and the option -I to specify an
27 expression *E;
32 (E = f(...)) ==
33 - 0
36 (E = f(...)) !=
37 - 0
40 - 0
42 == (E = f(...))
[all …]
/linux/drivers/net/ethernet/mellanox/mlx5/core/esw/
H A Dindir_table.c1 // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
20 #define MLX5_ESW_INDIR_TABLE_RECIRC_IDX (MLX5_ESW_INDIR_TABLE_SIZE - 2)
21 #define MLX5_ESW_INDIR_TABLE_FWD_IDX (MLX5_ESW_INDIR_TABLE_SIZE - 1)
52 return ERR_PTR(-ENOMEM); in mlx5_esw_indir_table_init()
54 mutex_init(&indir->lock); in mlx5_esw_indir_table_init()
55 hash_init(indir->table); in mlx5_esw_indir_table_init()
62 mutex_destroy(&indir->lock); in mlx5_esw_indir_table_destroy()
72 struct mlx5_esw_flow_attr *esw_attr = attr->esw_attr; in mlx5_esw_indir_table_needed()
81 return esw_attr->in_rep->vport == MLX5_VPORT_UPLINK && in mlx5_esw_indir_table_needed()
83 esw->dev == dest_mdev && in mlx5_esw_indir_table_needed()
[all …]
/linux/Documentation/driver-api/media/drivers/ccs/
H A Dccs-regs.asc1 # SPDX-License-Identifier: GPL-2.0-only OR BSD-3-Clause
2 # Copyright (C) 2019--2020 Intel Corporation
5 # - f field LSB MSB rflags
6 # - e enum value # after a field
7 # - e enum value [LSB MSB]
8 # - b bool bit
9 # - l arg name min max elsize [discontig...]
23 - e GRBG 0
24 - e RGGB 1
25 - e BGGR 2
[all …]
/linux/scripts/kconfig/
H A Dexpr.c1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
21 static struct expr *expr_eliminate_yn(struct expr *e);
24 * expr_lookup - return the expression with the given type and sub-nodes
25 * This looks up an expression with the specified type and sub-nodes. If such
35 struct expr *e; in expr_lookup() local
40 hash_for_each_possible(expr_hashtable, e, node, hash) { in expr_lookup()
41 if (e->type == type && e->left._initdata == l && in expr_lookup()
42 e->right._initdata == r) in expr_lookup()
43 return e; in expr_lookup()
[all …]
/linux/tools/testing/selftests/powerpc/pmu/ebb/
H A Dtrace.c1 // SPDX-License-Identifier: GPL-2.0-only
25 MAP_ANONYMOUS | MAP_PRIVATE, -1, 0); in trace_buffer_allocate()
31 tb->size = size; in trace_buffer_allocate()
32 tb->tail = tb->data; in trace_buffer_allocate()
33 tb->overflow = false; in trace_buffer_allocate()
40 return p < ((void *)tb + tb->size); in trace_check_bounds()
51 if (tb->overflow) in trace_check_alloc()
55 tb->overflow = true; in trace_check_alloc()
66 p = tb->tail; in trace_alloc()
67 newtail = tb->tail + bytes; in trace_alloc()
[all …]
/linux/Documentation/admin-guide/perf/
H A Dalibaba_pmu.rst2 Alibaba's T-Head SoC Uncore Performance Monitoring Unit (PMU)
5 The Yitian 710, custom-built by Alibaba Group's chip development business,
6 T-Head, implements uncore PMU for performance and functional debugging to
9 DDR Sub-System Driveway (DRW) PMU Driver
14 channel is split into two independent sub-channels. The DDR Sub-System Driveway
15 implements separate PMUs for each sub-channel to monitor various performance
20 sub-channels of the same channel in die 0. And the PMU device of die 1 is
21 prefixed with ali_drw_400XXXXX, e.g. ali_drw_40021000.
23 Each sub-channel has 36 PMU counters in total, which is classified into
26 - Group 0: PMU Cycle Counter. This group has one pair of counters
[all …]
/linux/lib/crypto/powerpc/
H A Dsha1-spe-asm.S1 /* SPDX-License-Identifier: GPL-2.0-or-later */
3 * Fast SHA-1 implementation for SPE instruction set (PPC)
14 #include <asm/asm-offsets.h>
57 stwu r1,-128(r1); /* create stack frame */ \
106 #define R_00_15(a, b, c, d, e, w0, w1, k, off) \ argument
113 add e,e,rT0; /* 1: E = E + A' */ \
115 add e,e,w0; /* 1: E = E + W */ \
117 add e,e,rT2; /* 1: E = E + F */ \
119 add e,e,rK; /* 1: E = E + K */ \
121 add d,d,rK; /* 2: E = E + K */ \
[all …]

12345678910>>...43