HelenOS sources
B_COLS 68 uspace/app/tetris/screen.c #define STOP (B_COLS - 3)
B_COLS 236 uspace/app/tetris/screen.c curscreen[D_LAST * B_COLS - 1] = -1;
B_COLS 271 uspace/app/tetris/screen.c t = c + r * B_COLS;
B_COLS 274 uspace/app/tetris/screen.c tr = t / B_COLS;
B_COLS 275 uspace/app/tetris/screen.c tc = t % B_COLS;
B_COLS 283 uspace/app/tetris/screen.c bp = &board[D_FIRST * B_COLS];
B_COLS 284 uspace/app/tetris/screen.c sp = &curscreen[D_FIRST * B_COLS];
B_COLS 287 uspace/app/tetris/screen.c for (i = 0; i < B_COLS; bp++, sp++, i++) {
B_COLS 60 uspace/app/tetris/shapes.c #define TL (-B_COLS - 1) /* top left */
B_COLS 61 uspace/app/tetris/shapes.c #define TC (-B_COLS) /* top center */
B_COLS 62 uspace/app/tetris/shapes.c #define TR (-B_COLS + 1) /* top right */
B_COLS 65 uspace/app/tetris/shapes.c #define BL (B_COLS - 1) /* bottom left */
B_COLS 66 uspace/app/tetris/shapes.c #define BC B_COLS /* bottom center */
B_COLS 67 uspace/app/tetris/shapes.c #define BR (B_COLS + 1) /* bottom right */
B_COLS 88 uspace/app/tetris/shapes.c /* 18 */ { 6, 6, { TC, BC, 2 * B_COLS }, 0xaa0000 } /* sticks out */
B_COLS 101 uspace/app/tetris/tetris.c *p++ = (i <= (2 * B_COLS) || (i % B_COLS) < 2) ? 0x0000ff : 0x000000;
B_COLS 116 uspace/app/tetris/tetris.c base = i * B_COLS + 1;
B_COLS 118 uspace/app/tetris/tetris.c j = B_COLS - 2;
B_COLS 123 uspace/app/tetris/tetris.c memset(&board[base], 0, sizeof(cell) * (B_COLS - 2));
B_COLS 129 uspace/app/tetris/tetris.c board[base + B_COLS] = board[base];
B_COLS 325 uspace/app/tetris/tetris.c pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
B_COLS 340 uspace/app/tetris/tetris.c if (fits_in(curshape, pos + B_COLS)) {
B_COLS 341 uspace/app/tetris/tetris.c pos += B_COLS;
B_COLS 359 uspace/app/tetris/tetris.c pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
B_COLS 419 uspace/app/tetris/tetris.c while (fits_in(curshape, pos + B_COLS)) {
B_COLS 420 uspace/app/tetris/tetris.c pos += B_COLS;
B_COLS 71 uspace/app/tetris/tetris.h #define B_SIZE (B_ROWS * B_COLS)
B_COLS 100 uspace/app/tetris/tetris.h #define CTOD(x) ((x) * 2 + (((Cols - 2 * B_COLS) >> 1) - 1))
B_COLS 68 uspace/dist/src/c/demos/tetris/screen.c #define STOP (B_COLS - 3)
B_COLS 216 uspace/dist/src/c/demos/tetris/screen.c curscreen[D_LAST * B_COLS - 1] = -1;
B_COLS 251 uspace/dist/src/c/demos/tetris/screen.c t = c + r * B_COLS;
B_COLS 254 uspace/dist/src/c/demos/tetris/screen.c tr = t / B_COLS;
B_COLS 255 uspace/dist/src/c/demos/tetris/screen.c tc = t % B_COLS;
B_COLS 263 uspace/dist/src/c/demos/tetris/screen.c bp = &board[D_FIRST * B_COLS];
B_COLS 264 uspace/dist/src/c/demos/tetris/screen.c sp = &curscreen[D_FIRST * B_COLS];
B_COLS 267 uspace/dist/src/c/demos/tetris/screen.c for (i = 0; i < B_COLS; bp++, sp++, i++) {
B_COLS 60 uspace/dist/src/c/demos/tetris/shapes.c #define TL (-B_COLS - 1) /* top left */
B_COLS 61 uspace/dist/src/c/demos/tetris/shapes.c #define TC (-B_COLS) /* top center */
B_COLS 62 uspace/dist/src/c/demos/tetris/shapes.c #define TR (-B_COLS + 1) /* top right */
B_COLS 65 uspace/dist/src/c/demos/tetris/shapes.c #define BL (B_COLS - 1) /* bottom left */
B_COLS 66 uspace/dist/src/c/demos/tetris/shapes.c #define BC B_COLS /* bottom center */
B_COLS 67 uspace/dist/src/c/demos/tetris/shapes.c #define BR (B_COLS + 1) /* bottom right */
B_COLS 88 uspace/dist/src/c/demos/tetris/shapes.c /* 18 */ { 6, 6, { TC, BC, 2 * B_COLS }, 0xaa0000 } /* sticks out */
B_COLS 103 uspace/dist/src/c/demos/tetris/tetris.c *p++ = (i <= (2 * B_COLS) || (i % B_COLS) < 2) ? 0x0000ff : 0x000000;
B_COLS 118 uspace/dist/src/c/demos/tetris/tetris.c base = i * B_COLS + 1;
B_COLS 120 uspace/dist/src/c/demos/tetris/tetris.c j = B_COLS - 2;
B_COLS 125 uspace/dist/src/c/demos/tetris/tetris.c memset(&board[base], 0, sizeof(cell) * (B_COLS - 2));
B_COLS 131 uspace/dist/src/c/demos/tetris/tetris.c board[base + B_COLS] = board[base];
B_COLS 323 uspace/dist/src/c/demos/tetris/tetris.c pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
B_COLS 338 uspace/dist/src/c/demos/tetris/tetris.c if (fits_in(curshape, pos + B_COLS)) {
B_COLS 339 uspace/dist/src/c/demos/tetris/tetris.c pos += B_COLS;
B_COLS 357 uspace/dist/src/c/demos/tetris/tetris.c pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
B_COLS 417 uspace/dist/src/c/demos/tetris/tetris.c while (fits_in(curshape, pos + B_COLS)) {
B_COLS 418 uspace/dist/src/c/demos/tetris/tetris.c pos += B_COLS;
B_COLS 71 uspace/dist/src/c/demos/tetris/tetris.h #define B_SIZE (B_ROWS * B_COLS)
B_COLS 100 uspace/dist/src/c/demos/tetris/tetris.h #define CTOD(x) ((x) * 2 + (((Cols - 2 * B_COLS) >> 1) - 1))
HelenOS homepage, sources at GitHub