};
/* Prototypes */
-static struct ast_channel *local_get_channel_by_name(char *name);
static struct ast_channel *local_get_channel_begin_name(char *name);
static struct ast_channel *local_channel_walk(struct ast_channel *chan);
static void spy_release(struct ast_channel *chan, void *data);
static int chanspy_exec(struct ast_channel *chan, void *data);
+#if 0
static struct ast_channel *local_get_channel_by_name(char *name)
{
struct ast_channel *ret;
return ret;
}
+#endif
static struct ast_channel *local_channel_walk(struct ast_channel *chan)
{
return -1;
}
+#if 0
static void wakeup_sub(struct feature_pvt *p, int a)
{
struct ast_frame null = { AST_FRAME_NULL, };
break;
}
}
+#endif
static void restore_channel(struct feature_pvt *p, int index)
{
}
}
+#if 0
static void swap_subs(struct feature_pvt *p, int a, int b)
{
int tinthreeway;
wakeup_sub(p, a);
wakeup_sub(p, b);
}
+#endif
static int features_answer(struct ast_channel *ast)
{
static struct ast_channel *oss_request(const char *type, int format, void *data, int *cause);
static int oss_digit(struct ast_channel *c, char digit);
-static int oss_text(struct ast_channel *c, char *text);
+static int oss_text(struct ast_channel *c, const char *text);
static int oss_hangup(struct ast_channel *c);
static int oss_answer(struct ast_channel *c);
static struct ast_frame *oss_read(struct ast_channel *chan);
return 0;
}
-static int oss_text(struct ast_channel *c, char *text)
+static int oss_text(struct ast_channel *c, const char *text)
{
ast_verbose( " << Console Received text %s >> \n", text);
return 0;
*/
/* Nonportable, but faster: */
-#define GSM_ADD(a, b) \
- ((ulongword)((ltmp = (longword)(a) + (longword)(b)) - MIN_WORD) > \
- MAX_WORD - MIN_WORD ? (ltmp > 0 ? MAX_WORD : MIN_WORD) : ltmp)
-
-# define GSM_SUB(a, b) \
- ((ltmp = (longword)(a) - (longword)(b)) >= MAX_WORD \
- ? MAX_WORD : ltmp <= MIN_WORD ? MIN_WORD : ltmp)
+# define GSM_ADD(a, b) ({ \
+ register longword ltmp; \
+ ltmp = (longword) (a) + (longword) (b); \
+ ((ulongword) (ltmp - MIN_WORD) > MAX_WORD - MIN_WORD ? \
+ (ltmp > 0 ? MAX_WORD : MIN_WORD) : ltmp); \
+ })
+
+#define GSM_SUB(a, b) ({ \
+ register longword ltmp; \
+ ltmp = (longword) (a) - (longword) (b); \
+ (ltmp >= MAX_WORD ? MAX_WORD : ltmp <= MIN_WORD ? MIN_WORD : ltmp); \
+ })
#endif
{
register int k;
register word msr = S->msr;
- register longword ltmp; /* for GSM_ADD */
register word tmp;
for (k = 160; k--; s++) {
*/
{
register int k;
- register longword ltmp;
# undef STEP
# define STEP(BP) \
* table 4.3b.
*/
{
- register longword ltmp; /* for ADD */
register int k;
word brp, drpp, Nr;
{
register int i, m, n;
register word temp;
- register longword ltmp;
word ACF[9]; /* 0..8 */
word P[ 9]; /* 0..8 */
word K[ 9]; /* 2..8 */
)
{
register word temp;
- longword ltmp;
/* This procedure needs four tables; the following equations
word SO;
- longword ltmp; /* for ADD */
ulongword utmp; /* for L_ADD */
register int k = 160;
/* Execution of a 31 bv 16 bits multiplication
*/
{
- word msp, lsp;
+ word msp;
+#ifndef __GNUC__
+ word lsp;
+#endif
longword L_s2;
longword L_temp;
{
int i;
word temp, temp1, temp2, temp3;
- longword ltmp;
assert( mant >= 0 && mant <= 7 );
word * LARpp) /* out: decoded .. */
{
register word temp1 /* , temp2 */;
- register long ltmp; /* for GSM_ADD */
/* This procedure requires for efficient implementation
* two tables.
register word * LARp)
{
register int i;
- register longword ltmp;
for (i = 1; i <= 8; i++, LARp++, LARpp_j_1++, LARpp_j++) {
*LARp = GSM_ADD( SASR( *LARpp_j_1, 2 ), SASR( *LARpp_j, 2 ));
register word * LARp)
{
register int i;
- register longword ltmp;
for (i = 1; i <= 8; i++, LARpp_j_1++, LARpp_j++, LARp++) {
*LARp = GSM_ADD( SASR( *LARpp_j_1, 1), SASR( *LARpp_j, 1 ));
}
register word * LARp)
{
register int i;
- register longword ltmp;
for (i = 1; i <= 8; i++, LARpp_j_1++, LARpp_j++, LARp++) {
*LARp = GSM_ADD( SASR( *LARpp_j_1, 2 ), SASR( *LARpp_j, 2 ));
{
register int i;
register word temp;
- register longword ltmp;
for (i = 1; i <= 8; i++, LARp++) {
/* maybe later we can make the history buckets variable size, or something? */
/* drop parameter determines whether we will drop outliers to minimize
* delay */
+#if 0
static int longcmp(const void *a, const void *b)
{
return *(long *)a - *(long *)b;
}
+#endif
static void history_put(jitterbuf *jb, long ts, long now)
{