/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (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
* 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 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
#pragma ident "%Z%%M% %I% %E% SMI"
#include "uucp.h"
struct m {
} M[UUSTAT_TBL+2];
short Uopt;
int
int argc;
char *argv[];
char **envp;
{
struct m *m, *machine();
int numgrade;
int i, maxnumb;
Uopt = 0;
switch(i){
case 'x':
if (Debug <= 0) {
"WARNING: %s: invalid debug level %s ignored, using level 1\n",
Debug = 1;
}
#ifdef SMALL
"WARNING: uusched built with SMALL flag defined -- no debug info available\n");
#endif /* SMALL */
break;
case 'u':
if (Uopt <= 0) {
"WARNING: %s: invalid debug level %s ignored, using level 1\n",
Uopt = 1;
}
break;
default:
cleanup(1);
}
}
cleanup(1);
}
maxnumb = -1;
} else {
if (maxnumb < 0) {
} else {
if (i >= maxnumb) {
cleanup(0);
}
}
}
/* Note - we can break now, since we
* have found a job grade with at least
* one C. file.
*/
break;
}
}
}
}
}
/* Make sure the overflow entry is null since it may be incorrect */
/* count the number of systems */
}
while (num > 0) {
/*
* create lock file once we have work to do
* (but only if there is a job limit)
*/
if (maxnumb > 0) {
for (i = 0; i < maxnumb; i++) {
break;
}
if (i == maxnumb) {
cleanup(0);
}
}
for (i=0; i<numgrade; i++) {
/* no lock file and status time ok */
break;
}
else {
/* job grade locked - look for the next one */
gradeptr[i]);
}
}
num--;
}
cleanup(0);
/* NOTREACHED */
return (0);
}
struct m *
char *name;
{
struct m *m;
for (m = M; m->mach[0] != '\0'; m++)
/* match on overlap? */
/* check for job grade */
/* use longest name */
return(m);
}
/*
* The table is set up with 2 extra entries
* When we go over by one, output error to errors log
* When more than one over, just reuse the previous entry
*/
if (m-M >= UUSTAT_TBL) {
if (m-M == UUSTAT_TBL) {
}
else
/* use the last entry - overwrite it */
m = &M[UUSTAT_TBL];
}
return(m);
}
void
char *name;
{
int status;
if (Uopt)
if (Uopt)
else
cleanup(100);
}
break;
return;
}
void
int code;
{
}