*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* This is the core function of the filter subsystem. It loops over the list of
* filter nodes determined by \a t and calls the filter's convert function if
* there is input available for the filter node in question. If the convert
* This is the core function of the filter subsystem. It loops over the list of
* filter nodes determined by \a t and calls the filter's convert function if
* there is input available for the filter node in question. If the convert
conv = 0;
list_for_each_entry(fn, &fc->filters, node) {
if (*loaded && fn->loaded < fn->bufsize) {
conv = 0;
list_for_each_entry(fn, &fc->filters, node) {
if (*loaded && fn->loaded < fn->bufsize) {
// PARA_DEBUG_LOG("fc %p loaded: %zd, calling %s convert\n",
// fc, *loaded, fn->filter->name);
t->ret = fn->filter->convert(ib, *loaded, fn);
if (t->ret < 0)
goto err_out;
// PARA_DEBUG_LOG("fc %p loaded: %zd, calling %s convert\n",
// fc, *loaded, fn->filter->name);
t->ret = fn->filter->convert(ib, *loaded, fn);
if (t->ret < 0)
goto err_out;
- call_callbacks(fn, ib, t->ret, fn->buf + old_fn_loaded,
+ size = t->ret;
+ call_callbacks(fn, ib, size, fn->buf + old_fn_loaded,
// PARA_DEBUG_LOG("moving %zd bytes in input "
// "buffer for %s filter\n",
// *loaded, fn->filter->name);
// PARA_DEBUG_LOG("moving %zd bytes in input "
// "buffer for %s filter\n",
// *loaded, fn->filter->name);
argv[0] = para_strdup(f->name);
argc += 1;
*conf = f->parse_config(argc, argv);
argv[0] = para_strdup(f->name);
argc += 1;
*conf = f->parse_config(argc, argv);