├── .github └── workflows │ └── master.yml ├── .gitignore ├── CMakeLists.txt ├── LICENSE ├── README.md ├── assets └── logo.png ├── example ├── test.cpp ├── test.ll ├── test2.cpp └── test2.ll ├── googletest └── CMakeLists.txt.in ├── include ├── BoolExpr.h ├── Interval.h ├── IntervalAnalysis.h ├── IntervalSolver.h ├── IntervalSymbols.h └── Ternary.h ├── src └── Main.cpp └── test ├── IntervalSolverTest.cpp ├── IntervalTest.cpp └── TernaryTest.cpp /.github/workflows/master.yml: -------------------------------------------------------------------------------- 1 | name: Build 2 | 3 | on: 4 | push: 5 | paths-ignore: 6 | - 'README.md' 7 | 8 | jobs: 9 | build: 10 | runs-on: ubuntu-20.04 11 | steps: 12 | - uses: actions/checkout@v2 13 | - name: install llvm 14 | run: sudo apt install llvm-10-dev 15 | - name: generate build script 16 | run: cmake . 17 | - name: build project 18 | run: make all 19 | - name: run unit testing 20 | run: make test 21 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # User ================================ 2 | .idea/ 3 | 4 | # Clion ================================ 5 | # Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and WebStorm 6 | # Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 7 | 8 | # User-specific stuff 9 | .idea/**/workspace.xml 10 | .idea/**/tasks.xml 11 | .idea/**/usage.statistics.xml 12 | .idea/**/dictionaries 13 | .idea/**/shelf 14 | 15 | # Generated files 16 | .idea/**/contentModel.xml 17 | 18 | # Sensitive or high-churn files 19 | .idea/**/dataSources/ 20 | .idea/**/dataSources.ids 21 | .idea/**/dataSources.local.xml 22 | .idea/**/sqlDataSources.xml 23 | .idea/**/dynamic.xml 24 | .idea/**/uiDesigner.xml 25 | .idea/**/dbnavigator.xml 26 | 27 | # Gradle 28 | .idea/**/gradle.xml 29 | .idea/**/libraries 30 | 31 | # Gradle and Maven with auto-import 32 | # When using Gradle or Maven with auto-import, you should exclude module files, 33 | # since they will be recreated, and may cause churn. Uncomment if using 34 | # auto-import. 35 | # .idea/modules.xml 36 | # .idea/*.iml 37 | # .idea/modules 38 | # *.iml 39 | # *.ipr 40 | 41 | # CMake 42 | cmake-build-*/ 43 | 44 | # Mongo Explorer plugin 45 | .idea/**/mongoSettings.xml 46 | 47 | # File-based project format 48 | *.iws 49 | 50 | # IntelliJ 51 | out/ 52 | 53 | # mpeltonen/sbt-idea plugin 54 | .idea_modules/ 55 | 56 | # JIRA plugin 57 | atlassian-ide-plugin.xml 58 | 59 | # Cursive Clojure plugin 60 | .idea/replstate.xml 61 | 62 | # Crashlytics plugin (for Android Studio and IntelliJ) 63 | com_crashlytics_export_strings.xml 64 | crashlytics.properties 65 | crashlytics-build.properties 66 | fabric.properties 67 | 68 | # Editor-based Rest Client 69 | .idea/httpRequests 70 | 71 | # Android studio 3.1+ serialized cache file 72 | .idea/caches/build_file_checksums.ser 73 | 74 | # vscode ================================ 75 | .vscode/* 76 | !.vscode/settings.json 77 | !.vscode/tasks.json 78 | !.vscode/launch.json 79 | !.vscode/extensions.json 80 | 81 | # C++ ================================ 82 | Prerequisites 83 | *.d 84 | 85 | # Compiled Object files 86 | *.slo 87 | *.lo 88 | *.o 89 | *.obj 90 | 91 | # Precompiled Headers 92 | *.gch 93 | *.pch 94 | 95 | # Compiled Dynamic libraries 96 | *.so 97 | *.dylib 98 | *.dll 99 | 100 | # Fortran module files 101 | *.mod 102 | *.smod 103 | 104 | # Compiled Static libraries 105 | *.lai 106 | *.la 107 | *.a 108 | *.lib 109 | 110 | # Executables 111 | *.exe 112 | *.out 113 | *.app 114 | 115 | 116 | # CMake ================================ 117 | bin/ 118 | build/ 119 | CMakeLists.txt.user 120 | CMakeCache.txt 121 | CMakeFiles 122 | CMakeScripts 123 | Testing 124 | Makefile 125 | cmake_install.cmake 126 | install_manifest.txt 127 | compile_commands.json 128 | CTestTestfile.cmake 129 | -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.16) 2 | 3 | configure_file(googletest/CMakeLists.txt.in googletest-download/CMakeLists.txt) 4 | execute_process(COMMAND ${CMAKE_COMMAND} -G "${CMAKE_GENERATOR}" . 5 | RESULT_VARIABLE result 6 | WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/googletest-download ) 7 | if(result) 8 | message(FATAL_ERROR "CMake step for googletest failed: ${result}") 9 | endif() 10 | execute_process(COMMAND ${CMAKE_COMMAND} --build . 11 | RESULT_VARIABLE result 12 | WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/googletest-download ) 13 | if(result) 14 | message(FATAL_ERROR "Build step for googletest failed: ${result}") 15 | endif() 16 | 17 | set(gtest_force_shared_crt ON CACHE BOOL "" FORCE) 18 | 19 | add_subdirectory(${CMAKE_CURRENT_BINARY_DIR}/googletest-src 20 | ${CMAKE_CURRENT_BINARY_DIR}/googletest-build 21 | EXCLUDE_FROM_ALL) 22 | 23 | project(codepunk) 24 | 25 | find_package(LLVM 10 REQUIRED CONFIG) 26 | 27 | message(STATUS "Found LLVM ${LLVM_PACKAGE_VERSION}") 28 | message(STATUS "Using LLVMConfig.cmake in: ${LLVM_DIR}") 29 | 30 | set(CMAKE_CXX_STANDARD 20) 31 | 32 | file(GLOB TU_LIST src/*.cpp) 33 | file(GLOB TEST_LIST test/*.cpp) 34 | 35 | llvm_map_components_to_libnames(llvm_libs support core irreader) 36 | 37 | add_executable(codepunk ${TU_LIST}) 38 | 39 | target_compile_definitions(codepunk PRIVATE ${LLVM_DEFINITIONS}) 40 | target_include_directories(codepunk PRIVATE ${LLVM_INCLUDE_DIRS} include) 41 | target_link_libraries(codepunk ${llvm_libs}) 42 | 43 | add_executable(codepunk_test ${TEST_LIST}) 44 | 45 | target_compile_definitions(codepunk_test PRIVATE ${LLVM_DEFINITIONS}) 46 | target_include_directories(codepunk_test PRIVATE ${LLVM_INCLUDE_DIRS} include) 47 | target_link_libraries(codepunk_test ${llvm_libs} gtest_main) 48 | 49 | include(GoogleTest) 50 | enable_testing() 51 | gtest_add_tests(TARGET codepunk_test) 52 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ![logo](assets/logo.png) 2 | 3 | [![GitHub](https://img.shields.io/github/license/PragmaTwice/codepunk)](https://www.gnu.org/licenses/gpl-3.0.html) 4 | [![Project Status: WIP – Initial development is in progress, but there has not yet been a stable, usable release suitable for the public.](https://www.repostatus.org/badges/latest/wip.svg)](https://www.repostatus.org/#wip) 5 | [![Github Actions](https://github.com/PragmaTwice/codepunk/workflows/Build/badge.svg)](https://github.com/PragmaTwice/codepunk/actions) 6 | 7 | *a little interval analysis tool on LLVM IR* 8 | 9 | ## Dependencies 10 | 11 | - LLVM ([releases/10.x](https://github.com/llvm/llvm-project/tree/release/10.x)) 12 | - GoogleTest ([master](https://github.com/google/googletest/tree/master)) 13 | 14 | ## Algorithm 15 | 16 | - interval analysis via abstract interpretation 17 | - dataflow iterating in regard for path conditions 18 | 19 | ## Worklist 20 | 21 | - more arthmetic/terminator instruction support 22 | - interprocedural analysis via context sensitive 23 | - more pattern support for interval solving 24 | - modeling for array/heap memory 25 | - unsigned integer support 26 | - floating point support 27 | -------------------------------------------------------------------------------- /assets/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/PragmaTwice/codepunk/780101043e1ede7af45d574d0e3aaa0675ef69cf/assets/logo.png -------------------------------------------------------------------------------- /example/test.cpp: -------------------------------------------------------------------------------- 1 | int foo(int y) { 2 | int x = 0; 3 | 4 | if(y < 10) return 0; 5 | 6 | while(x < y) { 7 | x ++; 8 | y -= 2; 9 | } 10 | 11 | return x * y; 12 | } 13 | -------------------------------------------------------------------------------- /example/test.ll: -------------------------------------------------------------------------------- 1 | ; ModuleID = 'test.cpp' 2 | source_filename = "test.cpp" 3 | target datalayout = "e-m:w-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128" 4 | target triple = "x86_64-pc-windows-msvc19.26.28806" 5 | 6 | ; Function Attrs: noinline nounwind optnone uwtable 7 | define dso_local i32 @"?foo@@YAHH@Z"(i32 %y) #0 { 8 | entry: 9 | %retval = alloca i32, align 4 10 | %y.addr = alloca i32, align 4 11 | %x = alloca i32, align 4 12 | store i32 %y, i32* %y.addr, align 4 13 | store i32 0, i32* %x, align 4 14 | %0 = load i32, i32* %y.addr, align 4 15 | %cmp = icmp slt i32 %0, 10 16 | br i1 %cmp, label %if.then, label %if.end 17 | 18 | if.then: ; preds = %entry 19 | store i32 0, i32* %retval, align 4 20 | br label %return 21 | 22 | if.end: ; preds = %entry 23 | br label %while.cond 24 | 25 | while.cond: ; preds = %while.body, %if.end 26 | %1 = load i32, i32* %x, align 4 27 | %2 = load i32, i32* %y.addr, align 4 28 | %cmp1 = icmp slt i32 %1, %2 29 | br i1 %cmp1, label %while.body, label %while.end 30 | 31 | while.body: ; preds = %while.cond 32 | %3 = load i32, i32* %x, align 4 33 | %inc = add nsw i32 %3, 1 34 | store i32 %inc, i32* %x, align 4 35 | %4 = load i32, i32* %y.addr, align 4 36 | %sub = sub nsw i32 %4, 2 37 | store i32 %sub, i32* %y.addr, align 4 38 | br label %while.cond 39 | 40 | while.end: ; preds = %while.cond 41 | %5 = load i32, i32* %x, align 4 42 | %6 = load i32, i32* %y.addr, align 4 43 | %mul = mul nsw i32 %5, %6 44 | store i32 %mul, i32* %retval, align 4 45 | br label %return 46 | 47 | return: ; preds = %while.end, %if.then 48 | %7 = load i32, i32* %retval, align 4 49 | ret i32 %7 50 | } 51 | 52 | attributes #0 = { noinline nounwind optnone uwtable "correctly-rounded-divide-sqrt-fp-math"="false" "disable-tail-calls"="false" "frame-pointer"="none" "less-precise-fpmad"="false" "min-legal-vector-width"="0" "no-infs-fp-math"="false" "no-jump-tables"="false" "no-nans-fp-math"="false" "no-signed-zeros-fp-math"="false" "no-trapping-math"="false" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "unsafe-fp-math"="false" "use-soft-float"="false" } 53 | 54 | !llvm.module.flags = !{!0, !1} 55 | !llvm.ident = !{!2} 56 | 57 | !0 = !{i32 1, !"wchar_size", i32 2} 58 | !1 = !{i32 7, !"PIC Level", i32 2} 59 | !2 = !{!"clang version 10.0.0 "} 60 | -------------------------------------------------------------------------------- /example/test2.cpp: -------------------------------------------------------------------------------- 1 | int foo(int x) { 2 | if(x > 10 && x < 22) { 3 | return x; 4 | } 5 | 6 | return 0; 7 | } -------------------------------------------------------------------------------- /example/test2.ll: -------------------------------------------------------------------------------- 1 | ; ModuleID = 'test2.cpp' 2 | source_filename = "test2.cpp" 3 | target datalayout = "e-m:w-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128" 4 | target triple = "x86_64-pc-windows-msvc19.26.28806" 5 | 6 | ; Function Attrs: noinline nounwind optnone uwtable 7 | define dso_local i32 @"?foo@@YAHH@Z"(i32 %x) #0 { 8 | entry: 9 | %retval = alloca i32, align 4 10 | %x.addr = alloca i32, align 4 11 | store i32 %x, i32* %x.addr, align 4 12 | %0 = load i32, i32* %x.addr, align 4 13 | %cmp = icmp sgt i32 %0, 10 14 | br i1 %cmp, label %land.lhs.true, label %if.end 15 | 16 | land.lhs.true: ; preds = %entry 17 | %1 = load i32, i32* %x.addr, align 4 18 | %cmp1 = icmp slt i32 %1, 22 19 | br i1 %cmp1, label %if.then, label %if.end 20 | 21 | if.then: ; preds = %land.lhs.true 22 | %2 = load i32, i32* %x.addr, align 4 23 | store i32 %2, i32* %retval, align 4 24 | br label %return 25 | 26 | if.end: ; preds = %land.lhs.true, %entry 27 | store i32 0, i32* %retval, align 4 28 | br label %return 29 | 30 | return: ; preds = %if.end, %if.then 31 | %3 = load i32, i32* %retval, align 4 32 | ret i32 %3 33 | } 34 | 35 | attributes #0 = { noinline nounwind optnone uwtable "correctly-rounded-divide-sqrt-fp-math"="false" "disable-tail-calls"="false" "frame-pointer"="none" "less-precise-fpmad"="false" "min-legal-vector-width"="0" "no-infs-fp-math"="false" "no-jump-tables"="false" "no-nans-fp-math"="false" "no-signed-zeros-fp-math"="false" "no-trapping-math"="false" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "unsafe-fp-math"="false" "use-soft-float"="false" } 36 | 37 | !llvm.module.flags = !{!0, !1} 38 | !llvm.ident = !{!2} 39 | 40 | !0 = !{i32 1, !"wchar_size", i32 2} 41 | !1 = !{i32 7, !"PIC Level", i32 2} 42 | !2 = !{!"clang version 10.0.0 "} 43 | -------------------------------------------------------------------------------- /googletest/CMakeLists.txt.in: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.16) 2 | 3 | project(googletest-download NONE) 4 | 5 | include(ExternalProject) 6 | ExternalProject_Add(googletest 7 | GIT_REPOSITORY https://github.com/google/googletest.git 8 | GIT_TAG master 9 | SOURCE_DIR "${CMAKE_CURRENT_BINARY_DIR}/googletest-src" 10 | BINARY_DIR "${CMAKE_CURRENT_BINARY_DIR}/googletest-build" 11 | CONFIGURE_COMMAND "" 12 | BUILD_COMMAND "" 13 | INSTALL_COMMAND "" 14 | TEST_COMMAND "" 15 | ) 16 | -------------------------------------------------------------------------------- /include/BoolExpr.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/6/30. 3 | // 4 | 5 | #ifndef CODEPUNK_BOOLEXPR_H 6 | #define CODEPUNK_BOOLEXPR_H 7 | 8 | #include 9 | #include 10 | #include 11 | 12 | #include 13 | 14 | template 15 | struct BoolExpr { 16 | enum Opcode { Atomic, Not, Or, And, LT, GT, LE, GE, EQ, NE }; 17 | 18 | [[nodiscard]] virtual Opcode getOpcode() const = 0; 19 | 20 | [[nodiscard]] bool isAtom() const { 21 | return getOpcode() == Atomic; 22 | } 23 | 24 | [[nodiscard]] bool isUnaryOp() const { 25 | return getOpcode() == Not; 26 | } 27 | 28 | [[nodiscard]] bool isBinaryOp() const { 29 | return getOpcode() > Not; 30 | } 31 | 32 | [[nodiscard]] bool isBinaryLogicOp() const { 33 | return getOpcode() > Not && getOpcode() <= And; 34 | } 35 | 36 | [[nodiscard]] bool isBinaryRelationOp() const { 37 | return getOpcode() > And && getOpcode() <= NE; 38 | } 39 | }; 40 | 41 | template 42 | struct Atom : BoolExpr { 43 | V v; 44 | 45 | explicit Atom(const V& v) : v(v) {} 46 | 47 | [[nodiscard]] typename BoolExpr::Opcode getOpcode() const override { 48 | return Atom::Atomic; 49 | } 50 | }; 51 | 52 | template 53 | struct NotOp : BoolExpr { 54 | std::shared_ptr> v; 55 | 56 | explicit NotOp(const std::shared_ptr>& v) : v(v) { 57 | assert(!v->isAtom()); 58 | } 59 | 60 | [[nodiscard]] typename BoolExpr::Opcode getOpcode() const override { 61 | return NotOp::Not; 62 | } 63 | }; 64 | 65 | template 66 | struct BinOp : BoolExpr { 67 | using Opcode = typename BoolExpr::Opcode; 68 | 69 | Opcode code; 70 | std::shared_ptr> l, r; 71 | 72 | BinOp(Opcode code, 73 | const std::shared_ptr>& l, 74 | const std::shared_ptr>& r 75 | ) : code(code), l(l), r(r) { 76 | assert(BoolExpr::isBinaryOp()); 77 | 78 | if(BoolExpr::isBinaryLogicOp()) { 79 | assert(!l->isAtom() && !r->isAtom()); 80 | } else if(BoolExpr::isBinaryRelationOp()) { 81 | assert(l->isAtom() && r->isAtom()); 82 | } 83 | } 84 | 85 | [[nodiscard]] Opcode getOpcode() const override { 86 | return code; 87 | } 88 | 89 | BinOp reverse() const { 90 | static Opcode revCode[] = { 91 | BinOp::Atomic, BinOp::Not, BinOp::And, BinOp::Or, 92 | BinOp::GE, BinOp::LE, BinOp::GT, BinOp::LT, BinOp::NE, BinOp::EQ 93 | }; 94 | 95 | return {revCode[code], l, r}; 96 | } 97 | }; 98 | 99 | template 100 | struct OrOp : BinOp { 101 | OrOp(const std::shared_ptr>& l, const std::shared_ptr>& r) 102 | : BinOp(OrOp::Or, l, r) {} 103 | }; 104 | 105 | template 106 | struct AndOp : BinOp { 107 | AndOp(const std::shared_ptr>& l, const std::shared_ptr>& r) 108 | : BinOp(AndOp::And, l, r) {} 109 | }; 110 | 111 | 112 | #endif //CODEPUNK_BOOLEXPR_H 113 | -------------------------------------------------------------------------------- /include/Interval.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/6/29. 3 | // 4 | 5 | #ifndef CODEPUNK_INTERVAL_H 6 | #define CODEPUNK_INTERVAL_H 7 | 8 | #include "Ternary.h" 9 | 10 | #include 11 | #include 12 | 13 | #include 14 | 15 | 16 | using llvm::APInt; 17 | using llvm::APSInt; 18 | 19 | template 20 | struct IntervalSolver; 21 | 22 | struct Interval { 23 | private: 24 | APSInt l, r; 25 | 26 | template 27 | friend struct IntervalSolver; 28 | 29 | public: 30 | Interval() = default; 31 | 32 | Interval(APSInt l, APSInt r) : l(std::move(l)), r(std::move(r)) {} 33 | Interval(const APInt &l, const APInt &r, bool isUnsigned = false) 34 | : l(l, isUnsigned), r(r, isUnsigned) {} 35 | 36 | explicit Interval(const APSInt& c) : l(c), r(c) {} 37 | explicit Interval(const APInt& c, bool isUnsigned = false) : l(c, isUnsigned), r(c, isUnsigned) {} 38 | 39 | [[nodiscard]] bool isValid() const { 40 | return l <= r; 41 | } 42 | 43 | [[nodiscard]] const APSInt &getLeft() const { 44 | return l; 45 | } 46 | 47 | [[nodiscard]] const APSInt &getRight() const { 48 | return r; 49 | } 50 | 51 | [[nodiscard]] bool contains(const APSInt& v) const { 52 | return l <= v && v <= r; 53 | } 54 | 55 | [[nodiscard]] bool contains(const Interval& v) const { 56 | return l <= v.l && v.r <= r; 57 | } 58 | 59 | [[nodiscard]] bool equals(const Interval& v) const { 60 | return l == v.l && r == v.r; 61 | } 62 | 63 | [[nodiscard]] bool equals(const APSInt& v) const { 64 | return l == v && r == v; 65 | } 66 | 67 | [[nodiscard]] bool overlaps(const Interval& v) const { 68 | return r >= v.l && l <= v.r; 69 | } 70 | 71 | [[nodiscard]] bool isConstant() const { 72 | return l == r; 73 | } 74 | 75 | APSInt length() const { 76 | return r - l; 77 | } 78 | 79 | friend Interval operator&(const Interval& a, const Interval& b) { 80 | return {std::max(a.l, b.l), std::min(a.r, b.r)}; 81 | } 82 | 83 | friend Interval operator|(const Interval& a, const Interval& b) { 84 | return {std::min(a.l, b.l), std::max(a.r, b.r)}; 85 | } 86 | 87 | friend Interval operator+(const Interval& a, const Interval& b) { 88 | return {a.l + b.l, a.r + b.r}; 89 | } 90 | 91 | friend Interval operator-(const Interval& a, const Interval& b) { 92 | return {a.l - b.r, a.r - b.l}; 93 | } 94 | 95 | friend Interval operator*(const Interval& a, const Interval& b) { 96 | auto list = {a.l*b.l, a.l*b.r, a.r*b.l, a.r*b.r}; 97 | return {std::min(list), std::max(list)}; 98 | } 99 | 100 | friend Interval operator/(const Interval& a, const Interval& b) { 101 | auto list = {a.l/b.l, a.l/b.r, a.r/b.l, a.r/b.r}; 102 | return {std::min(list), std::max(list)}; 103 | } 104 | 105 | friend Ternary operator==(const Interval& a, const Interval& b) { 106 | if(a.isConstant() && b.isConstant()) { 107 | return Ternary{ a.l == b.l }; 108 | } 109 | 110 | if(!a.overlaps(b)) { 111 | return Ternary::False; 112 | } 113 | 114 | return {}; 115 | } 116 | 117 | friend Ternary operator!=(const Interval& a, const Interval& b) { 118 | return !(a == b); 119 | } 120 | 121 | friend Ternary operator<(const Interval& a, const Interval& b) { 122 | if(a.r < b.l) return Ternary::True; 123 | if(a.l >= b.r) return Ternary::False; 124 | 125 | return {}; 126 | } 127 | 128 | friend Ternary operator<=(const Interval& a, const Interval& b) { 129 | if(a.r <= b.l) return Ternary::True; 130 | if(a.l > b.r) return Ternary::False; 131 | 132 | return {}; 133 | } 134 | 135 | friend Ternary operator>(const Interval& a, const Interval& b) { 136 | return !(a <= b); 137 | } 138 | 139 | friend Ternary operator>=(const Interval& a, const Interval& b) { 140 | return !(a < b); 141 | } 142 | 143 | friend llvm::raw_ostream &operator<<(llvm::raw_ostream& o, const Interval& v) { 144 | return o << "[" << v.l << "," << v.r << "]"; 145 | } 146 | 147 | }; 148 | 149 | #endif //CODEPUNK_INTERVAL_H 150 | -------------------------------------------------------------------------------- /include/IntervalAnalysis.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/7/1. 3 | // 4 | 5 | #ifndef CODEPUNK_INTERVALANALYSIS_H 6 | #define CODEPUNK_INTERVALANALYSIS_H 7 | 8 | #include 9 | #include 10 | #include 11 | 12 | #include 13 | #include 14 | #include 15 | 16 | struct IntervalAnalysis { 17 | using Symbols = IntervalSymbols; 18 | 19 | std::map dataMap; 20 | std::queue workList; 21 | 22 | explicit IntervalAnalysis(const llvm::Function* f) { 23 | for(const auto &bb : f->getBasicBlockList()) { 24 | dataMap.emplace(&bb, Symbols{}); 25 | workList.push(&bb); 26 | } 27 | 28 | auto &entrySymbols = dataMap.at(&f->getEntryBlock()); 29 | for(const auto& i : f->args()) { 30 | auto ty = i.getType(); 31 | if(ty->isIntegerTy()) { 32 | entrySymbols.emplace((llvm::Value*)&i, Interval( 33 | APSInt::getMinValue(ty->getIntegerBitWidth(), false), 34 | APSInt::getMaxValue(ty->getIntegerBitWidth(), false))); 35 | } 36 | } 37 | } 38 | 39 | void analyze(int maxIteration = -1) { 40 | while(!workList.empty() && maxIteration != 0) { 41 | iterate(); 42 | maxIteration--; 43 | } 44 | } 45 | 46 | void iterate() { 47 | auto bb = workList.front(); 48 | workList.pop(); 49 | 50 | auto oldSymbols = dataMap.at(bb); 51 | 52 | auto mergedSymbols = oldSymbols; 53 | if(bb->hasNPredecessorsOrMore(1)) { 54 | mergedSymbols = merge(std::vector{ 55 | llvm::pred_begin(bb), llvm::pred_end(bb)}, bb); 56 | } 57 | 58 | auto newSymbols = transfer(bb, mergedSymbols); 59 | dataMap.at(bb) = newSymbols; 60 | 61 | if(newSymbols != oldSymbols) { 62 | for(auto succBb : llvm::successors(bb)) { 63 | workList.push(succBb); 64 | } 65 | } 66 | } 67 | 68 | Symbols merge(const std::vector& vec, const llvm::BasicBlock *to) { 69 | return std::accumulate(vec.begin(), vec.end(), Symbols{}, [this, to]( 70 | const Symbols& symbols, const llvm::BasicBlock* bb) { 71 | auto bbSymbols = dataMap.at(bb), newSymbols = symbols | bbSymbols; 72 | auto term = bb->getTerminator(); 73 | 74 | if(term->getOpcode() == llvm::Instruction::Br && term->getNumOperands() >= 3) { 75 | auto cond = term->getOperand(0), t = term->getOperand(1), f = term->getOperand(2); 76 | 77 | auto condVal = bbSymbols.at(cond); 78 | if(condVal.equals(APSInt(1, false))) { 79 | newSymbols = symbols; 80 | } 81 | else if(condVal.length() != 0) { 82 | if(auto cmpInst = llvm::dyn_cast(cond)) { 83 | auto l = cmpInst->getOperand(0), r = cmpInst->getOperand(1); 84 | auto pred = cmpInstToBoolExpr(cmpInst->getPredicate()); 85 | 86 | if(pred != BoolExpr::Atomic) { 87 | auto condExpr = std::make_shared>( 88 | pred, 89 | std::make_shared>(l), 90 | std::make_shared>(r)); 91 | 92 | IntervalSolver solver{ 93 | std::make_shared>(bbSymbols), condExpr}; 94 | 95 | auto solvedSymbols = solver.solve(t != to); 96 | 97 | if(auto lLoad = llvm::dyn_cast(l); 98 | lLoad && lLoad->getOpcode() == llvm::Instruction::Load) { 99 | auto lLFrom = lLoad->getOperand(0), lLTo = (llvm::Value*)lLoad; 100 | solvedSymbols.at(lLFrom) = solvedSymbols.at(lLTo); 101 | } 102 | if(auto rLoad = llvm::dyn_cast(r); 103 | rLoad && rLoad->getOpcode() == llvm::Instruction::Load) { 104 | auto rLFrom = rLoad->getOperand(0), rLTo = (llvm::Value*)rLoad; 105 | solvedSymbols.at(rLFrom) = solvedSymbols.at(rLTo); 106 | } 107 | 108 | newSymbols = symbols | solvedSymbols; 109 | } 110 | } 111 | } 112 | } 113 | 114 | return newSymbols; 115 | }); 116 | } 117 | 118 | template 119 | static typename BoolExpr::Opcode cmpInstToBoolExpr(llvm::CmpInst::Predicate p) { 120 | switch (p) { 121 | case llvm::CmpInst::ICMP_EQ: 122 | return BoolExpr::EQ; 123 | case llvm::CmpInst::ICMP_NE: 124 | return BoolExpr::NE; 125 | case llvm::CmpInst::ICMP_SLT: 126 | return BoolExpr::LT; 127 | case llvm::CmpInst::ICMP_SLE: 128 | return BoolExpr::LE; 129 | case llvm::CmpInst::ICMP_SGT: 130 | return BoolExpr::GT; 131 | case llvm::CmpInst::ICMP_SGE: 132 | return BoolExpr::GE; 133 | default: 134 | return BoolExpr::Atomic; 135 | } 136 | } 137 | 138 | static Symbols transfer(const llvm::BasicBlock *bb, Symbols& symbols) { 139 | for(const auto &inst : bb->getInstList()) { 140 | switch (inst.getOpcode()) { 141 | case llvm::Instruction::Alloca: { 142 | auto ty = inst.getType()->getPointerElementType(); 143 | if(ty->isIntegerTy()) { 144 | symbols[&inst] = Interval( 145 | APSInt::getMinValue(ty->getIntegerBitWidth(), false), 146 | APSInt::getMaxValue(ty->getIntegerBitWidth(), false)); 147 | } 148 | break; 149 | } 150 | case llvm::Instruction::Store: { 151 | auto from = inst.getOperand(0), to = inst.getOperand(1); 152 | auto ty = to->getType()->getPointerElementType(); 153 | 154 | if(!ty->isIntegerTy()) { 155 | break; 156 | } 157 | 158 | symbols.at(to) = fromSymbolOrConstant(from, symbols); 159 | break; 160 | } 161 | case llvm::Instruction::Load: { 162 | auto from = inst.getOperand(0), to = (llvm::Value*)&inst; 163 | auto ty = from->getType()->getPointerElementType(); 164 | 165 | if(!ty->isIntegerTy()) { 166 | break; 167 | } 168 | 169 | symbols[to] = symbols.at(from); 170 | break; 171 | } 172 | case llvm::Instruction::Add: { 173 | doBinOp(inst, symbols, [](const Interval& a, const Interval& b) { 174 | return a + b; 175 | }); 176 | break; 177 | } 178 | case llvm::Instruction::Sub: { 179 | doBinOp(inst, symbols, [](const Interval& a, const Interval& b) { 180 | return a - b; 181 | }); 182 | break; 183 | } 184 | case llvm::Instruction::Mul: { 185 | doBinOp(inst, symbols, [](const Interval& a, const Interval& b) { 186 | return a * b; 187 | }); 188 | break; 189 | } 190 | case llvm::Instruction::SDiv: { 191 | doBinOp(inst, symbols, [](const Interval& a, const Interval& b) { 192 | return a / b; 193 | }); 194 | break; 195 | } 196 | case llvm::Instruction::ICmp: { 197 | const auto &cmpInst = (const llvm::CmpInst &)inst; 198 | 199 | auto l = inst.getOperand(0), r = inst.getOperand(1); 200 | auto lVal = fromSymbolOrConstant(l, symbols), rVal = fromSymbolOrConstant(r, symbols); 201 | 202 | switch (cmpInst.getPredicate()) { 203 | case llvm::CmpInst::ICMP_EQ: 204 | symbols[&inst] = fromTernary(lVal == rVal); 205 | break; 206 | case llvm::CmpInst::ICMP_NE: 207 | symbols[&inst] = fromTernary(lVal != rVal); 208 | break; 209 | case llvm::CmpInst::ICMP_SLT: 210 | symbols[&inst] = fromTernary(lVal < rVal); 211 | break; 212 | case llvm::CmpInst::ICMP_SLE: 213 | symbols[&inst] = fromTernary(lVal <= rVal); 214 | break; 215 | case llvm::CmpInst::ICMP_SGT: 216 | symbols[&inst] = fromTernary(lVal > rVal); 217 | break; 218 | case llvm::CmpInst::ICMP_SGE: 219 | symbols[&inst] = fromTernary(lVal >= rVal); 220 | break; 221 | default: 222 | break; 223 | } 224 | 225 | break; 226 | } 227 | default: 228 | break; 229 | } 230 | } 231 | 232 | return symbols; 233 | } 234 | 235 | static void doBinOp(const llvm::Instruction &inst, Symbols& symbols, 236 | const std::function& op) { 237 | auto l = inst.getOperand(0), r = inst.getOperand(1); 238 | auto ty = l->getType(); 239 | 240 | if(!ty->isIntegerTy()) { 241 | return; 242 | } 243 | 244 | auto lVal = fromSymbolOrConstant(l, symbols), rVal = fromSymbolOrConstant(r, symbols); 245 | 246 | symbols[&inst] = op(lVal, rVal); 247 | } 248 | 249 | static Interval fromTernary(Ternary t) { 250 | APSInt zero(1, false), one(APInt(1, 1), false); 251 | 252 | switch (t.v) { 253 | case Ternary::True: 254 | return {one, one}; 255 | case Ternary::False: 256 | return {zero, zero}; 257 | case Ternary::Unknown: 258 | return {one, zero}; 259 | } 260 | 261 | return {}; 262 | } 263 | 264 | static Interval fromSymbolOrConstant(const llvm::Value *v, Symbols &symbols) { 265 | if(auto c = llvm::dyn_cast(v)) { 266 | symbols[v] = Interval{ 267 | APSInt(c->getUniqueInteger(), false).extend(v->getType()->getIntegerBitWidth())}; 268 | } 269 | 270 | return symbols.at(v); 271 | } 272 | }; 273 | 274 | #endif //CODEPUNK_INTERVALANALYSIS_H 275 | -------------------------------------------------------------------------------- /include/IntervalSolver.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/6/30. 3 | // 4 | 5 | #ifndef CODEPUNK_INTERVALSOLVER_H 6 | #define CODEPUNK_INTERVALSOLVER_H 7 | 8 | #include 9 | #include 10 | #include 11 | 12 | template 13 | struct IntervalSolver { 14 | using Symbols = IntervalSymbols; 15 | using Expr = BoolExpr; 16 | 17 | std::shared_ptr symbols; 18 | std::shared_ptr expr; 19 | 20 | Symbols solve(bool assume) { 21 | switch (expr->getOpcode()) { 22 | case Expr::Not: 23 | return IntervalSolver{symbols, std::static_pointer_cast>(expr)->v}.solve(!assume); 24 | case Expr::Or: { 25 | auto a = IntervalSolver{symbols, std::static_pointer_cast>(expr)->l}.solve(assume); 26 | auto b = IntervalSolver{symbols, std::static_pointer_cast>(expr)->r}.solve(assume); 27 | 28 | return a | b; 29 | } 30 | case Expr::And: { 31 | auto a = IntervalSolver{symbols, std::static_pointer_cast>(expr)->l}.solve(assume); 32 | auto b = IntervalSolver{symbols, std::static_pointer_cast>(expr)->r}.solve(assume); 33 | 34 | return a & b; 35 | } 36 | case Expr::LT: { 37 | const auto &lKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->l)->v; 38 | const auto &rKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->r)->v; 39 | 40 | const auto &lVal = (*symbols)[lKey], &rVal = (*symbols)[rKey]; 41 | auto newSymbols = *symbols; 42 | 43 | if (assume) { 44 | const auto& One = APSInt(APInt(1, 1), false); 45 | newSymbols[lKey] = Interval{lVal.l, std::min(lVal.r, rVal.r - One)}; 46 | newSymbols[rKey] = Interval{std::max(lVal.l + One, rVal.l), rVal.r}; 47 | } else { 48 | newSymbols[lKey] = Interval{std::max(lVal.l, rVal.l), lVal.r}; 49 | newSymbols[rKey] = Interval{rVal.l, std::min(lVal.r, rVal.r)}; 50 | } 51 | 52 | return newSymbols; 53 | } 54 | case Expr::LE: { 55 | const auto &lKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->l)->v; 56 | const auto &rKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->r)->v; 57 | 58 | const auto &lVal = (*symbols)[lKey], &rVal = (*symbols)[rKey]; 59 | auto newSymbols = *symbols; 60 | 61 | if (assume) { 62 | newSymbols[lKey] = Interval{lVal.l, std::min(lVal.r, rVal.r)}; 63 | newSymbols[rKey] = Interval{std::max(lVal.l, rVal.l), rVal.r}; 64 | } else { 65 | const auto& One = APSInt(APInt(1, 1), false); 66 | newSymbols[lKey] = Interval{std::max(lVal.l, rVal.l + One), lVal.r}; 67 | newSymbols[rKey] = Interval{rVal.l, std::min(lVal.r - One, rVal.r)}; 68 | } 69 | 70 | return newSymbols; 71 | } 72 | case Expr::EQ: { 73 | const auto &lKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->l)->v; 74 | const auto &rKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->r)->v; 75 | 76 | const auto &lVal = (*symbols)[lKey], &rVal = (*symbols)[rKey]; 77 | auto newSymbols = *symbols; 78 | 79 | if (assume) { 80 | auto res = lVal & rVal; 81 | newSymbols[lKey] = res; 82 | newSymbols[rKey] = res; 83 | } else { 84 | const auto& One = APSInt(APInt(1, 1), false); 85 | if(lVal.isConstant()) { 86 | if(lVal.l == rVal.l) newSymbols[rKey] = Interval{rVal.l + One, rVal.r}; 87 | if(lVal.l == rVal.r) newSymbols[rKey] = Interval{rVal.l, rVal.r - One}; 88 | } 89 | if(rVal.isConstant()) { 90 | if(lVal.l == rVal.l) newSymbols[lKey] = Interval{lVal.l + One, lVal.r}; 91 | if(lVal.r == rVal.l) newSymbols[lKey] = Interval{lVal.l, lVal.r - One}; 92 | } 93 | } 94 | 95 | return newSymbols; 96 | } 97 | case Expr::GT: 98 | case Expr::GE: 99 | case Expr::NE: 100 | return IntervalSolver{symbols, 101 | std::make_shared>(std::static_pointer_cast>(expr)->reverse()) 102 | }.solve(!assume); 103 | default: 104 | assert("unreachable"); 105 | return {}; 106 | } 107 | } 108 | 109 | Ternary eval() { 110 | switch (expr->getOpcode()) { 111 | case Expr::Not: 112 | return !IntervalSolver{symbols, std::static_pointer_cast>(expr)->v}.eval(); 113 | case Expr::Or: { 114 | auto a = IntervalSolver{symbols, std::static_pointer_cast>(expr)->l}.eval(); 115 | auto b = IntervalSolver{symbols, std::static_pointer_cast>(expr)->r}.eval(); 116 | 117 | return a || b; 118 | } 119 | case Expr::And: { 120 | auto a = IntervalSolver{symbols, std::static_pointer_cast>(expr)->l}.eval(); 121 | auto b = IntervalSolver{symbols, std::static_pointer_cast>(expr)->r}.eval(); 122 | 123 | return a && b; 124 | } 125 | case Expr::LT: { 126 | const auto &lKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->l)->v; 127 | const auto &rKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->r)->v; 128 | 129 | const auto &lVal = (*symbols)[lKey], &rVal = (*symbols)[rKey]; 130 | 131 | return lVal < rVal; 132 | } 133 | case Expr::LE: { 134 | const auto &lKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->l)->v; 135 | const auto &rKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->r)->v; 136 | 137 | const auto &lVal = (*symbols)[lKey], &rVal = (*symbols)[rKey]; 138 | 139 | return lVal <= rVal; 140 | } 141 | case Expr::EQ: { 142 | const auto &lKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->l)->v; 143 | const auto &rKey = std::static_pointer_cast>(std::static_pointer_cast>(expr)->r)->v; 144 | 145 | const auto &lVal = (*symbols)[lKey], &rVal = (*symbols)[rKey]; 146 | 147 | return lVal == rVal; 148 | } 149 | case Expr::GT: 150 | case Expr::GE: 151 | case Expr::NE: 152 | return !IntervalSolver{symbols, 153 | std::make_shared>(std::static_pointer_cast>(expr)->reverse()) 154 | }.eval(); 155 | default: 156 | assert("unreachable"); 157 | return {}; 158 | } 159 | } 160 | }; 161 | 162 | #endif //CODEPUNK_INTERVALSOLVER_H 163 | -------------------------------------------------------------------------------- /include/IntervalSymbols.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/7/1. 3 | // 4 | 5 | #ifndef CODEPUNK_INTERVALSYMBOLS_H 6 | #define CODEPUNK_INTERVALSYMBOLS_H 7 | 8 | #include 9 | #include 10 | #include 11 | 12 | template 13 | struct IntervalSymbols : std::map { 14 | using std::map::map; 15 | 16 | static IntervalSymbols symbolOp(const std::function& op, 17 | const IntervalSymbols& a, const IntervalSymbols& b, 18 | bool addUniqueItem = true) { 19 | IntervalSymbols symbols; 20 | 21 | for(const auto &v : a) { 22 | if(auto iter = b.find(v.first); iter != b.end()) { 23 | symbols.emplace(v.first, op(v.second, iter->second)); 24 | } else if(addUniqueItem) { 25 | symbols.emplace(v); 26 | } 27 | } 28 | 29 | for(const auto &v : b) { 30 | if(addUniqueItem && a.find(v.first) == a.end()) { 31 | symbols.emplace(v); 32 | } 33 | } 34 | 35 | return symbols; 36 | }; 37 | 38 | friend IntervalSymbols operator|(const IntervalSymbols& a, const IntervalSymbols& b) { 39 | return symbolOp([](const Interval& a, const Interval& b) { return a | b; }, a, b); 40 | }; 41 | 42 | friend IntervalSymbols operator&(const IntervalSymbols& a, const IntervalSymbols& b) { 43 | return symbolOp([](const Interval& a, const Interval& b) { return a & b; }, a, b, false); 44 | }; 45 | }; 46 | 47 | #endif //CODEPUNK_INTERVALSYMBOLS_H 48 | -------------------------------------------------------------------------------- /include/Ternary.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/6/30. 3 | // 4 | 5 | #ifndef CODEPUNK_TERNARY_H 6 | #define CODEPUNK_TERNARY_H 7 | 8 | #include 9 | 10 | struct Ternary { 11 | enum Type : char {Unknown, False, True} v; 12 | 13 | Ternary() : v(Unknown) {} 14 | Ternary(Type v) : v(v) {} 15 | 16 | explicit Ternary(bool b) : v(b ? True : False) {} 17 | 18 | friend llvm::raw_ostream &operator<<(llvm::raw_ostream& o, Ternary t) { 19 | return o << t.v; 20 | } 21 | 22 | explicit operator bool() const { 23 | return v == True; 24 | } 25 | 26 | [[nodiscard]] bool equals(Ternary t) const { 27 | return t.v == v; 28 | } 29 | 30 | friend Ternary operator==(Ternary a, Ternary b) { 31 | if(a.v == Unknown || b.v == Unknown) return Unknown; 32 | return Ternary(a.v == b.v); 33 | } 34 | 35 | friend Ternary operator!=(Ternary a, Ternary b) { 36 | return !(a == b); 37 | } 38 | 39 | friend Ternary operator!(Ternary t) { 40 | switch (t.v) { 41 | case True: 42 | return False; 43 | case False: 44 | return True; 45 | default: 46 | return Unknown; 47 | } 48 | } 49 | 50 | friend Ternary operator&&(Ternary a, Ternary b) { 51 | if(a.v == False || b.v == False) return False; 52 | if(a.v == Unknown || b.v == Unknown) return Unknown; 53 | 54 | return True; 55 | } 56 | 57 | friend Ternary operator||(Ternary a, Ternary b) { 58 | if(a.v == True || b.v == True) return True; 59 | if(a.v == Unknown || b.v == Unknown) return Unknown; 60 | 61 | return False; 62 | } 63 | }; 64 | 65 | #endif //CODEPUNK_TERNARY_H 66 | -------------------------------------------------------------------------------- /src/Main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | #include "IntervalAnalysis.h" 10 | 11 | using namespace llvm; 12 | 13 | static cl::opt InputFilename(cl::Positional, cl::desc("filename of LLVM IR input")); 14 | static cl::opt MaxIteration("iterate", cl::desc("max iteration count"), 15 | cl::value_desc("number"), cl::init(-1)); 16 | 17 | raw_ostream &operator<<(raw_ostream& o, const Value *v) { 18 | if(v->hasName()) { 19 | return o << v->getName() << " <" << (void *)v << ">"; 20 | } 21 | if(auto c = dyn_cast(v)) { 22 | return o << c->getUniqueInteger() << " <" << (void *)v << ">"; 23 | } 24 | 25 | return o << (void *)v; 26 | } 27 | 28 | void analyze(const Function* f, int maxIteration) { 29 | IntervalAnalysis analysis(f); 30 | analysis.analyze(maxIteration); 31 | 32 | outs() << f->getName() << ":\n"; 33 | for(const auto& v : f->args()) { 34 | outs() << " | " << &v; 35 | } 36 | outs() << "\n"; 37 | for(const auto& bb : f->getBasicBlockList()) { 38 | outs() << " [" << &bb << "]\n"; 39 | 40 | for(const auto& inst : bb.getInstList()) { 41 | outs() << "\t" << inst.getOpcodeName() << " ("; 42 | bool isF = true; 43 | for(const auto& v : inst.operands()) { 44 | if(isF) isF = false; 45 | else outs() << ", "; 46 | 47 | outs() << v; 48 | } 49 | outs() << ")->" << &inst << "\n"; 50 | } 51 | 52 | outs() << " \t" << std::string(50, '-') << "\n"; 53 | 54 | const auto res = analysis.dataMap.at(&bb); 55 | for(const auto &j : res) { 56 | outs() << "\t" << j.first << " : " << j.second << "\n"; 57 | } 58 | } 59 | } 60 | 61 | int main(int argc, char *argv[]) { 62 | cl::ParseCommandLineOptions(argc, argv); 63 | 64 | if(InputFilename.empty()) { 65 | errs() << "filename is expected"; 66 | abort(); 67 | } 68 | 69 | LLVMContext ctx; 70 | SMDiagnostic diag; 71 | 72 | auto mod = parseIRFile(InputFilename, diag, ctx); 73 | 74 | if(auto msg = diag.getMessage(); !msg.empty()) { 75 | errs() << msg; 76 | abort(); 77 | } 78 | 79 | const auto& funcList = mod->getFunctionList(); 80 | 81 | for(const auto& func : funcList) { 82 | analyze(&func, MaxIteration); 83 | } 84 | } 85 | -------------------------------------------------------------------------------- /test/IntervalSolverTest.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/7/6. 3 | // 4 | 5 | #include 6 | #include 7 | 8 | using std::make_shared; 9 | using std::string; 10 | 11 | using SIS = IntervalSolver; 12 | using SBE = BoolExpr; 13 | using SBO = BinOp; 14 | using SAO = AndOp; 15 | using SOO = OrOp; 16 | using SNO = NotOp; 17 | using SA = Atom; 18 | 19 | TEST(IntervalSolver, Solve) { 20 | { 21 | SIS solver{make_shared(SIS::Symbols{ 22 | {"10", Interval(APInt(32, 10))}, 23 | {"a", Interval(APInt(32, 0), APInt(32, 100))} 24 | }), make_shared(SBO::LT, make_shared("a"), make_shared("10"))}; 25 | 26 | auto res = solver.solve(true); 27 | ASSERT_TRUE(res["a"].equals(Interval(APInt(32, 0), APInt(32, 9)))); 28 | ASSERT_TRUE(res["10"].equals(Interval(APInt(32, 10)))); 29 | } 30 | 31 | { 32 | SIS solver{make_shared(SIS::Symbols{ 33 | {"10", Interval(APInt(32, 10))}, 34 | {"5", Interval(APInt(32, 5))}, 35 | {"a", Interval(APInt(32, 0), APInt(32, 100))} 36 | }), make_shared( 37 | make_shared(SBO::GT, make_shared("a"), make_shared("5")), 38 | make_shared(SBO::LT, make_shared("a"), make_shared("10")))}; 39 | 40 | auto res = solver.solve(true); 41 | ASSERT_TRUE(res["a"].equals(Interval(APInt(32, 6), APInt(32, 9)))); 42 | ASSERT_TRUE(res["10"].equals(Interval(APInt(32, 10)))); 43 | ASSERT_TRUE(res["5"].equals(Interval(APInt(32, 5)))); 44 | } 45 | 46 | { 47 | SIS solver{make_shared(SIS::Symbols{ 48 | {"10", Interval(APInt(32, 10))}, 49 | {"5", Interval(APInt(32, 5))}, 50 | {"a", Interval(APInt(32, 0), APInt(32, 100))} 51 | }), make_shared( 52 | make_shared(SBO::EQ, make_shared("a"), make_shared("5")), 53 | make_shared(SBO::EQ, make_shared("a"), make_shared("10")))}; 54 | 55 | auto res = solver.solve(true); 56 | ASSERT_TRUE(res["a"].equals(Interval(APInt(32, 5), APInt(32, 10)))); 57 | ASSERT_TRUE(res["10"].equals(Interval(APInt(32, 10)))); 58 | ASSERT_TRUE(res["5"].equals(Interval(APInt(32, 5)))); 59 | } 60 | 61 | // TODO: fix a && b, a || b 62 | } 63 | 64 | TEST(IntervalSolver, Eval) { 65 | { 66 | SIS solver{make_shared(SIS::Symbols{ 67 | {"10", Interval(APInt(32, 10))}, 68 | {"a", Interval(APInt(32, 0), APInt(32, 100))} 69 | }), make_shared(SBO::LT, make_shared("a"), make_shared("10"))}; 70 | 71 | ASSERT_TRUE(solver.eval().equals(Ternary::Unknown)); 72 | } 73 | 74 | { 75 | SIS solver{make_shared(SIS::Symbols{ 76 | {"10", Interval(APInt(32, 10))}, 77 | {"a", Interval(APInt(32, 0), APInt(32, 5))} 78 | }), make_shared(SBO::LT, make_shared("a"), make_shared("10"))}; 79 | 80 | ASSERT_TRUE(solver.eval().equals(Ternary::True)); 81 | } 82 | 83 | { 84 | SIS solver{make_shared(SIS::Symbols{ 85 | {"10", Interval(APInt(32, 10))}, 86 | {"a", Interval(APInt(32, 99), APInt(32, 100))} 87 | }), make_shared(SBO::LT, make_shared("a"), make_shared("10"))}; 88 | 89 | ASSERT_TRUE(solver.eval().equals(Ternary::False)); 90 | } 91 | 92 | { 93 | SIS solver{make_shared(SIS::Symbols{ 94 | {"10", Interval(APInt(32, 10))}, 95 | {"5", Interval(APInt(32, 5))}, 96 | {"a", Interval(APInt(32, 7), APInt(32, 9))} 97 | }), make_shared( 98 | make_shared(SBO::GT, make_shared("a"), make_shared("5")), 99 | make_shared(SBO::LT, make_shared("a"), make_shared("10")))}; 100 | 101 | ASSERT_TRUE(solver.eval().equals(Ternary::True)); 102 | } 103 | 104 | { 105 | SIS solver{make_shared(SIS::Symbols{ 106 | {"10", Interval(APInt(32, 10))}, 107 | {"5", Interval(APInt(32, 5))}, 108 | {"a", Interval(APInt(32, 7), APInt(32, 10))} 109 | }), make_shared( 110 | make_shared(SBO::GT, make_shared("a"), make_shared("5")), 111 | make_shared(SBO::LT, make_shared("a"), make_shared("10")))}; 112 | 113 | ASSERT_TRUE(solver.eval().equals(Ternary::Unknown)); 114 | } 115 | 116 | { 117 | SIS solver{make_shared(SIS::Symbols{ 118 | {"10", Interval(APInt(32, 10))}, 119 | {"5", Interval(APInt(32, 5))}, 120 | {"a", Interval(APInt(32, 1), APInt(32, 5))} 121 | }), make_shared( 122 | make_shared(SBO::GT, make_shared("a"), make_shared("5")), 123 | make_shared(SBO::LT, make_shared("a"), make_shared("10")))}; 124 | 125 | ASSERT_TRUE(solver.eval().equals(Ternary::False)); 126 | } 127 | } -------------------------------------------------------------------------------- /test/IntervalTest.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/7/4. 3 | // 4 | 5 | #include 6 | #include 7 | 8 | const auto Zero = Interval(APSInt(32, false)); 9 | const auto One = Interval(APSInt(APInt(32, 1), false)); 10 | const auto ZeroToOne = Interval( 11 | APSInt(32, false), 12 | APSInt(APInt(32, 1), false) 13 | ); 14 | 15 | TEST(Interval, Construct) { 16 | ASSERT_TRUE(Zero.equals(Interval(APSInt(APInt(32, 0), false)))); 17 | ASSERT_TRUE(ZeroToOne.equals(Interval( 18 | APSInt(32, false), 19 | APSInt(APInt(32, 1), false) 20 | ))); 21 | 22 | ASSERT_TRUE(Zero.isValid()); 23 | ASSERT_TRUE(Interval().isValid()); 24 | ASSERT_TRUE(ZeroToOne.isValid()); 25 | ASSERT_FALSE(Interval( 26 | APSInt(APInt(32, 1), false), 27 | APSInt(32, false) 28 | ).isValid()); 29 | } 30 | 31 | TEST(Interval, Copy) { 32 | Interval a = ZeroToOne; 33 | ASSERT_TRUE(a.equals(ZeroToOne)); 34 | ASSERT_TRUE(a.isValid()); 35 | 36 | a = ZeroToOne; 37 | ASSERT_TRUE(a.equals(ZeroToOne)); 38 | ASSERT_TRUE(a.isValid()); 39 | } 40 | 41 | TEST(Interval, Predicate) { 42 | ASSERT_FALSE(Zero.equals(ZeroToOne)); 43 | ASSERT_FALSE(ZeroToOne.equals(Zero)); 44 | 45 | ASSERT_TRUE(ZeroToOne.length() == APSInt(APInt(32, 1), false)); 46 | ASSERT_FALSE(ZeroToOne.isConstant()); 47 | 48 | ASSERT_TRUE(Zero.isConstant()); 49 | ASSERT_TRUE(ZeroToOne.contains(Zero)); 50 | ASSERT_TRUE(ZeroToOne.contains(APSInt(APInt(32, 1), false))); 51 | 52 | ASSERT_FALSE(ZeroToOne.contains(APSInt(APInt(32, 2), false))); 53 | ASSERT_FALSE(ZeroToOne.contains(APSInt(APInt(32, -1, true), false))); 54 | ASSERT_TRUE(Interval(APSInt("1"), APSInt("3")).contains(APSInt("2"))); 55 | ASSERT_FALSE(Zero.contains(ZeroToOne)); 56 | 57 | ASSERT_TRUE(Zero.length() == APSInt(32, false)); 58 | ASSERT_TRUE(ZeroToOne.overlaps(Zero)); 59 | ASSERT_TRUE(Zero.overlaps(ZeroToOne)); 60 | ASSERT_FALSE(Zero.overlaps(One)); 61 | ASSERT_TRUE(ZeroToOne.overlaps(Interval(APSInt(APInt(32, 1), false), 62 | APSInt(APInt(32, 2), false)))); 63 | ASSERT_FALSE(ZeroToOne.overlaps(Interval(APSInt(APInt(32, 2), false), 64 | APSInt(APInt(32, 3), false)))); 65 | ASSERT_TRUE(Interval(APSInt("0"), APSInt("2")).overlaps(Interval(APSInt("1"), APSInt("3")))); 66 | } 67 | 68 | TEST(Interval, SetOp) { 69 | ASSERT_TRUE(Zero.equals(Zero & Zero)); 70 | ASSERT_TRUE(Zero.equals(Zero | Zero)); 71 | ASSERT_TRUE(ZeroToOne.equals(ZeroToOne & ZeroToOne)); 72 | ASSERT_TRUE(ZeroToOne.equals(ZeroToOne | ZeroToOne)); 73 | ASSERT_TRUE(ZeroToOne.equals(Zero | ZeroToOne)); 74 | ASSERT_TRUE(Zero.equals(ZeroToOne & Zero)); 75 | 76 | ASSERT_TRUE(ZeroToOne.equals( 77 | Interval(APSInt(APInt(32, -1, true), false), APSInt(APInt(32, 1), false)) & 78 | Interval(APSInt(APInt(32, 0), false), APSInt(APInt(32, 3), false)))); 79 | ASSERT_TRUE(ZeroToOne.equals(Zero | One)); 80 | 81 | ASSERT_FALSE((Zero & One).isValid()); 82 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, true), false), APSInt(APInt(32, 10), false)).equals( 83 | Interval(APSInt(APInt(32, -1, true), false), APSInt(APInt(32, 1), false)) | 84 | Interval(APSInt(APInt(32, 9), false), APSInt(APInt(32, 10), false)))); 85 | } 86 | 87 | TEST(Interval, ArthmeticOp) { 88 | ASSERT_TRUE(Zero.equals(Zero + Zero)); 89 | ASSERT_TRUE(ZeroToOne.equals(Zero + ZeroToOne)); 90 | ASSERT_TRUE(ZeroToOne.equals(ZeroToOne + Zero)); 91 | ASSERT_TRUE(Interval(APSInt(APInt(32, 1), false), APSInt(APInt(32, 2), false)) 92 | .equals(One + ZeroToOne)); 93 | ASSERT_TRUE(Interval(APSInt(APInt(32, 0), false), APSInt(APInt(32, 2), false)) 94 | .equals(ZeroToOne + ZeroToOne)); 95 | 96 | ASSERT_TRUE(Zero.equals(Zero - Zero)); 97 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, true), false), 98 | APSInt(APInt(32, 0), false)).equals(Zero - ZeroToOne)); 99 | ASSERT_TRUE(ZeroToOne.equals(ZeroToOne - Zero)); 100 | ASSERT_TRUE(ZeroToOne.equals(One - ZeroToOne)); 101 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 1), false)) 102 | .equals(ZeroToOne - ZeroToOne)); 103 | 104 | // TODO: add tests for mul & div 105 | } 106 | 107 | TEST(Interval, OrderOp) { 108 | ASSERT_TRUE(Zero <= ZeroToOne); 109 | ASSERT_TRUE(ZeroToOne <= One); 110 | ASSERT_TRUE(Zero < One); 111 | ASSERT_TRUE((ZeroToOne <= ZeroToOne).equals(Ternary::Unknown)); 112 | 113 | ASSERT_TRUE(Zero != One); 114 | ASSERT_TRUE((ZeroToOne == ZeroToOne).equals(Ternary::Unknown)); 115 | ASSERT_TRUE(Zero == Zero); 116 | 117 | ASSERT_TRUE((ZeroToOne == Zero).equals(Ternary::Unknown)); 118 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 0), false)) != 119 | Interval(APSInt(APInt(32, 1, false), false), APSInt(APInt(32, 2), false))); 120 | 121 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 0), false)) < 122 | Interval(APSInt(APInt(32, 1, false), false), APSInt(APInt(32, 2), false))); 123 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 0), false)) <= 124 | Interval(APSInt(APInt(32, 1, false), false), APSInt(APInt(32, 2), false))); 125 | 126 | ASSERT_TRUE((Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 1), false)) < 127 | Interval(APSInt(APInt(32, 1, false), false), APSInt(APInt(32, 2), false))) 128 | .equals(Ternary::Unknown)); 129 | ASSERT_TRUE(Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 1), false)) <= 130 | Interval(APSInt(APInt(32, 1, false), false), APSInt(APInt(32, 2), false))); 131 | 132 | ASSERT_TRUE((Interval(APSInt(APInt(32, -1, false), false), APSInt(APInt(32, 2), false)) <= 133 | Interval(APSInt(APInt(32, 1, false), false), APSInt(APInt(32, 3), false))) 134 | .equals(Ternary::Unknown)); 135 | 136 | } 137 | -------------------------------------------------------------------------------- /test/TernaryTest.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by edboy on 2020/7/5. 3 | // 4 | 5 | #include 6 | #include 7 | 8 | TEST(Ternary, Construct) { 9 | ASSERT_TRUE(Ternary().equals(Ternary::Unknown)); 10 | ASSERT_TRUE(Ternary(true).equals(Ternary::True)); 11 | ASSERT_TRUE(Ternary(false).equals(Ternary::False)); 12 | 13 | ASSERT_TRUE(Ternary(Ternary::Unknown).equals({})); 14 | } 15 | 16 | TEST(Ternary, EqOp) { 17 | ASSERT_TRUE((Ternary() == Ternary()).equals({})); 18 | ASSERT_TRUE((Ternary() == Ternary(false)).equals({})); 19 | ASSERT_TRUE((Ternary() == Ternary(true)).equals({})); 20 | ASSERT_TRUE((Ternary(false) == Ternary()).equals({})); 21 | ASSERT_TRUE((Ternary(false) == Ternary(false)).equals(Ternary::True)); 22 | ASSERT_TRUE((Ternary(false) == Ternary(true)).equals(Ternary::False)); 23 | ASSERT_TRUE((Ternary(true) == Ternary()).equals({})); 24 | ASSERT_TRUE((Ternary(true) == Ternary(false)).equals(Ternary::False)); 25 | ASSERT_TRUE((Ternary(true) == Ternary(true)).equals(Ternary::True)); 26 | 27 | ASSERT_TRUE((Ternary() != Ternary()).equals({})); 28 | ASSERT_TRUE((Ternary() != Ternary(false)).equals({})); 29 | ASSERT_TRUE((Ternary() != Ternary(true)).equals({})); 30 | ASSERT_TRUE((Ternary(false) != Ternary()).equals({})); 31 | ASSERT_TRUE((Ternary(false) != Ternary(false)).equals(Ternary::False)); 32 | ASSERT_TRUE((Ternary(false) != Ternary(true)).equals(Ternary::True)); 33 | ASSERT_TRUE((Ternary(true) != Ternary()).equals({})); 34 | ASSERT_TRUE((Ternary(true) != Ternary(false)).equals(Ternary::True)); 35 | ASSERT_TRUE((Ternary(true) != Ternary(true)).equals(Ternary::False)); 36 | } 37 | 38 | TEST(Ternary, LogicOp) { 39 | ASSERT_TRUE((!Ternary()).equals({})); 40 | ASSERT_TRUE((!Ternary(false)).equals(Ternary::True)); 41 | ASSERT_TRUE((!Ternary(true)).equals(Ternary::False)); 42 | 43 | ASSERT_TRUE((Ternary() || Ternary()).equals({})); 44 | ASSERT_TRUE((Ternary() || Ternary(false)).equals({})); 45 | ASSERT_TRUE((Ternary() || Ternary(true)).equals(Ternary::True)); 46 | ASSERT_TRUE((Ternary(false) || Ternary()).equals({})); 47 | ASSERT_TRUE((Ternary(false) || Ternary(false)).equals(Ternary::False)); 48 | ASSERT_TRUE((Ternary(false) || Ternary(true)).equals(Ternary::True)); 49 | ASSERT_TRUE((Ternary(true) || Ternary()).equals(Ternary::True)); 50 | ASSERT_TRUE((Ternary(true) || Ternary(false)).equals(Ternary::True)); 51 | ASSERT_TRUE((Ternary(true) || Ternary(true)).equals(Ternary::True)); 52 | 53 | ASSERT_TRUE((Ternary() && Ternary()).equals({})); 54 | ASSERT_TRUE((Ternary() && Ternary(false)).equals(Ternary::False)); 55 | ASSERT_TRUE((Ternary() && Ternary(true)).equals({})); 56 | ASSERT_TRUE((Ternary(false) && Ternary()).equals(Ternary::False)); 57 | ASSERT_TRUE((Ternary(false) && Ternary(false)).equals(Ternary::False)); 58 | ASSERT_TRUE((Ternary(false) && Ternary(true)).equals(Ternary::False)); 59 | ASSERT_TRUE((Ternary(true) && Ternary()).equals({})); 60 | ASSERT_TRUE((Ternary(true) && Ternary(false)).equals(Ternary::False)); 61 | ASSERT_TRUE((Ternary(true) && Ternary(true)).equals(Ternary::True)); 62 | } 63 | --------------------------------------------------------------------------------