DataMuseum.dk

Presents historical artifacts from the history of:

DKUUG/EUUG Conference tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about DKUUG/EUUG Conference tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - metrics - download
Index: T o

⟦9e4a1b911⟧ TextFile

    Length: 17410 (0x4402)
    Types: TextFile
    Names: »ogen1.c«

Derivation

└─⟦b20c6495f⟧ Bits:30007238 EUUGD18: Wien-båndet, efterår 1987
    └─⟦this⟧ »EUUGD18/General/Omega/ogen1.c« 

TextFile

/* omega copyright (c) 1987,1988 by Laurence Raphael Brothers */
/* ogen1.c */
/* level generator functions */

#include "oglob.h"


/* bv access functions for dungeon location stati */
int loc_statusp(x,y,stat)
int x,y;
int stat;
{
  return(Level->site[x][y].lstatus & stat);
}

void lset(x,y,stat)
int x,y;
int stat;
{
 Level->site[x][y].lstatus |= stat;
}

void lreset(x,y,stat)
int x,y;
int stat;
{
  Level->site[x][y].lstatus &= ~stat;
}



/* Deallocate current dungeon */
void free_dungeon()
{
  plv tlv;
  
  while (Dungeon != NULL) {
    tlv = Dungeon;
    Dungeon = Dungeon->next;
    free((char *) tlv);
  }
}


/* erase the level w/o deallocating it*/
void clear_level(dungeon_level)
struct level *dungeon_level;
{
  int i,j;
  if (dungeon_level != NULL) {
    dungeon_level->generated = FALSE;
    dungeon_level->numrooms = 0;
    dungeon_level->tunnelled = 0;
    dungeon_level->mlist = NULL;
    for(i=0;i<MAXWIDTH;i++)
      for(j=0;j<MAXLENGTH;j++) {
	dungeon_level->site[i][j].locchar = WALL;
	dungeon_level->site[i][j].showchar = ' ';
	dungeon_level->site[i][j].creature = NULL;
	dungeon_level->site[i][j].things = NULL;
	dungeon_level->site[i][j].aux = difficulty()*20;
	dungeon_level->site[i][j].buildaux = 0;
	dungeon_level->site[i][j].p_locf = L_NO_OP;
	dungeon_level->site[i][j].lstatus = 0;
	dungeon_level->site[i][j].roomnumber = RS_WALLSPACE;
      }
  }
}



/* Looks for level tolevel in current dungeon which is named by
Dungeon, which may be NULL. If the level is found, and rewrite_level
is FALSE, and the level has already been generated, nothing happens
beyond Level being set correctly. Otherwise the level is recreated
from scratch */

void change_level(fromlevel,tolevel,rewrite_level)
char fromlevel,tolevel,rewrite_level;
{
  struct level *thislevel = NULL;
  Player.sx = -1; Player.sy = -1; /* sanctuary effect dispelled */
  thislevel = findlevel(Dungeon,tolevel);
  if (Dungeon != NULL) {
    Dungeon->deepest = max(Dungeon->deepest,tolevel);
    Level->deepest = Dungeon->deepest;
  }
  if (thislevel == NULL) {
    thislevel = ((plv) malloc(sizeof(levtype)));
    clear_level(thislevel);
    Level = thislevel;
    Level->next = Dungeon;
    Dungeon = Level;
  }
  Level = thislevel;
  if ((! Level->generated) || rewrite_level) {
    Level->environment = Current_Environment;
    Level->depth = tolevel;
    Level->generated = TRUE;
    switch(Current_Environment) {
    case E_CAVES: 
      if ((random_range(4)==0) && (tolevel < MaxDungeonLevels))
	room_level();
      else cavern_level();
      break;
    case E_SEWERS: 
      if ((random_range(4)==0) && (tolevel < MaxDungeonLevels))
	room_level();
      else sewer_level(); 
      break;
    case E_CASTLE:
      room_level();
      break;
    case E_ASTRAL:
      maze_level();
      break;
    case E_VOLCANO:
      switch(random_range(3)) {
      case 0: cavern_level(); break;
      case 1: room_level(); break;
      case 2: maze_level(); break;
      }
      break;
    default: print3("This dungeon not implemented!"); break;
    }
    Level->deepest = tolevel;
    install_traps();
    install_specials();
    make_stairs(fromlevel);
    make_stairs(fromlevel);
  }
  find_stairs(fromlevel,tolevel);
  erase_level();
  ScreenOffset = Player.y - (ScreenLength/2);
  show_screen();
  screencheck(Player.y);
  drawvision(Player.x,Player.y);
  /* synchronize with player on level change */
  Player.click = (Tick+1)%60;
  roomcheck();
}


/* tries to find the level of depth levelnum in dungeon; if can't find
   it returns NULL */
plv findlevel(dungeon,levelnum)
struct level *dungeon;
char levelnum;
{
  if (dungeon == NULL) return(NULL);
  else {
    while((dungeon->next != NULL) && (dungeon->depth != levelnum))
      dungeon = dungeon->next;
    if (dungeon->depth == levelnum) return(dungeon);
    else return(NULL);
  }
}



/* keep going in one orthogonal direction or another until we hit our */
/* destination */

void straggle_corridor(fx,fy,tx,ty,loc,rsi)
int fx,fy,tx,ty;
char loc;
char rsi;
{
  int dx,dy;
  while ((fx != tx) || (fy != ty)) {
    dx = tx - fx;
    dy = ty - fy;
    if (random_range(abs(dx)+abs(dy)) < abs(dx))
      corridor_crawl(&fx,&fy,sign(dx),0,random_range(abs(dx))+1,loc,rsi);
    else corridor_crawl(&fx,&fy,0,sign(dy),random_range(abs(dy))+1,loc,rsi);
  }
}



void makedoor(x,y)
int x,y;
{
  if (random_range(20) <= Level->depth/10) {
    Level->site[x][y].locchar = FLOOR;
    lset(x,y,SECRET);
  }
  else if (random_range(20)<=Level->depth/2) {
    Level->site[x][y].locchar = CLOSED_DOOR;
    if (random_range(20) <= Level->depth/10) 
      lset(x,y,SECRET);
    if (random_range(40) <= Level->depth) 
      Level->site[x][y].aux = LOCKED;
    else Level->site[x][y].aux = UNLOCKED;
  }
  else {
    Level->site[x][y].locchar = OPEN_DOOR;
    Level->site[x][y].aux = UNLOCKED;
  }
  if (! loc_statusp(x,y,SECRET)) {
    lset(x,y+1,STOPS);
    lset(x+1,y,STOPS);
    lset(x-1,y,STOPS);
    lset(x,y-1,STOPS);
  }
}


void corridor_crawl(fx,fy,sx,sy,n,loc,rsi)
int *fx,*fy,sx,sy,n;
char loc,rsi;
{
  int i;
  for (i=0;i<n;i++) {
    *fx += sx;
    *fy += sy;
    if ((*fx < WIDTH) && 
	(*fx > -1) && 
	(*fy > -1) && 
	(*fy < LENGTH)) {
      Level->site[*fx][*fy].locchar = loc;
      if (Level->site[*fx][*fy].roomnumber == RS_WALLSPACE)
	Level->site[*fx][*fy].roomnumber = rsi;
      if (loc==WATER) 
	Level->site[*fx][*fy].p_locf = L_WATER;
      else if (loc==FLOOR) 
	Level->site[*fx][*fy].p_locf = L_NO_OP;
      else if (loc==RUBBLE)
	Level->site[*fx][*fy].p_locf = L_RUBBLE;
    }
  }
}  




char *roomname(index)
int index;
{
  switch(index) {
  case RS_ZORCH:strcpy(Str4,"A place zorched by high power magic.");break;
  case RS_COURT:strcpy(Str4,"The Court of the ArchMage."); break;
  case RS_CIRCLE:strcpy(Str4,"The Astral Demesne of the Circle of Sorcerors");
    break;
  case RS_MAGIC_ISLE: strcpy(Str4,"An island positively reeking of magic");
    break;
  case RS_STARPEAK: strcpy(Str4,"Near the oddly glowing peak of a mountain");
    break;
  case RS_VOLCANO: strcpy(Str4,"Deep within the bowels of the earth"); break;
  case RS_HIGHASTRAL: strcpy(Str4,"The High Astral Plane"); break;
  case RS_EARTHPLANE: strcpy(Str4,"The Plane of Earth"); break;
  case RS_WATERPLANE: strcpy(Str4,"The Plane of Water"); break;
  case RS_FIREPLANE: strcpy(Str4,"The Plane of Fire"); break;
  case RS_AIRPLANE: strcpy(Str4,"The Plane of Air"); break;
  case RS_KITCHEN: strcpy(Str4,"A kitchen"); break;
  case RS_BATHROOM: strcpy(Str4,"A bathroom"); break;
  case RS_BEDROOM: strcpy(Str4,"A bedroom"); break;
  case RS_DININGROOM: strcpy(Str4,"A dining room"); break;
  case RS_SECRETPASSAGE: strcpy(Str4,"A secret passage"); break;
  case RS_CLOSET: strcpy(Str4,"A stuffy closet"); break;
  case RS_ARENA: strcpy(Str4,"The Rampart Arena"); break;
  case RS_DROWNED_SEWER: strcpy(Str4,"A water-filled sewer node"); break;
  case RS_DRAINED_SEWER: strcpy(Str4,"An unused sewer node"); break;
  case RS_SEWER_DUCT: strcpy(Str4,"A winding sewer duct"); break;
  case RS_DESTINY: strcpy(Str4,"The Halls of Fate"); break;
  case RS_DRUID: strcpy(Str4,"The Great Henge"); break;
  case RS_HECATE: strcpy(Str4,"The Church of the Far Side"); break;
  case RS_SET: strcpy(Str4,"The Temple of the Black Hand"); break;
  case RS_ATHENA: strcpy(Str4,"The Parthenon"); break;
  case RS_ODIN: strcpy(Str4,"The Shrine of the Noose"); break;
  case RS_ADEPT: strcpy(Str4,"Labyrinth of The Adept's Challenge."); break;
  case RS_WYRM: strcpy(Str4,"The Sunken Cavern of the Great Wyrm."); break;
  case RS_OCEAN: strcpy(Str4,"The Underground Ocean."); break;
  case RS_PONDS: strcpy(Str4,"A series of subterranean pools and streams."); break;
  case RS_DRAGONLORD: strcpy(Str4,"The Lair of the DragonLord."); break;
  case RS_GOBLINKING: strcpy(Str4,"The Caves of the Goblins."); break;
  case RS_CAVERN: strcpy(Str4,"A vast natural cavern."); break;
  case RS_CORRIDOR: strcpy(Str4,"A dimly lit corridor."); break;
  case RS_WALLSPACE: strcpy(Str4,"A niche hollowed out of the wall."); break;
  case ROOMBASE+0: strcpy(Str4,"An abandoned garderobe."); break;
  case ROOMBASE+1: strcpy(Str4,"A dungeon cell."); break;
  case ROOMBASE+2: strcpy(Str4,"A tiled chamber."); break;
  case ROOMBASE+3: strcpy(Str4,"A crystal cavern."); break;
  case ROOMBASE+4: strcpy(Str4,"Someone's bedroom."); break;
  case ROOMBASE+5: strcpy(Str4,"An old storeroom."); break;
  case ROOMBASE+6: strcpy(Str4,"A room with charred walls."); break;
  case ROOMBASE+7: strcpy(Str4,"A marble hall."); break;
  case ROOMBASE+8: strcpy(Str4,"An eerie cave."); break;
  case ROOMBASE+9: strcpy(Str4,"A ransacked treasure-chamber."); break;
  case ROOMBASE+10: strcpy(Str4,"A smoke-filled room."); break;
  case ROOMBASE+11: strcpy(Str4,"A well-appointed apartment."); break;
  case ROOMBASE+12: strcpy(Str4,"An antechamber."); break;
  case ROOMBASE+13: strcpy(Str4,"An unoccupied harem."); break;
  case ROOMBASE+14: strcpy(Str4,"A multi-purpose room."); break;
  case ROOMBASE+15: strcpy(Str4,"A room filled with stalactites."); break;
  case ROOMBASE+16: strcpy(Str4,"An underground greenhouse."); break;
  case ROOMBASE+17: strcpy(Str4,"A water closet."); break;
  case ROOMBASE+18: strcpy(Str4,"A study."); break;
  case ROOMBASE+19: strcpy(Str4,"A living room."); break;
  case ROOMBASE+20: strcpy(Str4,"A comfortable den."); break;
  case ROOMBASE+21: strcpy(Str4,"An abatoir."); break;
  case ROOMBASE+22: strcpy(Str4,"A boudoir.");break;
  case ROOMBASE+23: strcpy(Str4,"A star chamber.");break;
  case ROOMBASE+24: strcpy(Str4,"A manmade cavern."); break;
  case ROOMBASE+25: strcpy(Str4,"A sewer control room");break;
  case ROOMBASE+26: strcpy(Str4,"A shrine to High Magic"); break;
  case ROOMBASE+27: strcpy(Str4,"A magic laboratory"); break;
  case ROOMBASE+28: strcpy(Str4,"A room with inscribed pentagram");break;
  case ROOMBASE+29: strcpy(Str4,"A chamber with a blue crystal omega dais");
    break;
  default: strcpy(Str4,"A room of mystery and allure."); break;
  }
  return(Str4);
}



/* puts the player on the first set of stairs from the apt level */
/* if can't find them, just drops player anywhere.... */
void find_stairs(fromlevel,tolevel)
char fromlevel;
char tolevel;
{
  int i,j,found=FALSE;
  char sitechar;
  if (fromlevel > tolevel) sitechar = DOWN; else sitechar = UP;
  for(i=0;i<WIDTH;i++)
    for(j=0;j<LENGTH;j++) 
      if ((Level->site[i][j].locchar == sitechar) && (! found)) { 
	found = TRUE;
	Player.x = i;
	Player.y = j;
	break;
      }
  if (! found) {
    findspace(&Player.x,&Player.y,-1);
    if (Level->environment != E_ASTRAL)
      Level->site[Player.x][Player.y].locchar = sitechar;
  }
}



void install_traps()
{
  int i,j;
  for(i=0;i<WIDTH;i++)
    for(j=0;j<LENGTH;j++)
      if ((Level->site[i][j].locchar == FLOOR) &&
	  (Level->site[i][j].p_locf == L_NO_OP) &&
	  random_range(500) <= ((int)(Level->depth/6)))
	Level->site[i][j].p_locf = TRAP_BASE+random_range(NUMTRAPS);
}



/* x, y, is top left corner, l is length of side, rsi is room string index */
/* baux is so all rooms will have a key field. */
void build_square_room(x,y,l,rsi,baux)
int x,y,l;
char rsi;
int baux;
{
  int i,j;

  for(i=x;i<=x+l;i++)
    for(j=y;j<=y+l;j++){
      Level->site[i][j].roomnumber = rsi;
      Level->site[i][j].buildaux = baux;
    }
  for(i=x+1;i<x+l;i++)
    for(j=y+1;j<y+l;j++) {
      Level->site[i][j].locchar = FLOOR;
      Level->site[i][j].p_locf = L_NO_OP;
    }
}



void build_room(x,y,l,rsi,baux)
int x,y,l;
char rsi;
int baux;
{
  build_square_room(x,y,l,rsi,baux);
}

void cavern_level()
{
  int i,fx,fy,tx,ty,t,l,e;
  char rsi;

  Level->numrooms = 1;

  if ((Current_Dungeon == CAVES) && (Level->depth == CAVELEVELS))
    rsi = RS_GOBLINKING;
  else rsi = RS_CAVERN;
  t = random_range(LENGTH/2);
  l = random_range(WIDTH/2);
  e = random_range(WIDTH/8)+WIDTH/8;
  build_square_room(t,l,e,rsi,0);
  
  for (i=0;i<16;i++) {
    findspace(&tx,&ty,-1);
    fx = random_range(WIDTH-2)+1;
    fy = random_range(LENGTH-2)+1;
    straggle_corridor(fx,fy,tx,ty,FLOOR,RS_CORRIDOR);
  }
  while (random_range(3)==1) {
    findspace(&tx,&ty,-1);
    fx = random_range(WIDTH-2)+1;
    fy = random_range(LENGTH-2)+1;
    straggle_corridor(fx,fy,tx,ty,WATER,RS_PONDS);
  }
  if (Current_Dungeon == E_CAVES) {
    if ((Level->depth == CAVELEVELS) && (! gamestatusp(COMPLETED_CAVES))) {
      findspace(&tx,&ty,-1);
      Level->mlist = ((pml) malloc(sizeof(mltype)));
      Level->mlist->next = NULL;
      Level->mlist->m = 
	Level->site[tx][ty].creature = 
	  ((pmt) make_creature(ML3+5)); /* goblin king */
      Level->mlist->m->x = tx;
      Level->mlist->m->y = ty;
    }
  }
  else if (Current_Environment == E_VOLCANO) {
    if (Level->depth == VOLCANOLEVELS) {
      findspace(&tx,&ty,-1);
      Level->mlist = ((pml) malloc(sizeof(mltype)));
      Level->mlist->next = NULL;
      Level->mlist->m = 
	Level->site[tx][ty].creature = 
	  ((pmt) make_creature(ML10+4)); /* The dark emp */
      Level->mlist->m->x = tx;
      Level->mlist->m->y = ty;
    }
  }
  populate_level(Current_Environment);
  stock_level();
}







void sewer_level()
{
  int i,tx,ty,t,l,e;
  char rsi,lchar;

  Level->numrooms = random_range(3)+3;
  rsi = RS_DRAINED_SEWER;
  for (i=0;i<Level->numrooms;i++) {
    do {
      t = random_range(LENGTH-10)+1;
      l = random_range(WIDTH-10)+1;
      e = 4;
    } while ((Level->site[l][t].roomnumber == rsi) ||
	     (Level->site[l+e][t].roomnumber == rsi) ||
	     (Level->site[l][t+e].roomnumber == rsi) ||
	     (Level->site[l+e][t+e].roomnumber == rsi));
    if (random_range(5)) {
      lchar = FLOOR;
      rsi = RS_DRAINED_SEWER;
    }
    else {
      lchar = WATER;
      rsi = RS_DROWNED_SEWER;
    }
    build_room(l,t,e,rsi,i);
    sewer_corridor(l,t,-1,-1,lchar);
    sewer_corridor(l+e,t,1,-1,lchar);
    sewer_corridor(l,t+e,-1,1,lchar);
    sewer_corridor(l+e,t+e,1,1,lchar);
  }
  if (Current_Dungeon == E_SEWERS) {
    if ((Level->depth == SEWERLEVELS) && (! gamestatusp(COMPLETED_SEWERS))) {
      findspace(&tx,&ty,-1);
      Level->mlist = ((pml) malloc(sizeof(mltype)));
      Level->mlist->next = NULL;
      Level->mlist->m = 
	Level->site[tx][ty].creature = 
	  ((pmt) make_creature(ML7+5)); /* The Great Wyrm */
      Level->mlist->m->x = tx;
      Level->mlist->m->y = ty;
    }
  }
  populate_level(Current_Environment); 
  stock_level();
}



void sewer_corridor(x,y,dx,dy,locchar)
int x,y,dx,dy;
char locchar;
{
  int continuing = TRUE;
  makedoor(x,y);
  x+=dx;
  y+=dy;
  while(continuing) {
    Level->site[x][y].locchar = locchar;
    if (locchar == WATER)
      Level->site[x][y].p_locf = L_WATER;
    else Level->site[x][y].p_locf = L_NO_OP;
    Level->site[x][y].roomnumber = RS_SEWER_DUCT;
    x+=dx;
    y+=dy;
  if (locchar == WATER)
    continuing = (inbounds(x,y) && 
		  ((Level->site[x][y].locchar == WALL) ||
		   (Level->site[x][y].locchar == WATER)));
  else
    continuing = (inbounds(x,y) && 
		  ((Level->site[x][y].roomnumber == RS_WALLSPACE) ||
		   (Level->site[x][y].roomnumber == RS_SEWER_DUCT)));
  }
  if (inbounds(x,y))
    makedoor(x,y);
}




void install_specials()
{
  int i,j,x,y;

  for(x=0;x<WIDTH;x++)
    for(y=0;y<LENGTH;y++)
      if ((Level->site[x][y].locchar == FLOOR) &&
	  (Level->site[x][y].p_locf == L_NO_OP) &&
	  (random_range(300) < difficulty())) {
	i = random_range(100);
	if (i < 10) {
	  Level->site[x][y].locchar = ALTAR;
	  Level->site[x][y].p_locf = L_ALTAR;
	  Level->site[x][y].aux = random_range(10);
	}
	else if (i < 20) {
	  Level->site[x][y].locchar = WATER;
	  Level->site[x][y].p_locf = L_MAGIC_POOL;
	}
	else if (i < 35) {
	  Level->site[x][y].locchar = RUBBLE;
	  Level->site[x][y].p_locf = L_RUBBLE;
	}
	else if (i < 40) {
	  Level->site[x][y].locchar = LAVA;
	  Level->site[x][y].p_locf = L_LAVA;
	}
	else if (i < 45) {
	  Level->site[x][y].locchar = FIRE;
	  Level->site[x][y].p_locf = L_FIRE;
	}
	else if ((i < 50) && (Current_Environment != E_ASTRAL)) {
	  Level->site[x][y].locchar = LIFT;
	  Level->site[x][y].p_locf = L_LIFT;
	}
	else if ((i < 55) && (Current_Environment != E_VOLCANO)) {
	  Level->site[x][y].locchar = HEDGE;
	  Level->site[x][y].p_locf = L_HEDGE;
	}
	else if (i < 57) {
	  Level->site[x][y].locchar = HEDGE;
	  Level->site[x][y].p_locf = L_TRIFID;
	}
	else if (i< 70) {
	  Level->site[x][y].locchar = STATUE;
	  if (random_range(100) < difficulty()) 
	    for (j=0;j<8;j++) {
	      if (Level->site[x+Dirs[0][j]][y+Dirs[1][j]].p_locf != L_NO_OP)
		Level->site[x+Dirs[0][j]][y+Dirs[1][j]].locchar = FLOOR;
	      Level->site[x+Dirs[0][j]][y+Dirs[1][j]].p_locf = 
		L_STATUE_WAKE;
	    }
	}
	else {
	  if (Current_Environment == E_VOLCANO) {
	    Level->site[x][y].locchar = LAVA;
	    Level->site[x][y].p_locf = L_LAVA;
	  }
	  else if (Current_Environment == E_ASTRAL) {
	    if (Level->depth == 1) {
	      Level->site[x][y].locchar = RUBBLE;
	      Level->site[x][y].p_locf = L_RUBBLE;
	    }
	    else if (Level->depth == 2) {
	      Level->site[x][y].locchar = FIRE;
	      Level->site[x][y].p_locf = L_FIRE;
	    }
	    else if (Level->depth == 3) {
	      Level->site[x][y].locchar = WATER;
	      Level->site[x][y].p_locf = L_WATER;
	    }
	    else if (Level->depth == 4) {
	      Level->site[x][y].locchar = ABYSS;
	      Level->site[x][y].p_locf = L_ABYSS;
	    }
	  }
	  else {
	    Level->site[x][y].locchar = WATER;
	    Level->site[x][y].p_locf = L_WATER;
	  }
	}
      }
}