4 * author: frank zirkelbach (frank.zirkelbach@physik.uni-augsburg.de)
6 * this program tries helping to understand the amorphous depuration
7 * and recrystallization of SiCx while ion implantation at temperatures
8 * below 400 degree celsius.
9 * hopefully the program will simulate the stabilization of the
10 * selforganizing lamella structure in the observed behaviour.
13 * - J. K. N. Lindner. Habil.Schrift, Universitaet Augsburg.
14 * - Maik Haeberlen. Diplomarbeit, Universitaet Augsburg.
16 * Copyright (C) 2004 Frank Zirkelbach
18 * This program is free software; you can redistribute it and/or modify
19 * it under the terms of the GNU General Public License as published by
20 * the Free Software Foundation; either version 2 of the License, or
21 * (at your option) any later version.
23 * This program is distributed in the hope that it will be useful,
24 * but WITHOUT ANY WARRANTY; without even the implied warranty of
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
26 * GNU General Public License for more details.
28 * You should have received a copy of the GNU General Public License
29 * along with this program; if not, write to the Free Software
30 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
38 #include <sys/types.h>
52 #include "nlsop_general.h"
54 #define MAKE_AMORPH(N) *(N)|=AMORPH
55 #define MAKE_CRYST(N) *(N)&=~AMORPH
59 char p_file[MAX_CHARS];
60 char n_e_file[MAX_CHARS];
61 char r_file[MAX_CHARS];
68 int get_data_and_calc(t_event *event,void *allineed);
73 printf("%s -i ip -p port -r/P/n random/profile/neloss file\n",prog);
78 * nlsop internal functions
81 int sputter(d3_lattice *d3_l)
86 size=d3_l->max_x*d3_l->max_y;
90 for(i=0;i<d3_l->max_z-1;i++)
92 memcpy(d3_l->status+offl,d3_l->status+offh,size);
93 memcpy(d3_l->extra+offl,d3_l->extra+offh,size*sizeof(int));
97 memset(d3_l->status+offl,0,size);
98 memset(d3_l->extra+offl,0,size);
103 int process_cell(d3_lattice *d3_l,u32 x,u32 y,u32 z,info *my_info,u32 nel_z)
111 thiz=d3_l->status+x+y*d3_l->max_x+z*d3_l->max_x*d3_l->max_y;
112 conc=d3_l->extra+x+y*d3_l->max_x+z*d3_l->max_x*d3_l->max_y;
114 for(i=-(my_info->range);i<=my_info->range;i++)
116 for(j=-(my_info->range);j<=my_info->range;j++)
120 off=((x+d3_l->max_x+i)%d3_l->max_x)+((y+d3_l->max_y+j)%d3_l->max_x)*d3_l->max_x+z*d3_l->max_x*d3_l->max_y;
121 if(*(d3_l->status+off)&AMORPH) p+=my_info->s*(*(d3_l->extra+off))*URAND_MAX/(i*i+j*j);
125 p+=*conc*my_info->c*URAND_MAX;
128 if(get_rand(URAND_MAX)<=p) MAKE_AMORPH(thiz);
131 /* assume 1-p probability */
132 /* also look for neighbours ! */
133 q=(URAND_MAX-p)>0?URAND_MAX-p:0;
135 j+=(*(d3_l->status+((x+d3_l->max_x+1)%d3_l->max_x)+y*d3_l->max_x+z*d3_l->max_x*d3_l->max_y)&AMORPH)?1:0;
136 j+=(*(d3_l->status+((x+d3_l->max_x-1)%d3_l->max_x)+y*d3_l->max_x+z*d3_l->max_x*d3_l->max_y)&AMORPH)?1:0;
137 j+=(*(d3_l->status+x+((y+1+d3_l->max_y)%d3_l->max_y)*d3_l->max_x+z*d3_l->max_x*d3_l->max_y)&AMORPH)?1:0;
138 j+=(*(d3_l->status+x+((y-1+d3_l->max_y)%d3_l->max_y)*d3_l->max_x+z*d3_l->max_x*d3_l->max_y)&AMORPH)?1:0;
139 j+=(*(d3_l->status+x+y*d3_l->max_x+((z+1+d3_l->max_z)%d3_l->max_z)*d3_l->max_x*d3_l->max_y)&AMORPH)?1:0;
140 j+=(*(d3_l->status+x+y*d3_l->max_x+((z-1+d3_l->max_z)%d3_l->max_z)*d3_l->max_x*d3_l->max_y)&AMORPH)?1:0;
143 if(get_rand(URAND_MAX)>p) MAKE_CRYST(thiz);
149 int distrib_c(d3_lattice *d3_l,info *my_info,int step,u32 rj_m,u32 *rj_g)
156 /* put one c ion somewhere in the lattice */
157 x=get_rand(d3_l->max_x);
158 y=get_rand(d3_l->max_y);
159 z=get_rand_reject(d3_l->max_z,rj_m,rj_g);
160 *(d3_l->extra+x+y*d3_l->max_x+z*d3_l->max_x*d3_l->max_y)+=1;
163 if(step%my_info->diff_rate==0)
166 for(i=0;i<d3_l->max_x;i++)
168 for(j=0;j<d3_l->max_y;j++)
170 for(k=0;k<d3_l->max_z;k++)
172 offset=i+j*d3_l->max_x+k*d3_l->max_x*d3_l->max_y;
173 /* case amorph: amorph <- cryst diffusion */
174 if(*(d3_l->status+offset)&AMORPH)
180 off=((i+d3_l->max_x+c)%d3_l->max_x)+j*d3_l->max_x+k*d3_l->max_x*d3_l->max_y;
182 if(!(*(d3_l->status+off)&AMORPH)) carry=(int)(my_info->dr_ac*(*(d3_l->extra+off)));
185 *(d3_l->extra+offset)+=carry;
186 *(d3_l->extra+off)-=carry;
194 off=i+((j+c+d3_l->max_y)%d3_l->max_y)*d3_l->max_x+k*d3_l->max_x*d3_l->max_y;
196 if(!(*(d3_l->status+off)&AMORPH)) carry=(int)(my_info->dr_ac*(*(d3_l->extra+off)));
199 *(d3_l->extra+offset)+=carry;
200 *(d3_l->extra+off)-=carry;
204 /* diff in z direction */
207 off=i+j*d3_l->max_x+(k-1)*d3_l->max_x*d3_l->max_y;
209 if(!*(d3_l->status+off)&AMORPH) carry=(int)(my_info->dr_ac*(*(d3_l->extra+off)));
212 *(d3_l->extra+off)-=carry;
213 *(d3_l->extra+offset)+=carry;
218 off=i+j*d3_l->max_x+(k+1)*d3_l->max_x*d3_l->max_y;
220 if(!*(d3_l->status+off)&AMORPH) carry=(int)(my_info->dr_ac*(*(d3_l->extra+off)));
223 *(d3_l->extra+off)-=carry;
224 *(d3_l->extra+offset)+=carry;
232 } /* if step modulo diff_rate == 0 */
237 u32 get_reject_graph(info *my_info,d3_lattice *d3_l,char *file,u32 *graph) {
246 if((fd=open(file,O_RDONLY))<0)
248 puts("cannot open file to calculate rejection graph");
251 if((flag=(unsigned char *)malloc(d3_l->max_z))==NULL)
253 puts("cannot malloc flag memory for rejection graph");
256 memset(flag,0,d3_l->max_z);
257 memset(graph,0,d3_l->max_z*sizeof(u32));
264 k=read(fd,&buf[i],1);
265 if((buf[i]=='\n')||(k==0)) break;
270 a=atof(p)/10; /* nm */
273 if(a>d3_l->max_z*CELL_LENGTH) k=0;
276 graph[(int)(a/CELL_LENGTH)]=(int)(URAND_MAX/100*b);
277 flag[(int)(a/CELL_LENGTH)]=1;
281 /* do (linear) interpolation here! */
289 while(flag[i]==0&&i<d3_l->max_z) i++;
290 for(k=j+1;k<i;k++) graph[k]=(int)((k-j)*((int)graph[i]-(int)graph[j])/(i-j))+graph[j];
291 if(graph[i]>max) max=graph[i];
296 #ifdef DEBUG_INTERPOL_PROFILE
297 printf("debug: %s (interpolated profile)\n",file);
298 for(i=0;i<d3_l->max_z;i++) printf("%d %d\n",i,graph[i]);
304 void send_data(int signum) {
308 c=gd3_l->max_x*gd3_l->max_y*gd3_l->max_z;
310 network_send(gnet->connection[0].fd,&dc,1);
312 network_send(gnet->connection[0].fd,(unsigned char *)gd3_l,
314 network_send(gnet->connection[0].fd,(unsigned char *)gmy_info,sizeof(info));
316 network_send(gnet->connection[0].fd,gd3_l->status,c*sizeof(unsigned char));
317 network_send(gnet->connection[0].fd,(unsigned char *)gd3_l->extra,
319 network_send(gnet->connection[0].fd,(unsigned char *)gi,sizeof(int));
328 int main(int argc,char **argv)
335 unsigned char data[256];
341 strcpy(server_ip,"");
342 strcpy(p_file,IMP_PROFILE);
343 strcpy(n_e_file,NEL_PROFILE);
347 /* parse/check argv */
348 for(i=1;i<argc;i++) {
349 if(argv[i][0]=='-') {
355 strncpy(server_ip,argv[++i],16);
358 strcpy(r_file,argv[++i]);
361 strcpy(p_file,argv[++i]);
364 strcpy(n_e_file,argv[++i]);
367 port=atoi(argv[++i]);
375 if(!strcmp(server_ip,"")) {
381 event_init(&event,1);
382 event_set_timeout(&event,0,0);
384 /* connect to server */
385 network_init(&net,1);
386 network_set_connection_info(&net,0,server_ip,port);
387 if(network_connect(&net,0)==N_E_CONNECT) {
388 printf("unable to connect to server, aborting ...\n");
391 network_select(&net,0);
393 /* tell server: i am a client, i may work for you */
394 data[0]=NLSOP_CLIENT;
395 network_send(net.connection[0].fd,data,1);
398 event_math(net.connection[0].fd,&event,READ,ADD);
399 printf("idle, waiting for jobs ...\n");
400 event_start(&event,NULL,get_data_and_calc,NULL);
405 int get_data_and_calc(t_event *event,void *allineed) {
416 unsigned char data[256];
430 printf("got a new job ...\n");
432 /* get info (+data) */
433 network_receive(net->connection[0].fd,data,1);
434 if(data[0]==NLSOP_NJOB || data[0]==NLSOP_CJOB) {
435 network_receive(net->connection[0].fd,(unsigned char *)&d3_l,
437 network_receive(net->connection[0].fd,(unsigned char *)&my_info,
440 j=d3_l.max_x*d3_l.max_y*d3_l.max_z;
441 d3_l.status=(unsigned char *)malloc(j*sizeof(unsigned char));
442 if(d3_l.status==NULL) {
443 printf("status alloc failed\n");
446 d3_l.extra=(int *)malloc(j*sizeof(int));
447 if(d3_l.extra==NULL) {
448 printf("extra malloc failed\n");
451 if(data[0]==NLSOP_CJOB) {
452 network_receive(net->connection[0].fd,d3_l.status,
453 j*sizeof(unsigned char));
454 network_receive(net->connection[0].fd,(unsigned char *)d3_l.extra,
456 network_receive(net->connection[0].fd,(unsigned char *)&c_step,
461 printf("starting simulation with following parameters:\n");
462 printf("b = %f | c = %f | s = %f\n",my_info.b,my_info.c,my_info.s);
463 printf("diff every %d steps | diff rate = %f\n",my_info.diff_rate,
465 printf("current step: %d | total steps: %d\n",c_step,my_info.steps);
468 /* care for signals */
470 signal(SIGTERM,send_data);
473 if(!strcmp(r_file,"")) rand_init(NULL);
474 else rand_init(r_file);
476 /* compute graphs for random number rejection method */
477 if((c_profile=(u32 *)malloc(d3_l.max_z*sizeof(unsigned int)))==NULL) {
478 puts("failed allocating memory for carbon profile graph");
481 if((n_e_loss=(u32 *)malloc(d3_l.max_z*sizeof(unsigned int)))==NULL) {
482 puts("failed allocating memory for nuclear energy loss graph");
485 ip_max=get_reject_graph(&my_info,&d3_l,p_file,c_profile);
486 ne_max=get_reject_graph(&my_info,&d3_l,n_e_file,n_e_loss);
488 /* array nel_z[] keeping nuclear energy loss values scaled to URAND_MAX */
489 nel_z=(u32 *)malloc(d3_l.max_z*sizeof(unsigned int));
491 printf("failed allocating nel_z array mem\n");
494 for(i=0;i<d3_l.max_z;i++) nel_z[i]=URAND_MAX*(1.0*n_e_loss[i]/ne_max);
496 /* this should be obsolete - z is high enough - we check now! */
497 if(c_profile[d3_l.max_z-1]!=0) {
498 printf("max_z (%d) too small - sputtering not possible\n",d3_l.max_z);
502 /* sputtering really possible ?*/
503 if(n_e_loss[d3_l.max_z-1]!=0)
504 printf("warning: max_z (%d) too small, there may be amorphous volumes\n",
508 * start of simulation
512 while(i<my_info.steps) {
513 for(j=0;j<my_info.cpi;j++) {
514 x_c=get_rand(d3_l.max_x);
515 y_c=get_rand(d3_l.max_y);
516 // z_c=get_rand_reject(d3_l.max_z,ne_max,n_e_loss);
517 z_c=get_rand(d3_l.max_z);
518 process_cell(&d3_l,x_c,y_c,z_c,&my_info,nel_z[z_c]);
520 distrib_c(&d3_l,&my_info,i,ip_max,c_profile);
522 if(i%my_info.save_rate==0) {
527 if(i%my_info.s_rate==0) sputter(&d3_l);
535 /* shutdown/free/close everything now ... */