Home | History | Annotate | Download | only in lpsched
      1     0  stevel /*
      2     0  stevel  * CDDL HEADER START
      3     0  stevel  *
      4     0  stevel  * The contents of this file are subject to the terms of the
      5  3125  jacobs  * Common Development and Distribution License (the "License").
      6  3125  jacobs  * You may not use this file except in compliance with the License.
      7     0  stevel  *
      8     0  stevel  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
      9     0  stevel  * or http://www.opensolaris.org/os/licensing.
     10     0  stevel  * See the License for the specific language governing permissions
     11     0  stevel  * and limitations under the License.
     12     0  stevel  *
     13     0  stevel  * When distributing Covered Code, include this CDDL HEADER in each
     14     0  stevel  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
     15     0  stevel  * If applicable, add the following below this CDDL HEADER, with the
     16     0  stevel  * fields enclosed by brackets "[]" replaced with your own identifying
     17     0  stevel  * information: Portions Copyright [yyyy] [name of copyright owner]
     18     0  stevel  *
     19     0  stevel  * CDDL HEADER END
     20     0  stevel  */
     21  3125  jacobs 
     22     0  stevel /*
     23  3125  jacobs  * Copyright 2006 Sun Microsystems, Inc.  All rights reserved.
     24     0  stevel  * Use is subject to license terms.
     25     0  stevel  */
     26     0  stevel 
     27     0  stevel /*	Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T	*/
     28     0  stevel /*	  All Rights Reserved  	*/
     29     0  stevel 
     30     0  stevel 
     31  3125  jacobs #pragma ident	"%Z%%M%	%I%	%E% SMI"
     32     0  stevel 
     33     0  stevel #include "lpsched.h"
     34     0  stevel 
     35     0  stevel 
     36     0  stevel /**
     37     0  stevel  ** insertr()
     38     0  stevel  **/
     39     0  stevel 
     40     0  stevel void
     41     0  stevel insertr(RSTATUS *r)
     42     0  stevel {
     43     0  stevel 	RSTATUS			*prs;
     44     0  stevel 
     45     0  stevel 
     46     0  stevel 	if (!Request_List) {
     47     0  stevel 		Request_List = r;
     48     0  stevel 		return;
     49     0  stevel 	}
     50     0  stevel 
     51     0  stevel 	for (prs = Request_List; prs; prs = prs->next) {
     52     0  stevel 		if (rsort(&r, &prs) < 0) {
     53     0  stevel 			r->prev = prs->prev;
     54     0  stevel 			if (r->prev)
     55     0  stevel 				r->prev->next = r;
     56     0  stevel 			r->next = prs;
     57     0  stevel 			prs->prev = r;
     58     0  stevel 			if (prs == Request_List)
     59     0  stevel 				Request_List = r;
     60     0  stevel 			return;
     61     0  stevel 		}
     62     0  stevel 
     63     0  stevel 		if (prs->next)
     64     0  stevel 			continue;
     65     0  stevel 
     66     0  stevel 		r->prev = prs;
     67     0  stevel 		prs->next = r;
     68     0  stevel 		return;
     69     0  stevel 	}
     70     0  stevel }
     71     0  stevel 
     72     0  stevel /**
     73     0  stevel  ** remover()
     74     0  stevel  **/
     75     0  stevel 
     76     0  stevel void
     77     0  stevel remover(RSTATUS *r)
     78     0  stevel {
     79     0  stevel 	if (r == Request_List)		/* on the request chain */
     80     0  stevel 		Request_List = r->next;
     81     0  stevel 
     82     0  stevel 	if (r->next)
     83     0  stevel 		r->next->prev = r->prev;
     84     0  stevel 
     85     0  stevel 	if (r->prev)
     86     0  stevel 		r->prev->next = r->next;
     87     0  stevel 
     88     0  stevel 	r->next = 0;
     89     0  stevel 	r->prev = 0;
     90     0  stevel 	return;
     91     0  stevel }
     92     0  stevel 
     93     0  stevel /**
     94     0  stevel  ** request_by_id()
     95     0  stevel  **/
     96     0  stevel 
     97     0  stevel RSTATUS *
     98     0  stevel request_by_id(char *id)
     99     0  stevel {
    100     0  stevel 	register RSTATUS	*prs;
    101     0  stevel 
    102     0  stevel 	for (prs = Request_List; prs; prs = prs->next)
    103     0  stevel 		if (STREQU(id, prs->secure->req_id))
    104     0  stevel 			return (prs);
    105     0  stevel 	return (0);
    106     0  stevel }
    107     0  stevel 
    108     0  stevel RSTATUS *
    109     0  stevel request_by_id_num( long num )
    110     0  stevel {
    111     0  stevel 	register RSTATUS        *prs;
    112     0  stevel 
    113  3125  jacobs 	for (prs = Request_List; prs; prs = prs->next) {
    114  3125  jacobs 		char *tmp = strrchr(prs->secure->req_id, '-');
    115     0  stevel 
    116  3125  jacobs 		if (tmp && (num == atol(++tmp)))
    117  3125  jacobs 			return (prs);
    118  3125  jacobs 	}
    119     0  stevel 	return(0);
    120     0  stevel }
    121     0  stevel 
    122     0  stevel 
    123     0  stevel /**
    124     0  stevel  ** rsort()
    125     0  stevel  **/
    126     0  stevel 
    127     0  stevel static int		later ( RSTATUS * , RSTATUS * );
    128     0  stevel 
    129     0  stevel int
    130     0  stevel rsort (RSTATUS **p1, RSTATUS **p2)
    131     0  stevel {
    132     0  stevel 	/*
    133     0  stevel 	 * Of two requests needing immediate handling, the first
    134     0  stevel 	 * will be the request with the LATER date. In case of a tie,
    135     0  stevel 	 * the first is the one with the larger request ID (i.e. the
    136     0  stevel 	 * one that came in last).
    137     0  stevel 	 */
    138     0  stevel 	if ((*p1)->request->outcome & RS_IMMEDIATE)
    139     0  stevel 		if ((*p2)->request->outcome & RS_IMMEDIATE)
    140     0  stevel 			if (later(*p1, *p2))
    141     0  stevel 				return (-1);
    142     0  stevel 			else
    143     0  stevel 				return (1);
    144     0  stevel 		else
    145     0  stevel 			return (-1);
    146     0  stevel 
    147     0  stevel 	else if ((*p2)->request->outcome & RS_IMMEDIATE)
    148     0  stevel 		return (1);
    149     0  stevel 
    150     0  stevel 	/*
    151     0  stevel 	 * Of two requests not needing immediate handling, the first
    152     0  stevel 	 * will be the request with the highest priority. If both have
    153     0  stevel 	 * the same priority, the first is the one with the EARLIER date.
    154     0  stevel 	 * In case of a tie, the first is the one with the smaller ID
    155     0  stevel 	 * (i.e. the one that came in first).
    156     0  stevel 	 */
    157     0  stevel 	else if ((*p1)->request->priority == (*p2)->request->priority)
    158     0  stevel 		if (!later(*p1, *p2))
    159     0  stevel 			return (-1);
    160     0  stevel 		else
    161     0  stevel 			return (1);
    162     0  stevel 
    163     0  stevel 	else
    164     0  stevel 		return ((*p1)->request->priority - (*p2)->request->priority);
    165     0  stevel 	/*NOTREACHED*/
    166     0  stevel }
    167     0  stevel 
    168     0  stevel static int
    169     0  stevel later(RSTATUS *prs1, RSTATUS *prs2)
    170     0  stevel {
    171     0  stevel 	if (prs1->secure->date > prs2->secure->date)
    172     0  stevel 		return (1);
    173     0  stevel 
    174     0  stevel 	else if (prs1->secure->date < prs2->secure->date)
    175     0  stevel 		return (0);
    176     0  stevel 
    177     0  stevel 	/*
    178     0  stevel 	 * The dates are the same, so compare the request IDs.
    179     0  stevel 	 * One problem with comparing request IDs is that the order
    180     0  stevel 	 * of two IDs may be reversed if the IDs wrapped around. This
    181     0  stevel 	 * is a very unlikely problem, because the cycle should take
    182     0  stevel 	 * more than one second to wrap!
    183     0  stevel 	 */
    184     0  stevel 	else {
    185     0  stevel 		register int		len1 = strlen(prs1->req_file),
    186     0  stevel 					len2 = strlen(prs2->req_file);
    187     0  stevel 
    188     0  stevel 		/*
    189     0  stevel 		 * Use the request file name (ID-0) for comparison,
    190     0  stevel 		 * because the real request ID (DEST-ID) won't compare
    191     0  stevel 		 * properly because of the destination prefix.
    192     0  stevel 		 * The strlen() comparison is necessary, otherwise
    193     0  stevel 		 * IDs like "99-0" and "100-0" will compare wrong.
    194     0  stevel 		 */
    195     0  stevel 		if (len1 > len2)
    196     0  stevel 			return (1);
    197     0  stevel 		else if (len1 < len2)
    198     0  stevel 			return (0);
    199     0  stevel 		else
    200     0  stevel 			return (strcmp(prs1->req_file, prs2->req_file) > 0);
    201     0  stevel 	}
    202     0  stevel 	/*NOTREACHED*/
    203     0  stevel }
    204