d1fd04e72a
SYSLIB CHANGES: - SEF framework now supports a new SEF Init request type from RS. 3 different callbacks are available (init_fresh, init_lu, init_restart) to specify initialization code when a service starts fresh, starts after a live update, or restarts. SYSTEM SERVICE CHANGES: - Initialization code for system services is now enclosed in a callback SEF will automatically call at init time. The return code of the callback will tell RS whether the initialization completed successfully. - Each init callback can access information passed by RS to initialize. As of now, each system service has access to the public entries of RS's system process table to gather all the information required to initialize. This design eliminates many existing or potential races at boot time and provides a uniform initialization interface to system services. The same interface will be reused for the upcoming publish/subscribe model to handle dynamic registration / deregistration of system services. VM CHANGES: - Uniform privilege management for all system services. Every service uses the same call mask format. For boot services, VM copies the call mask from init data. For dynamic services, VM still receives the call mask via rs_set_priv call that will be soon replaced by the upcoming publish/subscribe model. RS CHANGES: - The system process table has been reorganized and split into private entries and public entries. Only the latter ones are exposed to system services. - VM call masks are now entirely configured in rs/table.c - RS has now its own slot in the system process table. Only kernel tasks and user processes not included in the boot image are now left out from the system process table. - RS implements the initialization protocol for system services. - For services in the boot image, RS blocks till initialization is complete and panics when failure is reported back. Services are initialized in their order of appearance in the boot image priv table and RS blocks to implements synchronous initialization for every system service having the flag SF_SYNCH_BOOT set. - For services started dynamically, the initialization protocol is implemented as though it were the first ping for the service. In this case, if the system service fails to report back (or reports failure), RS brings the service down rather than trying to restart it.
102 lines
2.9 KiB
C
102 lines
2.9 KiB
C
/* This file contains some utility routines for RS.
|
|
*
|
|
* Changes:
|
|
* Nov 22, 2009: Created (Cristiano Giuffrida)
|
|
*/
|
|
|
|
#include "inc.h"
|
|
|
|
#include <minix/ds.h>
|
|
|
|
/*===========================================================================*
|
|
* init_service *
|
|
*===========================================================================*/
|
|
PUBLIC int init_service(rp, type)
|
|
struct rproc *rp; /* pointer to process slot */
|
|
int type; /* type of initialization */
|
|
{
|
|
int r;
|
|
message m;
|
|
struct rprocpub *rpub;
|
|
|
|
rpub = rp->r_pub;
|
|
|
|
rp->r_flags |= RS_INITIALIZING; /* now initializing */
|
|
rp->r_check_tm = rp->r_alive_tm + 1; /* expect reply within period */
|
|
|
|
m.m_type = RS_INIT;
|
|
m.RS_INIT_TYPE = type;
|
|
m.RS_INIT_RPROCTAB_GID = rinit.rproctab_gid;
|
|
r = asynsend(rpub->endpoint, &m);
|
|
|
|
return r;
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* publish_service *
|
|
*===========================================================================*/
|
|
PUBLIC int publish_service(rp)
|
|
struct rproc *rp; /* pointer to process slot */
|
|
{
|
|
/* A new system service has been started. Publish the necessary information. */
|
|
int s;
|
|
struct rprocpub *rpub;
|
|
|
|
rpub = rp->r_pub;
|
|
|
|
/* Register its label with DS. */
|
|
s= ds_publish_u32(rpub->label, rpub->endpoint);
|
|
if (s != OK) {
|
|
return s;
|
|
}
|
|
if (rs_verbose) {
|
|
printf("RS: publish_service: DS label registration done: %s -> %d\n",
|
|
rpub->label, rpub->endpoint);
|
|
}
|
|
|
|
return(OK);
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* fill_call_mask *
|
|
*===========================================================================*/
|
|
PUBLIC void fill_call_mask(calls, tot_nr_calls, call_mask, call_base, is_init)
|
|
int *calls; /* the unordered set of calls */
|
|
int tot_nr_calls; /* the total number of calls */
|
|
bitchunk_t *call_mask; /* the call mask to fill in */
|
|
int call_base; /* the base offset for the calls */
|
|
int is_init; /* set when initializing a call mask */
|
|
{
|
|
/* Fill a call mask from an unordered set of calls. */
|
|
int i;
|
|
int call_mask_size, nr_calls;
|
|
|
|
call_mask_size = BITMAP_CHUNKS(tot_nr_calls);
|
|
|
|
/* Count the number of calls to fill in. */
|
|
nr_calls = 0;
|
|
for(i=0; calls[i] != SYS_NULL_C; i++) {
|
|
nr_calls++;
|
|
}
|
|
|
|
/* See if all calls are allowed and call mask must be completely filled. */
|
|
if(nr_calls == 1 && calls[0] == SYS_ALL_C) {
|
|
for(i=0; i < call_mask_size; i++) {
|
|
call_mask[i] = (~0);
|
|
}
|
|
}
|
|
else {
|
|
/* When initializing, reset the mask first. */
|
|
if(is_init) {
|
|
for(i=0; i < call_mask_size; i++) {
|
|
call_mask[i] = 0;
|
|
}
|
|
}
|
|
/* Enter calls bit by bit. */
|
|
for(i=0; i < nr_calls; i++) {
|
|
SET_BIT(call_mask, calls[i] - call_base);
|
|
}
|
|
}
|
|
}
|
|
|