1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
/*
This file is part of LPIC++, a particle-in-cell code for
simulating the interaction of laser light with plasma.
Copyright (C) 1994-1997 Roland Lichters
LPIC++ is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <stack.h>
//////////////////////////////////////////////////////////////////////////////////////////
stack::stack( parameter &p )
{
sprintf( errname, "%s/error-%d", p.path, p.domain_number );
static error_handler bob("stack::Constructor", errname );
zero = new stack_member;
hole = new stack_member;
zero->next = hole;
}
//////////////////////////////////////////////////////////////////////////////////////////
void stack::put_on_stack( struct cell *new_cell, struct particle *part )
{
static error_handler bob("stack::put_on_stack", errname);
stack_member *new_member;
new_member = new stack_member;
if (!new_member) bob.error( "allocation error" );
new_member->part = part;
new_member->new_cell = new_cell;
new_member->next = zero->next;
zero->next = new_member;
#ifdef DEBUG
if ( (TINY < new_cell->x - part->x) || (part->x - new_cell->next->x > TINY) ) {
bob.message( "particle on stack for wrong cell" );
bob.message( "part->x = ", part->x );
bob.message( "new_cell->x-part->x = ", new_cell->x-part->x );
bob.message( "new_cell->x = ", new_cell->x );
bob.message( "new_cell->next->x = ", new_cell->next->x );
bob.error( "part->x-new_cell->next->x = ", part->x-new_cell->next->x );
}
#endif
if (part->x < new_cell->x) part->x = new_cell->x;
if (part->x > new_cell->next->x) part->x = new_cell->next->x;
}
//////////////////////////////////////////////////////////////////////////////////////////
void stack::remove_from_stack( stack_member *member )
{
zero->next = member->next;
delete member;
}
//////////////////////////////////////////////////////////////////////////////////////////
void stack::insert_particle( struct cell *new_cell, struct particle *part )
{
if (part->prev!=NULL) part->prev->next = part->next; // extract particle from old chain
else part->cell->first = part->next;
if (part->next!=NULL) part->next->prev = part->prev;
else part->cell->last = part->prev;
if (part->cell->insert == part) part->cell->insert = part->next; // new insert mark!!
part->prev = NULL; // insert particle into the new chain
part->next = new_cell->first;
new_cell->first = part;
if (part->next==NULL) new_cell->last = part;
else part->next->prev = part;
part->cell->np[ part->species ] --;
part->cell->npart --;
new_cell->np[ part->species ] ++;
new_cell->npart ++;
part->cell = new_cell;
}
//////////////////////////////////////////////////////////////////////////////////////////
//eof
|
