Home
last modified time | relevance | path

Searched refs:wfa (Results 1 – 25 of 209) sorted by relevance

123456789

/dports/graphics/netpbm/netpbm-10.91.01/converter/other/fiasco/codec/
H A Ddecoder.c122 if (video->wfa) in free_video()
330 … ? video->wfa->tree [video->wfa->tree [video->wfa->root_state][0]][0] : -1, video->wfa); in get_next_frame()
404 remove_states (video->wfa->basis_states, video->wfa); in get_next_frame()
448 root_state [Y] = wfa->tree [wfa->tree [wfa->root_state][0]][0]; in decode_image()
449 root_state [Cb] = wfa->tree [wfa->tree [wfa->root_state][0]][1]; in decode_image()
450 root_state [Cr] = wfa->tree [wfa->tree [wfa->root_state][1]][0]; in decode_image()
477 wfa->level_of_state [wfa->root_state] = 128; in decode_image()
478 wfa->level_of_state [wfa->tree[wfa->root_state][0]] = 128; in decode_image()
479 wfa->level_of_state [wfa->tree[wfa->root_state][1]] = 128; in decode_image()
701 ? wfa->tree [wfa->root_state][0] in smooth_image()
[all …]
H A Dwfalib.c117 return wfa; in alloc_wfa()
145 Free (wfa->x); in free_wfa()
146 Free (wfa->y); in free_wfa()
157 Free (wfa); in free_wfa()
631 last_state = wfa->tree [wfa->tree [wfa->root_state][0]][0]; in find_range()
634 first_state = wfa->tree [wfa->tree [wfa->root_state][0]][0] + 1; in find_range()
635 last_state = wfa->tree [wfa->tree [wfa->root_state][0]][1]; in find_range()
638 first_state = wfa->tree [wfa->tree [wfa->root_state][0]][1] + 1; in find_range()
648 if (x >= wfa->x [state][label] && y >= wfa->y [state][label] in find_range()
687 sort_ranges (wfa->tree [state][label], domain, rs, wfa); in sort_ranges()
[all …]
H A Dcontrol.c50 wfa_t *wfa, coding_t *c) in append_state() argument
64 wfa->final_distribution [wfa->states] = final; in append_state()
65 wfa->level_of_state [wfa->states] = level_of_state; in append_state()
71 wfa->domain_type [wfa->states] = USE_DOMAIN_MASK; in append_state()
82 wfa->states + 1); in append_state()
92 compute_images (wfa->states, wfa->states, wfa, c); in append_state()
99 compute_ip_states_state (wfa->states, wfa->states, wfa, c); in append_state()
105 wfa->domain_type [wfa->states] = 0; in append_state()
128 wfa->states++; in append_state()
129 if (wfa->states >= MAXSTATES) in append_state()
[all …]
H A Ddomain-pool.c80 const wfa_t *wfa);
110 const wfa_t *wfa);
251 const wfa_t *wfa) in alloc_qac_domain_pool() argument
271 if (usedomain (state, wfa)) in alloc_qac_domain_pool()
459 domains = compute_hits (wfa->basis_states, wfa->states - 1, in qac_chroma()
535 return alloc_qac_domain_pool (wfa->basis_states, max_edges, wfa); in alloc_basis_domain_pool()
567 if (usedomain (state, wfa)) in uniform_generate()
582 if (usedomain (state, wfa)) in uniform_bits()
615 const wfa_t *wfa) in alloc_rle_domain_pool() argument
635 if (usedomain (state, wfa)) in alloc_rle_domain_pool()
[all …]
H A Dmotion.c63 root_state = wfa->root_state; in restore_mc()
65 root_state = wfa->tree [wfa->tree [wfa->root_state][0]][0]; in restore_mc()
85 wfa->wfainfo->half_pixel, in restore_mc()
86 FX (wfa->x [state][label]), in restore_mc()
87 FX (wfa->y [state][label]), in restore_mc()
97 + FX (wfa->x[state][label]) in restore_mc()
117 wfa->wfainfo->half_pixel, in restore_mc()
129 + FX (wfa->x[state][label]) in restore_mc()
148 wfa->wfainfo->half_pixel, in restore_mc()
149 FX (wfa->x[state][label]), in restore_mc()
[all …]
H A Dcoder.c445 wfa->states, wfa->basis_states); in print_statistics()
618 wfa->tree [wfa->states][0] = tree[Y]; in frame_coder()
619 wfa->tree [wfa->states][1] = tree[Cb]; in frame_coder()
622 wfa->wfainfo->level + 1, wfa, c); in frame_coder()
634 wfa->tree [wfa->states][0] = tree[Cr]; in frame_coder()
635 wfa->tree [wfa->states][1] = RANGE; in frame_coder()
637 wfa->wfainfo->level + 1, wfa, c); in frame_coder()
638 wfa->tree[wfa->states][0] = YCb_node; in frame_coder()
639 wfa->tree[wfa->states][1] = wfa->states - 1; in frame_coder()
641 wfa->wfainfo->level + 2, wfa, c); in frame_coder()
[all …]
H A Dprediction.c85 wfa_t *wfa, coding_t *c);
201 remove_states (states, wfa); in predict_range()
203 rec_state_data, wfa, c); in predict_range()
304 if (need_image (state, wfa)) in mc_prediction()
325 1, 0, wfa, c); in mc_prediction()
327 wfa, c, NO, YES); in mc_prediction()
356 if (need_image (state, wfa)) in mc_prediction()
445 if (need_image (state, wfa)) in nd_prediction()
453 1, 0, wfa, c); in nd_prediction()
504 wfa_t *wfa, coding_t *c) in store_state_data() argument
[all …]
H A Dsubdivide.c51 wfa_t *wfa, coding_t *c);
580 wfa, in init_new_state()
592 wfa->tree [wfa->states][label] = child [label].tree; in init_new_state()
593 wfa->y_state [wfa->states][label] = y_state [label]; in init_new_state()
594 wfa->mv_tree [wfa->states][label] = child [label].mv; in init_new_state()
595 wfa->x [wfa->states][label] = child [label].x; in init_new_state()
596 wfa->y [wfa->states][label] = child [label].y; in init_new_state()
597 wfa->prediction [wfa->states][label] = child [label].prediction; in init_new_state()
602 wfa->delta_state [wfa->states] = delta; in init_new_state()
610 compute_final_distribution (wfa->states, wfa), in init_new_state()
[all …]
H A Ddfiasco.c83 wfa = alloc_wfa (NO); in fiasco_decoder_new()
86 read_basis (wfa->wfainfo->basis_name, wfa); in fiasco_decoder_new()
111 unsigned long pixels = wfa->wfainfo->width * wfa->wfainfo->height; in fiasco_decoder_new()
131 if (wfa->wfainfo->width >> n < 32 in fiasco_decoder_new()
132 || wfa->wfainfo->height >> n < 32) in fiasco_decoder_new()
165 dfiasco->wfa, dfiasco->input); in fiasco_decoder_write_frame()
192 dfiasco->wfa, dfiasco->input); in fiasco_decoder_get_frame()
229 return dfiasco->wfa->wfainfo->fps; in fiasco_decoder_get_rate()
280 return dfiasco->wfa->wfainfo->title; in fiasco_decoder_get_title()
315 free_wfa (dfiasco->wfa); in fiasco_decoder_delete()
[all …]
H A Dwfalib.h34 locate_delta_images (wfa_t *wfa);
37 range_sort_t *rs, const wfa_t *wfa);
40 const wfa_t *wfa, unsigned *range_state, unsigned *range_label);
50 remove_states (unsigned from, wfa_t *wfa);
53 unsigned label, wfa_t *wfa);
55 compute_hits (unsigned from, unsigned to, unsigned n, const wfa_t *wfa);
57 compute_final_distribution (unsigned state, const wfa_t *wfa);
61 free_wfa (wfa_t *wfa);
63 locate_delta_images (wfa_t *wfa);
H A Dip.c75 const wfa_t *wfa, coding_t *c) in compute_ip_images_state() argument
93 level - 1, MAXLABELS * n, from, wfa, c); in compute_ip_images_state()
99 for (state = from; state < wfa->states; state++) in compute_ip_images_state()
100 if (need_image (state, wfa)) in compute_ip_images_state()
106 if (ischild (domain = wfa->tree [state][label])) in compute_ip_images_state()
130 real_t weight = wfa->weight [state][label][edge]; in compute_ip_images_state()
186 const wfa_t *wfa, coding_t *c) in compute_ip_states_state() argument
208 if (need_image (state2, wfa)) in compute_ip_states_state()
219 if (ischild (domain1 = wfa->tree [state1][label])) in compute_ip_states_state()
230 weight2 = wfa->weight [state2][label][edge2]; in compute_ip_states_state()
[all …]
/dports/graphics/netpbm/netpbm-10.91.01/converter/other/fiasco/input/
H A Dmatrices.c69 ? wfa->tree [wfa->tree [wfa->root_state][0]][0] in read_matrices()
455 wfa->tree [wfa->tree [wfa->root_state][0]][0], in chroma_decoding()
456 wfa->wfainfo->chroma_max_states, wfa); in chroma_decoding()
468 unsigned row = wfa->tree [wfa->tree [wfa->root_state][0]][0] + 1; in chroma_decoding()
553 compute_y_state (wfa->tree [wfa->tree [wfa->root_state][0]][1], in chroma_decoding()
554 wfa->tree [wfa->tree [wfa->root_state][0]][0], wfa); in chroma_decoding()
555 compute_y_state (wfa->tree [wfa->tree [wfa->root_state][1]][0], in chroma_decoding()
556 wfa->tree [wfa->tree [wfa->root_state][0]][0], wfa); in chroma_decoding()
570 for (row = wfa->tree [wfa->tree [wfa->root_state][0]][0] + 1; in chroma_decoding()
638 wfa->y_state [state][label] = wfa->tree [y_state][label]; in compute_y_state()
[all …]
H A Dweights.c39 read_weights (unsigned total, wfa_t *wfa, bitfile_t *input) in read_weights() argument
62 for (state = wfa->basis_states; state < wfa->states; state++) in read_weights()
63 if (wfa->delta_state [state]) in read_weights()
86 for (state = wfa->basis_states; state < wfa->states; state++) in read_weights()
88 if (isrange (wfa->tree [state][label])) in read_weights()
120 for (state = wfa->basis_states; state < wfa->states; state++) in read_weights()
122 if (isrange (wfa->tree[state][label])) in read_weights()
173 for (state = wfa->basis_states; state < wfa->states; state++) in read_weights()
175 if (isrange (wfa->tree[state][label])) in read_weights()
182 wfa->weight [state][label][edge] in read_weights()
[all …]
H A Dread.c312 wfa->states = wfa->basis_states; in read_basis()
313 wfa->basis_states++; in read_basis()
319 wfa->domain_type [state] in read_basis()
368 assert (wfa && input); in read_next_wfa()
390 read_tiling (&tiling, wfa->wfainfo->width, wfa->wfainfo->height, in read_next_wfa()
406 for (state = wfa->basis_states; state < wfa->states; state++) in read_next_wfa()
408 || (int) state <= wfa->tree [wfa->tree [wfa->root_state][0]][0]) in read_next_wfa()
411 wfa->level_of_state [state] <= (wfa->wfainfo->level in read_next_wfa()
415 <= wfa->wfainfo->width) in read_next_wfa()
431 read_mc (wfa->frame_type, wfa, input); in read_next_wfa()
[all …]
H A Dmc.c54 wfa_t *wfa, bitfile_t *input);
83 ? wfa->tree [wfa->tree [wfa->root_state][0]][0] in read_mc()
84 : wfa->states; in read_mc()
98 wfa_t *wfa, bitfile_t *input) in decode_mc_tree() argument
122 if (wfa->level_of_state [state] - 1 == (int) wfa->wfainfo->p_max_level) in decode_mc_tree()
136 <= wfa->wfainfo->width in decode_mc_tree()
138 wfa->y [state][label] in decode_mc_tree()
140 <= wfa->wfainfo->height) in decode_mc_tree()
165 > wfa->wfainfo->width in decode_mc_tree()
167 wfa->y [state][label] in decode_mc_tree()
[all …]
H A Dnd.c40 decode_nd_tree (wfa_t *wfa, bitfile_t *input);
49 read_nd (wfa_t *wfa, bitfile_t *input) in read_nd() argument
99 state = wfa->root_state; in decode_nd_tree()
109 if (wfa->level_of_state [next] > wfa->wfainfo->p_max_level + 1) in decode_nd_tree()
119 else if (wfa->level_of_state [next] > wfa->wfainfo->p_min_level) in decode_nd_tree()
152 if (wfa->level_of_state [state] > wfa->wfainfo->p_min_level) in decode_nd_tree()
179 append_edge (next, 0, -1, label, wfa); in decode_nd_tree()
225 for (state = wfa->basis_states; state < wfa->states; state++) in decode_nd_coefficients()
228 && isedge (wfa->into [state][label][0])) in decode_nd_coefficients()
231 wfa->wfainfo->dc_rpf); in decode_nd_coefficients()
[all …]
H A Dtree.c41 wfa_t *wfa, tiling_t *tiling);
72 unsigned total = (wfa->states - wfa->basis_states) * MAXLABELS; in read_tree()
98 unsigned dst_state = wfa->basis_states; in read_tree()
100 wfa->root_state in read_tree()
102 + (wfa->wfainfo->color ? 2 : 0)), in read_tree()
120 wfa_t *wfa, tiling_t *tiling) in restore_depth_first_order() argument
164 if (wfa->wfainfo->color && level == wfa->wfainfo->level + 1) in restore_depth_first_order()
187 bfo_tree, wfa, tiling); in restore_depth_first_order()
194 wfa->x [*dst_state][label] = newx [label]; in restore_depth_first_order()
195 wfa->y [*dst_state][label] = newy [label]; in restore_depth_first_order()
[all …]
H A Dbasis.c66 get_linked_basis (const char *basis_name, wfa_t *wfa) in get_linked_basis() argument
92 wfa->basis_states = wfa->states = bv.states + 1; in get_linked_basis()
93 wfa->domain_type[0] = USE_DOMAIN_MASK; in get_linked_basis()
94 wfa->final_distribution[0] = 128; in get_linked_basis()
95 append_edge (0, 0, 1.0, 0, wfa); in get_linked_basis()
96 append_edge (0, 0, 1.0, 1, wfa); in get_linked_basis()
97 for (state = 1; state < wfa->basis_states; state++) in get_linked_basis()
99 wfa->final_distribution [state] = bv.final [state - 1]; in get_linked_basis()
100 wfa->domain_type [state] = bv.use_domain [state - 1] in get_linked_basis()
107 wfa); in get_linked_basis()
/dports/graphics/netpbm/netpbm-10.91.01/converter/other/fiasco/output/
H A Dweights.c40 write_weights (unsigned total, const wfa_t *wfa, bitfile_t *output) in write_weights() argument
65 for (state = wfa->basis_states; state < wfa->states; state++) in write_weights()
66 if (wfa->delta_state [state]) in write_weights()
79 for (state = wfa->basis_states; state < wfa->states; state++) in write_weights()
81 if (isrange (wfa->tree [state][label])) in write_weights()
87 if (wfa->into [state][label][0] == 0) in write_weights()
94 if (wfa->into [state][label][0] == 0) in write_weights()
126 for (state = wfa->basis_states; state < wfa->states; state++) in write_weights()
128 if (isrange (wfa->tree [state][label])) in write_weights()
143 wfa->wfainfo->d_rpf); in write_weights()
[all …]
H A Dmatrices.c73 ? wfa->tree [wfa->tree [wfa->root_state][0]][0] in write_matrices()
74 : wfa->root_state; in write_matrices()
79 wfa, root_state, output); in write_matrices()
81 if (wfa->wfainfo->color) in write_matrices()
211 if (usedomain (state, wfa) in delta_encoding()
217 if (usedomain (state, wfa) in delta_encoding()
421 wfa->tree [wfa->tree [wfa->root_state][0]][0], in chroma_encoding()
422 wfa->wfainfo->chroma_max_states, wfa); in chroma_encoding()
433 row = wfa->tree [wfa->tree [wfa->root_state][0]][0] + 1; in chroma_encoding()
502 for (row = wfa->tree [wfa->tree [wfa->root_state][0]][0] + 1; in chroma_encoding()
[all …]
H A Dmc.c77 unsigned max_state = wfa->wfainfo->color in write_mc()
78 ? wfa->tree[wfa->tree[wfa->root_state][0]][0] in write_mc()
79 : wfa->states; in write_mc()
124 if (wfa->level_of_state [state] - 1 == (int) wfa->wfainfo->p_max_level) in encode_mc_tree()
132 if (wfa->x [state][label] in encode_mc_tree()
134 <= wfa->wfainfo->width in encode_mc_tree()
136 wfa->y [state][label] in encode_mc_tree()
138 <= wfa->wfainfo->height) in encode_mc_tree()
145 wfa->level_of_state [state] - 1 >= in encode_mc_tree()
146 (int) wfa->wfainfo->p_min_level) in encode_mc_tree()
[all …]
H A Dnd.c50 write_nd (const wfa_t *wfa, bitfile_t *output) in write_nd() argument
58 unsigned total = encode_nd_tree (wfa, output); in write_nd()
61 encode_nd_coefficients (total, wfa, output); in write_nd()
99 state = wfa->root_state; in encode_nd_tree()
109 if (wfa->level_of_state [next] > wfa->wfainfo->p_max_level + 1) in encode_nd_tree()
119 else if (wfa->level_of_state [next] > wfa->wfainfo->p_min_level) in encode_nd_tree()
140 if (wfa->level_of_state [state] > wfa->wfainfo->p_min_level) in encode_nd_tree()
211 for (state = wfa->basis_states; state < wfa->states; state++) in encode_nd_coefficients()
213 if (ischild (wfa->tree [state][label]) in encode_nd_coefficients()
214 && isedge (wfa->into [state][label][0])) in encode_nd_coefficients()
[all …]
/dports/games/quake3-wfa/quake3-wfa-3.5b/
H A Dmaplist.cfg2 map "2forttron-wfa"
8 map "3level2-wfa"
14 map "abyss2-wfa"
20 map "aggressor-wfa"
26 map "arctic-wfa"
32 map "bulfort2-wfa"
38 map "cancer3-wfa"
98 map "sky2-wfa"
110 map "space-wfa"
128 map "welt-wfa"
[all …]
/dports/games/quake3-wfa/quake3-wfa-3.5b/help/
H A Dmaplist.cfg2 map "2forttron-wfa"
8 map "3level2-wfa"
14 map "abyss2-wfa"
20 map "bulfort2-wfa"
26 map "cancer3-wfa"
32 map "denali2-wfa"
38 map "elevate-wfa"
44 map "entropy-wfa"
56 map "kheops-wfa"
68 map "sky2-wfa"
[all …]
/dports/cad/ngspice_rework/ngspice-35/src/frontend/trannoise/
H A D1-f-code.c28 double *hfa, *wfa; in f_alpha() local
45 wfa = TMALLOC(double, length); in f_alpha()
48 wfa[0] = Q_d * GaussWa; in f_alpha()
54 wfa[i] = Q_d * GaussWa; in f_alpha()
61 wfa[n_pts] = 0.0; in f_alpha()
63 wfa[n_pts+1] = 0.0; in f_alpha()
70 plan_forward = fftw_plan_dft_r2c_1d(n_pts, wfa, (fftw_complex *)wfa, FFTW_ESTIMATE); in f_alpha()
77 out[i][0] = hfa[i]*wfa[i] - hfa[i+1]*wfa[i+1]; in f_alpha()
78 out[i][1] = hfa[i]*wfa[i+1] + hfa[i+1]*wfa[i]; in f_alpha()
97 rffts(wfa, n_exp, 1); in f_alpha()
[all …]

123456789