114     pbb->valid = bfalse;  in BSP_aabb_dealloc()
132     return bfalse;  in BSP_aabb_empty()
142     if ( NULL == psrc ) return bfalse;  in BSP_aabb_clear()
147         return bfalse;  in BSP_aabb_clear()
165     if ( NULL == pdst || NULL == psrc ) return bfalse;  in BSP_aabb_from_oct_bb()
169     if ( pdst->dim <= 0 ) return bfalse;  in BSP_aabb_from_oct_bb()
220     if ( NULL == psrc ) return bfalse;  in BSP_aabb_validate()
230             psrc->valid = bfalse;  in BSP_aabb_validate()
235             psrc->valid = bfalse;  in BSP_aabb_validate()
240             psrc->valid = bfalse;  in BSP_aabb_validate()
251     if ( NULL == psrc ) return bfalse;  in BSP_aabb_invalidate()
254     psrc->valid = bfalse;  in BSP_aabb_invalidate()
264     if ( NULL == pdst ) return bfalse;  in BSP_aabb_copy()
269         return bfalse;  in BSP_aabb_copy()
296     if ( NULL == pdst ) return bfalse;  in BSP_aabb_self_union()
331     if ( NULL == ppleaf || NULL == *ppleaf ) return bfalse;  in BSP_leaf_destroy()
360     if ( NULL == L ) return bfalse;  in BSP_leaf_dtor()
362     L->inserted  = bfalse;  in BSP_leaf_dtor()
458     if ( NULL == B ) return bfalse;  in BSP_branch_alloc()
475     if ( NULL == B ) return bfalse;  in BSP_branch_dealloc()
495     bool_t found_self = bfalse;  in BSP_branch_unlink()
501     if ( NULL == B ) return bfalse;  in BSP_branch_unlink()
531     BSP_branch_free_nodes( B, bfalse );  in BSP_branch_unlink()
545     if ( NULL == B || index < 0 || ( size_t )index >= B->children.count ) return bfalse;  in BSP_branch_insert_branch()
547     if ( NULL == B2 ) return bfalse;  in BSP_branch_insert_branch()
551         return bfalse;  in BSP_branch_insert_branch()
567     if ( NULL == B ) return bfalse;  in BSP_branch_clear()
594     if ( NULL == B ) return bfalse;  in BSP_branch_free_nodes()
621     if ( NULL == B ) return bfalse;  in BSP_branch_prune()
641             bool_t found = bfalse;  in BSP_branch_prune()
668     if ( NULL == pbranch || NULL == colst ) return bfalse;  in BSP_branch_add_all_nodes()
671     if ( 0 == colst_size || BSP_leaf_pary_get_top( colst ) >= colst_size ) return bfalse;  in BSP_branch_add_all_nodes()
680     if ( BSP_leaf_pary_get_top( colst ) >= colst_size ) return bfalse;  in BSP_branch_add_all_nodes()
702     if ( NULL == pbranch ) return bfalse;  in BSP_branch_empty()
710             empty = bfalse;  in BSP_branch_empty()
718         empty = bfalse;  in BSP_branch_empty()
733     if ( NULL == colst || 0 == colst->alloc || colst->top >= colst->alloc ) return bfalse;  in BSP_branch_collide()
736     if ( NULL == pbranch ) return bfalse;  in BSP_branch_collide()
743         return bfalse;  in BSP_branch_collide()
851     if ( NULL == t ) return bfalse;  in BSP_tree_alloc()
853     if ( NULL != t->branch_all.ary || t->branch_all.alloc > 0 ) return bfalse;  in BSP_tree_alloc()
863     if ( NULL == t->branch_all.ary || 0 == t->branch_all.alloc ) return bfalse;  in BSP_tree_alloc()
889     if ( NULL == t ) return bfalse;  in BSP_tree_dealloc()
937     if ( NULL == t || 0 == t->branch_used.top ) return bfalse;  in BSP_tree_remove_used()
939     if ( NULL == B ) return bfalse;  in BSP_tree_remove_used()
948     if ( cnt == t->branch_used.top ) return bfalse;  in BSP_tree_remove_used()
984     if ( NULL == t || NULL == B ) return bfalse;  in BSP_tree_free_branch()
986     retval = bfalse;  in BSP_tree_free_branch()
1044     if ( NULL == t ) return bfalse;  in BSP_tree_clear()
1079     if ( NULL == t ) return bfalse;  in BSP_tree_free_branches()
1111     if ( NULL == t || NULL == t->root ) return bfalse;  in BSP_tree_prune()
1251     if ( NULL == ptree || NULL == pleaf ) return bfalse;  in BSP_tree_insert_leaf()
1281     if ( NULL == ptree || NULL == pbranch || NULL == pleaf ) return bfalse;  in BSP_tree_insert_leaf_rec()
1287     inserted_branch = bfalse;  in BSP_tree_insert_leaf_rec()
1288     inserted_leaf   = bfalse;  in BSP_tree_insert_leaf_rec()
1304     fail  = bfalse;  in BSP_tree_insert_leaf_rec()
1334         return bfalse;  in BSP_tree_insert_leaf_rec()
1349         created = bfalse;  in BSP_tree_insert_leaf_rec()
1399     if ( NULL == t || cnt < 0 || cnt >= t->branch_used.top ) return bfalse;  in BSP_tree_prune_branch()
1402     if ( NULL == B ) return bfalse;  in BSP_tree_prune_branch()
1407     remove = bfalse;  in BSP_tree_prune_branch()
1489     if ( NULL == LL ) return bfalse;  in BSP_leaf_list_alloc()
1501     if ( NULL == LL ) return bfalse;  in BSP_leaf_list_dealloc()
1533     if ( NULL == LL || NULL == n ) return bfalse;  in BSP_leaf_list_insert()
1541     retval = bfalse;  in BSP_leaf_list_insert()
1559         bool_t found = bfalse;  in BSP_leaf_list_insert()
1622         ptmp->inserted = bfalse;  in BSP_leaf_list_reset()
1646     if ( NULL == LL->lst || 0 == LL->count ) return bfalse;  in BSP_leaf_list_collide()
1647     if ( NULL == paabb ) return bfalse;  in BSP_leaf_list_collide()
1650     if ( !BSP_aabb_overlap( &( LL->bbox ), paabb ) ) return bfalse;  in BSP_leaf_list_collide()
1655         return bfalse;  in BSP_leaf_list_collide()
1716     if ( NULL == BL ) return bfalse;  in BSP_branch_list_alloc()
1740     if ( NULL == BL ) return bfalse;  in BSP_branch_list_dealloc()
1758     if ( NULL == psrc || psrc->dim <= 0 ) return bfalse;  in BSP_generate_aabb_child()
1761     if ( NULL == pdst ) return bfalse;  in BSP_generate_aabb_child()
1765     if ( index < 0 || index >= child_count ) return bfalse;  in BSP_generate_aabb_child()