История коммитов

Автор SHA1 Сообщение Дата
  florian f21f7f0f50 * handle result type of unsigned ordinal operations in ISO/Extpas mode similiar to TP, solves 3 лет назад
  florian e132ae2fee * last commit was not correct, fixed 3 лет назад
  florian bf5f37b14a * fix conditional statement as pointed out by Sergey Larin 3 лет назад
  florian 6404478ea4 * cleanup of VER3_0 defines 3 лет назад
  florian 292be9029e * when converting a*a into sqr(a), set the result type correctly 3 лет назад
  florian 5a617cd108 + fold real constants c1,c2 for v+c1+c2 or c1+(c2+v) (+ being either + or *) as well if fastmath is enabled 3 лет назад
  florian ff3acfb8cd * cleanup of 2.7.0 defines 3 лет назад
  florian 08050086b9 * keep type when removing "1*", resolves #38840 3 лет назад
  florian 00d4a6889d * add no internal flag when folding constants in taddnode.simplify, resolves #39308 3 лет назад
  florian 8cb92fd49a * simplify real expressions involving unary minus 3 лет назад
  Pierre Muller 33ad038bbb * Avoid some wrong error messages after initial error 3 лет назад
  florian 3069d74ecc * handle constant folding correctly for <pointer>+<ord. constant>+<ord. constant>, resolves #39332 3 лет назад
  Yuriy Sydorov 6a3f32ba69 * optimize tests for a single bit "(a and one_bit_mask_const) = <> one_bit_mask_const" into "(a and one_bit_mask_const) <> = 0" to enable further CPU specific optimizations. 4 лет назад
  florian 83ce289ea4 * last commit fixed, hopefully final fix 4 лет назад
  florian f448603970 * improved last commit, better handling of boolean expressions 4 лет назад
  florian 62bd0068b6 * do not apply the (a and b) or (c and not(b)) into c xor ((c xor a) and b) optimziation if short boolean evaluation is used, should resolve #38576 4 лет назад
  florian e0a1bc6675 + optimize (a and b) or (c and not(b)) into c xor ((c xor a) and b) 4 лет назад
  florian 272a0e3e26 + apply excess precision also to unary minus nodes 4 лет назад
  yury 64c586b86d * Removed/ifdefed lots of unused variables. 4 лет назад
  florian 12adb47d65 * clean up 4 лет назад
  florian 3109005791 + fold also (string const+(string const+string var)) 4 лет назад
  florian 7de94e7a1d * properly fold string+string const+string const., resolves #38267 4 лет назад
  florian e6037961e3 * refactored constant folding code 4 лет назад
  florian 97abf6b495 * first part of fixing #38267: do not bail out early during constant folding 4 лет назад
  florian 4f3a21eeec * don't do x*x -> optimziation for xtensa as it causes a recursive call in sqr(...) 4 лет назад
  florian 6380df9b42 * correctly simplify tree transforms of (a+c1+c2) if a is a pointer, resolves #37671 4 лет назад
  florian 98eab07abd * simplified and fixed code of (v1=const1) and (v2=const2) optimization, resolves #38066 4 лет назад
  florian ff31d95a69 * excess precision should not be applied to comp or currency 4 лет назад
  florian 13f1fb60b4 * directly copy the result of set <op> set into the left side of an assignment 4 лет назад
  Jonas Maebe 0729340817 * try_make_mul32to64: restore original node order if transformation failed 4 лет назад