HomeSort by: relevance | last modified time | path
    Searched refs:black (Results 1 - 7 of 7) sorted by relevancy

  /src/usr.sbin/tpctl/
tpctl.h 84 fb_pixel_t white, black; member in struct:fb
fb.c 120 fb->black = ~0;
123 fb->black = 0;
131 memset(fb->linecache, fb->black,
main.c 324 cursize, fb.black);
  /src/sys/external/bsd/drm2/dist/drm/i915/display/
intel_tv.c 61 u16 blank, black; member in struct:video_levels
200 .blank = 225, .black = 267, .burst = 113,
210 .blank = 266, .black = 316, .burst = 133,
220 .blank = 225, .black = 225, .burst = 113,
230 .blank = 266, .black = 266, .burst = 133,
240 .blank = 237, .black = 237, .burst = 118,
250 .blank = 280, .black = 280, .burst = 139,
260 .blank = 225, .black = 267, .burst = 113,
270 .blank = 266, .black = 316, .burst = 133,
280 .blank = 225, .black = 267, .burst = 118
    [all...]
  /src/games/canfield/canfield/
canfield.c 120 #define black 'b' macro
160 static char colormap[4] = {black, black, red, red};
  /src/sys/sys/
tree.h 33 * splay trees and red-black trees.
47 * A red-black tree is a binary search tree with the node color as an
50 * same number of black nodes,
51 * - each red node (except for the root) has a black parent,
52 * - each leaf node is black.
54 * Every operation on a red-black tree is bounded as O(lg n).
55 * The maximum height of a red-black tree is 2lg (n+1).
291 /* Macros that define a red-black tree */
327 #define RB_SET_BLACKRED(black, red, field) do { \
328 RB_COLOR(black, field) = RB_BLACK;
    [all...]
  /src/sys/dev/tc/
mfb.c 354 - assign Bt455 cmap[1].green with value 0 (black),
582 /* 0: black, 1: white, 8,9: cursor mask, ovly: cursor image */

Completed in 19 milliseconds