2 ** Splint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2003 University of Virginia,
4 ** Massachusetts Institute of Technology
6 ** This program is free software; you can redistribute it and/or modify it
7 ** under the terms of the GNU General Public License as published by the
8 ** Free Software Foundation; either version 2 of the License, or (at your
9 ** option) any later version.
11 ** This program is distributed in the hope that it will be useful, but
12 ** WITHOUT ANY WARRANTY; without even the implied warranty of
13 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 ** General Public License for more details.
16 ** The GNU General Public License is available from http://www.gnu.org/ or
17 ** the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
18 ** MA 02111-1307, USA.
20 ** For information on splint: info@splint.org
21 ** To report a bug: splint-bug@splint.org
22 ** For more information: http://www.splint.org
25 ** uentryList.c (from slist_template.c)
28 # include "splintMacros.nf"
31 /*@only@*/ /*@notnull@*/ uentryList
34 uentryList s = (uentryList) dmalloc (sizeof (*s));
37 s->nspace = uentryListBASESIZE;
38 s->elements = (uentry *)
39 dmalloc (sizeof (*s->elements) * uentryListBASESIZE);
46 uentryList_single (/*@keep@*/ uentry el)
48 uentryList s = (uentryList) dmalloc (sizeof (*s));
51 s->nspace = uentryListBASESIZE - 1;
52 s->elements = (uentry *) dmalloc (sizeof (*s->elements) * uentryListBASESIZE);
61 uentryList_grow (uentryList s)
66 llassert (!uentryList_isUndefined (s));
68 s->nspace += uentryListBASESIZE;
70 newelements = (uentry *) dmalloc (sizeof (*newelements)
71 * (s->nelements + s->nspace));
73 for (i = 0; i < s->nelements; i++)
75 newelements[i] = s->elements[i];
79 s->elements = newelements;
82 void uentryList_clear (uentryList s)
84 if (uentryList_isUndefined (s))
90 s->nspace += s->nelements;
95 uentryList uentryList_add (uentryList s, /*@keep@*/ uentry el)
97 if (uentryList_isUndefined (s))
99 s = uentryList_new ();
106 s->elements[s->nelements] = el;
113 uentryList_unparse (uentryList s)
115 cstring st = cstring_undefined;
118 if (uentryList_isDefined (s))
120 for (i = 0; i < uentryList_size (s); i++)
124 st = message ("%q;", uentry_unparse (s->elements[i]));
127 st = message ("%q %q;", st, uentry_unparse (s->elements[i]));
134 /*@unused@*/ /*@only@*/ cstring
135 uentryList_unparseFull (uentryList s)
137 cstring st = cstring_undefined;
140 if (uentryList_isDefined (s))
142 for (i = 0; i < uentryList_size (s); i++)
146 st = message ("%q;", uentry_unparseFull (s->elements[i]));
150 st = message ("%q %q;", st, uentry_unparseFull (s->elements[i]));
158 cstring uentryList_unparseParams (uentryList s)
161 cstring st = cstring_undefined;
164 if (uentryList_isUndefined (s))
168 else if (uentryList_isVoid (s))
170 return (cstring_makeLiteral ("void"));
174 for (i = 0; i < uentryList_size (s); i++)
178 st = message ("%s", ctype_unparse (uentry_getType (s->elements[i])));
182 st = message ("%q, %s", st, ctype_unparse (uentry_getType (s->elements[i])));
190 bool uentryList_matchParams (uentryList p1, uentryList p2, bool force, bool arg)
192 int sz1 = uentryList_size (p1);
193 int sz2 = uentryList_size (p2);
196 if (p1 == p2) return TRUE;
198 if (uentryList_isMissingParams (p1) || uentryList_isMissingParams (p2))
206 for (i = 0; i < sz1; i++)
208 if (!ctype_genMatch (uentry_getType (p1->elements[i]),
209 uentry_getType (p2->elements[i]),
210 force, arg, FALSE, FALSE))
220 uentryList_unparseAbbrev (uentryList p)
223 cstring s = cstring_undefined;
226 if (uentryList_isUndefined (p))
229 if (uentryList_size (p) == 0)
230 return cstring_makeLiteral ("void");
232 for (i = 0; i < p->nelements && i < uentryList_abbrevBreadth; i++)
236 s = message ("%q;", uentry_unparseAbbrev (p->elements[i]));
241 s = message ("%q %q;", s, uentry_unparseAbbrev (p->elements[i]));
245 if (i != uentryList_size (p))
246 s = message ("%q, ...", s);
252 uentryList_lookupDirectName (uentryList s, cstring name)
254 if (uentryList_isDefined (s))
258 for (i = 0; i < uentryList_size (s); i++)
260 if (cstring_equal (name, uentry_rawName (s->elements[i])))
271 uentryList_lookupRealName (uentryList s, cstring name)
273 if (uentryList_isDefined (s))
277 for (i = 0; i < uentryList_size (s); i++)
279 cstring uname = uentry_getName (s->elements[i]);
281 if (cstring_equal (name, uname))
283 cstring_free (uname);
287 cstring_free (uname);
294 uentryList uentryList_copy (uentryList s)
296 if (uentryList_isDefined (s))
298 uentryList t = (uentryList) dmalloc (sizeof (*t));
301 t->nelements = s->nelements;
303 t->current = s->current;
305 if (s->nelements > 0)
307 t->elements = (uentry *) dmalloc (sizeof (*t->elements) * t->nelements);
309 for (i = 0; i < s->nelements; i++)
311 t->elements[i] = uentry_copy (s->elements[i]);
323 return uentryList_undefined;
328 uentryList_free (uentryList s)
330 if (!uentryList_isUndefined (s))
334 for (i = 0; i < s->nelements; i++)
336 uentry_free (s->elements[i]);
345 uentryList_freeShallow (uentryList s)
347 if (!uentryList_isUndefined (s))
349 /*@-mustfree@*/ /* free shallow does not free the element */
357 uentryList_isVoid (uentryList cl)
359 if (cl != NULL && cl->nelements == 1)
361 return (ctype_isVoid (ctype_realType (uentry_getType (cl->elements[0]))));
368 uentryList_getN (uentryList p, int n)
370 llassert (uentryList_isDefined (p));
372 if (n < 0 || (n >= uentryList_size (p)))
374 llcontbug (message ("uentryList_getN: out of range: %d (size %d)",
375 n, uentryList_size (p)));
376 return uentry_undefined;
379 return (p->elements[n]);
382 void uentryList_fixMissingNames (uentryList cl)
384 uentryList_elements (cl, ce)
386 if (!uentry_hasRealName (ce))
388 ctype ct = uentry_getType (ce);
392 uentry_setName (ce, usymtab_getTypeEntryName (ctype_typeId (ct)));
396 llbug (message ("uentryList_fixMissingNames: not UA: %s",
397 ctype_unparse (ct)));
400 uentry_setType (ce, ctype_int);
402 } end_uentryList_elements;
405 void uentryList_fixImpParams (uentryList cl)
408 if (context_getFlag (FLG_PARAMIMPTEMP))
410 uentryList_elements (cl, ce)
412 sRef s = uentry_getSref (ce);
413 alkind ak = sRef_getAliasKind (s);
415 if (alkind_isUnknown (ak) || alkind_isImplicit (ak))
417 exkind ek = sRef_getExKind (s);
419 if (exkind_isKnown (ek))
421 sRef_setAliasKind (s, AK_IMPDEPENDENT, fileloc_undefined);
425 sRef_setAliasKind (s, AK_IMPTEMP, fileloc_undefined);
431 } end_uentryList_elements;
436 uentryList_compareParams (uentryList s, uentryList t)
440 if (s == t) return 0;
442 if (uentryList_isUndefined (s)) return 1;
443 if (uentryList_isUndefined (t)) return -1;
445 sz = uentryList_size (s);
447 INTCOMPARERETURN (uentryList_size (t), sz);
449 for (i = 0; i < sz; i++)
451 COMPARERETURN (uentry_compare (s->elements[i], t->elements[i]));
458 uentryList_compareStrict (uentryList s, uentryList t)
467 if (uentryList_isMissingParams (s))
469 if (uentryList_isMissingParams (t))
480 if (uentryList_isMissingParams (t))
486 sz = uentryList_size (s);
488 INTCOMPARERETURN (uentryList_size (t), sz);
490 for (i = 0; i < sz; i++)
492 COMPARERETURN (uentry_compareStrict (s->elements[i], t->elements[i]));
501 uentryList_compareFields (uentryList s, uentryList t)
505 if (s == t) return 0;
507 if (uentryList_isUndefined (s))
509 if (uentryList_isUndefined (t))
512 sz = uentryList_size (s);
514 if (uentryList_size (t) != sz)
516 return (int_compare (sz, uentryList_size (t)));
519 for (i = 0; i < sz; i++)
521 uentry se = s->elements[i];
522 uentry te = t->elements[i];
523 int namecmp = cstring_compare (uentry_rawName (se), uentry_rawName (te));
527 int uc = uentry_compare (s->elements[i], t->elements[i]);
531 DPRINTF (("Bad compare: %s / %s",
532 uentry_unparseFull (s->elements [i]),
533 uentry_unparseFull (t->elements [i])));
548 uentryList_current (uentryList s)
550 llassert (uentryList_isDefined (s));
551 llassert (!(s->current < 0 || (s->current >= s->nelements)));
552 return (s->elements[s->current]);
556 uentryList_dumpParams (uentryList s)
558 cstring st = cstring_undefined;
560 if (uentryList_isUndefined (s)) return st;
562 uentryList_elements (s, current)
564 DPRINTF (("Dump param: %s", uentry_unparse (current)));
565 st = message ("%q%q,", st, uentry_dumpParam (current));
566 } end_uentryList_elements;
572 uentryList_dumpFields (uentryList s)
574 cstring st = cstring_undefined;
576 if (uentryList_isUndefined (s)) return st;
578 uentryList_elements (s, current)
580 if (!uentry_isVariable (current))
582 llassert (uentry_isFunction (current));
583 DPRINTF (("Dump field: %s", uentry_unparse (current)));
584 st = message ("%q!%q,", st, uentry_dump (current));
588 DPRINTF (("Dump field: %s", uentry_unparse (current)));
589 st = message ("%q%q,", st, uentry_dump (current));
591 } end_uentryList_elements;
596 /*@only@*/ uentryList
597 uentryList_undumpFields (char **s, fileloc loc)
599 uentryList ul = uentryList_new ();
601 while (**s != '\0' && **s != '}')
605 reader_checkChar (s, '!');
606 ul = uentryList_add (ul, uentry_undump (ekind_function, loc, s));
610 ul = uentryList_add (ul, uentry_undump (ekind_variable, loc, s));
612 reader_checkChar (s, ',');
615 reader_checkChar (s, '}');
619 /*@only@*/ uentryList
620 uentryList_undump (char **s)
623 uentryList pn = uentryList_new ();
628 while (c != '#' && c != '@' && c != ')')
630 uentry ue = uentry_undump (ekind_variable, g_currentloc, s);
633 if (!uentry_isUndefined (ue))
635 pn = uentryList_add (pn, ue);
642 reader_checkChar (s, ',');
647 reader_checkChar (s, ')');
652 uentryList_reset (uentryList s)
654 if (uentryList_isUndefined (s)) return;
659 uentryList_isFinished (uentryList s)
661 if (uentryList_isUndefined (s)) return TRUE;
662 return (s->current > s->nelements - 1);
666 uentryList_advanceSafe (uentryList s)
668 if (uentryList_isUndefined (s)) return;
672 if (s->current > s->nelements)
674 s->current = s->nelements;
679 uentryList_size (uentryList s)
681 if (uentryList_isUndefined (s)) return 0;
683 if (uentryList_isVoid (s))
690 uentryList_isMissingParams (uentryList s)
692 return (uentryList_isUndefined (s) || s->nelements == 0);
695 bool uentryList_hasReturned (uentryList ul)
697 uentryList_elements (ul, current)
699 if (uentry_isReturned (current)) return TRUE;
700 } end_uentryList_elements;
706 uentryList_lookupField (uentryList f, cstring name)
708 int i = uentryList_lookupDirectName (f, name);
712 return (uentryList_getN (f, i));
716 uentryList_elements (f, el)
718 if (uentry_isUnnamedVariable (el))
720 ctype ct = uentry_getType (el);
722 if (ctype_isStruct (ct) || ctype_isUnion (ct))
724 uentryList fields = ctype_getFields (ct);
725 uentry ue = uentryList_lookupField (fields, name);
727 if (uentry_isValid (ue))
734 end_uentryList_elements ;
736 return uentry_undefined;
740 /*@only@*/ uentryList
741 uentryList_mergeFields (/*@only@*/ uentryList f1, /*@only@*/ uentryList f2)
743 DPRINTF (("Merge: %s + %s", uentryList_unparse (f1), uentryList_unparse (f2)));
745 if (uentryList_isUndefined (f1))
750 if (uentryList_isDefined (f2))
752 uentryList_elements (f2, current)
754 uentry old = uentryList_lookupField (f1, uentry_rawName (current));
756 if (uentry_isValid (old))
760 message ("Field name reused: %s", uentry_rawName (current)),
761 uentry_whereDefined (current));
762 llgenmsg (message ("Previous use of %s", uentry_rawName (current)),
763 uentry_whereDefined (old));
766 /* okay to use exposed current since f2 is killed */
767 /*@-exposetrans@*/ /*@-dependenttrans@*/
768 f1 = uentryList_add (f1, current);
769 /*@=exposetrans@*/ /*@=dependenttrans@*/
771 } end_uentryList_elements;
773 sfree (f2->elements);
781 uentryList_showFieldDifference (uentryList p1, uentryList p2)
786 llassert (NOALIAS (p1, p2));
787 llassert (uentryList_isDefined (p1));
788 llassert (uentryList_isDefined (p2));
790 for (index = 0; index < p1->nelements; index++)
792 cp1 = p1->elements[index];
794 if (index == p2->nelements)
797 (message ("Field present in %s, missing in %rdeclaration: %q",
798 uentry_specDeclName (cp1),
799 uentry_isDeclared (cp1),
800 uentry_unparse (cp1)),
801 uentry_whereEither (cp1));
805 cp2 = p2->elements[index];
807 if (!(cstring_equal (uentry_rawName (cp1), uentry_rawName (cp2))))
810 (message ("Field %s in %s corresponds to %s in %rdeclaration",
811 uentry_rawName (cp1),
812 uentry_specOrDefName (cp1),
813 uentry_rawName (cp2),
814 uentry_isCodeDefined (cp1)),
815 uentry_whereDefined (cp2));
816 uentry_showWhereLastPlain (cp1);
821 /* evs 2000-07-25 was ctype_match, should match uentryList_matchFields */
823 if (!ctype_almostEqual (uentry_getType (cp1), uentry_getType (cp2)))
826 (message ("Field %s %rdeclared as %s, %s as %s",
827 uentry_rawName (cp2),
828 uentry_isCodeDefined (cp1),
829 ctype_unparse (uentry_getType (cp1)),
830 uentry_specOrDefName (cp2),
831 ctype_unparse (uentry_getType (cp2))),
832 uentry_whereDefined (cp2));
833 uentry_showWhereLastPlain (cp1);
839 if (index != p2->nelements)
841 cp2 = p2->elements[index];
844 (message ("Extra field in new declaration: %q",
845 uentry_unparse (cp2)),
846 uentry_whereEither (cp2));
851 llbug (message ("uentryList_showFieldDifference: match: %q / %q",
852 uentryList_unparse (p1), uentryList_unparse (p2)));
856 uentryList_equivFields (uentryList p1, uentryList p2)
858 return (uentryList_compareFields (p1, p2) == 0);
862 uentryList_matchFields (uentryList p1, uentryList p2)
872 if (uentryList_isEmpty (p1) || uentryList_isEmpty (p2))
877 if (uentryList_size (p1) != uentryList_size (p2))
882 for (index = 0; index < p1->nelements; index++)
884 cp1 = p1->elements[index];
885 cp2 = p2->elements[index];
888 ** Should compare uentry's --- need to fix report errors too.
891 if (!(cstring_equal (uentry_rawName (cp1), uentry_rawName (cp2))
892 && (ctype_almostEqual (uentry_getType (cp1), uentry_getType (cp2)))))