{"action":"created","issue":{"url":"https://api.github.com/repos/halide/Halide/issues/601","labels_url":"https://api.github.com/repos/halide/Halide/issues/601/labels{/name}","comments_url":"https://api.github.com/repos/halide/Halide/issues/601/comments","events_url":"https://api.github.com/repos/halide/Halide/issues/601/events","html_url":"https://github.com/halide/Halide/issues/601","id":52970081,"number":601,"title":"RDom bounds are garbled for IIR filter example if filter order is 10 or more","user":{"login":"gchauras","id":4353021,"avatar_url":"https://avatars.githubusercontent.com/u/4353021?v=3","gravatar_id":"","url":"https://api.github.com/users/gchauras","html_url":"https://github.com/gchauras","followers_url":"https://api.github.com/users/gchauras/followers","following_url":"https://api.github.com/users/gchauras/following{/other_user}","gists_url":"https://api.github.com/users/gchauras/gists{/gist_id}","starred_url":"https://api.github.com/users/gchauras/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/gchauras/subscriptions","organizations_url":"https://api.github.com/users/gchauras/orgs","repos_url":"https://api.github.com/users/gchauras/repos","events_url":"https://api.github.com/users/gchauras/events{/privacy}","received_events_url":"https://api.github.com/users/gchauras/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":15,"created_at":"2014-12-28T01:17:10Z","updated_at":"2015-01-05T21:54:07Z","closed_at":null,"body":"Reproducing test case: https://github.com/gchauras/halide-rdom-coden-bug\r\n\r\nIIR filter of n order on 1D data.\r\n```\r\nf(x) = input(x)\r\nf(x) = f(x) + a1*f(x-1) + a2*f(x-2) + ... + an*f(x-n)\r\n```\r\nRDom used to scan the data from left to right - RDom bounds are 0 to image width. \r\n\r\nEverything is fine for order `n<=9`. For `n>9`, the rdom bounds in codegen start from 10 instead of 0. The codgen is dumped out as `stmt_order_<filter order>.html`\r\n\r\nRunning:\r\n```\r\n./test_app [filter order]\r\n```\r\n"},"comment":{"url":"https://api.github.com/repos/halide/Halide/issues/comments/68788813","html_url":"https://github.com/halide/Halide/issues/601#issuecomment-68788813","issue_url":"https://api.github.com/repos/halide/Halide/issues/601","id":68788813,"user":{"login":"abadams","id":515398,"avatar_url":"https://avatars.githubusercontent.com/u/515398?v=3","gravatar_id":"","url":"https://api.github.com/users/abadams","html_url":"https://github.com/abadams","followers_url":"https://api.github.com/users/abadams/followers","following_url":"https://api.github.com/users/abadams/following{/other_user}","gists_url":"https://api.github.com/users/abadams/gists{/gist_id}","starred_url":"https://api.github.com/users/abadams/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/abadams/subscriptions","organizations_url":"https://api.github.com/users/abadams/orgs","repos_url":"https://api.github.com/users/abadams/repos","events_url":"https://api.github.com/users/abadams/events{/privacy}","received_events_url":"https://api.github.com/users/abadams/received_events","type":"User","site_admin":false},"created_at":"2015-01-05T21:54:07Z","updated_at":"2015-01-05T21:54:07Z","body":"We've been on the verge of needing a std::map<string, Variant> in Target\r\nfor a while. Perhaps this is what tips us over.\r\n\r\nOn Mon, Jan 5, 2015 at 1:42 PM, Kree Cole-McLaughlin <\r\nnotifications@github.com> wrote:\r\n\r\n> Point taken, although the target struct only seems to handle bool valued\r\n> options right now. I guess the main difference I had in mind is a more\r\n> dynamic structure where the writer of an optimization pass would register a\r\n> parameter with an options structure, so that one would not have to be\r\n> constantly changing the Target struct and updating the parsing routines to\r\n> reflect new parameters.\r\n>\r\n> —\r\n> Reply to this email directly or view it on GitHub\r\n> <https://github.com/halide/Halide/issues/601#issuecomment-68786970>.\r\n>"}}