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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
|
/*
* Copyright 1998-1999, University of Notre Dame.
* Authors: Brian W. Barrett, Arun F. Rodrigues, Jeffrey M. Squyres,
* and Andrew Lumsdaine
*
* This file is part of XMPI
*
* You should have received a copy of the License Agreement for XMPI
* along with the software; see the file LICENSE. If not, contact
* Office of Research, University of Notre Dame, Notre Dame, IN 46556.
*
* Permission to modify the code and to distribute modified code is
* granted, provided the text of this NOTICE is retained, a notice that
* the code was modified is included with the above COPYRIGHT NOTICE and
* with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
* file is distributed with the modified code.
*
* LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
* By way of example, but not limitation, Licensor MAKES NO
* REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
* PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
* OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
* OR OTHER RIGHTS.
*
* Additional copyrights may follow.
*
* $Id: xmpi_sys_snapshot.lam.c,v 1.3 1999/11/08 06:20:38 bbarrett Exp $
*
* Function: - get LAM state info. for all MPI processes
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <app_mgmt.h>
#include <blktype.h>
#include <bfreq.h>
#include <events.h>
#include <mpisys.h>
#include <net.h>
#include <portable.h>
#include <preq.h>
#include <terror.h>
#include <typical.h>
#include <t_types.h>
#include "../xmpi.h"
/*
* global functions
*/
int xmpi_sys_snapshot();
/*
* external functions
*/
extern void lam_unsyncsql();
extern int lam_coll2pt();
/*
* local functions
*/
static void getstateinfo();
static void getmesginfo();
static int addmesg();
static int settables();
static void setprocinfo();
static void unpack_fyi();
/*
* local macros and defines
*/
#define global_rank(p) ((p) >> 16)
#define local_rank(p) ((p) & 0xffff)
/*
* local variables
*/
static int nentries = 0; /* # table entries */
static int bfsize = 0; /* size of msg table */
static int bfsmax = XMPI_VWBFSMAX; /* max size of msg table */
static struct pstate *proctbl = 0; /* process state table */
static struct bfstatus *msgtbl = 0; /* message state table */
static char buf[128]; /* formatting buffer */
/*
* xmpi_sys_snapshot
*
* Function: - gets state information on processes
* - abort if LAM error
* Accepts: - GPS array
* - # of processes
* - XMPI process array
*/
int
xmpi_sys_snapshot(app, app_n, procs)
struct _gps * app;
int app_n;
struct xmproc *procs;
{
int i; /* favourite index */
struct xmproc *p; /* favourite pointer */
xmpi_busy();
/*
* Set the process and message tables.
*/
if (settables(app_n)) xmpi_fail("xmpi (xmpi_sys_snap)");
/*
* Reset the processes state
*/
for (i = 0, p = procs; i < app_n; ++i, ++p)
p->xmp_state = XMPI_SUNDEF;
/*
* Loop over the processes skipping the initialized ones.
*/
for (i = 0, p = procs; i < app_n; ++i, ++p) {
if (p->xmp_state == XMPI_SUNDEF) {
sprintf(buf, "Probing node n%d", app[i].gps_node);
xmpi_ctl_setinfo(buf);
/*
* Get LAM state information for the node of the current process.
*/
getstateinfo(app, app_n, procs, i);
/*
* Get message information for all processes on that node.
*/
getmesginfo(app, app_n, procs, i);
}
}
xmpi_ctl_resetinfo();
xmpi_unbusy();
return(0);
}
/*
* getstateinfo
*
* Function: - get process state info for a node
* - abort if LAM error
* Accepts: - GPS array
* - # processes
* - XMPI process array
* - process index (global rank)
*/
static void
getstateinfo(app, app_n, parray, index)
struct _gps * app;
int app_n;
struct xmproc * parray;
int index;
{
int np; /* # processes on node */
int i,j; /* favourite indices */
struct pstate * pstat; /* pointer to state table */
struct _gps * pproc; /* process pointer */
struct _gps * p; /* favourite pointer */
/*
* Get LAM information.
*/
pproc = app + index;
np = rpstate(pproc->gps_node, SELECT_MPI,
INT4_NIL, proctbl, (int4) nentries);
if (np < 0) xmpi_fail("xmpi (getstateinfo)");
/*
* Loop over remaining MPI processes skipping those on a different node.
*/
for (i = index, p = pproc; i < app_n; ++i, ++p) {
if (p->gps_node != pproc->gps_node) continue;
/*
* Find the process in the tables.
*/
for (j = 0, pstat = proctbl; j < np; ++j, ++pstat) {
/*
* Fill the proces state information.
*/
if (pstat->ps_pid == p->gps_pid) {
setprocinfo(parray + i, pstat);
break;
}
}
}
}
/*
* getmesginfo
*
* Function: - get message info for a node
* - abort if LAM error
* Accepts: - GPS array
* - # processes
* - XMPI process array
* - process index
*/
static void
getmesginfo(app, app_n, parray, index)
struct _gps * app;
int app_n;
struct xmproc *parray;
int index;
{
struct xmproc *pproc; /* process pointer */
struct xmproc *p; /* favourite pointer */
int i, j; /* favourite indices */
int size; /* # of return blocks */
int limit; /* # of blocks to print */
int tag; /* message tag */
int cid; /* message cid */
int ignore; /* ignored return parameter */
struct bfstatus *bp; /* buffered message */
struct bfparms parms; /* buffer parameters */
struct _fyimsg *fyi; /* message FYI */
/*
* Get message information.
*/
pproc = parray + index;
size = rbfstate(app[index].gps_node, msgtbl, bfsmax, &parms);
if (size < 0) xmpi_fail("xmpi (getmesginfo)");
limit = (size < bfsmax) ? size : bfsmax;
/*
* Loop over remaining MPI processes skipping those on a different node.
*/
for (i = index, p = pproc; i < app_n; ++i, ++p) {
if (app[i].gps_node != app[index].gps_node) continue;
/*
* Delete all previous messages.
*/
if (p->xmp_msgs) {
al_free(p->xmp_msgs);
p->xmp_msgs = 0;
p->xmp_nmsg = 0;
p->xmp_curmsg = 0;
}
p->xmp_more = 0;
/*
* Collect all messages for that process.
*/
for (j = 0, bp = msgtbl; j < limit; ++j, ++bp) {
if ((bp->bfs_flags & KSYNCSQL)
&& !(bp->bfs_flags & N2ND)
&& !(bp->bfs_event & 0x10000)) {
fyi = (struct _fyimsg *) &bp->bfs_data[4];
if (global_rank(fyi->fym_dest) != i) continue;
lam_unsyncsql(bp->bfs_event, bp->bfs_type, &tag,
&cid, &ignore, &ignore, &ignore, &ignore);
/*
* Skip collective call messages and GER messages.
*/
if ((cid < 0) || (tag == MPI_GER_TAG)) continue;
if (addmesg(p, j)) xmpi_fail("xmpi (getmesginfo)");
}
}
/*
* Add "more messages" entry if needed.
*/
if (size > bfsmax) {
if (addmesg(p, -1)) xmpi_fail("xmpi (getmesginfo)");
p->xmp_more = 1;
}
/*
* Reset the message pointer.
*/
if (p->xmp_msgs) p->xmp_curmsg = al_top(p->xmp_msgs);
}
}
/*
* addmesg
*
* Function: - add message to process entry
* Accepts: - ptr to process
* - message index (or -1 for "more messages")
* - message length
* Returns: - 0 or LAMERROR
*/
static int
addmesg(pproc, msgidx)
struct xmproc *pproc;
int msgidx;
{
struct xmmsg newelem; /* new list element */
struct xmmsg *p; /* favourite pointer */
struct bfstatus *pmsg; /* ptr to message entry */
int cid; /* context ID */
int tag; /* tag */
int lsrc; /* local source rank */
int gsrc; /* global source rank */
int dtype; /* datatype */
int ack; /* message ack field */
int dest_idx; /* destination index */
int src_node; /* source node */
int src_idx; /* source process index */
struct _fyimsg *fyi; /* message FYI */
/*
* Create the message list if needed.
*/
if (pproc->xmp_msgs == 0) {
pproc->xmp_msgs = al_init((int4) sizeof(struct xmmsg), 0);
if (pproc->xmp_msgs == 0) return(LAMERROR);
}
/*
* Locate a previous message of the same type.
* If found, increment its count.
*/
if (msgidx >= 0) {
pmsg = msgtbl + msgidx;
fyi = (struct _fyimsg *) &pmsg->bfs_data[4];
lam_unsyncsql(pmsg->bfs_event, pmsg->bfs_type,
&tag, &cid, &ack, &dest_idx, &src_node, &src_idx);
cid = lam_coll2pt(cid);
gsrc = global_rank(fyi->fym_src);
lsrc = local_rank(fyi->fym_src);
dtype = fyi->fym_dtpid >> 16;
p = al_top(pproc->xmp_msgs);
while (p) {
if ((p->xmm_cid == cid) && (p->xmm_tag == tag)
&& (p->xmm_gsrc == gsrc)
&& (p->xmm_cnt == fyi->fym_count)
&& (p->xmm_dtype == dtype)) {
++(p->xmm_nmsg);
++(pproc->xmp_nmsg);
return(0);
}
p = al_next(pproc->xmp_msgs, p);
}
}
/*
* No previous message found (or it's "more messages"), add a new entry.
*/
if (msgidx < 0) {
newelem.xmm_nmsg = -1;
} else {
++(pproc->xmp_nmsg);
newelem.xmm_nmsg = 1;
newelem.xmm_cid = cid;
newelem.xmm_tag = tag;
newelem.xmm_gsrc = gsrc;
newelem.xmm_lsrc = lsrc;
newelem.xmm_cnt = fyi->fym_count;
newelem.xmm_dtype = dtype;
}
if (al_append(pproc->xmp_msgs, (char *) &newelem) == 0)
return(LAMERROR);
return(0);
}
/*
* settables
*
* Function: - allocate/expand process & message tables
* Accepts: - # of processes
* Returns: - 0 or LAMERROR
*/
static int
settables(nprocs)
int nprocs;
{
/*
* Handle the process tables.
*/
if (proctbl == 0) {
proctbl = (struct pstate *)
malloc((unsigned) nprocs * sizeof(struct pstate));
if (proctbl == 0) return(LAMERROR);
}
else if (nprocs > nentries) {
proctbl = (struct pstate *) realloc((char *) proctbl,
(unsigned) nprocs * sizeof(struct pstate));
if (proctbl == 0) return(LAMERROR);
}
nentries = nprocs;
/*
* Handle the message table.
*/
if (msgtbl == 0) {
bfsize = bfsmax;
msgtbl = (struct bfstatus *)
malloc((unsigned) bfsize * sizeof(struct bfstatus));
if (msgtbl == 0) return(LAMERROR);
}
else if (bfsmax > bfsize) {
bfsize = bfsmax;
msgtbl = (struct bfstatus *) realloc((char *) msgtbl,
(unsigned) bfsize * sizeof(struct bfstatus));
if (msgtbl == 0) return(LAMERROR);
}
return(0);
}
/*
* setprocinfo
*
* Function: - fill a processes entry from its state
* Accepts: - ptr to process
* - ptr to process state
*/
static void
setprocinfo(pproc, pstate)
struct xmproc *pproc;
struct pstate *pstate;
{
struct _fyiproc *fyi; /* ptr process FYI */
int psglobal; /* process global rank */
int peernode; /* peer node */
int peeridx; /* peer process index */
int rootnode; /* root node */
int rootidx; /* root process index */
pproc->xmp_state = ((pstate->ps_kernel.ks_state == 0)
|| (pstate->ps_kernel.ks_state == 3))
? XMPI_SRUN : XMPI_SBLOCK;
fyi = (struct _fyiproc *) pstate->ps_kernel.ks_fyi;
mttoli4((int4 *) fyi, sizeof(struct _fyiproc) / sizeof(int4));
unpack_fyi(fyi, &psglobal, &pproc->xmp_lrank, &peernode, &peeridx,
&pproc->xmp_gpeer, &pproc->xmp_lpeer,
&rootnode, &rootidx, &pproc->xmp_groot, &pproc->xmp_lroot,
&pproc->xmp_cid, &pproc->xmp_tag);
pproc->xmp_func = fyi->fyp_func;
pproc->xmp_wfunc = 0;
pproc->xmp_cnt = fyi->fyp_count;
pproc->xmp_dtype = fyi->fyp_dtype;
}
/*
* unpack_fyi
*
* Function: - unpack process FYI into constituent elements
* Accepts: - ptr process FYI
* - ptrs to locations to unpack fyi into
*/
static void
unpack_fyi(fyi, psglobal, pslocal, peernode, peeridx, peerglobal, peerlocal,
rootnode, rootidx, rootglobal, rootlocal, cid, tag)
struct _fyiproc *fyi;
int *psglobal;
int *pslocal;
int *peernode;
int *peeridx;
int *peerglobal;
int *peerlocal;
int *rootnode;
int *rootidx;
int *rootglobal;
int *rootlocal;
int *tag;
int *cid;
{
*psglobal = fyi->fyp_me >> 16;
*pslocal = fyi->fyp_me & 0xFFFF;
*peernode = fyi->fyp_peergps >> 16;
*peeridx = fyi->fyp_peergps & 0xFFFF;
*peerglobal = fyi->fyp_peer >> 16;
*peerlocal = fyi->fyp_peer & 0xFFFF;
*rootnode = fyi->fyp_rootgps >> 16;
*rootidx = fyi->fyp_rootgps & 0xFFFF;
*rootglobal = fyi->fyp_root >> 16;
*rootlocal = fyi->fyp_root & 0xFFFF;
*cid = fyi->fyp_cidtag >> 16;
*tag = fyi->fyp_cidtag & 0xFFFF;
/*
* Sign extend.
*/
if (*cid & 0x8000) *cid |= 0xFFFF0000;
if (*tag & 0x8000) *tag |= 0xFFFF0000;
if (*peerglobal & 0x8000) *peerglobal |= 0xFFFF0000;
if (*peerlocal & 0x8000) *peerlocal |= 0xFFFF0000;
}
|