File: example1.c.txt

package info (click to toggle)
gridengine 6.2-4
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 51,532 kB
  • ctags: 51,172
  • sloc: ansic: 418,155; java: 37,080; sh: 22,593; jsp: 7,699; makefile: 5,292; csh: 4,244; xml: 2,901; cpp: 2,086; perl: 1,895; tcl: 1,188; lisp: 669; ruby: 642; yacc: 393; lex: 266
file content (621 lines) | stat: -rw-r--r-- 19,784 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
/*************************************************************************"
 * "
 *  The Contents of this file are made available subject to the terms of"
 *  the Sun Industry Standards Source License Version 1.2"
 * "
 *  Sun Microsystems Inc., March, 2001"
 * "
 * "
 *  Sun Industry Standards Source License Version 1.2"
 *  ================================================="
 *  The contents of this file are subject to the Sun Industry Standards"
 *  Source License Version 1.2 (the \"License\"); You may not use this file"
 *  except in compliance with the License. You may obtain a copy of the"
 *  License at http://gridengine.sunsource.net/Gridengine_SISSL_license.html"
 * "
 *  Software provided under this License is provided on an \"AS IS\" basis,"
 *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,"
 *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,"
 *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING."
 *  See the License for the specific provisions governing your rights and"
 *  obligations concerning the Software."
 * "
 *   The Initial Developer of the Original Code is: Sun Microsystems, Inc."
 * "
 *   Copyright: 2001 by Sun Microsystems, Inc."
 * "
 *   All Rights Reserved."
 * "
 ************************************************************************/"

#define MAINPROGRAM

#include <stdio.h>

/* REMOTE MONITORING SUPPORT ? */
/* #define COD_COMPILE_DEBUG */
#include "codrmon.h"

/* THIS ARE ALL PUBLIC LIST LIB HEADERS, YOU'LL NEED IT */
#include "cull.h" 

/* THIS ARE THE LIST STRUCTURE DEFINITIONS AND THE NAMESPACES */
#include "example1.h"

/* DIRECTORY CONTAINING DATA FILES */
#define DATA_DIR "../cull/data/"


/* CREATE SOME LISTS ( HOST, QUEUE, OWNER )*/

lList *buildHostList PR_(( void ))
{
   
   lList *hostlist;
   lListElem *element;

   hostlist = lCreateList("hostlist", HostT);

   /*
      Now we create elements, change their initial 
      values and append them to the list.  
   */
   element = lCreateElem(HostT);
   lSetString( element, H_hostname, "balin" );
   lSetString( element, H_arch, "sun4" );
   lSetString( element, H_os, "SunOS 4.1.2" );
   lSetUlong( element, H_memsize, 16 );
   lAppendElem( hostlist, element );
   
   element = lCreateElem(HostT);
   lSetString( element, H_hostname, "legolas" );
   lSetString( element, H_arch, "alpha" );
   lSetString( element, H_os, "OSF/1 3.02" );
   lSetUlong( element, H_memsize, 64 );
   lAppendElem( hostlist, element );
   
   element = lCreateElem(HostT);
   lSetString( element, H_hostname, "bilbo" );
   lSetString( element, H_arch, "sgi" );
   lSetString( element, H_os, "IRIX 4" );
   lSetUlong( element, H_memsize, 16 );
   lAppendElem( hostlist, element );
   
   element = lCreateElem(HostT);
   lSetString( element, H_hostname, "sam" );
   lSetString( element, H_arch, "i386" );
   lSetString( element, H_os, "Linux" );
   lSetUlong( element, H_memsize, 128 );
   lAppendElem( hostlist, element );
   
   return hostlist;
} 


lList *buildQueueList PR_((void))
{
   lList *queuelist=NULL;
   lListElem *element;
   
   queuelist = lCreateList("queuelist", QueueT );

   /*
      Now we create elements, change their initial 
      values and append them to the list.  
   */
   element = lCreateElem(QueueT);
   lSetString( element, Q_name, "balin.q" );
   lSetString( element, Q_hostname, "balin" );
   lSetInt( element, Q_load, 2 );
   /*
      The member Q_ownerlist is initialized with NULL, 
      no changes are needed right now.
   */
   lAppendElem( queuelist, element );
   
   element = lCreateElem(QueueT);
   lSetString( element, Q_name, "durin.q" );
   lSetString( element, Q_hostname, "durin" );
   lSetInt( element, Q_load, 7 );
   lAppendElem( queuelist, element );
   
   element = lCreateElem(QueueT);
   lSetString( element, Q_name, "gloin.q" );
   lSetString( element, Q_hostname, "gloin" );
   lSetInt( element, Q_load, 23 );
   lAppendElem( queuelist, element );
   
   element = lCreateElem(QueueT);
   lSetString( element, Q_name, "legolas.q" );
   lSetString( element, Q_hostname, "legolas" );
   lSetInt( element, Q_load, 4 );
   lAppendElem( queuelist, element );
   
   return queuelist;
}


lList *buildOwnerListA PR_((void))
{
   lList *ownerlist=NULL;
   lListElem *owner;

   ownerlist = lCreateList("ownerlistA",OwnerT);

   owner = lCreateElem(OwnerT);
   lSetString(owner, O_owner, "Anton");
   lSetString(owner, O_group, "Tennis");
   lAppendElem(ownerlist, owner);

   
   owner = lCreateElem(OwnerT);
   lSetString(owner, O_owner, "Berta");
   lSetString(owner, O_group, "Basketball");
   lAppendElem(ownerlist, owner);

   return ownerlist;
}


lList *buildOwnerListB PR_((void))
{
   lList *ownerlist=NULL;
   lListElem *owner;

   ownerlist = lCreateList("ownerlistB",OwnerT);

   owner = lCreateElem(OwnerT);
   lSetString(owner, O_owner, "Christian");
   lSetString(owner, O_group, "Tennis");
   lAppendElem(ownerlist, owner);

   return ownerlist;
}


lList *buildOwnerListC PR_((void))
{
   lList *ownerlist=NULL;
   lListElem *owner;

   ownerlist = lCreateList("ownerlistC",OwnerT);

   owner = lCreateElem(OwnerT);
   lSetString(owner, O_owner, "Anton");
   lSetString(owner, O_group, "Golf");
   lAppendElem(ownerlist, owner);

   return ownerlist;
}


void usage PR_((void))
{
   printf("example1 0\t Scenario: JOIN\n");
   printf("example1 1\t Scenario: SELECT\n");
   printf("example1 2\t Scenario: SORT\n");
   printf("example1 3\t Scenario: SELECTSUB\n");
   printf("example1 4\t Scenario: JOINSUB\n");
   printf("example1 5\t Scenario: CHANGE\n");
   printf("example1 6\t Scenario: UNDUMP\n");

   exit(-1);
}

/* for this monster see proto.h */
#ifdef USE_STDARGS
int main( int argc, char *argv[] )
#else
int main(argc, argv)
int argc;
char *argv[];
#endif
{
   enum { JOIN, SELECT, SORT, SELECTSUB, JOINSUB, CHANGE, UNDUMP };
   int scene, i;
   
   lList          *hostlist=NULL,
                  *queuelist=NULL,
                  *joinedlist=NULL,
                  *joinedsublist=NULL, 
                  *selectedlist=NULL,
                  *ownerlist[3];  
                  
	FILE           *fp;
   
   lListElem      *element;
   
   lCondition     *where=NULL, 
                  *subwhere=NULL;
                  
   lEnumeration   *what=NULL;
   
   lEnumeration 	*allHostFields	=NULL, 
						*allQueueFields=NULL, 
						*allOwnerFields=NULL;

   /* monitoring macros */
   DENTER_MAIN(TOP_LAYER, "example1");

   /* WHICH SCENARIO SHALL I USE ? */
   if ( argc != 2 )
      usage();
   sscanf( argv[1], "%d", &scene );

   /* INITIALIZE FIELDID TO FIELDNAME STRING CONVERSION */
   lInit(nmv);   /* nmv is the lNameSpace array address */
                 /* see example1.h                      */

   /* 
      the what structures are typespecific,
      even if we want all fields
   */
	allHostFields 	= lWhat( "%T(ALL)", HostT ); 
	allQueueFields = lWhat( "%T(ALL)", QueueT ); 
	allOwnerFields = lWhat( "%T(ALL)", OwnerT); 

   printf("\n\n\n");
   
   switch ( scene ) {
      /* 
         JOIN TWO LISTS CONNECTED BY A COMMON JOINFIELD TO A NEW 
         LIST CONTAINING INFORMATION OF BOTH ORIGINAL LISTS
      */
      case JOIN:
         
         /* build a host- and a queuelist and write them to stdout */
         hostlist = buildHostList();
         printf("\n\nHOSTLIST\n\n");
         lWriteList( hostlist );

         queuelist = buildQueueList();
         printf("\n\nQUEUELIST\n\n");
         lWriteList( queuelist );

         /*
            The lJoin() function gets normally two conditions and 
            two field enumerations to select the list elements and
            the fields which will appear in the resulting list.  
            If we set a condition to NULL, this means that all elements 
            fulfilling the joincondition (here: H_hostname == Q_hostname) 
            are returned.  
            With 'allHostFields' and 'allQueueFields' we get every field
            of both lists (Normally you keep only one of the join fields
            i.e. either Q_hostname or H_hostname)
         */

         joinedlist = lJoin( "joinedList", 
								H_hostname, hostlist, NULL, allHostFields, 
								Q_hostname, queuelist, NULL, allQueueFields);
				
         /* print the result */
         printf("\n\nJOINED LIST\ncommon fields are "
                "H_hostname and Q_hostname\n\n");
         lWriteList( joinedlist );

         /* here we open a dump file to write the result to disk */
			if ( !(fp = fopen(DATA_DIR "dump.dmp","w"))) {
				printf("unable to open dump.dmp for write access\n");
				break;
			}
			if ( lDumpList(fp, joinedlist, 0)==EOF ) {
				printf("unable to dump into dump.dmp\n");
				break;
			}
			fclose( fp );
				
         break;

      case SELECT:
         /*
            WITH THE lSelect FUNCTION WE CAN EXTRACT THOSE
            ELEMENTS OF A LIST THAT FULFILL A CERTAIN
            CONDITION. THE CONDITION IS SPECIFIED IN A
            where STRUCTURE AND HANDED OVER TO lSelect.
         */

         /* build a queuelist and write it to stdout */
         queuelist = buildQueueList();
         printf("\n\nQUEUELIST\n\n");
         lWriteList( queuelist );

         /*
            The where structure chooses certain rows and the 
            what structure certain columns, if we speak in terms of 
            databases.
            The where structure is build by the lWhere function and the 
            what structure by the lWhat function.
            With lWhat you select the fields to be kept in the
            list elements. 
            The syntax is explained in the manpages lWhere(3),lWhat(3).
            In the following example the where structure states:
            Get The elements from the queuelist that do not
            fulfill the condition (Q_load < 12 and Q_Hostname != durin).
            In the what structure we select the fields Q_load, Q_name,
            Q_hostname from a list element of type QueueT.
       */
         where = lWhere("%T(!(%I < %d && %I != %s)) ", QueueT, 
					Q_load, 12, Q_hostname, "durin" );
         what = lWhat(" %T( %I %I %I )", QueueT, Q_load, Q_name, Q_hostname);

         selectedlist = lSelect("selectedlist", queuelist, where, what);

         /* release memory */
         lFreeWhere(where);
         lFreeWhat(what);

         /* Show the result */
         printf("\n\nREDUCED SELECTED QUEUELIST\n" 
                  "only the fields Q_load, Q_name" 
                  "and Q_hostname are selected\n"
                  "condition for selection is NOT(Q_load < 12 && "
                  "Q_hostname != \"durin\")\n\n");
         lWriteList(selectedlist);

         break;

      case SORT:
         /*
            THE lSort FUNCTION ALLOWS THE SORTING OF A LIST
         */

         /* create the list and write it to stdout */
         hostlist = buildHostList();
         printf("\n\nHOSTLIST\n\n");
         lWriteList( hostlist );

         /* 
            Show the changed list ordered by H_memsize  (- = descending) 
            After sorting the unsorted list no longer exists.
            The lSortOrder formatstring specifies the keyfields as in lWhat 
            or lWhere with a minus/plus sign for ascending/descending sort 
            order appended.
            The leftmost sort criterion is the most important.
            The following ones are weighted from left to right.
         */
         lSortList(hostlist,"%I+%I-",H_hostname,H_memsize); 
         
         printf("\n\nHOSTLIST SORTED ASCENDING BY %s, DESCENDING BY %s\n\n", 
                       lNm2Str(H_hostname), lNm2Str(H_memsize));
         lWriteList(hostlist);

         break;

      case SELECTSUB:
         /*
            SELECT SPECIFYING CRITERIA FOR A SUBLIST
         */

         /* build and write the lists */
         ownerlist[0] = buildOwnerListA();
         ownerlist[1] = buildOwnerListB();
         ownerlist[2] = buildOwnerListC();
         /* Write the three ownerlists */
         for(i=0; i<3; i++) {
            printf("OWNERLIST %c\n",'A'+i);
            lWriteList(ownerlist[i]);
         }

         queuelist = buildQueueList();
         printf("\n\nORIGINAL QUEUELIST WITHOUT OWNERLISTS\n\n");
         lWriteList(queuelist);
         /* 
            Change the queuelist.ownerlist field where 
            Q_hostname == "gloin"  (first matching element only)
         */
         where = lWhere("%T(%I == %s)",QueueT, Q_hostname, "gloin");
         element = lFindFirst(queuelist,where);
         lSetList(element,Q_ownerlist,lCopyList("ownerlist0", 
                     ownerlist[0]));
         lFreeWhere(where);

         /* 
            Change the queuelist.ownerlist field where 
            Q_hostname == "legolas" (first matching element only)
         */
         where = lWhere("%T(%I == %s)",QueueT,Q_hostname,"legolas");
         element = lFindFirst(queuelist,where);
         lSetList(element,Q_ownerlist,lCopyList("ownerlist1", 
                     ownerlist[1]));
         lFreeWhere(where);

         /* 
            Change the queuelist.ownerlist field where 
            Q_hostname == "durin" (first matching element only)
         */
         where = lWhere("%T(%I == %s)",QueueT ,Q_hostname,"durin");
         element = lFindFirst(queuelist,where);
         lSetList(element,Q_ownerlist,lCopyList("ownerlist2", 
                     ownerlist[2]));
         lFreeWhere(where);

         printf("\n\nQUEUELIST WITH OWNERLISTS\n\n");
         lWriteList(queuelist);
         /* 
            Select the elements which contain in the owner sublist 
            owner "Anton" 
         */
         where = lWhere("%T(!(%I == %s) || %I != %s && %I -> %T(%I == %s))", 
                        QueueT, Q_hostname, "legolas", Q_hostname, "gloin",  
                        Q_ownerlist, OwnerT, O_owner,"Anton"); 
         what = lWhat( "%T(ALL)", QueueT);
         
         selectedlist = lSelect("selectedlist",queuelist,where,what);

         printf("\n\nQUEUELIST ELEMENTS WHERE:\n");
         lWriteWhere( where );
         printf("\n\n");
         lWriteList(selectedlist);

         /* release memory */
         lFreeWhere(where);
         lFreeWhat(what);

         /* dump the resulting list to file */
         if ( !(fp = fopen(DATA_DIR "dump.dmp","w"))) {
            printf("unable to open dump.dmp for write access\n");
            break;
         }
         if ( lDumpList(fp, selectedlist, 0)==EOF ) {
            printf("unable to dump into dump.dmp\n");
            break;
         }
         fclose( fp );

         break;

      case JOINSUB:
         /*
            JOIN A LIST WITH ONE OF ITS SUBLISTS, THIS GENERATES
            ADDITIONAL ELEMENTS IN THE MAIN LIST BUT THE SUBLIST
            CAN BE REMOVED. SO THE DEPTH OF A LIST STRUCTURE IS 
            REDUCED.
            CONDITIONS CAN BE SPECIFIED FOR THE MAIN AND THE 
            SUBLIST.
         */

         /* build the lists and write them */
         ownerlist[0] = buildOwnerListA();
         ownerlist[1] = buildOwnerListB();
         ownerlist[2] = buildOwnerListC();
         /* Write the three ownerlists */
         for(i=0; i<3; i++) {
            printf("OWNERLIST %c\n",'A'+i);
            lWriteList(ownerlist[i]);
         }
         queuelist = buildQueueList();
         printf("\n\nORIGINAL QUEUELIST WITHOUT OWNERLISTS\n\n");
         lWriteList(queuelist);
         /* 
            Change the queuelist.ownerlist field where 
            Q_hostname == "gloin" 
         */
         where = lWhere("%T(%I == %s)",QueueT,Q_hostname,"gloin");
         element = lFindFirst(queuelist,where);
         lSetList(element,Q_ownerlist,lCopyList("ownerlist0", 
                     ownerlist[0]));
         lFreeWhere(where);
         /* 
            Change the queuelist.ownerlist field where 
            Q_hostname == "legolas" 
         */
         where = lWhere("%T(%I == %s)",QueueT,Q_hostname,"legolas");
         element = lFindFirst(queuelist,where);
         lSetList(element,Q_ownerlist,lCopyList("ownerlist1", 
                     ownerlist[1]));
         lFreeWhere(where);
         /*
            Change the queuelist.ownerlist field where 
            Q_hostname == "durin" 
         */
         where = lWhere("%T(%I == %s)",QueueT,Q_hostname,"durin");
         element = lFindFirst(queuelist,where);
         lSetList(element,Q_ownerlist,lCopyList("ownerlist2", 
                        ownerlist[2]));
         lFreeWhere(where);

         /* 
            Select the elements which contain in the ownerlist 
            owner "Anton" 
         */
         printf("\n\nQUEUELIST WITH OWNERLISTS\n\n");
         lWriteList(queuelist);

         if ( !(where = lWhere("%T(%I->%T(%I == %s))",QueueT,Q_ownerlist,
                        OwnerT,O_owner,"Anton"))){
            printf("lWhere failure\n");
            exit(-1);
         }
         if ( !(subwhere = lWhere("%T(%I == %s)",OwnerT,O_owner,"Anton"))){
            printf("lWhere failure\n");
            exit(-1);
         }
         /* Q_ownerlist is removed, so we have a flat list */
         if ( !(what = lWhat("%T( %I %I %I )", QueueT, Q_name, 
                  Q_hostname, Q_load))) {
            printf("lWhat failure\n");
            exit(-1);
         }

         joinedsublist = lJoinSublist("joinedsublist", Q_ownerlist, 
                                          queuelist, where, what,
                                          OwnerT, subwhere, allOwnerFields);

         printf("\n\nQUEUELIST JOINED WITH SUBLIST OWNERLIST\n");
         lWriteWhere( where );
         printf("\n");
         lWriteWhere( subwhere );
         printf("\n\n");
         lWriteList(joinedsublist);

         /* release memory */
         lFreeWhere(where);
         lFreeWhere(subwhere);
         lFreeWhat(what);
         
         break;

      case CHANGE:
         /*
            CHANGE THE VALUES OF LIST ELEMENT FIELDS
         */

         /* build lists and show them */
         hostlist = buildHostList();
         printf("\n\nHOSTLIST\n\n");
         lWriteList( hostlist );

         if ( !(where = lWhere("%T( %I == %s )", HostT, H_os, 
                                    "SunOS 4.1.2"))){
            printf("lWhere failure\n");
            exit(-1);
         }
         
         /* Change every element containing H_os = 'SunOS 4.1.2' */
         for ( element=lFindFirst(hostlist, where); element; 
                  element=lFindNext(element, where)) 
            lSetString( element, H_os, "SunOS 4.2.1");
         /* free memory */
         lFreeWhere(where);

         /* show result */
         printf("\n\nCHANGED HOSTLIST\n"
                  "H_os changed from SunOS 4.1.2 to SunOS 4.2.1\n\n");
         lWriteList( hostlist );

         break;
      
      case UNDUMP:
         /*
            GET A DUMPED LIST FROM DISK BACK INTO MEMORY
            IT IS POSSIBLE TO SPECIFY A NEW DESCRIPTOR,
            IF THE DIFFERENCES ARE NOT ACCEPTABLE THE 
            FUNCTION FAILS OTHERWISE WARNINGS ARE DISPLAYED
         */
         /* open dump file and read information */
         fp = fopen(DATA_DIR "dump.dmp","r");
         joinedlist = lUndumpList(fp, NULL, QueueT);
         fclose(fp);

         /* show the undumped list */
         lWriteList(joinedlist);
         
         break;

      default:
         printf("Not allowed\n");   
   }

   /* clean the house */
   if ( hostlist ) lFreeList( hostlist );
   if ( queuelist ) lFreeList( queuelist );
   if ( joinedlist ) lFreeList( joinedlist );
   if ( selectedlist ) lFreeList( selectedlist );

   if ( allHostFields ) lFreeWhat( allHostFields ); 	
   if ( allQueueFields ) lFreeWhat( allQueueFields );
   if ( allOwnerFields ) lFreeWhat( allOwnerFields );

   DCLOSE;
   return 0;
}