Searched refs:ly (Results 1 - 25 of 47) sorted by relevance

12

/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/
H A Drect.h9 xchar lx, ly; member in struct:nhrect
H A Dmkroom.h11 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 Drect.h9 xchar lx, ly; member in struct:nhrect
H A Dmkroom.h11 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 Drect.c32 rect[0].lx = rect[0].ly = 0;
47 register int lx, ly, hx, hy; local
50 lx = r->lx; ly = r->ly;
53 if ( lx == rectp->lx && ly == rectp->ly &&
68 register int lx, ly, hx, hy; local
71 lx = r->lx; ly = r->ly;
74 if ( lx >= rectp->lx && ly >
[all...]
H A Dmkmap.c321 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 || croo
[all...]
H A Dregion.c61 return (x >= r->lx && x <= r->hx && y >= r->ly && y <= r->hy);
99 reg->bounding_box.ly = 99;
108 if (rects[i].ly < reg->bounding_box.ly)
109 reg->bounding_box.ly = rects[i].ly;
159 if (reg->bounding_box.ly > rect->ly)
160 reg->bounding_box.ly = rect->ly;
[all...]
H A Dmkroom.c42 * (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++) {
286 (sy == sroom->ly && doors[sh].y == sy-1) ||
461 for(sy = sroom->ly; sy <= sroom->hy; sy++)
491 buf.y = troom->ly + ((troom->hy - troom->ly) /
[all...]
H A Dvault.c149 int lx = 0, ly = 0; local
155 for(y = u.uy-dd; y <= u.uy+dd; ly = y, y++) {
165 if(y < u.uy) ly = y + 1;
166 else if(y > u.uy) ly = y - 1;
167 else ly = y;
168 if(levl[lx][ly].typ != STONE && levl[lx][ly].typ != CORR)
326 xchar lowy = rooms[vlt].ly, hiy = rooms[vlt].hy;
362 ny = rooms[vroom].ly + rn2(2);
376 loy = rooms[vlt].ly
[all...]
H A Dshknam.c362 else if(sy == sroom->ly-1) sy++;
374 sroom->lx, sroom->ly, sroom->hx, sroom->hy);
472 for(sy = sroom->ly; sy <= sroom->hy; sy++) {
479 (sy == sroom->ly && doors[sh].y == sy-1) ||
H A Dsp_lev.c278 *y = rn2(croom->hy - croom->ly + 1);
280 *y += croom->ly;
407 xchar hx, hy, lx, ly, dx, dy; local
419 ly = r1->ly;
429 yborder = (ly > 0 && hy < ROWNO -1) ? 2*ylim : ylim+1;
431 hy-ly < dy + 3 + yborder) {
437 yabs = ly + (ly > 0 ? ylim : 2)
438 + rn2(hy - (ly>
[all...]
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/
H A Drect.c32 rect[0].lx = rect[0].ly = 0;
47 register int lx, ly, hx, hy; local
50 lx = r->lx; ly = r->ly;
53 if ( lx == rectp->lx && ly == rectp->ly &&
68 register int lx, ly, hx, hy; local
71 lx = r->lx; ly = r->ly;
74 if ( lx >= rectp->lx && ly >
[all...]
H A Dmkmap.c321 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 || croo
[all...]
H A Dregion.c61 return (x >= r->lx && x <= r->hx && y >= r->ly && y <= r->hy);
99 reg->bounding_box.ly = 99;
108 if (rects[i].ly < reg->bounding_box.ly)
109 reg->bounding_box.ly = rects[i].ly;
159 if (reg->bounding_box.ly > rect->ly)
160 reg->bounding_box.ly = rect->ly;
[all...]
H A Dmkroom.c42 * (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++) {
286 (sy == sroom->ly && doors[sh].y == sy-1) ||
461 for(sy = sroom->ly; sy <= sroom->hy; sy++)
491 buf.y = troom->ly + ((troom->hy - troom->ly) /
[all...]
H A Dvault.c149 int lx = 0, ly = 0; local
155 for(y = u.uy-dd; y <= u.uy+dd; ly = y, y++) {
165 if(y < u.uy) ly = y + 1;
166 else if(y > u.uy) ly = y - 1;
167 else ly = y;
168 if(levl[lx][ly].typ != STONE && levl[lx][ly].typ != CORR)
326 xchar lowy = rooms[vlt].ly, hiy = rooms[vlt].hy;
362 ny = rooms[vroom].ly + rn2(2);
376 loy = rooms[vlt].ly
[all...]
H A Dshknam.c362 else if(sy == sroom->ly-1) sy++;
374 sroom->lx, sroom->ly, sroom->hx, sroom->hy);
472 for(sy = sroom->ly; sy <= sroom->hy; sy++) {
479 (sy == sroom->ly && doors[sh].y == sy-1) ||
H A Dsp_lev.c278 *y = rn2(croom->hy - croom->ly + 1);
280 *y += croom->ly;
407 xchar hx, hy, lx, ly, dx, dy; local
419 ly = r1->ly;
429 yborder = (ly > 0 && hy < ROWNO -1) ? 2*ylim : ylim+1;
431 hy-ly < dy + 3 + yborder) {
437 yabs = ly + (ly > 0 ? ylim : 2)
438 + rn2(hy - (ly>
[all...]
/seL4-refos-master/libs/libmuslc/src/complex/
H A Dcexp.c37 uint32_t hx, hy, lx, ly; local
42 EXTRACT_WORDS(hy, ly, y);
46 if ((hy | ly) == 0)
H A Dcsinh.c44 int32_t hx, hy, ix, iy, lx, ly; local
50 EXTRACT_WORDS(hy, ly, y);
57 if ((iy | ly) == 0)
95 if ((iy | ly) == 0 && ix >= 0x7ff00000) {
H A Dccosh.c44 int32_t hx, hy, ix, iy, lx, ly; local
50 EXTRACT_WORDS(hy, ly, y);
57 if ((iy | ly) == 0)
96 if ((iy | ly) == 0 && ix >= 0x7ff00000) {
/seL4-refos-master/libs/libmuslc/src/math/
H A Datan2.c49 uint32_t m,lx,ly,ix,iy; local
54 EXTRACT_WORDS(iy, ly, y);
62 if ((iy|ly) == 0) {
H A Dhypot.c26 double_t hx, lx, hy, ly, z; local
65 sq(&hy, &ly, y);
66 return z*sqrt(ly+lx+hy+hx);
H A Dhypotl.c29 long double hx, lx, hy, ly, z; local
63 sq(&hy, &ly, y);
64 return z*sqrtl(ly+lx+hy+hx);
H A Dpow.c98 uint32_t lx,ly; local
101 EXTRACT_WORDS(hy, ly, y);
106 if ((iy|ly) == 0)
113 iy > 0x7ff00000 || (iy == 0x7ff00000 && ly != 0))
128 uint32_t j = ly>>(52-k);
129 if ((j<<(52-k)) == ly)
131 } else if (ly == 0) {
140 if (ly == 0) {

Completed in 105 milliseconds

12