/src/sys/arch/ews4800mips/stand/common/ |
cons_fb.c | 179 uint16_t bitmap; local in function:fb_drawfont 188 bitmap = *font_addr++; 189 for (j = 0; j < 12; j++, bitmap <<= 1) 190 fb_addr[j] = bitmap & 0x8000 ? CONS_FG : CONS_BG;
|
cons_fb.c | 179 uint16_t bitmap; local in function:fb_drawfont 188 bitmap = *font_addr++; 189 for (j = 0; j < 12; j++, bitmap <<= 1) 190 fb_addr[j] = bitmap & 0x8000 ? CONS_FG : CONS_BG;
|
/src/sys/external/bsd/drm2/dist/drm/i915/ |
i915_syncmap.c | 51 * A leaf holds an array of u32 seqno, and has height 0. The bitmap field 81 unsigned int bitmap; member in struct:i915_syncmap 100 BUILD_BUG_ON(KSYNCMAP > BITS_PER_TYPE((*root)->bitmap)); 197 if (!(p->bitmap & BIT(idx))) 214 p->bitmap = 0; 223 p->bitmap |= BIT(idx); 231 p->bitmap |= BIT(idx); 305 GEM_BUG_ON(!(p->parent->bitmap & BIT(idx))); 379 while ((i = ffs(p->bitmap))) { 380 p->bitmap &= ~0u << i [all...] |
i915_syncmap.c | 51 * A leaf holds an array of u32 seqno, and has height 0. The bitmap field 81 unsigned int bitmap; member in struct:i915_syncmap 100 BUILD_BUG_ON(KSYNCMAP > BITS_PER_TYPE((*root)->bitmap)); 197 if (!(p->bitmap & BIT(idx))) 214 p->bitmap = 0; 223 p->bitmap |= BIT(idx); 231 p->bitmap |= BIT(idx); 305 GEM_BUG_ON(!(p->parent->bitmap & BIT(idx))); 379 while ((i = ffs(p->bitmap))) { 380 p->bitmap &= ~0u << i [all...] |
/src/sys/arch/i386/pci/ |
pcibios.h | 53 uint16_t bitmap; member in struct:pcibios_linkmap
|
pcibios.h | 53 uint16_t bitmap; member in struct:pcibios_linkmap
|
pci_intr_fixup.c | 89 uint16_t bitmap; member in struct:pciintr_link_map 292 l->bitmap = pir->linkmap[pin].bitmap; 394 } else if (pir->linkmap[pin].bitmap != l->bitmap) { 401 "bad irq bitmap 0x%04x, " 404 link, pir->linkmap[pin].bitmap, l->bitmap); 407 l->bitmap &= pir->linkmap[pin].bitmap; [all...] |
pci_intr_fixup.c | 89 uint16_t bitmap; member in struct:pciintr_link_map 292 l->bitmap = pir->linkmap[pin].bitmap; 394 } else if (pir->linkmap[pin].bitmap != l->bitmap) { 401 "bad irq bitmap 0x%04x, " 404 link, pir->linkmap[pin].bitmap, l->bitmap); 407 l->bitmap &= pir->linkmap[pin].bitmap; [all...] |
/src/sys/external/bsd/drm2/dist/drm/vmwgfx/ |
vmwgfx_page_dirty.c | 63 * @bitmap_size: The size of the bitmap in bits. Typically equal to the 66 * @bitmap: A bitmap where each bit represents a page. A set bit means a 77 unsigned long bitmap[0]; member in struct:vmw_bo_dirty 98 offset, &dirty->bitmap[0], 112 offset, &dirty->bitmap[0], 153 &dirty->bitmap[0], 155 bitmap_clear(&dirty->bitmap[0], 0, dirty->bitmap_size); 157 bitmap_set(&dirty->bitmap[0], dirty->start, 204 &dirty->bitmap[0], &dirty->start [all...] |
vmwgfx_page_dirty.c | 63 * @bitmap_size: The size of the bitmap in bits. Typically equal to the 66 * @bitmap: A bitmap where each bit represents a page. A set bit means a 77 unsigned long bitmap[0]; member in struct:vmw_bo_dirty 98 offset, &dirty->bitmap[0], 112 offset, &dirty->bitmap[0], 153 &dirty->bitmap[0], 155 bitmap_clear(&dirty->bitmap[0], 0, dirty->bitmap_size); 157 bitmap_set(&dirty->bitmap[0], dirty->start, 204 &dirty->bitmap[0], &dirty->start [all...] |
/src/sys/netipsec/ |
keydb.h | 153 char *bitmap; /* used by receiver */ member in struct:secreplay
|
keydb.h | 153 char *bitmap; /* used by receiver */ member in struct:secreplay
|
/src/sys/kern/ |
subr_blist.c | 30 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting 32 * This module implements a general bitmap allocator/deallocator. The 37 * A radix tree is used to maintain the bitmap. Two radix constants are 55 * fragmentation there is and no matter how large a bitmap is used. 132 blist_bitmap_t bmu_bitmap; /* bitmap if we are a leaf */ 236 * blist_alloc() - reserve space in the block bitmap. Return the base 258 * blist_free() - free up space in the block bitmap. Return the base 276 * blist_fill() - mark a region in the block bitmap as off-limits 302 * the tree and transfer the previous bitmap to the new 354 * blist_leaf_alloc() - allocate at a leaf in the radix tree (a bitmap) 768 blist_bitmap_t mask, bitmap; local in function:blst_leaf_fill [all...] |
subr_blist.c | 30 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting 32 * This module implements a general bitmap allocator/deallocator. The 37 * A radix tree is used to maintain the bitmap. Two radix constants are 55 * fragmentation there is and no matter how large a bitmap is used. 132 blist_bitmap_t bmu_bitmap; /* bitmap if we are a leaf */ 236 * blist_alloc() - reserve space in the block bitmap. Return the base 258 * blist_free() - free up space in the block bitmap. Return the base 276 * blist_fill() - mark a region in the block bitmap as off-limits 302 * the tree and transfer the previous bitmap to the new 354 * blist_leaf_alloc() - allocate at a leaf in the radix tree (a bitmap) 768 blist_bitmap_t mask, bitmap; local in function:blst_leaf_fill [all...] |
/src/sys/arch/ofppc/ofppc/ |
machdep.c | 88 * Scan the device tree for ranges, and return them as bitmap 0..15 91 ranges_bitmap(int node, uint16_t bitmap) 117 bitmap |= 1 << ((addr+j*0x10000000) >> 28); 118 bitmap |= 1 << (addr >> 28); 121 bitmap |= ranges_bitmap(child, bitmap); 124 return bitmap; 131 uint16_t bitmap; local in function:initppc 146 bitmap = ranges_bitmap(node, 0); 154 if (bitmap & (1 << i)) [all...] |
machdep.c | 88 * Scan the device tree for ranges, and return them as bitmap 0..15 91 ranges_bitmap(int node, uint16_t bitmap) 117 bitmap |= 1 << ((addr+j*0x10000000) >> 28); 118 bitmap |= 1 << (addr >> 28); 121 bitmap |= ranges_bitmap(child, bitmap); 124 return bitmap; 131 uint16_t bitmap; local in function:initppc 146 bitmap = ranges_bitmap(node, 0); 154 if (bitmap & (1 << i)) [all...] |
/src/sys/arch/arm/apple/ |
apple_rtkit.c | 127 uint64_t base, bitmap, reply; local in function:rtkit_handle_mgmt 159 bitmap = RTKIT_MGMT_EPMAP_BITMAP(msg->data0); 160 state->epmap |= (bitmap << (base * 32));
|
apple_rtkit.c | 127 uint64_t base, bitmap, reply; local in function:rtkit_handle_mgmt 159 bitmap = RTKIT_MGMT_EPMAP_BITMAP(msg->data0); 160 state->epmap |= (bitmap << (base * 32));
|
/src/sys/external/bsd/drm2/dist/drm/nouveau/ |
nouveau_dmem.c | 68 unsigned long bitmap[BITS_TO_LONGS(DMEM_CHUNK_NPAGES)]; member in struct:nouveau_dmem_chunk 113 clear_bit(idx, chunk->bitmap); 247 bitmap_zero(chunk->bitmap, DMEM_CHUNK_NPAGES); 310 i = find_first_zero_bit(chunk->bitmap, DMEM_CHUNK_NPAGES); 313 set_bit(i, chunk->bitmap); 317 i = find_next_zero_bit(chunk->bitmap,
|
nouveau_dmem.c | 68 unsigned long bitmap[BITS_TO_LONGS(DMEM_CHUNK_NPAGES)]; member in struct:nouveau_dmem_chunk 113 clear_bit(idx, chunk->bitmap); 247 bitmap_zero(chunk->bitmap, DMEM_CHUNK_NPAGES); 310 i = find_first_zero_bit(chunk->bitmap, DMEM_CHUNK_NPAGES); 313 set_bit(i, chunk->bitmap); 317 i = find_next_zero_bit(chunk->bitmap,
|
/src/sys/fs/adosfs/ |
adosfs.h | 125 u_long *bitmap; /* allocation bitmap */ member in struct:adosfsmount
|
/src/sys/net/npf/ |
npf_portmap.c | 30 * The port map is a bitmap used to track TCP/UDP ports used for 65 * and the value serves as a pointer to the second level bitmap. 91 typedef struct bitmap { struct 94 LIST_ENTRY(bitmap) entry; 103 LIST_HEAD(, bitmap) bitmap_list; 461 /* Success: insert the bitmap into the list. */ 466 /* Race: use an existing bitmap. */
|
/src/sys/arch/atari/dev/ |
grfabs_reg.h | 64 typedef struct bitmap bmap_t; 73 bmap_t *bitmap; /* bitmap. */ member in struct:view 86 * Bitmap stuff. 88 struct bitmap { struct 91 u_short depth; /* depth of bitmap. */ 92 u_char *plane; /* plane data for bitmap/vga. */
|
/src/sys/arch/sgimips/gio/ |
grtwo.c | 603 u_int8_t *bitmap = (u_int8_t *) font->data + (ch - font->firstchar + 1) * font->fontheight * font->stride; local in function:grtwo_putchar 632 pattern = *bitmap | (*bitmap << 8); 634 bitmap -= font->stride;
|
light.c | 398 uint8_t *bitmap; local in function:light_putchar 402 bitmap = (u_int8_t *)font->data + 426 pattern = *bitmap << 24; 428 bitmap += font->stride;
|