Home
last modified time | relevance | path

Searched refs:e2 (Results 1 – 25 of 545) sorted by relevance

12345678910>>...22

/netbsd-src/external/gpl3/gcc.old/dist/gcc/d/dmd/
H A Dconstfold.c123 UnionExp Add(Loc loc, Type *type, Expression *e1, Expression *e2) in Add() argument
129 new(&ue) RealExp(loc, e1->toReal() + e2->toReal(), type); in Add()
133 new(&ue) RealExp(loc, e1->toImaginary() + e2->toImaginary(), type); in Add()
166 if (e2->type->isreal()) in Add()
168 r2 = e2->toReal(); in Add()
170 else if (e2->type->isimaginary()) in Add()
172 i2 = e2->toImaginary(); in Add()
177 c2 = e2->toComplex(); in Add()
218 new(&ue) SymOffExp(loc, soe->var, soe->offset + e2->toInteger()); in Add()
221 else if (e2->op == TOKsymoff) in Add()
[all …]
H A Doptimize.c77 ei = ae->e2; in expandVar()
223 expOptimize(e->e2, flags); in Expression_optimize()
343 AddrExp *ae = new AddrExp(e->loc, ce->e2, e->type); in Expression_optimize()
382 if (ae->e2->op == TOKint64 && ae->e1->op == TOKvar) in Expression_optimize()
384 sinteger_t index = ae->e2->toInteger(); in Expression_optimize()
672 if (e2only ? expOptimize(e->e2, result) : binOptimize(e, result)) in Expression_optimize()
677 if (e->e2->isConst() == 1) in Expression_optimize()
679 sinteger_t i2 = e->e2->toInteger(); in Expression_optimize()
699 if (e->e1->isConst() && e->e2->isConst()) in Expression_optimize()
701 if (e->e1->op == TOKsymoff && e->e2->op == TOKsymoff) in Expression_optimize()
[all …]
H A Dexpression.c242 Expression *resolvePropertiesX(Scope *sc, Expression *e1, Expression *e2 = NULL)
254 if (de->e2->op == TOKoverloadset)
258 os = ((OverExp *)de->e2)->vars;
270 if (e2)
272 e2 = semantic(e2, sc);
273 if (e2->op == TOKerror)
275 e2 = resolveProperties(sc, e2);
278 a.push(e2);
293 Expression *e = new CallExp(loc, e1, e2);
308 if (!tf->isref && e2)
[all …]
H A Dexpression.h150 static Expression *combine(Expression *e1, Expression *e2);
422 static Expressions* copyElements(Expression *e1, Expression *e2 = NULL);
737 Expression *e2; variable
742 BinExp(Loc loc, TOK op, int size, Expression *e1, Expression *e2);
757 BinAssignExp(Loc loc, TOK op, int size, Expression *e1, Expression *e2);
1068 DotExp(Loc loc, Expression *e1, Expression *e2);
1077 CommaExp(Loc loc, Expression *e1, Expression *e2, bool generated = true);
1095 IndexExp(Loc loc, Expression *e1, Expression *e2);
1136 AssignExp(Loc loc, Expression *e1, Expression *e2);
1147 ConstructExp(Loc loc, Expression *e1, Expression *e2);
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/d/dmd/
H A Dconstfold.d130 UnionExp Add(const ref Loc loc, Type type, Expression e1, Expression e2) in Add() argument
135 printf("Add(e1 = %s, e2 = %s)\n", e1.toChars(), e2.toChars()); in Add()
139 emplaceExp!(RealExp)(&ue, loc, e1.toReal() + e2.toReal(), type); in Add()
143 emplaceExp!(RealExp)(&ue, loc, e1.toImaginary() + e2.toImaginary(), type); in Add()
172 if (e2.type.isreal()) in Add()
174 r2 = e2.toReal(); in Add()
176 else if (e2.type.isimaginary()) in Add()
178 i2 = e2.toImaginary(); in Add()
183 c2 = e2.toComplex(); in Add()
222 emplaceExp!(SymOffExp)(&ue, loc, soe.var, soe.offset + e2.toInteger()); in Add()
[all …]
H A Doptimize.d110 ei = ae.e2; in expandVar()
309 expOptimize(e.e2, flags); in Expression_optimize()
434 auto ae = new AddrExp(e.loc, ce.e2, e.type); in Expression_optimize()
528 if (auto ie = ei.e2.isIntegerExp()) in Expression_optimize()
562 if (ae.e2.isIntegerExp() && ae.e1.isVarExp()) in Expression_optimize()
564 sinteger_t index = ae.e2.toInteger(); in Expression_optimize()
597 else if (ae.e2.isIntegerExp() && ae.e1.isDotVarExp()) in Expression_optimize()
599 sinteger_t index = ae.e2.toInteger(); in Expression_optimize()
880 if (e.e2.isConst() == 1) in Expression_optimize()
882 sinteger_t i2 = e.e2.toInteger(); in Expression_optimize()
[all …]
H A Dstaticcond.d73 result = impl(aae.e2); in impl()
83 Expression leg = result ? ce.e1 : ce.e2; in impl()
199 const r2 = impl(bo.e2, be.e2, inverted, false, unreached || !r1); in visualizeFull()
211 const r2 = impl(bo.e2, be.e2, inverted, true, unreached); in visualizeFull()
230 const r4 = impl(co.e2, ce.e2, inverted, false, unreached || !r3); in visualizeFull()
246 const r4 = impl(co.e2, ce.e2, inverted, false, unreached || !r12); in visualizeFull()
333 r = r && impl(bo.e2, be.e2, inverted); in visualizeShort()
343 r = r || impl(bo.e2, be.e2, inverted); in visualizeShort()
362 b = b && impl(co.e2, ce.e2, inverted); in visualizeShort()
384 b = b || impl(co.e2, ce.e2, inverted); in visualizeShort()
/netbsd-src/external/gpl3/binutils/dist/bfd/
H A Delf32-mep.c227 int e2, e4; in mep_final_link_relocate() local
231 e2 = 0; in mep_final_link_relocate()
236 e2 = 1; in mep_final_link_relocate()
271 byte[0^e2] = ((u >> 8) & 0xff); in mep_final_link_relocate()
272 byte[1^e2] = (u & 0xff); in mep_final_link_relocate()
282 byte[1^e2] = (byte[1^e2] & 0x01) | (u & 0xfe); in mep_final_link_relocate()
286 byte[0^e2] = (byte[0^e2] & 0xf0) | ((u >> 8) & 0x0f); in mep_final_link_relocate()
287 byte[1^e2] = (byte[1^e2] & 0x01) | (u & 0xfe); in mep_final_link_relocate()
291 byte[2^e2] = ((u >> 9) & 0xff); in mep_final_link_relocate()
292 byte[3^e2] = ((u >> 1) & 0xff); in mep_final_link_relocate()
[all …]
/netbsd-src/external/gpl3/binutils.old/dist/bfd/
H A Delf32-mep.c227 int e2, e4; in mep_final_link_relocate() local
231 e2 = 0; in mep_final_link_relocate()
236 e2 = 1; in mep_final_link_relocate()
271 byte[0^e2] = ((u >> 8) & 0xff); in mep_final_link_relocate()
272 byte[1^e2] = (u & 0xff); in mep_final_link_relocate()
282 byte[1^e2] = (byte[1^e2] & 0x01) | (u & 0xfe); in mep_final_link_relocate()
286 byte[0^e2] = (byte[0^e2] & 0xf0) | ((u >> 8) & 0x0f); in mep_final_link_relocate()
287 byte[1^e2] = (byte[1^e2] & 0x01) | (u & 0xfe); in mep_final_link_relocate()
291 byte[2^e2] = ((u >> 9) & 0xff); in mep_final_link_relocate()
292 byte[3^e2] = ((u >> 1) & 0xff); in mep_final_link_relocate()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/fortran/
H A Ddependency.c123 are_identical_variables (gfc_expr *e1, gfc_expr *e2) in are_identical_variables() argument
127 if (e1->symtree->n.sym->attr.dummy && e2->symtree->n.sym->attr.dummy) in are_identical_variables()
130 if (e1->symtree->n.sym->name != e2->symtree->n.sym->name) in are_identical_variables()
136 if (e1->symtree->n.sym != e2->symtree->n.sym) in are_identical_variables()
146 r2 = e2->ref; in are_identical_variables()
210 gfc_dep_compare_functions (gfc_expr *e1, gfc_expr *e2, bool impure_ok) in gfc_dep_compare_functions() argument
216 if (e1->expr_type != EXPR_FUNCTION || e2->expr_type != EXPR_FUNCTION) in gfc_dep_compare_functions()
219 if ((e1->value.function.esym && e2->value.function.esym in gfc_dep_compare_functions()
220 && e1->value.function.esym == e2->value.function.esym in gfc_dep_compare_functions()
222 || (e1->value.function.isym && e2->value.function.isym in gfc_dep_compare_functions()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/fortran/
H A Ddependency.cc124 are_identical_variables (gfc_expr *e1, gfc_expr *e2) in are_identical_variables() argument
128 if (e1->symtree->n.sym->attr.dummy && e2->symtree->n.sym->attr.dummy) in are_identical_variables()
131 if (e1->symtree->n.sym->name != e2->symtree->n.sym->name) in are_identical_variables()
137 if (e1->symtree->n.sym != e2->symtree->n.sym) in are_identical_variables()
147 r2 = e2->ref; in are_identical_variables()
211 gfc_dep_compare_functions (gfc_expr *e1, gfc_expr *e2, bool impure_ok) in gfc_dep_compare_functions() argument
217 if (e1->expr_type != EXPR_FUNCTION || e2->expr_type != EXPR_FUNCTION) in gfc_dep_compare_functions()
220 if ((e1->value.function.esym && e2->value.function.esym in gfc_dep_compare_functions()
221 && e1->value.function.esym == e2->value.function.esym in gfc_dep_compare_functions()
223 || (e1->value.function.isym && e2->value.function.isym in gfc_dep_compare_functions()
[all …]
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/
H A Dredundant.st2 …e2 = floor((4 + o2)/262144), e3, e4: o1 <= 1 and o1 >= 0 and o2 <= 12 and o2 >= 1 and o3 <= 14 and…
/netbsd-src/external/mit/lua/dist/src/
H A Dlcode.c533 static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { in freeexps() argument
535 int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; in freeexps()
1365 const expdesc *e2) { argument
1367 if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2))
1438 static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, argument
1443 freeexps(fs, e1, e2);
1457 expdesc *e1, expdesc *e2, int line) { argument
1459 int v2 = luaK_exp2anyreg(fs, e2); /* make sure 'e2' is in a register */
1464 finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr));
1472 expdesc *e1, expdesc *e2, int flip, int line, argument
[all …]
/netbsd-src/external/gpl3/binutils.old/dist/libiberty/
H A Dpartition.c79 struct partition_elem *e2; in partition_union() local
100 e2 = &(elements[elem2]); in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
107 e2->class_element = class_element; in partition_union()
108 for (p = e2->next; p != e2; p = p->next) in partition_union()
114 e1->next = e2->next; in partition_union()
115 e2->next = old_next; in partition_union()
127 int e2 = * (const int *) elem2; in elem_compare() local
128 if (e1 < e2) in elem_compare()
130 else if (e1 > e2) in elem_compare()
/netbsd-src/external/gpl3/binutils/dist/libiberty/
H A Dpartition.c79 struct partition_elem *e2; in partition_union() local
100 e2 = &(elements[elem2]); in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
107 e2->class_element = class_element; in partition_union()
108 for (p = e2->next; p != e2; p = p->next) in partition_union()
114 e1->next = e2->next; in partition_union()
115 e2->next = old_next; in partition_union()
127 int e2 = * (const int *) elem2; in elem_compare() local
128 if (e1 < e2) in elem_compare()
130 else if (e1 > e2) in elem_compare()
/netbsd-src/external/gpl3/gcc.old/dist/libiberty/
H A Dpartition.c79 struct partition_elem *e2; in partition_union() local
100 e2 = &(elements[elem2]); in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
107 e2->class_element = class_element; in partition_union()
108 for (p = e2->next; p != e2; p = p->next) in partition_union()
114 e1->next = e2->next; in partition_union()
115 e2->next = old_next; in partition_union()
127 int e2 = * (const int *) elem2; in elem_compare() local
128 if (e1 < e2) in elem_compare()
130 else if (e1 > e2) in elem_compare()
/netbsd-src/external/gpl3/gcc/dist/libiberty/
H A Dpartition.c79 struct partition_elem *e2; in partition_union() local
100 e2 = &(elements[elem2]); in partition_union()
104 += elements[e2->class_element].class_count; in partition_union()
107 e2->class_element = class_element; in partition_union()
108 for (p = e2->next; p != e2; p = p->next) in partition_union()
114 e1->next = e2->next; in partition_union()
115 e2->next = old_next; in partition_union()
127 int e2 = * (const int *) elem2; in elem_compare() local
128 if (e1 < e2) in elem_compare()
130 else if (e1 > e2) in elem_compare()
/netbsd-src/external/gpl2/gettext/dist/gettext-tools/src/
H A Dformat-scheme.c296 equal_element (const struct format_arg * e1, const struct format_arg * e2) in equal_element() argument
298 return (e1->presence == e2->presence in equal_element()
299 && e1->type == e2->type in equal_element()
300 && (e1->type == FAT_LIST ? equal_list (e1->list, e2->list) : true)); in equal_element()
320 const struct format_arg * e2 = &list2->initial.element[i]; in equal_list() local
322 if (!(e1->repcount == e2->repcount && equal_element (e1, e2))) in equal_list()
332 const struct format_arg * e2 = &list2->repeated.element[i]; in equal_list() local
334 if (!(e1->repcount == e2->repcount && equal_element (e1, e2))) in equal_list()
954 const struct format_arg * e2) in make_intersected_element() argument
957 if (e1->presence == FCT_REQUIRED || e2->presence == FCT_REQUIRED) in make_intersected_element()
[all …]
H A Dformat-lisp.c293 equal_element (const struct format_arg * e1, const struct format_arg * e2) in equal_element() argument
295 return (e1->presence == e2->presence in equal_element()
296 && e1->type == e2->type in equal_element()
297 && (e1->type == FAT_LIST ? equal_list (e1->list, e2->list) : true)); in equal_element()
317 const struct format_arg * e2 = &list2->initial.element[i]; in equal_list() local
319 if (!(e1->repcount == e2->repcount && equal_element (e1, e2))) in equal_list()
329 const struct format_arg * e2 = &list2->repeated.element[i]; in equal_list() local
331 if (!(e1->repcount == e2->repcount && equal_element (e1, e2))) in equal_list()
951 const struct format_arg * e2) in make_intersected_element() argument
954 if (e1->presence == FCT_REQUIRED || e2->presence == FCT_REQUIRED) in make_intersected_element()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/ryu/
H A Dgeneric_128.c68 int32_t e2; in generic_binary_to_decimal() local
74 e2 = 1 - bias - mantissaBits + 1 - 2; in generic_binary_to_decimal()
76 e2 = ieeeExponent - bias - mantissaBits + 1 - 2; in generic_binary_to_decimal()
81 e2 = 1 - bias - mantissaBits - 2; in generic_binary_to_decimal()
84 e2 = ieeeExponent - bias - mantissaBits - 2; in generic_binary_to_decimal()
92 printf("-> %s %s * 2^%d\n", ieeeSign ? "-" : "+", s(m2), e2 + 2); in generic_binary_to_decimal()
107 if (e2 >= 0) { in generic_binary_to_decimal()
110 const uint32_t q = log10Pow2(e2) - (e2 > 3); in generic_binary_to_decimal()
113 const int32_t i = -e2 + q + k; in generic_binary_to_decimal()
120 printf("%s * 2^%d / 10^%d\n", s(mv), e2, q); in generic_binary_to_decimal()
[all …]
H A Dd2s.c80 int32_t e2; in d2d() local
84 e2 = 1 - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS - 2; in d2d()
87 e2 = (int32_t) ieeeExponent - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS - 2; in d2d()
94 printf("-> %" PRIu64 " * 2^%d\n", m2, e2 + 2); in d2d()
110 if (e2 >= 0) { in d2d()
113 const uint32_t q = log10Pow2(e2) - (e2 > 3); in d2d()
116 const int32_t i = -e2 + (int32_t) q + k; in d2d()
125 printf("%" PRIu64 " * 2^%d / 10^%u\n", mv, e2, q); in d2d()
147 const uint32_t q = log10Pow5(-e2) - (-e2 > 1); in d2d()
148 e10 = (int32_t) q + e2; in d2d()
[all …]
H A Dd2fixed.c342 int32_t e2; in d2fixed_buffered_n() local
345 e2 = 1 - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS; in d2fixed_buffered_n()
348 e2 = (int32_t) ieeeExponent - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS; in d2fixed_buffered_n()
353 printf("-> %" PRIu64 " * 2^%d\n", m2, e2); in d2fixed_buffered_n()
361 if (e2 >= -52) { in d2fixed_buffered_n()
362 const uint32_t idx = e2 < 0 ? 0 : indexForExponent((uint32_t) e2); in d2fixed_buffered_n()
370 const uint32_t j = p10bits - e2; in d2fixed_buffered_n()
392 printf("e2=%d\n", e2); in d2fixed_buffered_n()
394 if (e2 < 0) { in d2fixed_buffered_n()
395 const int32_t idx = -e2 / 16; in d2fixed_buffered_n()
[all …]
/netbsd-src/external/bsd/openldap/dist/servers/slapd/back-ndb/
H A Dmodrdn.cpp36 Entry e2 = {0}; in ndb_back_modrdn() local
74 NA2.e = &e2; in ndb_back_modrdn()
209 dnParent( &e.e_nname, &e2.e_nname ); in ndb_back_modrdn()
210 dnParent( &e.e_name, &e2.e_name ); in ndb_back_modrdn()
214 rs->sr_err = access_allowed( op, &e2, in ndb_back_modrdn()
230 "of entry %s OK\n", e2.e_name.bv_val, 0, 0 ); in ndb_back_modrdn()
239 if( dn_match( &e2.e_nname, op->oq_modrdn.rs_nnewSup ) ) { in ndb_back_modrdn()
242 op->oq_modrdn.rs_newSup->bv_val, e2.e_name.bv_val, 0 ); in ndb_back_modrdn()
262 e2.e_name = *np_dn; in ndb_back_modrdn()
263 e2.e_nname = *np_ndn; in ndb_back_modrdn()
[all …]
/netbsd-src/tests/lib/libm/
H A Dt_log.c260 volatile long double e2 =
279 ATF_CHECK_MSG((fabsf((log10f(e2) - (float)log10e2)/(float)log10e2) < in ATF_TC_BODY()
282 log10f(e2), log10f(e2), (float)log10e2, (float)log10e2); in ATF_TC_BODY()
283 ATF_CHECK_MSG((fabs((log10(e2) - (double)log10e2)/(double)log10e2) < in ATF_TC_BODY()
286 log10(e2), log10(e2), (double)log10e2, (double)log10e2); in ATF_TC_BODY()
287 ATF_CHECK_MSG((fabsl((log10l(e2) - log10e2)/log10e2) < 2*LDBL_EPSILON), in ATF_TC_BODY()
289 log10l(e2), log10l(e2), log10e in ATF_TC_BODY()
270 volatile long double e2 = ATF_TC_BODY() local
589 volatile long double e2 = ATF_TC_BODY() local
713 volatile long double e2 = ATF_TC_BODY() local
[all...]
/netbsd-src/external/lgpl3/gmp/dist/demos/
H A Dpexpr.c491 expr_t e2; in expr() local
521 str = term (str + 4, &e2); in expr()
522 makeexp (e, PLUS, *e, e2); in expr()
530 str = term (str + 5, &e2); in expr()
531 makeexp (e, MINUS, *e, e2); in expr()
537 str = term (str + 1, &e2); in expr()
538 makeexp (e, PLUS, *e, e2); in expr()
541 str = term (str + 1, &e2); in expr()
542 makeexp (e, MINUS, *e, e2); in expr()
553 expr_t e2; in term() local
[all …]

12345678910>>...22