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