/include/linux/ |
H A D | dqblk_qtree.h | 48 unsigned long long entries = epb; local 51 for (i = 1; entries < (1ULL << 32); i++) 52 entries *= epb;
|
H A D | net_dropmon.h | 30 __u32 entries; member in struct:net_dm_config_msg 35 __u32 entries; member in struct:net_dm_alert_msg
|
H A D | jump_label.h | 59 struct jump_entry *entries; member in struct:static_key 89 return (struct jump_entry *)((unsigned long)key->entries 95 if ((unsigned long)key->entries & JUMP_LABEL_TRUE_BRANCH) 135 { .enabled = ATOMIC_INIT(1), .entries = (void *)1 }) 137 { .enabled = ATOMIC_INIT(0), .entries = (void *)0 })
|
H A D | stacktrace.h | 12 unsigned long *entries; member in struct:stack_trace 13 int skip; /* input argument: How many entries to skip */
|
H A D | virtio_net.h | 128 * two out scatterlists. Each contains a 4 byte count of entries followed 135 __u32 entries; member in struct:virtio_net_ctrl_mac
|
H A D | kd.h | 67 struct unipair __user *entries; member in struct:unimapdesc 123 unsigned int kb_cnt; /* number of entries in following array */ 133 unsigned int kb_cnt; /* number of entries in following array */
|
H A D | rio.h | 309 int mbox, int entries); 312 int mbox, int entries);
|
H A D | uwb.h | 95 size_t entries; member in struct:uwb_beca 681 const struct uwb_est_entry *, size_t entries); 683 const struct uwb_est_entry *, size_t entries);
|
H A D | kvm.h | 626 struct kvm_irq_routing_entry entries[0]; member in struct:kvm_irq_routing
|
H A D | perf_event.h | 645 * nr: number of taken branches stored in entries[] 649 * to least recent, i.e., entries[0] contains the most 654 struct perf_branch_entry entries[0]; member in struct:perf_branch_stack
|
H A D | pci.h | 1030 struct msix_entry *entries, int nvec) 1055 struct msix_entry *entries, int nvec); 1029 pci_enable_msix(struct pci_dev *dev, struct msix_entry *entries, int nvec) argument
|
H A D | kvm_host.h | 767 const struct kvm_irq_routing_entry *entries,
|
/include/linux/netfilter_bridge/ |
H A D | ebtables.h | 47 /* total size of the entries */ 55 char __user *entries; member in struct:ebt_replace 63 /* total size of the entries */ 71 char *entries; member in struct:ebt_replace_kernel 85 /* nr. of entries */ 94 * ebt_entries struct when traversing the entries from start to end. 262 /* total size of the entries */ 269 char *entries; member in struct:ebt_table_info 357 #define EBT_ENTRY_ITERATE(entries, size, fn, args...) \ 364 __entry = (void *)(entries) [all...] |
/include/linux/netfilter_arp/ |
H A D | arp_tables.h | 36 #define ARPT_ENTRY_ITERATE(entries, size, fn, args...) \ 37 XT_ENTRY_ITERATE(struct arpt_entry, entries, size, fn, ## args) 153 /* Number of entries */ 156 /* Size of entries. */ 169 /* Number of entries */ 172 /* Total size of new entries */ 181 /* Information about old entries: */ 182 /* Number of counters (must be equal to current number of entries). */ 184 /* The old entries' counters. */ 187 /* The entries (han 188 struct arpt_entry entries[0]; member in struct:arpt_replace [all...] |
/include/linux/netfilter_ipv4/ |
H A D | ip_tables.h | 70 #define IPT_ENTRY_ITERATE(entries, size, fn, args...) \ 71 XT_ENTRY_ITERATE(struct ipt_entry, entries, size, fn, ## args) 175 /* Number of entries */ 178 /* Size of entries. */ 191 /* Number of entries */ 194 /* Total size of new entries */ 203 /* Information about old entries: */ 204 /* Number of counters (must be equal to current number of entries). */ 206 /* The old entries' counters. */ 209 /* The entries (han 210 struct ipt_entry entries[0]; member in struct:ipt_replace [all...] |
/include/linux/netfilter/ |
H A D | x_tables.h | 147 #define XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \ 155 __entry = (void *)(entries) + __i; \ 167 #define XT_ENTRY_ITERATE(type, entries, size, fn, args...) \ 168 XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args) 391 /* Number of entries: FIXME. --RR */ 393 /* Initial number of entries. Needed for module usage count */ 409 void *entries[1]; member in struct:xt_table_info 412 #define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
|
/include/linux/netfilter_ipv6/ |
H A D | ip6_tables.h | 63 #define IP6T_ENTRY_ITERATE(entries, size, fn, args...) \ 64 XT_ENTRY_ITERATE(struct ip6t_entry, entries, size, fn, ## args) 212 /* Number of entries */ 215 /* Size of entries. */ 228 /* Number of entries */ 231 /* Total size of new entries */ 240 /* Information about old entries: */ 241 /* Number of counters (must be equal to current number of entries). */ 243 /* The old entries' counters. */ 246 /* The entries (han 247 struct ip6t_entry entries[0]; member in struct:ip6t_replace [all...] |
/include/trace/events/ |
H A D | xen.h | 490 TP_PROTO(const void *addr, unsigned entries), 491 TP_ARGS(addr, entries), 494 __field(unsigned, entries) 497 __entry->entries = entries), 498 TP_printk("addr %p entries %u", 499 __entry->addr, __entry->entries)
|
/include/linux/mlx4/ |
H A D | cq.h | 148 int entries, struct mlx4_mtt *mtt);
|
/include/linux/sunrpc/ |
H A D | cache.h | 40 * We only expire entries when refcount is zero. 45 * for expiring and refreshing entries. 107 int entries; member in struct:cache_detail
|
/include/acpi/ |
H A D | actbl1.h | 207 u32 entries; member in struct:acpi_table_einj 312 u32 entries; member in struct:acpi_table_erst
|
H A D | actbl2.h | 573 * Currently, only 4 and 8 byte entries are defined. 16 and 32 byte entries 589 /* 4-byte device entries, all use struct acpi_ivrs_device4 */ 597 /* 8-byte device entries */ 932 u32 entries; /* Number of watchdog entries that follow */ member in struct:acpi_table_wdat
|
/include/sound/ |
H A D | trident.h | 267 unsigned int * entries; /* 16k-aligned TLB table */ member in struct:snd_trident_tlb 269 unsigned long * shadow_entries; /* shadow entries with virtual addresses */ 368 struct snd_trident_tlb tlb; /* TLB entries for NX cards */
|
/include/net/ |
H A D | neighbour.h | 175 atomic_t entries; member in struct:neigh_table
|
/include/scsi/ |
H A D | osd_protocol.h | 673 struct osd_sg_list_entry entries[]; member in struct:osd_sg_continuation_descriptor
|