~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

Linux Cross Reference
Tina6/tina-libs/tina/sys/sysLst_util.c

Version: ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /**********
  2  * 
  3  * Copyright (c) 2003, Division of Imaging Science and Biomedical Engineering,
  4  * University of Manchester, UK.  All rights reserved.
  5  * 
  6  * Redistribution and use in source and binary forms, with or without modification, 
  7  * are permitted provided that the following conditions are met:
  8  * 
  9  *   . Redistributions of source code must retain the above copyright notice, 
 10  *     this list of conditions and the following disclaimer.
 11  *    
 12  *   . Redistributions in binary form must reproduce the above copyright notice,
 13  *     this list of conditions and the following disclaimer in the documentation 
 14  *     and/or other materials provided with the distribution.
 15  * 
 16  *   . Neither the name of the University of Manchester nor the names of its
 17  *     contributors may be used to endorse or promote products derived from this 
 18  *     software without specific prior written permission.
 19  * 
 20  * 
 21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
 23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 
 25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
 29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 31  * POSSIBILITY OF SUCH DAMAGE.
 32  *
 33  **********
 34  * 
 35  * Program :    TINA
 36  * File    :  $Source: /home/tina/cvs/tina-libs/tina/sys/sysLst_util.c,v $
 37  * Date    :  $Date: 2003/09/22 16:09:02 $
 38  * Version :  $Revision: 1.3 $
 39  * CVS Id  :  $Id: sysLst_util.c,v 1.3 2003/09/22 16:09:02 tony Exp $
 40  *
 41  * Notes :
 42  *
 43  *  List (List ) handling (extra utilities).
 44  * 
 45  *********
 46 */
 47 
 48 #include "sysLst_util.h"
 49 
 50 #if HAVE_CONFIG_H
 51   #include <config.h>
 52 #endif
 53 
 54 #include <stdio.h>
 55 #include <tina/sys/sys_LstDef.h>
 56 
 57 
 58 int list_length(List * list)
 59 {
 60         int count;
 61         List *ptr;
 62 
 63         for (ptr = list, count = 0; ptr != NULL; ptr = ptr->next, ++count);
 64         return (count);
 65 }
 66 
 67 int dd_list_length(List * list)
 68 {
 69         int count;
 70         List *ptr;
 71 
 72         for (ptr = list, count = 0; ptr != NULL; ptr = ptr->next, ++count);
 73         return (count);
 74 }
 75 
 76 int ddstr_length(List * start, List * end)
 77 {
 78         int count;
 79         List *ptr;
 80 
 81         for (ptr = start, count = 0; ptr != end; ptr = ptr->next, ++count);
 82         if (end != NULL)
 83                 ++count;
 84         return (count);
 85 }
 86 
 87 void proplist_pprint(FILE * fp, List * plist)
 88 {
 89         List *ptr;
 90         Prop *prop;
 91 
 92         (void) fprintf(fp, "Begin proplist:\n");
 93         for (ptr = plist; ptr != NULL; ptr = ptr->next)
 94         {
 95                 prop = (Prop *) ptr->to;
 96                 /*(void) fprintf(fp, "type %ld ptr %ld\n", (int)prop->type, (int) prop->to);*/
 97                 (void) fprintf(fp, "type %ld ptr %ld\n", (long int)prop->type, (long int) prop->to); /*JD, 2015.01.27*/
 98         }
 99         (void) fprintf(fp, "End proplist:\n");
100 }
101 
102 List *list_nth(List * list, int n)
103 {
104         int count;
105         List *ptr;
106 
107         for (ptr = list, count = 0; count < n; ptr = ptr->next, ++count);
108         return (ptr);
109 }
110 
111 List *ddlist_nth(List * ddlist, int n)
112 {
113         int count;
114         List *ptr;
115 
116         for (ptr = ddlist, count = 0; count < n; ptr = ptr->next, ++count);
117         return (ptr);
118 }
119 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.