Home
last modified time | relevance | path

Searched refs:t1 (Results 1 – 25 of 262) sorted by relevance

1234567891011

/dragonfly/share/misc/
H A Dscsi_modes62 {RLEC} t1
64 {NUAR} t1
66 {DQue} t1
68 {RAC} t1
70 {SWP} t1
74 {ATO} t1
75 {TAS} t1
87 {DLC} t1
185 {IC} t1
191 {MF} t1
[all …]
/dragonfly/games/hack/
H A Dhack.end.c375 t1->date, &t1->uid, in topten()
377 &t1->hp, &t1->maxhp, &t1->points, in topten()
378 &t1->plchar, &t1->sex, t1->name, t1->death) != 11 in topten()
446 t1->date, t1->uid, in topten()
447 t1->level, t1->maxlvl, in topten()
448 t1->hp, t1->maxhp, t1->points, in topten()
449 t1->plchar, t1->sex, t1->name, t1->death); in topten()
517 t1->points, t1->name); in outentry()
538 if (t1->maxhp < 3 * t1->hp && t1->maxlvl < 4) in outentry()
737 &t1->hp, &t1->maxhp, &t1->points, in prscore()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dipa-icf-gimple.c254 if (!t1 && !t2) in compare_memory_operand()
256 else if (!t1 || !t2) in compare_memory_operand()
289 b1 = t1; in compare_memory_operand()
364 if (t1 == t2) in compare_cst_or_decl()
395 if (!t1 && !t2) in compare_operand()
397 else if (!t1 || !t2) in compare_operand()
552 for (; t1; t1 = TREE_CHAIN (t1)) in compare_asm_inputs_outputs()
586 if (t1 == t2) in compare_variable_decl()
740 tree t1, t2; in compare_gimple_call() local
838 tree t1, t2; in compare_gimple_cond() local
[all …]
H A Dipa-devirt.c581 gcc_checking_assert (main_odr_variant (t1) == t1);
582 if (t1 == t2)
606 gcc_checking_assert (main_odr_variant (t1) == t1);
608 t1 = TYPE_MAIN_VARIANT (t1);
610 if (t1 == t2)
670 t1 = main_odr_variant (t1);
672 if (t1 == t2)
991 t1))
1119 t1);
1181 if ((POINTER_TYPE_P (t1) || TREE_CODE (t1) == ARRAY_TYPE)
[all …]
H A Dipa-icf-gimple.h157 bool compare_ssa_name (tree t1, tree t2);
201 bool compare_decl (tree t1, tree t2);
204 bool compare_tree_ssa_label (tree t1, tree t2);
207 bool compare_memory_operand (tree t1, tree t2);
211 bool compare_cst_or_decl (tree t1, tree t2);
216 bool compare_operand (tree t1, tree t2);
220 bool compare_asm_inputs_outputs (tree t1, tree t2);
224 bool compare_function_decl (tree t1, tree t2);
227 bool compare_variable_decl (tree t1, tree t2);
232 static bool compatible_polymorphic_types_p (tree t1, tree t2,
[all …]
H A Dtree-vector-builder.c63 tree_vector_builder::new_binary_operation (tree type, tree t1, tree t2, in new_binary_operation() argument
67 gcc_assert (known_eq (full_nelts, TYPE_VECTOR_SUBPARTS (TREE_TYPE (t1))) in new_binary_operation()
88 unsigned int npatterns = least_common_multiple (VECTOR_CST_NPATTERNS (t1), in new_binary_operation()
90 unsigned int nelts_per_pattern = MAX (VECTOR_CST_NELTS_PER_PATTERN (t1), in new_binary_operation()
109 tree_vector_builder::binary_encoded_nelts (tree t1, tree t2) in binary_encoded_nelts() argument
111 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (TREE_TYPE (t1)); in binary_encoded_nelts()
114 unsigned int npatterns = least_common_multiple (VECTOR_CST_NPATTERNS (t1), in binary_encoded_nelts()
116 unsigned int nelts_per_pattern = MAX (VECTOR_CST_NELTS_PER_PATTERN (t1), in binary_encoded_nelts()
/dragonfly/crypto/openssh/
H A Dsmult_curve25519_ref.c191 unsigned int t1[32]; in recip() local
195 /* 4 */ square(t1,z2); in recip()
196 /* 8 */ square(t0,t1); in recip()
203 /* 2^7 - 2^2 */ square(t1,t0); in recip()
204 /* 2^8 - 2^3 */ square(t0,t1); in recip()
211 /* 2^20 - 2^10 */ for (i = 2;i < 10;i += 2) { square(t0,t1); square(t1,t0); } in recip()
216 /* 2^40 - 2^20 */ for (i = 2;i < 20;i += 2) { square(t0,t1); square(t1,t0); } in recip()
221 /* 2^50 - 2^10 */ for (i = 2;i < 10;i += 2) { square(t1,t0); square(t0,t1); } in recip()
226 /* 2^100 - 2^50 */ for (i = 2;i < 50;i += 2) { square(t0,t1); square(t1,t0); } in recip()
231 /* 2^200 - 2^100 */ for (i = 2;i < 100;i += 2) { square(t1,t0); square(t0,t1); } in recip()
[all …]
H A Dfe25519.c132 fe25519 t1 = *x; in fe25519_iseq_vartime() local
134 fe25519_freeze(&t1); in fe25519_iseq_vartime()
137 if(t1.v[i] != t2.v[i]) return 0; in fe25519_iseq_vartime()
229 fe25519 t1; in fe25519_invert() local
233 /* 4 */ fe25519_square(&t1,&z2); in fe25519_invert()
234 /* 8 */ fe25519_square(&t0,&t1); in fe25519_invert()
249 /* 2^20 - 2^10 */ for (i = 2;i < 10;i += 2) { fe25519_square(&t0,&t1); fe25519_square(&t1,&t0); } in fe25519_invert()
254 /* 2^40 - 2^20 */ for (i = 2;i < 20;i += 2) { fe25519_square(&t0,&t1); fe25519_square(&t1,&t0); } in fe25519_invert()
259 /* 2^50 - 2^10 */ for (i = 2;i < 10;i += 2) { fe25519_square(&t1,&t0); fe25519_square(&t0,&t1); } in fe25519_invert()
264 /* 2^100 - 2^50 */ for (i = 2;i < 50;i += 2) { fe25519_square(&t0,&t1); fe25519_square(&t1,&t0); } in fe25519_invert()
[all …]
/dragonfly/contrib/openbsd_libm/src/
H A De_hypot.c85 t1=0; in hypot()
87 b *= t1; in hypot()
88 a *= t1; in hypot()
101 t1 = 0; in hypot()
103 t2 = a-t1; in hypot()
104 w = sqrt(t1*t1-(b*(-b)-t2*(a+t1))); in hypot()
110 t1 = 0; in hypot()
112 t2 = a - t1; in hypot()
113 w = sqrt(t1*yy1-(w*(-w)-(t1*y2+t2*b))); in hypot()
117 t1 = 1.0; in hypot()
[all …]
H A De_hypotf.c22 float a=x,b=y,t1,t2,yy1,y2,w; in hypotf() local
50 b *= t1; in hypotf()
51 a *= t1; in hypotf()
64 SET_FLOAT_WORD(t1,ha&0xfffff000); in hypotf()
65 t2 = a-t1; in hypotf()
66 w = sqrtf(t1*t1-(b*(-b)-t2*(a+t1))); in hypotf()
71 SET_FLOAT_WORD(t1,ha+0x00800000); in hypotf()
72 t2 = a - t1; in hypotf()
73 w = sqrtf(t1*yy1-(w*(-w)-(t1*y2+t2*b))); in hypotf()
76 SET_FLOAT_WORD(t1,0x3f800000+(k<<23)); in hypotf()
[all …]
H A De_powf.c56 float yy1,t1,t2,r,s,t,u,v,w; in powf() local
136 t1 = u+v; in powf()
137 GET_FLOAT_WORD(is,t1); in powf()
138 SET_FLOAT_WORD(t1,is&0xfffff000); in powf()
139 t2 = v-(t1-u); in powf()
187 t1 = (((z_h+z_l)+dp_h[k])+t); in powf()
188 GET_FLOAT_WORD(is,t1); in powf()
190 t2 = z_l-(((t1-t)-dp_h[k])-z_h); in powf()
200 p_l = (y-yy1)*t1+y*t2; in powf()
201 p_h = yy1*t1; in powf()
[all …]
/dragonfly/sys/crypto/rijndael/
H A Drijndael-alg-fst.c863 u32 s0, s1, s2, s3, t0, t1, t2, t3; in rijndaelEncrypt() local
959 t1 = in rijndaelEncrypt()
985 Te1[(t1 >> 16) & 0xff] ^ in rijndaelEncrypt()
990 Te0[(t1 >> 24) ] ^ in rijndaelEncrypt()
999 Te3[(t1 ) & 0xff] ^ in rijndaelEncrypt()
1004 Te2[(t1 >> 8) & 0xff] ^ in rijndaelEncrypt()
1044 u32 s0, s1, s2, s3, t0, t1, t2, t3; in rijndaelDecrypt() local
1140 t1 = in rijndaelDecrypt()
1168 Td3[(t1 ) & 0xff] ^ in rijndaelDecrypt()
1171 Td0[(t1 >> 24) ] ^ in rijndaelDecrypt()
[all …]
/dragonfly/crypto/libressl/crypto/aes/
H A Daes_core.c890 t1 = in AES_encrypt()
916 Te1[(t1 >> 16) & 0xff] ^ in AES_encrypt()
921 Te0[(t1 >> 24)] ^ in AES_encrypt()
930 Te3[(t1) & 0xff] ^ in AES_encrypt()
935 Te2[(t1 >> 8) & 0xff] ^ in AES_encrypt()
1080 t1 = in AES_decrypt()
1108 Td3[(t1) & 0xff] ^ in AES_decrypt()
1111 Td0[(t1 >> 24)] ^ in AES_decrypt()
1118 Td1[(t1 >> 16) & 0xff] ^ in AES_decrypt()
1125 Td2[(t1 >> 8) & 0xff] ^ in AES_decrypt()
[all …]
/dragonfly/contrib/openbsd_libm/src/ld80/
H A De_hypotl.c52 long double a,b,t1,t2,yy1,y2,w; in hypotl() local
85 b *= t1; in hypotl()
86 a *= t1; in hypotl()
102 t2 = a-t1; in hypotl()
103 w = sqrtl(t1*t1-(b*(-b)-t2*(a+t1))); in hypotl()
112 t2 = a - t1; in hypotl()
113 w = sqrtl(t1*yy1-(w*(-w)-(t1*y2+t2*b))); in hypotl()
117 t1 = 1.0; in hypotl()
118 GET_LDOUBLE_EXP(es,t1); in hypotl()
119 SET_LDOUBLE_EXP(t1,es+k); in hypotl()
[all …]
/dragonfly/sys/crypto/camellia/
H A Dcamellia.c137 t1 = klr; \
139 t1 |= lr; \
140 ll ^= t1; \
1005 t1 = io[1]; in camellia_encrypt128()
1009 io[3] = t1; in camellia_encrypt128()
1072 t1 = io[1]; in camellia_decrypt128()
1076 io[3] = t1; in camellia_decrypt128()
1158 t1 = io[1]; in camellia_encrypt256()
1162 io[3] = t1; in camellia_encrypt256()
1241 t1 = io[1]; in camellia_decrypt256()
[all …]
/dragonfly/contrib/tre/lib/
H A Dtre-match-utils.h248 const tre_tag_t *t1, *t2; in tre_minimal_tag_order() local
250 t1 = tags1 + start; in tre_minimal_tag_order()
257 if (t1->value != t2->value) in tre_minimal_tag_order()
260 t1 = tags1 + end; in tre_minimal_tag_order()
264 if (t1->count == 0) in tre_minimal_tag_order()
275 return t2->value - t1->value; in tre_minimal_tag_order()
286 t1 += i; in tre_tag_order_1()
298 if (t1->count == 0) in tre_tag_order_1()
316 if (t1->count == 1) in tre_tag_order_1()
323 if (t1->count == 0) in tre_tag_order_1()
[all …]
/dragonfly/contrib/lvm2/dist/lib/misc/
H A Dtimestamp.c62 int cmp_timestamp(struct timestamp *t1, struct timestamp *t2) in cmp_timestamp() argument
64 if(t1->t.tv_sec < t2->t.tv_sec) in cmp_timestamp()
66 if(t1->t.tv_sec > t2->t.tv_sec) in cmp_timestamp()
69 if(t1->t.tv_nsec < t2->t.tv_nsec) in cmp_timestamp()
71 if(t1->t.tv_nsec > t2->t.tv_nsec) in cmp_timestamp()
111 int cmp_timestamp(struct timestamp *t1, struct timestamp *t2) in cmp_timestamp() argument
113 if(t1->t.tv_sec < t2->t.tv_sec) in cmp_timestamp()
115 if(t1->t.tv_sec > t2->t.tv_sec) in cmp_timestamp()
118 if(t1->t.tv_usec < t2->t.tv_usec) in cmp_timestamp()
120 if(t1->t.tv_usec > t2->t.tv_usec) in cmp_timestamp()
/dragonfly/contrib/gcc-4.7/gcc/cp/
H A Dtypeck.c440 t1 = type_promotes_to (t1); in type_after_usual_arithmetic_conversions()
740 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1); in merge_types()
775 t1 = cp_build_qualified_type (t1, quals); in merge_types()
778 t1 = build_ptrmemfunc_type (t1); in merge_types()
792 t1 = cp_build_qualified_type (t1, quals); in merge_types()
1021 if ((t1 && TREE_PURPOSE (t1)) in comp_except_specs()
1173 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1); in structural_comptypes()
8353 *t1 = TREE_TYPE (*t1); in casts_away_constness_r()
8360 *t1 = build_pointer_type (*t1); in casts_away_constness_r()
8385 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1); in casts_away_constness()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/cp/
H A Dtypeck.c442 t1 = type_promotes_to (t1); in type_after_usual_arithmetic_conversions()
754 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1); in merge_types()
788 t1 = build_ptrmemfunc_type (t1); in merge_types()
793 t1 = cp_build_qualified_type (t1, quals); in merge_types()
1053 if ((t1 && TREE_PURPOSE (t1)) in comp_except_specs()
1181 t1 = TYPE_MAIN_VARIANT (t1); in cxx_safe_arg_type_equiv_p()
1252 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1); in structural_comptypes()
9814 *t1 = TREE_TYPE (*t1); in casts_away_constness_r()
9821 *t1 = build_pointer_type (*t1); in casts_away_constness_r()
9846 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1); in casts_away_constness()
[all …]
/dragonfly/contrib/gmp/mpz/
H A Dfac_ui.c154 mpz_init2 (t1, 2 * z); in mpz_fac_ui()
158 mpz_mul (x, x, t1); in mpz_fac_ui()
159 mpz_clear (t1); in mpz_fac_ui()
181 mpz_mul (t1, t1, st[0]); in mpz_fac_ui()
184 mpz_mul (x, x, t1); in mpz_fac_ui()
185 mpz_clear (t1); in mpz_fac_ui()
209 mpz_init_set_ui (t1, 1); in mpz_fac_ui()
227 mpz_mul (t1, t1, x); in mpz_fac_ui()
228 mpz_mul (t1, t1, t1); in mpz_fac_ui()
233 mpz_mul (x, x, t1); in mpz_fac_ui()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/
H A Dassoc_container.hpp123 basic_hash_table(T0 t0, T1 t1) : base_type(t0, t1) { } in basic_hash_table() argument
126 basic_hash_table(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } in basic_hash_table() argument
130 : base_type(t0, t1, t2, t3) { } in basic_hash_table()
134 : base_type(t0, t1, t2, t3, t4) { } in basic_hash_table()
139 : base_type(t0, t1, t2, t3, t4, t5) { } in basic_hash_table()
576 basic_branch(T0 t0, T1 t1) : base_type(t0, t1) { } in basic_branch() argument
579 basic_branch(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } in basic_branch() argument
582 basic_branch(T0 t0, T1 t1, T2 t2, T3 t3) in basic_branch() argument
583 : base_type(t0, t1, t2, t3) { } in basic_branch()
587 : base_type(t0, t1, t2, t3, t4) { } in basic_branch()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/
H A Dassoc_container.hpp123 basic_hash_table(T0 t0, T1 t1) : base_type(t0, t1) { } in basic_hash_table() argument
126 basic_hash_table(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } in basic_hash_table() argument
130 : base_type(t0, t1, t2, t3) { } in basic_hash_table()
134 : base_type(t0, t1, t2, t3, t4) { } in basic_hash_table()
139 : base_type(t0, t1, t2, t3, t4, t5) { } in basic_hash_table()
576 basic_branch(T0 t0, T1 t1) : base_type(t0, t1) { } in basic_branch() argument
579 basic_branch(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) { } in basic_branch() argument
582 basic_branch(T0 t0, T1 t1, T2 t2, T3 t3) in basic_branch() argument
583 : base_type(t0, t1, t2, t3) { } in basic_branch()
587 : base_type(t0, t1, t2, t3, t4) { } in basic_branch()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/lto/
H A Dlto.c1012 (*map)[0] = t1; in compare_tree_sccs_1()
1019 if (X(t1) != X(t2)) \ in compare_tree_sccs_1()
1024 code = TREE_CODE (t1); in compare_tree_sccs_1()
1026 if (!TYPE_P (t1)) in compare_tree_sccs_1()
1035 if (DECL_P (t1)) in compare_tree_sccs_1()
1037 else if (TYPE_P (t1)) in compare_tree_sccs_1()
1039 if (TYPE_P (t1)) in compare_tree_sccs_1()
1049 if (TYPE_P (t1)) in compare_tree_sccs_1()
1051 if (AGGREGATE_TYPE_P (t1)) in compare_tree_sccs_1()
1335 && (TREE_PUBLIC (t1) || DECL_EXTERNAL (t1)))) in compare_tree_sccs_1()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dgimple.c3406 if (t1 == t2) in gtc_visit()
3435 if (INTEGRAL_TYPE_P (t1) in gtc_visit()
3466 || t1 == leader2 in gtc_visit()
3536 if (TYPE_NAME (t1) in gimple_types_compatible_p_1()
3552 switch (TREE_CODE (t1)) in gimple_types_compatible_p_1()
3829 if (t1 == t2) in gimple_types_compatible_p()
3889 || t1 == leader2 in gimple_types_compatible_p()
4497 if (t1 == t2) in gimple_canonical_types_compatible_p()
4506 if (TYPE_CANONICAL (t1) in gimple_canonical_types_compatible_p()
4584 switch (TREE_CODE (t1)) in gimple_canonical_types_compatible_p()
[all …]
H A Dsched-vis.c575 sprintf (buf, "use %s", t1); in print_pattern()
588 t1[0] = '!'; in print_pattern()
600 sprintf (t1, "{"); in print_pattern()
605 strcpy (t1, t3); in print_pattern()
607 sprintf (buf, "%s}", t1); in print_pattern()
629 sprintf (t1, "unspec{"); in print_pattern()
634 strcpy (t1, t3); in print_pattern()
636 sprintf (buf, "%s}", t1); in print_pattern()
643 sprintf (t1, "unspec/v{"); in print_pattern()
648 strcpy (t1, t3); in print_pattern()
[all …]

1234567891011