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.011May109765319Apr821Mar20191714128Feb242322211817432130Jan292822212019181716151211765130Dec27251716151412111097432130Nov27251918171615149875431Oct29271918171615141312119853128Sep2625242120191816111097531Aug282624171198765431Jul3029282423222120171615141310987543230Jun29262523151211109654326May2524232220191714131110754130Apr1923Mar22721Feb15528Jan23222119181411108653218Dec10976543128Nov2726252421191814131211987627Oct26242322212016151413832130Sep2725242319173230Aug2926252113116542131Jul302928245126Jun42128May252419181514121097654230Apr29232215127Mar252421181193125Feb21187531Jan28234Dec126Nov24211915126Sep4327Aug25212017131Jul27262524211311964329Jun272625242322212018171413121110987654228May2725242221191615131198430Apr2932131Mar3026242321322Feb24Dec1413430Nov2130Oct2825191817161018Sep14Aug12May11765130AprClean up multiply and divide RTL construction, handling IDA and IRDB operand lists equally.Replace container at() methods with [] preceded by loop-invariant assertions to check ranges.Rename beaEngine opcode prefetchNTA to prefetchnta to match IDA Pro.Add opcode alias to match beaEngine capitalization for prefetchnta == prefetchNTA.Add new AVX registers from IDA Pro 5.9.Handle AVX_REG type.Fix initialization order in constructor.Handle opcodes that set, clear, or complement bits in the EFLAGS register in STARS_GetCmd().Comment out SCCP to save time until it is used for annotations.Eliminate DEADREGS annotations on multi-entry functions.Handle stupid beaEngine r14B register the same as r14b because those bozos have an alias just for r14b. Fix case fall-through in SegReg initialization.Fix GetByteWidth() when register operands have subword suffixes such as r12b, r13w, r14d.Generalize EIP/CS-relative addressing detection.DEADREGS fixes for subword operations.Annotation diffs from previous DEADREGS fix for indirect calls.Make conservative USE lists for callee-saved regs apply properly to indirect calls.Perform tests in correct order in IsGlobalRegRead().Generalize DEADREGS pass-through case for callee-saved regs.Handle EIP-relative operands in their IRDB form.Avoid tracing StaticMemOp types when analyzing memory write safeness.Implement HasSegReg() method.Improve safe indirect writes intraprocedural analysis.DEADREGS fix: Allow callee-saved regs to pass through a func without being declared dead.Use environment var for file name to work around IDA Pro failure on Red Hat Linux.Avoid crash when tracing truncations back to SSA marker instructions when looking to trace back to add or subtract instructions.Avoid crash on COND_BRANCH fall-through outside func.Create SPARK Ada procedures for each loop.unset LANG to prevent ida crashContinue SPARK Ada translation; loops to procedures.Reduce memory; handle huge SSA numbers; add assertions; alter code size limit for 64-bit reduced processing.Save memory in SMPInstr.Reduce alignment requirement from 4 bytes to 2 for code address search in data sections.Add Dan's Guardian test case; don't search for 32-bit code addresses in 64-bit data sections; mark IBT as COMPLETE when SCCP resolves indirect call target.SCCP: Return lattice bottom value for guarded RTLs, as with conditional moves.Speedup on large functions.Gather stats on return address set completeness and incompleteness.Make void operands common within each instruction to save memory.Reduce memory in SMPInstr by getting address from INST_ID instead of caching it separately.SPARK Ada improvements.Gather stats on function pointer shadowing.