summaryrefslogtreecommitdiffhomepage
Commit message (Collapse)AuthorAge
* Use more canonical name for fp in MemPerm generation.regalloc-compressed-fixesAndreas Fried2021-12-02
|
* Fix RISC-V register encoding.Andreas Fried2021-12-02
|
* Fix generation of MemPerm with new register order.Andreas Fried2021-12-02
| | | | | Since now sp comes at index 13, we can only start there and need to further restrict the arity of the MemPerm.
* Check that entity is present for lui and addi nodes.Andreas Fried2021-12-02
| | | | | | If the nodes were produced as a translation of an IR Const node, they don't have an entity, just an immediate value (and therefore they might be compressible).
* Disable entity location checkingMaximilian Stemmer-Grabow2021-12-02
|
* Check for non-local immediate loadsMaximilian Stemmer-Grabow2021-12-02
|
* Add RISC-V configuration for rv32imac archMaximilian Stemmer-Grabow2021-12-02
|
* riscv: Call ir_lower_mode_b during target lowering.Andreas Fried2021-12-02
| | | | Fixes backend/amd64_modeb.c, opt/ifconv7.c.
* Add compiler options for compression-related parametersMaximilian Stemmer-Grabow2021-12-02
|
* Restrict insertion of compression affinities to nodes with few usesMaximilian Stemmer-Grabow2021-12-02
|
* Add function to check for number of usesMaximilian Stemmer-Grabow2021-12-02
|
* Increase scale factor for compression affinitiesMaximilian Stemmer-Grabow2021-12-02
|
* Add cost comparison function that sorts by color compressibilityMaximilian Stemmer-Grabow2021-12-02
| | | | | This is useful for checking stability of the method under permutation of the compressible register indices.
* Add reversed cost comparison functionMaximilian Stemmer-Grabow2021-12-02
|
* Move pruning of affinity edges to regalloc-prune-affinities for nowMaximilian Stemmer-Grabow2021-12-02
|
* Always output compression requirement notes for nowMaximilian Stemmer-Grabow2021-12-02
|
* Rebased: Rename incompressibility flagMaximilian Stemmer-Grabow2021-12-02
|
* Rebased: Prune linked requirements when others are fixedMaximilian Stemmer-Grabow2021-12-02
|
* Rebased: ignore pruned edgesMaximilian Stemmer-Grabow2021-12-02
|
* Rebased: Add pruned property to affinity edgesMaximilian Stemmer-Grabow2021-12-02
|
* Rename assembly notesMaximilian Stemmer-Grabow2021-12-02
|
* Port fix of color costs from regalloc-prune-compression-reqs branchMaximilian Stemmer-Grabow2021-12-02
|
* Add additional notes in generated assembly with compression infoMaximilian Stemmer-Grabow2021-12-02
|
* Incorporate compressible use count in adjustment of register costsMaximilian Stemmer-Grabow2021-12-02
|
* Calculate the number of uses with compressibility register requirementsMaximilian Stemmer-Grabow2021-12-02
|
* Add function to check for uses with a compression requirementMaximilian Stemmer-Grabow2021-12-02
|
* Alter register cost adjustment for incompressible registersMaximilian Stemmer-Grabow2021-12-02
|
* Adjust debugging outputMaximilian Stemmer-Grabow2021-12-02
|
* Adjust compressibility influence in copy opt heuristicMaximilian Stemmer-Grabow2021-12-02
|
* Add incomplete method to check number of value uses for nodesMaximilian Stemmer-Grabow2021-12-02
|
* Remove outdated code comment in RISC-V emitterMaximilian Stemmer-Grabow2021-12-02
|
* Allow multiple text notes to be added to nodes by the backendMaximilian Stemmer-Grabow2021-12-02
| | | | | These notes are emitted as part of the debugging info included in verbose ASM output
* Output more verbose debugging information for color cost adjustmentsMaximilian Stemmer-Grabow2021-12-02
|
* Remove outdated code notesMaximilian Stemmer-Grabow2021-12-02
|
* Adjust affinity costs in weight recalculationMaximilian Stemmer-Grabow2021-12-02
|
* Add compressibility information to nodes before emitting themMaximilian Stemmer-Grabow2021-12-02
| | | | | This uses the `backend_info_t` note field which can be included in the assembly output alongside source location information.
* Add function to check for node compressibility in RISC-VMaximilian Stemmer-Grabow2021-12-02
| | | | | This can be used after register allocation is finished to collect information about which nodes' compression requirements were satisfied.
* Adjust const qualifiersMaximilian Stemmer-Grabow2021-12-02
|
* Guard against unset registers when checking for compressibilityMaximilian Stemmer-Grabow2021-12-02
|
* Reorder construction of copy optimization affinity graphMaximilian Stemmer-Grabow2021-12-02
|
* Output backend notes on nodes in verbose assembler outputMaximilian Stemmer-Grabow2021-12-02
|
* Allow notes to be added to nodes by the backend for debugging purposesMaximilian Stemmer-Grabow2021-12-02
| | | | | | These notes are stored in the `backend_info_t` struct which contains backend-specific information like register requirements and architecture-specific flags as well as schedule information.
* Convert copy optimization heuristic chunk weights to floating pointMaximilian Stemmer-Grabow2021-12-02
| | | | | | | | | | | | | This allows the weights of the edges that contribute to the weights to be scaled with sub-integer precision, which is required for more fine-grained control over weights for different types of edges in affinity graphs. Weights are used as priorities in priority queues in the heuristic and the used priority queue implementation only allows integer priorities. In those cases where weights are very close and differ only by sub-integer values, we do not depend on their exact ordering in the queue, so we keep integer precision in those cases.
* Add attribute for pruning edgesMaximilian Stemmer-Grabow2021-12-02
|
* Correct typo in chunk documentationMaximilian Stemmer-Grabow2021-12-02
|
* Adjust influence of compressibility metricMaximilian Stemmer-Grabow2021-12-02
|
* Remove superfluous header importMaximilian Stemmer-Grabow2021-12-02
|
* Adjust color costs in copy optimization based on compressible registersMaximilian Stemmer-Grabow2021-12-02
|
* Move scaling of compression-related affinity edges to copy opt heuristicMaximilian Stemmer-Grabow2021-12-02
|
* Fix documentation strings for copy optimization typesMaximilian Stemmer-Grabow2021-12-02
|