summaryrefslogtreecommitdiff
path: root/src/libfaad
diff options
context:
space:
mode:
Diffstat (limited to 'src/libfaad')
-rw-r--r--src/libfaad/mdct.c2
-rw-r--r--src/libfaad/syntax.c4
2 files changed, 3 insertions, 3 deletions
diff --git a/src/libfaad/mdct.c b/src/libfaad/mdct.c
index cd873a6f9..0df3d6aae 100644
--- a/src/libfaad/mdct.c
+++ b/src/libfaad/mdct.c
@@ -33,7 +33,7 @@
* As described in:
* P. Duhamel, Y. Mahieux, and J.P. Petit, "A Fast Algorithm for the
* Implementation of Filter Banks Based on 'Time Domain Aliasing
- * Cancellation’," IEEE Proc. on ICASSP‘91, 1991, pp. 2209-2212.
+ * Cancellation'," IEEE Proc. on ICASSP'91, 1991, pp. 2209-2212.
*
*
* As of April 6th 2002 completely rewritten.
diff --git a/src/libfaad/syntax.c b/src/libfaad/syntax.c
index a32988177..6dc9fc57d 100644
--- a/src/libfaad/syntax.c
+++ b/src/libfaad/syntax.c
@@ -2048,11 +2048,11 @@ static uint16_t extension_payload(bitfile *ld, drc_info *drc, uint16_t count)
return n;
case EXT_FILL_DATA:
/* fill_nibble = */ faad_getbits(ld, 4
- DEBUGVAR(1,136,"extension_payload(): fill_nibble")); /* must be ‘0000’ */
+ DEBUGVAR(1,136,"extension_payload(): fill_nibble")); /* must be '0000' */
for (i = 0; i < count-1; i++)
{
/* fill_byte[i] = */ faad_getbits(ld, 8
- DEBUGVAR(1,88,"extension_payload(): fill_byte")); /* must be ‘10100101’ */
+ DEBUGVAR(1,88,"extension_payload(): fill_byte")); /* must be '10100101' */
}
return count;
case EXT_DATA_ELEMENT: