Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 156) sorted by relevance

1234567

/include/linux/
Dlog2.h32 int __ilog2_u32(u32 n) in __ilog2_u32() argument
34 return fls(n) - 1; in __ilog2_u32()
40 int __ilog2_u64(u64 n) in __ilog2_u64() argument
42 return fls64(n) - 1; in __ilog2_u64()
52 bool is_power_of_2(unsigned long n) in is_power_of_2() argument
54 return (n != 0 && ((n & (n - 1)) == 0)); in is_power_of_2()
61 unsigned long __roundup_pow_of_two(unsigned long n) in __roundup_pow_of_two() argument
63 return 1UL << fls_long(n - 1); in __roundup_pow_of_two()
70 unsigned long __rounddown_pow_of_two(unsigned long n) in __rounddown_pow_of_two() argument
72 return 1UL << (fls_long(n) - 1); in __rounddown_pow_of_two()
[all …]
Drculist_bl.h11 struct hlist_bl_node *n) in hlist_bl_set_first_rcu() argument
13 LIST_BL_BUG_ON((unsigned long)n & LIST_BL_LOCKMASK); in hlist_bl_set_first_rcu()
17 (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK)); in hlist_bl_set_first_rcu()
46 static inline void hlist_bl_del_init_rcu(struct hlist_bl_node *n) in hlist_bl_del_init_rcu() argument
48 if (!hlist_bl_unhashed(n)) { in hlist_bl_del_init_rcu()
49 __hlist_bl_del(n); in hlist_bl_del_init_rcu()
50 n->pprev = NULL; in hlist_bl_del_init_rcu()
73 static inline void hlist_bl_del_rcu(struct hlist_bl_node *n) in hlist_bl_del_rcu() argument
75 __hlist_bl_del(n); in hlist_bl_del_rcu()
76 n->pprev = LIST_POISON2; in hlist_bl_del_rcu()
[all …]
Dhash.h39 u64 n = hash; in hash_64() local
40 n <<= 18; in hash_64()
41 hash -= n; in hash_64()
42 n <<= 33; in hash_64()
43 hash -= n; in hash_64()
44 n <<= 3; in hash_64()
45 hash += n; in hash_64()
46 n <<= 3; in hash_64()
47 hash -= n; in hash_64()
48 n <<= 4; in hash_64()
[all …]
Dlist_bl.h63 struct hlist_bl_node *n) in hlist_bl_set_first() argument
65 LIST_BL_BUG_ON((unsigned long)n & LIST_BL_LOCKMASK); in hlist_bl_set_first()
68 h->first = (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK); in hlist_bl_set_first()
76 static inline void hlist_bl_add_head(struct hlist_bl_node *n, in hlist_bl_add_head() argument
81 n->next = first; in hlist_bl_add_head()
83 first->pprev = &n->next; in hlist_bl_add_head()
84 n->pprev = &h->first; in hlist_bl_add_head()
85 hlist_bl_set_first(h, n); in hlist_bl_add_head()
88 static inline void __hlist_bl_del(struct hlist_bl_node *n) in __hlist_bl_del() argument
90 struct hlist_bl_node *next = n->next; in __hlist_bl_del()
[all …]
Drculist_nulls.h32 static inline void hlist_nulls_del_init_rcu(struct hlist_nulls_node *n) in hlist_nulls_del_init_rcu() argument
34 if (!hlist_nulls_unhashed(n)) { in hlist_nulls_del_init_rcu()
35 __hlist_nulls_del(n); in hlist_nulls_del_init_rcu()
36 n->pprev = NULL; in hlist_nulls_del_init_rcu()
65 static inline void hlist_nulls_del_rcu(struct hlist_nulls_node *n) in hlist_nulls_del_rcu() argument
67 __hlist_nulls_del(n); in hlist_nulls_del_rcu()
68 n->pprev = LIST_POISON2; in hlist_nulls_del_rcu()
90 static inline void hlist_nulls_add_head_rcu(struct hlist_nulls_node *n, in hlist_nulls_add_head_rcu() argument
95 n->next = first; in hlist_nulls_add_head_rcu()
96 n->pprev = &h->first; in hlist_nulls_add_head_rcu()
[all …]
Dlist.h397 #define list_for_each_safe(pos, n, head) \ argument
398 for (pos = (head)->next, n = pos->next; pos != (head); \
399 pos = n, n = pos->next)
407 #define list_for_each_prev_safe(pos, n, head) \ argument
408 for (pos = (head)->prev, n = pos->prev; \
410 pos = n, n = pos->prev)
492 #define list_for_each_entry_safe(pos, n, head, member) \ argument
494 n = list_entry(pos->member.next, typeof(*pos), member); \
496 pos = n, n = list_entry(n->member.next, typeof(*n), member))
508 #define list_for_each_entry_safe_continue(pos, n, head, member) \ argument
[all …]
Dkmemcheck.h20 void kmemcheck_show_pages(struct page *p, unsigned int n);
21 void kmemcheck_hide_pages(struct page *p, unsigned int n);
25 void kmemcheck_mark_unallocated(void *address, unsigned int n);
26 void kmemcheck_mark_uninitialized(void *address, unsigned int n);
27 void kmemcheck_mark_initialized(void *address, unsigned int n);
28 void kmemcheck_mark_freed(void *address, unsigned int n);
30 void kmemcheck_mark_unallocated_pages(struct page *p, unsigned int n);
31 void kmemcheck_mark_uninitialized_pages(struct page *p, unsigned int n);
32 void kmemcheck_mark_initialized_pages(struct page *p, unsigned int n);
123 static inline void kmemcheck_mark_unallocated(void *address, unsigned int n) in kmemcheck_mark_unallocated() argument
[all …]
Dioport.h173 #define request_region(start,n,name) __request_region(&ioport_resource, (start), (n), (name), 0) argument
174 #define request_muxed_region(start,n,name) __request_region(&ioport_resource, (start), (n), (name),… argument
175 #define __request_mem_region(start,n,name, excl) __request_region(&iomem_resource, (start), (n), (n… argument
176 #define request_mem_region(start,n,name) __request_region(&iomem_resource, (start), (n), (name), 0) argument
177 #define request_mem_region_exclusive(start,n,name) \ argument
178 __request_region(&iomem_resource, (start), (n), (name), IORESOURCE_EXCLUSIVE)
183 resource_size_t n,
187 #define release_region(start,n) __release_region(&ioport_resource, (start), (n)) argument
188 #define check_mem_region(start,n) __check_region(&iomem_resource, (start), (n)) argument
189 #define release_mem_region(start,n) __release_region(&iomem_resource, (start), (n)) argument
[all …]
Dlist_nulls.h59 static inline void hlist_nulls_add_head(struct hlist_nulls_node *n, in hlist_nulls_add_head() argument
64 n->next = first; in hlist_nulls_add_head()
65 n->pprev = &h->first; in hlist_nulls_add_head()
66 h->first = n; in hlist_nulls_add_head()
68 first->pprev = &n->next; in hlist_nulls_add_head()
71 static inline void __hlist_nulls_del(struct hlist_nulls_node *n) in __hlist_nulls_del() argument
73 struct hlist_nulls_node *next = n->next; in __hlist_nulls_del()
74 struct hlist_nulls_node **pprev = n->pprev; in __hlist_nulls_del()
80 static inline void hlist_nulls_del(struct hlist_nulls_node *n) in hlist_nulls_del() argument
82 __hlist_nulls_del(n); in hlist_nulls_del()
[all …]
Dcirc_buf.h27 int n = ((head) + end) & ((size)-1); \
28 n < end ? n : end;})
33 int n = (end + (tail)) & ((size)-1); \
34 n <= end ? n : end+1;})
Drculist.h135 static inline void hlist_del_init_rcu(struct hlist_node *n) in hlist_del_init_rcu() argument
137 if (!hlist_unhashed(n)) { in hlist_del_init_rcu()
138 __hlist_del(n); in hlist_del_init_rcu()
139 n->pprev = NULL; in hlist_del_init_rcu()
327 static inline void hlist_del_rcu(struct hlist_node *n) in hlist_del_rcu() argument
329 __hlist_del(n); in hlist_del_rcu()
330 n->pprev = LIST_POISON2; in hlist_del_rcu()
379 static inline void hlist_add_head_rcu(struct hlist_node *n, in hlist_add_head_rcu() argument
384 n->next = first; in hlist_add_head_rcu()
385 n->pprev = &h->first; in hlist_add_head_rcu()
[all …]
Ddelay.h31 #define mdelay(n) (\ argument
32 (__builtin_constant_p(n) && (n)<=MAX_UDELAY_MS) ? udelay((n)*1000) : \
33 ({unsigned long __ms=(n); while (__ms--) udelay(1000);}))
Dklist.h45 extern void klist_add_tail(struct klist_node *n, struct klist *k);
46 extern void klist_add_head(struct klist_node *n, struct klist *k);
47 extern void klist_add_after(struct klist_node *n, struct klist_node *pos);
48 extern void klist_add_before(struct klist_node *n, struct klist_node *pos);
50 extern void klist_del(struct klist_node *n);
51 extern void klist_remove(struct klist_node *n);
53 extern int klist_node_attached(struct klist_node *n);
64 struct klist_node *n);
Dprofile.h79 int task_handoff_register(struct notifier_block * n);
80 int task_handoff_unregister(struct notifier_block * n);
82 int profile_event_register(enum profile_type, struct notifier_block * n);
83 int profile_event_unregister(enum profile_type, struct notifier_block * n);
114 static inline int task_handoff_register(struct notifier_block * n) in task_handoff_register() argument
119 static inline int task_handoff_unregister(struct notifier_block * n) in task_handoff_unregister() argument
124 static inline int profile_event_register(enum profile_type t, struct notifier_block * n) in profile_event_register() argument
129 static inline int profile_event_unregister(enum profile_type t, struct notifier_block * n) in profile_event_unregister() argument
Dbug.h15 #define BUILD_BUG_ON_NOT_POWER_OF_2(n) argument
23 #define BUILD_BUG_ON_NOT_POWER_OF_2(n) \ argument
24 BUILD_BUG_ON((n) == 0 || (((n) & ((n) - 1)) != 0))
/include/asm-generic/
Ddelay.h19 #define udelay(n) \ argument
21 if (__builtin_constant_p(n)) { \
22 if ((n) / 20000 >= 1) \
25 __const_udelay((n) * 0x10c7ul); \
27 __udelay(n); \
32 #define ndelay(n) \ argument
34 if (__builtin_constant_p(n)) { \
35 if ((n) / 20000 >= 1) \
38 __const_udelay((n) * 5ul); \
40 __ndelay(n); \
Ddiv64.h25 # define do_div(n,base) ({ \ argument
28 __rem = ((uint64_t)(n)) % __base; \
29 (n) = ((uint64_t)(n)) / __base; \
40 # define do_div(n,base) ({ \ argument
43 (void)(((typeof((n)) *)0) == ((uint64_t *)0)); \
44 if (likely(((n) >> 32) == 0)) { \
45 __rem = (uint32_t)(n) % __base; \
46 (n) = (uint32_t)(n) / __base; \
48 __rem = __div64_32(&(n), __base); \
Duaccess.h79 const void __user * from, unsigned long n) in __copy_from_user() argument
81 if (__builtin_constant_p(n)) { in __copy_from_user()
82 switch(n) { in __copy_from_user()
102 memcpy(to, (const void __force *)from, n); in __copy_from_user()
109 const void *from, unsigned long n) in __copy_to_user() argument
111 if (__builtin_constant_p(n)) { in __copy_to_user()
112 switch(n) { in __copy_to_user()
132 memcpy((void __force *)to, from, n); in __copy_to_user()
244 const void __user * from, unsigned long n) in copy_from_user() argument
247 if (access_ok(VERIFY_READ, from, n)) in copy_from_user()
[all …]
Dgetorder.h49 #define get_order(n) \ argument
51 __builtin_constant_p(n) ? ( \
52 ((n) == 0UL) ? BITS_PER_LONG - PAGE_SHIFT : \
53 (((n) < (1UL << PAGE_SHIFT)) ? 0 : \
54 ilog2((n) - 1) - PAGE_SHIFT + 1) \
56 __get_order(n) \
/include/acpi/platform/
Dacenv.h250 #define ACPI_STRNCPY(d,s,n) (void) strncpy((d), (s), (acpi_size)(n)) argument
251 #define ACPI_STRNCMP(d,s,n) strncmp((d), (s), (acpi_size)(n)) argument
254 #define ACPI_STRNCAT(d,s,n) strncat((d), (s), (acpi_size)(n)) argument
255 #define ACPI_STRTOUL(d,s,n) strtoul((d), (s), (acpi_size)(n)) argument
256 #define ACPI_MEMCMP(s1,s2,n) memcmp((const char *)(s1), (const char *)(s2), (acpi_size)(n)) argument
257 #define ACPI_MEMCPY(d,s,n) (void) memcpy((d), (s), (acpi_size)(n)) argument
258 #define ACPI_MEMSET(d,s,n) (void) memset((d), (s), (acpi_size)(n)) argument
311 #define ACPI_STRNCPY(d,s,n) (void) acpi_ut_strncpy ((d), (s), (acpi_size)(n)) argument
312 #define ACPI_STRNCMP(d,s,n) acpi_ut_strncmp ((d), (s), (acpi_size)(n)) argument
315 #define ACPI_STRNCAT(d,s,n) acpi_ut_strncat ((d), (s), (acpi_size)(n)) argument
[all …]
/include/linux/usb/
Dvideo.h203 #define UVC_DT_HEADER_SIZE(n) (12+(n)) argument
205 #define UVC_HEADER_DESCRIPTOR(n) \ argument
206 uvc_header_descriptor_##n
208 #define DECLARE_UVC_HEADER_DESCRIPTOR(n) \ argument
209 struct UVC_HEADER_DESCRIPTOR(n) { \
217 __u8 baInterfaceNr[n]; \
263 #define UVC_DT_CAMERA_TERMINAL_SIZE(n) (15+(n)) argument
276 #define UVC_DT_SELECTOR_UNIT_SIZE(n) (6+(n)) argument
278 #define UVC_SELECTOR_UNIT_DESCRIPTOR(n) \ argument
279 uvc_selector_unit_descriptor_##n
[all …]
Dmsm_hsusb_hw.h40 #define ULPI_ADDR(n) (((n) & 255) << 16) argument
41 #define ULPI_DATA(n) ((n) & 255) argument
42 #define ULPI_DATA_READ(n) (((n) >> 8) & 255) argument
/include/linux/spi/
Dpxa2xx_spi.h62 #define DCSR(n) (n) argument
63 #define DSADR(n) (n) argument
64 #define DTADR(n) (n) argument
65 #define DCMD(n) (n) argument
66 #define DRCMR(n) (n) argument
/include/linux/netfilter/ipset/
Dip_set_ahash.h40 u32 n; in tune_ahash_max() local
45 n = curr + AHASH_INIT_SIZE; in tune_ahash_max()
49 return n > curr && n <= 64 ? n : curr; in tune_ahash_max()
190 struct hbucket *n; in ahash_destroy() local
194 n = hbucket(t, i); in ahash_destroy()
195 if (n->size) in ahash_destroy()
197 kfree(n->value); in ahash_destroy()
228 struct hbucket *n; in ip_set_hash_flush() local
232 n = hbucket(t, i); in ip_set_hash_flush()
233 if (n->size) { in ip_set_hash_flush()
[all …]
/include/net/
Darp.h21 struct neighbour *n; in __ipv4_neigh_lookup() local
27 for (n = rcu_dereference_bh(nht->hash_buckets[hash_val]); in __ipv4_neigh_lookup()
28 n != NULL; in __ipv4_neigh_lookup()
29 n = rcu_dereference_bh(n->next)) { in __ipv4_neigh_lookup()
30 if (n->dev == dev && *(u32 *)n->primary_key == key) { in __ipv4_neigh_lookup()
31 if (!atomic_inc_not_zero(&n->refcnt)) in __ipv4_neigh_lookup()
32 n = NULL; in __ipv4_neigh_lookup()
38 return n; in __ipv4_neigh_lookup()

1234567