Lines Matching +full:detect +full:- +full:us
36 lea -16(%rcx, %r11), %r9; \
74 .size name, .-name
95 ja L(crosscache) /* rsi: 16-byte load will cross cache line */
97 ja L(crosscache) /* rdi: 16-byte load will cross cache line */
117 * Determine source and destination string offsets from 16-byte alignment.
146 * n(0~15) n(0~15) 15(15+ n-n) ashr_0
158 shr %cl, %r9d /* adjust for 16-byte offset */
161 * edx must be the same with r9d if in left byte (16-rcx) is equal to
162 * the start from (16-rax) and no null char was seen.
171 * Now both strings are aligned at 16-byte boundary. Loop over strings
172 * checking 32-bytes per iteration.
210 * n(15) n -15 0(15 +(n-15) - n) ashr_1
223 shr %cl, %r9d /* adjust for 16-byte offset */
233 * Setup %r10 value allows us to detect crossing a page boundary.
325 * n(14~15) n -14 1(15 +(n-14) - n) ashr_2
348 * Setup %r10 value allows us to detect crossing a page boundary.
434 * n(13~15) n -13 2(15 +(n-13) - n) ashr_3
458 * Setup %r10 value allows us to detect crossing a page boundary.
544 * n(12~15) n -12 3(15 +(n-12) - n) ashr_4
568 * Setup %r10 value allows us to detect crossing a page boundary.
654 * n(11~15) n - 11 4(15 +(n-11) - n) ashr_5
678 * Setup %r10 value allows us to detect crossing a page boundary.
764 * n(10~15) n - 10 5(15 +(n-10) - n) ashr_6
788 * Setup %r10 value allows us to detect crossing a page boundary.
874 * n(9~15) n - 9 6(15 +(n - 9) - n) ashr_7
898 * Setup %r10 value allows us to detect crossing a page boundary.
984 * n(8~15) n - 8 7(15 +(n - 8) - n) ashr_8
1008 * Setup %r10 value allows us to detect crossing a page boundary.
1094 * n(7~15) n - 7 8(15 +(n - 7) - n) ashr_9
1118 * Setup %r10 value allows us to detect crossing a page boundary.
1204 * n(6~15) n - 6 9(15 +(n - 6) - n) ashr_10
1228 * Setup %r10 value allows us to detect crossing a page boundary.
1314 * n(5~15) n - 5 10(15 +(n - 5) - n) ashr_11
1338 * Setup %r10 value allows us to detect crossing a page boundary.
1424 * n(4~15) n - 4 11(15 +(n - 4) - n) ashr_12
1448 * Setup %r10 value allows us to detect crossing a page boundary.
1534 * n(3~15) n - 3 12(15 +(n - 3) - n) ashr_13
1558 * Setup %r10 value allows us to detect crossing a page boundary.
1644 * n(2~15) n - 2 13(15 +(n - 2) - n) ashr_14
1668 * Setup %r10 value allows us to detect crossing a page boundary.
1754 * n(1~15) n - 1 14(15 +(n - 1) - n) ashr_15
1779 * Setup %r10 value allows us to detect crossing a page boundary.
1871 lea -16(%r9, %rcx), %rax /* locate the exact offset for rdi */
1910 .int L(ashr_1) - L(unaligned_table)
1911 .int L(ashr_2) - L(unaligned_table)
1912 .int L(ashr_3) - L(unaligned_table)
1913 .int L(ashr_4) - L(unaligned_table)
1914 .int L(ashr_5) - L(unaligned_table)
1915 .int L(ashr_6) - L(unaligned_table)
1916 .int L(ashr_7) - L(unaligned_table)
1917 .int L(ashr_8) - L(unaligned_table)
1918 .int L(ashr_9) - L(unaligned_table)
1919 .int L(ashr_10) - L(unaligned_table)
1920 .int L(ashr_11) - L(unaligned_table)
1921 .int L(ashr_12) - L(unaligned_table)
1922 .int L(ashr_13) - L(unaligned_table)
1923 .int L(ashr_14) - L(unaligned_table)
1924 .int L(ashr_15) - L(unaligned_table)
1925 .int L(ashr_0) - L(unaligned_table)