/linux-4.4.14/include/linux/spi/ |
H A D | mc33880.h | 5 /* number assigned to the first GPIO */
|
H A D | max7301.h | 22 /* number assigned to the first GPIO */ 27 * _note_ the 4 lowest bits are unused, because the first 4
|
H A D | ad7879.h | 37 /* identifies the first GPIO number handled by this chip;
|
H A D | ds1305.h | 9 * backup power, and potentially on the first boot.
|
/linux-4.4.14/include/asm-generic/bitops/ |
H A D | builtin-__ffs.h | 5 * __ffs - find first bit in word. 8 * Undefined if no bit exists, so code should check against 0 first.
|
H A D | ffz.h | 5 * ffz - find first zero in word. 8 * Undefined if no zero exists, so code should check against ~0UL first.
|
H A D | __ffs.h | 7 * __ffs - find first bit in word. 10 * Undefined if no bit exists, so code should check against 0 first.
|
H A D | builtin-__fls.h | 8 * Undefined if no set bit exists, so code should check against 0 first.
|
H A D | builtin-ffs.h | 5 * ffs - find first bit set
|
H A D | ffs.h | 5 * ffs - find first bit set
|
H A D | find.h | 35 * find_first_bit - find the first set bit in a memory region 39 * Returns the bit number of the first set bit. 46 * find_first_zero_bit - find the first cleared bit in a memory region 50 * Returns the bit number of the first cleared bit.
|
H A D | __fls.h | 10 * Undefined if no set bit exists, so code should check against 0 first.
|
/linux-4.4.14/ipc/ |
H A D | syscall.c | 16 SYSCALL_DEFINE6(ipc, unsigned int, call, int, first, unsigned long, second, SYSCALL_DEFINE6() 26 return sys_semtimedop(first, (struct sembuf __user *)ptr, SYSCALL_DEFINE6() 29 return sys_semtimedop(first, (struct sembuf __user *)ptr, SYSCALL_DEFINE6() 34 return sys_semget(first, second, third); SYSCALL_DEFINE6() 41 return sys_semctl(first, second, third, arg); SYSCALL_DEFINE6() 45 return sys_msgsnd(first, (struct msgbuf __user *) ptr, SYSCALL_DEFINE6() 58 return sys_msgrcv(first, tmp.msgp, second, SYSCALL_DEFINE6() 62 return sys_msgrcv(first, SYSCALL_DEFINE6() 67 return sys_msgget((key_t) first, second); SYSCALL_DEFINE6() 69 return sys_msgctl(first, second, (struct msqid_ds __user *)ptr); SYSCALL_DEFINE6() 75 ret = do_shmat(first, (char __user *)ptr, SYSCALL_DEFINE6() 91 return sys_shmget(first, second, third); SYSCALL_DEFINE6() 93 return sys_shmctl(first, second, SYSCALL_DEFINE6()
|
H A D | compat.c | 238 static long do_compat_semctl(int first, int second, int third, u32 pad) do_compat_semctl() argument 267 err = sys_semctl(first, second, third, fourth); do_compat_semctl() 274 err = sys_semctl(first, second, third, fourth); do_compat_semctl() 300 err = sys_semctl(first, second, third, fourth); do_compat_semctl() 329 COMPAT_SYSCALL_DEFINE6(ipc, u32, call, int, first, int, second, COMPAT_SYSCALL_DEFINE6() 341 return sys_semtimedop(first, compat_ptr(ptr), second, NULL); COMPAT_SYSCALL_DEFINE6() 343 return compat_sys_semtimedop(first, compat_ptr(ptr), second, COMPAT_SYSCALL_DEFINE6() 346 return sys_semget(first, second, third); COMPAT_SYSCALL_DEFINE6() 352 return do_compat_semctl(first, second, third, pad); COMPAT_SYSCALL_DEFINE6() 358 if (first < 0 || second < 0) COMPAT_SYSCALL_DEFINE6() 364 return do_msgsnd(first, type, up->mtext, second, third); COMPAT_SYSCALL_DEFINE6() 369 if (first < 0 || second < 0) COMPAT_SYSCALL_DEFINE6() 381 return do_msgrcv(first, uptr, second, (s32)fifth, third, COMPAT_SYSCALL_DEFINE6() 385 return sys_msgget(first, second); COMPAT_SYSCALL_DEFINE6() 387 return compat_sys_msgctl(first, second, compat_ptr(ptr)); COMPAT_SYSCALL_DEFINE6() 395 err = do_shmat(first, compat_ptr(ptr), second, &raddr, COMPAT_SYSCALL_DEFINE6() 404 return sys_shmget(first, (unsigned)second, third); COMPAT_SYSCALL_DEFINE6() 406 return compat_sys_shmctl(first, second, compat_ptr(ptr)); COMPAT_SYSCALL_DEFINE6() 498 COMPAT_SYSCALL_DEFINE3(msgctl, int, first, int, second, void __user *, uptr) COMPAT_SYSCALL_DEFINE3() 511 err = sys_msgctl(first, second, uptr); COMPAT_SYSCALL_DEFINE3() 526 err = sys_msgctl(first, second, p); COMPAT_SYSCALL_DEFINE3() 532 err = sys_msgctl(first, second, p); COMPAT_SYSCALL_DEFINE3() 668 COMPAT_SYSCALL_DEFINE3(shmctl, int, first, int, second, void __user *, uptr) COMPAT_SYSCALL_DEFINE3() 682 err = sys_shmctl(first, second, uptr); COMPAT_SYSCALL_DEFINE3() 687 err = sys_shmctl(first, second, p); COMPAT_SYSCALL_DEFINE3() 713 err = sys_shmctl(first, second, p); COMPAT_SYSCALL_DEFINE3() 719 err = sys_shmctl(first, second, p); COMPAT_SYSCALL_DEFINE3() 734 err = sys_shmctl(first, second, p); COMPAT_SYSCALL_DEFINE3()
|
/linux-4.4.14/lib/ |
H A D | llist.c | 32 * @new_first: first entry in batch to be added 41 struct llist_node *first; llist_add_batch() local 44 new_last->next = first = ACCESS_ONCE(head->first); llist_add_batch() 45 } while (cmpxchg(&head->first, first, new_first) != first); llist_add_batch() 47 return !first; llist_add_batch() 52 * llist_del_first - delete the first entry of lock-less list 55 * If list is empty, return NULL, otherwise, return the first entry 61 * llist_add) sequence in another user may change @head->first->next, 62 * but keep @head->first. If multiple consumers are needed, please 69 entry = smp_load_acquire(&head->first); llist_del_first() 75 entry = cmpxchg(&head->first, old_entry, next); llist_del_first() 86 * @head: first item of the list to be reversed 89 * new first entry.
|
H A D | extable.c | 72 search_extable(const struct exception_table_entry *first, search_extable() argument 76 while (first <= last) { search_extable() 79 mid = ((last - first) >> 1) + first; search_extable() 85 first = mid + 1; search_extable()
|
H A D | crc32defs.h | 3 * *the* standard CRC-32 polynomial, first popularized by Ethernet. 58 * lsbit-first. Be sure to use cpu_to_le32() to append the computed CRC. 67 * msbit-first. Be sure to use cpu_to_be32() to append the computed CRC.
|
H A D | plist.c | 76 struct plist_node *first, *iter, *prev = NULL; plist_add() local 86 first = iter = plist_first(head); plist_add() 97 } while (iter != first); plist_add() 185 struct plist_node *first, *prio_pos, *node_pos; plist_test_check() local 192 prio_pos = first = plist_first(&test_head); plist_test_check() 196 if (node_pos == first) plist_test_check() 209 BUG_ON(prio_pos->prio_list.next != &first->prio_list); plist_test_check()
|
H A D | cpumask.c | 11 * @src1p: the first cpumask pointer 141 * cpumask_local_spread - select the i'th cpu with local numa cpu's first 146 * local cpus are returned first, followed by non-local ones, then it 163 /* NUMA first. */ cpumask_local_spread()
|
H A D | debug_locks.c | 21 * that would just muddy the log. So we report the first one and
|
/linux-4.4.14/arch/m68k/include/asm/ |
H A D | atafd.h | 9 int sect_offset; /* offset of first sector */
|
H A D | delay.h | 51 * This is a macro so that the const version can factor out the first 89 * first constant multiplications gets optimized away if the delay is 112 * This is a macro so that the const version can factor out the first
|
/linux-4.4.14/include/linux/amba/ |
H A D | pl061.h | 6 /* number of the first GPIO */ 9 /* number of the first IRQ.
|
/linux-4.4.14/include/linux/ |
H A D | intel_pmic_gpio.h | 5 /* the first IRQ of the chip */ 7 /* number assigned to the first GPIO */
|
H A D | list_bl.h | 12 * For modification operations, the 0 bit of hlist_bl_head->first 34 struct hlist_bl_node *first; member in struct:hlist_bl_head 41 ((ptr)->first = NULL) 59 ((unsigned long)h->first & ~LIST_BL_LOCKMASK); hlist_bl_first() 66 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != hlist_bl_set_first() 68 h->first = (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK); hlist_bl_set_first() 73 return !((unsigned long)h->first & ~LIST_BL_LOCKMASK); hlist_bl_empty() 79 struct hlist_bl_node *first = hlist_bl_first(h); hlist_bl_add_head() local 81 n->next = first; hlist_bl_add_head() 82 if (first) hlist_bl_add_head() 83 first->pprev = &n->next; hlist_bl_add_head() 84 n->pprev = &h->first; hlist_bl_add_head() 95 /* pprev may be `first`, so be careful not to lose the lock bit */ __hlist_bl_del()
|
H A D | list_nulls.h | 21 struct hlist_nulls_node *first; member in struct:hlist_nulls_head 29 ((ptr)->first = (struct hlist_nulls_node *) NULLS_MARKER(nulls)) 60 return is_a_nulls(h->first); hlist_nulls_empty() 66 struct hlist_nulls_node *first = h->first; hlist_nulls_add_head() local 68 n->next = first; hlist_nulls_add_head() 69 n->pprev = &h->first; hlist_nulls_add_head() 70 h->first = n; hlist_nulls_add_head() 71 if (!is_a_nulls(first)) hlist_nulls_add_head() 72 first->pprev = &n->next; hlist_nulls_add_head() 100 for (pos = (head)->first; \
|
H A D | rculist_bl.h | 14 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != hlist_bl_set_first_rcu() 16 rcu_assign_pointer(h->first, hlist_bl_set_first_rcu() 23 ((unsigned long)rcu_dereference_check(h->first, hlist_bl_is_locked(h)) & ~LIST_BL_LOCKMASK); hlist_bl_first_rcu() 101 struct hlist_bl_node *first; hlist_bl_add_head_rcu() local 104 first = hlist_bl_first(h); hlist_bl_add_head_rcu() 106 n->next = first; hlist_bl_add_head_rcu() 107 if (first) hlist_bl_add_head_rcu() 108 first->pprev = &n->next; hlist_bl_add_head_rcu() 109 n->pprev = &h->first; hlist_bl_add_head_rcu()
|
H A D | rculist_nulls.h | 41 (*((struct hlist_nulls_node __rcu __force **)&(head)->first)) 93 struct hlist_nulls_node *first = h->first; hlist_nulls_add_head_rcu() local 95 n->next = first; hlist_nulls_add_head_rcu() 96 n->pprev = &h->first; hlist_nulls_add_head_rcu() 98 if (!is_a_nulls(first)) hlist_nulls_add_head_rcu() 99 first->pprev = &n->next; hlist_nulls_add_head_rcu() 108 * The barrier() is needed to make sure compiler doesn't cache first element [1],
|
H A D | crc8.h | 46 * regular bit order (lsb first). Polynomials in CRC algorithms are typically 51 * For lsb first direction x^7 maps to the lsb. So the polynomial is as below. 53 * - lsb first: poly = 10101011(1) = 0xAB 64 * reverse bit order (msb first). Polynomials in CRC algorithms are typically 69 * For msb first direction x^7 maps to the msb. So the polynomial is as below. 71 * - msb first: poly = (1)11010101 = 0xD5
|
H A D | llist.h | 10 * depends on list->first->next does not changed if list->first is not 62 struct llist_node *first; member in struct:llist_head 78 list->first = NULL; init_llist_head() 93 * @node: the first entry of deleted list entries 132 * @node: the first entry of deleted list entries. 160 return ACCESS_ONCE(head->first) == NULL; llist_empty() 188 * return the pointer to the first entry. The order of entries 193 return xchg(&head->first, NULL); llist_del_all()
|
H A D | list.h | 217 struct list_head *first; list_rotate_left() local 220 first = head->next; list_rotate_left() 221 list_move_tail(first, head); list_rotate_left() 278 struct list_head *first = list->next; __list_splice() local 281 first->prev = prev; __list_splice() 282 prev->next = first; __list_splice() 291 * @head: the place to add it in the first list. 303 * @head: the place to add it in the first list. 315 * @head: the place to add it in the first list. 331 * @head: the place to add it in the first list. 355 * list_first_entry - get the first element from a list 377 * list_first_entry_or_null - get the first element from a list 595 #define HLIST_HEAD_INIT { .first = NULL } 596 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL } 597 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL) INIT_HLIST_NODE() 611 return !h->first; hlist_empty() 641 struct hlist_node *first = h->first; hlist_add_head() local 642 n->next = first; hlist_add_head() 643 if (first) hlist_add_head() 644 first->pprev = &n->next; hlist_add_head() 645 h->first = n; hlist_add_head() 646 n->pprev = &h->first; hlist_add_head() 683 * reference of the first entry if it exists. 688 new->first = old->first; hlist_move_list() 689 if (new->first) hlist_move_list() 690 new->first->pprev = &new->first; hlist_move_list() 691 old->first = NULL; hlist_move_list() 697 for (pos = (head)->first; pos ; pos = pos->next) 700 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \ 715 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\ 746 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
|
H A D | poison.h | 38 * Placed in the first word before and the first word after an obj.
|
H A D | sysv_fs.h | 29 __fs16 s_isize; /* index of first data zone */ 33 sysv_zone_t s_free[XENIX_NICFREE]; /* first free block list chunk */ 67 __fs16 s_isize; /* index of first data zone */ 73 sysv_zone_t s_free[SYSV_NICFREE]; /* first free block list chunk */ 99 __fs16 s_isize; /* index of first data zone */ 103 sysv_zone_t s_free[SYSV_NICFREE]; /* first free block list chunk */ 129 __fs16 s_isize; /* index of first data zone */ 133 sysv_zone_t s_free[V7_NICFREE]; /* first free block list chunk */ 167 __fs16 s_isize; /* index of first data zone */ 171 sysv_zone_t s_free[COH_NICFREE] __packed2__; /* first free block list chunk */
|
H A D | crc32.h | 20 * @crc1: crc32 of the first block 47 * @crc1: crc32c of the first block 71 * Ethernet sends the least significant bit of a byte first, thus crc32_le
|
H A D | atmel_pdc.h | 36 #define ATMEL_PDC_SCND_BUF_OFF 0x10 /* Offset between first and second buffer registers */
|
H A D | blk-iopoll.h | 23 * that we were the first to acquire this iop for scheduling. If this iop
|
H A D | davinci_emac.h | 31 * - NULL : use the first phy on the bus,
|
/linux-4.4.14/tools/power/cpupower/lib/ |
H A D | sysfs.c | 273 struct cpufreq_available_governors *first = NULL; sysfs_get_freq_available_governors() local 295 first = malloc(sizeof(*first)); sysfs_get_freq_available_governors() 296 if (!first) sysfs_get_freq_available_governors() 298 current = first; sysfs_get_freq_available_governors() 300 current->first = first; sysfs_get_freq_available_governors() 313 return first; sysfs_get_freq_available_governors() 316 while (first) { sysfs_get_freq_available_governors() 317 current = first->next; sysfs_get_freq_available_governors() 318 if (first->governor) sysfs_get_freq_available_governors() 319 free(first->governor); sysfs_get_freq_available_governors() 320 free(first); sysfs_get_freq_available_governors() 321 first = current; sysfs_get_freq_available_governors() 329 struct cpufreq_available_frequencies *first = NULL; sysfs_get_available_frequencies() local 354 first = malloc(sizeof(*first)); sysfs_get_available_frequencies() 355 if (!first) sysfs_get_available_frequencies() 357 current = first; sysfs_get_available_frequencies() 359 current->first = first; sysfs_get_available_frequencies() 371 return first; sysfs_get_available_frequencies() 374 while (first) { sysfs_get_available_frequencies() 375 current = first->next; sysfs_get_available_frequencies() 376 free(first); sysfs_get_available_frequencies() 377 first = current; sysfs_get_available_frequencies() 385 struct cpufreq_affected_cpus *first = NULL; sysfs_get_cpu_list() local 409 first = malloc(sizeof(*first)); sysfs_get_cpu_list() 410 if (!first) sysfs_get_cpu_list() 412 current = first; sysfs_get_cpu_list() 414 current->first = first; sysfs_get_cpu_list() 427 return first; sysfs_get_cpu_list() 430 while (first) { sysfs_get_cpu_list() 431 current = first->next; sysfs_get_cpu_list() 432 free(first); sysfs_get_cpu_list() 433 first = current; sysfs_get_cpu_list() 450 struct cpufreq_stats *first = NULL; sysfs_get_freq_stats() local 476 first = malloc(sizeof(*first)); sysfs_get_freq_stats() 477 if (!first) sysfs_get_freq_stats() 479 current = first; sysfs_get_freq_stats() 481 current->first = first; sysfs_get_freq_stats() 496 return first; sysfs_get_freq_stats() 499 while (first) { sysfs_get_freq_stats() 500 current = first->next; sysfs_get_freq_stats() 501 free(first); sysfs_get_freq_stats() 502 first = current; sysfs_get_freq_stats()
|
H A D | cpufreq.c | 85 tmp = any->first; cpufreq_put_available_governors() 109 tmp = any->first; cpufreq_put_available_frequencies() 130 tmp = any->first; cpufreq_put_affected_cpus() 197 tmp = any->first; cpufreq_put_stats()
|
H A D | cpufreq.h | 32 struct cpufreq_available_governors *first; member in struct:cpufreq_available_governors 38 struct cpufreq_available_frequencies *first; member in struct:cpufreq_available_frequencies 45 struct cpufreq_affected_cpus *first; member in struct:cpufreq_affected_cpus 52 struct cpufreq_stats *first; member in struct:cpufreq_stats 136 struct cpufreq_available_governors *first); 150 struct cpufreq_available_frequencies *first); 162 extern void cpufreq_put_affected_cpus(struct cpufreq_affected_cpus *first); 174 extern void cpufreq_put_related_cpus(struct cpufreq_affected_cpus *first);
|
/linux-4.4.14/drivers/mfd/ |
H A D | ab8500-debugfs.c | 113 * @first: the first address of the range 118 u8 first; member in struct:ab8500_reg_range 171 .first = 0x00, 175 .first = 0x42, 179 .first = 0x80, 188 .first = 0x00, 192 .first = 0x0F, 196 .first = 0x30, 200 .first = 0x32, 209 .first = 0x00, 213 .first = 0x03, 217 .first = 0x80, 226 .first = 0x00, 230 .first = 0x17, 234 .first = 0x1B, 238 .first = 0x1F, 242 .first = 0x40, 253 .first = 0x80, 257 .first = 0x87, 266 .first = 0x00, 270 .first = 0x15, 274 .first = 0x19, 278 .first = 0x27, 282 .first = 0x41, 286 .first = 0x45, 290 .first = 0x5D, 294 .first = 0x69, 298 .first = 0x80, 311 .first = 0x80, 324 .first = 0x00, 333 .first = 0x00, 337 .first = 0x05, 341 .first = 0x40, 345 .first = 0x42, 349 .first = 0x44, 353 .first = 0x50, 357 .first = 0x80, 361 .first = 0xC0, 365 .first = 0xf5, 374 .first = 0x00, 378 .first = 0x07, 382 .first = 0x10, 391 .first = 0x00, 400 .first = 0x05, 409 .first = 0x00, 422 .first = 0x00, 431 .first = 0x00, 435 .first = 0x10, 439 .first = 0x20, 443 .first = 0x30, 447 .first = 0x40, 451 .first = 0x50, 455 .first = 0x60, 459 .first = 0x80, 484 .first = 0x01, 500 .first = 0x00, 504 .first = 0x42, 508 .first = 0x52, 512 .first = 0x54, 516 .first = 0x80, 525 .first = 0x00, 529 .first = 0x0F, 533 .first = 0x20, 537 .first = 0x30, 541 .first = 0x32, 550 .first = 0x00, 554 .first = 0x03, 558 .first = 0x80, 567 .first = 0x00, 571 .first = 0x08, 575 .first = 0x17, 579 .first = 0x1B, 583 .first = 0x1F, 587 .first = 0x40, 598 .first = 0x80, 602 .first = 0x87, 606 .first = 0x91, 623 .first = 0x80, 636 .first = 0x00, 645 .first = 0x02, 649 .first = 0x05, 653 .first = 0x40, 657 .first = 0x50, 661 .first = 0x60, 665 .first = 0xA0, 669 .first = 0xAF, 673 .first = 0xC0, 677 .first = 0xF5, 686 .first = 0x00, 690 .first = 0x07, 694 .first = 0x10, 703 .first = 0x00, 712 .first = 0x00, 716 .first = 0x06, 720 .first = 0x09, 724 .first = 0x0B, 728 .first = 0x12, 732 .first = 0x18, 737 .first = 0x40, 741 .first = 0x46, 745 .first = 0x4B, 749 .first = 0x52, 753 .first = 0x58, 763 .first = 0x00, 767 .first = 0x16, 776 .first = 0x00, 780 .first = 0x10, 784 .first = 0x20, 788 .first = 0x30, 792 .first = 0x40, 796 .first = 0x50, 800 .first = 0x60, 804 .first = 0x80, 813 .first = 0x00, 817 .first = 0x05, 826 .first = 0x05, 843 .first = 0x01, 855 .first = 0x00, 864 .first = 0x00, 868 .first = 0x42, 872 .first = 0x50, 876 .first = 0x57, 880 .first = 0x80, 884 .first = 0x90, 893 .first = 0x00, 897 .first = 0x0F, 901 .first = 0x20, 905 .first = 0x32, 909 .first = 0x40, 918 .first = 0x03, 922 .first = 0x20, 926 .first = 0x80, 930 .first = 0x87, 939 .first = 0x00, 943 .first = 0x08, 947 .first = 0x17, 951 .first = 0x1B, 955 .first = 0x1F, 959 .first = 0x31, 963 .first = 0x43, 967 .first = 0x48, 976 .first = 0x80, 980 .first = 0x87, 984 .first = 0x91, 997 .first = 0x00, 1001 .first = 0x10, 1005 .first = 0x20, 1009 .first = 0x30, 1018 .first = 0x00, 1022 .first = 0x80, 1035 .first = 0x00, 1039 .first = 0x04, 1043 .first = 0x09, 1047 .first = 0x10, 1056 .first = 0x00, 1060 .first = 0x02, 1064 .first = 0x40, 1068 .first = 0x50, 1072 .first = 0x60, 1076 .first = 0x70, 1080 .first = 0xA0, 1084 .first = 0xAF, 1088 .first = 0xC0, 1092 .first = 0xF5, 1101 .first = 0x00, 1105 .first = 0x07, 1109 .first = 0x10, 1118 .first = 0x00, 1127 .first = 0x00, 1131 .first = 0x0B, 1135 .first = 0x12, 1140 .first = 0x40, 1144 .first = 0x4B, 1148 .first = 0x52, 1158 .first = 0x00, 1162 .first = 0x0B, 1166 .first = 0x20, 1175 .first = 0x00, 1179 .first = 0x10, 1183 .first = 0x20, 1187 .first = 0x30, 1191 .first = 0x40, 1195 .first = 0x50, 1199 .first = 0x60, 1203 .first = 0x70, 1207 .first = 0x80, 1216 .first = 0x00, 1220 .first = 0x06, 1224 .first = 0x10, 1233 .first = 0x01, 1237 .first = 0x0E, 1241 .first = 0x80, 1258 .first = 0x00, 1293 for (reg = debug_ranges[bank].range[i].first; ab8500_registers_print() 1401 for (reg = debug_ranges[bank].range[i].first; ab8500_dump_all_banks_to_mem()
|
/linux-4.4.14/arch/mips/jazz/ |
H A D | jazzdma.c | 44 * the first 16 Mbytes of main memory and declare all 90 * Allocate DMA pagetables using a simple first-fit algorithm 94 int first, last, pages, frame, i; vdma_alloc() local 116 first = 0; vdma_alloc() 118 while (pgtbl[first].owner != VDMA_PAGE_EMPTY && vdma_alloc() 119 first < VDMA_PGTBL_ENTRIES) first++; vdma_alloc() 120 if (first + pages > VDMA_PGTBL_ENTRIES) { /* nothing free */ vdma_alloc() 125 last = first + 1; vdma_alloc() 127 && last - first < pages) vdma_alloc() 130 if (last - first == pages) vdma_alloc() 132 first = last + 1; vdma_alloc() 138 laddr = (first << 12) + (paddr & (VDMA_PAGESIZE - 1)); vdma_alloc() 141 for (i = first; i < last; i++) { vdma_alloc() 158 for (i = first; i < last; i++) vdma_alloc() 161 for (i = first; i < last; i++) vdma_alloc() 164 for (i = first; i < last; i++) vdma_alloc() 214 int first, pages; vdma_remap() local 232 first = laddr >> 12; vdma_remap() 234 printk("vdma_remap: first=%x, pages=%x\n", first, pages); vdma_remap() 235 if (first + pages > VDMA_PGTBL_ENTRIES) { vdma_remap() 242 while (pages > 0 && first < VDMA_PGTBL_ENTRIES) { vdma_remap() 243 if (pgtbl[first].owner != laddr) { vdma_remap() 248 pgtbl[first].frame = paddr; vdma_remap() 250 first++; vdma_remap() 262 first = laddr >> 12; vdma_remap() 264 for (i = first; i < first + pages; i++) vdma_remap() 267 for (i = first; i < first + pages; i++) vdma_remap() 270 for (i = first; i < first + pages; i++) vdma_remap() 280 * This will return the logical address of the first 365 * Check error conditions first vdma_enable()
|
/linux-4.4.14/drivers/isdn/capi/ |
H A D | Makefile | 3 # Ordering constraints: kernelcapi.o first
|
/linux-4.4.14/tools/include/asm-generic/bitops/ |
H A D | __ffs.h | 7 * __ffs - find first bit in word. 10 * Undefined if no bit exists, so code should check against 0 first.
|
H A D | find.h | 21 * find_first_bit - find the first set bit in a memory region 25 * Returns the bit number of the first set bit.
|
/linux-4.4.14/drivers/video/fbdev/core/ |
H A D | cfbfillrect.c | 38 unsigned long first, last; bitfill_aligned() local 43 first = fb_shifted_pixels_mask_long(p, dst_idx, bswapmask); bitfill_aligned() 49 first &= last; bitfill_aligned() 50 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); bitfill_aligned() 55 if (first!= ~0UL) { bitfill_aligned() 56 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); bitfill_aligned() 95 unsigned long first, last; bitfill_unaligned() local 100 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitfill_unaligned() 106 first &= last; bitfill_unaligned() 107 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); bitfill_unaligned() 111 if (first) { bitfill_unaligned() 112 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); bitfill_unaligned() 151 unsigned long first, last; bitfill_aligned_rev() local 156 first = fb_shifted_pixels_mask_long(p, dst_idx, bswapmask); bitfill_aligned_rev() 162 first &= last; bitfill_aligned_rev() 164 FB_WRITEL(comp(dat ^ val, dat, first), dst); bitfill_aligned_rev() 168 if (first!=0UL) { bitfill_aligned_rev() 170 FB_WRITEL(comp(dat ^ val, dat, first), dst); bitfill_aligned_rev() 221 unsigned long first, last, dat; bitfill_unaligned_rev() local 226 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitfill_unaligned_rev() 232 first &= last; bitfill_unaligned_rev() 234 FB_WRITEL(comp(dat ^ pat, dat, first), dst); bitfill_unaligned_rev() 239 if (first != 0UL) { bitfill_unaligned_rev() 241 FB_WRITEL(comp(dat ^ pat, dat, first), dst); bitfill_unaligned_rev()
|
H A D | sysfillrect.c | 28 unsigned long first, last; bitfill_aligned() local 33 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitfill_aligned() 39 first &= last; bitfill_aligned() 40 *dst = comp(pat, *dst, first); bitfill_aligned() 45 if (first!= ~0UL) { bitfill_aligned() 46 *dst = comp(pat, *dst, first); bitfill_aligned() 84 unsigned long first, last; bitfill_unaligned() local 89 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitfill_unaligned() 95 first &= last; bitfill_unaligned() 96 *dst = comp(pat, *dst, first); bitfill_unaligned() 100 if (first) { bitfill_unaligned() 101 *dst = comp(pat, *dst, first); bitfill_unaligned() 139 unsigned long first, last; bitfill_aligned_rev() local 144 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitfill_aligned_rev() 150 first &= last; bitfill_aligned_rev() 151 *dst = comp(*dst ^ val, *dst, first); bitfill_aligned_rev() 155 if (first!=0UL) { bitfill_aligned_rev() 156 *dst = comp(*dst ^ val, *dst, first); bitfill_aligned_rev() 195 unsigned long first, last; bitfill_unaligned_rev() local 200 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitfill_unaligned_rev() 206 first &= last; bitfill_unaligned_rev() 207 *dst = comp(*dst ^ pat, *dst, first); bitfill_unaligned_rev() 212 if (first != 0UL) { bitfill_unaligned_rev() 213 *dst = comp(*dst ^ pat, *dst, first); bitfill_unaligned_rev()
|
H A D | syscopyarea.c | 31 unsigned long first, last; bitcpy() local 35 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); bitcpy() 43 first &= last; bitcpy() 44 *dst = comp(*src, *dst, first); bitcpy() 48 if (first != ~0UL) { bitcpy() 49 *dst = comp(*src, *dst, first); bitcpy() 86 first &= last; bitcpy() 89 *dst = comp(*src << left, *dst, first); bitcpy() 92 *dst = comp(*src >> right, *dst, first); bitcpy() 98 first); bitcpy() 112 *dst = comp(d0 << left, *dst, first); bitcpy() 119 first); bitcpy() 174 unsigned long first, last; bitcpy_rev() local 184 first = ~FB_SHIFT_HIGH(p, ~0UL, (dst_idx + 1) % bits); bitcpy_rev() 191 if (first) bitcpy_rev() 192 last &= first; bitcpy_rev() 198 if (first) { bitcpy_rev() 199 *dst = comp(*src, *dst, first); bitcpy_rev() 232 if (first) bitcpy_rev() 233 last &= first; bitcpy_rev() 267 if (!first) bitcpy_rev() 270 *dst = comp(d0, *dst, first); bitcpy_rev() 336 the index of the first bit */ sys_copyarea()
|
H A D | cfbcopyarea.c | 50 unsigned long first, last; bitcpy() local 63 first = fb_shifted_pixels_mask_long(p, dst_idx, bswapmask); bitcpy() 72 first &= last; bitcpy() 73 FB_WRITEL( comp( FB_READL(src), FB_READL(dst), first), dst); bitcpy() local 78 if (first != ~0UL) { bitcpy() 79 FB_WRITEL( comp( FB_READL(src), FB_READL(dst), first), dst); bitcpy() local 116 first &= last; bitcpy() 132 FB_WRITEL(comp(d0, FB_READL(dst), first), dst); bitcpy() 157 FB_WRITEL(comp(d0, FB_READL(dst), first), dst); bitcpy() 216 unsigned long first, last; bitcpy_rev() local 236 first = ~fb_shifted_pixels_mask_long(p, (dst_idx + 1) % bits, bswapmask); bitcpy_rev() 244 if (first) bitcpy_rev() 245 last &= first; bitcpy_rev() 251 if (first) { bitcpy_rev() 252 FB_WRITEL( comp( FB_READL(src), FB_READL(dst), first), dst); bitcpy_rev() local 288 if (first) bitcpy_rev() 289 last &= first; bitcpy_rev() 327 if (!first) bitcpy_rev() 330 FB_WRITEL(comp(d0, FB_READL(dst), first), dst); bitcpy_rev() 403 // index of the first bit cfb_copyarea()
|
/linux-4.4.14/arch/alpha/lib/ |
H A D | csum_partial_copy.c | 148 unsigned long first; csum_partial_cfu_dest_aligned() local 153 err |= __get_user_u(first,src); csum_partial_cfu_dest_aligned() 159 extql(first, soff, word); csum_partial_cfu_dest_aligned() 162 extqh(second, soff, first); csum_partial_cfu_dest_aligned() 164 word |= first; csum_partial_cfu_dest_aligned() 165 first = second; csum_partial_cfu_dest_aligned() 178 extql(first, soff, word); csum_partial_cfu_dest_aligned() 179 extqh(second, soff, first); csum_partial_cfu_dest_aligned() 180 word |= first; csum_partial_cfu_dest_aligned() 262 unsigned long first; csum_partial_cfu_unaligned() local 266 err |= __get_user_u(first, src); csum_partial_cfu_unaligned() 274 extql(first, soff, word); csum_partial_cfu_unaligned() 277 extqh(second, soff, first); csum_partial_cfu_unaligned() 279 word |= first; csum_partial_cfu_unaligned() 280 first = second; csum_partial_cfu_unaligned() 295 extql(first, soff, word); csum_partial_cfu_unaligned() 296 extqh(second, soff, first); csum_partial_cfu_unaligned() 297 word |= first; csum_partial_cfu_unaligned() 298 first = second; csum_partial_cfu_unaligned() 316 extql(first, soff, word); csum_partial_cfu_unaligned() 317 extqh(second, soff, first); csum_partial_cfu_unaligned() 318 word |= first; csum_partial_cfu_unaligned()
|
H A D | ev6-stxncpy.S | 61 t0 == the first destination word for masking back in 62 t1 == the first source word. */ 70 mskql t0, a1, t0 # U : assemble the first output word 165 /* We are co-aligned; take care of a partial first word. */ 166 ldq_u t1, 0(a1) # L : load first src word 187 /* We know just enough now to be able to assemble the first 192 t0 == the first dest word, unmasked 193 t1 == the shifted low bits of the first source word 201 or t1, t4, t1 # E : first aligned src word complete (stall) 203 or t0, t1, t0 # E : first output word complete (stall) 213 stq_u t0, 0(a0) # L : store first output word 274 or t0, t1, t0 # E : first (partial) source word complete 276 cmpbge zero, t0, t8 # E : is the null in this first bit? (stall) 338 ldq_u t1, 0(a1) # L : load first source word 341 /* Conditionally load the first destination word and a bytemask 374 /* At this point we've found a zero in the first partial word of
|
H A D | strcat.S | 21 ldq_u $1, 0($16) # load first quadword (a0 may be misaligned)
|
H A D | stxncpy.S | 50 t0 == the first destination word for masking back in 51 t1 == the first source word. */ 58 mskql t0, a1, t0 # e0 : assemble the first output word 132 /* We are co-aligned; take care of a partial first word. */ 134 ldq_u t1, 0(a1) # e0 : load first src word 148 /* We know just enough now to be able to assemble the first 153 t0 == the first dest word, unmasked 154 t1 == the shifted low bits of the first source word 161 or t1, t4, t1 # e1 : first aligned src word complete 163 or t0, t1, t0 # e0 : first output word complete 172 stq_u t0, 0(a0) # e0 : store first output word 230 or t0, t1, t0 # e0 : first (partial) source word complete 232 cmpbge zero, t0, t8 # e0 : is the null in this first bit? 292 ldq_u t1, 0(a1) # e0 : load first source word 297 /* Conditionally load the first destination word and a bytemask 325 /* At this point we've found a zero in the first partial word of
|
H A D | ev6-stxcpy.S | 53 t0 == the first destination word for masking back in 54 t1 == the first source word. */ 62 mskql t0, a1, t0 # U : assemble the first output word 68 t0 == the first destination word for masking back in 127 /* We are co-aligned; take care of a partial first word. */ 128 ldq_u t1, 0(a1) # L : load first src word 145 /* We know just enough now to be able to assemble the first 150 t0 == the first dest word, for masking back in, if needed else 0 151 t1 == the low bits of the first source word 177 stq_u t1, 0(a0) # L : store first output word 227 or t0, t1, t1 # E : first (partial) source word complete (stall) 228 cmpbge zero, t1, t8 # E : is the null in this first bit? (stall) 266 ldq_u t1, 0(a1) # L : load first source word 269 /* Conditionally load the first destination word and a bytemask 295 /* At this point we've found a zero in the first partial word of
|
H A D | stxcpy.S | 42 t0 == the first destination word for masking back in 43 t1 == the first source word. */ 50 mskql t0, a1, t0 # e0 : assemble the first output word 56 t0 == the first destination word for masking back in 107 /* We are co-aligned; take care of a partial first word. */ 108 ldq_u t1, 0(a1) # e0 : load first src word 122 /* We know just enough now to be able to assemble the first 127 t0 == the first dest word, for masking back in, if needed else 0 128 t1 == the low bits of the first source word 154 stq_u t1, 0(a0) # e0 : store first output word 199 or t0, t1, t1 # e1 : first (partial) source word complete 201 cmpbge zero, t1, t8 # e0 : is the null in this first bit? 235 ldq_u t1, 0(a1) # e0 : load first source word 240 /* Conditionally load the first destination word and a bytemask 265 /* At this point we've found a zero in the first partial word of
|
H A D | strncat.S | 27 ldq_u $1, 0($16) # load first quadword ($16 may be misaligned) 76 1: /* Here we must read the next DST word and clear the first byte. */
|
H A D | ev67-strlen.S | 28 ldq_u $1, 0($16) # L : load first quadword ($16 may be misaligned)
|
H A D | strlen.S | 24 ldq_u $1, 0($16) # load first quadword ($16 may be misaligned)
|
/linux-4.4.14/arch/arm64/crypto/ |
H A D | aes-glue.c | 58 int rounds, int blocks, int first); 60 int rounds, int blocks, int first); 63 int rounds, int blocks, u8 iv[], int first); 65 int rounds, int blocks, u8 iv[], int first); 68 int rounds, int blocks, u8 ctr[], int first); 72 int first); 75 int first); 103 int err, first, rounds = 6 + ctx->key_length / 4; ecb_encrypt() local 112 for (first = 1; (blocks = (walk.nbytes / AES_BLOCK_SIZE)); first = 0) { ecb_encrypt() 114 (u8 *)ctx->key_enc, rounds, blocks, first); ecb_encrypt() 125 int err, first, rounds = 6 + ctx->key_length / 4; ecb_decrypt() local 134 for (first = 1; (blocks = (walk.nbytes / AES_BLOCK_SIZE)); first = 0) { ecb_decrypt() 136 (u8 *)ctx->key_dec, rounds, blocks, first); ecb_decrypt() 147 int err, first, rounds = 6 + ctx->key_length / 4; cbc_encrypt() local 156 for (first = 1; (blocks = (walk.nbytes / AES_BLOCK_SIZE)); first = 0) { cbc_encrypt() 159 first); cbc_encrypt() 170 int err, first, rounds = 6 + ctx->key_length / 4; cbc_decrypt() local 179 for (first = 1; (blocks = (walk.nbytes / AES_BLOCK_SIZE)); first = 0) { cbc_decrypt() 182 first); cbc_decrypt() 193 int err, first, rounds = 6 + ctx->key_length / 4; ctr_encrypt() local 201 first = 1; ctr_encrypt() 206 first); ctr_encrypt() 207 first = 0; ctr_encrypt() 226 blocks, walk.iv, first); ctr_encrypt() 239 int err, first, rounds = 6 + ctx->key1.key_length / 4; xts_encrypt() local 248 for (first = 1; (blocks = (walk.nbytes / AES_BLOCK_SIZE)); first = 0) { xts_encrypt() 251 (u8 *)ctx->key2.key_enc, walk.iv, first); xts_encrypt() 263 int err, first, rounds = 6 + ctx->key1.key_length / 4; xts_decrypt() local 272 for (first = 1; (blocks = (walk.nbytes / AES_BLOCK_SIZE)); first = 0) { xts_decrypt() 275 (u8 *)ctx->key2.key_enc, walk.iv, first); xts_decrypt()
|
/linux-4.4.14/arch/alpha/mm/ |
H A D | extable.c | 73 search_extable(const struct exception_table_entry *first, search_extable() argument 77 while (first <= last) { search_extable() 81 mid = (last - first) / 2 + first; search_extable() 86 first = mid+1; search_extable()
|
/linux-4.4.14/arch/cris/include/arch-v10/arch/ |
H A D | bitops.h | 10 * number. They differ in that the first function also inverts all bits 41 * so code should check against ~0UL first.. 49 * __ffs - find first bit in word. 52 * Undefined if no bit exists, so code should check against 0 first. 60 * ffs - find first bit set
|
/linux-4.4.14/arch/s390/mm/ |
H A D | extable.c | 13 search_extable(const struct exception_table_entry *first, search_extable() argument 20 while (first <= last) { search_extable() 21 mid = ((last - first) >> 1) + first; search_extable() 24 first = mid + 1; search_extable()
|
/linux-4.4.14/arch/sh/mm/ |
H A D | extable_64.c | 45 search_extable(const struct exception_table_entry *first, search_extable() argument 55 while (first <= last) { search_extable() 58 mid = (last - first) / 2 + first; search_extable() 63 first = mid+1; search_extable()
|
H A D | tlb-sh5.c | 26 cpu_data->dtlb.first = DTLB_FIXED | cpu_data->dtlb.step; sh64_tlb_init() 27 cpu_data->dtlb.next = cpu_data->dtlb.first; sh64_tlb_init() 37 cpu_data->itlb.first = ITLB_FIXED | cpu_data->itlb.step; sh64_tlb_init() 38 cpu_data->itlb.next = cpu_data->itlb.first; sh64_tlb_init() 61 cpu_data->dtlb.first += cpu_data->dtlb.step; sh64_get_wired_dtlb_entry() 72 * Works like a stack, last one to allocate must be first one to free. 81 * has to be the first one to be freed. sh64_put_wired_dtlb_entry() 97 * entry beneath the first 'free' entry! sh64_put_wired_dtlb_entry() 99 if (entry < (cpu_data->dtlb.first - cpu_data->dtlb.step)) sh64_put_wired_dtlb_entry() 103 cpu_data->dtlb.first -= cpu_data->dtlb.step; sh64_put_wired_dtlb_entry() 194 /* Get PTEL first */ __update_tlb() 222 next = tlbp->first; __update_tlb()
|
/linux-4.4.14/arch/x86/purgatory/ |
H A D | purgatory.c | 30 * On x86, second kernel requries first 640K of memory to boot. Copy 31 * first 640K to a backup region in reserved memory range so that second 32 * kernel can use first 640K.
|
/linux-4.4.14/arch/cris/include/arch-v32/arch/ |
H A D | bitops.h | 7 * word-in-dword-swapped number. They differ in that the first function also 37 * check against ~0 first. 47 * should check against 0 first.
|
/linux-4.4.14/arch/arm/kernel/ |
H A D | insn.c | 9 unsigned long first, second; __arm_gen_branch_thumb2() local 27 first = 0xf000 | (s << 10) | imm10; __arm_gen_branch_thumb2() 32 return __opcode_thumb32_compose(first, second); __arm_gen_branch_thumb2()
|
/linux-4.4.14/drivers/staging/sm750fb/ |
H A D | ddk750_help.c | 7 /* after driver mapped io registers, use this function first */ ddk750_set_mmio()
|
/linux-4.4.14/arch/tile/gxio/ |
H A D | iorpc_trio.c | 20 unsigned int first; member in struct:alloc_asids_param 25 unsigned int first, unsigned int flags) gxio_trio_alloc_asids() 31 params->first = first; gxio_trio_alloc_asids() 43 unsigned int first; member in struct:alloc_memory_maps_param 48 unsigned int count, unsigned int first, gxio_trio_alloc_memory_maps() 55 params->first = first; gxio_trio_alloc_memory_maps() 66 unsigned int first; member in struct:alloc_scatter_queues_param 71 unsigned int count, unsigned int first, gxio_trio_alloc_scatter_queues() 78 params->first = first; gxio_trio_alloc_scatter_queues() 90 unsigned int first; member in struct:alloc_pio_regions_param 95 unsigned int count, unsigned int first, gxio_trio_alloc_pio_regions() 102 params->first = first; gxio_trio_alloc_pio_regions() 24 gxio_trio_alloc_asids(gxio_trio_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_trio_alloc_asids() argument 47 gxio_trio_alloc_memory_maps(gxio_trio_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_trio_alloc_memory_maps() argument 70 gxio_trio_alloc_scatter_queues(gxio_trio_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_trio_alloc_scatter_queues() argument 94 gxio_trio_alloc_pio_regions(gxio_trio_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_trio_alloc_pio_regions() argument
|
H A D | iorpc_mpipe.c | 20 unsigned int first; member in struct:alloc_buffer_stacks_param 25 unsigned int count, unsigned int first, gxio_mpipe_alloc_buffer_stacks() 32 params->first = first; gxio_mpipe_alloc_buffer_stacks() 79 unsigned int first; member in struct:alloc_notif_rings_param 84 unsigned int count, unsigned int first, gxio_mpipe_alloc_notif_rings() 91 params->first = first; gxio_mpipe_alloc_notif_rings() 178 unsigned int first; member in struct:alloc_notif_groups_param 183 unsigned int count, unsigned int first, gxio_mpipe_alloc_notif_groups() 190 params->first = first; gxio_mpipe_alloc_notif_groups() 222 unsigned int first; member in struct:alloc_buckets_param 227 unsigned int first, unsigned int flags) gxio_mpipe_alloc_buckets() 233 params->first = first; gxio_mpipe_alloc_buckets() 264 unsigned int first; member in struct:alloc_edma_rings_param 269 unsigned int count, unsigned int first, gxio_mpipe_alloc_edma_rings() 276 params->first = first; gxio_mpipe_alloc_edma_rings() 24 gxio_mpipe_alloc_buffer_stacks(gxio_mpipe_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_mpipe_alloc_buffer_stacks() argument 83 gxio_mpipe_alloc_notif_rings(gxio_mpipe_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_mpipe_alloc_notif_rings() argument 182 gxio_mpipe_alloc_notif_groups(gxio_mpipe_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_mpipe_alloc_notif_groups() argument 226 gxio_mpipe_alloc_buckets(gxio_mpipe_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_mpipe_alloc_buckets() argument 268 gxio_mpipe_alloc_edma_rings(gxio_mpipe_context_t *context, unsigned int count, unsigned int first, unsigned int flags) gxio_mpipe_alloc_edma_rings() argument
|
/linux-4.4.14/include/uapi/linux/ |
H A D | atmppp.h | 16 * the first element of the structure is the backend number and the rest
|
H A D | efs_fs_sb.h | 27 __be32 fs_firstcg; /* bb offset to first cg */ 51 __u32 fs_start; /* first block of filesystem */ 52 __u32 first_block; /* first data block in filesystem */
|
H A D | ivtv.h | 34 first (althrough if you don't then the first time 42 for the user DMA YUV mode you first need to do call IVTV_IOC_DMA_FRAME
|
H A D | atm_tcp.h | 35 struct atmtcp_hdr hdr; /* must be first */
|
H A D | atm_zatm.h | 40 #define ZATM_AAL5_POOL_BASE 2 /* first AAL5 free buffer pool */
|
/linux-4.4.14/arch/powerpc/mm/ |
H A D | vphn.h | 10 * form the complete property we have to add the length in the first cell.
|
/linux-4.4.14/sound/usb/usx2y/ |
H A D | us122l.h | 12 struct file *first; member in struct:us122l
|
/linux-4.4.14/include/linux/i2c/ |
H A D | max732x.h | 7 /* number of the first GPIO */
|
/linux-4.4.14/tools/testing/selftests/powerpc/vphn/ |
H A D | vphn.h | 10 * form the complete property we have to add the length in the first cell.
|
/linux-4.4.14/drivers/video/fbdev/ |
H A D | c2p_iplan2.c | 92 u32 dst_idx, first, last, w; c2p_iplan2() local 98 first = 0xffffU >> dst_idx; c2p_iplan2() 99 first |= first << 16; c2p_iplan2() 108 first &= last; c2p_iplan2() 113 store_iplan2_masked(p, bpp, d.words, first); c2p_iplan2() 125 store_iplan2_masked(p, bpp, d.words, first); c2p_iplan2()
|
H A D | c2p_planar.c | 94 u32 dst_idx, first, last, w; c2p_planar() local 100 first = 0xffffffffU >> dst_idx; c2p_planar() 108 first &= last; c2p_planar() 114 first); c2p_planar() 127 d.words, first); c2p_planar()
|
/linux-4.4.14/arch/c6x/include/asm/ |
H A D | bitops.h | 25 * __ffs - find first bit in word. 28 * Undefined if no bit exists, so code should check against 0 first. 43 * ffz - find first zero in word. 46 * Undefined if no zero exists, so code should check against ~0UL first. 68 * ffs - find first bit set
|
/linux-4.4.14/arch/ia64/mm/ |
H A D | extable.c | 83 search_extable (const struct exception_table_entry *first, search_extable() argument 91 while (first <= last) { search_extable() 92 mid = &first[(last - first)/2]; search_extable() 98 first = mid + 1; search_extable()
|
/linux-4.4.14/drivers/scsi/sym53c8xx_2/ |
H A D | sym_misc.h | 90 struct sym_quehead *first = list->flink; sym_que_splice() local 92 if (first != list) { sym_que_splice() 96 first->blink = head; sym_que_splice() 97 head->flink = first; sym_que_splice() 107 struct sym_quehead *first, *last; sym_que_move() local 109 first = orig->flink; sym_que_move() 110 if (first != orig) { sym_que_move() 111 first->blink = dest; sym_que_move() 112 dest->flink = first; sym_que_move()
|
/linux-4.4.14/drivers/macintosh/ |
H A D | windfarm_pid.c | 30 st->first = 1; wf_pid_init() 44 if (st->first) { wf_pid_run() 49 st->first = 0; wf_pid_run() 85 st->first = 1; wf_cpu_pid_init() 99 if (st->first) { wf_cpu_pid_run() 105 st->first = 0; wf_cpu_pid_run()
|
H A D | windfarm_pid.h | 36 int first; /* first run of the loop */ member in struct:wf_pid_state 71 int first; /* first run of the loop */ member in struct:wf_cpu_pid_state
|
/linux-4.4.14/drivers/net/wireless/brcm80211/brcmsmac/ |
H A D | phy_shim.h | 80 /* Index for first 20MHz OFDM SISO rate */ 82 /* Index for first 20MHz OFDM CDD rate */ 84 /* Index for first 40MHz OFDM SISO rate */ 86 /* Index for first 40MHz OFDM CDD rate */ 89 /* Index for first 20MHz MCS SISO rate */ 91 /* Index for first 20MHz MCS CDD rate */ 93 /* Index for first 20MHz MCS STBC rate */ 95 /* Index for first 20MHz MCS SDM rate */ 97 /* Index for first 40MHz MCS SISO rate */ 99 /* Index for first 40MHz MCS CDD rate */ 101 /* Index for first 40MHz MCS STBC rate */ 103 /* Index for first 40MHz MCS SDM rate */ 112 /* Index for first 20MHz MCS SISO rate */
|
/linux-4.4.14/kernel/trace/ |
H A D | trace_benchmark.c | 27 * tracepoint write. As there is nothing to write the first time 28 * it simply writes "START". As the first write is cold cache and 30 * reported as "first", which is shown in the second write to the 31 * tracepoint. The "first" field is writen within the statics from 60 * The first read is cold cached, keep it separate from the trace_do_benchmark() 66 "first=%llu [COLD CACHED]", bm_first); trace_do_benchmark() 84 "last=%llu first=%llu max=%llu min=%llu ** avg=%u std=%d std^2=%lld", trace_do_benchmark() 136 "last=%llu first=%llu max=%llu min=%llu avg=%u std=%d std^2=%lld", trace_do_benchmark()
|
/linux-4.4.14/arch/mips/lib/ |
H A D | r3k_dump_tlb.c | 28 static void dump_tlb(int first, int last) dump_tlb() argument 36 for (i = first; i <= last; i++) { dump_tlb()
|
/linux-4.4.14/fs/reiserfs/ |
H A D | lbalance.c | 36 * length of all record to be copied and first byte of leaf_copy_dir_entries() 52 /* when copy last to first, dest buffer can contain 0 items */ leaf_copy_dir_entries() 59 * if there are no items in dest or the first/last item in leaf_copy_dir_entries() 128 * Copy the first (if last_first == FIRST_TO_LAST) or last 147 * if ( DEST is empty or first item of SOURCE and last item of leaf_copy_boundary_item() 174 * copy part of the body of the first item of SOURCE leaf_copy_boundary_item() 196 * merge first item (or its part) of src buffer with the last leaf_copy_boundary_item() 217 * (DEST is empty or last item of SOURCE and first item of DEST leaf_copy_boundary_item() 244 * begin of the body of the first item of the DEST; part defined leaf_copy_boundary_item() 246 * change first item key of the DEST; don't create new item header leaf_copy_boundary_item() 261 /* change first item key of the DEST */ leaf_copy_boundary_item() 274 /* change first item key of the DEST */ leaf_copy_boundary_item() 306 * from first-th item in src to tail of dest 308 * from first-th item in src to head of dest 312 int first, int cpy_num) leaf_copy_items_entirely() 324 RFALSE(B_NR_ITEMS(src) - first < cpy_num, leaf_copy_items_entirely() 326 B_NR_ITEMS(src), cpy_num, first); leaf_copy_items_entirely() 347 /* location of head of first new item */ leaf_copy_items_entirely() 358 memcpy(ih, item_head(src, first), cpy_num * IH_SIZE); leaf_copy_items_entirely() 385 item_body(src, (first + cpy_num - 1)), leaf_copy_items_entirely() 548 * copy the first item or it part or nothing to the end of leaf_copy_items() 558 * copy first cpy_num items starting from position leaf_copy_items() 565 * copy first cpy_num-1 items starting from position leaf_copy_items() 815 int first, int del_num); 817 * If del_bytes == -1, starting from position 'first' delete del_num 820 * If last_first == 0. Starting from position 'first' delete del_num-1 821 * items in whole. Delete part of body of the first item. Part defined by 822 * del_bytes. Don't delete first item header 823 * If last_first == 1. Starting from position 'first+1' delete del_num-1 828 int first, int del_num, int del_bytes) leaf_delete_items() 836 RFALSE(first < 0 leaf_delete_items() 837 || first + del_num > item_amount, leaf_delete_items() 838 "10165: invalid number of first item to be deleted (%d) or " leaf_delete_items() 839 "no so much items (%d) to delete (only %d)", first, leaf_delete_items() 840 first + del_num, item_amount); leaf_delete_items() 845 if (first == 0 && del_num == item_amount && del_bytes == -1) { leaf_delete_items() 852 /* delete del_num items beginning from item in position first */ leaf_delete_items() 853 leaf_delete_items_entirely(cur_bi, first, del_num); leaf_delete_items() 858 * item in position first leaf_delete_items() 860 leaf_delete_items_entirely(cur_bi, first, del_num - 1); leaf_delete_items() 863 * delete the part of the first item of the bh leaf_delete_items() 873 * item in position first+1 leaf_delete_items() 875 leaf_delete_items_entirely(cur_bi, first + 1, leaf_delete_items() 1094 /* first byte of item */ leaf_cut_entries() 1101 * first byte of remaining entries, those are BEFORE cut entries leaf_cut_entries() 1138 * pos_in_item - first byte that must be cut 1142 * pos_in_item - number of first deleted entry 1162 /* first cut entry () */ leaf_cut_from_buffer() 1167 "when 0-th enrty of item is cut, that item must be first in the node, not %d-th", leaf_cut_from_buffer() 1169 /* change item key by key of first entry in the item */ leaf_cut_from_buffer() 1239 /* delete del_num items from buffer starting from the first'th item */ leaf_delete_items_entirely() 1241 int first, int del_num) leaf_delete_items_entirely() 1259 RFALSE(first < 0 || first + del_num > nr, leaf_delete_items_entirely() 1260 "10220: first=%d, number=%d, there is %d items", first, del_num, leaf_delete_items_entirely() 1263 if (first == 0 && del_num == nr) { leaf_delete_items_entirely() 1271 ih = item_head(bh, first); leaf_delete_items_entirely() 1274 j = (first == 0) ? bh->b_size : ih_location(ih - 1); leaf_delete_items_entirely() 1277 last_loc = ih_location(&ih[nr - 1 - first]); leaf_delete_items_entirely() 1284 memmove(ih, ih + del_num, (nr - first - del_num) * IH_SIZE); leaf_delete_items_entirely() 1287 for (i = first; i < nr - del_num; i++) leaf_delete_items_entirely() 1288 put_ih_location(&ih[i - first], leaf_delete_items_entirely() 1289 ih_location(&ih[i - first]) + (j - leaf_delete_items_entirely() 1342 /* first byte of dest item */ leaf_paste_entries() 310 leaf_copy_items_entirely(struct buffer_info *dest_bi, struct buffer_head *src, int last_first, int first, int cpy_num) leaf_copy_items_entirely() argument 827 leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first, int del_num, int del_bytes) leaf_delete_items() argument 1240 leaf_delete_items_entirely(struct buffer_info *bi, int first, int del_num) leaf_delete_items_entirely() argument
|
H A D | bitmap.c | 175 /* search for a first zero bit -- beginning of a window */ scan_bitmap_block() 190 /* first zero bit found; we check next bits */ scan_bitmap_block() 675 static void print_sep(struct seq_file *seq, int *first) print_sep() argument 677 if (!*first) print_sep() 680 *first = 0; print_sep() 685 int first = 1; show_alloc_options() local 694 print_sep(seq, &first); show_alloc_options() 702 print_sep(seq, &first); show_alloc_options() 710 print_sep(seq, &first); show_alloc_options() 714 print_sep(seq, &first); show_alloc_options() 718 print_sep(seq, &first); show_alloc_options() 722 print_sep(seq, &first); show_alloc_options() 726 print_sep(seq, &first); show_alloc_options() 730 print_sep(seq, &first); show_alloc_options() 734 print_sep(seq, &first); show_alloc_options() 738 print_sep(seq, &first); show_alloc_options() 742 print_sep(seq, &first); show_alloc_options() 746 print_sep(seq, &first); show_alloc_options() 750 print_sep(seq, &first); show_alloc_options() 754 print_sep(seq, &first); show_alloc_options() 759 print_sep(seq, &first); show_alloc_options() 828 * keep the root dir and it's first set of subdirs close to oid_groups() 872 * for indirect item: go to left and look for the first non-hole entry get_left_neighbor() 894 * should be, if formatted node, then try to put on first part of the device 1025 * whenever we create a new directory, we displace it. At first determine_search_start() 1160 /* fill free_blocknrs array first */ allocate_without_wrapping_disk() 1391 /* The first bit must ALWAYS be 1 */ reiserfs_cache_bitmap_metadata() 1394 "corrupted: first bit must be 1", bh->b_blocknr); reiserfs_cache_bitmap_metadata()
|
H A D | objectid.c | 33 * When we allocate objectids we allocate the first unused objectid. 38 * boundaries of the sequences. A consequence of allocating the first 70 * This incrementation allocates the first unused objectid. That reiserfs_get_unused_objectid() 71 * is to say, the first entry on the objectid map is the first reiserfs_get_unused_objectid() 80 * the first even sequence (and can eliminate the sequence by reiserfs_get_unused_objectid() 82 * first two odd sequences into one sequence. If so, then the net reiserfs_get_unused_objectid()
|
/linux-4.4.14/arch/xtensa/include/asm/ |
H A D | switch_to.h | 12 /* * switch_to(n) should switch tasks to task nr n, first
|
H A D | bitops.h | 38 * ffz: Find first zero in word. Undefined if no zero exists. 48 * __ffs: Find first bit set in word. Return 0 for bit 0 57 * ffs: Find first bit set in word. This is defined the same way as 81 * Undefined if no set bit exists, so code should check against 0 first.
|
/linux-4.4.14/mm/ |
H A D | interval_tree.c | 94 unsigned long first, unsigned long last) anon_vma_interval_tree_iter_first() 96 return __anon_vma_interval_tree_iter_first(root, first, last); anon_vma_interval_tree_iter_first() 101 unsigned long first, unsigned long last) anon_vma_interval_tree_iter_next() 103 return __anon_vma_interval_tree_iter_next(node, first, last); anon_vma_interval_tree_iter_next() 93 anon_vma_interval_tree_iter_first(struct rb_root *root, unsigned long first, unsigned long last) anon_vma_interval_tree_iter_first() argument 100 anon_vma_interval_tree_iter_next(struct anon_vma_chain *node, unsigned long first, unsigned long last) anon_vma_interval_tree_iter_next() argument
|
/linux-4.4.14/include/linux/platform_data/ |
H A D | pca953x.h | 10 /* number of the first GPIO */
|
/linux-4.4.14/arch/sh/include/mach-kfr2r09/mach/ |
H A D | romimage.h | 5 * the assembly code is the first code to be executed in the romImage
|
/linux-4.4.14/arch/blackfin/lib/ |
H A D | umulsi3_highpart.S | 22 ignore carry on this first addition. */
|
/linux-4.4.14/tools/arch/mips/include/asm/ |
H A D | barrier.h | 4 * FIXME: This came from tools/perf/perf-sys.h, where it was first introduced
|
/linux-4.4.14/tools/arch/tile/include/asm/ |
H A D | barrier.h | 4 * FIXME: This came from tools/perf/perf-sys.h, where it was first introduced
|
/linux-4.4.14/drivers/hwtracing/stm/ |
H A D | policy.c | 96 unsigned int first, last; stp_policy_node_masters_store() local 101 if (sscanf(p, "%u %u", &first, &last) != 2) stp_policy_node_masters_store() 110 if (first > INT_MAX || last > INT_MAX || first > last || stp_policy_node_masters_store() 111 first < stm->data->sw_start || stp_policy_node_masters_store() 118 policy_node->first_master = first; stp_policy_node_masters_store() 144 unsigned int first, last; stp_policy_node_channels_store() local 149 if (sscanf(p, "%u %u", &first, &last) != 2) stp_policy_node_channels_store() 157 if (first > INT_MAX || last > INT_MAX || first > last || stp_policy_node_channels_store() 164 policy_node->first_channel = first; stp_policy_node_channels_store() 399 /* return the first entry if everything else fails */ __stp_policy_node_lookup()
|
/linux-4.4.14/include/uapi/linux/netfilter_bridge/ |
H A D | ebt_among.h | 28 * of 3 first bytes. So first we compare 4 last bytes of addresses and 29 * if they are the same we compare 2 first.
|
/linux-4.4.14/fs/afs/ |
H A D | write.c | 138 candidate->first = candidate->last = index; afs_write_begin() 196 ASSERTRANGE(wb->first, <=, index, <=, wb->last); afs_write_begin() 197 if (index == wb->first && from < wb->offset_first) afs_write_begin() 207 _debug("append into %lx-%lx", wb->first, wb->last); afs_write_begin() 278 pgoff_t first, pgoff_t last) afs_kill_pages() 284 vnode->fid.vid, vnode->fid.vnode, first, last); afs_kill_pages() 289 _debug("kill %lx-%lx", first, last); afs_kill_pages() 291 count = last - first + 1; afs_kill_pages() 295 first, count, pv.pages); afs_kill_pages() 306 } while (first < last); afs_kill_pages() 321 pgoff_t start, first, last; afs_write_back_from_locked_page() local 386 * and the dirty mark cleared; the first page is locked and must remain afs_write_back_from_locked_page() 388 first = primary_page->index; afs_write_back_from_locked_page() 389 last = first + count - 1; afs_write_back_from_locked_page() 391 offset = (first == wb->first) ? wb->offset_first : 0; afs_write_back_from_locked_page() 394 _debug("write back %lx[%u..] to %lx[..%u]", first, offset, last, to); afs_write_back_from_locked_page() 396 ret = afs_vnode_store_data(wb, first, last, offset, to); afs_write_back_from_locked_page() 411 afs_kill_pages(wb->vnode, true, first, last); afs_write_back_from_locked_page() 420 afs_kill_pages(wb->vnode, false, first, last); afs_write_back_from_locked_page() 576 pgoff_t first = call->first, last = call->last; afs_pages_written_back() local 580 vnode->fid.vid, vnode->fid.vnode, first, last); afs_pages_written_back() 587 _debug("done %lx-%lx", first, last); afs_pages_written_back() 589 count = last - first + 1; afs_pages_written_back() 592 pv.nr = find_get_pages_contig(call->mapping, first, count, afs_pages_written_back() 612 first += count; afs_pages_written_back() 619 } while (first <= last); afs_pages_written_back() 707 wb->first = 0; afs_fsync() 277 afs_kill_pages(struct afs_vnode *vnode, bool error, pgoff_t first, pgoff_t last) afs_kill_pages() argument
|
/linux-4.4.14/arch/x86/mm/ |
H A D | extable.c | 82 search_extable(const struct exception_table_entry *first, search_extable() argument 86 while (first <= last) { search_extable() 90 mid = ((last - first) >> 1) + first; search_extable() 93 first = mid + 1; search_extable()
|
/linux-4.4.14/drivers/dma/ |
H A D | at_xdmac.c | 251 /* Following members are only used by the first descriptor */ 340 struct at_xdmac_desc *first) at_xdmac_start_xfer() 345 dev_vdbg(chan2dev(&atchan->chan), "%s: desc 0x%p\n", __func__, first); at_xdmac_start_xfer() 351 first->active_xfer = true; at_xdmac_start_xfer() 353 /* Tell xdmac where to get the first descriptor. */ at_xdmac_start_xfer() 354 reg = AT_XDMAC_CNDA_NDA(first->tx_dma_desc.phys) at_xdmac_start_xfer() 365 else if (first->lld.mbr_ubc & AT_XDMAC_MBR_UBC_NDV3) at_xdmac_start_xfer() 375 at_xdmac_chan_write(atchan, AT_XDMAC_CC, first->lld.mbr_cfg); at_xdmac_start_xfer() 639 struct at_xdmac_desc *first = NULL, *prev = NULL; at_xdmac_prep_slave_sg() local 682 if (first) for_each_sg() 683 list_splice_init(&first->descs_list, &atchan->free_descs_list); for_each_sg() 714 if (!first) for_each_sg() 715 first = desc; for_each_sg() 718 __func__, desc, first); for_each_sg() local 719 list_add_tail(&desc->desc_node, &first->descs_list); for_each_sg() 724 first->tx_dma_desc.flags = flags; 725 first->xfer_size = xfer_size; 726 first->direction = direction; 727 ret = &first->tx_dma_desc; 741 struct at_xdmac_desc *first = NULL, *prev = NULL; at_xdmac_prep_dma_cyclic() local 770 if (first) at_xdmac_prep_dma_cyclic() 771 list_splice_init(&first->descs_list, &atchan->free_descs_list); at_xdmac_prep_dma_cyclic() 802 if (!first) at_xdmac_prep_dma_cyclic() 803 first = desc; at_xdmac_prep_dma_cyclic() 806 __func__, desc, first); at_xdmac_prep_dma_cyclic() local 807 list_add_tail(&desc->desc_node, &first->descs_list); at_xdmac_prep_dma_cyclic() 810 at_xdmac_queue_desc(chan, prev, first); at_xdmac_prep_dma_cyclic() 811 first->tx_dma_desc.flags = flags; at_xdmac_prep_dma_cyclic() 812 first->xfer_size = buf_len; at_xdmac_prep_dma_cyclic() 813 first->direction = direction; at_xdmac_prep_dma_cyclic() 815 return &first->tx_dma_desc; at_xdmac_prep_dma_cyclic() 941 struct at_xdmac_desc *prev = NULL, *first = NULL; at_xdmac_prep_interleaved() local 965 first = at_xdmac_interleaved_queue_desc(chan, atchan, at_xdmac_prep_interleaved() 972 at_xdmac_increment_block_count(chan, first); at_xdmac_prep_interleaved() 975 __func__, first, first); at_xdmac_prep_interleaved() local 976 list_add_tail(&first->desc_node, &first->descs_list); at_xdmac_prep_interleaved() 999 list_splice_init(&first->descs_list, at_xdmac_prep_interleaved() 1004 if (!first) at_xdmac_prep_interleaved() 1005 first = desc; at_xdmac_prep_interleaved() 1008 __func__, desc, first); at_xdmac_prep_interleaved() local 1009 list_add_tail(&desc->desc_node, &first->descs_list); at_xdmac_prep_interleaved() 1022 first->tx_dma_desc.cookie = -EBUSY; at_xdmac_prep_interleaved() 1023 first->tx_dma_desc.flags = flags; at_xdmac_prep_interleaved() 1024 first->xfer_size = len; at_xdmac_prep_interleaved() 1026 return &first->tx_dma_desc; at_xdmac_prep_interleaved() 1034 struct at_xdmac_desc *first = NULL, *prev = NULL; at_xdmac_prep_dma_memcpy() local 1073 if (first) at_xdmac_prep_dma_memcpy() 1074 list_splice_init(&first->descs_list, &atchan->free_descs_list); at_xdmac_prep_dma_memcpy() 1115 if (!first) at_xdmac_prep_dma_memcpy() 1116 first = desc; at_xdmac_prep_dma_memcpy() 1119 __func__, desc, first); at_xdmac_prep_dma_memcpy() local 1120 list_add_tail(&desc->desc_node, &first->descs_list); at_xdmac_prep_dma_memcpy() 1123 first->tx_dma_desc.flags = flags; at_xdmac_prep_dma_memcpy() 1124 first->xfer_size = len; at_xdmac_prep_dma_memcpy() 1126 return &first->tx_dma_desc; at_xdmac_prep_dma_memcpy() 1223 *ppdesc = NULL, *first = NULL; at_xdmac_prep_dma_memset_sg() local 1243 if (!desc && first) for_each_sg() 1244 list_splice_init(&first->descs_list, for_each_sg() 1247 if (!first) for_each_sg() 1248 first = desc; for_each_sg() 1325 &first->descs_list); for_each_sg() 1328 __func__, desc, first); for_each_sg() local 1371 first->tx_dma_desc.cookie = -EBUSY; 1372 first->tx_dma_desc.flags = flags; 1373 first->xfer_size = len; 1375 return &first->tx_dma_desc; 339 at_xdmac_start_xfer(struct at_xdmac_chan *atchan, struct at_xdmac_desc *first) at_xdmac_start_xfer() argument
|
H A D | at_hdmac.c | 197 * @first: address of first descriptor of the chain 203 static void atc_desc_chain(struct at_desc **first, struct at_desc **prev, atc_desc_chain() argument 206 if (!(*first)) { atc_desc_chain() 207 *first = desc; atc_desc_chain() 213 &(*first)->tx_list); atc_desc_chain() 221 * @first: first descriptor in the list we want to begin with 225 static void atc_dostart(struct at_dma_chan *atchan, struct at_desc *first) atc_dostart() argument 251 channel_writel(atchan, DSCR, first->txd.phys); atc_dostart() 252 channel_writel(atchan, SPIP, ATC_SPIP_HOLE(first->src_hole) | atc_dostart() 253 ATC_SPIP_BOUNDARY(first->boundary)); atc_dostart() 254 channel_writel(atchan, DPIP, ATC_DPIP_HOLE(first->dst_hole) | atc_dostart() 255 ATC_DPIP_BOUNDARY(first->boundary)); atc_dostart() 350 * atomically. Hence a race condition may occur: the first read atc_get_bytes_left() 370 * first time, the CTRLA is read in turn, next the DSCR is read atc_get_bytes_left() 415 /* for the first descriptor we can be more accurate */ atc_get_bytes_left() 599 struct at_desc *first = atc_first_active(atchan); atc_handle_cyclic() local 600 struct dma_async_tx_descriptor *txd = &first->txd; atc_handle_cyclic() 719 struct data_chunk *first = xt->sgl; atc_prep_dma_interleaved() local 746 (dmaengine_get_dst_icg(xt, chunk) != dmaengine_get_dst_icg(xt, first)) || atc_prep_dma_interleaved() 747 (dmaengine_get_src_icg(xt, chunk) != dmaengine_get_src_icg(xt, first))) { atc_prep_dma_interleaved() 789 desc->boundary = first->size >> dwidth; atc_prep_dma_interleaved() 790 desc->dst_hole = (dmaengine_get_dst_icg(xt, first) >> dwidth) + 1; atc_prep_dma_interleaved() 791 desc->src_hole = (dmaengine_get_src_icg(xt, first) >> dwidth) + 1; atc_prep_dma_interleaved() 818 struct at_desc *first = NULL; atc_prep_dma_memcpy() local 865 atc_desc_chain(&first, &prev, desc); atc_prep_dma_memcpy() 869 first->txd.cookie = -EBUSY; atc_prep_dma_memcpy() 870 first->total_len = len; atc_prep_dma_memcpy() 875 first->txd.flags = flags; /* client is in control of this ack */ atc_prep_dma_memcpy() 877 return &first->txd; atc_prep_dma_memcpy() 880 atc_desc_put(atchan, first); atc_prep_dma_memcpy() 997 struct at_desc *desc = NULL, *first = NULL, *prev = NULL; atc_prep_dma_memset_sg() local 1038 atc_desc_chain(&first, &prev, desc); for_each_sg() 1051 first->txd.cookie = -EBUSY; 1052 first->total_len = total_len; 1057 first->txd.flags = flags; 1059 return &first->txd; 1062 atc_desc_put(atchan, first); 1083 struct at_desc *first = NULL; atc_prep_slave_sg() local 1145 atc_desc_chain(&first, &prev, desc); for_each_sg() 1186 atc_desc_chain(&first, &prev, desc); for_each_sg() 1198 first->txd.cookie = -EBUSY; 1199 first->total_len = total_len; 1201 /* first link descriptor of list is responsible of flags */ 1202 first->txd.flags = flags; /* client is in control of this ack */ 1204 return &first->txd; 1209 atc_desc_put(atchan, first); 1230 struct at_desc *first = NULL; atc_prep_dma_sg() local 1318 atc_desc_chain(&first, &prev, desc); atc_prep_dma_sg() 1330 first->txd.cookie = -EBUSY; atc_prep_dma_sg() 1331 first->total_len = total_len; atc_prep_dma_sg() 1336 first->txd.flags = flags; /* client is in control of this ack */ atc_prep_dma_sg() 1338 return &first->txd; atc_prep_dma_sg() 1341 atc_desc_put(atchan, first); atc_prep_dma_sg() 1435 struct at_desc *first = NULL; atc_prep_dma_cyclic() local 1482 atc_desc_chain(&first, &prev, desc); atc_prep_dma_cyclic() 1486 prev->lli.dscr = first->txd.phys; atc_prep_dma_cyclic() 1489 first->txd.cookie = -EBUSY; atc_prep_dma_cyclic() 1490 first->total_len = buf_len; atc_prep_dma_cyclic() 1492 return &first->txd; atc_prep_dma_cyclic() 1496 atc_desc_put(atchan, first); atc_prep_dma_cyclic()
|
H A D | ep93xx_dma.c | 155 * @queue holds pending transactions. These are linked through the first 157 * the first and chained descriptors are flattened into a single list. 249 * We copy the callback parameters from the first descriptor ep93xx_dma_set_active() 251 * callback without having to find out the first descriptor in ep93xx_dma_set_active() 297 * If txd.cookie is set it means that we are back in the first ep93xx_dma_advance_active() 981 struct ep93xx_dma_desc *desc, *first; ep93xx_dma_prep_dma_memcpy() local 984 first = NULL; ep93xx_dma_prep_dma_memcpy() 998 if (!first) ep93xx_dma_prep_dma_memcpy() 999 first = desc; ep93xx_dma_prep_dma_memcpy() 1001 list_add_tail(&desc->node, &first->tx_list); ep93xx_dma_prep_dma_memcpy() 1004 first->txd.cookie = -EBUSY; ep93xx_dma_prep_dma_memcpy() 1005 first->txd.flags = flags; ep93xx_dma_prep_dma_memcpy() 1007 return &first->txd; ep93xx_dma_prep_dma_memcpy() 1009 ep93xx_dma_desc_put(edmac, first); ep93xx_dma_prep_dma_memcpy() 1030 struct ep93xx_dma_desc *desc, *first; ep93xx_dma_prep_slave_sg() local 1046 first = NULL; for_each_sg() 1071 if (!first) for_each_sg() 1072 first = desc; for_each_sg() 1074 list_add_tail(&desc->node, &first->tx_list); for_each_sg() 1077 first->txd.cookie = -EBUSY; 1078 first->txd.flags = flags; 1080 return &first->txd; 1083 ep93xx_dma_desc_put(edmac, first); 1110 struct ep93xx_dma_desc *desc, *first; ep93xx_dma_prep_dma_cyclic() local 1132 first = NULL; ep93xx_dma_prep_dma_cyclic() 1150 if (!first) ep93xx_dma_prep_dma_cyclic() 1151 first = desc; ep93xx_dma_prep_dma_cyclic() 1153 list_add_tail(&desc->node, &first->tx_list); ep93xx_dma_prep_dma_cyclic() 1156 first->txd.cookie = -EBUSY; ep93xx_dma_prep_dma_cyclic() 1158 return &first->txd; ep93xx_dma_prep_dma_cyclic() 1161 ep93xx_dma_desc_put(edmac, first); ep93xx_dma_prep_dma_cyclic()
|
H A D | mmp_pdma.c | 100 struct mmp_pdma_desc_sw *cyclic_first; /* first desc_sw if channel 449 struct mmp_pdma_desc_sw *first = NULL, *prev = NULL, *new; mmp_pdma_prep_memcpy() local 483 if (!first) mmp_pdma_prep_memcpy() 484 first = new; mmp_pdma_prep_memcpy() 504 list_add_tail(&new->node, &first->tx_list); mmp_pdma_prep_memcpy() 507 first->async_tx.flags = flags; /* client is in control of this ack */ mmp_pdma_prep_memcpy() 508 first->async_tx.cookie = -EBUSY; mmp_pdma_prep_memcpy() 516 return &first->async_tx; mmp_pdma_prep_memcpy() 519 if (first) mmp_pdma_prep_memcpy() 520 mmp_pdma_free_desc_list(chan, &first->tx_list); mmp_pdma_prep_memcpy() 530 struct mmp_pdma_desc_sw *first = NULL, *prev = NULL, *new = NULL; mmp_pdma_prep_slave_sg() local 566 if (!first) for_each_sg() 567 first = new; for_each_sg() 576 list_add_tail(&new->node, &first->tx_list); for_each_sg() 584 first->async_tx.cookie = -EBUSY; 585 first->async_tx.flags = flags; 594 return &first->async_tx; 597 if (first) 598 mmp_pdma_free_desc_list(chan, &first->tx_list); 609 struct mmp_pdma_desc_sw *first = NULL, *prev = NULL, *new; mmp_pdma_prep_dma_cyclic() local 653 if (!first) mmp_pdma_prep_dma_cyclic() 654 first = new; mmp_pdma_prep_dma_cyclic() 670 list_add_tail(&new->node, &first->tx_list); mmp_pdma_prep_dma_cyclic() 673 first->async_tx.flags = flags; /* client is in control of this ack */ mmp_pdma_prep_dma_cyclic() 674 first->async_tx.cookie = -EBUSY; mmp_pdma_prep_dma_cyclic() 677 new->desc.ddadr = first->async_tx.phys; mmp_pdma_prep_dma_cyclic() 678 chan->cyclic_first = first; mmp_pdma_prep_dma_cyclic() 680 return &first->async_tx; mmp_pdma_prep_dma_cyclic() 683 if (first) mmp_pdma_prep_dma_cyclic() 684 mmp_pdma_free_desc_list(chan, &first->tx_list); mmp_pdma_prep_dma_cyclic() 896 * Look for the first list entry which has the ENDIRQEN flag dma_do_tasklet()
|
/linux-4.4.14/arch/c6x/platforms/ |
H A D | timer64.c | 181 struct device_node *np, *first = NULL; timer64_init() local 192 } else if (!first) timer64_init() 193 first = np; timer64_init() 196 /* try first one with no core-mask */ timer64_init() 197 if (first) timer64_init() 198 np = of_node_get(first); timer64_init()
|
/linux-4.4.14/arch/arc/kernel/ |
H A D | irq.c | 59 * Relies on being called by boot cpu first (i.e. request called ahead) of 61 * which are guaranteed to be setup on boot core first. 63 * of being called on boot CPU first.
|
/linux-4.4.14/scripts/gdb/linux/ |
H A D | modules.py | 85 first = True 89 separator=" " if first else ",", 91 first = False
|
/linux-4.4.14/arch/score/include/asm/ |
H A D | page.h | 27 * PAGE_OFFSET -- the first address of the first page of memory. When not 28 * using MMU this corresponds to the first free page in physical memory (aligned
|
/linux-4.4.14/arch/microblaze/lib/ |
H A D | modsi3.S | 27 /* get the sign of the result [ depends only on the first arg] */ 37 /* first part try to find the first '1' in the r5 */
|
/linux-4.4.14/arch/arm/vdso/ |
H A D | Makefile | 66 first=`echo $$buildid | cut -b-2`; \ 68 mkdir -p "$(MODLIB)/vdso/.build-id/$$first"; \ 69 ln -sf "../../vdso.so" "$(MODLIB)/vdso/.build-id/$$first/$$last.debug"; \
|
/linux-4.4.14/sound/isa/gus/ |
H A D | gus_mem.c | 51 pblock = alloc->first; snd_gf1_mem_xalloc() 57 if (pblock == alloc->first) snd_gf1_mem_xalloc() 58 alloc->first = nblock; snd_gf1_mem_xalloc() 69 alloc->first = alloc->last = nblock; snd_gf1_mem_xalloc() 85 if (alloc->first == block) { snd_gf1_mem_xfree() 86 alloc->first = block->next; snd_gf1_mem_xfree() 113 for (block = alloc->first; block; block = block->next) { snd_gf1_mem_look() 129 for (block = alloc->first; block; block = block->next) snd_gf1_mem_share() 155 for (pblock = alloc->first, idx = 0; pblock; pblock = pblock->next) { snd_gf1_mem_find() 247 alloc->first = alloc->last = NULL; snd_gf1_mem_init() 278 block = alloc->first; snd_gf1_mem_done() 311 for (block = alloc->first, i = 0; block; block = block->next, i++) { snd_gf1_mem_info_read()
|
/linux-4.4.14/arch/tile/include/gxio/ |
H A D | iorpc_trio.h | 50 unsigned int first, unsigned int flags); 54 unsigned int count, unsigned int first, 59 unsigned int count, unsigned int first, 63 unsigned int count, unsigned int first,
|
H A D | iorpc_mpipe.h | 60 unsigned int count, unsigned int first, 70 unsigned int count, unsigned int first, 86 unsigned int count, unsigned int first, 94 unsigned int first, unsigned int flags); 100 unsigned int count, unsigned int first,
|
/linux-4.4.14/arch/x86/kernel/cpu/ |
H A D | bugs_64.c | 24 * Make sure the first 2MB area is not mapped by huge pages check_bugs()
|
H A D | intel_pt.h | 75 * @first: shorthand for first topa table 93 struct topa *first, *last, *cur; member in struct:pt_buffer
|
H A D | mkcapflags.sh | 25 # Name is everything up to the first whitespace
|
/linux-4.4.14/arch/x86/pci/ |
H A D | init.c | 27 * fallback, yet it's needed to run first to set pcibios_last_bus pci_arch_init()
|
/linux-4.4.14/arch/x86/um/ |
H A D | stub_32.S | 7 /* load pointer to first operation */
|
H A D | stub_64.S | 7 /* load pointer to first operation */
|
/linux-4.4.14/fs/qnx4/ |
H A D | bitmap.c | 10 * 28-05-1998 by Richard Frowijn : first release.
|
H A D | namei.c | 10 * 01-06-1998 by Richard Frowijn : first release. 12 * 04-07-1998 by Frank Denis : first step for rmdir/unlink. 21 * new file twice in the directory entry, first with all possible options at 0
|
/linux-4.4.14/fs/qnx6/ |
H A D | namei.c | 8 * 01-02-2012 by Kai Bankett (chaosman@ontika.net) : first release.
|
H A D | super_mmi.c | 8 * 01-02-2012 by Kai Bankett (chaosman@ontika.net) : first release. 44 start with the first superblock */ qnx6_mmi_fill_super() 47 pr_err("Unable to read first mmi superblock\n"); qnx6_mmi_fill_super()
|
/linux-4.4.14/include/net/ |
H A D | dn_neigh.h | 5 * The position of the first two fields of
|
/linux-4.4.14/include/crypto/ |
H A D | aes.h | 21 * Please ensure that the first two fields are 16-byte aligned
|
/linux-4.4.14/include/uapi/linux/netfilter/ |
H A D | nf_conntrack_tcp.h | 33 /* This sender sent FIN first */
|
/linux-4.4.14/arch/sh/include/asm/ |
H A D | switch_to_64.h | 17 * switch_to() should switch tasks to task nr n, first
|
H A D | bitops.h | 42 * __ffs - find first bit in word. 45 * Undefined if no bit exists, so code should check against 0 first.
|
H A D | tlb_64.h | 29 for (tlb = cpu_data->dtlb.first; \ 39 for (tlb = cpu_data->itlb.first; \
|
/linux-4.4.14/arch/mips/mm/ |
H A D | sc-ip22.c | 29 static inline void indy_sc_wipe(unsigned long first, unsigned long last) indy_sc_wipe() argument 43 "or\t%0, $1\t\t\t# first line to flush\n\t" indy_sc_wipe() 54 : "=r" (first), "=r" (last), "=&r" (tmp) indy_sc_wipe() 55 : "0" (first), "1" (last)); indy_sc_wipe()
|
/linux-4.4.14/arch/nios2/include/asm/ |
H A D | switch_to.h | 12 * switch_to(n) should switch tasks to task ptr, first checking that
|
/linux-4.4.14/arch/cris/include/uapi/asm/ |
H A D | sigcontext.h | 18 struct pt_regs regs; /* needs to be first */
|
/linux-4.4.14/arch/ia64/hp/sim/ |
H A D | hpsim_setup.c | 37 ROOT_DEV = Root_SDA1; /* default to first SCSI drive */ hpsim_setup()
|
/linux-4.4.14/arch/blackfin/include/asm/ |
H A D | switch_to.h | 14 * switch_to(n) should switch tasks to task ptr, first checking that
|
H A D | syscall.h | 60 * @i: first syscall argument to extract 71 * Assume the ptrace layout doesn't change -- r5 is first in memory, syscall_get_arguments()
|
/linux-4.4.14/arch/arm/mach-gemini/ |
H A D | idle.c | 14 * interrupts first since scheduler can miss a tick, but there is gemini_idle()
|
/linux-4.4.14/sound/soc/codecs/ |
H A D | ad1836.h | 24 * for the first ADC/DAC */
|
/linux-4.4.14/tools/perf/ui/gtk/ |
H A D | helpline.c | 37 /* only first line can be displayed */ gtk_helpline_show()
|
/linux-4.4.14/tools/testing/selftests/powerpc/pmu/ |
H A D | lib.h | 34 uint64_t first, last; member in struct:addr_range
|
/linux-4.4.14/virt/kvm/ |
H A D | coalesced_mmio.c | 49 /* last is the first free entry coalesced_mmio_has_room() 50 * check if we don't meet the first used entry coalesced_mmio_has_room() 54 avail = (ring->first - ring->last - 1) % KVM_COALESCED_MMIO_MAX; coalesced_mmio_has_room() 80 /* copy data in first free entry of the ring */ coalesced_mmio_write()
|
/linux-4.4.14/drivers/spi/ |
H A D | spi-bcm63xx.c | 235 static int bcm63xx_txrx_bufs(struct spi_device *spi, struct spi_transfer *first, bcm63xx_txrx_bufs() argument 242 struct spi_transfer *t = first; bcm63xx_txrx_bufs() 262 if (t != first) bcm63xx_txrx_bufs() 269 if (t == first) bcm63xx_txrx_bufs() 317 t = first; bcm63xx_txrx_bufs() 323 if (t != first || prepend_len == 0) bcm63xx_txrx_bufs() 337 struct spi_transfer *t, *first = NULL; bcm63xx_spi_transfer_one() local 350 if (!first) bcm63xx_spi_transfer_one() 351 first = t; bcm63xx_spi_transfer_one() 356 if (n_transfers == 2 && !first->rx_buf && !t->tx_buf && bcm63xx_spi_transfer_one() 357 first->len <= BCM63XX_SPI_MAX_PREPEND) bcm63xx_spi_transfer_one() 373 if (t->speed_hz != first->speed_hz) { bcm63xx_spi_transfer_one() 389 bcm63xx_spi_setup_transfer(spi, first); bcm63xx_spi_transfer_one() 392 status = bcm63xx_txrx_bufs(spi, first, n_transfers); bcm63xx_spi_transfer_one() 398 first = NULL; bcm63xx_spi_transfer_one()
|
/linux-4.4.14/drivers/media/pci/ivtv/ |
H A D | ivtv-udma.c | 26 void ivtv_udma_get_page_info(struct ivtv_dma_page_info *dma_page, unsigned long first, unsigned long size) ivtv_udma_get_page_info() argument 28 dma_page->uaddr = first & PAGE_MASK; ivtv_udma_get_page_info() 29 dma_page->offset = first & ~PAGE_MASK; ivtv_udma_get_page_info() 30 dma_page->tail = 1 + ((first+size-1) & ~PAGE_MASK); ivtv_udma_get_page_info() 31 dma_page->first = (first & PAGE_MASK) >> PAGE_SHIFT; ivtv_udma_get_page_info() 32 dma_page->last = ((first+size-1) & PAGE_MASK) >> PAGE_SHIFT; ivtv_udma_get_page_info() 33 dma_page->page_count = dma_page->last - dma_page->first + 1; ivtv_udma_get_page_info()
|
/linux-4.4.14/drivers/platform/chrome/ |
H A D | chromeos_pstore.c | 29 /* x86-alex, the first Samsung Chromebook. */ 43 /* x86-zgb, the first Acer Chromebook. */
|
/linux-4.4.14/arch/tile/lib/ |
H A D | string-endian.h | 17 * Also, specify how to count "first" and "last" bits 38 * byte. With all indices of zero, the first byte is copied into all
|
H A D | strlen_32.c | 25 /* Read the first word, but force bytes before the string to be nonzero. strlen()
|
H A D | strlen_64.c | 26 /* Read and MASK the first word. */ strlen()
|
/linux-4.4.14/arch/unicore32/kernel/ |
H A D | traps.c | 67 unsigned long first; dump_mem() local 74 * code first, just in case the backtrace kills us. dump_mem() 82 for (first = bottom & ~31; first < top; first += 32) { dump_mem() 89 for (p = first, i = 0; i < 8 && p < top; i++, p += 4) { dump_mem() 98 printk(KERN_DEFAULT "%s%04lx:%s\n", lvl, first & 0xffff, str); dump_mem() 115 * code first, just in case the backtrace kills us. dump_instr()
|
/linux-4.4.14/arch/xtensa/mm/ |
H A D | highmem.c | 71 * pte without first remap it. Keeping stale mappings around __kunmap_atomic() 91 /* cache the first kmap pte */ kmap_init()
|
/linux-4.4.14/fs/ |
H A D | fs_pin.c | 81 p = ACCESS_ONCE(m->mnt_pins.first); mnt_pin_kill() 95 q = ACCESS_ONCE(p->first); group_pin_kill()
|
/linux-4.4.14/include/trace/events/ |
H A D | gfpflags.h | 3 * first and the left over flags will end up showing by themselves. 9 * Thus most bits set go first.
|
/linux-4.4.14/arch/ia64/include/asm/sn/ |
H A D | mspec.h | 36 * variable is 64 bytes long. The first 8 bytes are used. The 40 * NOTE: The amo structure _MUST_ be placed in either the first or second
|
/linux-4.4.14/arch/avr32/oprofile/ |
H A D | backtrace.c | 20 /* The first two words of each frame on the stack look like this if we have 57 /* Get first frame pointer */ avr32_backtrace()
|
/linux-4.4.14/arch/arm/include/asm/ |
H A D | opcodes.h | 149 #define __opcode_thumb32_compose(first, second) ( \ 150 (___opcode_identity32(___opcode_identity16(first)) << 16) \ 155 #define ___asm_opcode_thumb32_compose(first, second) ( \ 156 (___asm_opcode_identity32(___asm_opcode_identity16(first)) << 16) \ 223 #define ___inst_thumb32(first, second) .short first, second 227 #define ___inst_thumb32(first, second) \ 228 ".short " __stringify(first) ", " __stringify(second) "\n\t"
|
/linux-4.4.14/include/linux/mfd/ |
H A D | htc-egpio.h | 16 * @reg_start: index of first register 17 * @gpio_base: gpio number of first pin in this register range
|
/linux-4.4.14/scripts/dtc/ |
H A D | livetree.c | 77 struct property *chain_property(struct property *first, struct property *list) chain_property() argument 79 assert(first->next == NULL); chain_property() 81 first->next = list; chain_property() 82 return first; chain_property() 85 struct property *reverse_properties(struct property *first) reverse_properties() argument 87 struct property *p = first; reverse_properties() 219 struct node *chain_node(struct node *first, struct node *list) chain_node() argument 221 assert(first->next_sibling == NULL); chain_node() 223 first->next_sibling = list; chain_node() 224 return first; chain_node() 311 struct reserve_info *chain_reserve_entry(struct reserve_info *first, chain_reserve_entry() argument 314 assert(first->next == NULL); chain_reserve_entry() 316 first->next = list; chain_reserve_entry() 317 return first; chain_reserve_entry()
|
/linux-4.4.14/drivers/infiniband/hw/qib/ |
H A D | qib_tx.c | 55 * @first: the first PIO buffer to cancel 61 void qib_disarm_piobufs(struct qib_devdata *dd, unsigned first, unsigned cnt) qib_disarm_piobufs() argument 67 last = first + cnt; qib_disarm_piobufs() 69 for (i = first; i < last; i++) { qib_disarm_piobufs() 96 * separately, first, then remaining subctxt, if any qib_disarm_piobufs_ifneeded() 148 * separately, first, then remaining subctxt, if any find_ctxt() 286 u32 first, u32 last) qib_getsendbuf_range() 297 nbufs = last - first + 1; /* number in range to check */ qib_getsendbuf_range() 308 i = first; qib_getsendbuf_range() 315 if (dd->last_pio >= first && dd->last_pio <= last) qib_getsendbuf_range() 317 if (!first) qib_getsendbuf_range() 322 i = !first ? dd->min_kernel_pio : first; qib_getsendbuf_range() 329 if (!first && first != last) /* first == last on VL15, avoid */ qib_getsendbuf_range() 411 * we have to flip to host-order first. qib_chg_pioavailkernel() 482 * separately, first, then remaining subctxt, qib_cancel_sends() 511 * This is a per-device operation, so just the first port. 285 qib_getsendbuf_range(struct qib_devdata *dd, u32 *pbufnum, u32 first, u32 last) qib_getsendbuf_range() argument
|
/linux-4.4.14/drivers/pinctrl/meson/ |
H A D | pinctrl-meson.h | 83 * @first: first pin of the bank 90 * the @regs array refers to the first pin of the bank. 94 unsigned int first; member in struct:meson_bank 198 .first = f, \
|
/linux-4.4.14/drivers/crypto/marvell/ |
H A D | tdma.c | 54 writel_relaxed(dreq->chain.first->cur_dma, mv_cesa_dma_step() 63 for (tdma = dreq->chain.first; tdma;) { mv_cesa_dma_cleanup() 75 dreq->chain.first = NULL; mv_cesa_dma_cleanup() 84 for (tdma = dreq->chain.first; tdma; tdma = tdma->next) { mv_cesa_dma_prepare() 113 chain->first = new_tdma; mv_cesa_dma_add_desc()
|
/linux-4.4.14/tools/perf/ui/stdio/ |
H A D | hist.c | 181 * If we sort by symbol, the first entry is the same than callchain__fprintf_graph() 320 bool first = true; hist_entry__snprintf() local 333 if (!sep || !first) { perf_hpp__for_each_format() 337 first = false; perf_hpp__for_each_format() 387 bool first = true; hists__fprintf() local 408 if (!first) perf_hpp__for_each_format() 411 first = false; perf_hpp__for_each_format() 424 first = true; 434 if (!first) perf_hpp__for_each_format() 437 first = false; perf_hpp__for_each_format()
|
/linux-4.4.14/fs/xfs/libxfs/ |
H A D | xfs_rtbitmap.c | 79 * Searching backward from start to limit, find the first block whose 96 xfs_rtblock_t firstbit; /* first useful bit in the word */ xfs_rtfind_back() 114 * Get the first word's index & point to it. xfs_rtfind_back() 131 * Calculate first (leftmost) bit number to look at, xfs_rtfind_back() 226 * Calculate first (leftmost) bit number to look at, xfs_rtfind_back() 254 * Searching forward from start to limit, find the first block whose 289 * Get the first word's index & point to it. xfs_rtfind_forw() 467 * If there was an old one, get rid of it first. xfs_rtmodify_summary_int() 486 uint first = (uint)((char *)sp - (char *)bp->b_addr); xfs_rtmodify_summary_int() local 489 xfs_trans_log_buf(tp, bp, first, first + sizeof(*sp) - 1); xfs_rtmodify_summary_int() 528 xfs_rtword_t *first; /* first used word in the buffer */ xfs_rtmodify_range() local 550 first = b = &bufp[word]; xfs_rtmodify_range() 557 * If not starting on a word boundary, deal with the first xfs_rtmodify_range() 562 * Compute first bit not changed and mask of relevant bits. xfs_rtmodify_range() 584 (uint)((char *)first - (char *)bufp), xfs_rtmodify_range() 590 first = b = bufp = bp->b_addr; xfs_rtmodify_range() 624 (uint)((char *)first - (char *)bufp), xfs_rtmodify_range() 630 first = b = bufp = bp->b_addr; xfs_rtmodify_range() 661 if (b > first) xfs_rtmodify_range() 662 xfs_trans_log_buf(tp, bp, (uint)((char *)first - (char *)bufp), xfs_rtmodify_range() 682 xfs_rtblock_t postblock; /* first block freed > end */ xfs_rtfree_range() 683 xfs_rtblock_t preblock; /* first block freed < start */ xfs_rtfree_range() 754 xfs_rtblock_t *new, /* out: first block not matching */ xfs_rtcheck_range() 792 * If not starting on a word boundary, deal with the first xfs_rtcheck_range() 797 * Compute first bit not examined. xfs_rtcheck_range() 809 * Different, compute first wrong bit and return. xfs_rtcheck_range() 855 * Different, compute first wrong bit and return. xfs_rtcheck_range() 900 * Different, compute first wrong bit and return. xfs_rtcheck_range()
|
/linux-4.4.14/drivers/media/v4l2-core/ |
H A D | videobuf-dma-sg.c | 157 unsigned long first, last; videobuf_dma_init_user_locked() local 172 first = (data & PAGE_MASK) >> PAGE_SHIFT; videobuf_dma_init_user_locked() 176 dma->nr_pages = last-first+1; videobuf_dma_init_user_locked() 593 unsigned int first, last, size = 0, i; __videobuf_mmap_mapper() local 601 /* look for first buffer to map */ __videobuf_mmap_mapper() 602 for (first = 0; first < VIDEO_MAX_FRAME; first++) { __videobuf_mmap_mapper() 603 if (buf == q->bufs[first]) { __videobuf_mmap_mapper() 604 size = PAGE_ALIGN(q->bufs[first]->bsize); __videobuf_mmap_mapper() 616 last = first; __videobuf_mmap_mapper() 625 for (i = first; i <= last; i++) { __videobuf_mmap_mapper() 640 map, q, vma->vm_start, vma->vm_end, vma->vm_pgoff, first, last); __videobuf_mmap_mapper()
|
H A D | videobuf2-memops.c | 42 unsigned long first, last; vb2_create_framevec() local 46 first = start >> PAGE_SHIFT; vb2_create_framevec() 48 nr = last - first + 1; vb2_create_framevec()
|
/linux-4.4.14/crypto/ |
H A D | xts.c | 66 /* data cipher, uses Key1 i.e. the first half of *key */ setkey() 118 /* calculate first value of T */ crypt() 121 goto first; crypt() 127 first: crypt() 194 /* calculate first value of T */ xts_crypt() 198 goto first; xts_crypt() 204 first: xts_crypt()
|
/linux-4.4.14/kernel/ |
H A D | user_namespace.c | 157 u32 first, last, id2; map_id_range_down() local 165 first = map->extent[idx].first; map_id_range_down() 166 last = first + map->extent[idx].count - 1; map_id_range_down() 167 if (id >= first && id <= last && map_id_range_down() 168 (id2 >= first && id2 <= last)) map_id_range_down() 173 id = (id - first) + map->extent[idx].lower_first; map_id_range_down() 183 u32 first, last; map_id_down() local 189 first = map->extent[idx].first; map_id_down() 190 last = first + map->extent[idx].count - 1; map_id_down() 191 if (id >= first && id <= last) map_id_down() 196 id = (id - first) + map->extent[idx].lower_first; map_id_down() 206 u32 first, last; map_id_up() local 212 first = map->extent[idx].lower_first; map_id_up() 213 last = first + map->extent[idx].count - 1; map_id_up() 214 if (id >= first && id <= last) map_id_up() 219 id = (id - first) + map->extent[idx].first; map_id_up() 444 extent->first, uid_m_show() 465 extent->first, gid_m_show() 486 extent->first, projid_m_show() 564 upper_first = extent->first; mappings_overlap() 576 prev_upper_first = prev->first; mappings_overlap() 676 extent->first = simple_strtoul(pos, &pos, 10); map_write() 696 if ((extent->first == (u32) -1) || map_write() 703 if ((extent->first + extent->count) <= extent->first) map_write()
|
/linux-4.4.14/fs/ntfs/ |
H A D | bitmap.c | 34 * @start_bit: first bit to set 67 * Calculate the indices for the pages containing the first and last __ntfs_bitmap_set_bits_in_run() 73 /* Get the page containing the first bit (@start_bit). */ __ntfs_bitmap_set_bits_in_run() 78 ntfs_error(vi->i_sb, "Failed to map first page (error " __ntfs_bitmap_set_bits_in_run() 87 /* Calculate the position of @start_bit in the first byte. */ __ntfs_bitmap_set_bits_in_run() 90 /* If the first byte is partial, modify the appropriate bits in it. */ __ntfs_bitmap_set_bits_in_run() 115 /* Update @len to point to the first not-done byte in the page. */ __ntfs_bitmap_set_bits_in_run()
|
/linux-4.4.14/arch/ia64/lib/ |
H A D | copy_page_mck.S | 22 * of 128 bytes. When both of these lines are in the L2 and the first half of the 28 * has 2*PREFETCH_DIST+K stages. The first PREFETCH_DIST stages are used for prefetching 39 * As a secondary optimization, the first 2*PREFETCH_DIST iterations are implemented 122 add src0 = 8, in1 // first t1 src 123 add src1 = 3*8, in1 // first t3 src 124 add dst0 = 8, in0 // first t1 dst 125 add dst1 = 3*8, in0 // first t3 dst
|
/linux-4.4.14/net/ipv4/ |
H A D | tcp_westwood.c | 4 * Angelo Dell'Aera: author of the first version of TCP Westwood+ in Linux 2.4 32 u32 bw_ns_est; /* first bandwidth estimation..not too smoothed 8) */ 41 u8 first_ack; /* flag which infers that this is the first ack */ 57 * way as soon as possible. It will reasonably happen within the first 87 /* If the filter is empty fill it with the first sample of bandwidth */ westwood_filter() 120 /* Initialize w->snd_una with the first acked sequence number in order westwood_update_window() 121 * to fix mismatch between tp->snd_una and w->snd_una for the first westwood_update_window()
|
/linux-4.4.14/drivers/crypto/ccp/ |
H A D | ccp-crypto-sha.c | 144 rctx->cmd.u.sha.first = rctx->first; ccp_do_sha_update() 148 rctx->first = 0; ccp_do_sha_update() 173 rctx->first = 1; ccp_sha_init() 176 /* Buffer the HMAC key for first update */ ccp_sha_init() 220 state.first = rctx->first; ccp_sha_export() 242 rctx->first = state.first; ccp_sha_import()
|
/linux-4.4.14/block/partitions/ |
H A D | acorn.c | 172 int first = 1; adfspart_check_CUMANA() local 212 first = 0; adfspart_check_CUMANA() 239 return first ? 0 : 1; adfspart_check_CUMANA() 253 * hda1 = ADFS partition on first drive. 352 * hda1 = ADFS partition 0 on first drive. 353 * hda2 = ADFS partition 1 on first drive. 393 * Our own extension - We use the first sector adfspart_check_ICS() 448 * hda1 = ADFS partition 0 on first drive. 449 * hda2 = ADFS partition 1 on first drive.
|
H A D | mac.h | 18 __be32 data_start; /* rel block # of first data block */
|
/linux-4.4.14/drivers/media/rc/img-ir/ |
H A D | img-ir-sony.c | 24 func = raw & 0x7f; /* first 7 bits */ img_ir_sony_scancode() 33 func = raw & 0x7f; /* first 7 bits */ img_ir_sony_scancode() 42 func = raw & 0x7f; /* first 7 bits */ img_ir_sony_scancode()
|
/linux-4.4.14/drivers/media/usb/uvc/ |
H A D | uvc_isight.c | 117 * reliably detected when the first packet of the new frame uvc_video_decode_isight() 118 * is processed. The first pass detects the transition and uvc_video_decode_isight() 120 * processes the data of the first payload of the new frame. uvc_video_decode_isight()
|
/linux-4.4.14/arch/sparc/kernel/ |
H A D | sys_sparc_64.c | 330 SYSCALL_DEFINE6(sparc_ipc, unsigned int, call, int, first, unsigned long, second, SYSCALL_DEFINE6() 339 err = sys_semtimedop(first, ptr, SYSCALL_DEFINE6() 343 err = sys_semtimedop(first, ptr, (unsigned)second, SYSCALL_DEFINE6() 348 err = sys_semget(first, (int)second, (int)third); SYSCALL_DEFINE6() 351 err = sys_semctl(first, second, SYSCALL_DEFINE6() 364 err = sys_msgsnd(first, ptr, (size_t)second, SYSCALL_DEFINE6() 368 err = sys_msgrcv(first, ptr, (size_t)second, fifth, SYSCALL_DEFINE6() 372 err = sys_msgget((key_t)first, (int)second); SYSCALL_DEFINE6() 375 err = sys_msgctl(first, (int)second | IPC_64, ptr); SYSCALL_DEFINE6() 386 err = do_shmat(first, ptr, (int)second, &raddr, SHMLBA); SYSCALL_DEFINE6() 398 err = sys_shmget(first, (size_t)second, (int)third); SYSCALL_DEFINE6() 401 err = sys_shmctl(first, (int)second | IPC_64, ptr); SYSCALL_DEFINE6()
|
/linux-4.4.14/arch/x86/kernel/ |
H A D | jump_label.c | 51 * Jump label is enabled for the first time. __jump_label_transform() 74 * If this is the first initialization call, then we __jump_label_transform() 126 * first loaded. Check if the default nop, the one that is arch_jump_label_transform_static()
|
/linux-4.4.14/scripts/ |
H A D | headerdep.pl | 123 my $first = shift @$cycle; 137 $first->[1], $first->[0];
|
/linux-4.4.14/arch/powerpc/oprofile/cell/ |
H A D | pr_util.h | 54 * ovly.buf values begin at '1' to reference the first (or 0th) 62 * - Section 1 points to the first entry of the 64 * of '1', referencing the first (index=0) entry of
|
/linux-4.4.14/arch/mips/sgi-ip27/ |
H A D | ip27-klnuma.c | 113 * Return pfn of first free page of memory on a node. PROM may allocate 114 * data structures on the first couple of pages of the first slot of each
|
/linux-4.4.14/arch/hexagon/kernel/ |
H A D | irq_cpu.c | 67 * The hexagon core comes with a first-level interrupt controller 71 * controllers that are cascaded into one or more of the first-level 76 * The first-level interrupt controller is wrapped by the VM, which
|
/linux-4.4.14/tools/build/ |
H A D | fixdep.c | 68 /* The /next/ file is the first dependency */ parse_dep_file() 86 * process the first target name, which parse_dep_file() 104 * Start searching for next token immediately after the first parse_dep_file()
|
/linux-4.4.14/drivers/usb/host/ |
H A D | xhci-ext-caps.h | 29 /* HCCPARAMS contains the first extended capability pointer */ 99 * capabilites pointer. If searching for the first extended capability, pass 113 /* Find the first extended capability */ xhci_find_next_cap_offset() 134 * @ext_offset Offset from base of the first extended capability to look at,
|
/linux-4.4.14/drivers/staging/skein/ |
H A D | threefish_api.h | 83 * state size for this key. The function uses the first @c state_size bits 101 * state size for this key. The function uses the first @c state_size bits 121 * state size for this key. The function uses the first @c state_size bits 139 * state size for this key. The function uses the first @c state_size bits
|
/linux-4.4.14/drivers/video/fbdev/via/ |
H A D | ioctl.h | 159 /* horizontal resolution of first device */ 161 /* vertical resolution of first device */ 167 /* refresh rate of first device */ 169 /* bpp of first device */
|
/linux-4.4.14/drivers/media/usb/dvb-usb/ |
H A D | digitv.h | 19 * write or first message of a read:
|
/linux-4.4.14/drivers/gpu/drm/nouveau/nvkm/subdev/ltc/ |
H A D | base.c | 44 nvkm_ltc_tags_clear(struct nvkm_ltc *ltc, u32 first, u32 count) nvkm_ltc_tags_clear() argument 46 const u32 limit = first + count - 1; nvkm_ltc_tags_clear() 48 BUG_ON((first > limit) || (limit >= ltc->num_tags)); nvkm_ltc_tags_clear() 50 ltc->func->cbc_clear(ltc, first, limit); nvkm_ltc_tags_clear()
|
/linux-4.4.14/drivers/pci/hotplug/ |
H A D | Makefile | 10 # native driver to attempt to bind first. We can then fall back to
|
/linux-4.4.14/drivers/net/ethernet/chelsio/cxgb4vf/ |
H A D | t4vf_defs.h | 84 #define T4VF_MOD_MAP(module, index, first, last) \ 86 T4VF_MOD_MAP_##module##_FIRST = (first), \ 88 T4VF_MOD_MAP_##module##_OFFSET = ((first)/4), \ 90 (T4VF_##module##_BASE_ADDR/4 + (first)/4), \
|
/linux-4.4.14/drivers/gpu/drm/nouveau/include/nvkm/subdev/ |
H A D | ltc.h | 28 void nvkm_ltc_tags_clear(struct nvkm_ltc *, u32 first, u32 count);
|
/linux-4.4.14/arch/alpha/kernel/ |
H A D | gct.c | 38 /* Now walk the tree, siblings first. */ gct6_find_nodes()
|
/linux-4.4.14/arch/cris/boot/dts/include/dt-bindings/gpio/ |
H A D | tegra-gpio.h | 4 * The first cell in Tegra's GPIO specifier is the GPIO ID. The macros below
|
/linux-4.4.14/fs/hpfs/ |
H A D | dentry.c | 48 * must be valid. 'name' must be validated first. hpfs_compare_dentry()
|
/linux-4.4.14/sound/core/oss/ |
H A D | linear.c | 75 src = src_channels[channel].area.addr + src_channels[channel].area.first / 8; convert() 76 dst = dst_channels[channel].area.addr + dst_channels[channel].area.first / 8; convert() 101 if (snd_BUG_ON(src_channels[channel].area.first % 8 || linear_transfer() 104 if (snd_BUG_ON(dst_channels[channel].area.first % 8 || linear_transfer()
|
/linux-4.4.14/fs/efs/ |
H A D | symlink.c | 26 /* read first 512 bytes of link target */ efs_symlink_readpage()
|
/linux-4.4.14/include/xen/ |
H A D | page.h | 30 /* Return the GFN associated to the first 4KB of the page */ xen_page_to_gfn()
|
/linux-4.4.14/include/asm-generic/ |
H A D | irqflags.h | 5 * All architectures should implement at least the first two functions,
|
/linux-4.4.14/include/dt-bindings/gpio/ |
H A D | tegra-gpio.h | 4 * The first cell in Tegra's GPIO specifier is the GPIO ID. The macros below
|
/linux-4.4.14/include/uapi/asm-generic/ |
H A D | sembuf.h | 16 * so they do not need the first two padding words.
|