#include "BLI_linklist.h"
#include "BLI_listbase.h"
#include "BLI_math.h"
#include "BLI_threads.h"
#include "DNA_lineart_types.h"
#include <math.h>
#include <string.h>

Macros
#define	LRT_ITER_ALL_LINES_BEGIN

#define	LRT_ITER_ALL_LINES_NEXT

#define	LRT_ITER_ALL_LINES_END

#define	LRT_BOUND_AREA_CROSSES(b1, b2) ((b1)[0] < (b2)[1] && (b1)[1] > (b2)[0] && (b1)[3] < (b2)[2] && (b1)[2] > (b2)[3])

#define	LRT_BA_ROWS 4

Functions
void *	lineart_list_append_pointer_pool (ListBase h, struct LineartStaticMemPool smp, void *data)

void *	lineart_list_append_pointer_pool_sized (ListBase h, struct LineartStaticMemPool smp, void *data, int size)

void *	list_push_pointer_static (ListBase h, struct LineartStaticMemPool smp, void *p)

void *	list_push_pointer_static_sized (ListBase h, struct LineartStaticMemPool smp, void *p, int size)

void *	lineart_list_pop_pointer_no_free (ListBase *h)

void	lineart_list_remove_pointer_item_no_free (ListBase h, LinkData lip)

struct LineartStaticMemPoolNode *	lineart_mem_new_static_pool (struct LineartStaticMemPool *smp, size_t size)

void *	lineart_mem_aquire (struct LineartStaticMemPool *smp, size_t size)

void *	lineart_mem_aquire_thread (struct LineartStaticMemPool *smp, size_t size)

void	lineart_mem_destroy (struct LineartStaticMemPool *smp)

void	lineart_prepend_edge_direct (struct LineartEdge *first, void node)

void	lineart_prepend_pool (LinkNode *first, struct LineartStaticMemPool smp, void *link)

void	lineart_matrix_ortho_44d (double(*mProjection)[4], double xMin, double xMax, double yMin, double yMax, double zMin, double zMax)

void	lineart_matrix_perspective_44d (double(*mProjection)[4], double fFov_rad, double fAspect, double zMin, double zMax)

int	lineart_count_intersection_segment_count (struct LineartRenderBuffer *rb)

void	lineart_count_and_print_render_buffer_memory (struct LineartRenderBuffer *rb)

Macro Definition Documentation

◆ LRT_BA_ROWS

#define LRT_BA_ROWS 4

Definition at line 113 of file lineart_intern.h.

◆ LRT_BOUND_AREA_CROSSES

#define LRT_BOUND_AREA_CROSSES	(	b1,
		b2
	)	((b1)[0] < (b2)[1] && (b1)[1] > (b2)[0] && (b1)[3] < (b2)[2] && (b1)[2] > (b2)[3])

Definition at line 108 of file lineart_intern.h.

◆ LRT_ITER_ALL_LINES_BEGIN

#define LRT_ITER_ALL_LINES_BEGIN

Value:

  LineartEdge *e, *next_e, **current_list; \
  e = rb->contours; \
  for (current_list = &rb->contours; e; e = next_e) { \
    next_e = e->next;

Definition at line 78 of file lineart_intern.h.

◆ LRT_ITER_ALL_LINES_END

#define LRT_ITER_ALL_LINES_END

Value:

LRT_ITER_ALL_LINES_NEXT \

}

LRT_ITER_ALL_LINES_NEXT

#define LRT_ITER_ALL_LINES_NEXT

Definition: lineart_intern.h:84

Definition at line 104 of file lineart_intern.h.

◆ LRT_ITER_ALL_LINES_NEXT

#define LRT_ITER_ALL_LINES_NEXT

Value:

  while (!next_e) { \
    if (current_list == &rb->contours) { \
      current_list = &rb->crease_lines; \
    } \
    else if (current_list == &rb->crease_lines) { \
      current_list = &rb->material_lines; \
    } \
    else if (current_list == &rb->material_lines) { \
      current_list = &rb->edge_marks; \
    } \
    else if (current_list == &rb->edge_marks) { \
      current_list = &rb->intersection_lines; \
    } \
    else { \
      break; \
    } \
    next_e = *current_list; \
  }