/linux-3.4.99/arch/alpha/math-emu/ |
D | qrnnd.S | 43 #define n1 $17 macro 53 addq n1,n1,n1 54 bis n1,tmp,n1 56 cmpule d,n1,qb 57 subq n1,d,tmp 58 cmovne qb,tmp,n1 61 addq n1,n1,n1 62 bis n1,tmp,n1 64 cmpule d,n1,qb 65 subq n1,d,tmp [all …]
|
D | sfp-util.h | 20 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 22 (q) = __udiv_qrnnd (&__r, (n1), (n0), (d)); \
|
/linux-3.4.99/arch/powerpc/math-emu/ |
D | udivmodti4.c | 10 _FP_W_TYPE n1, _FP_W_TYPE n0, in _fp_udivmodti4() argument 19 if (d0 > n1) in _fp_udivmodti4() 23 udiv_qrnnd (q0, n0, n1, n0, d0); in _fp_udivmodti4() 35 udiv_qrnnd (q1, n1, 0, n1, d0); in _fp_udivmodti4() 36 udiv_qrnnd (q0, n0, n1, n0, d0); in _fp_udivmodti4() 46 if (d0 > n1) in _fp_udivmodti4() 58 n1 = (n1 << bm) | (n0 >> (_FP_W_TYPE_SIZE - bm)); in _fp_udivmodti4() 62 udiv_qrnnd (q0, n0, n1, n0, d0); in _fp_udivmodti4() 85 n1 -= d0; in _fp_udivmodti4() 97 n2 = n1 >> b; in _fp_udivmodti4() [all …]
|
/linux-3.4.99/lib/mpi/ |
D | mpih-div.c | 49 mpi_limb_t n1, n0, r; in mpihelp_mod_1() local 86 n1 = dividend_ptr[dividend_size - 1]; in mpihelp_mod_1() 87 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1() 98 ((n1 << normalization_steps) in mpihelp_mod_1() 104 n1 = n0; in mpihelp_mod_1() 107 n1 << normalization_steps, in mpihelp_mod_1() 149 n1 = dividend_ptr[dividend_size - 1]; in mpihelp_mod_1() 150 r = n1 >> (BITS_PER_MPI_LIMB - in mpihelp_mod_1() 162 ((n1 << normalization_steps) in mpihelp_mod_1() 167 n1 = n0; in mpihelp_mod_1() [all …]
|
D | longlong.h | 142 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 146 : "1" ((USItype)(n1)), \ 169 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 171 (q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \ 350 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 352 (q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \ 411 #define sdiv_qrnnd(q, r, n1, n0, d) \ argument 416 __xx.__i.__h = n1; __xx.__i.__l = n0; \ 453 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 458 "1" ((USItype)(n1)), \ [all …]
|
/linux-3.4.99/lib/ |
D | rational.c | 35 unsigned long n, d, n0, d0, n1, d1; in rational_best_approximation() local 39 n1 = d0 = 1; in rational_best_approximation() 42 if ((n1 > max_numerator) || (d1 > max_denominator)) { in rational_best_approximation() 43 n1 = n0; in rational_best_approximation() 53 t = n0 + a * n1; in rational_best_approximation() 54 n0 = n1; in rational_best_approximation() 55 n1 = t; in rational_best_approximation() 60 *best_numerator = n1; in rational_best_approximation()
|
/linux-3.4.99/security/selinux/ss/ |
D | ebitmap.c | 29 struct ebitmap_node *n1, *n2; in ebitmap_cmp() local 34 n1 = e1->node; in ebitmap_cmp() 36 while (n1 && n2 && in ebitmap_cmp() 37 (n1->startbit == n2->startbit) && in ebitmap_cmp() 38 !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) { in ebitmap_cmp() 39 n1 = n1->next; in ebitmap_cmp() 43 if (n1 || n2) in ebitmap_cmp() 218 struct ebitmap_node *n1, *n2; in ebitmap_contains() local 224 n1 = e1->node; in ebitmap_contains() 226 while (n1 && n2 && (n1->startbit <= n2->startbit)) { in ebitmap_contains() [all …]
|
/linux-3.4.99/arch/mips/bcm63xx/ |
D | cpu.c | 112 unsigned int tmp, n1, n2, m1; in detect_cpu_clock() local 116 n1 = (tmp & MIPSPLLCTL_N1_MASK) >> MIPSPLLCTL_N1_SHIFT; in detect_cpu_clock() 119 n1 += 1; in detect_cpu_clock() 122 return (16 * 1000000 * n1 * n2) / m1; in detect_cpu_clock() 127 unsigned int tmp, n1, n2, m1; in detect_cpu_clock() local 131 n1 = (tmp & DMIPSPLLCFG_N1_MASK) >> DMIPSPLLCFG_N1_SHIFT; in detect_cpu_clock() 134 return (16 * 1000000 * n1 * n2) / m1; in detect_cpu_clock()
|
/linux-3.4.99/arch/s390/include/asm/ |
D | sfp-util.h | 55 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 58 __n = ((unsigned long)(n1) << 32) + n0; \ 64 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 66 (q) = __udiv_qrnnd (&__r, (n1), (n0), (d)); \
|
/linux-3.4.99/arch/x86/include/asm/ |
D | cmpxchg.h | 210 #define __cmpxchg_double(pfx, p1, p2, o1, o2, n1, n2) \ argument 213 __typeof__(*(p1)) __old1 = (o1), __new1 = (n1); \ 227 #define cmpxchg_double(p1, p2, o1, o2, n1, n2) \ argument 228 __cmpxchg_double(LOCK_PREFIX, p1, p2, o1, o2, n1, n2) 230 #define cmpxchg_double_local(p1, p2, o1, o2, n1, n2) \ argument 231 __cmpxchg_double(, p1, p2, o1, o2, n1, n2)
|
/linux-3.4.99/fs/hfs/ |
D | string.c | 100 const unsigned char *n1, *n2; in hfs_compare_dentry() local 109 n1 = str; in hfs_compare_dentry() 112 if (caseorder[*n1++] != caseorder[*n2++]) in hfs_compare_dentry()
|
/linux-3.4.99/drivers/mfd/ |
D | pcf50633-core.c | 90 int n, n1, idx = 0; in show_dump_regs() local 102 for (n1 = 0; n1 < sizeof(dump); n1++) in show_dump_regs() 105 dump[n1] = 0x00; in show_dump_regs() 107 dump[n1] = pcf50633_reg_read(pcf, n + n1); in show_dump_regs()
|
/linux-3.4.99/net/dccp/ccids/lib/ |
D | packet_history.c | 167 static void __do_track_loss(struct tfrc_rx_hist *h, struct sk_buff *skb, u64 n1) in __do_track_loss() argument 172 if (!dccp_loss_free(s0, s1, n1)) { /* gap between S0 and S1 */ in __do_track_loss() 174 tfrc_rx_hist_entry_from_skb(tfrc_rx_hist_entry(h, 1), skb, n1); in __do_track_loss() 193 u64 n1 = tfrc_rx_hist_entry(h, 1)->tfrchrx_ndp; in __one_after_loss() local 195 if (dccp_loss_free(s2, s1, n1)) { in __one_after_loss() 243 u64 n1 = tfrc_rx_hist_entry(h, 1)->tfrchrx_ndp; in __two_after_loss() local 245 if (dccp_loss_free(s3, s1, n1)) { in __two_after_loss()
|
/linux-3.4.99/arch/sparc/math-emu/ |
D | sfp-util_64.h | 75 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 81 __r1 = (n1) % __d1; \ 82 __q1 = (n1) / __d1; \
|
D | sfp-util_32.h | 76 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 104 "1" ((USItype)(n1)), \
|
/linux-3.4.99/arch/sh/math-emu/ |
D | sfp-util.h | 31 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 38 __r1 = (n1) % __d1; \ 39 __q1 = (n1) / __d1; \
|
/linux-3.4.99/include/scsi/ |
D | iscsi_proto.h | 45 static inline int iscsi_sna_lt(u32 n1, u32 n2) in iscsi_sna_lt() argument 47 return (s32)(n1 - n2) < 0; in iscsi_sna_lt() 50 static inline int iscsi_sna_lte(u32 n1, u32 n2) in iscsi_sna_lte() argument 52 return (s32)(n1 - n2) <= 0; in iscsi_sna_lte() 55 static inline int iscsi_sna_gt(u32 n1, u32 n2) in iscsi_sna_gt() argument 57 return (s32)(n1 - n2) > 0; in iscsi_sna_gt() 60 static inline int iscsi_sna_gte(u32 n1, u32 n2) in iscsi_sna_gte() argument 62 return (s32)(n1 - n2) >= 0; in iscsi_sna_gte()
|
/linux-3.4.99/drivers/isdn/hisax/ |
D | s0box.c | 39 register u_char n1, n2; in readreg() local 46 n1 = (inb_p(padr + 1) >> 3) & 0x17; in readreg() 51 return nibtab[n1] | (nibtab[n2] << 4); in readreg() 58 register u_char n1, n2; in read_fifo() local 66 n1 = (inb_p(padr + 1) >> 3) & 0x17; in read_fifo() 69 *(data++) = nibtab[n1] | (nibtab[n2] << 4); in read_fifo()
|
/linux-3.4.99/drivers/media/common/tuners/ |
D | mc44s803.c | 221 u32 r1, r2, n1, n2, lo1, lo2, freq, val; in mc44s803_set_params() local 229 n1 = (c->frequency + MC44S803_IF1 + 500000) / 1000000; in mc44s803_set_params() 230 freq = MC44S803_OSC / r1 * n1; in mc44s803_set_params() 231 lo1 = ((60 * n1) + (r1 / 2)) / r1; in mc44s803_set_params() 250 MC44S803_REG_SM(n1-2, MC44S803_LO1); in mc44s803_set_params()
|
D | mt20xx.c | 72 int n1=1,n2,f; in mt2032_spurcheck() local 83 n2=-n1; in mt2032_spurcheck() 84 f=n1*(f1-f2); in mt2032_spurcheck() 88 tuner_dbg("spurtest n1=%d n2=%d ftest=%d\n",n1,n2,f); in mt2032_spurcheck() 91 tuner_dbg("mt2032 spurcheck triggered: %d\n",n1); in mt2032_spurcheck() 93 n1++; in mt2032_spurcheck() 94 } while (n1<5); in mt2032_spurcheck()
|
/linux-3.4.99/sound/core/seq/ |
D | seq_queue.h | 120 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 125 "1" ((u32)(n1)), \
|
/linux-3.4.99/fs/hpfs/ |
D | name.c | 74 const unsigned char *n1, unsigned l1, in hpfs_compare_names() argument 81 unsigned char c1 = upcase(hpfs_sb(s)->sb_cp_table,n1[i]); in hpfs_compare_names()
|
/linux-3.4.99/drivers/video/savage/ |
D | savagefb_driver.c | 426 unsigned char n1, n2, best_n1=16+2, best_n2=2, best_m=125+2; in SavageCalcClock() local 441 for (n1=min_n1+2; n1<=max_n1+2; n1++) { in SavageCalcClock() 442 m = (freq * n1 * (1 << n2) + HALF_BASE_FREQ) / in SavageCalcClock() 446 if ((m * BASE_FREQ >= freq_min * n1) && in SavageCalcClock() 447 (m * BASE_FREQ <= freq_max * n1)) { in SavageCalcClock() 448 diff = freq * (1 << n2) * n1 - BASE_FREQ * m; in SavageCalcClock() 454 best_n1 = n1; in SavageCalcClock() 473 unsigned char n1, n2; in common_calc_clock() local 479 for (n1 = min_n1+2; n1 <= max_n1+2; n1++) { in common_calc_clock() 480 m = (freq * n1 * (1 << n2) + HALF_BASE_FREQ) / in common_calc_clock() [all …]
|
/linux-3.4.99/arch/powerpc/include/asm/ |
D | sfp-machine.h | 315 #define udiv_qrnnd(q, r, n1, n0, d) \ argument 321 __r1 = (n1) % __d1; \ 322 __q1 = (n1) / __d1; \
|
/linux-3.4.99/arch/powerpc/platforms/ps3/ |
D | repository.c | 53 static void _dump_node_name(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, in _dump_node_name() argument 57 _dump_field("n1: ", n1, func, line); in _dump_node_name() 65 static void _dump_node(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, u64 n4, in _dump_node() argument 69 _dump_field("n1: ", n1, func, line); in _dump_node() 121 static int read_node(unsigned int lpar_id, u64 n1, u64 n2, u64 n3, u64 n4, in read_node() argument 134 result = lv1_read_repository_node(lpar_id, n1, n2, n3, n4, &v1, in read_node() 140 dump_node_name(lpar_id, n1, n2, n3, n4); in read_node() 144 dump_node(lpar_id, n1, n2, n3, n4, v1, v2); in read_node()
|