blob: 0008e3ddb4b40aa1bb935df87b18ca4c45161190 (
plain)
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
|
/* -*- c-file-style: "java"; indent-tabs-mode: nil; tab-width: 4; fill-column: 78 -*-
*
* distcc -- A simple distributed compiler system
*
* Copyright (C) 2004 by Martin Pool <mbp@samba.org>
*
* This program 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
* USA.
*/
#include <config.h>
#include <stdlib.h>
#include "distcc.h"
#include "mon.h"
#include "trace.h"
/* Number of previous states to retain for drawing history. */
const int dcc_max_history_queue = 200;
void
dcc_history_push(struct dcc_history *history,
enum dcc_phase new_state)
{
history->now = (history->now + 1) % history->len;
history->past_phases[history->now] = new_state;
}
struct dcc_history*
dcc_history_new(void)
{
struct dcc_history *history;
int i;
history = malloc(sizeof *history);
if (!history) {
rs_log_crit("allocation failed!");
return NULL;
}
history->len = dcc_max_history_queue;
history->now = 0;
history->past_phases = malloc(history->len * (sizeof *history->past_phases));
if (!history->past_phases) {
rs_log_crit("history allocation failed");
return NULL;
}
for (i = 0; i < history->len; i++)
history->past_phases[i] = DCC_PHASE_DONE;
return history;
}
|
