[brlcad-commits] SF.net SVN: brlcad:[48425] brlcad/trunk/src/librt/primitives/brep/ brep_debug.cpp

[starseeker]

Revision: 48425
          http://brlcad.svn.sourceforge.net/brlcad/?rev=48425&view=rev
Author:   starseeker
Date:     2012-01-11 19:04:43 +0000 (Wed, 11 Jan 2012)
Log Message:
-----------
Wrap the brep uses inside the null checks. CID 277-291

Modified Paths:
--------------
    brlcad/trunk/src/librt/primitives/brep/brep_debug.cpp

Modified: brlcad/trunk/src/librt/primitives/brep/brep_debug.cpp
===================================================================
--- brlcad/trunk/src/librt/primitives/brep/brep_debug.cpp       2012-01-11 
18:52:51 UTC (rev 48424)
+++ brlcad/trunk/src/librt/primitives/brep/brep_debug.cpp       2012-01-11 
19:04:43 UTC (rev 48425)
@@ -924,7 +924,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_F.Count(); index++) {
            ON_BrepFace& face = brep->m_F[index];
@@ -944,6 +944,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -958,7 +959,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_F.Count(); index++) {
            ON_BrepFace& face = brep->m_F[index];
@@ -974,6 +975,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -988,7 +990,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_S.Count(); index++) {
            ON_Surface *surf = brep->m_S[index];
@@ -1001,7 +1003,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
-
+    }
     return 0;
 }
 
@@ -1016,7 +1018,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_S.Count(); index++) {
            ON_Surface *surf = brep->m_S[index];
@@ -1031,6 +1033,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -1045,7 +1048,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_S.Count(); index++) {
            ON_Surface *surf = brep->m_S[index];
@@ -1058,6 +1061,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -1072,7 +1076,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        int num_curves = brep->m_C3.Count();
        for (index = 0; index < num_curves; index++) {
@@ -1086,6 +1090,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -1100,7 +1105,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        int num_trims = brep->m_T.Count();
        for (index = 0; index < num_trims; index++) {
@@ -1113,6 +1118,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -1626,7 +1632,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_F.Count(); index++) {
            ON_BrepFace& face = brep->m_F[index];
@@ -1655,6 +1661,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -1669,7 +1676,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_F.Count(); index++) {
            ON_BrepFace& face = brep->m_F[index];
@@ -1686,6 +1693,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 
@@ -1700,7 +1708,7 @@
     if (brep == NULL || !brep->IsValid(&tl)) {
        bu_log("brep is NOT valid");
        //return -1;
-    }
+    } else {
     if (index == -1) {
        for (index = 0; index < brep->m_F.Count(); index++) {
            ON_BrepFace& face = brep->m_F[index];
@@ -1717,6 +1725,7 @@
     }
 
     bu_vls_printf(vls, ON_String(wstr).Array());
+    }
     return 0;
 }
 

This was sent by the SourceForge.net collaborative development platform, the 
world's largest Open Source development site.


------------------------------------------------------------------------------
Ridiculously easy VDI. With Citrix VDI-in-a-Box, you don't need a complex
infrastructure or vast IT resources to deliver seamless, secure access to
virtual desktops. With this all-in-one solution, easily deploy virtual 
desktops for less than the cost of PCs and save 60% on VDI infrastructure 
costs. Try it free! http://p.sf.net/sfu/Citrix-VDIinabox
_______________________________________________
BRL-CAD Source Commits mailing list
brlcad-commits@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/brlcad-commits