gold/testsuite/debug_msg.cc

   1 // debug_msg.cc -- a test case for printing debug info for missing symbols.
   2
   3 // Copyright 2006, 2007, 2008 Free Software Foundation, Inc.
   4 // Written by Ian Lance Taylor <iant@google.com>.
   5
   6 // This file is part of gold.
   7
   8 // This program is free software; you can redistribute it and/or modify
   9 // it under the terms of the GNU General Public License as published by
  10 // the Free Software Foundation; either version 3 of the License, or
  11 // (at your option) any later version.
  12
  13 // This program is distributed in the hope that it will be useful,
  14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 // GNU General Public License for more details.
  17
  18 // You should have received a copy of the GNU General Public License
  19 // along with this program; if not, write to the Free Software
  20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
  21 // MA 02110-1301, USA.
  22
  23 // This file is constructed to have undefined references.  In
  24 // debug_msg.sh, we will try to link this file, and analyze the
  25 // error messages that are produced.
  26
  27 extern int undef_int;
  28 extern float undef_float;
  29 extern void undef_fn1();
  30 extern void undef_fn2();
  31
  32 int* badref1 = &undef_int;
  33 static float* badref2 = &undef_float;
  34 void (*fn_array[])() =
  35 {
  36   undef_fn1,
  37   undef_fn2
  38 };
  39
  40 template<class Foo>
  41 int testfn(Foo x)
  42 {
  43   undef_fn1();
  44   undef_fn2();
  45   return undef_int;
  46 }
  47
  48 class Base
  49 {
  50   virtual void virtfn() { undef_fn1(); }
  51 };
  52
  53 class Derived : public Base
  54 {
  55   virtual void virtfn() { undef_fn2(); }
  56 };
  57
  58 // This tests One Definition Rule (ODR) violations.
  59 void SortAscending(int array[], int size);   // in odr_violation1.cc
  60 void SortDescending(int array[], int size);  // in odr_violation2.cc
  61
  62 int main()
  63 {
  64   testfn(5);
  65   testfn(4.0);
  66
  67   Base b;
  68   Derived d;
  69
  70   int kInput1[] = {1, 6, 9, 7, 3, 4, 2, 10, 5, 8};
  71   int kSize1 = sizeof(kInput1) / sizeof(int);
  72   SortAscending(kInput1, kSize1);
  73
  74   int kInput2[] = {1, 6, 9, 7, 3, 4, 2, 10, 5, 8};
  75   int kSize2 = sizeof(kInput2) / sizeof(int);
  76   SortDescending(kInput2, kSize2);
  77
  78   return 0;
  79 }