Mercurial > libavutil.hg

changeset 446:81f4d434dc96 libavutil

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Missing const found by -Wwrite-strings.
author michael
date Sun, 03 Feb 2008 21:56:13 +0000
parents 1b2867913935
children 945e9a276df9
files sha1.c sha1.h
diffstat 2 files changed, 4 insertions(+), 4 deletions(-) [+]
line wrap: on
line diff
--- a/sha1.c	Fri Feb 01 16:30:51 2008 +0000
+++ b/sha1.c	Sun Feb 03 21:56:13 2008 +0000
@@ -34,7 +34,7 @@
 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
 
 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
-#define blk0(i) (block[i] = be2me_32(((uint32_t*)buffer)[i]))
+#define blk0(i) (block[i] = be2me_32(((const uint32_t*)buffer)[i]))
 #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
 
 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)    +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
@@ -45,7 +45,7 @@
 
 /* Hash a single 512-bit block. This is the core of the algorithm. */
 
-static void transform(uint32_t state[5], uint8_t buffer[64]){
+static void transform(uint32_t state[5], const uint8_t buffer[64]){
     uint32_t block[80];
     unsigned int i, a, b, c, d, e;
 
@@ -105,7 +105,7 @@
     ctx->count    = 0;
 }
 
-void av_sha1_update(AVSHA1* ctx, uint8_t* data, unsigned int len){
+void av_sha1_update(AVSHA1* ctx, const uint8_t* data, unsigned int len){
     unsigned int i, j;
 
     j = ctx->count & 63;
--- a/sha1.h	Fri Feb 01 16:30:51 2008 +0000
+++ b/sha1.h	Sun Feb 03 21:56:13 2008 +0000
@@ -28,7 +28,7 @@
 struct AVSHA1;
 
 void av_sha1_init(struct AVSHA1* context);
-void av_sha1_update(struct AVSHA1* context, uint8_t* data, unsigned int len);
+void av_sha1_update(struct AVSHA1* context, const uint8_t* data, unsigned int len);
 void av_sha1_final(struct AVSHA1* context, uint8_t digest[20]);
 
 #endif /* FFMPEG_SHA1_H */