 florian
|
27828d41e7
* extended nodes which return true from is_const
|
10 vuotta sitten |
 Jonas Maebe
|
f402b0d7df
* changed getpointerdef() into a tpointerdef.getreusable() class method
|
10 vuotta sitten |
|
florian
|
919c539ff5
* better estimation of callparanode complexity
|
10 vuotta sitten |
|
Jonas Maebe
|
3f736f6114
* handle the loading of VMT entries at the node level, so it's done in a
|
10 vuotta sitten |
|
Jonas Maebe
|
caea5ac8be
* record a load node for the self/vmt tree of the current routine in the
|
10 vuotta sitten |
|
florian
|
0dfbba86f3
* properly firstpass nodes when inc(...) is converted into ...:=...+x, resolves #27471
|
10 vuotta sitten |
 svenbarth
|
5115c3e680
Fix for Mantis #26481. This is a regression.
|
10 vuotta sitten |
|
florian
|
6dd2edb10d
* better complexity estimation for some inline nodes
|
11 vuotta sitten |
|
florian
|
701cdf8ea2
* fix for #25956: left is not necessarily the array load node when accessing an open array/array of const element
|
11 vuotta sitten |
|
svenbarth
|
9d48bc0baf
Implement cross unit type overloading of generics. This fixes the regression introduced with revision 25498.
|
12 vuotta sitten |
|
florian
|
5d4a094799
* calculate complexity of exit nodes correctly
|
12 vuotta sitten |
|
florian
|
be2ab84474
* make actualtargetnode a normal procedure using pointers to node so it can be used also when replacing nodes
|
12 vuotta sitten |
|
florian
|
541d67771b
* keep managed types in registers if possible. Under certain circumstances (if they don't require init/final code,
|
12 vuotta sitten |
|
florian
|
18aaeff1d7
+ calculate node complexity for addrnodes and labelnodes
|
12 vuotta sitten |
|
Jonas Maebe
|
3cde2b2d84
* fixed check for bitpacked accesses (mantis #24007)
|
12 vuotta sitten |
|
florian
|
b43b4bb455
+ pseudo procedure aligned: tells the compiler to assume that the given parameter is naturally aligned, counterpart of unaligned
|
12 vuotta sitten |
|
Jonas Maebe
|
5929ec5592
* turned getpropaccesslist, add_parameters and add_index_parameter into
|
12 vuotta sitten |
|
Jonas Maebe
|
33f5de990d
* fixed indentation
|
13 vuotta sitten |
|
florian
|
8c39b1eba8
* document tforeachprocmethod
|
13 vuotta sitten |
|
florian
|
3987c82bab
* assign a complexity of 2 to float nodes because they usually involve a loading from memory
|
13 vuotta sitten |
|
florian
|
41e8da998c
* cast raise node only to a tertiary node in foreach, makes adding more tertiary nodes easier
|
13 vuotta sitten |
|
florian
|
4d86d25c6c
* -O4 switch for optimizations which are correct but which might have unexpected effects
|
13 vuotta sitten |
|
florian
|
89ec13deeb
* improved complexity estimation for subscript nodes
|
13 vuotta sitten |
|
Jonas Maebe
|
baa8fa39a8
* converted code to trash variables (-gt) to operate at the node tree level,
|
13 vuotta sitten |
|
florian
|
6c8eed21c4
+ implement auto inlining (-Ooautoinline)
|
13 vuotta sitten |
|
Jonas Maebe
|
aee5380ae0
* merged trunk up to r20882
|
13 vuotta sitten |
 sergei
|
06192a8137
Values of managed variables are never ever used after decrementing reference on the variable, so there is no point of having a 'decrement reference' as a separate operation. We can always do 'finalize', i.e. clear the contents after decref.
|
13 vuotta sitten |
|
florian
|
6ec0f2549a
* factored load node flags out of node flags to gain space
|
13 vuotta sitten |
|
sergei
|
6e23565edf
+ Initialize/finalize variants using dedicated helpers, produces both smaller (no RTTI loading necessary) and faster (direct path taken) code.
|
14 vuotta sitten |
|
Jonas Maebe
|
eb8ba875db
* set the node complexity of stringconstn and setconstn to 1 rather than
|
14 vuotta sitten |
