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
|
/*___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 "uti/sge_rmon.h"
#include "sgeobj/sge_range.h"
#include "sge_range_schedd.h"
/* ---------------------------------------
NAME
num_in_range
DESCR
checks if a number is inside a range
a non existent range (NULL) is seen as 1-1
RETURNS
0 if the number is not inside the range
*/
u_long32 num_in_range(
u_long32 num,
lList *r
) {
lListElem *rep;
u_long32 ret;
DENTER(TOP_LAYER, "num_in_range");
if (!r) {
/* no ranges ==> we need to fit exactly 1 and we're sure we can */
DEXIT;
return MIN(num, 1);
}
for_each (rep, r) {
if (num >= (ret=lGetUlong(rep,RN_max))) {
/* We've more than we need */
DEXIT;
return ret;
}
else if (num < lGetUlong(rep,RN_min))
/* We've to few for the range ==> next */
continue;
else {
/* We're somewhere within the range */
DEXIT;
return num;
}
}
/* it's a pitty - we simply don't have enough */
DEXIT;
return 0;
}
|
