Историја ревизија

Аутор SHA1 Порука Датум
  Jonas Maebe 573f2c20d7 taddnode.cmp_of_disjunct_ranges: fortify in case of programs with errors пре 3 година
  Sergey Larin 60c967f255 Optimized the comparison of a widestring variable with '' пре 3 година
  Sergey Larin 35db2b2da3 Fixed optimization `Length(W)=0` -> `(Pointer(W)=nil) or (PLongword(Pointer(W)-4)^=0)` for WideString пре 3 година
  florian 81c8078735 * reorder string expressions with parentheses so fpc_*_concat_multi can be used efficiently, resolved #39479 пре 3 година
  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 пре 4 година
  Pierre Muller 33ad038bbb * Avoid some wrong error messages after initial error пре 4 година
  florian 3069d74ecc * handle constant folding correctly for <pointer>+<ord. constant>+<ord. constant>, resolves #39332 пре 4 година
  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 година