Home
last modified time | relevance | path

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

12345678

/include/linux/
Dlog2.h26 int __ilog2_u32(u32 n) in __ilog2_u32() argument
28 return fls(n) - 1; in __ilog2_u32()
34 int __ilog2_u64(u64 n) in __ilog2_u64() argument
36 return fls64(n) - 1; in __ilog2_u64()
46 bool is_power_of_2(unsigned long n) in is_power_of_2() argument
48 return (n != 0 && ((n & (n - 1)) == 0)); in is_power_of_2()
55 unsigned long __roundup_pow_of_two(unsigned long n) in __roundup_pow_of_two() argument
57 return 1UL << fls_long(n - 1); in __roundup_pow_of_two()
64 unsigned long __rounddown_pow_of_two(unsigned long n) in __rounddown_pow_of_two() argument
66 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 …]
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 …]
Dhash.h60 u64 n = hash; in hash_64() local
61 n <<= 18; in hash_64()
62 hash -= n; in hash_64()
63 n <<= 33; in hash_64()
64 hash -= n; in hash_64()
65 n <<= 3; in hash_64()
66 hash += n; in hash_64()
67 n <<= 3; in hash_64()
68 hash -= n; in hash_64()
69 n <<= 4; in hash_64()
[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 …]
Dlist.h425 #define list_for_each_safe(pos, n, head) \ argument
426 for (pos = (head)->next, n = pos->next; pos != (head); \
427 pos = n, n = pos->next)
435 #define list_for_each_prev_safe(pos, n, head) \ argument
436 for (pos = (head)->prev, n = pos->prev; \
438 pos = n, n = pos->prev)
520 #define list_for_each_entry_safe(pos, n, head, member) \ argument
522 n = list_next_entry(pos, member); \
524 pos = n, n = list_next_entry(n, member))
536 #define list_for_each_entry_safe_continue(pos, n, head, member) \ 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;})
Dioport.h184 #define request_region(start,n,name) __request_region(&ioport_resource, (start), (n), (name), 0) argument
185 #define request_muxed_region(start,n,name) __request_region(&ioport_resource, (start), (n), (name),… argument
186 #define __request_mem_region(start,n,name, excl) __request_region(&iomem_resource, (start), (n), (n… argument
187 #define request_mem_region(start,n,name) __request_region(&iomem_resource, (start), (n), (name), 0) argument
188 #define request_mem_region_exclusive(start,n,name) \ argument
189 __request_region(&iomem_resource, (start), (n), (name), IORESOURCE_EXCLUSIVE)
194 resource_size_t n,
198 #define release_region(start,n) __release_region(&ioport_resource, (start), (n)) argument
199 #define check_mem_region(start,n) __check_region(&iomem_resource, (start), (n)) argument
200 #define release_mem_region(start,n) __release_region(&iomem_resource, (start), (n)) argument
[all …]
Dprofile.h80 int task_handoff_register(struct notifier_block * n);
81 int task_handoff_unregister(struct notifier_block * n);
83 int profile_event_register(enum profile_type, struct notifier_block * n);
84 int profile_event_unregister(enum profile_type, struct notifier_block * n);
112 static inline int task_handoff_register(struct notifier_block * n) in task_handoff_register() argument
117 static inline int task_handoff_unregister(struct notifier_block * n) in task_handoff_unregister() argument
122 static inline int profile_event_register(enum profile_type t, struct notifier_block * n) in profile_event_register() argument
127 static inline int profile_event_unregister(enum profile_type t, struct notifier_block * n) in profile_event_unregister() argument
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_behind(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);
Drculist.h155 static inline void hlist_del_init_rcu(struct hlist_node *n) in hlist_del_init_rcu() argument
157 if (!hlist_unhashed(n)) { in hlist_del_init_rcu()
158 __hlist_del(n); in hlist_del_init_rcu()
159 n->pprev = NULL; in hlist_del_init_rcu()
343 static inline void hlist_del_rcu(struct hlist_node *n) in hlist_del_rcu() argument
345 __hlist_del(n); in hlist_del_rcu()
346 n->pprev = LIST_POISON2; in hlist_del_rcu()
395 static inline void hlist_add_head_rcu(struct hlist_node *n, in hlist_add_head_rcu() argument
400 n->next = first; in hlist_add_head_rcu()
401 n->pprev = &h->first; in hlist_add_head_rcu()
[all …]
Dfsl_ifc.h68 #define IFC_AMASK(n) (IFC_AMASK_MASK << \ argument
69 (__ilog2(n) - IFC_AMASK_SHIFT))
110 #define CSOR_NAND_PB(n) ((__ilog2(n) - 5) << CSOR_NAND_PB_SHIFT) argument
134 #define CSOR_NOR_ADM_SHIFT(n) ((n) << CSOR_NOR_ADM_SHIFT_SHIFT) argument
163 #define CSOR_GPCM_GPTO(n) ((__ilog2(n) - 8) << CSOR_GPCM_GPTO_SHIFT) argument
171 #define CSOR_GPCM_ADM_SHIFT(n) ((n) << CSOR_GPCM_ADM_SHIFT_SHIFT) argument
175 #define CSOR_GPCM_GAPERRD(n) (((n) - 1) << CSOR_GPCM_GAPERRD_SHIFT) argument
240 #define IFC_CCR_CLK_DIV(n) ((n-1) << IFC_CCR_CLK_DIV_SHIFT) argument
244 #define IFC_CCR_CLK_DLY(n) ((n) << IFC_CCR_CLK_DLY_SHIFT) argument
271 #define IFC_NAND_NCFGR_NUM_LOOP(n) ((n) << IFC_NAND_NCFGR_NUM_LOOP_SHIFT) argument
[all …]
/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); \
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) \
Duaccess.h80 const void __user * from, unsigned long n) in __copy_from_user() argument
82 if (__builtin_constant_p(n)) { in __copy_from_user()
83 switch(n) { in __copy_from_user()
103 memcpy(to, (const void __force *)from, n); in __copy_from_user()
110 const void *from, unsigned long n) in __copy_to_user() argument
112 if (__builtin_constant_p(n)) { in __copy_to_user()
113 switch(n) { in __copy_to_user()
133 memcpy((void __force *)to, from, n); in __copy_to_user()
239 size_t n = __copy_from_user(x, ptr, size); in __get_user_fn() local
240 if (unlikely(n)) { in __get_user_fn()
[all …]
Dcmpxchg.h96 #define cmpxchg_local(ptr, o, n) \ argument
98 (unsigned long)(n), sizeof(*(ptr))))
102 #define cmpxchg64_local(ptr, o, n) __cmpxchg64_local_generic((ptr), (o), (n)) argument
105 #define cmpxchg(ptr, o, n) cmpxchg_local((ptr), (o), (n)) argument
106 #define cmpxchg64(ptr, o, n) cmpxchg64_local((ptr), (o), (n)) argument
/include/net/
Darp.h22 struct neighbour *n; in __ipv4_neigh_lookup_noref() local
26 for (n = rcu_dereference_bh(nht->hash_buckets[hash_val]); in __ipv4_neigh_lookup_noref()
27 n != NULL; in __ipv4_neigh_lookup_noref()
28 n = rcu_dereference_bh(n->next)) { in __ipv4_neigh_lookup_noref()
29 if (n->dev == dev && *(u32 *)n->primary_key == key) in __ipv4_neigh_lookup_noref()
30 return n; in __ipv4_neigh_lookup_noref()
38 struct neighbour *n; in __ipv4_neigh_lookup() local
44 n = __ipv4_neigh_lookup_noref(dev, key); in __ipv4_neigh_lookup()
45 if (n && !atomic_inc_not_zero(&n->refcnt)) in __ipv4_neigh_lookup()
46 n = NULL; in __ipv4_neigh_lookup()
[all …]
/include/uapi/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 …]
/include/acpi/platform/
Dacenv.h350 #define ACPI_STRNCPY(d,s,n) (void) strncpy((d), (s), (acpi_size)(n)) argument
351 #define ACPI_STRNCMP(d,s,n) strncmp((d), (s), (acpi_size)(n)) argument
354 #define ACPI_STRNCAT(d,s,n) strncat((d), (s), (acpi_size)(n)) argument
355 #define ACPI_STRTOUL(d,s,n) strtoul((d), (s), (acpi_size)(n)) argument
356 #define ACPI_MEMCMP(s1,s2,n) memcmp((const char *)(s1), (const char *)(s2), (acpi_size)(n)) argument
357 #define ACPI_MEMCPY(d,s,n) (void) memcpy((d), (s), (acpi_size)(n)) argument
358 #define ACPI_MEMSET(d,s,n) (void) memset((d), (s), (acpi_size)(n)) argument
410 #define ACPI_STRNCPY(d,s,n) (void) acpi_ut_strncpy ((d), (s), (acpi_size)(n)) argument
411 #define ACPI_STRNCMP(d,s,n) acpi_ut_strncmp ((d), (s), (acpi_size)(n)) argument
414 #define ACPI_STRNCAT(d,s,n) acpi_ut_strncat ((d), (s), (acpi_size)(n)) argument
[all …]
/include/linux/usb/
Dmsm_hsusb_hw.h45 #define ULPI_ADDR(n) (((n) & 255) << 16) argument
46 #define ULPI_DATA(n) ((n) & 255) argument
47 #define ULPI_DATA_READ(n) (((n) >> 8) & 255) argument
/include/uapi/linux/
Dmroute6.h60 #define IF_SET(n, p) ((p)->ifs_bits[(n)/NIFBITS] |= (1 << ((n) % NIFBITS))) argument
61 #define IF_CLR(n, p) ((p)->ifs_bits[(n)/NIFBITS] &= ~(1 << ((n) % NIFBITS))) argument
62 #define IF_ISSET(n, p) ((p)->ifs_bits[(n)/NIFBITS] & (1 << ((n) % NIFBITS))) argument

12345678