Rev 304 | Rev 335 | Go to most recent revision | Show entire file | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 304 | Rev 312 | ||
---|---|---|---|
Line 79... | Line 79... | ||
79 | varused[i] = 0; |
79 | varused[i] = 0; |
80 | needall = cnvused = state_changing_funcs_used = 0; |
80 | needall = cnvused = state_changing_funcs_used = 0; |
81 | for(i = 0; i < nplanes; ++i){ |
81 | for(i = 0; i < nplanes; ++i){ |
82 | //char s[100];sprintf(s,"expr[%d]=%#x",i,expr[i]);dbg(s); |
82 | //char s[100];sprintf(s,"expr[%d]=%#x",i,expr[i]);dbg(s); |
83 | if( tree[i] || (tree[i] = parseexpr(expr[i])) ) |
83 | if( tree[i] || (tree[i] = parseexpr(expr[i])) ) |
- | 84 | // if src() and rad() is used => needall=1, since we need arbitary access to all pixels |
|
84 | checkvars(tree[i],varused,&cnvused,&needall,&state_changing_funcs_used); |
85 | checkvars(tree[i],varused,&cnvused,/*srcrad=*/&needall,&state_changing_funcs_used); |
85 | else |
86 | else |
86 | break; |
87 | break; |
87 | } |
88 | } |
88 | needinput = ( cnvused || needall |
89 | needinput = ( cnvused || needall |
89 | || varused['r'] || varused['g'] || varused['b'] || varused['a'] |
90 | || varused['r'] || varused['g'] || varused['b'] || varused['a'] |
Line 127... | Line 128... | ||
127 | // For V, the definition is V := (R-Y) * 0.877; the range would be [-156..156] |
128 | // For V, the definition is V := (R-Y) * 0.877; the range would be [-156..156] |
128 | // Filter Factory divided it by 2, resulting in a range of [-78..78]. |
129 | // Filter Factory divided it by 2, resulting in a range of [-78..78]. |
129 | // Due to compatibility reasons, we adopt that behavior. |
130 | // Due to compatibility reasons, we adopt that behavior. |
130 | if(varused['v']) var['v'] = ff_v(); |
131 | if(varused['v']) var['v'] = ff_v(); |
131 | } |
132 | } |
- | 133 | ||
132 | if(varused['d']) var['d'] = ff_d(); |
134 | if(varused['d']) var['d'] = ff_d(); |
133 | if(varused['m']) var['m'] = ff_m(); |
135 | if(varused['m']) var['m'] = ff_m(); |
134 | 136 | ||
135 | for(k = 0; k < nplanes; ++k){ |
137 | for(k = 0; k < nplanes; ++k){ |
136 | if(needinput) |
138 | if(needinput) |