Home
last modified time | relevance | path

Searched refs:TABSIZ (Results 1 – 15 of 15) sorted by relevance

/dports/astro/py-ephem/ephem-4.1.3/libastro/
H A Ddeltat.c51 #define TABSIZ (TABEND - TABSTART + 1) macro
79 short dt[TABSIZ] = {
177 a = 0.01 * dt[TABSIZ-1]; in deltat()
179 b = 0.001 * (dt[TABSIZ-1] - dt[TABSIZ - 11]); in deltat()
246 if( k >= TABSIZ ) in deltat()
254 if( (iy-1 < 0) || (iy+2 >= TABSIZ) ) in deltat()
260 if( (k < 0) || (k+1 >= TABSIZ) ) in deltat()
272 if (iy+2 >= TABSIZ) in deltat()
280 if ((iy-2 < 0) || (iy+3 > TABSIZ) ) in deltat()
/dports/games/nethack33-nox11/nethack-3.3.1/src/
H A Dhacklib.c362 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
363 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
365 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
373 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
374 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
375 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
379 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/nethack33/nethack-3.3.1/src/
H A Dhacklib.c362 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
363 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
365 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
373 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
374 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
375 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
379 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/falconseye/falconseye-1.9.3_11/src/
H A Dhacklib.c362 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
363 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
365 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
373 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
374 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
375 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
379 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/nethack34-nox11/nethack-3.4.3/src/
H A Dhacklib.c385 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
386 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
388 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
396 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
397 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
398 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
402 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/nethack34/nethack-3.4.3/src/
H A Dhacklib.c385 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
386 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
388 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
396 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
397 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
398 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
402 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/vultures-eye/vulture-2.3.67/slashem/src/
H A Dhacklib.c385 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
386 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
388 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
396 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
397 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
398 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
402 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/vultures-eye/vulture-2.3.67/nethack/src/
H A Dhacklib.c385 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
386 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
388 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
396 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
397 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
398 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
402 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/unnethack/unnethack-5.1.0-20131208/src/
H A Dhacklib.c394 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
395 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
397 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
405 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
406 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
407 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
411 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/vultures-eye/vulture-2.3.67/unnethack/src/
H A Dhacklib.c390 # define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
391 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
393 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
401 for (i = 0; i < TABSIZ; i++) tstr[i] = tsub[i] = 0; /* init */
402 for (k = 0, s1 = str; *s1; k++) tstr[*s1++ & (TABSIZ-1)]++;
403 for ( s2 = sub; *s2; --k) tsub[*s2++ & (TABSIZ-1)]++;
407 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/nethack36/NetHack-NetHack-3.6.6_Released/src/
H A Dhacklib.c757 #define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
758 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
760 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
769 for (i = 0; i < TABSIZ; i++)
772 tstr[*s1++ & (TABSIZ - 1)]++;
774 tsub[*s2++ & (TABSIZ - 1)]++;
779 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/nethack36-nox11/NetHack-NetHack-3.6.6_Released/src/
H A Dhacklib.c757 #define TABSIZ 0x20 /* 0x40 would be case-sensitive */ macro
758 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */
760 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */
769 for (i = 0; i < TABSIZ; i++)
772 tstr[*s1++ & (TABSIZ - 1)]++;
774 tsub[*s2++ & (TABSIZ - 1)]++;
779 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */
/dports/games/xnethack/xNetHack-xnh6.1/src/
H A Dhacklib.c849 #define TABSIZ 0x20 /* 0x40 would be case-sensitive */ in strstri() macro
850 char tstr[TABSIZ], tsub[TABSIZ]; /* nibble count tables */ in strstri()
852 assert( (TABSIZ & ~(TABSIZ-1)) == TABSIZ ); /* must be exact power of 2 */ in strstri()
861 for (i = 0; i < TABSIZ; i++) in strstri()
864 tstr[*s1++ & (TABSIZ - 1)]++; in strstri()
866 tsub[*s2++ & (TABSIZ - 1)]++; in strstri()
871 for (i = 0; i < TABSIZ; i++) /* does sub have more 'x's than str? */ in strstri()
/dports/textproc/flip/flip-1.19/
H A Dflip.c92 #define TABSIZ 256 macro
93 char table[TABSIZ];
143 for (i = 0; i < TABSIZ; i++) {
/dports/astro/swe/swisseph-2.10.1/
H A Dswephlib.c2428 #define TABSIZ (TABEND-TABSTART+1) macro
2430 #define TABSIZ_SPACE (TABSIZ+100)
3103 return TABSIZ; in init_dt()