1 | #! perl # MANDATORY |
1 | #! perl # mandatory |
2 | |
2 | |
3 | # this extension swaps out maps and resets them, in essence managing |
3 | # this extension swaps out maps and resets them, in essence managing |
4 | # the reset/swap policy of the server. |
4 | # the reset/swap policy of the server. |
5 | # it also contains the map prefetching logic |
5 | # it also contains the map prefetching logic |
6 | |
6 | |
7 | #our $DEACTIVATE_TIMEOUT = 20; # number of seconds after which maps get deactivated to save cpu |
7 | #our $DEACTIVATE_TIMEOUT = 20; # number of seconds after which maps get deactivated to save cpu |
8 | our $SWAP_TIMEOUT = $cf::CFG{swap_timeout} || 300; # number of seconds after which inactive maps get swapped out |
8 | our $SWAP_TIMEOUT = $cf::CFG{swap_timeout} || 300; # number of seconds after which inactive maps get swapped out |
9 | our $SCHEDULE_INTERVAL = $cf::CFG{schedule_interval} || .8; # time the map scheduler sleeps between runs |
9 | our $SCHEDULE_INTERVAL = $cf::CFG{schedule_interval} || 5; # time the map scheduler sleeps between runs |
10 | our $SAVE_TIMEOUT = $cf::CFG{save_timeout} || 30; # save maps every n seconds |
10 | our $SAVE_TIMEOUT = $cf::CFG{save_timeout} || 30; # save maps every n seconds |
11 | our $SWAP_LOAD1 = $cf::CFG{swap_load1} || .1; # start aggressively swapping at this load |
11 | our $SWAP_LOAD1 = $cf::CFG{swap_load1} || .1; # start aggressively swapping at this load |
12 | our $SWAP_LOAD2 = $cf::CFG{swap_load2} || .4; # swap as fast as possible at this load |
12 | our $SWAP_LOAD2 = $cf::CFG{swap_load2} || .6; # swap as fast as possible at this load |
13 | |
13 | |
14 | cf::async_ext { |
14 | sub reload { |
|
|
15 | local $Coro::current->{desc} = "startup map scanner"; |
15 | $Coro::current->prio (Coro::PRIO_MIN); |
16 | $Coro::current->prio (Coro::PRIO_MIN); |
16 | |
17 | |
17 | # load the header of swapped-out maps. |
18 | # load the header of swapped-out maps. |
18 | # this is not a correctness issue, it simply saves diskspace |
19 | # this is not a correctness issue, it simply saves diskspace |
19 | # because old files will get cleaned up on reset time |
20 | # because old files will get cleaned up on reset time |
20 | Coro::Timer::sleep 0.25; |
|
|
21 | |
21 | |
22 | for my $path (@{ cf::map::tmp_maps or [] }, @{ cf::map::random_maps or [] }) { |
22 | for my $path (@{ cf::map::tmp_maps or [] }, @{ cf::map::random_maps or [] }) { |
23 | cf::map::find $path; |
23 | cf::map::find $path; |
24 | cf::wait_for_tick; Coro::cede; |
|
|
25 | } |
24 | } |
26 | |
25 | |
27 | # now hunt for resettable per-player maps |
26 | # now hunt for resettable per-player maps |
28 | for my $login (@{ cf::player::list_logins or [] }) { |
27 | for my $login (@{ cf::player::list_logins or [] }) { |
29 | for my $path (@{ cf::player::maps $login or [] }) { |
28 | for my $path (@{ cf::player::maps $login or [] }) { |
30 | Coro::cede; |
|
|
31 | |
|
|
32 | $path =~ /^~[^\/]+(\/.*)$/ |
29 | $path =~ /^~[^\/]+(\/.*)$/ |
33 | or next; # doh |
30 | or next; # doh |
34 | |
31 | |
35 | my $base = cf::map::find $1; |
32 | my $base = cf::map::find $1; |
36 | |
33 | |
… | |
… | |
40 | |
37 | |
41 | # skip unresettable maps, for speed |
38 | # skip unresettable maps, for speed |
42 | next if $base->{deny_reset}; |
39 | next if $base->{deny_reset}; |
43 | |
40 | |
44 | my $map = cf::map::find $path; |
41 | my $map = cf::map::find $path; |
45 | cf::wait_for_tick; |
|
|
46 | |
42 | |
47 | if ($map->{deny_reset}) { |
43 | if ($map->{deny_reset}) { |
48 | warn "found noreset map with resettable base map, resetting: $path\n"; |
44 | warn "found noreset map with resettable base map, resetting: $path\n"; |
49 | delete $map->{deny_reset}; |
45 | delete $map->{deny_reset}; |
50 | } |
46 | } |
51 | } |
47 | } |
52 | } |
48 | } |
53 | }; |
49 | } |
54 | |
50 | |
55 | our $SCHEDULER = cf::async_ext { |
51 | cf::post_init { |
56 | while () { |
52 | cf::async { reload }; |
57 | Coro::Event::do_timer (after => $SCHEDULE_INTERVAL) |
|
|
58 | unless $cf::LOADAVG > $SWAP_LOAD2; |
|
|
59 | |
53 | |
60 | # this weird form of iteration over values is used because |
54 | our $SCHEDULER = cf::async_ext { |
61 | # the hash changes underneath us frequently, and for |
55 | $Coro::current->{desc} = "map scheduler"; |
62 | # keeps a direct reference to the value without (in 5.8 perls) |
56 | $Coro::current->prio (Coro::PRIO_MAX); |
63 | # keeping a reference, so this is prone to crashes or worse. |
|
|
64 | my @maps = keys %cf::MAP; |
|
|
65 | for (@maps) { |
|
|
66 | my $map = $cf::MAP{$_} |
|
|
67 | or next; |
|
|
68 | $map->valid or next; |
|
|
69 | |
57 | |
|
|
58 | while () { |
|
|
59 | if ($cf::LOADAVG > $SWAP_LOAD2) { |
|
|
60 | cf::wait_for_tick; |
|
|
61 | } else { |
|
|
62 | Coro::EV::timer_once $SCHEDULE_INTERVAL; |
|
|
63 | } |
|
|
64 | |
|
|
65 | # this weird form of iteration over values is used because |
|
|
66 | # the hash changes underneath us frequently, and 'for' |
|
|
67 | # keeps a direct reference to the value without (in 5.8 perls) |
|
|
68 | # keeping a reference, so this is prone to crashes or worse. |
|
|
69 | my @maps = keys %cf::MAP; |
|
|
70 | for (@maps) { |
|
|
71 | my $map = $cf::MAP{$_} |
|
|
72 | or next; |
|
|
73 | $map->valid or next; |
|
|
74 | |
70 | eval { |
75 | eval { |
71 | # not yet, because maps might become visible to players nearby |
76 | # not yet, because maps might become visible to players nearby |
72 | # we need to remove the map from %cf::MAP and all tiled map links |
77 | # we need to remove the map from %cf::MAP and all tiled map links |
73 | # if ($last_access + $DEACTIVATE_TIMEOUT <= $cf::RUNTIME) { |
78 | # if ($last_access + $DEACTIVATE_TIMEOUT <= $cf::RUNTIME) { |
74 | # $map->deactivate; |
79 | # $map->deactivate; |
75 | # delete $map->{active}; |
80 | # delete $map->{active}; |
76 | # } |
81 | # } |
77 | if ($map->should_reset) { |
82 | if ($map->should_reset) { |
78 | $map->reset; |
83 | $map->reset; |
79 | } elsif ($map->in_memory == cf::MAP_IN_MEMORY) { |
84 | } elsif ($map->linkable) { |
80 | my $max_idle = cf::clamp +(cf::lerp $cf::LOADAVG, $SWAP_LOAD1, $SWAP_LOAD2, $SWAP_TIMEOUT, 0), 0, $SWAP_TIMEOUT; |
85 | my $max_idle = cf::clamp +(cf::lerp $cf::LOADAVG, $SWAP_LOAD1, $SWAP_LOAD2, $SWAP_TIMEOUT, $cf::TICK * 1.5), |
|
|
86 | $cf::TICK * 1.5, $SWAP_TIMEOUT; |
81 | |
87 | |
82 | if ($map->last_access + $max_idle <= $cf::RUNTIME && !$map->players) { |
88 | if ($map->last_access + $max_idle <= $cf::RUNTIME && !$map->players) { |
83 | $map->swap_out; |
89 | $map->swap_out; |
84 | cf::wait_for_tick unless $cf::LOADAVG > $SWAP_LOAD2; |
|
|
85 | } elsif ($map->{last_save} + $SAVE_TIMEOUT <= $cf::RUNTIME) { |
90 | } elsif ($map->{last_save} + $SAVE_TIMEOUT <= $cf::RUNTIME) { |
86 | $map->save; |
91 | $map->save; |
87 | cf::wait_for_tick unless $cf::LOADAVG > $SWAP_LOAD2; |
92 | $map->{last_save} -= cf::rndm; # randomise map save times a bit |
|
|
93 | } |
88 | } |
94 | } |
89 | } |
95 | }; |
|
|
96 | warn $@ if $@; |
|
|
97 | cf::cede_to_tick; |
90 | }; |
98 | }; |
91 | warn $@ if $@; |
|
|
92 | cf::cede_to_tick; |
|
|
93 | }; |
99 | } |
94 | } |
100 | }; |
|
|
101 | |
|
|
102 | $SCHEDULER->prio (-2); |
95 | }; |
103 | }; |
96 | |
104 | |
97 | $SCHEDULER->prio (-2); |
105 | # purely for debugging, will load ALL maps |
|
|
106 | sub loadall { |
|
|
107 | my $maps = cf::map::static_maps; |
98 | |
108 | |
|
|
109 | for my $path (@$maps) { |
|
|
110 | my $map = cf::map::find $path |
|
|
111 | or warn "ERROR: unable to find map $path\n"; |
|
|
112 | $map->load; |
|
|
113 | } |
|
|
114 | } |
|
|
115 | |