Searched refs:A_MAX (Results 1 - 18 of 18) sorted by relevance

/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/
H A Dattrib.h17 #define A_MAX 6 /* used in rn2() selection of attrib */ macro
38 schar a[A_MAX];
H A Dyou.h111 xchar attrbase[A_MAX]; /* lowest initial attributes */
112 xchar attrdist[A_MAX]; /* distribution of initial attributes */
173 xchar attrmin[A_MAX]; /* minimum allowable attribute */
174 xchar attrmax[A_MAX]; /* maximum allowable attribute */
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/
H A Dattrib.h17 #define A_MAX 6 /* used in rn2() selection of attrib */ macro
38 schar a[A_MAX];
H A Dyou.h111 xchar attrbase[A_MAX]; /* lowest initial attributes */
112 xchar attrdist[A_MAX]; /* distribution of initial attributes */
173 xchar attrmin[A_MAX]; /* minimum allowable attribute */
174 xchar attrmax[A_MAX]; /* maximum allowable attribute */
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/
H A Dattrib.c243 for(i = 0; i < A_MAX; i++) { /* all temporary losses/gains */
391 for(i = 0; i < A_MAX; AEXE(i++) /= 2) {
463 for(i = 0; i < A_MAX; i++) {
473 for (i = 0; (i < A_MAX) && ((x -= urole.attrdist[i]) > 0); i++) ;
474 if(i >= A_MAX) continue; /* impossible */
491 for (i = 0; (i < A_MAX) && ((x -= urole.attrdist[i]) > 0); i++) ;
492 if(i >= A_MAX) continue; /* impossible */
511 for(i = 0; i < A_MAX; i++) {
H A Dfountain.c211 for (ii = 0; ii < A_MAX; ii++)
217 i = rn2(A_MAX); /* start at a random attribute */
218 for (ii = 0; ii < A_MAX; ii++) {
221 if (++i >= A_MAX) i = 0;
H A Dsit.c166 (void) adjattrib(rn2(A_MAX), -rn1(4,3), FALSE);
170 (void) adjattrib(rn2(A_MAX), 1, FALSE);
H A Dpotion.c429 i = rn2(A_MAX); /* start at a random point */
430 for (ii = 0; ii < A_MAX; ii++) {
439 if(++i >= A_MAX) i = 0;
672 int typ = rn2(A_MAX);
717 for (ii = A_MAX; ii > 0; ii--) {
718 i = (otmp->blessed ? i + 1 : rn2(A_MAX));
1201 i = rn2(A_MAX); /* start at a random point */
1202 for(isdone = ii = 0; !isdone && ii < A_MAX; ii++) {
1209 if(++i >= A_MAX) i = 0;
H A Dapply.c1449 #define ATTR_COUNT (A_MAX*3) /* number of attribute points we might fix */
1470 case 4: (void) adjattrib(rn2(A_MAX), -1, FALSE);
1481 #define prop2trbl(X) ((X) + A_MAX)
1499 for (idx = 0; idx < A_MAX; idx++) {
1565 if (idx >= 0 && idx < A_MAX) {
H A Dpray.c190 for(i=0; i<A_MAX; i++)
408 for(i=0; i<A_MAX; i++) {
H A Du_init.c830 for(i = 0; i < A_MAX; i++)
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/
H A Dattrib.c243 for(i = 0; i < A_MAX; i++) { /* all temporary losses/gains */
391 for(i = 0; i < A_MAX; AEXE(i++) /= 2) {
463 for(i = 0; i < A_MAX; i++) {
473 for (i = 0; (i < A_MAX) && ((x -= urole.attrdist[i]) > 0); i++) ;
474 if(i >= A_MAX) continue; /* impossible */
491 for (i = 0; (i < A_MAX) && ((x -= urole.attrdist[i]) > 0); i++) ;
492 if(i >= A_MAX) continue; /* impossible */
511 for(i = 0; i < A_MAX; i++) {
H A Dfountain.c211 for (ii = 0; ii < A_MAX; ii++)
217 i = rn2(A_MAX); /* start at a random attribute */
218 for (ii = 0; ii < A_MAX; ii++) {
221 if (++i >= A_MAX) i = 0;
H A Dsit.c166 (void) adjattrib(rn2(A_MAX), -rn1(4,3), FALSE);
170 (void) adjattrib(rn2(A_MAX), 1, FALSE);
H A Dpotion.c429 i = rn2(A_MAX); /* start at a random point */
430 for (ii = 0; ii < A_MAX; ii++) {
439 if(++i >= A_MAX) i = 0;
672 int typ = rn2(A_MAX);
717 for (ii = A_MAX; ii > 0; ii--) {
718 i = (otmp->blessed ? i + 1 : rn2(A_MAX));
1201 i = rn2(A_MAX); /* start at a random point */
1202 for(isdone = ii = 0; !isdone && ii < A_MAX; ii++) {
1209 if(++i >= A_MAX) i = 0;
H A Dapply.c1449 #define ATTR_COUNT (A_MAX*3) /* number of attribute points we might fix */
1470 case 4: (void) adjattrib(rn2(A_MAX), -1, FALSE);
1481 #define prop2trbl(X) ((X) + A_MAX)
1499 for (idx = 0; idx < A_MAX; idx++) {
1565 if (idx >= 0 && idx < A_MAX) {
H A Dpray.c190 for(i=0; i<A_MAX; i++)
408 for(i=0; i<A_MAX; i++) {
H A Du_init.c830 for(i = 0; i < A_MAX; i++)

Completed in 95 milliseconds