mirror of
https://github.com/troglobit/finit.git
synced 2026-10-22 11:36:07 +00:00
libink/dbus: identify the caller behind a broker
On the local bus SO_PEERCRED says who is calling and the kernel is the one saying it. Behind a broker one connection carries every caller, so that credential describes dbus-daemon and nothing else, and every privileged method was refused there, root included. Ask the bus driver instead. libink parks the call and hands us the sender; we ask GetConnectionUnixUser and answer when the reply lands, through the same event loop as everything else. Nothing blocks: blocking in PID 1 is why libuEv exists. That needs calls libink can make on a connection it already has, so it gained those too. Answers are cached, since a bus never reuses a unique name while it runs. Not across a restart though: a new dbus-daemon numbers from scratch and :1.7 becomes somebody else, so the cache goes when the broker does. A sender name too long to key on is refused rather than truncated, two callers sharing a truncated key would share an identity. Privilege is no longer uid 0 alone. The socket is already owned by the --with-group group, so refusing its members every method that changes anything left a wheel user able to open the bus and unable to reboot. Both gates now say the same thing. Group membership needs NSS, which the C library loads with dlopen(), so the lookup is compiled out where Finit is built to link statically. That leaves such a build root-only, which is worth saying out loud rather than leaving to be discovered. Signed-off-by: Joachim Wiberg <troglobit@gmail.com>
This commit is contained in:
1 parent
d710a23513
commit
63aabaa6df
17 files changed
+774
-90
No files matched your search
+233
-16
@@ -260,7 +260,7 @@ int __send_error(link_connection_t *conn, const struct link_msg *req,
|
||||
const char *link_call_path (const link_call_t *c) { return c ? c->incoming.path : NULL; }
|
||||
const char *link_call_interface(const link_call_t *c) { return c ? c->incoming.interface : NULL; }
|
||||
const char *link_call_member (const link_call_t *c) { return c ? c->incoming.member : NULL; }
|
||||
uid_t link_call_uid (const link_call_t *c) { return c ? c->conn->peer_uid : (uid_t)-1; }
|
||||
uid_t link_call_uid (const link_call_t *c) { return c ? c->uid : LINK_UID_UNKNOWN; }
|
||||
|
||||
link_writer_t *link_call_reply(link_call_t *call)
|
||||
{
|
||||
@@ -324,20 +324,213 @@ size_t link_r_pos (const link_reader_t *r) { return r->off;
|
||||
|
||||
/* ---------- dispatch entry point ---------- */
|
||||
|
||||
int __dispatch_message(link_connection_t *conn, const struct link_msg *m)
|
||||
/* ---------- replies to our own outbound calls ---------- */
|
||||
|
||||
/* Hand a reply to whoever issued the matching link_connection_call().
|
||||
* Unmatched replies are dropped: a broker is free to send us things we
|
||||
* never asked for, and that is not a reason to drop the connection. */
|
||||
static void deliver_reply(link_connection_t *conn, const struct link_msg *m)
|
||||
{
|
||||
link_reply_cb_t cb;
|
||||
link_reply_t r;
|
||||
void *userdata;
|
||||
int i;
|
||||
|
||||
for (i = 0; i < LINK_PENDING_CAP; i++) {
|
||||
if (conn->pending[i].used && conn->pending[i].serial == m->reply_serial)
|
||||
break;
|
||||
}
|
||||
if (i == LINK_PENDING_CAP) {
|
||||
return;
|
||||
}
|
||||
|
||||
cb = conn->pending[i].cb;
|
||||
userdata = conn->pending[i].userdata;
|
||||
conn->pending[i].used = 0;
|
||||
|
||||
if (!cb)
|
||||
return;
|
||||
|
||||
__msg_to_reply(&r, m);
|
||||
cb(conn, &r, userdata);
|
||||
}
|
||||
|
||||
/* ---------- calls parked while their caller is identified ---------- */
|
||||
|
||||
/* Every park gets a token that is never issued twice, so a resolver
|
||||
* answering late, twice, or after its connection went away resumes
|
||||
* nothing rather than whatever call has since taken the slot. */
|
||||
static struct link_parked *park(link_connection_t *conn, const uint8_t *frame,
|
||||
size_t len, link_authz_t *tok)
|
||||
{
|
||||
link_server_t *srv = conn->server;
|
||||
int i;
|
||||
|
||||
if (!frame || !len || len > LINK_PARKED_MSG_MAX)
|
||||
return NULL;
|
||||
|
||||
for (i = 0; i < LINK_PARKED_CAP; i++) {
|
||||
if (!srv->parked[i].tok)
|
||||
break;
|
||||
}
|
||||
if (i == LINK_PARKED_CAP)
|
||||
return NULL;
|
||||
|
||||
srv->parked[i].tok = ++srv->next_tok;
|
||||
srv->parked[i].conn = conn;
|
||||
srv->parked[i].len = len;
|
||||
memcpy(srv->parked[i].buf, frame, len);
|
||||
*tok = srv->parked[i].tok;
|
||||
|
||||
return &srv->parked[i];
|
||||
}
|
||||
|
||||
static void unpark(struct link_parked *p)
|
||||
{
|
||||
p->tok = 0;
|
||||
p->conn = NULL;
|
||||
}
|
||||
|
||||
void __dispatch_forget_conn(link_connection_t *conn)
|
||||
{
|
||||
link_server_t *srv = conn->server;
|
||||
int i;
|
||||
|
||||
/* Drop parked calls first. A pending callback below may try to
|
||||
* resolve one, and resuming a dispatch on a connection that is
|
||||
* being torn down is no use to anyone; an invalidated slot makes
|
||||
* that resolve a no-op instead. */
|
||||
if (srv) {
|
||||
for (i = 0; i < LINK_PARKED_CAP; i++) {
|
||||
if (srv->parked[i].conn == conn)
|
||||
unpark(&srv->parked[i]);
|
||||
}
|
||||
}
|
||||
|
||||
for (i = 0; i < LINK_PENDING_CAP; i++) {
|
||||
if (conn->pending[i].used && conn->pending[i].cb)
|
||||
conn->pending[i].cb(conn, NULL, conn->pending[i].userdata);
|
||||
conn->pending[i].used = 0;
|
||||
}
|
||||
}
|
||||
|
||||
static int dispatch_call(link_connection_t *conn, const struct link_msg *m,
|
||||
const uint8_t *frame, size_t framelen,
|
||||
const uid_t *known_uid);
|
||||
|
||||
void link_uid_resolved(link_server_t *server, link_authz_t tok, uid_t uid)
|
||||
{
|
||||
uint8_t buf[LINK_PARKED_MSG_MAX];
|
||||
struct link_parked *p = NULL;
|
||||
link_connection_t *conn;
|
||||
struct link_msg msg;
|
||||
size_t len;
|
||||
int i;
|
||||
|
||||
if (!server || !tok)
|
||||
return;
|
||||
|
||||
for (i = 0; i < LINK_PARKED_CAP; i++) {
|
||||
if (server->parked[i].tok == tok) {
|
||||
p = &server->parked[i];
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!p)
|
||||
return; /* stale handle, already answered */
|
||||
|
||||
/* Copy the message out and free the slot before dispatching:
|
||||
* the handler may park a call of its own. */
|
||||
conn = p->conn;
|
||||
len = p->len;
|
||||
memcpy(buf, p->buf, len);
|
||||
unpark(p);
|
||||
|
||||
if (!conn || __msg_parse(buf, len, &msg) <= 0)
|
||||
return;
|
||||
|
||||
(void)dispatch_call(conn, &msg, NULL, 0, &uid);
|
||||
}
|
||||
|
||||
int __dispatch_message(link_connection_t *conn, const struct link_msg *m, size_t framelen)
|
||||
{
|
||||
if (m->type == LINK_MSG_METHOD_RETURN || m->type == LINK_MSG_ERROR) {
|
||||
deliver_reply(conn, m);
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (m->type != LINK_MSG_METHOD_CALL) {
|
||||
/* Signals from a client to PID 1 are nonsense; drop. */
|
||||
return 0;
|
||||
}
|
||||
|
||||
return dispatch_call(conn, m, conn->rxbuf, framelen, NULL);
|
||||
}
|
||||
|
||||
/* Who may invoke a privileged method. Without an authorizer, only
|
||||
* root, which is what libink can decide on its own. */
|
||||
static int caller_may(link_server_t *srv, uid_t uid)
|
||||
{
|
||||
if (uid == LINK_UID_UNKNOWN)
|
||||
return 0;
|
||||
if (srv && srv->authorizer)
|
||||
return srv->authorizer(uid, srv->authz_userdata);
|
||||
|
||||
return uid == 0;
|
||||
}
|
||||
|
||||
/* Ask who is calling on a broker connection, where the message is the
|
||||
* only evidence. Returns 0 with *uid set, 1 when the call was parked
|
||||
* and will be dispatched again once the resolver answers, -1 when the
|
||||
* caller cannot be identified, and -2 when we have no room to ask. */
|
||||
#define CALLER_UID_BUSY (-2)
|
||||
|
||||
static int resolve_caller(link_connection_t *conn, const struct link_msg *m,
|
||||
const uint8_t *frame, size_t framelen, uid_t *uid)
|
||||
{
|
||||
link_server_t *srv = conn->server;
|
||||
struct link_parked *p;
|
||||
link_authz_t tok;
|
||||
int rc;
|
||||
|
||||
if (!srv || !srv->uid_resolver || !m->sender)
|
||||
return -1;
|
||||
|
||||
/* Enforce the rule link.h states, rather than trusting every
|
||||
* resolver to remember it: a truncated sender key would let two
|
||||
* callers share one identity. */
|
||||
if (strlen(m->sender) >= LINK_SENDER_MAX) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* Park first so the resolver has somewhere to answer, then let
|
||||
* it release the slot immediately if it already knew. */
|
||||
p = park(conn, frame, framelen, &tok);
|
||||
if (!p)
|
||||
return CALLER_UID_BUSY;
|
||||
|
||||
rc = srv->uid_resolver(conn, m->sender, tok, uid, srv->uid_userdata);
|
||||
if (rc != 1)
|
||||
unpark(p);
|
||||
|
||||
return rc;
|
||||
}
|
||||
|
||||
static int dispatch_call(link_connection_t *conn, const struct link_msg *m,
|
||||
const uint8_t *frame, size_t framelen,
|
||||
const uid_t *known_uid)
|
||||
{
|
||||
struct link_object *o;
|
||||
struct link_vtable_entry *e = NULL;
|
||||
const link_method_t *meth;
|
||||
struct link_call call;
|
||||
ssize_t blen;
|
||||
uid_t call_uid;
|
||||
int rc;
|
||||
|
||||
if (m->type != LINK_MSG_METHOD_CALL) {
|
||||
/* Signals and replies from a client to PID 1 are nonsense;
|
||||
* silently drop. */
|
||||
return 0;
|
||||
}
|
||||
/* What a handler sees via link_call_uid(). Unresolved on a broker
|
||||
* connection until a privileged method forces the question. */
|
||||
call_uid = known_uid ? *known_uid : conn->peer_uid;
|
||||
|
||||
if (!m->path || !m->member) {
|
||||
return __send_error(conn, m,
|
||||
@@ -345,6 +538,7 @@ int __dispatch_message(link_connection_t *conn, const struct link_msg *m)
|
||||
"Method call without path or member");
|
||||
}
|
||||
|
||||
|
||||
/* Built-in DBus interfaces (Hello, Ping, Introspect, Properties)
|
||||
* are handled here before object-tree lookup, which means they
|
||||
* also run before the LINK_METHOD_PRIVILEGED authz gate further
|
||||
@@ -374,24 +568,47 @@ int __dispatch_message(link_connection_t *conn, const struct link_msg *m)
|
||||
const char *got = m->signature ? m->signature : "";
|
||||
const char *want = meth->in_sig ? meth->in_sig : "";
|
||||
|
||||
if (strcmp(got, want) != 0)
|
||||
if (strcmp(got, want) != 0) {
|
||||
return __send_error(conn, m,
|
||||
"org.freedesktop.DBus.Error.InvalidArgs",
|
||||
"Argument signature mismatch");
|
||||
}
|
||||
}
|
||||
|
||||
/* Per-method authorization. PRIVILEGED methods require uid 0;
|
||||
* the peer's uid was captured via SO_PEERCRED at accept time
|
||||
* and verified against the AUTH EXTERNAL claim, so we can trust
|
||||
* conn->peer_uid here. */
|
||||
if ((meth->flags & LINK_METHOD_PRIVILEGED) && conn->peer_uid != 0) {
|
||||
return __send_error(conn, m,
|
||||
"org.freedesktop.DBus.Error.AccessDenied",
|
||||
"Method requires root privileges");
|
||||
/* Per-method authorization. PRIVILEGED methods require uid 0.
|
||||
* On an ordinary connection the peer's uid was captured via
|
||||
* SO_PEERCRED at accept time and verified against the AUTH
|
||||
* EXTERNAL claim, so conn->peer_uid is the answer. A broker
|
||||
* connection carries every caller at once, so who is asking has
|
||||
* to be established per message, which may park the call. */
|
||||
if (meth->flags & LINK_METHOD_PRIVILEGED) {
|
||||
if (conn->broker && !known_uid) {
|
||||
rc = resolve_caller(conn, m, frame, framelen, &call_uid);
|
||||
if (rc == 1)
|
||||
return 0; /* parked, resumed later */
|
||||
|
||||
if (rc == CALLER_UID_BUSY) {
|
||||
/* Not a permission problem: root may well
|
||||
* be asking, we just have no slot to find
|
||||
* out in. Say so, it is retryable. */
|
||||
return __send_error(conn, m,
|
||||
"org.freedesktop.DBus.Error.LimitsExceeded",
|
||||
"Too many calls awaiting authorization");
|
||||
}
|
||||
if (rc < 0)
|
||||
call_uid = (uid_t)-1;
|
||||
}
|
||||
|
||||
if (!caller_may(conn->server, call_uid)) {
|
||||
return __send_error(conn, m,
|
||||
"org.freedesktop.DBus.Error.AccessDenied",
|
||||
"Caller is not privileged for this method");
|
||||
}
|
||||
}
|
||||
|
||||
memset(&call, 0, sizeof(call));
|
||||
call.conn = conn;
|
||||
call.uid = call_uid;
|
||||
call.incoming = *m;
|
||||
__r_init(&call.read_cursor, m->body, m->body_avail);
|
||||
|
||||
|
||||
Reference in new issue
Block a user