X-Git-Url: https://de.git.xonotic.org/?a=blobdiff_plain;f=r_light.c;h=42a50e308aefc29edac4c6613f009ee7a750070b;hb=149604a34a83774c6d34eea7aef1ec9a408c01f9;hp=b24c4d3d0153087735107d0ffd75871de3c5f9bc;hpb=b49e92062e402ecdc1a7407d942bfd7252c4426d;p=xonotic%2Fdarkplaces.git diff --git a/r_light.c b/r_light.c index b24c4d3d..42a50e30 100644 --- a/r_light.c +++ b/r_light.c @@ -164,119 +164,6 @@ void R_DrawCoronas(void) /* ============================================================================= -DYNAMIC LIGHTS - -============================================================================= -*/ - -static int lightpvsbytes; -static qbyte lightpvs[(MAX_MAP_LEAFS+7)>>3]; - -/* -============= -R_MarkLights -============= -*/ -static void R_RecursiveMarkLights(entity_render_t *ent, vec3_t lightorigin, dlight_t *light, int bit, int bitindex, mnode_t *node, qbyte *pvs, int pvsbits) -{ - int i; - mleaf_t *leaf; - float dist; - - // for comparisons to minimum acceptable light - while(node->plane) - { - dist = PlaneDiff(lightorigin, node->plane); - if (dist > light->rtlight.lightmap_cullradius) - node = node->children[0]; - else - { - if (dist >= -light->rtlight.lightmap_cullradius) - R_RecursiveMarkLights(ent, lightorigin, light, bit, bitindex, node->children[0], pvs, pvsbits); - node = node->children[1]; - } - } - - // check if leaf is visible according to pvs - leaf = (mleaf_t *)node; - i = leaf->clusterindex; - if (leaf->numleafsurfaces && (i >= pvsbits || CHECKPVSBIT(pvs, i))) - { - int d, impacts, impactt; - float sdist, maxdist, dist2, impact[3]; - msurface_t *surface; - // mark the polygons - maxdist = light->rtlight.lightmap_cullradius2; - for (i = 0;i < leaf->numleafsurfaces;i++) - { - if (ent == r_refdef.worldentity && !r_worldsurfacevisible[leaf->firstleafsurface[i]]) - continue; - surface = ent->model->brushq1.surfaces + leaf->firstleafsurface[i]; - dist = sdist = PlaneDiff(lightorigin, surface->plane); - if (surface->flags & SURF_PLANEBACK) - dist = -dist; - - if (dist < -0.25f && !(surface->flags & SURF_LIGHTBOTHSIDES)) - continue; - - dist2 = dist * dist; - if (dist2 >= maxdist) - continue; - - VectorCopy(lightorigin, impact); - if (surface->plane->type >= 3) - VectorMA(impact, -sdist, surface->plane->normal, impact); - else - impact[surface->plane->type] -= sdist; - - impacts = DotProduct (impact, surface->texinfo->vecs[0]) + surface->texinfo->vecs[0][3] - surface->texturemins[0]; - - d = bound(0, impacts, surface->extents[0] + 16) - impacts; - dist2 += d * d; - if (dist2 > maxdist) - continue; - - impactt = DotProduct (impact, surface->texinfo->vecs[1]) + surface->texinfo->vecs[1][3] - surface->texturemins[1]; - - d = bound(0, impactt, surface->extents[1] + 16) - impactt; - dist2 += d * d; - if (dist2 > maxdist) - continue; - - if (surface->dlightframe != r_framecount) // not dynamic until now - { - surface->dlightbits[0] = surface->dlightbits[1] = surface->dlightbits[2] = surface->dlightbits[3] = surface->dlightbits[4] = surface->dlightbits[5] = surface->dlightbits[6] = surface->dlightbits[7] = 0; - surface->dlightframe = r_framecount; - surface->cached_dlight = true; - } - surface->dlightbits[bitindex] |= bit; - } - } -} - -void R_MarkLights(entity_render_t *ent) -{ - int i, bit, bitindex; - dlight_t *light; - vec3_t lightorigin; - if (!gl_flashblend.integer && r_dynamic.integer && ent->model && ent->model->brush.num_leafs) - { - for (i = 0, light = r_dlight;i < r_numdlights;i++, light++) - { - bit = 1 << (i & 31); - bitindex = i >> 5; - Matrix4x4_Transform(&ent->inversematrix, light->origin, lightorigin); - lightpvsbytes = 0; - if (r_vismarklights.integer && ent->model->brush.FatPVS) - lightpvsbytes = ent->model->brush.FatPVS(ent->model, lightorigin, 0, lightpvs, sizeof(lightpvs)); - R_RecursiveMarkLights(ent, lightorigin, light, bit, bitindex, ent->model->brush.data_nodes + ent->model->brushq1.hulls[0].firstclipnode, lightpvs, min(lightpvsbytes * 8, ent->model->brush.num_pvsclusters)); - } - } -} - -/* -============================================================================= - LIGHT SAMPLING =============================================================================