File: cull_tree.c

package info (click to toggle)
gridengine 8.1.9%2Bdfsg-10
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 56,880 kB
  • sloc: ansic: 432,689; java: 87,068; cpp: 31,958; sh: 29,429; jsp: 7,757; perl: 6,336; xml: 5,828; makefile: 4,701; csh: 3,928; ruby: 2,221; tcl: 1,676; lisp: 669; yacc: 519; python: 503; lex: 361; javascript: 200
file content (134 lines) | stat: -rw-r--r-- 3,943 bytes parent folder | download | duplicates (6)
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
/*___INFO__MARK_BEGIN__*/
/*************************************************************************
 * 
 *  The Contents of this file are made available subject to the terms of
 *  the Sun Industry Standards Source License Version 1.2
 * 
 *  Sun Microsystems Inc., March, 2001
 * 
 * 
 *  Sun Industry Standards Source License Version 1.2
 *  =================================================
 *  The contents of this file are subject to the Sun Industry Standards
 *  Source License Version 1.2 (the "License"); You may not use this file
 *  except in compliance with the License. You may obtain a copy of the
 *  License at http://gridengine.sunsource.net/Gridengine_SISSL_license.html
 * 
 *  Software provided under this License is provided on an "AS IS" basis,
 *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
 *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
 *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
 *  See the License for the specific provisions governing your rights and
 *  obligations concerning the Software.
 * 
 *   The Initial Developer of the Original Code is: Sun Microsystems, Inc.
 * 
 *   Copyright: 2001 by Sun Microsystems, Inc.
 * 
 *   All Rights Reserved.
 * 
 ************************************************************************/
/*___INFO__MARK_END__*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/* do not compile in monitoring code */
#ifndef NO_SGE_COMPILE_DEBUG
#define NO_SGE_COMPILE_DEBUG
#endif

#include "uti/sge_rmon.h"

#include "cull/cull.h"

/****** cull/tree/lGetNumberOfNodes() *****************************************
*  NAME
*     lGetNumberOfNodes() -- Number of elements and subelements 
*
*  SYNOPSIS
*     int lGetNumberOfNodes(const lListElem *ep, const lList *lp, int nm) 
*
*  FUNCTION
*     Returns the number of elements and subelements in the sublist 'nm' 
*     of the element 'ep' (lp = NULL) or returns the sum of all elements
*     and subelements within the list 'lp' (ep = NULL)
*
*  INPUTS
*     const lListElem *ep - element 
*     const lList *lp     - list 
*     int nm              - field name id within element 
*
*  RESULT
*     int - number of elements
*******************************************************************************/
int lGetNumberOfNodes(const lListElem *ep, const lList *lp, int nm) 
{
   int n = 0;

   DENTER(CULL_LAYER, "lGetNumberOfNodes");

   if (ep) {
      int pos;

      n = 1;

      if ((pos = lGetPosViaElem(ep, nm, SGE_NO_ABORT)) >= 0 && mt_get_type(ep->descr[pos].mt) == lListT) {
         if ((lp = lGetPosList(ep, pos)))
            n += lGetNumberOfNodes(NULL, lp, nm);
      }
      DEXIT;
      return n;
   } else {
      for_each(ep, lp) {
         n += lGetNumberOfNodes(ep, NULL, nm);
      }
      DEXIT;
      return n;
   }
}

/****** cull/tree/lGetNumberOfLeafs() *****************************************
*  NAME
*     lGetNumberOfLeafs() -- Returns the number of leaves 
*
*  SYNOPSIS
*     int lGetNumberOfLeafs(const lListElem *ep, const lList *lp, int nm) 
*
*  FUNCTION
*     Returns the number of leaves 
*
*  INPUTS
*     const lListElem *ep - element 
*     const lList *lp     - list 
*     int nm              - field name if within ep 
*
*  RESULT
*     int - number of leaves 
******************************************************************************/
int lGetNumberOfLeafs(const lListElem *ep, const lList *lp, int nm) 
{
   int n = 0;

   DENTER(CULL_LAYER, "lGetNumberOfLeafs");

   if (ep) {
      int pos;

      if ((pos = lGetPosViaElem(ep, nm, SGE_NO_ABORT)) >= 0 && mt_get_type(ep->descr[pos].mt) == lListT) {
         if (!(lp = lGetPosList(ep, pos)))
            n = 1;
         else
            n = lGetNumberOfLeafs(NULL, lp, nm);
      }
      DEXIT;
      return n;
   }
   else {
      for_each(ep, lp) {
         n += lGetNumberOfLeafs(ep, NULL, nm);
      }
      DEXIT;
      return n;
   }
}