diff options
| author | Kartik K. Agaram <vc@akkartik.com> | 2017-10-30 02:39:11 -0700 |
|---|---|---|
| committer | Kartik K. Agaram <vc@akkartik.com> | 2017-10-30 02:46:36 -0700 |
| commit | 479e7a547adee04d3f9532eff58da79e28d28b91 (patch) | |
| tree | 32f7fef7c93ec26381d8a607edb1ec7dd361cb1d /056shape_shifting_recipe.cc | |
| parent | 459cdb3da5e289a46104f928cb95021b4bae3194 (diff) | |
| download | mu-479e7a547adee04d3f9532eff58da79e28d28b91.tar.gz | |
4092
Some cleanup as I remind myself of how generic functions work in Mu.
Diffstat (limited to '056shape_shifting_recipe.cc')
| -rw-r--r-- | 056shape_shifting_recipe.cc | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/056shape_shifting_recipe.cc b/056shape_shifting_recipe.cc index 917fce5c..d28b5713 100644 --- a/056shape_shifting_recipe.cc +++ b/056shape_shifting_recipe.cc @@ -53,7 +53,7 @@ if (!candidates.empty()) { trace(9992, "transform") << "found variant to specialize: " << exemplar << ' ' << get(Recipe, exemplar).name << end(); recipe_ordinal new_recipe_ordinal = new_variant(exemplar, inst, caller_recipe); if (new_recipe_ordinal == 0) goto skip_shape_shifting_variants; - variants.push_back(new_recipe_ordinal); // side-effect + get(Recipe_variants, inst.name).push_back(new_recipe_ordinal); // side-effect recipe& variant = get(Recipe, new_recipe_ordinal); // perform all transforms on the new specialization if (!variant.steps.empty()) { @@ -87,7 +87,7 @@ if (is_literal(from) && is_mu_address(to)) :(code) // phase 3 of static dispatch -vector<recipe_ordinal> strictly_matching_shape_shifting_variants(const instruction& inst, vector<recipe_ordinal>& variants) { +vector<recipe_ordinal> strictly_matching_shape_shifting_variants(const instruction& inst, const vector<recipe_ordinal>& variants) { vector<recipe_ordinal> result; for (int i = 0; i < SIZE(variants); ++i) { if (variants.at(i) == -1) continue; @@ -118,6 +118,7 @@ bool all_concrete_header_reagents_strictly_match(const instruction& inst, const // tie-breaker for phase 3 recipe_ordinal best_shape_shifting_variant(const instruction& inst, vector<recipe_ordinal>& candidates) { assert(!candidates.empty()); + if (SIZE(candidates) == 1) return candidates.at(0); // primary score int max_score = -1; for (int i = 0; i < SIZE(candidates); ++i) { |