| /external/llvm-project/llvm/lib/Transforms/Utils/ |
| D | CallGraphUpdater.cpp | 54 if (LCG && !ReplacedFunctions.count(DeadFn)) { in finalize()
56 LazyCallGraph::Node &N = LCG->get(*DeadFn); in finalize()
57 auto *DeadSCC = LCG->lookupSCC(N); in finalize()
63 AM->getResult<FunctionAnalysisManagerCGSCCProxy>(*DeadSCC, *LCG) in finalize()
68 LCG->removeDeadFunction(*DeadFn); in finalize()
92 } else if (LCG) { in reanalyzeFunction()
93 LazyCallGraph::Node &N = LCG->get(Fn); in reanalyzeFunction()
94 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
95 updateCGAndAnalysisManagerForCGSCCPass(*LCG, *C, N, *AM, *UR, *FAM); in reanalyzeFunction()
132 } else if (LCG) { in replaceFunctionWith()
[all …]
|
| /external/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| D | CallGraphUpdater.h | 48 LazyCallGraph *LCG = nullptr; variable
66 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize() argument
68 this->LCG = &LCG; in initialize()
73 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager(); in initialize()
|
| /external/rust/crates/oorandom/ |
| D | README.md | 107 Generators (LCG's), which could generate lots of numbers numbers that
108 weren't really random, but sure looked random. LCG's worked well on
115 implement in hardware compared to the LCG, which needed to do
122 up their math pretty bad, and one of the more common LCG implmentations,
124 LCG wasn't good enough, you had to use one made by someone with a PhD in
142 determined that neither LCG's nor LFSR's made numbers that were
160 random numbers, but it was way better than a bad LCG, and most
162 book and figure out how to make a non-bad LCG, so everyone started using
185 hard about what you were doing, to take the old LCG and hop it up on
|
| /external/flatbuffers/tests/ |
| D | go_test.go | 1610 type LCG uint32 type
1614 func NewLCG() *LCG {
1616 l := LCG(n)
1620 func (lcg *LCG) Reset() {
1624 func (lcg *LCG) Next() uint32 {
1626 *lcg = LCG(n)
|
| D | py_test.py | 703 l = LCG()
751 l = LCG() # Reset.
2232 class LCG(object): class
|
| /external/gemmlowp/doc/ |
| D | less-than-8-bit.md | 293 tests, to produce better results than a linear congruential generator (LCG).
294 That's unfortunate, as a 8-bit LCG performs better (we confirmed that on various
|
| /external/flatbuffers/tests/rust_usage_test/tests/ |
| D | integration_test.rs | 38 struct LCG(u64); struct
39 impl LCG { impl
41 LCG { 0: 48271 } in new()
1186 use super::LCG;
1209 let mut lcg = LCG::new(); in table_of_mixed_scalars_fuzz()
|
| /external/cldr/tools/java/org/unicode/cldr/util/data/external/ |
| D | 2013-1_UNLOCODE_CodeListPart2.csv | 3151 ,"GB","LCG","Loch Long","Loch Long","AGB","1-------","RL","0901",,"5605N 00451W",
12892 ,"IT","LCG","Lucignano","Lucignano",,"--3-----","RQ","9705",,,
|
| D | 2013-1_UNLOCODE_CodeListPart1.csv | 2813 ,"AU","LCG","Lake Cargelligo","Lake Cargelligo","NSW","-23-----","RL","0607",,"3319S 14623E",
21406 ,"DE","LCG","Laichingen","Laichingen","BW","--3-----","RL","9805",,,
29318 ,"ES","LCG","La Coru�a (A Coru�a)","La Coruna (A Coruna)","C","1234----","AI","1207",,"4322N 00823W…
37837 ,"FR","LCG","Lichtenberg","Lichtenberg","67","--3-----","RL","0501",,"4855N 00729E",
|
| D | 2013-1_UNLOCODE_CodeListPart3.csv | 18374 ,"US","LCG","Le Compte","Le Compte","LA","--3-----","RQ","9307",,,
|