Back to index

lightning-sunbird  0.9+nobinonly
TestLeaky.cpp
Go to the documentation of this file.
00001 /* ***** BEGIN LICENSE BLOCK *****
00002  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
00003  *
00004  * The contents of this file are subject to the Mozilla Public License Version
00005  * 1.1 (the "License"); you may not use this file except in compliance with
00006  * the License. You may obtain a copy of the License at
00007  * http://www.mozilla.org/MPL/
00008  *
00009  * Software distributed under the License is distributed on an "AS IS" basis,
00010  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
00011  * for the specific language governing rights and limitations under the
00012  * License.
00013  *
00014  * The Original Code is mozilla.org code.
00015  *
00016  * The Initial Developer of the Original Code is
00017  * Kipp E.B. Hickman.
00018  * Portions created by the Initial Developer are Copyright (C) 1999
00019  * the Initial Developer. All Rights Reserved.
00020  *
00021  * Contributor(s):
00022  *
00023  * Alternatively, the contents of this file may be used under the terms of
00024  * either the GNU General Public License Version 2 or later (the "GPL"), or
00025  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
00026  * in which case the provisions of the GPL or the LGPL are applicable instead
00027  * of those above. If you wish to allow use of your version of this file only
00028  * under the terms of either the GPL or the LGPL, and not to allow others to
00029  * use your version of this file under the terms of the MPL, indicate your
00030  * decision by deleting the provisions above and replace them with the notice
00031  * and other provisions required by the GPL or the LGPL. If you do not delete
00032  * the provisions above, a recipient may use your version of this file under
00033  * the terms of any one of the MPL, the GPL or the LGPL.
00034  *
00035  * ***** END LICENSE BLOCK ***** */
00036 
00037 #include <stdio.h>
00038 #include <malloc.h>
00039 
00040 void s1(int, int)
00041 {
00042     malloc(100);
00043 }
00044 
00045 void s2()
00046 {
00047     s1(1, 2);
00048     malloc(100);
00049 }
00050 
00051 void s3()
00052 {
00053     s2();
00054     malloc(100);
00055     malloc(200);
00056 }
00057 
00058 void s4()
00059 {
00060     s3();
00061     char* cp = new char[300];
00062     cp = cp;
00063 }
00064 
00065 // Test that mutually recrusive methods don't foul up the graph output
00066 void s6(int recurse);
00067 
00068 void s5(int recurse)
00069 {
00070     malloc(100);
00071     if (recurse > 0) {
00072       s6(recurse - 1);
00073     }
00074 }
00075 
00076 void s6(int recurse)
00077 {
00078     malloc(100);
00079     if (recurse > 0) {
00080       s5(recurse - 1);
00081     }
00082 }
00083 
00084 // Test that two pathways through the same node don't cause replicated
00085 // descdendants (A -> B -> C, X -> B -> D shouldn't produce a graph
00086 // that shows A -> B -> D!)
00087 
00088 void C()
00089 {
00090   malloc(10);
00091 }
00092 
00093 void D()
00094 {
00095   malloc(10);
00096 }
00097 
00098 void B(int way)
00099 {
00100   malloc(10);
00101   if (way) {
00102     C();
00103     C();
00104     C();
00105   } else {
00106     D();
00107   }
00108 }
00109 
00110 void A()
00111 {
00112   malloc(10);
00113   B(1);
00114 }
00115 
00116 void X()
00117 {
00118   malloc(10);
00119   B(0);
00120 }
00121 
00122 int main()
00123 {
00124   s1(1, 2);
00125   s2();
00126   s3();
00127   s4();
00128   s5(10);
00129   A();
00130   X();
00131 }