Michael Beck [Mon, 6 Oct 2008 13:33:29 +0000 (13:33 +0000)]
- BugFix: fixed sc_print() for modes with bitsize non dividable by 4
[r22534]
Matthias Braun [Mon, 6 Oct 2008 13:22:08 +0000 (13:22 +0000)]
try to never put phis into pending
[r22532]
Matthias Braun [Mon, 6 Oct 2008 13:21:53 +0000 (13:21 +0000)]
more debug info
[r22531]
Christoph Mallon [Mon, 6 Oct 2008 09:36:34 +0000 (09:36 +0000)]
Typo in comment.
[r22522]
Christoph Mallon [Mon, 6 Oct 2008 09:33:18 +0000 (09:33 +0000)]
s/irn_not_visited(x)/!irn_visited(x)/.
[r22521]
Christoph Mallon [Mon, 6 Oct 2008 08:32:09 +0000 (08:32 +0000)]
Remove redundant test.
[r22518]
Michael Beck [Mon, 6 Oct 2008 00:17:27 +0000 (00:17 +0000)]
- Condeval places a Phi in a wrong block, see the AddP
generated for line 12
[r22508]
Christoph Mallon [Sun, 5 Oct 2008 17:34:39 +0000 (17:34 +0000)]
Clean up need_constraint_copy().
[r22503]
Michael Beck [Sun, 5 Oct 2008 15:07:10 +0000 (15:07 +0000)]
- add missing include
[r22499]
Christoph Mallon [Sun, 5 Oct 2008 13:32:31 +0000 (13:32 +0000)]
Good day and welcome to the FIRM XMALLOC*() macros. These macros are provided for the type safety and convenience of the IPD research facility personnel. The time is 15:32. Check xmalloc.h for details.
[r22494]
Christoph Mallon [Sun, 5 Oct 2008 12:19:18 +0000 (12:19 +0000)]
Plug memory leak.
[r22493]
Christoph Mallon [Sun, 5 Oct 2008 11:41:37 +0000 (11:41 +0000)]
Do not bother zeroing an object just before freeing it.
[r22492]
Christoph Mallon [Sun, 5 Oct 2008 06:56:52 +0000 (06:56 +0000)]
Panic, when encountering a to be lowered ASM node. This at least prevents the endless loop in fehler132.
[r22490]
Michael Beck [Sun, 5 Oct 2008 00:45:03 +0000 (00:45 +0000)]
- improved is_non_null_Confirm()
- disabled buggy parts for now
[r22487]
Moritz Kroll [Sun, 5 Oct 2008 00:44:22 +0000 (00:44 +0000)]
Let some optimizations return non-zero, if they changed something (for fixpoint iteration). Updated Visual Studio project.
[r22486]
Michael Beck [Sat, 4 Oct 2008 23:06:40 +0000 (23:06 +0000)]
- BugFix: fixed effect of r22470: Immediate is always the RIGHT operand
(where this is specified?), so do NOT overwrite it (analog to
turn_back_am())
[r22485]
Michael Beck [Sat, 4 Oct 2008 21:38:35 +0000 (21:38 +0000)]
- fixed r22480: Proj numbers are now different
[r22483]
Christoph Mallon [Sat, 4 Oct 2008 18:47:20 +0000 (18:47 +0000)]
Micro optimisation of the day: Remove ia32_Test, which tests the high result of ia32_Mul.
[r22480]
Christoph Mallon [Sat, 4 Oct 2008 17:38:35 +0000 (17:38 +0000)]
peephole_ia32_Test() would due to a bug only remove an ia32_Test if its direct successor was the desired node. If the desired node was an indirect successor, it would incorrectly identify it as flags destroyer.
[r22479]
Christoph Mallon [Sat, 4 Oct 2008 16:57:08 +0000 (16:57 +0000)]
Treat conversions between the same size as downconv to get rid of unnecessary conversions.
[r22477]
Christoph Mallon [Sat, 4 Oct 2008 15:35:14 +0000 (15:35 +0000)]
Use turn_back_am() to implement peephole_ia32_Imul_split().
[r22471]
Christoph Mallon [Sat, 4 Oct 2008 15:15:17 +0000 (15:15 +0000)]
Only deactivate AM support for a node with an immediate, if the match flags do not include match_am_and_immediates. This allows folding reloads into IMul with immediate.
[r22470]
Christoph Mallon [Sat, 4 Oct 2008 13:15:35 +0000 (13:15 +0000)]
Fix fehler157: Lowering Shrs was missing a Conv.
[r22469]
Christoph Mallon [Sat, 4 Oct 2008 12:59:55 +0000 (12:59 +0000)]
fehler157: Wrong mode for lower half of lowered 64bit Mul.
[r22468]
Christoph Mallon [Sat, 4 Oct 2008 12:52:00 +0000 (12:52 +0000)]
Use gen_binop() in gen_Mulh().
[r22467]
Christoph Mallon [Sat, 4 Oct 2008 12:26:31 +0000 (12:26 +0000)]
Ensure that empty functions get their ret $0 by skipping iro_Start and beo_RegParams.
[r22465]
Christoph Mallon [Sat, 4 Oct 2008 11:50:45 +0000 (11:50 +0000)]
Simplify node construction in gen_Mulh().
[r22464]
Christoph Mallon [Sat, 4 Oct 2008 11:43:37 +0000 (11:43 +0000)]
Merge ia32_am_type_t and ia32_am_arity_t, because (type == ia32_am_None) == (arity == ia32_am_arity_none).
[r22463]
Christoph Mallon [Sat, 4 Oct 2008 11:06:30 +0000 (11:06 +0000)]
set_ia32_op_type() want ia32_AddrModeS, not ia32_am_Source (though they happen to be the same value).
[r22461]
Christoph Mallon [Sat, 4 Oct 2008 10:34:00 +0000 (10:34 +0000)]
Make ia32_get_admissible_noreg() static.
[r22459]
Christoph Mallon [Sat, 4 Oct 2008 10:17:17 +0000 (10:17 +0000)]
fehler156: aligning the stack does not work.
[r22458]
Christoph Mallon [Sat, 4 Oct 2008 09:51:49 +0000 (09:51 +0000)]
Enable folding reloads into unary ia32 instructions (only binary was possible).
[r22457]
Christoph Mallon [Sat, 4 Oct 2008 07:59:00 +0000 (07:59 +0000)]
Remove ia32_am_ternary. The only users were Div an IDiv, which are perfectly fine with being declared unary. Further the only place, where the value was tested (in turn_back_am()) set the wrong operand then. Though, effectively this was unreachable code, because Div/IDiv generate no sensible flags.
[r22456]
Christoph Mallon [Sat, 4 Oct 2008 07:43:39 +0000 (07:43 +0000)]
Use ia32_copy_am_attrs() for splitting IMul reg, mem, imm and also reset base and index.
[r22455]
Christoph Mallon [Sat, 4 Oct 2008 07:42:14 +0000 (07:42 +0000)]
Clean up turn_back_am(), panic on unknown arity.
[r22454]
Christoph Mallon [Sat, 4 Oct 2008 07:39:36 +0000 (07:39 +0000)]
Small simplification.
[r22453]
Christoph Mallon [Sat, 4 Oct 2008 07:11:14 +0000 (07:11 +0000)]
Put the flags, which are modified by Inc/Dec, into a variable.
[r22452]
Christoph Mallon [Fri, 3 Oct 2008 21:47:33 +0000 (21:47 +0000)]
Improve upper_bits_clean(): Recurse on Projs and failed Shr.
[r22450]
Matthias Braun [Fri, 3 Oct 2008 18:09:25 +0000 (18:09 +0000)]
convert bitfield initializer tarvals before using them
[r22441]
Matthias Braun [Fri, 3 Oct 2008 17:30:39 +0000 (17:30 +0000)]
fix firm outputting additional .skips after .string
[r22438]
Matthias Braun [Fri, 3 Oct 2008 17:21:17 +0000 (17:21 +0000)]
mac assembler doesn't know .skip, use .space
[r22437]
Christoph Mallon [Thu, 2 Oct 2008 17:32:13 +0000 (17:32 +0000)]
Let is_non_null_Confirm() work as advertised for SymConsts.
[r22417]
Michael Beck [Thu, 2 Oct 2008 14:02:28 +0000 (14:02 +0000)]
- reduce the number of created confirms further
[r22415]
Michael Beck [Thu, 2 Oct 2008 13:55:27 +0000 (13:55 +0000)]
reduce the number of created Confirms
[r22414]
Michael Beck [Thu, 2 Oct 2008 13:50:34 +0000 (13:50 +0000)]
- BugFix: ensure, that no self-loops are constructed (this work-aound might be too restrictive)
- typos fixed
[r22413]
Michael Beck [Thu, 2 Oct 2008 13:34:00 +0000 (13:34 +0000)]
- BugFix: remove_confirms() now does NOT deactivate confirms for all graphs except the first one
- added debug output
- implemnted global NULL pointer test elimination using Confirm magic
[r22412]
Michael Beck [Thu, 2 Oct 2008 13:32:04 +0000 (13:32 +0000)]
add global_null_ptr_elimination flag
[r22411]
Andreas Zwinkau [Thu, 2 Oct 2008 13:09:13 +0000 (13:09 +0000)]
Test case for historical reasons
[r22410]
Michael Beck [Thu, 2 Oct 2008 11:55:23 +0000 (11:55 +0000)]
test for a rather simply gcc optimization
[r22409]
Michael Beck [Thu, 2 Oct 2008 11:18:31 +0000 (11:18 +0000)]
BugFix of r22380 (fixes 176.gcc):
- smaller_mode() had the meaning "can be represented", restored
- renamed new implemnetation into values_in_mode() with the meaning
"can be converted into in back" which is different from smaller_mode()
[r22408]
Sebastian Buchwald [Thu, 2 Oct 2008 11:12:29 +0000 (11:12 +0000)]
Reuse prevents_AM check in PBQP transformer.
[r22407]
Andreas Zwinkau [Wed, 1 Oct 2008 14:25:05 +0000 (14:25 +0000)]
Panic if proj num is unexpected
[r22394]
Matthias Braun [Wed, 1 Oct 2008 14:05:41 +0000 (14:05 +0000)]
fix endless loops
[r22393]
Matthias Braun [Wed, 1 Oct 2008 14:00:49 +0000 (14:00 +0000)]
simplify and speedup belady/loopana a bit
[r22392]
Matthias Braun [Wed, 1 Oct 2008 11:38:47 +0000 (11:38 +0000)]
create an index, as this heavily speeds up some queries
[r22391]
Sebastian Buchwald [Wed, 1 Oct 2008 11:23:05 +0000 (11:23 +0000)]
PBQP now doesn't find a solution, if we modified the costs a little bit.
- removed unused global variables
- added documentation :-)
now the PBQP solver need some new features...
[r22390]
Michael Beck [Tue, 30 Sep 2008 23:43:40 +0000 (23:43 +0000)]
- BugFix: cleanup cannot work with a precalculated step, use antic_in as initial clean nodes
- use avail_out as the closure for phi_translate()
- add missing lookup() in insert_nodes()
[r22387]
Sebastian Buchwald [Tue, 30 Sep 2008 23:04:21 +0000 (23:04 +0000)]
Added users for symconst.
[r22386]
Sebastian Buchwald [Tue, 30 Sep 2008 21:22:55 +0000 (21:22 +0000)]
Don't panic, the train is waiting for you...
[r22385]
Sebastian Buchwald [Tue, 30 Sep 2008 19:31:40 +0000 (19:31 +0000)]
Add users for symconst.
[r22384]
Moritz Kroll [Tue, 30 Sep 2008 19:01:17 +0000 (19:01 +0000)]
Optimize store after stores with partial overwrites with same values
[r22382]
Moritz Kroll [Tue, 30 Sep 2008 18:55:17 +0000 (18:55 +0000)]
Push ConvP through AddI
[r22381]
Moritz Kroll [Tue, 30 Sep 2008 18:54:08 +0000 (18:54 +0000)]
Mallon: Fixed smaller_mode()
[r22380]
Matthias Braun [Tue, 30 Sep 2008 16:37:42 +0000 (16:37 +0000)]
fix warning in optimized mode
[r22379]
Matthias Braun [Tue, 30 Sep 2008 16:34:19 +0000 (16:34 +0000)]
cleanup statistics stuff
[r22378]
Matthias Braun [Tue, 30 Sep 2008 16:32:27 +0000 (16:32 +0000)]
fix some warnings in optimized mode
[r22377]
Michael Beck [Tue, 30 Sep 2008 14:49:45 +0000 (14:49 +0000)]
place FIRM_DBG_REGISTER into the init function
[r22375]
Matthias Braun [Tue, 30 Sep 2008 14:05:58 +0000 (14:05 +0000)]
put memory operand folding to spill_apply time
[r22373]
Matthias Braun [Tue, 30 Sep 2008 13:53:57 +0000 (13:53 +0000)]
old version was correct...
[r22371]
Sebastian Buchwald [Tue, 30 Sep 2008 13:12:40 +0000 (13:12 +0000)]
Removed dependency that prevents full address mode.
[r22370]
Sebastian Buchwald [Tue, 30 Sep 2008 12:53:21 +0000 (12:53 +0000)]
Right nodes, right order but still not crashing...
[r22368]
Sebastian Buchwald [Tue, 30 Sep 2008 12:10:39 +0000 (12:10 +0000)]
Another variant without index, but shifts with different modes.
[r22367]
Sebastian Buchwald [Tue, 30 Sep 2008 11:27:05 +0000 (11:27 +0000)]
All heuristic applications at right place, but there's a conv between :-(
[r22363]
Sebastian Buchwald [Tue, 30 Sep 2008 10:48:57 +0000 (10:48 +0000)]
Use PBQP heuristic at shift const and afterwards at computed value.
[r22362]
Sebastian Buchwald [Tue, 30 Sep 2008 09:24:48 +0000 (09:24 +0000)]
Provoke heuristical PBQP decision for computed value.
[r22360]
Matthias Braun [Tue, 30 Sep 2008 08:19:50 +0000 (08:19 +0000)]
push compilation unit in context
[r22357]
Matthias Braun [Tue, 30 Sep 2008 08:08:47 +0000 (08:08 +0000)]
when we can do it for tuples, we can do it for Ids too
[r22356]
Matthias Braun [Tue, 30 Sep 2008 08:07:39 +0000 (08:07 +0000)]
we have code duplication in determine_entity_usage and is_address_taken (from scalar_replacement). Port the recent skip_tupe/id fixes
[r22355]
Michael Beck [Mon, 29 Sep 2008 23:36:49 +0000 (23:36 +0000)]
- add a combo flag again, so inlining can use combo or df/cf depending on command line option
[r22352]
Sebastian Buchwald [Mon, 29 Sep 2008 23:00:06 +0000 (23:00 +0000)]
Added more users to calculated value, but there are no real skip pattern for this nodes which is a little bit strange.
Maybe there's a bug which prevents consuming direct users of "memop"-nodes.
[r22351]
Michael Beck [Mon, 29 Sep 2008 22:54:04 +0000 (22:54 +0000)]
- Look through Tuple when checking for address taken (helps inlining)
[r22350]
Michael Beck [Mon, 29 Sep 2008 22:29:16 +0000 (22:29 +0000)]
- BugFix: removed missing debugging artefact, causing partitions with
constant type place on the workqueue again (fix ack/test2.c)
- Add debug output when a partition is placed on the workqueue
[r22349]
Sebastian Buchwald [Mon, 29 Sep 2008 19:57:32 +0000 (19:57 +0000)]
Don't try to use address multiple times, use calculated value instead.
[r22348]
Sebastian Buchwald [Mon, 29 Sep 2008 18:23:04 +0000 (18:23 +0000)]
Tried to create a PBQP graph with can't be solved heuristically (not finished yet)
[r22347]
Matthias Braun [Mon, 29 Sep 2008 13:43:09 +0000 (13:43 +0000)]
be robust against event names containing special chars
[r22346]
Matthias Braun [Mon, 29 Sep 2008 13:16:57 +0000 (13:16 +0000)]
we WANT to push forced graphs on the prioqueue
[r22345]
Matthias Braun [Mon, 29 Sep 2008 09:14:05 +0000 (09:14 +0000)]
here it is
[r22341]
Michael Beck [Sun, 28 Sep 2008 23:38:03 +0000 (23:38 +0000)]
- removed C99 features
[r22340]
Sebastian Buchwald [Sun, 28 Sep 2008 22:23:09 +0000 (22:23 +0000)]
- setted store value to symconst + const which can replaced by an immediate
[r22339]
Sebastian Buchwald [Sun, 28 Sep 2008 22:03:11 +0000 (22:03 +0000)]
- added missing base in two test cases
- added test cases for destination address mode
[r22338]
Sebastian Buchwald [Sun, 28 Sep 2008 21:37:44 +0000 (21:37 +0000)]
Added test with all (?) address mode variants.
[r22337]
Matthias Braun [Sun, 28 Sep 2008 21:16:06 +0000 (21:16 +0000)]
output register pressure in register class context
[r22336]
Matthias Braun [Sun, 28 Sep 2008 21:11:52 +0000 (21:11 +0000)]
also count remats
[r22335]
Matthias Braun [Sun, 28 Sep 2008 21:08:51 +0000 (21:08 +0000)]
improve fix some statistics in bechordal
[r22334]
Matthias Braun [Sun, 28 Sep 2008 18:25:59 +0000 (18:25 +0000)]
- split array.h into array.h/array_t.h and make array.h independent of
compiletime options like NDEBUG (as it is public API!)
- renamed some statevs (append a prefix for their module)
[r22329]
Matthias Braun [Sun, 28 Sep 2008 18:24:25 +0000 (18:24 +0000)]
fix bug in statev script for empty contexts
[r22328]
Matthias Braun [Sun, 28 Sep 2008 18:12:08 +0000 (18:12 +0000)]
disable some expensive statevs
[r22327]
Matthias Braun [Sun, 28 Sep 2008 17:37:43 +0000 (17:37 +0000)]
fix warning
[r22326]
Matthias Braun [Sun, 28 Sep 2008 17:37:15 +0000 (17:37 +0000)]
fix warning
[r22325]
Matthias Braun [Sun, 28 Sep 2008 17:36:57 +0000 (17:36 +0000)]
fix warning in optimized build
[r22324]