/freebsd-9.3-release/contrib/gcc/ |
H A D | loop-invariant.c | 129 struct invariant *inv; member in struct:invariant_expr_entry 263 struct invariant *inv; local 278 inv = invariant_for_use (use); 279 if (!inv) 282 gcc_assert (inv->eqto != ~0u); 283 return inv->eqto; 416 return invariant_expr_equal_p (entry1->inv->insn, entry1->expr, 417 entry2->inv->insn, entry2->expr); 426 struct invariant *inv) 428 hashval_t hash = hash_invariant_expr_1 (inv 425 find_or_insert_inv(htab_t eq, rtx expr, enum machine_mode mode, struct invariant *inv) argument 456 find_identical_invariants(htab_t eq, struct invariant *inv) argument 492 struct invariant *inv; local 633 struct invariant *inv = XNEW (struct invariant); local 698 struct invariant *inv; local 745 struct invariant *inv; local 808 struct invariant *inv; local 914 get_inv_cost(struct invariant *inv, int *comp_cost, unsigned *regs_needed) argument 992 gain_for_invariant(struct invariant *inv, unsigned *regs_needed, unsigned new_regs, unsigned regs_used, unsigned n_inv_uses) argument 1018 struct invariant *inv; local 1049 struct invariant *inv = VEC_index (invariant_p, invariants, invno); local 1074 struct invariant *inv = NULL; local 1132 struct invariant *inv = VEC_index (invariant_p, invariants, invno); local 1238 struct invariant *inv; local 1262 struct invariant *inv; local [all...] |
H A D | lambda-mat.c | 297 det(MAT)*inv(MAT), and we return det(MAT) to the caller as the function 312 lambda_matrix_inverse (lambda_matrix mat, lambda_matrix inv, int n) argument 321 inv[0][0] = d; 322 inv[0][1] = -c; 323 inv[1][0] = -b; 324 inv[1][1] = a; 329 inv[0][0] *= -1; 330 inv[1][0] *= -1; 331 inv[0][1] *= -1; 332 inv[ 343 lambda_matrix_inverse_hard(lambda_matrix mat, lambda_matrix inv, int n) argument [all...] |
H A D | ggc-page.c | 1444 size_t size, inv; 1455 inv = size; 1456 while (inv * size != 1) 1457 inv = inv * (2 - inv*size); 1459 DIV_MULT (order) = inv; 1440 size_t size, inv; local
|
H A D | loop-iv.c | 1998 unsigned HOST_WIDEST_INT s, size, d, inv; local 2348 inv = inverse (s, size); 2349 tmp = simplify_gen_binary (MULT, mode, tmp, gen_int_mode (inv, mode));
|
H A D | tree-ssa-loop-ivopts.c | 535 unsigned HOST_WIDE_INT inv, ex, val; local 558 inv = 1; 562 inv = (inv * ex) & mask; 566 val = (a * inv) & mask;
|
/freebsd-9.3-release/crypto/openssl/crypto/ecdsa/ |
H A D | ecs_locl.h | 71 const BIGNUM *inv, const BIGNUM *rp,
|
/freebsd-9.3-release/contrib/groff/src/libs/libbib/ |
H A D | linear.cpp | 102 for (const unsigned char *inv = inv_map[uchar(pat[i])]; *inv; inv++) 103 delta[*inv] = len - i - 1;
|
/freebsd-9.3-release/usr.sbin/boot0cfg/ |
H A D | boot0cfg.c | 525 int inv, i, x; local 530 if ((inv = !strncmp(q, "no", 2))) 538 inv ^= 1; 540 if (inv)
|
/freebsd-9.3-release/usr.bin/mkesdb/ |
H A D | yacc.y | 227 set_invalid(u_int32_t inv) 230 invalid = inv;
|
/freebsd-9.3-release/sys/dev/sound/pci/hda/ |
H A D | hdac.c | 214 int i = 0, j, k, len, inv; local 240 inv = 2; 242 inv = 0; 243 for (k = 0; len > inv && k < nitems(hdac_quirks_tab); k++) { 244 if (strncmp(res + i + inv, 245 hdac_quirks_tab[k].key, len - inv) != 0) 247 if (len - inv != strlen(hdac_quirks_tab[k].key)) 250 printf(" %s%s", (inv != 0) ? "no" : "", 253 if (inv == 0) { 256 } else if (inv ! [all...] |
H A D | hdaa.c | 873 int i = 0, j, k, len, inv; local 887 inv = 2; 889 inv = 0; 890 for (k = 0; len > inv && k < nitems(hdaa_quirks_tab); k++) { 891 if (strncmp(str + i + inv, 892 hdaa_quirks_tab[k].key, len - inv) != 0) 894 if (len - inv != strlen(hdaa_quirks_tab[k].key)) 896 if (inv == 0) {
|
/freebsd-9.3-release/contrib/groff/src/devices/grolbp/ |
H A D | lbp.h | 217 inv[4]; /* Inverted */ local 221 vdmnum(0,espejo),vdmnum(inverted,inv));
|
/freebsd-9.3-release/contrib/binutils/libiberty/ |
H A D | hashtab.c | 127 hashval_t inv; member in struct:prime_ent 239 htab_mod_1 (hashval_t x, hashval_t y, hashval_t inv, int shift) argument 249 t1 = ((ull)x * inv) >> 32; 270 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
|
/freebsd-9.3-release/contrib/gcclibs/libiberty/ |
H A D | hashtab.c | 127 hashval_t inv; member in struct:prime_ent 239 htab_mod_1 (hashval_t x, hashval_t y, hashval_t inv, int shift) argument 249 t1 = ((ull)x * inv) >> 32; 270 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | APFloat.h | 449 /// If this value has an exact multiplicative inverse, store it in inv and 451 bool getExactInverse(APFloat *inv) const;
|
/freebsd-9.3-release/sys/dev/sound/pcm/ |
H A D | ac97.c | 879 int ea, inv, err = 0; local 887 inv = (codec->flags & AC97_F_EAPD_INV) ? 0 : 1; 888 ea = (val >> 15) ^ inv; 894 if (ea != ((val >> 15) ^ inv)) {
|
/freebsd-9.3-release/contrib/llvm/lib/Target/CppBackend/ |
H A D | CPPBackend.cpp | 1167 const InvokeInst* inv = cast<InvokeInst>(I); local 1170 for (unsigned i = 0; i < inv->getNumArgOperands(); ++i) { 1172 << getOpName(inv->getArgOperand(i)) << ");"; 1177 << getOpName(inv->getCalledValue()) << ", " 1178 << getOpName(inv->getNormalDest()) << ", " 1179 << getOpName(inv->getUnwindDest()) << ", " 1181 printEscapedString(inv->getName()); 1184 printCallingConv(inv->getCallingConv()); 1186 printAttributes(inv->getAttributes(), iName);
|
/freebsd-9.3-release/contrib/gdb/gdb/ |
H A D | valprint.c | 482 int inv; 510 doub = unpack_double (type, valaddr, &inv); 511 if (inv) 481 int inv; local
|
H A D | values.c | 543 int inv; 545 foo = unpack_double (VALUE_TYPE (val), VALUE_CONTENTS (val), &inv); 546 if (inv) 539 int inv; local
|
/freebsd-9.3-release/contrib/ntp/ntpd/ |
H A D | refclock_nmea.c | 304 char tag, int inv); 1456 int inv 1465 return table[ *dp && ((*dp == tag) == !inv) ];
|
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | APFloat.cpp | 3714 bool APFloat::getExactInverse(APFloat *inv) const { 3737 if (inv) 3738 *inv = reciprocal;
|
/freebsd-9.3-release/contrib/gcc/config/s390/ |
H A D | s390.c | 1014 s390_branch_condition_mnemonic (rtx code, int inv) argument 1027 if (inv)
|