Type to use to represent a byte in ANSI (C89/90) C?

Is there a standards-complaint method to represent a byte in ANSI (C89/90) C? I know that, most often, a char happens to be a byte, but my understanding is that this is not guaranteed to be the case. Also, there is stdint.h in the C99 standard, but what was used before C99?

I'm curious about both 8 bits specifically, and a "byte" (sizeof(x) == 1).


char is always a byte , but it's not always an octet . A byte is the smallest addressable unit of memory (in most definitions), an octet is 8-bit unit of memory.

That is, sizeof(char) is always 1 for all implementations, but CHAR_BIT macro in limits.h defines the size of a byte for a platform and it is not always 8 bit. There are platforms with 16-bit and 32-bit bytes, hence char will take up more bits, but it is still a byte. Since required range for char is at least -127 to 127 (or 0 to 255), it will be at least 8 bit on all platforms.

ISO/IEC 9899:TC3

6.5.3.4 The sizeof operator

  • ...
  • The sizeof operator yields the size ( in bytes ) of its operand, which may be an expression or the parenthesized name of a type. [...]
  • When applied to an operand that has type char , unsigned char , or signed char , (or a qualified version thereof) the result is 1 . [...]
  • Emphasis mine.


    You can always represent a byte (if you mean 8bits) in a unsigned char. It's always at least 8 bits in size, all bits making up the value, so a 8 bit value will always fit into it.

    If you want exactly 8 bits, i also think you'll have to use platform dependent ways. POSIX systems seem to be required to support int8_t. That means that on POSIX systems, char (and thus a byte) is always 8 bits.


    In ANSI C89/ISO C90 sizeof(char) == 1. However, it is not always the case that 1 byte is 8 bits. If you wish to count the number of bits in 1 byte (and you don't have access to limits.h), I suggest the following:

    unsigned int bitnum(void) {
        unsigned char c = ~0u; /* Thank you Jonathan. */
        unsigned int v;
    
        for(v = 0u; c; ++v)
            c &= c - 1u;
        return(v);
    }
    

    Here we use Kernighan's method to count the number of bits set in c. To better understand the code above (or see others like it), I refer you to "Bit Twiddling Hacks".

    链接地址: http://www.djcxy.com/p/6896.html

    上一篇: 函数声明结束时的“const”是什么意思?

    下一篇: 用于表示ANSI(C89 / 90)C中的字节的类型?