/dports/games/zhlt/zhlt-3.4/hlbsp/ |
H A D | writebsp.cpp | 25 static int WritePlane(int planenum) in WritePlane() argument 27 planenum = planenum & (~1); in WritePlane() 31 return planenum; in WritePlane() 56 if (node->planenum == -1) in WriteClipNodes_r() 70 if (node->planenum & 1) in WriteClipNodes_r() 74 cn->planenum = WritePlane(node->planenum); in WriteClipNodes_r() 174 df->planenum = WritePlane(f->planenum); in WriteFace() 175 df->side = f->planenum & 1; in WriteFace() 205 if (node->planenum & 1) in WriteDrawNodes_r() 209 n->planenum = WritePlane(node->planenum); in WriteDrawNodes_r() [all …]
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/tools/compilers/dmap/ |
H A D | facebsp.cpp | 195 int planenum; in SelectSplitPlaneNum() local 216 return planenum; in SelectSplitPlaneNum() 248 if ( check->planenum == split->planenum ) { in SelectSplitPlaneNum() 277 return bestSplit->planenum; in SelectSplitPlaneNum() 298 node->planenum = PLANENUM_LEAF; in BuildFaceTree_r() 304 node->planenum = splitPlaneNum; in BuildFaceTree_r() 311 if ( split->planenum == node->planenum ) { in BuildFaceTree_r() 324 newFace->planenum = split->planenum; in BuildFaceTree_r() 331 newFace->planenum = split->planenum; in BuildFaceTree_r() 449 f->planenum = s->planenum & ~1; in MakeStructuralBspFaceList() [all …]
|
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake3/q3map2/ |
H A D | facebsp.c | 91 int planenum; in SelectSplitPlaneNum() local 112 *splitPlaneNum = planenum; in SelectSplitPlaneNum() 135 if ( check->planenum == split->planenum ) { in SelectSplitPlaneNum() 166 *splitPlaneNum = bestSplit->planenum; in SelectSplitPlaneNum() 217 node->planenum = PLANENUM_LEAF; in BuildFaceTree_r() 223 node->planenum = splitPlaneNum; in BuildFaceTree_r() 234 if( split->planenum == node->planenum ) in BuildFaceTree_r() 252 newFace->planenum = split->planenum; in BuildFaceTree_r() 261 newFace->planenum = split->planenum; in BuildFaceTree_r() 376 f->planenum = s->planenum & ~1; in MakeStructuralBSPFaceList() [all …]
|
H A D | tree.c | 49 while (node->planenum != PLANENUM_LEAF) in NodeForPoint() 51 plane = &mapplanes[node->planenum]; in NodeForPoint() 75 if (node->planenum != PLANENUM_LEAF) in FreeTreePortals_r() 101 if (node->planenum != PLANENUM_LEAF) in FreeTree_r() 140 if (node->planenum == PLANENUM_LEAF) in PrintTree_r() 153 plane = &mapplanes[node->planenum]; in PrintTree_r() 154 Sys_Printf ("#%d (%5.2f %5.2f %5.2f):%5.2f\n", node->planenum, in PrintTree_r()
|
/dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3map2/ |
H A D | facebsp.c | 90 int planenum; in SelectSplitPlaneNum() local 114 *splitPlaneNum = planenum; in SelectSplitPlaneNum() 139 if ( check->planenum == split->planenum ) { in SelectSplitPlaneNum() 197 *splitPlaneNum = bestSplit->planenum; in SelectSplitPlaneNum() 264 node->planenum = PLANENUM_LEAF; in BuildFaceTree_r() 271 node->planenum = splitPlaneNum; in BuildFaceTree_r() 284 if ( split->planenum == node->planenum ) { in BuildFaceTree_r() 306 newFace->planenum = split->planenum; in BuildFaceTree_r() 315 newFace->planenum = split->planenum; in BuildFaceTree_r() 460 f->planenum = s->planenum & ~1; in MakeStructuralBSPFaceList() [all …]
|
H A D | tree.c | 48 while ( node->planenum != PLANENUM_LEAF ) in NodeForPoint() 50 plane = &mapplanes[node->planenum]; in NodeForPoint() 75 if ( node->planenum != PLANENUM_LEAF ) { in FreeTreePortals_r() 99 if ( node->planenum != PLANENUM_LEAF ) { in FreeTree_r() 136 if ( node->planenum == PLANENUM_LEAF ) { in PrintTree_r() 149 plane = &mapplanes[node->planenum]; in PrintTree_r() 150 Sys_Printf( "#%d (%5.2f %5.2f %5.2f):%5.2f\n", node->planenum, in PrintTree_r()
|
/dports/games/ufoai/ufoai-2.5-source/src/tools/ufo2map/ |
H A D | tree.cpp | 44 if (node->planenum != PLANENUM_LEAF) { in FreeTreePortals_r() 65 if (node->planenum != PLANENUM_LEAF) { in FreeTree_r() 115 if (p->planenum == pnum) in CheckPlaneAgainstParents() 123 node->planenum = PLANENUM_LEAF; in LeafNode() 150 CheckPlaneAgainstParents(bestside->planenum, node); in BuildTree_r() 152 Verb_Printf(VERB_DUMP, "BuildTree_r: splitting along plane %i\n", (int)bestside->planenum); in BuildTree_r() 156 node->planenum = bestside->planenum & ~1; /* always use front facing */ in BuildTree_r() 158 SplitBrushList(brushes, node->planenum, &children[0], &children[1]); in BuildTree_r() 168 SplitBrush(node->volume, node->planenum, &node->children[0]->volume, in BuildTree_r() 227 if (node->planenum == PLANENUM_LEAF) in PruneNodes_r() [all …]
|
H A D | writebsp.cpp | 119 df->planenum = f->planenum & (~1); in EmitFace() 120 df->side = f->planenum & 1; in EmitFace() 147 if (node->planenum == PLANENUM_LEAF) { in EmitDrawNode_r() 163 if (node->planenum & 1) in EmitDrawNode_r() 165 n->planenum = node->planenum; in EmitDrawNode_r() 180 if (node->children[i]->planenum == PLANENUM_LEAF) { in EmitDrawNode_r() 246 int planenum; in EmitBrushes() local 271 cp->planenum = b->original_sides[j].planenum; in EmitBrushes() 286 planenum = FindOrCreateFloatPlane(normal, dist); in EmitBrushes() 288 if (b->original_sides[i].planenum == planenum) in EmitBrushes() [all …]
|
H A D | bspbrush.cpp | 61 const plane_t* plane = &mapplanes[side->planenum]; in CreateBrushWindings() 71 if (brush->sides[j].planenum == (side->planenum ^ 1)) in CreateBrushWindings() 250 const uint16_t num = brush->sides[i].planenum; in TestBrushToPlanenum() 251 if (num == planenum) in TestBrushToPlanenum() 253 if (num == (planenum ^ 1)) in TestBrushToPlanenum() 258 plane = &mapplanes[planenum]; in TestBrushToPlanenum() 374 plane_t* plane = &mapplanes[planenum]; in DoesPlaneSplitBrush() 476 pnum = side->planenum; in SelectSplitSide() 569 plane = &mapplanes[planenum]; in SplitBrush() 691 cs->planenum = planenum ^ i ^ 1; in SplitBrush() [all …]
|
/dports/games/iortcw/iortcw-1.51c/MP/code/botlib/ |
H A D | be_aas_sample.c | 233 if ( node->planenum < 0 || node->planenum >= ( *aasworld ).numplanes ) { in AAS_PointAreaNum() 338 trace->planenum = 0; in AAS_AreaEntityCollision() 372 tstack_p->planenum = 0; in AAS_TraceClientBBox() 393 trace.planenum = 0; in AAS_TraceClientBBox() 432 trace.planenum = tstack_p->planenum; in AAS_TraceClientBBox() 483 trace.planenum = tstack_p->planenum; in AAS_TraceClientBBox() 487 trace.planenum ^= 1; in AAS_TraceClientBBox() 587 tstack_p->planenum = aasnode->planenum; in AAS_TraceClientBBox() 637 tstack_p->planenum = 0; in AAS_TraceAreas() 771 tstack_p->planenum = aasnode->planenum; in AAS_TraceAreas() [all …]
|
/dports/games/iortcw/iortcw-1.51c/SP/code/botlib/ |
H A D | be_aas_sample.c | 233 if ( node->planenum < 0 || node->planenum >= ( *aasworld ).numplanes ) { in AAS_PointAreaNum() 338 trace->planenum = 0; in AAS_AreaEntityCollision() 372 tstack_p->planenum = 0; in AAS_TraceClientBBox() 393 trace.planenum = 0; in AAS_TraceClientBBox() 432 trace.planenum = tstack_p->planenum; in AAS_TraceClientBBox() 483 trace.planenum = tstack_p->planenum; in AAS_TraceClientBBox() 487 trace.planenum ^= 1; in AAS_TraceClientBBox() 587 tstack_p->planenum = aasnode->planenum; in AAS_TraceClientBBox() 637 tstack_p->planenum = 0; in AAS_TraceAreas() 771 tstack_p->planenum = aasnode->planenum; in AAS_TraceAreas() [all …]
|
/dports/games/gtkradiant/GPL/Q2Tools/bsp/qbsp3/ |
H A D | writebsp.c | 210 df->planenum = f->planenum & (~1); in EmitFace() 211 df->side = f->planenum & 1; in EmitFace() 238 if (node->planenum == PLANENUM_LEAF) in EmitDrawNode_r() 253 planeused[node->planenum]++; in EmitDrawNode_r() 254 planeused[node->planenum^1]++; in EmitDrawNode_r() 256 if (node->planenum & 1) in EmitDrawNode_r() 258 n->planenum = node->planenum; in EmitDrawNode_r() 407 int planenum; in EmitBrushes() local 426 cp->planenum = b->original_sides[j].planenum; in EmitBrushes() 443 if (b->original_sides[i].planenum == planenum) in EmitBrushes() [all …]
|
H A D | tree.c | 33 while (node->planenum != PLANENUM_LEAF) in NodeForPoint() 35 plane = &mapplanes[node->planenum]; in NodeForPoint() 59 if (node->planenum != PLANENUM_LEAF) in FreeTreePortals_r() 87 if (node->planenum != PLANENUM_LEAF) in FreeTree_r() 135 if (node->planenum == PLANENUM_LEAF) in PrintTree_r() 148 plane = &mapplanes[node->planenum]; in PrintTree_r() 149 printf ("#%i (%5.2f %5.2f %5.2f):%5.2f\n", node->planenum, in PrintTree_r() 175 if (node->planenum == PLANENUM_LEAF) in PruneNodes_r() 189 node->planenum = PLANENUM_LEAF; in PruneNodes_r()
|
H A D | brushbsp.c | 494 if (num == planenum) in QuickTestBrushToPlanenum() 496 if (num == (planenum ^ 1) ) in QuickTestBrushToPlanenum() 501 plane = &mapplanes[planenum]; in QuickTestBrushToPlanenum() 539 if (num == planenum) in TestBrushToPlanenum() 541 if (num == (planenum ^ 1) ) in TestBrushToPlanenum() 713 if (p->planenum == pnum) in CheckPlaneAgainstParents() 791 pnum = side->planenum; in SelectSplitSide() 1091 cs->planenum = planenum^i^1; in SplitBrush() 1166 if ( (side->planenum& ~1) == node->planenum) in SplitBrushList() 1212 node->planenum = -1; in BuildTree_r() [all …]
|
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/q2map/ |
H A D | writebsp.c | 210 df->planenum = f->planenum & ( ~1 ); in EmitFace() 211 df->side = f->planenum & 1; in EmitFace() 238 if ( node->planenum == PLANENUM_LEAF ) { in EmitDrawNode_r() 253 planeused[node->planenum]++; in EmitDrawNode_r() 254 planeused[node->planenum ^ 1]++; in EmitDrawNode_r() 256 if ( node->planenum & 1 ) { in EmitDrawNode_r() 259 n->planenum = node->planenum; in EmitDrawNode_r() 407 int planenum; in EmitBrushes() local 427 cp->planenum = b->original_sides[j].planenum; in EmitBrushes() 446 if ( b->original_sides[i].planenum == planenum ) { in EmitBrushes() [all …]
|
H A D | tree.c | 31 while ( node->planenum != PLANENUM_LEAF ) in NodeForPoint() 33 plane = &mapplanes[node->planenum]; in NodeForPoint() 58 if ( node->planenum != PLANENUM_LEAF ) { in FreeTreePortals_r() 84 if ( node->planenum != PLANENUM_LEAF ) { in FreeTree_r() 131 if ( node->planenum == PLANENUM_LEAF ) { in PrintTree_r() 144 plane = &mapplanes[node->planenum]; in PrintTree_r() 145 Sys_Printf( "#%i (%5.2f %5.2f %5.2f):%5.2f\n", node->planenum, in PrintTree_r() 170 if ( node->planenum == PLANENUM_LEAF ) { in PruneNodes_r() 186 node->planenum = PLANENUM_LEAF; in PruneNodes_r()
|
H A D | brushbsp.c | 497 if ( num == planenum ) { in QuickTestBrushToPlanenum() 506 plane = &mapplanes[planenum]; in QuickTestBrushToPlanenum() 543 if ( num == planenum ) { in TestBrushToPlanenum() 552 plane = &mapplanes[planenum]; in TestBrushToPlanenum() 726 if ( p->planenum == pnum ) { in CheckPlaneAgainstParents() 813 pnum = side->planenum; in SelectSplitSide() 971 plane = &mapplanes[planenum]; in SplitBrush() 1117 cs->planenum = planenum ^ i ^ 1; in SplitBrush() 1188 if ( ( side->planenum & ~1 ) == node->planenum ) { in SplitBrushList() 1233 node->planenum = -1; in BuildTree_r() [all …]
|
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/extra/bsp/qbsp3/ |
H A D | writebsp.c | 210 df->planenum = f->planenum & (~1); in EmitFace() 211 df->side = f->planenum & 1; in EmitFace() 238 if (node->planenum == PLANENUM_LEAF) in EmitDrawNode_r() 253 planeused[node->planenum]++; in EmitDrawNode_r() 254 planeused[node->planenum^1]++; in EmitDrawNode_r() 256 if (node->planenum & 1) in EmitDrawNode_r() 258 n->planenum = node->planenum; in EmitDrawNode_r() 407 int planenum; in EmitBrushes() local 426 cp->planenum = b->original_sides[j].planenum; in EmitBrushes() 443 if (b->original_sides[i].planenum == planenum) in EmitBrushes() [all …]
|
H A D | tree.c | 33 while (node->planenum != PLANENUM_LEAF) in NodeForPoint() 35 plane = &mapplanes[node->planenum]; in NodeForPoint() 59 if (node->planenum != PLANENUM_LEAF) in FreeTreePortals_r() 87 if (node->planenum != PLANENUM_LEAF) in FreeTree_r() 135 if (node->planenum == PLANENUM_LEAF) in PrintTree_r() 148 plane = &mapplanes[node->planenum]; in PrintTree_r() 149 printf ("#%i (%5.2f %5.2f %5.2f):%5.2f\n", node->planenum, in PrintTree_r() 175 if (node->planenum == PLANENUM_LEAF) in PruneNodes_r() 189 node->planenum = PLANENUM_LEAF; in PruneNodes_r()
|
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake2/q2map/ |
H A D | writebsp.c | 209 df->planenum = f->planenum & (~1); in EmitFace() 210 df->side = f->planenum & 1; in EmitFace() 237 if (node->planenum == PLANENUM_LEAF) in EmitDrawNode_r() 252 planeused[node->planenum]++; in EmitDrawNode_r() 253 planeused[node->planenum^1]++; in EmitDrawNode_r() 255 if (node->planenum & 1) in EmitDrawNode_r() 257 n->planenum = node->planenum; in EmitDrawNode_r() 406 int planenum; in EmitBrushes() local 425 cp->planenum = b->original_sides[j].planenum; in EmitBrushes() 442 if (b->original_sides[i].planenum == planenum) in EmitBrushes() [all …]
|
H A D | tree.c | 32 while (node->planenum != PLANENUM_LEAF) in NodeForPoint() 34 plane = &mapplanes[node->planenum]; in NodeForPoint() 58 if (node->planenum != PLANENUM_LEAF) in FreeTreePortals_r() 86 if (node->planenum != PLANENUM_LEAF) in FreeTree_r() 134 if (node->planenum == PLANENUM_LEAF) in PrintTree_r() 147 plane = &mapplanes[node->planenum]; in PrintTree_r() 148 Sys_Printf ("#%i (%5.2f %5.2f %5.2f):%5.2f\n", node->planenum, in PrintTree_r() 174 if (node->planenum == PLANENUM_LEAF) in PruneNodes_r() 188 node->planenum = PLANENUM_LEAF; in PruneNodes_r()
|
H A D | brushbsp.c | 493 if (num == planenum) in QuickTestBrushToPlanenum() 495 if (num == (planenum ^ 1) ) in QuickTestBrushToPlanenum() 500 plane = &mapplanes[planenum]; in QuickTestBrushToPlanenum() 538 if (num == planenum) in TestBrushToPlanenum() 540 if (num == (planenum ^ 1) ) in TestBrushToPlanenum() 712 if (p->planenum == pnum) in CheckPlaneAgainstParents() 790 pnum = side->planenum; in SelectSplitSide() 1090 cs->planenum = planenum^i^1; in SplitBrush() 1165 if ( (side->planenum& ~1) == node->planenum) in SplitBrushList() 1211 node->planenum = -1; in BuildTree_r() [all …]
|
/dports/games/quakeforge/quakeforge-0.7.2/tools/qfbsp/source/ |
H A D | csg4.c | 62 newf->planenum = in->planenum; in NewFaceFromFace() 143 if (f->planenum == splitplane) { in ClipInside() 182 int planenum; in SaveOutside() local 188 planenum = f->planenum; in SaveOutside() 198 validfaces[planenum] = MergeFaceToList (newf, in SaveOutside() 199 validfaces[planenum]); in SaveOutside() 202 validfaces[planenum] = MergeFaceToList (f, validfaces[planenum]); in SaveOutside() 203 validfaces[planenum] = FreeMergeListScraps (validfaces[planenum]); in SaveOutside() 249 s->planenum = i; in BuildSurfaces() 350 ClipInside (f->planenum, f->planeside, overwrite); in CSGFaces()
|
/dports/games/mvdsv/mvdsv-0.34/src/ |
H A D | bspfile.h | 153 int planenum; member 163 int planenum; member 173 int planenum; member 183 int planenum; member 189 int planenum; member 195 int planenum; member 219 short planenum; member 232 int planenum; member
|
/dports/games/qwdtools/mvdsv-0.34/src/ |
H A D | bspfile.h | 153 int planenum; member 163 int planenum; member 173 int planenum; member 183 int planenum; member 189 int planenum; member 195 int planenum; member 219 short planenum; member 232 int planenum; member
|