search for: fdep

...;\t' << **it << " anti dependence." << '\n'; } } else if( dep->isConfused() == false ) { errs() << "# full dependence." << '\n'; //if( FullDependence *FDep = cast<FullDependence>( dep ) ) { // errs() << " full dep casted" << '\n'; //} } } instructions.push_back(&*I); } } } Most likely i'm moving totally in wrong...

Valmico <valmico88 at gmail.com> wrote: > I'm currently trying to develop new LLVM Pass that will generate > simple data dependencies graph. For now I'm trying to get familiar > with DependenceAnalysis. > My general idea is to traverse each function (runOnFunction) > top to bottom Instruction by Instruction, using DA.depends( I, I2, ...) > on every Instructions

...it << " anti dependence." << '\n'; > } > } else if( dep->isConfused() == false ) { > errs() << "# full dependence." << '\n'; > //if( FullDependence *FDep = cast<FullDependence>( dep ) ) { > // errs() << " full dep casted" << '\n'; > //} > } > } > > instructions.push_back(&*I); > } > } > }...