mirror of
				https://github.com/torvalds/linux.git
				synced 2025-11-04 10:40:15 +02:00 
			
		
		
		
	lib: Use existing define with polynomial
Do not define again the polynomial but use header with existing define. Signed-off-by: Krzysztof Kozlowski <krzk@kernel.org> Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
This commit is contained in:
		
							parent
							
								
									9ecdb98419
								
							
						
					
					
						commit
						faa16bc404
					
				
					 2 changed files with 4 additions and 2 deletions
				
			
		| 
						 | 
				
			
			@ -51,6 +51,7 @@
 | 
			
		|||
#endif /* STATIC */
 | 
			
		||||
 | 
			
		||||
#include <linux/decompress/mm.h>
 | 
			
		||||
#include <linux/crc32poly.h>
 | 
			
		||||
 | 
			
		||||
#ifndef INT_MAX
 | 
			
		||||
#define INT_MAX 0x7fffffff
 | 
			
		||||
| 
						 | 
				
			
			@ -654,7 +655,7 @@ static int INIT start_bunzip(struct bunzip_data **bdp, void *inbuf, long len,
 | 
			
		|||
	for (i = 0; i < 256; i++) {
 | 
			
		||||
		c = i << 24;
 | 
			
		||||
		for (j = 8; j; j--)
 | 
			
		||||
			c = c&0x80000000 ? (c << 1)^0x04c11db7 : (c << 1);
 | 
			
		||||
			c = c&0x80000000 ? (c << 1)^(CRC32_POLY_BE) : (c << 1);
 | 
			
		||||
		bd->crc32Table[i] = c;
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
| 
						 | 
				
			
			@ -15,6 +15,7 @@
 | 
			
		|||
 * but they are bigger and use more memory for the lookup table.
 | 
			
		||||
 */
 | 
			
		||||
 | 
			
		||||
#include <linux/crc32poly.h>
 | 
			
		||||
#include "xz_private.h"
 | 
			
		||||
 | 
			
		||||
/*
 | 
			
		||||
| 
						 | 
				
			
			@ -29,7 +30,7 @@ STATIC_RW_DATA uint32_t xz_crc32_table[256];
 | 
			
		|||
 | 
			
		||||
XZ_EXTERN void xz_crc32_init(void)
 | 
			
		||||
{
 | 
			
		||||
	const uint32_t poly = 0xEDB88320;
 | 
			
		||||
	const uint32_t poly = CRC32_POLY_LE;
 | 
			
		||||
 | 
			
		||||
	uint32_t i;
 | 
			
		||||
	uint32_t j;
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
		Loading…
	
		Reference in a new issue