⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 fairshare.c

📁 openPBS的开放源代码
💻 C
📖 第 1 页 / 共 2 页
字号:
/**         OpenPBS (Portable Batch System) v2.3 Software License* * Copyright (c) 1999-2000 Veridian Information Solutions, Inc.* All rights reserved.* * ---------------------------------------------------------------------------* For a license to use or redistribute the OpenPBS software under conditions* other than those described below, or to purchase support for this software,* please contact Veridian Systems, PBS Products Department ("Licensor") at:* *    www.OpenPBS.org  +1 650 967-4675                  sales@OpenPBS.org*                        877 902-4PBS (US toll-free)* ---------------------------------------------------------------------------* * This license covers use of the OpenPBS v2.3 software (the "Software") at* your site or location, and, for certain users, redistribution of the* Software to other sites and locations.  Use and redistribution of* OpenPBS v2.3 in source and binary forms, with or without modification,* are permitted provided that all of the following conditions are met.* After December 31, 2001, only conditions 3-6 must be met:* * 1. Commercial and/or non-commercial use of the Software is permitted*    provided a current software registration is on file at www.OpenPBS.org.*    If use of this software contributes to a publication, product, or*    service, proper attribution must be given; see www.OpenPBS.org/credit.html* * 2. Redistribution in any form is only permitted for non-commercial,*    non-profit purposes.  There can be no charge for the Software or any*    software incorporating the Software.  Further, there can be no*    expectation of revenue generated as a consequence of redistributing*    the Software.* * 3. Any Redistribution of source code must retain the above copyright notice*    and the acknowledgment contained in paragraph 6, this list of conditions*    and the disclaimer contained in paragraph 7.* * 4. Any Redistribution in binary form must reproduce the above copyright*    notice and the acknowledgment contained in paragraph 6, this list of*    conditions and the disclaimer contained in paragraph 7 in the*    documentation and/or other materials provided with the distribution.* * 5. Redistributions in any form must be accompanied by information on how to*    obtain complete source code for the OpenPBS software and any*    modifications and/or additions to the OpenPBS software.  The source code*    must either be included in the distribution or be available for no more*    than the cost of distribution plus a nominal fee, and all modifications*    and additions to the Software must be freely redistributable by any party*    (including Licensor) without restriction.* * 6. All advertising materials mentioning features or use of the Software must*    display the following acknowledgment:* *     "This product includes software developed by NASA Ames Research Center,*     Lawrence Livermore National Laboratory, and Veridian Information *     Solutions, Inc.*     Visit www.OpenPBS.org for OpenPBS software support,*     products, and information."* * 7. DISCLAIMER OF WARRANTY* * THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND. ANY EXPRESS* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT* ARE EXPRESSLY DISCLAIMED.* * IN NO EVENT SHALL VERIDIAN CORPORATION, ITS AFFILIATED COMPANIES, OR THE* U.S. GOVERNMENT OR ANY OF ITS AGENCIES BE LIABLE FOR ANY DIRECT OR INDIRECT,* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.* * This license will be governed by the laws of the Commonwealth of Virginia,* without reference to its choice of law rules.*/#include <stdio.h>#include <stdlib.h>#include <string.h>#include "job_info.h"#include "constant.h"#include "fairshare.h"#include "globals.h"#include "misc.h"#include "constant.h"#include "config.h"static char *ident = "$Id: fairshare.c,v 2.2.4.4 2000/08/09 00:18:58 hender Exp $";/* * *	add_child - add a group_info to the resource group tree * *	  ginfo - ginfo to add to the tree *	  parent - parent ginfo * *	returns nothing * */void add_child( group_info *ginfo, group_info *parent ){  if( parent != NULL )  {    ginfo -> sibling = parent -> child;    parent -> child = ginfo;    ginfo -> parent = parent;    ginfo -> resgroup = parent -> cresgroup;  }}/* * *	add_unknown - add a ginfo to the "unknown" group  * *	  ginfo - ginfo to add * *	returns nothing * */void add_unknown( group_info *ginfo ){  group_info *unknown;		/* ptr to the "unknown" group */  unknown = find_group_info("unknown", conf.group_root);  add_child( ginfo, unknown );  calc_fair_share_perc(unknown -> child, UNSPECIFIED);}/*  * *	find_group_info - recursive function to find a group_info in the  *			  resgroup tree * *	  name - name of the ginfo to find *	  root - the root of the current sub-tree * *	returns the found group_info or NULL * */group_info *find_group_info( char *name, group_info *root ){  group_info *ginfo;		/* the found group */  if( root == NULL || !strcmp(name, root -> name) )    return root;    ginfo = find_group_info( name, root -> sibling );  if( ginfo == NULL )    ginfo = find_group_info( name, root -> child );    return ginfo;}/* * *	find_alloc_ginfo - trys to find a ginfo in the fair share tree.  If it *			  can not find the ginfo, then allocate a new one and *			  add it to the "unknown" group * *	  name - name of the ginfo to find * *	returns the found ginfo or the newly allocated ginfo * */group_info *find_alloc_ginfo( char *name ){  group_info *ginfo;		/* the found group or allocated group */  ginfo = find_group_info( name, conf.group_root );  if( ginfo == NULL )  {    if( ( ginfo = new_group_info() ) == NULL )      return NULL;        ginfo-> name = string_dup(name);    ginfo -> shares = 1;    add_unknown(ginfo);  }  return ginfo;}/* * *	new_group_info - allocate a new group_info struct and initalize it * *	returns a ptr to the new group_info * */group_info *new_group_info(){  group_info *new;		/* the new group */  if( ( new = malloc( sizeof( group_info ) ) ) == NULL )  {    perror( "Error allocating memory" );    return NULL ;  }  new -> name = NULL;  new -> resgroup = UNSPECIFIED;  new -> cresgroup = UNSPECIFIED;  new -> shares = UNSPECIFIED;  new -> percentage = 0.0;  new -> usage = 1;  new -> temp_usage = 1;  new -> parent = NULL;  new -> sibling = NULL;  new -> child = NULL;  return new;}/* * *	parse_group - parse the resource group file * *	  fname - name of the file * *	returns success/failure * * *	FORMAT:   name	cresgrp		grpname		shares * *	  name    - name of user/grp *	  cresgrp - resource group of the children of this group (if group) *	  grpname - resource group of this user/group *	  shares  - the amount of shares the user/group has in its resgroup *		    */int parse_group( char *fname ){  group_info *ginfo;		/* ptr to parent group */  group_info *new_ginfo;	/* used to add each new group */  char buf[256];		/* used to read each line from the file */  char *nametok;		/* strtok: name of new group */  char *grouptok;		/* strtok: parent group name */  char *cgrouptok;		/* strtok: resgrp of the children of newgrp */  char *sharestok;		/* strtok: the amount of shares for newgrp */  FILE *fp;			/* file pointer to the resource group file */  char error = 0;		/* boolean: is there an error ? */  int shares;			/* number of shares for the new group */  int cgroup;			/* resource group of the children of the grp */  char *endp;			/* used for strtol() */  int linenum = 0;		/* current line number in the file */  if( ( fp = fopen( fname, "r" ) ) == NULL )  {    perror( "Warning: resource group file error, fair share will not work");    return 0;  }  while( fgets( buf, 256, fp ) != NULL )  {    if( buf[strlen(buf)-1] == '\n' )      buf[strlen(buf)-1] = '\0';    linenum++;    if( !skip_line( buf ) )    {      nametok = strtok(buf, "	 ");      cgrouptok = strtok(NULL, "	 ");      grouptok = strtok(NULL, " 	");      sharestok= strtok(NULL,  " 	");      ginfo = find_alloc_ginfo(grouptok);      if( ginfo != NULL )      {	shares = strtol(sharestok, &endp, 10);	if( *endp == '\0' )	{	  cgroup = strtol(cgrouptok, &endp, 10);	  if( *endp == '\0' )	  {	    if( ( new_ginfo = new_group_info() ) == NULL )	      return 0;	    new_ginfo -> name = string_dup( nametok );	    new_ginfo -> resgroup = ginfo -> cresgroup;	    new_ginfo -> cresgroup = cgroup;	    new_ginfo -> shares = shares;	    add_child( new_ginfo, ginfo );	  }	  else	    error = 1;	}	else	  error = 1;      }      else       {	error = 1;	fprintf(stderr, "Parent ginfo of %s doesnt exist.\n", nametok);      }      if( error )        fprintf(stderr, "resgroup: error on line %d.\n", linenum);      error = 0;    }  }  return 1;}/* * *	free_group_tree - free the data used by a the fair share tree * *	  root - root of subtree * */void free_group_tree( group_info *root ){  if( root == NULL )    return;    free_group_tree( root -> sibling );  free_group_tree( root -> child);  free( root );}/* * *	preload_tree -  load the "root" group into the fair share tree *			the "root" group is the entire machine.  Also load 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -