Source:NetHack 3.4.3/src/mkmaze.c - Revision history

Furey: Fix instructions for linking to a particular line. Current instructions incorrectly link to a different version of NetHack.

2024-06-25T20:29:14Z

Fix instructions for linking to a particular line. Current instructions incorrectly link to a different version of NetHack.

Corundum: Added link back to makelevel() from makemaz().

2012-04-17T14:45:44Z

Added link back to makelevel() from makemaz().

Corundum: /* maze0xy */

2012-04-17T14:27:01Z

‎maze0xy

Corundum: /* mazexy */

2012-04-17T14:21:39Z

‎mazexy

Corundum: /* bound_digging */

2012-04-17T14:15:34Z

‎bound_digging

Corundum: Comments on okay()

2012-04-11T18:11:37Z

Comments on okay()

Corundum: More makemaz()

2012-04-11T17:16:50Z

More makemaz()

Corundum: Comments for walkfrom()

2012-04-11T17:03:38Z

Comments for walkfrom()

Corundum: Comments for makemaz()

2012-04-11T16:51:23Z

Comments for makemaz()

Paxedbot: moved Source:Mkmaze.c to Source:NetHack 3.4.3/src/mkmaze.c: Moving src to subdirs

2011-01-31T19:22:23Z

moved Source:Mkmaze.c to Source:NetHack 3.4.3/src/mkmaze.c: Moving src to subdirs

@@ Line 1: / Line 1: @@
 __MIXEDSYNTAXHIGHLIGHT__
-Below is the full text to src/mkmaze.c from NetHack 3.4.3. To link to a particular line, write [[mkmaze.c#line123|<nowiki>[[mkmaze.c#line123]]</nowiki>]], for example.
+Below is the full text to src/mkmaze.c from NetHack 3.4.3. To link to a particular line, write [[Source:NetHack 3.4.3/src/mkmaze.c#line123]], for example.
 == Top of file ==

@@ Line 541: / Line 541: @@
 == makemaz ==
-Function to create a special level with the given name, or else (special level not found or name not specified) a level filled entirely with maze (a la Gehennom).
+Function to create a special level with the given name, or else (special level not found or name not specified) a level filled entirely with maze (a la Gehennom). Called from [[mklev.c#makelevel | makelevel()]] in mklev.c
   <span id="line495">495.  void</span>

← Older revision		Revision as of 14:27, 17 April 2012
Line 237:		Line 237:

	== maze0xy ==		== maze0xy ==
		+
		+	Chooses a random starting point for maze generation. Always picks a point with odd (never even) coordinates with x in [3 .. x_maze_max-1], y in [3 .. y_maze_max-1].

	<span id="line209">209. STATIC_OVL void</span>		<span id="line209">209. STATIC_OVL void</span>

@@ Line 889: / Line 889: @@
   <span id="line764">764.  </span>
   <span id="line765">765.  	do {</span>
   <span id="line766">766.  	    cc->x = 3 + 2*rn2((x_maze_max>>1) - 1);</span>
   <span id="line767">767.  	    cc->y = 3 + 2*rn2((y_maze_max>>1) - 1);</span>
@@ Line 899: / Line 902: @@
   <span id="line774">774.  #endif</span>
   <span id="line775">775.  		);</span>
   <span id="line776">776.  	if (cpt >= 100) {</span>
   <span id="line777">777.  		register int x, y;</span>

@@ Line 943: / Line 943: @@
   <span id="line815">815.  	if(Is_earthlevel(&u.uz)) return; /* everything diggable here */</span>
   <span id="line816">816.  </span>
   <span id="line817">817.  	found = nonwall = FALSE;</span>
   <span id="line818">818.  	for(xmin=0; !found; xmin++) {</span>
@@ Line 954: / Line 957: @@
   <span id="line826">826.  		}</span>
   <span id="line827">827.  	}</span>
   <span id="line828">828.  	xmin -= (nonwall || !level.flags.is_maze_lev) ? 2 : 1;</span>
   <span id="line829">829.  	if (xmin < 0) xmin = 0;</span>
   <span id="line830">830.  </span>
   <span id="line831">831.  	found = nonwall = FALSE;</span>
   <span id="line832">832.  	for(xmax=COLNO-1; !found; xmax--) {</span>
@@ Line 971: / Line 980: @@
   <span id="line843">843.  	if (xmax >= COLNO) xmax = COLNO-1;</span>
   <span id="line844">844.  </span>
   <span id="line845">845.  	found = nonwall = FALSE;</span>
   <span id="line846">846.  	for(ymin=0; !found; ymin++) {</span>
@@ Line 984: / Line 996: @@
   <span id="line856">856.  	ymin -= (nonwall || !level.flags.is_maze_lev) ? 2 : 1;</span>
   <span id="line857">857.  </span>
   <span id="line858">858.  	found = nonwall = FALSE;</span>
   <span id="line859">859.  	for(ymax=ROWNO-1; !found; ymax--) {</span>
@@ Line 996: / Line 1,013: @@
   <span id="line868">868.  	}</span>
   <span id="line869">869.  	ymax += (nonwall || !level.flags.is_maze_lev) ? 2 : 1;</span>
   <span id="line870">870.  </span>
   <span id="line871">871.  	for (x = 0; x < COLNO; x++)</span>

← Older revision		Revision as of 18:11, 11 April 2012
Line 220:		Line 220:

	== okay ==		== okay ==
		+
		+	Helper function for walkfrom(). Checks to see if the square <b>two</b> spaces from the given location in the given direction is within map bounds and is currently solid stone. Returns TRUE if so, otherwise FALSE. Note that this function does <b>not</b> check the contents of the square one space in the given direction.

	<span id="line197">197. STATIC_OVL boolean</span>		<span id="line197">197. STATIC_OVL boolean</span>

@@ Line 537: / Line 537: @@
 == makemaz ==
-Function to create a level filled entirely with maze (a la Gehennom).
+Function to create a special level with the given name, or else (special level not found or name not specified) a level filled entirely with maze (a la Gehennom).
   <span id="line495">495.  void</span>
@@ Line 592: / Line 592: @@
   <span id="line546">546.  </span>
   <span id="line547">547.  	if(*protofile) {</span>
   <span id="line548">548.  	    Strcat(protofile, LEV_EXT);</span>
   <span id="line549">549.  	    if(load_special(protofile)) {</span>
@@ Line 603: / Line 606: @@
   <span id="line557">557.  	}</span>
   <span id="line558">558.  </span>
   <span id="line559">559.  	level.flags.is_maze_lev = TRUE;</span>
   <span id="line560">560.  </span>
@@ Line 693: / Line 699: @@
   <span id="line629">629.  	place_branch(Is_branchlev(&u.uz), 0, 0);</span>
   <span id="line630">630.  </span>
   <span id="line631">631.  	for(x = rn1(8,11); x; x--) {</span>
   <span id="line632">632.  		mazexy(&mm);</span>

@@ Line 717: / Line 717: @@
   <span id="line653">653.  }</span>
   <span id="line654">654.  </span>
   <span id="line655">655.  #ifdef MICRO</span>
   <span id="line656">656.  /* Make the mazewalk iterative by faking a stack.  This is needed to</span>
@@ Line 723: / Line 730: @@
   <span id="line659">659.   * that is totally safe.</span>
   <span id="line660">660.   */</span>
   <span id="line661">661.  void</span>
   <span id="line662">662.  walkfrom(x,y)</span>
@@ Line 735: / Line 739: @@
   <span id="line668">668.  	int dirs[4];</span>
   <span id="line669">669.  </span>
   <span id="line670">670.  	pos = 1;</span>
   <span id="line671">671.  	mazex[pos] = (char) x;</span>
@@ Line 750: / Line 757: @@
   <span id="line683">683.  		    levl[x][y].flags = 0;</span>
   <span id="line684">684.  		}</span>
   <span id="line685">685.  		q = 0;</span>
   <span id="line686">686.  		for (a = 0; a < 4; a++)</span>
   <span id="line687">687.  			if(okay(x, y, a)) dirs[q++]= a;</span>
   <span id="line688">688.  		if (!q)</span>
   <span id="line689">689.  			pos--;</span>
   <span id="line690">690.  		else {</span>
   <span id="line691">691.  			dir = dirs[rn2(q)];</span>
   <span id="line692">692.  			move(&x, &y, dir);</span>
@@ Line 764: / Line 780: @@
   <span id="line697">697.  #endif</span>
   <span id="line698">698.  			move(&x, &y, dir);</span>
   <span id="line699">699.  			pos++;</span>
   <span id="line700">700.  			if (pos > CELLS)</span>
@@ Line 773: / Line 792: @@
   <span id="line706">706.  }</span>
   <span id="line707">707.  #else</span>
   <span id="line708">708.  </span>
   <span id="line709">709.  void</span>
@@ Line 792: / Line 814: @@
   <span id="line725">725.  </span>
   <span id="line726">726.  	while(1) {</span>
   <span id="line727">727.  		q = 0;</span>
   <span id="line728">728.  		for(a = 0; a < 4; a++)</span>
   <span id="line729">729.  			if(okay(x,y,a)) dirs[q++]= a;</span>
   <span id="line730">730.  		if(!q) return;</span>
   <span id="line731">731.  		dir = dirs[rn2(q)];</span>
   <span id="line732">732.  		move(&x,&y,dir);</span>
@@ Line 804: / Line 835: @@
   <span id="line737">737.  #endif</span>
   <span id="line738">738.  		move(&x,&y,dir);</span>
   <span id="line739">739.  		walkfrom(x,y);</span>
   <span id="line740">740.  	}</span>

@@ Line 536: / Line 536: @@
 == makemaz ==
   <span id="line495">495.  void</span>
@@ Line 603: / Line 605: @@
   <span id="line559">559.  	level.flags.is_maze_lev = TRUE;</span>
   <span id="line560">560.  </span>
   <span id="line561">561.  #ifndef WALLIFIED_MAZE</span>
   <span id="line562">562.  	for(x = 2; x < x_maze_max; x++)</span>
@@ Line 613: / Line 618: @@
   <span id="line569">569.  #endif</span>
   <span id="line570">570.  </span>
   <span id="line571">571.  	maze0xy(&mm);</span>
   <span id="line572">572.  	walkfrom((int) mm.x, (int) mm.y);</span>
   <span id="line573">573.  	/* put a boulder at the maze center */</span>
@@ Line 619: / Line 630: @@
   <span id="line575">575.  </span>
   <span id="line576">576.  #ifdef WALLIFIED_MAZE</span>
   <span id="line577">577.  	wallification(2, 2, x_maze_max, y_maze_max);</span>
   <span id="line578">578.  #endif</span>
   <span id="line579">579.  	mazexy(&mm);</span>
   <span id="line580">580.  	mkstairs(mm.x, mm.y, 1, (struct mkroom *)0);		/* up */</span>
   <span id="line581">581.  	if (!Invocation_lev(&u.uz)) {</span>
   <span id="line582">582.  	    mazexy(&mm);</span>
   <span id="line583">583.  	    mkstairs(mm.x, mm.y, 0, (struct mkroom *)0);	/* down */</span>

← Older revision	Revision as of 19:22, 31 January 2011
(No difference)