/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/ |
H A D | rect.h | 10 xchar hx, hy; member in struct:nhrect
|
H A D | mkroom.h | 11 schar lx,hx,ly,hy; /* usually xchar, but hx may be -1 */ member in struct:mkroom
|
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/ |
H A D | rect.h | 10 xchar hx, hy; member in struct:nhrect
|
H A D | mkroom.h | 11 schar lx,hx,ly,hy; /* usually xchar, but hx may be -1 */ member in struct:mkroom
|
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/ |
H A D | rect.c | 34 rect[0].hy = ROWNO - 1; 47 register int lx, ly, hx, hy; local 51 hx = r->hx; hy = r->hy; 54 hx == rectp->hx && hy == rectp->hy) 68 register int lx, ly, hx, hy; local 72 hx = r->hx; hy = r->hy; 75 hx <= rectp->hx && hy < [all...] |
H A D | mkmap.c | 321 sm.y = croom->ly + ((croom->hy - croom->ly) / 2); 323 em.y = croom2->ly + ((croom2->hy - croom2->ly) / 2); 331 ((croom2->ly > croom->hy || croom2->hy < croom->ly) && rn2(3))) { 367 * longer be valid. All rooms in the region lx <= x < hx, ly <= y < hy are 375 remove_rooms(lx, ly, hx, hy) 376 int lx, ly, hx, hy; 384 croom->hy < ly || croom->ly >= hy) continue; /* no overlap */ 387 croom->ly < ly || croom->hy > [all...] |
H A D | region.c | 61 return (x >= r->lx && x <= r->hx && y >= r->ly && y <= r->hy); 101 reg->bounding_box.hy = 0; 112 if (rects[i].hy > reg->bounding_box.hy) 113 reg->bounding_box.hy = rects[i].hy; 163 if (reg->bounding_box.hy < rect->hy) 164 reg->bounding_box.hy = rect->hy; [all...] |
H A D | mkroom.c | 42 * (sroom->hy - sroom->ly + 1); 154 for(y = sroom->ly - 1; y <= sroom->hy + 1; y++) 245 for(ty = sroom->ly; ty <= sroom->hy; ty++) 259 ty = sroom->ly + (sroom->hy - sroom->ly + 1)/2; 275 for(sy = sroom->ly; sy <= sroom->hy; sy++) { 287 (sy == sroom->hy && doors[sh].y == sy+1)))) 461 for(sy = sroom->ly; sy <= sroom->hy; sy++) 491 buf.y = troom->ly + ((troom->hy - troom->ly) / 2); 570 return rn2(croom->hy-croom->ly+1) + croom->ly; 579 y >= croom->ly-1 && y <= croom->hy [all...] |
H A D | shknam.c | 363 else if(sy == sroom->hy+1) sy--; else { 374 sroom->lx, sroom->ly, sroom->hx, sroom->hy); 472 for(sy = sroom->ly; sy <= sroom->hy; sy++) { 480 (sy == sroom->hy && doors[sh].y == sy+1)) continue;
|
H A D | mkmaze.c | 221 * pos is inside restricted region (lx,ly,hx,hy) OR 225 bad_location(x, y, lx, ly, hx, hy) 227 xchar lx, ly, hx, hy; 230 within_bounded_area(x,y, lx,ly, hx,hy) || 235 /* pick a location in area (lx, ly, hx, hy) but not in (nlx, nly, nhx, nhy) */ 238 place_lregion(lx, ly, hx, hy, nlx, nly, nhx, nhy, rtype, lev) 239 xchar lx, ly, hx, hy; 259 ly = 1; hy = ROWNO-1; 264 oneshot = (lx == hx && ly == hy); 267 y = rn1((hy [all...] |
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/ |
H A D | rect.c | 34 rect[0].hy = ROWNO - 1; 47 register int lx, ly, hx, hy; local 51 hx = r->hx; hy = r->hy; 54 hx == rectp->hx && hy == rectp->hy) 68 register int lx, ly, hx, hy; local 72 hx = r->hx; hy = r->hy; 75 hx <= rectp->hx && hy < [all...] |
H A D | mkmap.c | 321 sm.y = croom->ly + ((croom->hy - croom->ly) / 2); 323 em.y = croom2->ly + ((croom2->hy - croom2->ly) / 2); 331 ((croom2->ly > croom->hy || croom2->hy < croom->ly) && rn2(3))) { 367 * longer be valid. All rooms in the region lx <= x < hx, ly <= y < hy are 375 remove_rooms(lx, ly, hx, hy) 376 int lx, ly, hx, hy; 384 croom->hy < ly || croom->ly >= hy) continue; /* no overlap */ 387 croom->ly < ly || croom->hy > [all...] |
H A D | region.c | 61 return (x >= r->lx && x <= r->hx && y >= r->ly && y <= r->hy); 101 reg->bounding_box.hy = 0; 112 if (rects[i].hy > reg->bounding_box.hy) 113 reg->bounding_box.hy = rects[i].hy; 163 if (reg->bounding_box.hy < rect->hy) 164 reg->bounding_box.hy = rect->hy; [all...] |
H A D | mkroom.c | 42 * (sroom->hy - sroom->ly + 1); 154 for(y = sroom->ly - 1; y <= sroom->hy + 1; y++) 245 for(ty = sroom->ly; ty <= sroom->hy; ty++) 259 ty = sroom->ly + (sroom->hy - sroom->ly + 1)/2; 275 for(sy = sroom->ly; sy <= sroom->hy; sy++) { 287 (sy == sroom->hy && doors[sh].y == sy+1)))) 461 for(sy = sroom->ly; sy <= sroom->hy; sy++) 491 buf.y = troom->ly + ((troom->hy - troom->ly) / 2); 570 return rn2(croom->hy-croom->ly+1) + croom->ly; 579 y >= croom->ly-1 && y <= croom->hy [all...] |
H A D | shknam.c | 363 else if(sy == sroom->hy+1) sy--; else { 374 sroom->lx, sroom->ly, sroom->hx, sroom->hy); 472 for(sy = sroom->ly; sy <= sroom->hy; sy++) { 480 (sy == sroom->hy && doors[sh].y == sy+1)) continue;
|
/seL4-refos-master/libs/libmuslc/src/complex/ |
H A D | cexp.c | 37 uint32_t hx, hy, lx, ly; local 42 EXTRACT_WORDS(hy, ly, y); 43 hy &= 0x7fffffff; 46 if ((hy | ly) == 0) 53 if (hy >= 0x7ff00000) {
|
H A D | cexpf.c | 37 uint32_t hx, hy; local 42 GET_FLOAT_WORD(hy, y); 43 hy &= 0x7fffffff; 46 if (hy == 0) 53 if (hy >= 0x7f800000) {
|
H A D | ccoshf.c | 38 int32_t hx, hy, ix, iy; local 44 GET_FLOAT_WORD(hy, y); 47 iy = 0x7fffffff & hy;
|
H A D | csinh.c | 44 int32_t hx, hy, ix, iy, lx, ly; local 50 EXTRACT_WORDS(hy, ly, y); 53 iy = 0x7fffffff & hy;
|
H A D | csinhf.c | 38 int32_t hx, hy, ix, iy; local 44 GET_FLOAT_WORD(hy, y); 47 iy = 0x7fffffff & hy;
|
H A D | ccosh.c | 44 int32_t hx, hy, ix, iy, lx, ly; local 50 EXTRACT_WORDS(hy, ly, y); 53 iy = 0x7fffffff & hy;
|
/seL4-refos-master/libs/libmuslc/src/math/ |
H A D | pow.c | 97 int32_t hx,hy,ix,iy; local 101 EXTRACT_WORDS(hy, ly, y); 103 iy = hy & 0x7fffffff; 145 return hy >= 0 ? y : 0.0; 147 return hy >= 0 ? 0.0 : -y; 150 if (hy >= 0) 163 if (hy == 0x40000000) /* y is 2 */ 165 if (hy == 0x3fe00000) { /* y is 0.5 */ 176 if (hy < 0) /* z = (1/|x|) */ 200 return hy < [all...] |
H A D | hypot.c | 26 double_t hx, lx, hy, ly, z; local 65 sq(&hy, &ly, y); 66 return z*sqrt(ly+lx+hy+hx);
|
H A D | hypotl.c | 29 long double hx, lx, hy, ly, z; local 63 sq(&hy, &ly, y); 64 return z*sqrtl(ly+lx+hy+hx);
|
H A D | powf.c | 53 int32_t hx,hy,ix,iy,is; local 56 GET_FLOAT_WORD(hy, y); 58 iy = hy & 0x7fffffff; 92 return hy >= 0 ? y : 0.0f; 94 return hy >= 0 ? 0.0f: -y; 97 return hy >= 0 ? x : 1.0f/x; 98 if (hy == 0x40000000) /* y is 2 */ 100 if (hy == 0x3f000000) { /* y is 0.5 */ 109 if (hy < 0) /* z = (1/|x|) */ 132 return hy < [all...] |