Home
last modified time | relevance | path

Searched refs:stats (Results 1 – 25 of 61) sorted by relevance

123

/art/tools/dexfuzz/src/dexfuzz/
DMutationStats.java33 private Map<String,Long> stats; field in MutationStats
37 stats = new HashMap<String,Long>(); in MutationStats()
49 if (!stats.containsKey(statName)) { in increaseStat()
50 stats.put(statName, 0L); in increaseStat()
53 stats.put(statName, stats.get(statName) + amt); in increaseStat()
69 builder.append("\"").append(statName).append("\": ").append(stats.get(statName)); in getStatsString()
/art/tools/dexfuzz/src/dexfuzz/program/mutators/
DInstructionDeleter.java59 public InstructionDeleter(Random rng, MutationStats stats, List<Mutation> mutations) { in InstructionDeleter() argument
60 super(rng, stats, mutations); in InstructionDeleter()
97 stats.incrementStat("Deleted instruction"); in applyMutation()
109 stats.incrementStat("Deleted a with-data insn's data"); in applyMutation()
131 stats.incrementStat("Deleted a data insn's with-data insn"); in applyMutation()
DCodeMutator.java40 protected MutationStats stats; field in CodeMutator
66 public CodeMutator(Random rng, MutationStats stats, List<Mutation> mutations) { in CodeMutator() argument
68 this.stats = stats; in CodeMutator()
DInstructionDuplicator.java59 public InstructionDuplicator(Random rng, MutationStats stats, List<Mutation> mutations) { in InstructionDuplicator() argument
60 super(rng, stats, mutations); in InstructionDuplicator()
100 stats.incrementStat("Duplicated instruction"); in applyMutation()
DNewArrayLengthChanger.java63 public NewArrayLengthChanger(Random rng, MutationStats stats, List<Mutation> mutations) { in NewArrayLengthChanger() argument
64 super(rng, stats, mutations); in NewArrayLengthChanger()
128 stats.incrementStat("Changed length of new array"); in applyMutation()
DIfBranchChanger.java69 public IfBranchChanger(Random rng, MutationStats stats, List<Mutation> mutations) { in IfBranchChanger() argument
70 super(rng, stats, mutations); in IfBranchChanger()
133 stats.incrementStat("Changed if branch operator to " + getMutationTag() + " operator"); in applyMutation()
DInstructionSwapper.java63 public InstructionSwapper(Random rng, MutationStats stats, List<Mutation> mutations) { in InstructionSwapper() argument
64 super(rng, stats, mutations); in InstructionSwapper()
153 stats.incrementStat("Swapped two instructions"); in applyMutation()
DOppositeBranchChanger.java29 public OppositeBranchChanger(Random rng, MutationStats stats, List<Mutation> mutations) { in OppositeBranchChanger() argument
30 super(rng, stats, mutations); in OppositeBranchChanger()
DCmpBiasChanger.java61 public CmpBiasChanger(Random rng, MutationStats stats, List<Mutation> mutations) { in CmpBiasChanger() argument
62 super(rng, stats, mutations); in CmpBiasChanger()
127 stats.incrementStat("Changed comparison bias"); in applyMutation()
DBranchShifter.java65 public BranchShifter(Random rng, MutationStats stats, List<Mutation> mutations) { in BranchShifter() argument
66 super(rng, stats, mutations); in BranchShifter()
165 stats.incrementStat("Shifted branch target"); in applyMutation()
DConstantValueChanger.java65 public ConstantValueChanger(Random rng, MutationStats stats, List<Mutation> mutations) { in ConstantValueChanger() argument
66 super(rng, stats, mutations); in ConstantValueChanger()
141 stats.incrementStat("Changed constant value"); in applyMutation()
DSwitchBranchShifter.java68 public SwitchBranchShifter(Random rng, MutationStats stats, List<Mutation> mutations) { in SwitchBranchShifter() argument
69 super(rng, stats, mutations); in SwitchBranchShifter()
170 stats.incrementStat("Shifted switch target"); in applyMutation()
/art/compiler/utils/
Ddedupe_set-inl.h86 std::unordered_map<HashType, size_t> stats;
94 auto it = stats.find(key.Hash());
95 if (it == stats.end()) {
96 stats.insert({key.Hash(), 1u});
102 for (const auto& entry : stats) {
238 Stats stats;
240 shards_[shard]->UpdateStats(self, &stats);
244 stats.collision_sum,
245 stats.collision_max,
246 stats.total_probe_distance,
[all …]
/art/compiler/optimizing/
Dinstruction_simplifier_arm.h28 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArmVisitor() argument
29 : HGraphVisitor(graph), stats_(stats) {} in InstructionSimplifierArmVisitor()
80 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm() argument
81 : HOptimization(graph, kInstructionSimplifierArmPassName, stats) {} in InstructionSimplifierArm()
Dinstruction_simplifier_arm64.h28 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64Visitor() argument
29 : HGraphVisitor(graph), stats_(stats) {} in InstructionSimplifierArm64Visitor()
87 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64() argument
88 : HOptimization(graph, kInstructionSimplifierArm64PassName, stats) {} in InstructionSimplifierArm64()
Dselect_generator.h50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats) in HSelectGenerator() argument
51 : HOptimization(graph, kSelectGeneratorPassName, stats) {} in HSelectGenerator()
Doptimizing_compiler.cc463 OptimizingCompilerStats* stats, in BuildOptimization() argument
483 return new (arena) HDeadCodeElimination(graph, stats, pass_name.c_str()); in BuildOptimization()
493 stats, in BuildOptimization()
500 return new (arena) HSelectGenerator(graph, stats); in BuildOptimization()
504 return new (arena) InstructionSimplifier(graph, codegen, driver, stats, pass_name.c_str()); in BuildOptimization()
506 return new (arena) IntrinsicsRecognizer(graph, stats); in BuildOptimization()
509 return new (arena) LICM(graph, *most_recent_side_effects, stats); in BuildOptimization()
523 return new (arena) CodeSinking(graph, stats); in BuildOptimization()
526 return new (arena) arm::InstructionSimplifierArm(graph, stats); in BuildOptimization()
530 return new (arena) arm64::InstructionSimplifierArm64(graph, stats); in BuildOptimization()
[all …]
Dcode_sinking.h31 CodeSinking(HGraph* graph, OptimizingCompilerStats* stats) in CodeSinking() argument
32 : HOptimization(graph, kCodeSinkingPassName, stats) {} in CodeSinking()
Dpc_relative_fixups_mips.h31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in PcRelativeFixups() argument
32 : HOptimization(graph, "pc_relative_fixups_mips", stats), in PcRelativeFixups()
Dlicm.h29 LICM(HGraph* graph, const SideEffectsAnalysis& side_effects, OptimizingCompilerStats* stats) in LICM() argument
30 : HOptimization(graph, kLoopInvariantCodeMotionPassName, stats), in LICM()
Dpc_relative_fixups_x86.h31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in PcRelativeFixups() argument
32 : HOptimization(graph, kPcRelativeFixupsX86PassName, stats), in PcRelativeFixups()
Ddead_code_elimination.h32 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination() argument
33 : HOptimization(graph, name, stats) {} in HDeadCodeElimination()
Doptimization.h33 OptimizingCompilerStats* stats = nullptr)
35 stats_(stats), in graph_()
Dinstruction_simplifier.h44 OptimizingCompilerStats* stats = nullptr,
46 : HOptimization(graph, name, stats), in HOptimization() argument
Dx86_memory_gen.cc74 OptimizingCompilerStats* stats) in X86MemoryOperandGeneration() argument
75 : HOptimization(graph, kX86MemoryOperandGenerationPassName, stats), in X86MemoryOperandGeneration()

123