mrq/GLdc
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Start a better clipping algorithm for a triangle

Browse Source
This commit is contained in:
Luke Benstead 2020-03-30 19:37:23 +01:00
parent 0e26d8656d
commit 0f86adaf71
1 changed files with 21 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
GL/clip.c
View File

@ -87,7 +87,6 @@ typedef struct {
uint8_t visible; uint8_t visible;
} Triangle; } Triangle;
void _glClipTriangle(const Triangle* triangle, const uint8_t visible, SubmissionTarget* target, const uint8_t flatShade) __attribute__((optimize("fast-math")));
void _glClipTriangle(const Triangle* triangle, const uint8_t visible, SubmissionTarget* target, const uint8_t flatShade) { void _glClipTriangle(const Triangle* triangle, const uint8_t visible, SubmissionTarget* target, const uint8_t flatShade) {
uint8_t i, c = 0; uint8_t i, c = 0;
@ -103,6 +102,27 @@ void _glClipTriangle(const Triangle* triangle, const uint8_t visible, Submission
/* Used when flat shading is enabled */ /* Used when flat shading is enabled */
uint32_t finalColour = *((uint32_t*) bgra); uint32_t finalColour = *((uint32_t*) bgra);
for(i = 1; i <= 3; ++i) {
uint8_t thisIndex = (i == 3) ? 0 : i;
uint8_t lastIndex = i - 1;
uint8_t thisVisible = (visible & (1 << (2 - thisIndex))) > 0;
uint8_t lastVisible = (visible & (1 << (2 - lastIndex))) > 0;
if(thisVisible != lastVisible) {
/* We crossed a plane */
} else if(thisVisible) {
/* Our existing vertex is fine */
last = aligned_vector_push_back(&target->output->vector, &vertices[thisIndex], 1);
last->flags = VERTEX_CMD;
veLast = aligned_vector_push_back(target->extras, &extras[thisIndex], 1);
}
}
for(i = 0; i < 4; ++i) { for(i = 0; i < 4; ++i) {
uint8_t thisIndex = (i == 3) ? 0 : i; uint8_t thisIndex = (i == 3) ? 0 : i;