1/* libunwind - a platform-independent unwind library 2 Copyright (C) 2003 Hewlett-Packard Co 3 Contributed by David Mosberger-Tang <davidm@hpl.hp.com> 4 5This file is part of libunwind. 6 7Copyright (c) 2003 Hewlett-Packard Co. 8 9Permission is hereby granted, free of charge, to any person obtaining 10a copy of this software and associated documentation files (the 11"Software"), to deal in the Software without restriction, including 12without limitation the rights to use, copy, modify, merge, publish, 13distribute, sublicense, and/or sell copies of the Software, and to 14permit persons to whom the Software is furnished to do so, subject to 15the following conditions: 16 17The above copyright notice and this permission notice shall be 18included in all copies or substantial portions of the Software. 19 20THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 21EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 22MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 23NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 24LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 25OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 26WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ 27 28#include <stdio.h> 29#include <string.h> 30 31#define UNW_LOCAL_ONLY /* must define this for consistency with backtrace() */ 32#include <libunwind.h> 33 34int verbose; 35 36int 37f257 (void) 38{ 39 void *buffer[300]; 40 int i, n; 41 42 if (verbose) 43 printf ("First backtrace:\n"); 44 n = unw_backtrace (buffer, 300); 45 if (verbose) 46 for (i = 0; i < n; ++i) 47 printf ("[%d] ip=%p\n", i, buffer[i]); 48 49 unw_flush_cache (unw_local_addr_space, 0, 0); 50 51 if (verbose) 52 printf ("\nSecond backtrace:\n"); 53 n = unw_backtrace (buffer, 300); 54 if (verbose) 55 for (i = 0; i < n; ++i) 56 printf ("[%d] ip=%p\n", i, buffer[i]); 57 return 0; 58} 59 60#define F(n,m) \ 61int \ 62f##n (void) \ 63{ \ 64 return f##m (); \ 65} 66 67/* Here, we rely on the fact that the script-cache's hash-table is 256 68 entries big. With 257 functions, we're guaranteed to get at least 69 one hash-collision. */ 70F(256,257) F(255,256) F(254,255) F(253,254) 71F(252,253) F(251,252) F(250,251) F(249,250) 72F(248,249) F(247,248) F(246,247) F(245,246) 73F(244,245) F(243,244) F(242,243) F(241,242) 74F(240,241) F(239,240) F(238,239) F(237,238) 75F(236,237) F(235,236) F(234,235) F(233,234) 76F(232,233) F(231,232) F(230,231) F(229,230) 77F(228,229) F(227,228) F(226,227) F(225,226) 78F(224,225) F(223,224) F(222,223) F(221,222) 79F(220,221) F(219,220) F(218,219) F(217,218) 80F(216,217) F(215,216) F(214,215) F(213,214) 81F(212,213) F(211,212) F(210,211) F(209,210) 82F(208,209) F(207,208) F(206,207) F(205,206) 83F(204,205) F(203,204) F(202,203) F(201,202) 84F(200,201) F(199,200) F(198,199) F(197,198) 85F(196,197) F(195,196) F(194,195) F(193,194) 86F(192,193) F(191,192) F(190,191) F(189,190) 87F(188,189) F(187,188) F(186,187) F(185,186) 88F(184,185) F(183,184) F(182,183) F(181,182) 89F(180,181) F(179,180) F(178,179) F(177,178) 90F(176,177) F(175,176) F(174,175) F(173,174) 91F(172,173) F(171,172) F(170,171) F(169,170) 92F(168,169) F(167,168) F(166,167) F(165,166) 93F(164,165) F(163,164) F(162,163) F(161,162) 94F(160,161) F(159,160) F(158,159) F(157,158) 95F(156,157) F(155,156) F(154,155) F(153,154) 96F(152,153) F(151,152) F(150,151) F(149,150) 97F(148,149) F(147,148) F(146,147) F(145,146) 98F(144,145) F(143,144) F(142,143) F(141,142) 99F(140,141) F(139,140) F(138,139) F(137,138) 100F(136,137) F(135,136) F(134,135) F(133,134) 101F(132,133) F(131,132) F(130,131) F(129,130) 102F(128,129) F(127,128) F(126,127) F(125,126) 103F(124,125) F(123,124) F(122,123) F(121,122) 104F(120,121) F(119,120) F(118,119) F(117,118) 105F(116,117) F(115,116) F(114,115) F(113,114) 106F(112,113) F(111,112) F(110,111) F(109,110) 107F(108,109) F(107,108) F(106,107) F(105,106) 108F(104,105) F(103,104) F(102,103) F(101,102) 109F(100,101) F(99,100) F(98,99) F(97,98) 110F(96,97) F(95,96) F(94,95) F(93,94) 111F(92,93) F(91,92) F(90,91) F(89,90) 112F(88,89) F(87,88) F(86,87) F(85,86) 113F(84,85) F(83,84) F(82,83) F(81,82) 114F(80,81) F(79,80) F(78,79) F(77,78) 115F(76,77) F(75,76) F(74,75) F(73,74) 116F(72,73) F(71,72) F(70,71) F(69,70) 117F(68,69) F(67,68) F(66,67) F(65,66) 118F(64,65) F(63,64) F(62,63) F(61,62) 119F(60,61) F(59,60) F(58,59) F(57,58) 120F(56,57) F(55,56) F(54,55) F(53,54) 121F(52,53) F(51,52) F(50,51) F(49,50) 122F(48,49) F(47,48) F(46,47) F(45,46) 123F(44,45) F(43,44) F(42,43) F(41,42) 124F(40,41) F(39,40) F(38,39) F(37,38) 125F(36,37) F(35,36) F(34,35) F(33,34) 126F(32,33) F(31,32) F(30,31) F(29,30) 127F(28,29) F(27,28) F(26,27) F(25,26) 128F(24,25) F(23,24) F(22,23) F(21,22) 129F(20,21) F(19,20) F(18,19) F(17,18) 130F(16,17) F(15,16) F(14,15) F(13,14) 131F(12,13) F(11,12) F(10,11) F(9,10) 132F(8,9) F(7,8) F(6,7) F(5,6) 133F(4,5) F(3,4) F(2,3) F(1,2) 134 135int 136main (int argc, char **argv) 137{ 138 if (argc > 1 && strcmp (argv[1], "-v") == 0) 139 verbose = 1; 140 141 return f1 (); 142} 143