c1bc70b711
A lot of files were missing copyright field in the header and
the Blender Foundation contributed to them in a sense of bug
fixing and general maintenance.
This change makes it explicit that those files are at least
partially copyrighted by the Blender Foundation.
Note that this does not make it so the Blender Foundation is
the only holder of the copyright in those files, and developers
who do not have a signed contract with the foundation still
hold the copyright as well.
Another aspect of this change is using SPDX format for the
header. We already used it for the license specification,
and now we state it for the copyright as well, following the
FAQ:
https://reuse.software/faq/
79 lines
2.4 KiB
C
79 lines
2.4 KiB
C
/* SPDX-FileCopyrightText: 2001-2002 NaN Holding BV. All rights reserved.
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*/
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
struct ListBase;
|
|
|
|
/* Box Packer */
|
|
|
|
typedef struct BoxPack {
|
|
float x;
|
|
float y;
|
|
float w;
|
|
float h;
|
|
|
|
/* Verts this box uses
|
|
* (BL,TR,TL,BR) / 0,1,2,3 */
|
|
struct BoxVert *v[4];
|
|
|
|
int index;
|
|
} BoxPack;
|
|
|
|
/**
|
|
* Main box-packing function accessed from other functions
|
|
* This sets boxes x,y to positive values, sorting from 0,0 outwards.
|
|
* There is no limit to the space boxes may take, only that they will be packed
|
|
* tightly into the lower left hand corner (0,0)
|
|
*
|
|
* \param box_array: a pre-allocated array of boxes.
|
|
* only the 'box->x' and 'box->y' are set, 'box->w' and 'box->h' are used,
|
|
* 'box->index' is not used at all, the only reason its there
|
|
* is that the box array is sorted by area and programs need to be able
|
|
* to have some way of writing the boxes back to the original data.
|
|
* \param len: the number of boxes in the array.
|
|
* \param sort_boxes: Sort `box_array` before packing.
|
|
* \param r_tot_x, r_tot_y: set so you can normalize the data.
|
|
*/
|
|
void BLI_box_pack_2d(
|
|
BoxPack *box_array, unsigned int len, bool sort_boxes, float *r_tot_x, float *r_tot_y);
|
|
|
|
typedef struct FixedSizeBoxPack {
|
|
struct FixedSizeBoxPack *next, *prev;
|
|
int x, y;
|
|
int w, h;
|
|
} FixedSizeBoxPack;
|
|
|
|
/**
|
|
* Packs boxes into a fixed area.
|
|
*
|
|
* Boxes and packed are linked lists containing structs that can be cast to
|
|
* #FixedSizeBoxPack (i.e. contains a #FixedSizeBoxPack as its first element).
|
|
* Boxes that were packed successfully are placed into *packed and removed from *boxes.
|
|
*
|
|
* The algorithm is a simplified version of https://github.com/TeamHypersomnia/rectpack2D.
|
|
* Better ones could be used, but for the current use case (packing Image tiles into GPU
|
|
* textures) this is fine.
|
|
*
|
|
* Note that packing efficiency depends on the order of the input boxes. Generally speaking,
|
|
* larger boxes should come first, though how exactly size is best defined (e.g. area, perimeter)
|
|
* depends on the particular application.
|
|
*/
|
|
void BLI_box_pack_2d_fixedarea(struct ListBase *boxes,
|
|
int width,
|
|
int height,
|
|
struct ListBase *packed);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|