main/slinfactory.c

   1 /*
   2  * Asterisk -- An open source telephony toolkit.
   3  *
   4  * Copyright (C) 2005, Anthony Minessale II.
   5  *
   6  * Anthony Minessale <anthmct@yahoo.com>
   7  *
   8  * See http://www.asterisk.org for more information about
   9  * the Asterisk project. Please do not directly contact
  10  * any of the maintainers of this project for assistance;
  11  * the project provides a web site, mailing lists and IRC
  12  * channels for your use.
  13  *
  14  * This program is free software, distributed under the terms of
  15  * the GNU General Public License Version 2. See the LICENSE file
  16  * at the top of the source tree.
  17  */
  18
  19 /*! \file
  20  *
  21  * \brief A machine to gather up arbitrary frames and convert them
  22  * to raw slinear on demand.
  23  *
  24  * \author Anthony Minessale <anthmct@yahoo.com>
  25  */
  26
  27 #include "asterisk.h"
  28
  29 ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
  30
  31 #include <string.h>
  32
  33 #include "asterisk/frame.h"
  34 #include "asterisk/slinfactory.h"
  35 #include "asterisk/logger.h"
  36 #include "asterisk/translate.h"
  37
  38 void ast_slinfactory_init(struct ast_slinfactory *sf)
  39 {
  40         memset(sf, 0, sizeof(*sf));
  41         sf->offset = sf->hold;
  42 }
  43
  44 void ast_slinfactory_destroy(struct ast_slinfactory *sf)
  45 {
  46         struct ast_frame *f;
  47
  48         if (sf->trans) {
  49                 ast_translator_free_path(sf->trans);
  50                 sf->trans = NULL;
  51         }
  52
  53         while ((f = AST_LIST_REMOVE_HEAD(&sf->queue, frame_list)))
  54                 ast_frfree(f);
  55 }
  56
  57 int ast_slinfactory_feed(struct ast_slinfactory *sf, struct ast_frame *f)
  58 {
  59         struct ast_frame *frame, *frame_ptr;
  60         unsigned int x;
  61
  62         if (f->subclass != AST_FORMAT_SLINEAR) {
  63                 if (sf->trans && f->subclass != sf->format) {
  64                         ast_translator_free_path(sf->trans);
  65                         sf->trans = NULL;
  66                 }
  67                 if (!sf->trans) {
  68                         if ((sf->trans = ast_translator_build_path(AST_FORMAT_SLINEAR, f->subclass)) == NULL) {
  69                                 ast_log(LOG_WARNING, "Cannot build a path from %s to slin\n", ast_getformatname(f->subclass));
  70                                 return 0;
  71                         } else {
  72                                 sf->format = f->subclass;
  73                         }
  74                 }
  75         }
  76
  77         if (!(frame = ast_frdup( (sf->trans) ? ast_translate(sf->trans, f, 0) : f )))
  78                 return 0;
  79
  80         x = 0;
  81         AST_LIST_TRAVERSE(&sf->queue, frame_ptr, frame_list)
  82                 x++;
  83
  84         AST_LIST_INSERT_TAIL(&sf->queue, frame, frame_list);
  85
  86         sf->size += frame->samples;
  87
  88         return x;
  89 }
  90
  91 int ast_slinfactory_read(struct ast_slinfactory *sf, short *buf, size_t samples)
  92 {
  93         struct ast_frame *frame_ptr;
  94         unsigned int sofar = 0, ineed, remain;
  95         short *frame_data, *offset = buf;
  96
  97         while (sofar < samples) {
  98                 ineed = samples - sofar;
  99
 100                 if (sf->holdlen) {
 101                         if ((sofar + sf->holdlen) <= ineed) {
 102                                 memcpy(offset, sf->hold, sf->holdlen * sizeof(*offset));
 103                                 sofar += sf->holdlen;
 104                                 offset += sf->holdlen;
 105                                 sf->holdlen = 0;
 106                                 sf->offset = sf->hold;
 107                         } else {
 108                                 remain = sf->holdlen - ineed;
 109                                 memcpy(offset, sf->offset, ineed * sizeof(*offset));
 110                                 sofar += ineed;
 111                                 sf->offset += ineed;
 112                                 sf->holdlen = remain;
 113                         }
 114                         continue;
 115                 }
 116
 117                 if ((frame_ptr = AST_LIST_REMOVE_HEAD(&sf->queue, frame_list))) {
 118                         frame_data = frame_ptr->data;
 119
 120                         if ((sofar + frame_ptr->samples) <= ineed) {
 121                                 memcpy(offset, frame_data, frame_ptr->samples * sizeof(*offset));
 122                                 sofar += frame_ptr->samples;
 123                                 offset += frame_ptr->samples;
 124                         } else {
 125                                 remain = frame_ptr->samples - ineed;
 126                                 memcpy(offset, frame_data, ineed * sizeof(*offset));
 127                                 sofar += ineed;
 128                                 frame_data += ineed;
 129                                 memcpy(sf->hold, frame_data, remain * sizeof(*offset));
 130                                 sf->holdlen = remain;
 131                         }
 132                         ast_frfree(frame_ptr);
 133                 } else {
 134                         break;
 135                 }
 136         }
 137
 138         sf->size -= sofar;
 139         return sofar;
 140 }
 141
 142 unsigned int ast_slinfactory_available(const struct ast_slinfactory *sf)
 143 {
 144         return sf->size;
 145 }