item_gen.c

石器时代2.0完整版源代码.已经加入新功能. 在REDHAT9下GCC3.4编译成功.

/***********************************************
 * 失奶  丞宁岳″
 **********************************************/
#include "version.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include <errno.h>
#include <ctype.h>
#include <math.h>

#include "configfile.h"
#include "util.h"
#include "buf.h"

#include "char.h"
#include "item.h"
#include "item_gen.h"
#include "enemy.h"
#include "log.h"
#include "saacproto_cli.h"
#include "family.h"
#include "magic_base.h"

#define		DEBUGPRINT 0
#define		DEBUGPRINT_DETAIL	0

// shan begin
#define	        FOOD_HP_RATE            200
#define         FOOD_MP_RATE            200
#define         FOOD_SUCCESS_RATE       150
#define         FOOD_TURN_ADDPOINT      1
// shan end

static int ITEM_getTableNum( int num);

/* 豳笺及袄及MAX袄 */
#define		ITEM_ATOMIND_MAX	1000
// shan add
#define         ITEM_ATOMIND_FM_MAX     4000

#define		ITEM_RANDRANGEDOM		1000
#define		ITEM_RANDRANGEDOM_BASE	0
// shan add
#define         ITEM_FM_RANDRANGEDOM            4000

/***********************************************
 * (ITEM_GEN_RAND_MIN/1000) * ITEN_GEN_SEARCH_MIN 
 *  - (ITEM_GEN_RAND_MAX/1000) * ITEN_GEN_SEARCH_MAX
 * 仇木分仃及汔及豳笺及  区毛潸曰丹月仪卞卅月［
 **********************************************/

/* 豳笺及袄    及仿件母丞汔及  剂午      ㄠㄟㄟㄟ坌     */
#define		ITEM_GEN_RAND_MIN		700
#define		ITEM_GEN_RAND_MAX		1200

/* 失奶  丞毛腹绸允月豳笺及袄及汔及  剂午    及    (double) */
#define		ITEN_GEN_SEARCH_MIN		(0.7)
#define		ITEN_GEN_SEARCH_MAX		(1.10)

static struct tagItemSearchRangeTable {
	double	searchmin;
	double	searchmax;
}ItemSearchTable[2] = {
//	{ 0.7, 1.1},
// shan add
//	{ 0.7, 1.3},
//	{ 0.5, 1.5}
	{ 0.8, 1.2},
	{ 0.7, 1.3}	
};

static struct tagItemRandRangeTable {
	int	randmin;
	int	randmax;
}ItemRandTable[2] = {
//	{ 700, 1200},
	{ 700, 1300},
	{ 900, 1100}
};

#define		ITEM_GEN_RATE	0.7

static struct _tagItemRandRangeTableForItem {
	int	num;			/* 豳笺及备仿件弁及湘  袄 */
	int	minnum;			/* 仿件弁  潸曰丹月袄及Min */
	int	maxnum;			/* 仿件弁  潸曰丹月袄及MAX  num +戚及仿件弁及犒*ITEM_GEN_RATE) */
	double rate;		/*      maxnum / num*/
}ItemRandTableForItem[] = {
	{   10, 0,0,0 },
	{   30, 0,0,0 },
	{   65, 0,0,0 },
	{  125, 0,0,0 },
	{  205, 0,0,0 },
	{  305, 0,0,0 },
	{  425, 0,0,0 },
	{  565, 0,0,0 },
	{  725, 0,0,0 },
	{  905, 0,0,0 },
	{ 1125, 0,0,0 },    // shan add
	{ 1354, 0,0,0 },	     
	{ 1594, 0,0,0 },	
	{ 1825, 0,0,0 },	
	{ 2105, 0,0,0 },	
	{ 2405, 0,0,0 },	
	{ 2725, 0,0,0 },	
	{ 3065, 0,0,0 },	
	{ 3425, 0,0,0 },	
	{ 3805, 0,0,0 }
};

#define ATOM_LEVEL_MAX 16
struct item_atom
{
	char name[32];
	unsigned int name_hash;
	int	 magicflg;
};


struct item_atom *item_atoms;
int item_atoms_size;
#define MAX_ITEM_ATOMS_SIZE 128

struct item_ingindtable {
	double data[MAX_ITEM_ATOMS_SIZE];
	int	index;
	int	num;
};

static int ITEM_getAtomIndexByName( char *nm ) // 从素材名称取得素材index
{
	int i;
	unsigned int h = hashpjw( nm );
	for( i = 0; i < item_atoms_size; i ++ ){
		if( item_atoms[i].name_hash == h &&
			strcmp( item_atoms[i].name, nm) == 0 ){
			return i;
		}
	}
	return -1;
}

extern ITEM_table *ITEM_tbl;
extern ITEM_index*  ITEM_idx;

struct ingcache
{
	int use;
#define MAXING_ONE 5
	int inguse;
	int	canmergefrom;
	int	canmergeto;
	int	hitnum;
	int ingind[MAXING_ONE];
	int ingval[MAXING_ONE];
};

int ITEM_initRandTable( void)
{
	int i;
	for( i = 0; i < arraysizeof( ItemRandTableForItem); i ++) {
		if( i == 0 ) ItemRandTableForItem[i].minnum = 0;
		else {
			ItemRandTableForItem[i].minnum = ItemRandTableForItem[i-1].maxnum+1;
		}
		if( i + 1 != arraysizeof( ItemRandTableForItem)) {
			ItemRandTableForItem[i].maxnum = 
					ItemRandTableForItem[i].num +
					(ItemRandTableForItem[i+1].num - ItemRandTableForItem[i].num)
					*ITEM_GEN_RATE;
			
		}
		else {
		        // shan add
			ItemRandTableForItem[i].maxnum = 4000;
  			//ItemRandTableForItem[i].maxnum = 1000;
		}
		ItemRandTableForItem[i].rate = ItemRandTableForItem[i].maxnum
									/ (double)ItemRandTableForItem[i].num;
	}
	/*for( i = 0; i < arraysizeof( ItemRandTableForItem); i ++) {
		print( "\ntable num:[%d] min:[%d] max:[%d] rate:[%3.3f] ",
						ItemRandTableForItem[i].num,							
						ItemRandTableForItem[i].minnum,
						ItemRandTableForItem[i].maxnum,
						ItemRandTableForItem[i].rate);
	}*/
	return TRUE;
}

static struct ingcache *icache;
int icache_num;

int ITEM_initItemIngCache( void )
{
	int i;
//	print ( "\n初始化物品缓冲: 物品最大数:%d ", ITEM_getItemMaxIdNum() );
	icache_num = ITEM_getItemMaxIdNum( );
	print(" 缓冲数:%d ", icache_num);
	icache = calloc(1, sizeof( struct ingcache ) * icache_num );
	if( icache == NULL ){
		print( "初始化物品缓冲: 没有物品\n" );
		return FALSE;
	}
	
	print("分配 %4.2f MB 空间...", sizeof( struct ingcache ) * icache_num /1024.0/1024.0);
	
//	remove( "old_icache.txt");
	memset( icache, 0, icache_num * sizeof( struct ingcache) );
	for( i=0; i<icache_num; i++){
		if( ITEM_idx[i].use ){ //new
			int k=0;
#define ADD_ICACHE_INGRED( nm, vl )	if( ITEM_tbl[ITEM_idx[i].index].itm.string[nm].string[0] ){icache[i].ingind[k] = ITEM_getAtomIndexByName(ITEM_tbl[ITEM_idx[i].index].itm.string[nm].string );if( icache[i].ingind[k] < 0 ){print( "fuck ing[%s][%d] for %d %s\n", ITEM_tbl[ITEM_idx[i].index].itm.string[nm].string,ITEM_tbl[ITEM_idx[i].index].itm.data[vl], ITEM_tbl[i].itm.data[ITEM_ID], ITEM_tbl[ITEM_idx[i].index].itm.string[ITEM_NAME].string );}else {icache[i].ingval[k] = ITEM_tbl[ITEM_idx[i].index].itm.data[vl];k++;}}
			ADD_ICACHE_INGRED( ITEM_INGNAME0, ITEM_INGVALUE0 );
			ADD_ICACHE_INGRED( ITEM_INGNAME1, ITEM_INGVALUE1 );
			ADD_ICACHE_INGRED( ITEM_INGNAME2, ITEM_INGVALUE2 );
			ADD_ICACHE_INGRED( ITEM_INGNAME3, ITEM_INGVALUE3 );
			ADD_ICACHE_INGRED( ITEM_INGNAME4, ITEM_INGVALUE4 );
			icache[i].inguse = k;

			if( k == 0 ){
				if( ITEM_tbl[ITEM_idx[i].index].itm.data[ITEM_CANMERGEFROM] == TRUE || //new
					ITEM_tbl[ITEM_idx[i].index].itm.data[ITEM_CANMERGETO] == TRUE){//new
					print( "ID%d (%s)尚未设定成分\n",
						   ITEM_tbl[ITEM_idx[i].index].itm.data[ITEM_ID], //new
						   ITEM_tbl[ITEM_idx[i].index].itm.string[ITEM_NAME].string ); //new
				}
			}else{
				
				icache[i].use = 1;
				icache[i].canmergefrom = ITEM_tbl[ITEM_idx[i].index].itm.data[ITEM_CANMERGEFROM]; //new
				icache[i].canmergeto   = ITEM_tbl[ITEM_idx[i].index].itm.data[ITEM_CANMERGETO]; //new
/*
				FILE *fp;
				if( (fp = fopen( "old_icache.txt", "a+")) != NULL ){
					fprintf( fp, "icache %4d %4d [%s] \t- %s %s %s %s %s\n",
						i,
						ITEMTBL_getInt( i, ITEM_ID),
						ITEMTBL_getChar( i, ITEM_NAME),
						ITEMTBL_getChar( i, ITEM_INGNAME0),
						ITEMTBL_getChar( i, ITEM_INGNAME1),
						ITEMTBL_getChar( i, ITEM_INGNAME2),
						ITEMTBL_getChar( i, ITEM_INGNAME3),
						ITEMTBL_getChar( i, ITEM_INGNAME4)	);
					fclose( fp);
				}
*/
			}
		}
	}
	return TRUE;
}

int ITEM_initItemAtom( char *fn )
{
	FILE *fp;
	int count=0;
	
	fp = fopen( fn , "r" );
	if( fp == NULL ){
		print( "打开文件失败 %s\n", fn );
		return FALSE;
	}

	fseek( fp, 0, SEEK_SET );
	while(1){
		char line[16384];
		if( fgets( line, sizeof( line ), fp ) == NULL )break;
		if( line[0] != '#' && line[0] != '\n' )count++;
	}
	print( "初始化物品成份: 总数 %d \n", count );

	if( count == 0 ){
		print( "初始化物品成份: 无法正确设置物品成份. 异常中断.\n" );
		return FALSE;
	}
	
	/* malloc. */
	item_atoms = ( struct item_atom * ) allocateMemory( count *
												sizeof( struct item_atom ));
	if( item_atoms == NULL ){
		print( "分配内存失败\n" );
		return FALSE;
	}
	memset( item_atoms, 0 , count * sizeof( struct item_atom));
	
	fseek( fp , 0 , SEEK_SET );
	count = 0;
	while(1){
		char line[16384], tk[1024];
		if( fgets( line, sizeof( line ) , fp ) == NULL )break;
		/* chop */
		line[strlen(line)-1]=0;

		/* 尔羹卞烟让及  蟆互    贿匹反中匀化中化｝
		 公木分仃互  邰 */
		getStringFromIndexWithDelim( line, "," , 1 , tk, sizeof( tk ));
		snprintf( item_atoms[count].name,
				  sizeof( item_atoms[count].name ),
				  "%s", tk );
		item_atoms[count].name_hash = hashpjw( tk );

		getStringFromIndexWithDelim( line, "," , 2 , tk, sizeof( tk ));
		item_atoms[count].magicflg = isstring1or0( tk);
		
		// CoolFish: 2001/6/28
		// print( "atom [%s][%d] %d\n", item_atoms[count].name,
		//								item_atoms[count].magicflg, count );

		count++;
	}
	fclose(fp);

	if( count >= MAX_ITEM_ATOMS_SIZE ){
		print( "初始化物品成份: 物品成份太多了\n" );
		return FALSE;
	}
			   
	item_atoms_size = count;
	print( "初始化物品成份: 读取 %d 物品成份...", count );

	return TRUE;
}

/*
  
  刭醒及伊□玄

  base 互 100 匹 min 互 0.7 匹 max 互 1.3 分匀凶日｝
  70 ~ 130 卞剽域卞坌  允月［午曰丐尹内剽域［
  剽域元扎卅仁仄凶曰允月井手仄木卅中及匹｝
  失奶  丞毁迕伙□民件午仄化仇仇卞烂聒允月 by ringo 1999Oct1 
  1000坌及min_rate,max_rate匹健丹［
  double 支float 反］支支仇仄中及匹银歹卅中［
 */
static int
ITEM_randRange( int base, int min_rate , int max_rate )
{
	int minnum;
	int maxnum;
	int range;

	if( min_rate > max_rate) {
		int tmp;
		tmp = min_rate;
		min_rate = max_rate;
		max_rate = tmp;
	}
	minnum = rint((double)base / ITEM_RANDRANGEDOM * min_rate);
	maxnum = rint((double)base / ITEM_RANDRANGEDOM * max_rate);
	range  = ( maxnum - minnum );
	
	if( min_rate == max_rate && min_rate == 0 ) return 0;
	if( range == 0 ) return base;
	if( range < 0 ) return 0;
	return minnum + RAND( 0, range);
}

typedef int (*FUNC)( const void *, const void * );