Skip to content
Snippets Groups Projects
Select Git revision
  • 27-need-ubuntu20-testing
  • 28-stars-assertion-in-accessabovelocalframe
  • 30-erroneous-assert
  • SMP_clc5q
  • aware-sw-delivery
  • cfar_phase1_final_release
  • cfar_phase2_3rdquarter_release
  • cfar_phase2_final_release
  • cfar_phase2_midterm_release
  • cfar_phase3_midterm_release
  • cfar_release
  • cgc-sw-deliverables
  • cgc_dev
  • ewb3e_development
  • faster_deadregs
  • improve-data-source-tracing
  • infinite_loop_fix
  • instfallthrough
  • master default
  • p2-tne-bug-fixes
  • cfar-phase3-final
  • CFAR_AEI
  • CfarJuly2018Eval
  • pre-las-vegas
  • SCCP_12NOV2013
  • fast_metadata_02SEP2013
  • call_graph_priority_27AUG2013
  • remove_DU_chains_21AUG2013
  • alias_analysis_19AUG2013
  • alias_analysis_17AUG2013
  • duchain_data_structures_25JUL2013
  • stonesoup-phase2-tne-release
  • IDA64_28JUN2013
  • hashing_lea_addition_26JUN2013
  • IDIOM_23_21JUN2013C
  • truncation_signedness_21JUN2013
  • IDIOM_21_bitwise_not_17JUN2013B
  • IDIOM_20_memory_reduction_17JUN2013
  • deadregs_bitset_14JUN2013B
  • scaled_indexreg_not_unsigned_14JUN2013
40 results
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.01Mar28Feb272625242221191712109115Jan117128Dec272521171615128754326Nov252120191412130Oct231311654229Sep282421201814139828Aug272524232215May29Apr29Jan1417Dec12109754324Oct93230Sep1Oct19Sep1817141365415Aug983230Jul2216630May282320632129Apr232017121110983221Mar19425Feb24232116121197653131Jan29282725171297431Dec2827242318151412753130Nov292826232019161376227Oct26241916986528Sep25222118754326Aug13107531Jul2624212025Jun864127May221918171617161512109720Apr1914128643122Mar17128Feb27242322211916151410129Jan19Dec530Nov2Oct8Sep28Aug2321111084327Jul212017412Jun627May12854129Apr2822216231Mar292827262420171614111064122Feb161023Jan19163223Dec171311Nov126Oct2515Aug131231Jul29287630Jun26242017161110872130May28272625241716151311109765319Apr821Mar20191714128Feb242322211817432130Jan292822212019181716151211765130Dec27251716151412111097432130Nov27251918171615149875431Oct292719181716151413121198SPARK: CLONING 10: Clone to fix FTNotDominated and FTDeadEnd combination.SPARK: CLONING 9: Clone to solve NFTNotDominated and NFTDeadEnd combination.SPARK: CLONING 8: regular IfThen dominance problem.SPARK: CLONING 7 for OddIfThen dominance problem.SPARK: Implement another double cloning for structuring unstructured conditionals.Avoid crashing on bad stack access code caused by LAF transform.Prevent crash in Dump() method.Increase debugging output on fatal error for stack access table builder.submodSPARK: Cloning expansion and fixes.Merge branch 'master' of git.zephyr-software.com:allnp/SMPStaticAnalyzerUpdate tests to grab idaSPARK: Expand cloning beyond FT or NFT block heads.SPARK: Implement double cloning (two paths at once).SPARK: Cloning fixes.SPARK: Cloning fixes.Update scons to build ida version only if IDA vars are set.Merge branch 'master' of git.zephyr-software.com:allnp/SMPStaticAnalyzerSPARK: Massive update to implement block cloning to structured CFGs for translation.Submodule updated automatically on gitlabrunnerxenial at Mon Feb 1 13:14:26 UTC 2021Classify loop branches and jumps even for non-SPARK runs.SPARK: Finish prep for block cloning.SPARK: Continue preparation for cloning using TCFG (translation CFG) data structures.SPARK: Some fixes; prep for basic block cloning.SPARK: Detect unstructured conditionals that can be structured by code cloning.SPARK: Convert to DomFrontiers algorithm for FindConditionalFollowNode(), stop calling others and comparing.SPARK: Perfect the version of FindConditionalFollowNode() based on dominance frontiers.SPARK: switch statement fixex, code cleanup.SPARK: Speed ups, including using DomFrontier info for block dominance tests.SPARK: Switch statement analysis and other CFG fixes.SPARK: Update CFG error messages for new conditional follow node method.SPARK: CFG analysis fixes: conditionals, loop breaks, loop continue statements.SPARK: Move translation of multiple loop exit targets inside loop procedure; more conditional follow node fixes.Code cleanup and speedup; use RPO numbers to avoid back edges instead of dominator relations.SPARK: Detect unstructured bypass of conditional follow node.SPARK: Use new, correct OddIfThenCase determination.SPARK: Precise determination of if-then, odd-if-then and if-then-else; comparison to old findings.SPARK: More FindConditionalFollowNode() improvements.SPARK: Continue improvements to new FindConditionalFollowNode() algorithm.Clean up integer types and debug output.