r2602 - performance: introduce global parse cache and use it in considerConfiguredCo...
[racktables] / inc / functions.php
1 <?php
2 /*
3 *
4 * This file is a library of computational functions for RackTables.
5 *
6 */
7
8 $loclist[0] = 'front';
9 $loclist[1] = 'interior';
10 $loclist[2] = 'rear';
11 $loclist['front'] = 0;
12 $loclist['interior'] = 1;
13 $loclist['rear'] = 2;
14 $template[0] = array (TRUE, TRUE, TRUE);
15 $template[1] = array (TRUE, TRUE, FALSE);
16 $template[2] = array (FALSE, TRUE, TRUE);
17 $template[3] = array (TRUE, FALSE, FALSE);
18 $template[4] = array (FALSE, TRUE, FALSE);
19 $template[5] = array (FALSE, FALSE, TRUE);
20 $templateWidth[0] = 3;
21 $templateWidth[1] = 2;
22 $templateWidth[2] = 2;
23 $templateWidth[3] = 1;
24 $templateWidth[4] = 1;
25 $templateWidth[5] = 1;
26
27 // Entity type by page number mapping is 1:1 atm, but may change later.
28 $etype_by_pageno = array
29 (
30 'ipv4net' => 'ipv4net',
31 'ipv4rspool' => 'ipv4rspool',
32 'ipv4vs' => 'ipv4vs',
33 'object' => 'object',
34 'rack' => 'rack',
35 'user' => 'user',
36 'file' => 'file',
37 );
38
39 // Objects of some types should be explicitly shown as
40 // anonymous (labelless). This function is a single place where the
41 // decision about displayed name is made.
42 function displayedName ($objectData)
43 {
44 if ($objectData['name'] != '')
45 return $objectData['name'];
46 elseif (considerConfiguredConstraint ('object', $objectData['id'], 'NAMEWARN_LISTSRC'))
47 return "ANONYMOUS " . $objectData['objtype_name'];
48 else
49 return "[${objectData['objtype_name']}]";
50 }
51
52 // This function finds height of solid rectangle of atoms, which are all
53 // assigned to the same object. Rectangle base is defined by specified
54 // template.
55 function rectHeight ($rackData, $startRow, $template_idx)
56 {
57 $height = 0;
58 // The first met object_id is used to match all the folowing IDs.
59 $object_id = 0;
60 global $template;
61 do
62 {
63 for ($locidx = 0; $locidx < 3; $locidx++)
64 {
65 // At least one value in template is TRUE, but the following block
66 // can meet 'skipped' atoms. Let's ensure we have something after processing
67 // the first row.
68 if ($template[$template_idx][$locidx])
69 {
70 if (isset ($rackData[$startRow - $height][$locidx]['skipped']))
71 break 2;
72 if (isset ($rackData[$startRow - $height][$locidx]['rowspan']))
73 break 2;
74 if (isset ($rackData[$startRow - $height][$locidx]['colspan']))
75 break 2;
76 if ($rackData[$startRow - $height][$locidx]['state'] != 'T')
77 break 2;
78 if ($object_id == 0)
79 $object_id = $rackData[$startRow - $height][$locidx]['object_id'];
80 if ($object_id != $rackData[$startRow - $height][$locidx]['object_id'])
81 break 2;
82 }
83 }
84 // If the first row can't offer anything, bail out.
85 if ($height == 0 and $object_id == 0)
86 break;
87 $height++;
88 }
89 while ($startRow - $height > 0);
90 # echo "for startRow==${startRow} and template==(" . ($template[$template_idx][0] ? 'T' : 'F');
91 # echo ', ' . ($template[$template_idx][1] ? 'T' : 'F') . ', ' . ($template[$template_idx][2] ? 'T' : 'F');
92 # echo ") height==${height}<br>\n";
93 return $height;
94 }
95
96 // This function marks atoms to be avoided by rectHeight() and assigns rowspan/colspan
97 // attributes.
98 function markSpan (&$rackData, $startRow, $maxheight, $template_idx)
99 {
100 global $template, $templateWidth;
101 $colspan = 0;
102 for ($height = 0; $height < $maxheight; $height++)
103 {
104 for ($locidx = 0; $locidx < 3; $locidx++)
105 {
106 if ($template[$template_idx][$locidx])
107 {
108 // Add colspan/rowspan to the first row met and mark the following ones to skip.
109 // Explicitly show even single-cell spanned atoms, because rectHeight()
110 // is expeciting this data for correct calculation.
111 if ($colspan != 0)
112 $rackData[$startRow - $height][$locidx]['skipped'] = TRUE;
113 else
114 {
115 $colspan = $templateWidth[$template_idx];
116 if ($colspan >= 1)
117 $rackData[$startRow - $height][$locidx]['colspan'] = $colspan;
118 if ($maxheight >= 1)
119 $rackData[$startRow - $height][$locidx]['rowspan'] = $maxheight;
120 }
121 }
122 }
123 }
124 return;
125 }
126
127 // This function sets rowspan/solspan/skipped atom attributes for renderRack()
128 // What we actually have to do is to find _all_ possible rectangles for each unit
129 // and then select the widest of those with the maximal square.
130 function markAllSpans (&$rackData = NULL)
131 {
132 if ($rackData == NULL)
133 {
134 showError ('Invalid rackData', __FUNCTION__);
135 return;
136 }
137 for ($i = $rackData['height']; $i > 0; $i--)
138 while (markBestSpan ($rackData, $i));
139 }
140
141 // Calculate height of 6 possible span templates (array is presorted by width
142 // descending) and mark the best (if any).
143 function markBestSpan (&$rackData, $i)
144 {
145 global $template, $templateWidth;
146 for ($j = 0; $j < 6; $j++)
147 {
148 $height[$j] = rectHeight ($rackData, $i, $j);
149 $square[$j] = $height[$j] * $templateWidth[$j];
150 }
151 // find the widest rectangle of those with maximal height
152 $maxsquare = max ($square);
153 if (!$maxsquare)
154 return FALSE;
155 $best_template_index = 0;
156 for ($j = 0; $j < 6; $j++)
157 if ($square[$j] == $maxsquare)
158 {
159 $best_template_index = $j;
160 $bestheight = $height[$j];
161 break;
162 }
163 // distribute span marks
164 markSpan ($rackData, $i, $bestheight, $best_template_index);
165 return TRUE;
166 }
167
168 // We can mount 'F' atoms and unmount our own 'T' atoms.
169 function applyObjectMountMask (&$rackData, $object_id)
170 {
171 for ($unit_no = $rackData['height']; $unit_no > 0; $unit_no--)
172 for ($locidx = 0; $locidx < 3; $locidx++)
173 switch ($rackData[$unit_no][$locidx]['state'])
174 {
175 case 'F':
176 $rackData[$unit_no][$locidx]['enabled'] = TRUE;
177 break;
178 case 'T':
179 $rackData[$unit_no][$locidx]['enabled'] = ($rackData[$unit_no][$locidx]['object_id'] == $object_id);
180 break;
181 default:
182 $rackData[$unit_no][$locidx]['enabled'] = FALSE;
183 }
184 }
185
186 // Design change means transition between 'F' and 'A' and back.
187 function applyRackDesignMask (&$rackData)
188 {
189 for ($unit_no = $rackData['height']; $unit_no > 0; $unit_no--)
190 for ($locidx = 0; $locidx < 3; $locidx++)
191 switch ($rackData[$unit_no][$locidx]['state'])
192 {
193 case 'F':
194 case 'A':
195 $rackData[$unit_no][$locidx]['enabled'] = TRUE;
196 break;
197 default:
198 $rackData[$unit_no][$locidx]['enabled'] = FALSE;
199 }
200 }
201
202 // The same for 'F' and 'U'.
203 function applyRackProblemMask (&$rackData)
204 {
205 for ($unit_no = $rackData['height']; $unit_no > 0; $unit_no--)
206 for ($locidx = 0; $locidx < 3; $locidx++)
207 switch ($rackData[$unit_no][$locidx]['state'])
208 {
209 case 'F':
210 case 'U':
211 $rackData[$unit_no][$locidx]['enabled'] = TRUE;
212 break;
213 default:
214 $rackData[$unit_no][$locidx]['enabled'] = FALSE;
215 }
216 }
217
218 // This mask should allow toggling 'T' and 'W' on object's rackspace.
219 function applyObjectProblemMask (&$rackData)
220 {
221 for ($unit_no = $rackData['height']; $unit_no > 0; $unit_no--)
222 for ($locidx = 0; $locidx < 3; $locidx++)
223 switch ($rackData[$unit_no][$locidx]['state'])
224 {
225 case 'T':
226 case 'W':
227 $rackData[$unit_no][$locidx]['enabled'] = ($rackData[$unit_no][$locidx]['object_id'] == $object_id);
228 break;
229 default:
230 $rackData[$unit_no][$locidx]['enabled'] = FALSE;
231 }
232 }
233
234 // This function highlights specified object (and removes previous highlight).
235 function highlightObject (&$rackData, $object_id)
236 {
237 for ($unit_no = $rackData['height']; $unit_no > 0; $unit_no--)
238 for ($locidx = 0; $locidx < 3; $locidx++)
239 if
240 (
241 $rackData[$unit_no][$locidx]['state'] == 'T' and
242 $rackData[$unit_no][$locidx]['object_id'] == $object_id
243 )
244 $rackData[$unit_no][$locidx]['hl'] = 'h';
245 else
246 unset ($rackData[$unit_no][$locidx]['hl']);
247 }
248
249 // This function marks atoms to selected or not depending on their current state.
250 function markupAtomGrid (&$data, $checked_state)
251 {
252 for ($unit_no = $data['height']; $unit_no > 0; $unit_no--)
253 for ($locidx = 0; $locidx < 3; $locidx++)
254 {
255 if (!($data[$unit_no][$locidx]['enabled'] === TRUE))
256 continue;
257 if ($data[$unit_no][$locidx]['state'] == $checked_state)
258 $data[$unit_no][$locidx]['checked'] = ' checked';
259 else
260 $data[$unit_no][$locidx]['checked'] = '';
261 }
262 }
263
264 // This function is almost a clone of processGridForm(), but doesn't save anything to database
265 // Return value is the changed rack data.
266 // Here we assume that correct filter has already been applied, so we just
267 // set or unset checkbox inputs w/o changing atom state.
268 function mergeGridFormToRack (&$rackData)
269 {
270 $rack_id = $rackData['id'];
271 for ($unit_no = $rackData['height']; $unit_no > 0; $unit_no--)
272 for ($locidx = 0; $locidx < 3; $locidx++)
273 {
274 if ($rackData[$unit_no][$locidx]['enabled'] != TRUE)
275 continue;
276 $inputname = "atom_${rack_id}_${unit_no}_${locidx}";
277 if (isset ($_REQUEST[$inputname]) and $_REQUEST[$inputname] == 'on')
278 $rackData[$unit_no][$locidx]['checked'] = ' checked';
279 else
280 $rackData[$unit_no][$locidx]['checked'] = '';
281 }
282 }
283
284 // netmask conversion from length to number
285 function binMaskFromDec ($maskL)
286 {
287 $map_straight = array (
288 0 => 0x00000000,
289 1 => 0x80000000,
290 2 => 0xc0000000,
291 3 => 0xe0000000,
292 4 => 0xf0000000,
293 5 => 0xf8000000,
294 6 => 0xfc000000,
295 7 => 0xfe000000,
296 8 => 0xff000000,
297 9 => 0xff800000,
298 10 => 0xffc00000,
299 11 => 0xffe00000,
300 12 => 0xfff00000,
301 13 => 0xfff80000,
302 14 => 0xfffc0000,
303 15 => 0xfffe0000,
304 16 => 0xffff0000,
305 17 => 0xffff8000,
306 18 => 0xffffc000,
307 19 => 0xffffe000,
308 20 => 0xfffff000,
309 21 => 0xfffff800,
310 22 => 0xfffffc00,
311 23 => 0xfffffe00,
312 24 => 0xffffff00,
313 25 => 0xffffff80,
314 26 => 0xffffffc0,
315 27 => 0xffffffe0,
316 28 => 0xfffffff0,
317 29 => 0xfffffff8,
318 30 => 0xfffffffc,
319 31 => 0xfffffffe,
320 32 => 0xffffffff,
321 );
322 return $map_straight[$maskL];
323 }
324
325 // complementary value
326 function binInvMaskFromDec ($maskL)
327 {
328 $map_compl = array (
329 0 => 0xffffffff,
330 1 => 0x7fffffff,
331 2 => 0x3fffffff,
332 3 => 0x1fffffff,
333 4 => 0x0fffffff,
334 5 => 0x07ffffff,
335 6 => 0x03ffffff,
336 7 => 0x01ffffff,
337 8 => 0x00ffffff,
338 9 => 0x007fffff,
339 10 => 0x003fffff,
340 11 => 0x001fffff,
341 12 => 0x000fffff,
342 13 => 0x0007ffff,
343 14 => 0x0003ffff,
344 15 => 0x0001ffff,
345 16 => 0x0000ffff,
346 17 => 0x00007fff,
347 18 => 0x00003fff,
348 19 => 0x00001fff,
349 20 => 0x00000fff,
350 21 => 0x000007ff,
351 22 => 0x000003ff,
352 23 => 0x000001ff,
353 24 => 0x000000ff,
354 25 => 0x0000007f,
355 26 => 0x0000003f,
356 27 => 0x0000001f,
357 28 => 0x0000000f,
358 29 => 0x00000007,
359 30 => 0x00000003,
360 31 => 0x00000001,
361 32 => 0x00000000,
362 );
363 return $map_compl[$maskL];
364 }
365
366 // This function looks up 'has_problems' flag for 'T' atoms
367 // and modifies 'hl' key. May be, this should be better done
368 // in getRackData(). We don't honour 'skipped' key, because
369 // the function is also used for thumb creation.
370 function markupObjectProblems (&$rackData)
371 {
372 for ($i = $rackData['height']; $i > 0; $i--)
373 for ($locidx = 0; $locidx < 3; $locidx++)
374 if ($rackData[$i][$locidx]['state'] == 'T')
375 {
376 $object = getObjectInfo ($rackData[$i][$locidx]['object_id'], FALSE);
377 if ($object['has_problems'] == 'yes')
378 {
379 // Object can be already highlighted.
380 if (isset ($rackData[$i][$locidx]['hl']))
381 $rackData[$i][$locidx]['hl'] = $rackData[$i][$locidx]['hl'] . 'w';
382 else
383 $rackData[$i][$locidx]['hl'] = 'w';
384 }
385 }
386 }
387
388 function search_cmpObj ($a, $b)
389 {
390 return ($a['score'] > $b['score'] ? -1 : 1);
391 }
392
393 function getObjectSearchResults ($terms)
394 {
395 $objects = array();
396 mergeSearchResults ($objects, $terms, 'name');
397 mergeSearchResults ($objects, $terms, 'label');
398 mergeSearchResults ($objects, $terms, 'asset_no');
399 mergeSearchResults ($objects, $terms, 'barcode');
400 if (count ($objects) == 1)
401 usort ($objects, 'search_cmpObj');
402 return $objects;
403 }
404
405 // This function removes all colons and dots from a string.
406 function l2addressForDatabase ($string)
407 {
408 $string = strtoupper ($string);
409 switch (TRUE)
410 {
411 case ($string == '' or preg_match (RE_L2_SOLID, $string)):
412 return $string;
413 case (preg_match (RE_L2_IFCFG, $string)):
414 $pieces = explode (':', $string);
415 // This workaround is for SunOS ifconfig.
416 foreach ($pieces as &$byte)
417 if (strlen ($byte) == 1)
418 $byte = '0' . $byte;
419 // And this workaround is for PHP.
420 unset ($byte);
421 return implode ('', $pieces);
422 case (preg_match (RE_L2_CISCO, $string)):
423 return implode ('', explode ('.', $string));
424 case (preg_match (RE_L2_IPCFG, $string)):
425 return implode ('', explode ('-', $string));
426 default:
427 return NULL;
428 }
429 }
430
431 function l2addressFromDatabase ($string)
432 {
433 switch (strlen ($string))
434 {
435 case 12: // Ethernet
436 case 16: // FireWire
437 $ret = implode (':', str_split ($string, 2));
438 break;
439 default:
440 $ret = $string;
441 break;
442 }
443 return $ret;
444 }
445
446 // The following 2 functions return previous and next rack IDs for
447 // a given rack ID. The order of racks is the same as in renderRackspace()
448 // or renderRow().
449 function getPrevIDforRack ($row_id = 0, $rack_id = 0)
450 {
451 if ($row_id <= 0 or $rack_id <= 0)
452 {
453 showError ('Invalid arguments passed', __FUNCTION__);
454 return NULL;
455 }
456 $rackList = getRacksForRow ($row_id);
457 doubleLink ($rackList);
458 if (isset ($rackList[$rack_id]['prev_key']))
459 return $rackList[$rack_id]['prev_key'];
460 return NULL;
461 }
462
463 function getNextIDforRack ($row_id = 0, $rack_id = 0)
464 {
465 if ($row_id <= 0 or $rack_id <= 0)
466 {
467 showError ('Invalid arguments passed', __FUNCTION__);
468 return NULL;
469 }
470 $rackList = getRacksForRow ($row_id);
471 doubleLink ($rackList);
472 if (isset ($rackList[$rack_id]['next_key']))
473 return $rackList[$rack_id]['next_key'];
474 return NULL;
475 }
476
477 // This function finds previous and next array keys for each array key and
478 // modifies its argument accordingly.
479 function doubleLink (&$array)
480 {
481 $prev_key = NULL;
482 foreach (array_keys ($array) as $key)
483 {
484 if ($prev_key)
485 {
486 $array[$key]['prev_key'] = $prev_key;
487 $array[$prev_key]['next_key'] = $key;
488 }
489 $prev_key = $key;
490 }
491 }
492
493 function sortTokenize ($a, $b)
494 {
495 $aold='';
496 while ($a != $aold)
497 {
498 $aold=$a;
499 $a = ereg_replace('[^a-zA-Z0-9]',' ',$a);
500 $a = ereg_replace('([0-9])([a-zA-Z])','\\1 \\2',$a);
501 $a = ereg_replace('([a-zA-Z])([0-9])','\\1 \\2',$a);
502 }
503
504 $bold='';
505 while ($b != $bold)
506 {
507 $bold=$b;
508 $b = ereg_replace('[^a-zA-Z0-9]',' ',$b);
509 $b = ereg_replace('([0-9])([a-zA-Z])','\\1 \\2',$b);
510 $b = ereg_replace('([a-zA-Z])([0-9])','\\1 \\2',$b);
511 }
512
513
514
515 $ar = explode(' ', $a);
516 $br = explode(' ', $b);
517 for ($i=0; $i<count($ar) && $i<count($br); $i++)
518 {
519 $ret = 0;
520 if (is_numeric($ar[$i]) and is_numeric($br[$i]))
521 $ret = ($ar[$i]==$br[$i])?0:($ar[$i]<$br[$i]?-1:1);
522 else
523 $ret = strcasecmp($ar[$i], $br[$i]);
524 if ($ret != 0)
525 return $ret;
526 }
527 if ($i<count($ar))
528 return 1;
529 if ($i<count($br))
530 return -1;
531 return 0;
532 }
533
534 function sortByName ($a, $b)
535 {
536 return sortTokenize($a['name'], $b['name']);
537 }
538
539 function sortEmptyPorts ($a, $b)
540 {
541 $objname_cmp = sortTokenize($a['Object_name'], $b['Object_name']);
542 if ($objname_cmp == 0)
543 {
544 return sortTokenize($a['Port_name'], $b['Port_name']);
545 }
546 return $objname_cmp;
547 }
548
549 function sortObjectAddressesAndNames ($a, $b)
550 {
551 $objname_cmp = sortTokenize($a['object_name'], $b['object_name']);
552 if ($objname_cmp == 0)
553 {
554 $name_a = (isset ($a['port_name'])) ? $a['port_name'] : '';
555 $name_b = (isset ($b['port_name'])) ? $b['port_name'] : '';
556 $objname_cmp = sortTokenize($name_a, $name_b);
557 if ($objname_cmp == 0)
558 sortTokenize($a['ip'], $b['ip']);
559 return $objname_cmp;
560 }
561 return $objname_cmp;
562 }
563
564 function sortAddresses ($a, $b)
565 {
566 $name_cmp = sortTokenize($a['name'], $b['name']);
567 if ($name_cmp == 0)
568 {
569 return sortTokenize($a['ip'], $b['ip']);
570 }
571 return $name_cmp;
572 }
573
574 // This function expands port compat list into a matrix.
575 function buildPortCompatMatrixFromList ($portTypeList, $portCompatList)
576 {
577 $matrix = array();
578 // Create type matrix and markup compatible types.
579 foreach (array_keys ($portTypeList) as $type1)
580 foreach (array_keys ($portTypeList) as $type2)
581 $matrix[$type1][$type2] = FALSE;
582 foreach ($portCompatList as $pair)
583 $matrix[$pair['type1']][$pair['type2']] = TRUE;
584 return $matrix;
585 }
586
587 // This function returns an array of single element of object's FQDN attribute,
588 // if FQDN is set. The next choice is object's common name, if it looks like a
589 // hostname. Otherwise an array of all 'regular' IP addresses of the
590 // object is returned (which may appear 0 and more elements long).
591 function findAllEndpoints ($object_id, $fallback = '')
592 {
593 $values = getAttrValues ($object_id);
594 foreach ($values as $record)
595 if ($record['name'] == 'FQDN' && !empty ($record['value']))
596 return array ($record['value']);
597 $regular = array();
598 foreach (getObjectIPv4Allocations ($object_id) as $dottedquad => $alloc)
599 if ($alloc['type'] == 'regular')
600 $regular[] = $dottedquad;
601 if (!count ($regular) && !empty ($fallback))
602 return array ($fallback);
603 return $regular;
604 }
605
606 // Some records in the dictionary may be written as plain text or as Wiki
607 // link in the following syntax:
608 // 1. word
609 // 2. [[word URL]] // FIXME: this isn't working
610 // 3. [[word word word | URL]]
611 // This function parses the line and returns text suitable for either A
612 // (rendering <A HREF>) or O (for <OPTION>).
613 function parseWikiLink ($line, $which, $strip_optgroup = FALSE)
614 {
615 if (preg_match ('/^\[\[.+\]\]$/', $line) == 0)
616 {
617 if ($strip_optgroup)
618 return ereg_replace ('^.+%GSKIP%', '', ereg_replace ('^(.+)%GPASS%', '\\1 ', $line));
619 else
620 return $line;
621 }
622 $line = preg_replace ('/^\[\[(.+)\]\]$/', '$1', $line);
623 $s = explode ('|', $line);
624 $o_value = trim ($s[0]);
625 if ($strip_optgroup)
626 $o_value = ereg_replace ('^.+%GSKIP%', '', ereg_replace ('^(.+)%GPASS%', '\\1 ', $o_value));
627 $a_value = trim ($s[1]);
628 if ($which == 'a')
629 return "<a href='${a_value}'>${o_value}</a>";
630 if ($which == 'o')
631 return $o_value;
632 }
633
634 function buildVServiceName ($vsinfo = NULL)
635 {
636 if ($vsinfo == NULL)
637 {
638 showError ('NULL argument', __FUNCTION__);
639 return NULL;
640 }
641 return $vsinfo['vip'] . ':' . $vsinfo['vport'] . '/' . $vsinfo['proto'];
642 }
643
644 // rackspace usage for a single rack
645 // (T + W + U) / (height * 3 - A)
646 function getRSUforRack ($data = NULL)
647 {
648 if ($data == NULL)
649 {
650 showError ('Invalid argument', __FUNCTION__);
651 return NULL;
652 }
653 $counter = array ('A' => 0, 'U' => 0, 'T' => 0, 'W' => 0, 'F' => 0);
654 for ($unit_no = $data['height']; $unit_no > 0; $unit_no--)
655 for ($locidx = 0; $locidx < 3; $locidx++)
656 $counter[$data[$unit_no][$locidx]['state']]++;
657 return ($counter['T'] + $counter['W'] + $counter['U']) / ($counter['T'] + $counter['W'] + $counter['U'] + $counter['F']);
658 }
659
660 // Same for row.
661 function getRSUforRackRow ($rowData = NULL)
662 {
663 if ($rowData === NULL)
664 {
665 showError ('Invalid argument', __FUNCTION__);
666 return NULL;
667 }
668 if (!count ($rowData))
669 return 0;
670 $counter = array ('A' => 0, 'U' => 0, 'T' => 0, 'W' => 0, 'F' => 0);
671 $total_height = 0;
672 foreach (array_keys ($rowData) as $rack_id)
673 {
674 $data = getRackData ($rack_id);
675 $total_height += $data['height'];
676 for ($unit_no = $data['height']; $unit_no > 0; $unit_no--)
677 for ($locidx = 0; $locidx < 3; $locidx++)
678 $counter[$data[$unit_no][$locidx]['state']]++;
679 }
680 return ($counter['T'] + $counter['W'] + $counter['U']) / ($counter['T'] + $counter['W'] + $counter['U'] + $counter['F']);
681 }
682
683 // Return a list of object IDs, which can be found in the given rackspace block.
684 function stuffInRackspace ($rackData)
685 {
686 $objects = array();
687 for ($i = $rackData['height']; $i > 0; $i--)
688 for ($locidx = 0; $locidx < 3; $locidx++)
689 if
690 (
691 $rackData[$i][$locidx]['state'] == 'T' and
692 !in_array ($rackData[$i][$locidx]['object_id'], $objects)
693 )
694 $objects[] = $rackData[$i][$locidx]['object_id'];
695 return $objects;
696 }
697
698 // Make sure the string is always wrapped with LF characters
699 function lf_wrap ($str)
700 {
701 $ret = trim ($str, "\r\n");
702 if (!empty ($ret))
703 $ret .= "\n";
704 return $ret;
705 }
706
707 // Adopted from Mantis BTS code.
708 function string_insert_hrefs ($s)
709 {
710 if (getConfigVar ('DETECT_URLS') != 'yes')
711 return $s;
712 # Find any URL in a string and replace it by a clickable link
713 $s = preg_replace( '/(([[:alpha:]][-+.[:alnum:]]*):\/\/(%[[:digit:]A-Fa-f]{2}|[-_.!~*\';\/?%^\\\\:@&={\|}+$#\(\),\[\][:alnum:]])+)/se',
714 "'<a href=\"'.rtrim('\\1','.').'\">\\1</a> [<a href=\"'.rtrim('\\1','.').'\" target=\"_blank\">^</a>]'",
715 $s);
716 $s = preg_replace( '/\b' . email_regex_simple() . '\b/i',
717 '<a href="mailto:\0">\0</a>',
718 $s);
719 return $s;
720 }
721
722 // Idem.
723 function email_regex_simple ()
724 {
725 return "(([a-z0-9!#*+\/=?^_{|}~-]+(?:\.[a-z0-9!#*+\/=?^_{|}~-]+)*)" . # recipient
726 "\@((?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?))"; # @domain
727 }
728
729 // Parse AUTOPORTS_CONFIG and return a list of generated pairs (port_type, port_name)
730 // for the requested object_type_id.
731 function getAutoPorts ($type_id)
732 {
733 $ret = array();
734 $typemap = explode (';', str_replace (' ', '', getConfigVar ('AUTOPORTS_CONFIG')));
735 foreach ($typemap as $equation)
736 {
737 $tmp = explode ('=', $equation);
738 if (count ($tmp) != 2)
739 continue;
740 $objtype_id = $tmp[0];
741 if ($objtype_id != $type_id)
742 continue;
743 $portlist = $tmp[1];
744 foreach (explode ('+', $portlist) as $product)
745 {
746 $tmp = explode ('*', $product);
747 if (count ($tmp) != 3)
748 continue;
749 $nports = $tmp[0];
750 $port_type = $tmp[1];
751 $format = $tmp[2];
752 for ($i = 0; $i < $nports; $i++)
753 $ret[] = array ('type' => $port_type, 'name' => @sprintf ($format, $i));
754 }
755 }
756 return $ret;
757 }
758
759 // Find if a particular tag id exists on the tree, then attach the
760 // given child tag to it. If the parent tag doesn't exist, return FALSE.
761 function attachChildTag (&$tree, $parent_id, $child_id, $child_info, $threshold = 0)
762 {
763 $self = __FUNCTION__;
764 foreach (array_keys ($tree) as $tagid)
765 {
766 if ($tagid == $parent_id)
767 {
768 if (!$threshold or ($threshold and $tree[$tagid]['kidc'] + 1 < $threshold))
769 $tree[$tagid]['kids'][$child_id] = $child_info;
770 // Reset the list only once.
771 if (++$tree[$tagid]['kidc'] == $threshold)
772 $tree[$tagid]['kids'] = array();
773 return TRUE;
774 }
775 elseif ($self ($tree[$tagid]['kids'], $parent_id, $child_id, $child_info, $threshold))
776 return TRUE;
777 }
778 return FALSE;
779 }
780
781 // Build a tree from the item list and return it. Input and output data is
782 // indexed by item id (nested items in output are recursively stored in 'kids'
783 // key, which is in turn indexed by id. Functions, which are ready to handle
784 // tree collapsion/expansion themselves, may request non-zero threshold value
785 // for smaller resulting tree.
786 function treeFromList ($mytaglist, $threshold = 0)
787 {
788 $ret = array();
789 while (count ($mytaglist) > 0)
790 {
791 $picked = FALSE;
792 foreach ($mytaglist as $tagid => $taginfo)
793 {
794 $taginfo['kidc'] = 0;
795 $taginfo['kids'] = array();
796 if ($taginfo['parent_id'] == NULL)
797 {
798 $ret[$tagid] = $taginfo;
799 $picked = TRUE;
800 unset ($mytaglist[$tagid]);
801 }
802 elseif (attachChildTag ($ret, $taginfo['parent_id'], $tagid, $taginfo, $threshold))
803 {
804 $picked = TRUE;
805 unset ($mytaglist[$tagid]);
806 }
807 }
808 if (!$picked) // Only orphaned items on the list.
809 break;
810 }
811 return $ret;
812 }
813
814 // Build a tree from the tag list and return everything _except_ the tree.
815 function getOrphanedTags ()
816 {
817 global $taglist;
818 $mytaglist = $taglist;
819 $dummy = array();
820 while (count ($mytaglist) > 0)
821 {
822 $picked = FALSE;
823 foreach ($mytaglist as $tagid => $taginfo)
824 {
825 $taginfo['kidc'] = 0;
826 $taginfo['kids'] = array();
827 if ($taginfo['parent_id'] == NULL)
828 {
829 $dummy[$tagid] = $taginfo;
830 $picked = TRUE;
831 unset ($mytaglist[$tagid]);
832 }
833 elseif (attachChildTag ($dummy, $taginfo['parent_id'], $tagid, $taginfo))
834 {
835 $picked = TRUE;
836 unset ($mytaglist[$tagid]);
837 }
838 }
839 if (!$picked) // Only orphaned items on the list.
840 return $mytaglist;
841 }
842 return array();
843 }
844
845 function serializeTags ($chain, $baseurl = '')
846 {
847 $comma = '';
848 $ret = '';
849 foreach ($chain as $taginfo)
850 {
851 $ret .= $comma .
852 ($baseurl == '' ? '' : "<a href='${baseurl}tagfilter[]=${taginfo['id']}'>") .
853 $taginfo['tag'] .
854 ($baseurl == '' ? '' : '</a>');
855 $comma = ', ';
856 }
857 return $ret;
858 }
859
860 // For each tag add all its parent tags onto the list. Don't expect anything
861 // except user's tags on the chain.
862 function getTagChainExpansion ($chain, $tree = NULL)
863 {
864 $self = __FUNCTION__;
865 if ($tree === NULL)
866 {
867 global $tagtree;
868 $tree = $tagtree;
869 }
870 // For each tag find its path from the root, then combine items
871 // of all paths and add them to the chain, if they aren't there yet.
872 $ret = array();
873 foreach ($tree as $taginfo1)
874 {
875 $hit = FALSE;
876 foreach ($chain as $taginfo2)
877 if ($taginfo1['id'] == $taginfo2['id'])
878 {
879 $hit = TRUE;
880 break;
881 }
882 if (count ($taginfo1['kids']) > 0)
883 {
884 $subsearch = $self ($chain, $taginfo1['kids']);
885 if (count ($subsearch))
886 {
887 $hit = TRUE;
888 $ret = array_merge ($ret, $subsearch);
889 }
890 }
891 if ($hit)
892 $ret[] = $taginfo1;
893 }
894 return $ret;
895 }
896
897 // Return the list of missing implicit tags.
898 function getImplicitTags ($oldtags)
899 {
900 $ret = array();
901 $newtags = getTagChainExpansion ($oldtags);
902 foreach ($newtags as $newtag)
903 {
904 $already_exists = FALSE;
905 foreach ($oldtags as $oldtag)
906 if ($newtag['id'] == $oldtag['id'])
907 {
908 $already_exists = TRUE;
909 break;
910 }
911 if ($already_exists)
912 continue;
913 $ret[] = array ('id' => $newtag['id'], 'tag' => $newtag['tag'], 'parent_id' => $newtag['parent_id']);
914 }
915 return $ret;
916 }
917
918 // Minimize the chain: exclude all implicit tags and return the result.
919 function getExplicitTagsOnly ($chain, $tree = NULL)
920 {
921 $self = __FUNCTION__;
922 global $tagtree;
923 if ($tree === NULL)
924 $tree = $tagtree;
925 $ret = array();
926 foreach ($tree as $taginfo)
927 {
928 if (isset ($taginfo['kids']))
929 {
930 $harvest = $self ($chain, $taginfo['kids']);
931 if (count ($harvest) > 0)
932 {
933 $ret = array_merge ($ret, $harvest);
934 continue;
935 }
936 }
937 // This tag isn't implicit, test is for being explicit.
938 foreach ($chain as $testtag)
939 if ($taginfo['id'] == $testtag['id'])
940 {
941 $ret[] = $testtag;
942 break;
943 }
944 }
945 return $ret;
946 }
947
948 // Maximize the chain: for each tag add all tags, for which it is direct or indirect parent.
949 // Unlike other functions, this one accepts and returns a list of integer tag IDs, not
950 // a list of tag structures. Same structure (tag ID list) is returned after processing.
951 function complementByKids ($idlist, $tree = NULL, $getall = FALSE)
952 {
953 $self = __FUNCTION__;
954 global $tagtree;
955 if ($tree === NULL)
956 $tree = $tagtree;
957 $getallkids = $getall;
958 $ret = array();
959 foreach ($tree as $taginfo)
960 {
961 foreach ($idlist as $test_id)
962 if ($getall or $taginfo['id'] == $test_id)
963 {
964 $ret[] = $taginfo['id'];
965 // Once matched node makes all sub-nodes match, but don't make
966 // a mistake of matching every other node at the current level.
967 $getallkids = TRUE;
968 break;
969 }
970 if (isset ($taginfo['kids']))
971 $ret = array_merge ($ret, $self ($idlist, $taginfo['kids'], $getallkids));
972 $getallkids = FALSE;
973 }
974 return $ret;
975 }
976
977 // Universal autotags generator, a complementing function for loadEntityTags().
978 // An important extension is that 'ipaddress' quasi-realm is also handled.
979 // Bypass key isn't strictly typed, but interpreted depending on the realm.
980 function generateEntityAutoTags ($entity_realm = '', $bypass_value = '')
981 {
982 $ret = array();
983 switch ($entity_realm)
984 {
985 case 'rack':
986 $ret[] = array ('tag' => '$rackid_' . $bypass_value);
987 $ret[] = array ('tag' => '$any_rack');
988 break;
989 case 'object':
990 $oinfo = getObjectInfo ($bypass_value, FALSE);
991 $ret[] = array ('tag' => '$id_' . $bypass_value);
992 $ret[] = array ('tag' => '$typeid_' . $oinfo['objtype_id']);
993 $ret[] = array ('tag' => '$any_object');
994 if (validTagName ('$cn_' . $oinfo['name']))
995 $ret[] = array ('tag' => '$cn_' . $oinfo['name']);
996 if (!count (getResidentRacksData ($bypass_value, FALSE)))
997 $ret[] = array ('tag' => '$unmounted');
998 break;
999 case 'ipv4net':
1000 $netinfo = getIPv4NetworkInfo ($bypass_value);
1001 $ret[] = array ('tag' => '$ip4netid_' . $bypass_value);
1002 $ret[] = array ('tag' => '$ip4net-' . str_replace ('.', '-', $netinfo['ip']) . '-' . $netinfo['mask']);
1003 $ret[] = array ('tag' => '$any_ip4net');
1004 $ret[] = array ('tag' => '$any_net');
1005 break;
1006 case 'ipaddress':
1007 $netinfo = getIPv4NetworkInfo (getIPv4AddressNetworkId ($bypass_value));
1008 $ret[] = array ('tag' => '$ip4net-' . str_replace ('.', '-', $bypass_value) . '-32');
1009 $ret[] = array ('tag' => '$ip4net-' . str_replace ('.', '-', $netinfo['ip']) . '-' . $netinfo['mask']);
1010 $ret[] = array ('tag' => '$any_ip4net');
1011 $ret[] = array ('tag' => '$any_net');
1012 break;
1013 case 'ipv4vs':
1014 $ret[] = array ('tag' => '$ipv4vsid_' . $bypass_value);
1015 $ret[] = array ('tag' => '$any_ipv4vs');
1016 $ret[] = array ('tag' => '$any_vs');
1017 break;
1018 case 'ipv4rspool':
1019 $ret[] = array ('tag' => '$ipv4rspid_' . $bypass_value);
1020 $ret[] = array ('tag' => '$any_ipv4rsp');
1021 $ret[] = array ('tag' => '$any_rsp');
1022 break;
1023 case 'user':
1024 global $accounts;
1025 $ret[] = array ('tag' => '$username_' . $bypass_value);
1026 if (isset ($accounts[$bypass_value]['user_id']))
1027 $ret[] = array ('tag' => '$userid_' . $accounts[$bypass_value]['user_id']);
1028 break;
1029 case 'file':
1030 $ret[] = array ('tag' => '$fileid_' . $bypass_value);
1031 $ret[] = array ('tag' => '$any_file');
1032 break;
1033 default:
1034 break;
1035 }
1036 return $ret;
1037 }
1038
1039 // Check, if the given tag is present on the chain (will only work
1040 // for regular tags with tag ID set.
1041 function tagOnChain ($taginfo, $tagchain)
1042 {
1043 if (!isset ($taginfo['id']))
1044 return FALSE;
1045 foreach ($tagchain as $test)
1046 if ($test['id'] == $taginfo['id'])
1047 return TRUE;
1048 return FALSE;
1049 }
1050
1051 // Idem, but use ID list instead of chain.
1052 function tagOnIdList ($taginfo, $tagidlist)
1053 {
1054 if (!isset ($taginfo['id']))
1055 return FALSE;
1056 foreach ($tagidlist as $tagid)
1057 if ($taginfo['id'] == $tagid)
1058 return TRUE;
1059 return FALSE;
1060 }
1061
1062 // Return TRUE, if two tags chains differ (order of tags doesn't matter).
1063 // Assume, that neither of the lists contains duplicates.
1064 // FIXME: a faster, than O(x^2) method is possible for this calculation.
1065 function tagChainCmp ($chain1, $chain2)
1066 {
1067 if (count ($chain1) != count ($chain2))
1068 return TRUE;
1069 foreach ($chain1 as $taginfo1)
1070 if (!tagOnChain ($taginfo1, $chain2))
1071 return TRUE;
1072 return FALSE;
1073 }
1074
1075 // If the page-tab-op triplet is final, make $expl_tags and $impl_tags
1076 // hold all appropriate (explicit and implicit) tags respectively.
1077 // Otherwise some limited redirection is necessary (only page and tab
1078 // names are preserved, ophandler name change isn't handled).
1079 function fixContext ()
1080 {
1081 global
1082 $pageno,
1083 $tabno,
1084 $auto_tags,
1085 $expl_tags,
1086 $impl_tags,
1087 $target_given_tags,
1088 $user_given_tags,
1089 $page;
1090
1091 $pmap = array
1092 (
1093 'accounts' => 'userlist',
1094 'rspools' => 'ipv4rsplist',
1095 'rspool' => 'ipv4rsp',
1096 'vservices' => 'ipv4vslist',
1097 'vservice' => 'ipv4vs',
1098 );
1099 $tmap = array();
1100 $tmap['objects']['newmulti'] = 'addmore';
1101 $tmap['objects']['newobj'] = 'addmore';
1102 $tmap['object']['switchvlans'] = 'livevlans';
1103 $tmap['object']['slb'] = 'editrspvs';
1104 $tmap['object']['portfwrd'] = 'nat4';
1105 $tmap['object']['network'] = 'ipv4';
1106 if (isset ($pmap[$pageno]))
1107 redirectUser ($pmap[$pageno], $tabno);
1108 if (isset ($tmap[$pageno][$tabno]))
1109 redirectUser ($pageno, $tmap[$pageno][$tabno]);
1110
1111 // Don't reset autochain, because auth procedures could push stuff there in.
1112 // Another important point is to ignore 'user' realm, so we don't infuse effective
1113 // context with autotags of the displayed account and don't try using uint
1114 // bypass, where string is expected.
1115 if
1116 (
1117 $pageno != 'user' and
1118 isset ($page[$pageno]['bypass']) and
1119 isset ($_REQUEST[$page[$pageno]['bypass']])
1120 )
1121 $auto_tags = array_merge ($auto_tags, generateEntityAutoTags ($pageno, $_REQUEST[$page[$pageno]['bypass']]));
1122 if
1123 (
1124 isset ($page[$pageno]['bypass']) and
1125 isset ($page[$pageno]['bypass_type']) and
1126 $page[$pageno]['bypass_type'] == 'uint' and
1127 isset ($_REQUEST[$page[$pageno]['bypass']])
1128 )
1129 $target_given_tags = loadEntityTags ($pageno, $_REQUEST[$page[$pageno]['bypass']]);
1130 // Explicit and implicit chains should be normally empty at this point, so
1131 // overwrite the contents anyway.
1132 $expl_tags = mergeTagChains ($user_given_tags, $target_given_tags);
1133 $impl_tags = getImplicitTags ($expl_tags);
1134 }
1135
1136 // Take a list of user-supplied tag IDs to build a list of valid taginfo
1137 // records indexed by tag IDs (tag chain).
1138 function buildTagChainFromIds ($tagidlist)
1139 {
1140 global $taglist;
1141 $ret = array();
1142 foreach (array_unique ($tagidlist) as $tag_id)
1143 if (isset ($taglist[$tag_id]))
1144 $ret[] = $taglist[$tag_id];
1145 return $ret;
1146 }
1147
1148 // Process a given tag tree and return only meaningful branches. The resulting
1149 // (sub)tree will have refcnt leaves on every last branch.
1150 function getObjectiveTagTree ($tree, $realm)
1151 {
1152 $self = __FUNCTION__;
1153 $ret = array();
1154 foreach ($tree as $taginfo)
1155 {
1156 $subsearch = array();
1157 $pick = FALSE;
1158 if (count ($taginfo['kids']))
1159 {
1160 $subsearch = $self ($taginfo['kids'], $realm);
1161 $pick = count ($subsearch) > 0;
1162 }
1163 if (isset ($taginfo['refcnt'][$realm]))
1164 $pick = TRUE;
1165 if (!$pick)
1166 continue;
1167 $ret[] = array
1168 (
1169 'id' => $taginfo['id'],
1170 'tag' => $taginfo['tag'],
1171 'parent_id' => $taginfo['parent_id'],
1172 'refcnt' => $taginfo['refcnt'],
1173 'kids' => $subsearch
1174 );
1175 }
1176 return $ret;
1177 }
1178
1179 // Get taginfo record by tag name, return NULL, if record doesn't exist.
1180 function getTagByName ($target_name)
1181 {
1182 global $taglist;
1183 foreach ($taglist as $taginfo)
1184 if ($taginfo['tag'] == $target_name)
1185 return $taginfo;
1186 return NULL;
1187 }
1188
1189 // Merge two chains, filtering dupes out. Return the resulting superset.
1190 function mergeTagChains ($chainA, $chainB)
1191 {
1192 // $ret = $chainA;
1193 // Reindex by tag id in any case.
1194 $ret = array();
1195 foreach ($chainA as $tag)
1196 $ret[$tag['id']] = $tag;
1197 foreach ($chainB as $tag)
1198 if (!isset ($ret[$tag['id']]))
1199 $ret[$tag['id']] = $tag;
1200 return $ret;
1201 }
1202
1203 function getTagFilter ()
1204 {
1205 return isset ($_REQUEST['tagfilter']) ? complementByKids ($_REQUEST['tagfilter']) : array();
1206 }
1207
1208 function getTagFilterStr ($tagfilter = array())
1209 {
1210 $ret = '';
1211 foreach (getExplicitTagsOnly (buildTagChainFromIds ($tagfilter)) as $taginfo)
1212 $ret .= "&tagfilter[]=" . $taginfo['id'];
1213 return $ret;
1214 }
1215
1216 function buildWideRedirectURL ($log, $nextpage = NULL, $nexttab = NULL, $moreArgs = array())
1217 {
1218 global $root, $page, $pageno, $tabno;
1219 if ($nextpage === NULL)
1220 $nextpage = $pageno;
1221 if ($nexttab === NULL)
1222 $nexttab = $tabno;
1223 $url = "${root}?page=${nextpage}&tab=${nexttab}";
1224 if (isset ($page[$nextpage]['bypass']))
1225 $url .= '&' . $page[$nextpage]['bypass'] . '=' . $_REQUEST[$page[$nextpage]['bypass']];
1226
1227 if (count($moreArgs)>0)
1228 {
1229 foreach($moreArgs as $arg=>$value)
1230 {
1231 if (gettype($value) == 'array')
1232 {
1233 foreach ($value as $v)
1234 {
1235 $url .= '&'.urlencode($arg.'[]').'='.urlencode($v);
1236 }
1237 }
1238 else
1239 $url .= '&'.urlencode($arg).'='.urlencode($value);
1240 }
1241 }
1242
1243 $_SESSION['log'] = $log;
1244 return $url;
1245 }
1246
1247 function buildRedirectURL ($callfunc, $status, $args = array(), $nextpage = NULL, $nexttab = NULL)
1248 {
1249 global $pageno, $tabno, $msgcode;
1250 if ($nextpage === NULL)
1251 $nextpage = $pageno;
1252 if ($nexttab === NULL)
1253 $nexttab = $tabno;
1254 return buildWideRedirectURL (oneLiner ($msgcode[$callfunc][$status], $args), $nextpage, $nexttab);
1255 }
1256
1257 // Return an empty message log.
1258 function emptyLog ()
1259 {
1260 return array
1261 (
1262 'v' => 2,
1263 'm' => array()
1264 );
1265 }
1266
1267 // Return a message log consisting of only one message.
1268 function oneLiner ($code, $args = array())
1269 {
1270 $ret = emptyLog();
1271 $ret['m'][] = count ($args) ? array ('c' => $code, 'a' => $args) : array ('c' => $code);
1272 return $ret;
1273 }
1274
1275 function validTagName ($s, $allow_autotag = FALSE)
1276 {
1277 if (1 == mb_ereg (TAGNAME_REGEXP, $s))
1278 return TRUE;
1279 if ($allow_autotag and 1 == mb_ereg (AUTOTAGNAME_REGEXP, $s))
1280 return TRUE;
1281 return FALSE;
1282 }
1283
1284 function redirectUser ($p, $t)
1285 {
1286 global $page, $root;
1287 $l = "{$root}?page=${p}&tab=${t}";
1288 if (isset ($page[$p]['bypass']) and isset ($_REQUEST[$page[$p]['bypass']]))
1289 $l .= '&' . $page[$p]['bypass'] . '=' . $_REQUEST[$page[$p]['bypass']];
1290 header ("Location: " . $l);
1291 die;
1292 }
1293
1294 function getRackCodeStats ()
1295 {
1296 global $rackCode;
1297 $defc = $grantc = $modc = 0;
1298 foreach ($rackCode as $s)
1299 switch ($s['type'])
1300 {
1301 case 'SYNT_DEFINITION':
1302 $defc++;
1303 break;
1304 case 'SYNT_GRANT':
1305 $grantc++;
1306 break;
1307 case 'SYNT_CTXMOD':
1308 $modc++;
1309 break;
1310 default:
1311 break;
1312 }
1313 $ret = array
1314 (
1315 'Definition sentences' => $defc,
1316 'Grant sentences' => $grantc,
1317 'Context mod sentences' => $modc
1318 );
1319 return $ret;
1320 }
1321
1322 function getRackImageWidth ()
1323 {
1324 return 3 + getConfigVar ('rtwidth_0') + getConfigVar ('rtwidth_1') + getConfigVar ('rtwidth_2') + 3;
1325 }
1326
1327 function getRackImageHeight ($units)
1328 {
1329 return 3 + 3 + $units * 2;
1330 }
1331
1332 // Perform substitutions and return resulting string
1333 // used solely by buildLVSConfig()
1334 function apply_macros ($macros, $subject)
1335 {
1336 $ret = $subject;
1337 foreach ($macros as $search => $replace)
1338 $ret = str_replace ($search, $replace, $ret);
1339 return $ret;
1340 }
1341
1342 function buildLVSConfig ($object_id = 0)
1343 {
1344 if ($object_id <= 0)
1345 {
1346 showError ('Invalid argument', __FUNCTION__);
1347 return;
1348 }
1349 $oInfo = getObjectInfo ($object_id, FALSE);
1350 $lbconfig = getSLBConfig ($object_id);
1351 if ($lbconfig === NULL)
1352 {
1353 showError ('getSLBConfig() failed', __FUNCTION__);
1354 return;
1355 }
1356 $newconfig = "#\n#\n# This configuration has been generated automatically by RackTables\n";
1357 $newconfig .= "# for object_id == ${object_id}\n# object name: ${oInfo['name']}\n#\n#\n\n\n";
1358 foreach ($lbconfig as $vs_id => $vsinfo)
1359 {
1360 $newconfig .= "########################################################\n" .
1361 "# VS (id == ${vs_id}): " . (empty ($vsinfo['vs_name']) ? 'NO NAME' : $vsinfo['vs_name']) . "\n" .
1362 "# RS pool (id == ${vsinfo['pool_id']}): " . (empty ($vsinfo['pool_name']) ? 'ANONYMOUS' : $vsinfo['pool_name']) . "\n" .
1363 "########################################################\n";
1364 # The order of inheritance is: VS -> LB -> pool [ -> RS ]
1365 $macros = array
1366 (
1367 '%VIP%' => $vsinfo['vip'],
1368 '%VPORT%' => $vsinfo['vport'],
1369 '%PROTO%' => $vsinfo['proto'],
1370 '%VNAME%' => $vsinfo['vs_name'],
1371 '%RSPOOLNAME%' => $vsinfo['pool_name']
1372 );
1373 $newconfig .= "virtual_server ${vsinfo['vip']} ${vsinfo['vport']} {\n";
1374 $newconfig .= "\tprotocol ${vsinfo['proto']}\n";
1375 $newconfig .= apply_macros
1376 (
1377 $macros,
1378 lf_wrap ($vsinfo['vs_vsconfig']) .
1379 lf_wrap ($vsinfo['lb_vsconfig']) .
1380 lf_wrap ($vsinfo['pool_vsconfig'])
1381 );
1382 foreach ($vsinfo['rslist'] as $rs)
1383 {
1384 if (empty ($rs['rsport']))
1385 $rs['rsport'] = $vsinfo['vport'];
1386 $macros['%RSIP%'] = $rs['rsip'];
1387 $macros['%RSPORT%'] = $rs['rsport'];
1388 $newconfig .= "\treal_server ${rs['rsip']} ${rs['rsport']} {\n";
1389 $newconfig .= apply_macros
1390 (
1391 $macros,
1392 lf_wrap ($vsinfo['vs_rsconfig']) .
1393 lf_wrap ($vsinfo['lb_rsconfig']) .
1394 lf_wrap ($vsinfo['pool_rsconfig']) .
1395 lf_wrap ($rs['rs_rsconfig'])
1396 );
1397 $newconfig .= "\t}\n";
1398 }
1399 $newconfig .= "}\n\n\n";
1400 }
1401 // FIXME: deal somehow with Mac-styled text, the below replacement will screw it up
1402 return str_replace ("\r", '', $newconfig);
1403 }
1404
1405 // Indicate occupation state of each IP address: none, ordinary or problematic.
1406 function markupIPv4AddrList (&$addrlist)
1407 {
1408 foreach (array_keys ($addrlist) as $ip_bin)
1409 {
1410 $refc = array
1411 (
1412 'shared' => 0, // virtual
1413 'virtual' => 0, // loopback
1414 'regular' => 0, // connected host
1415 'router' => 0 // connected gateway
1416 );
1417 foreach ($addrlist[$ip_bin]['allocs'] as $a)
1418 $refc[$a['type']]++;
1419 $nvirtloopback = ($refc['shared'] + $refc['virtual'] > 0) ? 1 : 0; // modulus of virtual + shared
1420 $nreserved = ($addrlist[$ip_bin]['reserved'] == 'yes') ? 1 : 0; // only one reservation is possible ever
1421 $nrealms = $nreserved + $nvirtloopback + $refc['regular'] + $refc['router']; // latter two are connected and router allocations
1422
1423 if ($nrealms == 1)
1424 $addrlist[$ip_bin]['class'] = 'trbusy';
1425 elseif ($nrealms > 1)
1426 $addrlist[$ip_bin]['class'] = 'trerror';
1427 else
1428 $addrlist[$ip_bin]['class'] = '';
1429 }
1430 }
1431
1432 // Scan the given address list (returned by scanIPv4Space) and return a list of all routers found.
1433 function findRouters ($addrlist)
1434 {
1435 $ret = array();
1436 foreach ($addrlist as $addr)
1437 foreach ($addr['allocs'] as $alloc)
1438 if ($alloc['type'] == 'router')
1439 $ret[] = array
1440 (
1441 'id' => $alloc['object_id'],
1442 'iface' => $alloc['name'],
1443 'dname' => $alloc['object_name'],
1444 'addr' => $addr['ip']
1445 );
1446 return $ret;
1447 }
1448
1449 // Assist in tag chain sorting.
1450 function taginfoCmp ($tagA, $tagB)
1451 {
1452 return $tagA['ci'] - $tagB['ci'];
1453 }
1454
1455 // Compare networks. When sorting a tree, the records on the list will have
1456 // distinct base IP addresses.
1457 // "The comparison function must return an integer less than, equal to, or greater
1458 // than zero if the first argument is considered to be respectively less than,
1459 // equal to, or greater than the second." (c) PHP manual
1460 function IPv4NetworkCmp ($netA, $netB)
1461 {
1462 // There's a problem just substracting one u32 integer from another,
1463 // because the result may happen big enough to become a negative i32
1464 // integer itself (PHP tries to cast everything it sees to signed int)
1465 // The comparison below must treat positive and negative values of both
1466 // arguments.
1467 // Equal values give instant decision regardless of their [equal] sign.
1468 if ($netA['ip_bin'] == $netB['ip_bin'])
1469 return 0;
1470 // Same-signed values compete arithmetically within one of i32 contiguous ranges:
1471 // 0x00000001~0x7fffffff 1~2147483647
1472 // 0 doesn't have any sign, and network 0.0.0.0 isn't allowed
1473 // 0x80000000~0xffffffff -2147483648~-1
1474 $signA = $netA['ip_bin'] / abs ($netA['ip_bin']);
1475 $signB = $netB['ip_bin'] / abs ($netB['ip_bin']);
1476 if ($signA == $signB)
1477 {
1478 if ($netA['ip_bin'] > $netB['ip_bin'])
1479 return 1;
1480 else
1481 return -1;
1482 }
1483 else // With only one of two values being negative, it... wins!
1484 {
1485 if ($netA['ip_bin'] < $netB['ip_bin'])
1486 return 1;
1487 else
1488 return -1;
1489 }
1490 }
1491
1492 // Modify the given tag tree so, that each level's items are sorted alphabetically.
1493 function sortTree (&$tree, $sortfunc = '')
1494 {
1495 if (empty ($sortfunc))
1496 return;
1497 $self = __FUNCTION__;
1498 usort ($tree, $sortfunc);
1499 // Don't make a mistake of directly iterating over the items of current level, because this way
1500 // the sorting will be performed on a _copy_ if each item, not the item itself.
1501 foreach (array_keys ($tree) as $tagid)
1502 $self ($tree[$tagid]['kids'], $sortfunc);
1503 }
1504
1505 function iptree_fill (&$netdata)
1506 {
1507 if (!isset ($netdata['kids']) or empty ($netdata['kids']))
1508 return;
1509 // If we really have nested prefixes, they must fit into the tree.
1510 $worktree = array
1511 (
1512 'ip_bin' => $netdata['ip_bin'],
1513 'mask' => $netdata['mask']
1514 );
1515 foreach ($netdata['kids'] as $pfx)
1516 iptree_embed ($worktree, $pfx);
1517 $netdata['kids'] = iptree_construct ($worktree);
1518 $netdata['kidc'] = count ($netdata['kids']);
1519 }
1520
1521 function iptree_construct ($node)
1522 {
1523 $self = __FUNCTION__;
1524
1525 if (!isset ($node['right']))
1526 {
1527 if (!isset ($node['ip']))
1528 {
1529 $node['ip'] = long2ip ($node['ip_bin']);
1530 $node['kids'] = array();
1531 $node['kidc'] = 0;
1532 $node['name'] = '';
1533 }
1534 return array ($node);
1535 }
1536 else
1537 return array_merge ($self ($node['left']), $self ($node['right']));
1538 }
1539
1540 function iptree_embed (&$node, $pfx)
1541 {
1542 $self = __FUNCTION__;
1543
1544 // hit?
1545 if ($node['ip_bin'] == $pfx['ip_bin'] and $node['mask'] == $pfx['mask'])
1546 {
1547 $node = $pfx;
1548 return;
1549 }
1550 if ($node['mask'] == $pfx['mask'])
1551 {
1552 showError ('Internal error, the recurring loop lost control', __FUNCTION__);
1553 die;
1554 }
1555
1556 // split?
1557 if (!isset ($node['right']))
1558 {
1559 // Fill in db_first/db_last to make it possible to run scanIPv4Space() on the node.
1560 $node['left']['mask'] = $node['mask'] + 1;
1561 $node['left']['ip_bin'] = $node['ip_bin'];
1562 $node['left']['db_first'] = sprintf ('%u', $node['left']['ip_bin']);
1563 $node['left']['db_last'] = sprintf ('%u', $node['left']['ip_bin'] | binInvMaskFromDec ($node['left']['mask']));
1564
1565 $node['right']['mask'] = $node['mask'] + 1;
1566 $node['right']['ip_bin'] = $node['ip_bin'] + binInvMaskFromDec ($node['mask'] + 1) + 1;
1567 $node['right']['db_first'] = sprintf ('%u', $node['right']['ip_bin']);
1568 $node['right']['db_last'] = sprintf ('%u', $node['right']['ip_bin'] | binInvMaskFromDec ($node['right']['mask']));
1569 }
1570
1571 // repeat!
1572 if (($node['left']['ip_bin'] & binMaskFromDec ($node['left']['mask'])) == ($pfx['ip_bin'] & binMaskFromDec ($node['left']['mask'])))
1573 $self ($node['left'], $pfx);
1574 elseif (($node['right']['ip_bin'] & binMaskFromDec ($node['right']['mask'])) == ($pfx['ip_bin'] & binMaskFromDec ($node['left']['mask'])))
1575 $self ($node['right'], $pfx);
1576 else
1577 {
1578 showError ('Internal error, cannot decide between left and right', __FUNCTION__);
1579 die;
1580 }
1581 }
1582
1583 function treeApplyFunc (&$tree, $func = '', $stopfunc = '')
1584 {
1585 if (empty ($func))
1586 return;
1587 $self = __FUNCTION__;
1588 foreach (array_keys ($tree) as $key)
1589 {
1590 $func ($tree[$key]);
1591 if (!empty ($stopfunc) and $stopfunc ($tree[$key]))
1592 continue;
1593 $self ($tree[$key]['kids'], $func);
1594 }
1595 }
1596
1597 function loadIPv4AddrList (&$netinfo)
1598 {
1599 loadOwnIPv4Addresses ($netinfo);
1600 markupIPv4AddrList ($netinfo['addrlist']);
1601 }
1602
1603 function countOwnIPv4Addresses (&$node)
1604 {
1605 $toscan = array();
1606 $node['addrt'] = 0;
1607 $node['mask_bin'] = binMaskFromDec ($node['mask']);
1608 $node['mask_bin_inv'] = binInvMaskFromDec ($node['mask']);
1609 $node['db_first'] = sprintf ('%u', 0x00000000 + $node['ip_bin'] & $node['mask_bin']);
1610 $node['db_last'] = sprintf ('%u', 0x00000000 + $node['ip_bin'] | ($node['mask_bin_inv']));
1611 if (empty ($node['kids']))
1612 {
1613 $toscan[] = array ('i32_first' => $node['db_first'], 'i32_last' => $node['db_last']);
1614 $node['addrt'] = binInvMaskFromDec ($node['mask']) + 1;
1615 }
1616 else
1617 foreach ($node['kids'] as $nested)
1618 if (!isset ($nested['id'])) // spare
1619 {
1620 $toscan[] = array ('i32_first' => $nested['db_first'], 'i32_last' => $nested['db_last']);
1621 $node['addrt'] += binInvMaskFromDec ($nested['mask']) + 1;
1622 }
1623 // Don't do anything more, because the displaying function will load the addresses anyway.
1624 return;
1625 $node['addrc'] = count (scanIPv4Space ($toscan));
1626 }
1627
1628 function nodeIsCollapsed ($node)
1629 {
1630 return $node['symbol'] == 'node-collapsed';
1631 }
1632
1633 function loadOwnIPv4Addresses (&$node)
1634 {
1635 $toscan = array();
1636 if (empty ($node['kids']))
1637 $toscan[] = array ('i32_first' => $node['db_first'], 'i32_last' => $node['db_last']);
1638 else
1639 foreach ($node['kids'] as $nested)
1640 if (!isset ($nested['id'])) // spare
1641 $toscan[] = array ('i32_first' => $nested['db_first'], 'i32_last' => $nested['db_last']);
1642 $node['addrlist'] = scanIPv4Space ($toscan);
1643 $node['addrc'] = count ($node['addrlist']);
1644 }
1645
1646 function prepareIPv4Tree ($netlist, $expanded_id = 0)
1647 {
1648 $tree = treeFromList ($netlist); // medium call
1649 sortTree ($tree, 'IPv4NetworkCmp');
1650 // complement the tree before markup to make the spare networks have "symbol" set
1651 treeApplyFunc ($tree, 'iptree_fill');
1652 iptree_markup_collapsion ($tree, getConfigVar ('TREE_THRESHOLD'), $expanded_id);
1653 // count addresses after the markup to skip computation for hidden tree nodes
1654 treeApplyFunc ($tree, 'countOwnIPv4Addresses', 'nodeIsCollapsed');
1655 return $tree;
1656 }
1657
1658 // Check all items of the tree recursively, until the requested target id is
1659 // found. Mark all items leading to this item as "expanded", collapsing all
1660 // the rest, which exceed the given threshold (if the threshold is given).
1661 function iptree_markup_collapsion (&$tree, $threshold = 1024, $target = 0)
1662 {
1663 $self = __FUNCTION__;
1664 $ret = FALSE;
1665 foreach (array_keys ($tree) as $key)
1666 {
1667 $here = ($target === 'ALL' or ($target > 0 and isset ($tree[$key]['id']) and $tree[$key]['id'] == $target));
1668 $below = $self ($tree[$key]['kids'], $threshold, $target);
1669 if (!$tree[$key]['kidc']) // terminal node
1670 $tree[$key]['symbol'] = 'spacer';
1671 elseif ($tree[$key]['kidc'] < $threshold)
1672 $tree[$key]['symbol'] = 'node-expanded-static';
1673 elseif ($here or $below)
1674 $tree[$key]['symbol'] = 'node-expanded';
1675 else
1676 $tree[$key]['symbol'] = 'node-collapsed';
1677 $ret = ($ret or $here or $below); // parentheses are necessary for this to be computed correctly
1678 }
1679 return $ret;
1680 }
1681
1682 // Get a tree and target entity ID on it. Return the list of IDs, which make the path
1683 // from the target entity to tree root. If such a path exists, it will consist of at
1684 // least the target ID. Otherwise an empty list will be returned. The "list" is a randomly
1685 // indexed array of values.
1686 function traceEntity ($tree, $target_id)
1687 {
1688 $self = __FUNCTION__;
1689 foreach ($tree as $node)
1690 {
1691 if ($node['id'] == $target_id) // here!
1692 return array ($target_id);
1693 $subtrace = $self ($node['kids'], $target_id); // below?
1694 if (count ($subtrace))
1695 {
1696 array_push ($subtrace, $node['id']);
1697 return $subtrace;
1698 }
1699 // next...
1700 }
1701 return array();
1702 }
1703
1704 // Convert entity name to human-readable value
1705 function formatEntityName ($name) {
1706 switch ($name)
1707 {
1708 case 'ipv4net':
1709 return 'IPv4 Network';
1710 case 'ipv4rspool':
1711 return 'IPv4 RS Pool';
1712 case 'ipv4vs':
1713 return 'IPv4 Virtual Service';
1714 case 'object':
1715 return 'Object';
1716 case 'rack':
1717 return 'Rack';
1718 case 'user':
1719 return 'User';
1720 }
1721 return 'invalid';
1722 }
1723
1724 // Take a MySQL or other generic timestamp and make it prettier
1725 function formatTimestamp ($timestamp) {
1726 return date('n/j/y g:iA', strtotime($timestamp));
1727 }
1728
1729 // Display hrefs for all of a file's parents
1730 function serializeFileLinks ($links)
1731 {
1732 global $root;
1733
1734 $comma = '';
1735 $ret = '';
1736 foreach ($links as $link_id => $li)
1737 {
1738 switch ($li['entity_type'])
1739 {
1740 case 'ipv4net':
1741 $params = "page=ipv4net&id=";
1742 break;
1743 case 'ipv4rspool':
1744 $params = "page=ipv4rspool&pool_id=";
1745 break;
1746 case 'ipv4vs':
1747 $params = "page=ipv4vs&vs_id=";
1748 break;
1749 case 'object':
1750 $params = "page=object&object_id=";
1751 break;
1752 case 'rack':
1753 $params = "page=rack&rack_id=";
1754 break;
1755 case 'user':
1756 $params = "page=user&user_id=";
1757 break;
1758 }
1759 $ret .= sprintf("%s<a href='%s?%s%s'>%s</a>", $comma, $root, $params, $li['entity_id'], $li['name']);
1760 $comma = ', ';
1761 }
1762
1763 return $ret;
1764 }
1765
1766 // Convert filesize to appropriate unit and make it human-readable
1767 function formatFileSize ($bytes) {
1768 // bytes
1769 if($bytes < 1024) // bytes
1770 return "${bytes} bytes";
1771
1772 // kilobytes
1773 if ($bytes < 1024000)
1774 return sprintf ("%.1fk", round (($bytes / 1024), 1));
1775
1776 // megabytes
1777 return sprintf ("%.1f MB", round (($bytes / 1024000), 1));
1778 }
1779
1780 // Reverse of formatFileSize, it converts human-readable value to bytes
1781 function convertToBytes ($value) {
1782 $value = trim($value);
1783 $last = strtolower($value[strlen($value)-1]);
1784 switch ($last)
1785 {
1786 case 'g':
1787 $value *= 1024;
1788 case 'm':
1789 $value *= 1024;
1790 case 'k':
1791 $value *= 1024;
1792 }
1793
1794 return $value;
1795 }
1796
1797 function ip_quad2long ($ip)
1798 {
1799 return sprintf("%u", ip2long($ip));
1800 }
1801
1802 function ip_long2quad ($quad)
1803 {
1804 return long2ip($quad);
1805 }
1806
1807 function makeHref($params = array())
1808 {
1809 global $head_revision, $numeric_revision, $root;
1810 $ret = $root.'?';
1811 $first = true;
1812 if (!isset($params['r']) and ($numeric_revision != $head_revision))
1813 {
1814 $params['r'] = $numeric_revision;
1815 }
1816 foreach($params as $key=>$value)
1817 {
1818 if (!$first)
1819 $ret.='&';
1820 $ret .= urlencode($key).'='.urlencode($value);
1821 $first = false;
1822 }
1823 return $ret;
1824 }
1825
1826 function makeHrefProcess($params = array())
1827 {
1828 global $head_revision, $numeric_revision, $root, $pageno, $tabno;
1829 $ret = $root.'process.php'.'?';
1830 $first = true;
1831 if ($numeric_revision != $head_revision)
1832 {
1833 error_log("Can't make a process link when not in head revision");
1834 die();
1835 }
1836 if (!isset($params['page']))
1837 $params['page'] = $pageno;
1838 if (!isset($params['tab']))
1839 $params['tab'] = $tabno;
1840 foreach($params as $key=>$value)
1841 {
1842 if (!$first)
1843 $ret.='&';
1844 $ret .= urlencode($key).'='.urlencode($value);
1845 $first = false;
1846 }
1847 return $ret;
1848 }
1849
1850 function makeHrefForHelper ($helper_name, $params = array())
1851 {
1852 global $head_revision, $numeric_revision, $root;
1853 $ret = $root.'popup.php'.'?helper='.$helper_name;
1854 if ($numeric_revision != $head_revision)
1855 {
1856 error_log("Can't make a process link when not in head revision");
1857 die();
1858 }
1859 foreach($params as $key=>$value)
1860 $ret .= '&'.urlencode($key).'='.urlencode($value);
1861 return $ret;
1862 }
1863
1864 // Process the given list of records to build data suitable for printNiftySelect()
1865 // (like it was formerly executed by printSelect()). Screen out vendors according
1866 // to VENDOR_SIEVE, if object type ID is provided. However, the OPTGROUP with already
1867 // selected OPTION is protected from being screened.
1868 function cookOptgroups ($recordList, $object_type_id = 0, $existing_value = 0)
1869 {
1870 $ret = array();
1871 // Always keep "other" OPTGROUP at the SELECT bottom.
1872 $therest = array();
1873 foreach ($recordList as $dict_key => $dict_value)
1874 if (strpos ($dict_value, '%GSKIP%') !== FALSE)
1875 {
1876 $tmp = explode ('%GSKIP%', $dict_value, 2);
1877 $ret[$tmp[0]][$dict_key] = $tmp[1];
1878 }
1879 elseif (strpos ($dict_value, '%GPASS%') !== FALSE)
1880 {
1881 $tmp = explode ('%GPASS%', $dict_value, 2);
1882 $ret[$tmp[0]][$dict_key] = $tmp[1];
1883 }
1884 else
1885 $therest[$dict_key] = $dict_value;
1886 if ($object_type_id != 0)
1887 {
1888 $screenlist = array();
1889 foreach (explode (';', getConfigVar ('VENDOR_SIEVE')) as $sieve)
1890 if (FALSE !== mb_ereg ("^([^@]+)(@${object_type_id})?\$", trim ($sieve), $regs))
1891 $screenlist[] = $regs[1];
1892 foreach (array_keys ($ret) as $vendor)
1893 if (in_array ($vendor, $screenlist))
1894 {
1895 $ok_to_screen = TRUE;
1896 if ($existing_value)
1897 foreach (array_keys ($ret[$vendor]) as $recordkey)
1898 if ($recordkey == $existing_value)
1899 {
1900 $ok_to_screen = FALSE;
1901 break;
1902 }
1903 if ($ok_to_screen)
1904 unset ($ret[$vendor]);
1905 }
1906 }
1907 $ret['other'] = $therest;
1908 return $ret;
1909 }
1910
1911 function dos2unix ($text)
1912 {
1913 return str_replace ("\r\n", "\n", $text);
1914 }
1915
1916 function buildPredicateTable ($parsetree)
1917 {
1918 $ret = array();
1919 foreach ($parsetree as $sentence)
1920 if ($sentence['type'] == 'SYNT_DEFINITION')
1921 $ret[$sentence['term']] = $sentence['definition'];
1922 // Now we have predicate table filled in with the latest definitions of each
1923 // particular predicate met. This isn't as chik, as on-the-fly predicate
1924 // overloading during allow/deny scan, but quite sufficient for this task.
1925 return $ret;
1926 }
1927
1928 // Take a list of records and filter against given RackCode expression. Return
1929 // the original list intact, if there was no filter requested, but return an
1930 // empty list, if there was an error.
1931 function filterEntityList ($list_in, $realm, $expression = array())
1932 {
1933 if ($expression === NULL)
1934 return array();
1935 if (!count ($expression))
1936 return $list_in;
1937 global $rackCode;
1938 $list_out = array();
1939 foreach ($list_in as $item_key => $item_value)
1940 if (TRUE === judgeEntity ($realm, $item_key, $expression))
1941 $list_out[$item_key] = $item_value;
1942 return $list_out;
1943 }
1944
1945 // Tell, if the given expression is true for the given entity.
1946 function judgeEntity ($realm, $id, $expression)
1947 {
1948 $item_explicit_tags = loadEntityTags ($realm, $id);
1949 global $pTable;
1950 return eval_expression
1951 (
1952 $expression,
1953 array_merge
1954 (
1955 $item_explicit_tags,
1956 getImplicitTags ($item_explicit_tags),
1957 generateEntityAutoTags ($realm, $id)
1958 ),
1959 $pTable,
1960 TRUE
1961 );
1962 }
1963
1964 // If the requested predicate exists, return its [last] definition.
1965 // Otherwise return NULL (to signal filterEntityList() about error).
1966 // Also detect "not set" option selected.
1967 function interpretPredicate ($pname)
1968 {
1969 if ($pname == '_')
1970 return array();
1971 global $rackCode;
1972 $ret = NULL;
1973 foreach ($rackCode as $sentence)
1974 if ($sentence['type'] == 'SYNT_DEFINITION' and $sentence['term'] == $pname)
1975 $ret = $sentence['definition'];
1976 return $ret;
1977 }
1978
1979 // Tell, if a constraint from config option permits given record.
1980 function considerConfiguredConstraint ($entity_realm, $entity_id, $varname)
1981 {
1982 if (!strlen (getConfigVar ($varname)))
1983 return TRUE; // no restriction
1984 global $parseCache;
1985 if (!isset ($parseCache[$varname]))
1986 // getConfigVar() doesn't re-read the value from DB because of its
1987 // own cache, so there is no race condition here between two calls.
1988 $parseCache[$varname] = spotPayload (getConfigVar ($varname), 'SYNT_EXPR');
1989 if ($parseCache[$varname]['result'] != 'ACK')
1990 return FALSE; // constraint set, but cannot be used due to compilation error
1991 return judgeEntity ($entity_realm, $entity_id, $parseCache[$varname]['load']);
1992 }
1993
1994 ?>