about summary refs log tree commit diff stats
BranchCommit messageAuthorAge
bongkeys: st-xterm compatAcid Bong23 months
masterbump version to 6.4Hiltjo Posthuma2 years
musldmenumon fixAcid Bong23 months
 
TagDownloadAuthorAge
6.4dwm-6.4.tar.gz  Hiltjo Posthuma2 years
6.3dwm-6.3.tar.gz  Hiltjo Posthuma3 years
6.2dwm-6.2.tar.gz  Anselm R Garbe6 years
6.1dwm-6.1.tar.gz  Hiltjo Posthuma9 years
6.0dwm-6.0.tar.gz  anselm@garbe.us13 years
5.9dwm-5.9.tar.gz  garbeam@gmail.com13 years
5.8.2dwm-5.8.2.tar.gz  Anselm R Garbe15 years
5.8.1dwm-5.8.1.tar.gz  Anselm R Garbe15 years
5.8dwm-5.8.tar.gz  anselm@garbe.us15 years
5.7.2dwm-5.7.2.tar.gz  Anselm R Garbe15 years
5.7.1dwm-5.7.1.tar.gz  Anselm R Garbe15 years
5.7dwm-5.7.tar.gz  Anselm R Garbe15 years
5.6.1dwm-5.6.1.tar.gz  Anselm R Garbe15 years
5.6dwm-5.6.tar.gz  Anselm R Garbe15 years
5.5dwm-5.5.tar.gz  Anselm R Garbe16 years
5.4.1dwm-5.4.1.tar.gz  a@null16 years
5.4dwm-5.4.tar.gz  a@null16 years
5.3.1dwm-5.3.1.tar.gz  Anselm R Garbe16 years
5.3dwm-5.3.tar.gz  Anselm R Garbe16 years
5.2dwm-5.2.tar.gz  Anselm R Garbe16 years
5.1dwm-5.1.tar.gz  Anselm R Garbe16 years
5.0dwm-5.0.tar.gz  Anselm R Garbe17 years
4.9dwm-4.9.tar.gz  Anselm R Garbe17 years
4.8dwm-4.8.tar.gz  Anselm R Garbe17 years
4.7dwm-4.7.tar.gz  Anselm R. Garbe17 years
4.6dwm-4.6.tar.gz  arg@suckless.org17 years
4.5dwm-4.5.tar.gz  Anselm R. Garbe17 years
4.4.1dwm-4.4.1.tar.gz  Anselm R. Garbe17 years
4.4dwm-4.4.tar.gz  Anselm R. Garbe17 years
4.3dwm-4.3.tar.gz  arg@f00b4r17 years
4.2dwm-4.2.tar.gz  Anselm R. Garbe18 years
4.1dwm-4.1.tar.gz  Anselm R. Garbe18 years
4.0dwm-4.0.tar.gz  Anselm R. Garbe18 years
3.9dwm-3.9.tar.gz  Anselm R. Garbe18 years
3.8dwm-3.8.tar.gz  Anselm R. Garbe18 years
3.7dwm-3.7.tar.gz  Anselm R. Garbe18 years
3.6.1dwm-3.6.1.tar.gz  Anselm R. Garbe18 years
3.6dwm-3.6.tar.gz  Anselm R. Garbe18 years
3.5dwm-3.5.tar.gz  Anselm R. Garbe18 years
3.4dwm-3.4.tar.gz  Anselm R. Garbe18 years
3.3dwm-3.3.tar.gz  Anselm R. Garbe18 years
3.2.2dwm-3.2.2.tar.gz  Anselm R. Garbe18 years
3.2.1dwm-3.2.1.tar.gz  Anselm R. Garbe18 years
3.2dwm-3.2.tar.gz  Anselm R. Garbe18 years
3.1dwm-3.1.tar.gz  Anselm R. Garbe18 years
3.0dwm-3.0.tar.gz  Anselm R. Garbe18 years
2.9dwm-2.9.tar.gz  Anselm R. Garbe18 years
2.8dwm-2.8.tar.gz  arg@mig2918 years
2.7dwm-2.7.tar.gz  arg@mig2918 years
2.6dwm-2.6.tar.gz  arg@mig2918 years
2.5.1dwm-2.5.1.tar.gz  arg@mig2918 years
2.5dwm-2.5.tar.gz  arg@mig2918 years
2.4dwm-2.4.tar.gz  arg@mig2918 years
2.3dwm-2.3.tar.gz  arg@mig2918 years
2.2dwm-2.2.tar.gz  arg@mig2918 years
2.1dwm-2.1.tar.gz  arg@mig2918 years
2.0dwm-2.0.tar.gz  arg@mig2918 years
1.9dwm-1.9.tar.gz  Anselm R. Garbe18 years
1.8dwm-1.8.tar.gz  Anselm R. Garbe18 years
1.7.1dwm-1.7.1.tar.gz  Anselm R. Garbe18 years
1.7dwm-1.7.tar.gz  arg@mmvi18 years
1.6dwm-1.6.tar.gz  arg@mmvi18 years
1.5dwm-1.5.tar.gz  Anselm R. Garbe18 years
1.4dwm-1.4.tar.gz  Anselm R. Garbe18 years
1.3dwm-1.3.tar.gz  Anselm R. Garbe18 years
1.2dwm-1.2.tar.gz  Anselm R. Garbe18 years
1.1dwm-1.1.tar.gz  Anselm R. Garbe18 years
1.0dwm-1.0.tar.gz  Anselm R. Garbe18 years
0.9dwm-0.9.tar.gz  Anselm R.Garbe18 years
0.8dwm-0.8.tar.gz  Anselm R.Garbe18 years
0.7dwm-0.7.tar.gz  arg@10ksloc.org18 years
0.6dwm-0.6.tar.gz  arg@10ksloc.org18 years
0.5dwm-0.5.tar.gz  arg@10ksloc.org18 years
0.4dwm-0.4.tar.gz  arg@10ksloc.org18 years
0.3dwm-0.3.tar.gz  arg@10ksloc.org18 years
0.2dwm-0.2.tar.gz  Anselm R. Garbe18 years
0.1dwm-0.1.tar.gz  Anselm R. Garbe18 years
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-12-28 18:05:56 +0000
class="p">.at(j).name != "0") continue; if (!is_mu_space(inst.products.at(j))) { raise << "slot 0 should always have type address:array:location, but is '" << to_string(inst.products.at(j)) << "'\n" << end(); continue; } string_tree* s = property(inst.products.at(j), "names"); if (!s) { raise << "slot 0 requires a /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); continue; } if (!s->atom) raise << "slot 0 should have a single value in /names, but got '" << to_string(inst.products.at(j)) << "'\n" << end(); const string& surrounding_recipe_name = s->value; if (surrounding_recipe_name.empty()) { raise << "slot 0 doesn't initialize its /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); continue; } if (contains_key(Surrounding_space, r) && get(Surrounding_space, r) != get(Recipe_ordinal, surrounding_recipe_name)) { raise << "recipe '" << get(Recipe, r).name << "' can have only one 'surrounding' recipe but has '" << get(Recipe, get(Surrounding_space, r)).name << "' and '" << surrounding_recipe_name << "'\n" << end(); continue; } trace(103, "name") << "lexically surrounding space for recipe " << get(Recipe, r).name << " comes from " << surrounding_recipe_name << end(); if (!contains_key(Recipe_ordinal, surrounding_recipe_name)) { raise << "can't find recipe providing surrounding space for '" << get(Recipe, r).name << "'; looking for '" << surrounding_recipe_name << "'\n" << end(); continue; } put(Surrounding_space, r, get(Recipe_ordinal, surrounding_recipe_name)); } } } //: Once surrounding spaces are available, transform_names uses them to handle //: /space properties. :(replace{} "int lookup_name(const reagent& r, const recipe_ordinal default_recipe)") int lookup_name(const reagent& x, const recipe_ordinal default_recipe) { if (!has_property(x, "space")) { if (Name[default_recipe].empty()) raise << "name not found: " << x.name << '\n' << end(); return Name[default_recipe][x.name]; } string_tree* p = property(x, "space"); if (!p || !p->atom) raise << "/space property should have exactly one (non-negative integer) value\n" << end(); int n = to_integer(p->value); assert(n >= 0); recipe_ordinal surrounding_recipe = lookup_surrounding_recipe(default_recipe, n); if (surrounding_recipe == -1) return -1; set<recipe_ordinal> done; vector<recipe_ordinal> path; return lookup_name(x, surrounding_recipe, done, path); } // If the recipe we need to lookup this name in doesn't have names done yet, // recursively call transform_names on it. int lookup_name(const reagent& x, const recipe_ordinal r, set<recipe_ordinal>& done, vector<recipe_ordinal>& path) { if (!Name[r].empty()) return Name[r][x.name]; if (contains_key(done, r)) { raise << "can't compute address of '" << to_string(x) << "' because\n" << end(); for (int i = 1; i < SIZE(path); ++i) { raise << path.at(i-1) << " requires computing names of " << path.at(i) << '\n' << end(); } raise << path.at(SIZE(path)-1) << " requires computing names of " << r << "..ad infinitum\n" << end(); return -1; } done.insert(r); path.push_back(r); transform_names(r); // Not passing 'done' through. Might this somehow cause an infinite loop? assert(!Name[r].empty()); return Name[r][x.name]; } recipe_ordinal lookup_surrounding_recipe(const recipe_ordinal r, int n) { if (n == 0) return r; if (!contains_key(Surrounding_space, r)) { raise << "don't know surrounding recipe of '" << get(Recipe, r).name << "'\n" << end(); return -1; } assert(contains_key(Surrounding_space, r)); return lookup_surrounding_recipe(get(Surrounding_space, r), n-1); } //: weaken use-before-set detection just a tad :(replace{} "bool already_transformed(const reagent& r, const map<string, int>& names)") bool already_transformed(const reagent& r, const map<string, int>& names) { if (has_property(r, "space")) { string_tree* p = property(r, "space"); if (!p || !p->atom) { raise << "/space property should have exactly one (non-negative integer) value in '" << r.original_string << "'\n" << end(); return false; } if (p->value != "0") return true; } return contains_key(names, r.name); } :(code) void test_missing_surrounding_space() { Hide_errors = true; run( "def f [\n" " local-scope\n" " x:num/space:1 <- copy 34\n" "]\n" ); CHECK_TRACE_CONTENTS( "error: don't know surrounding recipe of 'f'\n" "error: f: can't find a place to store 'x'\n" ); } //: extra test for try_reclaim_locals() from previous layers void test_local_scope_ignores_nonlocal_spaces() { run( "def new-scope [\n" " local-scope\n" " x:&:num <- new number:type\n" " *x:&:num <- copy 34\n" " return default-space:space\n" "]\n" "def use-scope [\n" " local-scope\n" " outer:space/names:new-scope <- next-ingredient\n" " 0:space/names:new-scope <- copy outer:space\n" " return *x:&:num/space:1\n" "]\n" "def main [\n" " 1:space/raw <- new-scope\n" " 3:num/raw <- use-scope 1:space/raw\n" "]\n" ); CHECK_TRACE_CONTENTS( "mem: storing 34 in location 3\n" ); } void test_recursive_transform_names() { run( "def foo [\n" " local-scope\n" " x:num <- copy 0\n" " return default-space:space/names:foo\n" "]\n" "def main [\n" " local-scope\n" " 0:space/names:foo <- foo\n" " x:num/space:1 <- copy 34\n" "]\n" ); CHECK_TRACE_COUNT("error", 0); }
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-12-28 18:05:57 +0000