{"id":23422011,"url":"https://github.com/sdasgup3/partial-redundancy-elimination","last_synced_at":"2025-10-24T02:02:46.830Z","repository":{"id":15438175,"uuid":"18170897","full_name":"sdasgup3/partial-redundancy-elimination","owner":"sdasgup3","description":"Partial Redundancy Elimination Pass in LLVM","archived":false,"fork":false,"pushed_at":"2019-05-20T17:21:11.000Z","size":23834,"stargazers_count":13,"open_issues_count":1,"forks_count":3,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-12T14:15:41.897Z","etag":null,"topics":["bitvector","common-subexpression-elimination","compiler-optimization","data-flow-analysis","llvm","loop-invariants"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sdasgup3.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-03-27T09:40:09.000Z","updated_at":"2024-10-08T12:18:14.000Z","dependencies_parsed_at":"2022-08-26T05:11:10.980Z","dependency_job_id":null,"html_url":"https://github.com/sdasgup3/partial-redundancy-elimination","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"purl":"pkg:github/sdasgup3/partial-redundancy-elimination","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fpartial-redundancy-elimination","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fpartial-redundancy-elimination/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fpartial-redundancy-elimination/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fpartial-redundancy-elimination/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sdasgup3","download_url":"https://codeload.github.com/sdasgup3/partial-redundancy-elimination/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fpartial-redundancy-elimination/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279002398,"owners_count":26083374,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-09T02:00:07.460Z","response_time":59,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["bitvector","common-subexpression-elimination","compiler-optimization","data-flow-analysis","llvm","loop-invariants"],"created_at":"2024-12-23T02:25:42.593Z","updated_at":"2025-10-10T01:39:42.284Z","avatar_url":"https://github.com/sdasgup3.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![DOI](https://zenodo.org/badge/18170897.svg)](https://zenodo.org/badge/latestdoi/18170897)\n\nPartial Redundancy Elimination (PRE)\n====================================\n\nPRE is a compiler optimization that eliminates\nexpressions that are redundant on some but not necessarily all paths through a\nprogram. We implement a PRE optimization pass in the LLVM framework, and evaluate the benefits \non a variety of applications. PRE is a powerful technique that subsumes \nCommon Subexpression Elimination (CSE) and Loop Invariant Code Motion (LICM), and hence has a potential to \ngreatly improve performance.\n\nCommands\n-------\n\nopts_lcm = \"-mem2reg -loop-rotate -reassociate -lcm  -mem2reg -simplifycfy; \n\n$opt -load $load_pass  $opts_lcm   $test.bc -o  $test-lcm.bc\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsdasgup3%2Fpartial-redundancy-elimination","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsdasgup3%2Fpartial-redundancy-elimination","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsdasgup3%2Fpartial-redundancy-elimination/lists"}