Lines Matching defs:path
53 int prev_idx; ///< pointer to the previous path point
54 float cost; ///< path cost
62 TrellisBandCodingPath path[120][CB_TOT_ALL];
76 path[0][cb].cost = run_bits+4;
77 path[0][cb].prev_idx = -1;
78 path[0][cb].run = 0;
83 float cost_stay_here = path[swb][0].cost;
85 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][0].run]
86 != run_value_bits[sce->ics.num_windows == 8][path[swb][0].run+1])
89 path[swb+1][0].prev_idx = next_mincb;
90 path[swb+1][0].cost = cost_get_here;
91 path[swb+1][0].run = 1;
93 path[swb+1][0].prev_idx = 0;
94 path[swb+1][0].cost = cost_stay_here;
95 path[swb+1][0].run = path[swb][0].run + 1;
97 next_minbits = path[swb+1][0].cost;
100 path[swb+1][cb].cost = 61450;
101 path[swb+1][cb].prev_idx = -1;
102 path[swb+1][cb].run = 0;
112 path[swb+1][cb].cost = 61450;
113 path[swb+1][cb].prev_idx = -1;
114 path[swb+1][cb].run = 0;
120 path[swb+1][cb].cost = 61450;
121 path[swb+1][cb].prev_idx = -1;
122 path[swb+1][cb].run = 0;
132 cost_stay_here = path[swb][cb].cost + bits;
134 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
135 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
138 path[swb+1][cb].prev_idx = mincb;
139 path[swb+1][cb].cost = cost_get_here;
140 path[swb+1][cb].run = 1;
142 path[swb+1][cb].prev_idx = cb;
143 path[swb+1][cb].cost = cost_stay_here;
144 path[swb+1][cb].run = path[swb][cb].run + 1;
146 if (path[swb+1][cb].cost < next_minbits) {
147 next_minbits = path[swb+1][cb].cost;
155 //convert resulting path from backward-linked list
159 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
165 stackrun[stack_len] = path[ppos][cb].run;
167 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
168 ppos -= path[ppos][cb].run;