如下的代码段是关于C语言位操作片段的代码。
为太和等地区用户提供了全套网页设计制作服务，及太和网站建设行业解决方案。主营业务为成都网站建设、做网站、太和网站设计，以传统方式定制建设网站，并提供域名空间备案等一条龙服务，秉承以专业、用心的态度为用户提供真诚的服务。我们深信只要达到每一位用户的要求，就会得到认可，从而选择与我们长期合作。这样，我们也可以走得更远！
Copyright 2011 Shao-Chuan Wang
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
#include
#include
typedef struct {
int size;
} packed_bits;
#define INT_MAX_BIT_MASK (1 << (INT_NBITS-1))
{
if (!b_array)
return NULL;
p = malloc(sizeof(packed_bits));
if (!p) {
free(b_array);
return NULL;
}
p->size = n_int;
p->b = b_array;
return p;
}
{
int i;
if (!p)
return -1;
b = p->b;
for (i = p->size-1;i >= 0;i--) {
b[i] = b[i] << 1;
if (i-1 >=0 && b[i-1] & INT_MAX_BIT_MASK)
b[i]++;
}
return 0;
}
{
int i;
if (!p)
return -1;
b = p->b;
for (i = 0;i < p->size;i++) {
b[i] = b[i] >> 1;
if (i+1 < p->size && (b[i+1] & 1))
b[i] |= INT_MAX_BIT_MASK;
}
return 0;
}
{
unsigned int offset = n % INT_NBITS;
unsigned int idx = n / INT_NBITS;
if (!p)
return -1;
b = p->b;
return (b[idx] & (1 << offset)) != 0;
}
{
unsigned int offset = n % INT_NBITS;
unsigned int idx = n / INT_NBITS;
if (!p)
return -1;
b = p->b;
b[idx] |= (1<b;
b[idx] &= ~(1<b;
printf("%d", read_bit(p, j));
if (j % INT_NBITS==0)
printf("n");
}
printf("n");
return;
}
{
int n_int = 4;
if (!p) {
fprintf(stderr, "Out of memory!n");
return EXIT_FAILURE;
}
set_bit(p, 1);
set_bit(p, 127);
print_bits(p);
return 0;
} 
