X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=lib%2Fbch.c;h=20079eb9ebd12eb3d38b37f30d515b131f55a383;hb=cb728e51a77e515659f4834c2829a956b9f5c9f0;hp=147715afd06a7a39216d4215e1601e5a5d977917;hpb=e6ac28b60be2d670948332197862e314b7977177;p=oweals%2Fu-boot.git diff --git a/lib/bch.c b/lib/bch.c index 147715afd0..20079eb9eb 100644 --- a/lib/bch.c +++ b/lib/bch.c @@ -1,8 +1,7 @@ +// SPDX-License-Identifier: GPL-2.0 /* * Generic binary BCH encoding/decoding library * - * SPDX-License-Identifier: GPL-2.0 - * * Copyright © 2011 Parrot S.A. * * Author: Ivan Djelic @@ -54,10 +53,31 @@ * finite fields GF(2^q). In Rapport de recherche INRIA no 2829, 1996. */ +#ifndef USE_HOSTCC #include #include #include +#else +#include +#if defined(__FreeBSD__) +#include +#else +#include +#endif +#include +#include +#include + +#undef cpu_to_be32 +#define cpu_to_be32 htobe32 +#define DIV_ROUND_UP(n,d) (((n) + (d) - 1) / (d)) +#define kmalloc(size, flags) malloc(size) +#define kzalloc(size, flags) calloc(1, size) +#define kfree free +#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0])) +#endif + #include #include @@ -95,6 +115,39 @@ struct gf_poly_deg1 { unsigned int c[2]; }; +#ifdef USE_HOSTCC +#if !defined(__DragonFly__) && !defined(__FreeBSD__) +static int fls(int x) +{ + int r = 32; + + if (!x) + return 0; + if (!(x & 0xffff0000u)) { + x <<= 16; + r -= 16; + } + if (!(x & 0xff000000u)) { + x <<= 8; + r -= 8; + } + if (!(x & 0xf0000000u)) { + x <<= 4; + r -= 4; + } + if (!(x & 0xc0000000u)) { + x <<= 2; + r -= 2; + } + if (!(x & 0x80000000u)) { + x <<= 1; + r -= 1; + } + return r; +} +#endif +#endif + /* * same as encode_bch(), but process input data one byte at a time */