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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2006 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <procfs.h>
#include <project.h>
#include <stdlib.h>
#include <strings.h>
#include "rcapd.h"
#include "utils.h"
/* absolute cap name */
#define PJ_ABS_ATTR_NAME "rcap.max-rss"
/* round up to next y = 2^n */
#define ROUNDUP(x, y) (((x) + ((y) - 1)) & ~((y) - 1))
static int
lcollection_update_project_cb(const struct project *proj, void *walk_data)
{
void(*update_notification_cb)(char *, char *, int, uint64_t, int) =
(void(*)(char *, char *, int, uint64_t, int))walk_data;
char *capattr_abs;
char *end;
int changes;
int64_t max_rss;
lcollection_t *lcol;
rcid_t colid;
capattr_abs = strstr(proj->pj_attr, PJ_ABS_ATTR_NAME "=");
if (capattr_abs != NULL) {
if (capattr_abs > proj->pj_attr)
if (*(capattr_abs - 1) != ';') {
/*
* PJ_ABS_ATTR_NAME only matched part
* of an attribute.
*/
return (0);
}
capattr_abs += strlen(PJ_ABS_ATTR_NAME "=");
max_rss = ROUNDUP(strtoll(capattr_abs, &end, 10), 1024) / 1024;
if (end == capattr_abs || *end != ';' && *end != 0)
warn(gettext("project %s: malformed %s value '%s'\n"),
proj->pj_name, PJ_ABS_ATTR_NAME, capattr_abs);
} else
max_rss = 0;
colid.rcid_type = RCIDT_PROJECT;
colid.rcid_val = proj->pj_projid;
lcol = lcollection_insert_update(&colid, max_rss, proj->pj_name,
&changes);
if (update_notification_cb != NULL)
update_notification_cb("project", proj->pj_name, changes,
max_rss, (lcol != NULL) ? lcol->lcol_mark : 0);
return (0);
}
static int
lcollection_update_project_byid_cb(const projid_t id, void *walk_data)
{
char buf[PROJECT_BUFSZ];
struct project proj;
if (getprojbyid(id, &proj, buf, sizeof (buf)) != NULL && proj.pj_attr !=
NULL)
return (lcollection_update_project_cb(&proj, walk_data));
return (0);
}
static int
lcollection_update_onceactive_cb(lcollection_t *lcol, void *walk_data)
{
void(*update_notification_cb)(char *, char *, int, uint64_t, int) =
(void(*)(char *, char *, int, uint64_t, int))walk_data;
if (lcol->lcol_id.rcid_type != RCIDT_PROJECT)
return (0);
return (lcollection_update_project_byid_cb(lcol->lcol_id.rcid_val,
(void *)update_notification_cb));
}
static int
project_walk_all(int(*cb)(const struct project *, void *), void *walk_data)
{
char buf[PROJECT_BUFSZ];
struct project proj;
int res = 0;
setprojent();
while (getprojent(&proj, buf, sizeof (buf)) != NULL && res == 0)
res = cb(&proj, walk_data);
endprojent();
return (res);
}
void
lcollection_update_project(lcollection_update_type_t ut,
void(*update_notification_cb)(char *, char *, int, uint64_t, int))
{
switch (ut) {
case LCU_ACTIVE_ONLY:
/*
* Enumerate active projects. This is much faster than
* enumerating all projects (as is done below, in the default
* case), and is done to efficiently and incrementally update
* lcollection with capped projects. The default case performs
* the initialization.
*/
(void) project_walk(lcollection_update_project_byid_cb,
(void *)update_notification_cb);
/*
* Enumerate once-active projects, including the active
* projects just enumerated, meaning active projects will be
* updated and marked twice.
*/
list_walk_collection(lcollection_update_onceactive_cb,
(void *)update_notification_cb);
break;
default:
/*
* Enumerate all projects.
*/
(void) project_walk_all(lcollection_update_project_cb,
(void *)update_notification_cb);
}
}
|
