Cleanup: spelling in comments
This commit is contained in:
@@ -192,8 +192,8 @@ class GHOST_Context : public GHOST_IContext {
|
|||||||
};
|
};
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Gets the Vulkan backbuffer related resource handles associated with the Vulkan context.
|
* Gets the Vulkan back-buffer related resource handles associated with the Vulkan context.
|
||||||
* Needs to be called after each swap event as the backbuffer will change.
|
* Needs to be called after each swap event as the back-buffer will change.
|
||||||
*
|
*
|
||||||
* \param r_image: After calling this function the VkImage
|
* \param r_image: After calling this function the VkImage
|
||||||
* referenced by this parameter will contain the VKImage handle
|
* referenced by this parameter will contain the VKImage handle
|
||||||
|
@@ -23,14 +23,18 @@ typedef enum eMeshFairingDepth {
|
|||||||
MESH_FAIRING_DEPTH_TANGENCY = 2,
|
MESH_FAIRING_DEPTH_TANGENCY = 2,
|
||||||
} eMeshFairingDepth;
|
} eMeshFairingDepth;
|
||||||
|
|
||||||
/* affect_vertices is used to define the fairing area. Indexed by vertex index, set to true when
|
/**
|
||||||
* the vertex should be modified by fairing. */
|
* Affect_vertices is used to define the fairing area. Indexed by vertex index, set to true when
|
||||||
|
* the vertex should be modified by fairing.
|
||||||
|
*/
|
||||||
void BKE_bmesh_prefair_and_fair_verts(struct BMesh *bm,
|
void BKE_bmesh_prefair_and_fair_verts(struct BMesh *bm,
|
||||||
bool *affect_verts,
|
bool *affect_verts,
|
||||||
eMeshFairingDepth depth);
|
eMeshFairingDepth depth);
|
||||||
|
|
||||||
/* This function can optionally use the vertex coordinates of deform_mverts to read and write the
|
/**
|
||||||
* fairing result. When NULL, the function will use mesh positions directly. */
|
* This function can optionally use the vertex coordinates of deform_mverts to read and write the
|
||||||
|
* fairing result. When NULL, the function will use mesh positions directly.
|
||||||
|
*/
|
||||||
void BKE_mesh_prefair_and_fair_verts(struct Mesh *mesh,
|
void BKE_mesh_prefair_and_fair_verts(struct Mesh *mesh,
|
||||||
float (*deform_vert_positions)[3],
|
float (*deform_vert_positions)[3],
|
||||||
bool *affect_verts,
|
bool *affect_verts,
|
||||||
|
@@ -15,7 +15,8 @@ struct ReportList;
|
|||||||
* Compute simplified tangent space normals, i.e.
|
* Compute simplified tangent space normals, i.e.
|
||||||
* tangent vector + sign of bi-tangent one, which combined with
|
* tangent vector + sign of bi-tangent one, which combined with
|
||||||
* split normals can be used to recreate the full tangent space.
|
* split normals can be used to recreate the full tangent space.
|
||||||
* NOTE: * The mesh should be made of only tris and quads!
|
*
|
||||||
|
* \note The mesh should be made of only triangles and quads!
|
||||||
*/
|
*/
|
||||||
void BKE_mesh_calc_loop_tangent_single_ex(const float (*vert_positions)[3],
|
void BKE_mesh_calc_loop_tangent_single_ex(const float (*vert_positions)[3],
|
||||||
int numVerts,
|
int numVerts,
|
||||||
@@ -31,7 +32,7 @@ void BKE_mesh_calc_loop_tangent_single_ex(const float (*vert_positions)[3],
|
|||||||
* Wrapper around BKE_mesh_calc_loop_tangent_single_ex, which takes care of most boilerplate code.
|
* Wrapper around BKE_mesh_calc_loop_tangent_single_ex, which takes care of most boilerplate code.
|
||||||
* \note
|
* \note
|
||||||
* - There must be a valid loop's CD_NORMALS available.
|
* - There must be a valid loop's CD_NORMALS available.
|
||||||
* - The mesh should be made of only tris and quads!
|
* - The mesh should be made of only triangles and quads!
|
||||||
*/
|
*/
|
||||||
void BKE_mesh_calc_loop_tangent_single(struct Mesh *mesh,
|
void BKE_mesh_calc_loop_tangent_single(struct Mesh *mesh,
|
||||||
const char *uvmap,
|
const char *uvmap,
|
||||||
|
@@ -1399,7 +1399,7 @@ void BKE_blendfile_override(BlendfileLinkAppendContext *lapp_context,
|
|||||||
* reference to be indirectly linked.
|
* reference to be indirectly linked.
|
||||||
*
|
*
|
||||||
* This is more of an heuristic for 'as best as possible' user feedback in the UI
|
* This is more of an heuristic for 'as best as possible' user feedback in the UI
|
||||||
* (Outliner), which is expected to be valid in almost all practical usecases. Direct or
|
* (Outliner), which is expected to be valid in almost all practical use-cases. Direct or
|
||||||
* indirect linked status is properly checked before saving .blend file. */
|
* indirect linked status is properly checked before saving .blend file. */
|
||||||
id->tag &= ~LIB_TAG_EXTERN;
|
id->tag &= ~LIB_TAG_EXTERN;
|
||||||
id->tag |= LIB_TAG_INDIRECT;
|
id->tag |= LIB_TAG_INDIRECT;
|
||||||
|
@@ -227,7 +227,7 @@ static AdrBit2Path ob_layer_bits[] = {
|
|||||||
} \
|
} \
|
||||||
(void)0
|
(void)0
|
||||||
|
|
||||||
/* This function checks if a Blocktype+Adrcode combo, returning a mapping table */
|
/* This function checks if a `blocktype+adrcode` combination, returning a mapping table. */
|
||||||
static AdrBit2Path *adrcode_bitmaps_to_paths(int blocktype, int adrcode, int *tot)
|
static AdrBit2Path *adrcode_bitmaps_to_paths(int blocktype, int adrcode, int *tot)
|
||||||
{
|
{
|
||||||
/* Object layers */
|
/* Object layers */
|
||||||
|
@@ -451,7 +451,7 @@ static void prefair_and_fair_verts(FairingContext *fairing_context,
|
|||||||
bool *affected_verts,
|
bool *affected_verts,
|
||||||
const eMeshFairingDepth depth)
|
const eMeshFairingDepth depth)
|
||||||
{
|
{
|
||||||
/* Prefair. */
|
/* Pre-fair. */
|
||||||
UniformVertexWeight *uniform_vertex_weights = new UniformVertexWeight(fairing_context);
|
UniformVertexWeight *uniform_vertex_weights = new UniformVertexWeight(fairing_context);
|
||||||
UniformLoopWeight *uniform_loop_weights = new UniformLoopWeight();
|
UniformLoopWeight *uniform_loop_weights = new UniformLoopWeight();
|
||||||
fairing_context->fair_verts(affected_verts, depth, uniform_vertex_weights, uniform_loop_weights);
|
fairing_context->fair_verts(affected_verts, depth, uniform_vertex_weights, uniform_loop_weights);
|
||||||
|
@@ -8725,7 +8725,7 @@ static int edbm_point_normals_modal(bContext *C, wmOperator *op, const wmEvent *
|
|||||||
params.calc_looptri = true;
|
params.calc_looptri = true;
|
||||||
params.calc_normals = false;
|
params.calc_normals = false;
|
||||||
params.is_destructive = false;
|
params.is_destructive = false;
|
||||||
/* Recheck bools. */
|
/* Recheck booleans. */
|
||||||
EDBM_update(static_cast<Mesh *>(obedit->data), ¶ms);
|
EDBM_update(static_cast<Mesh *>(obedit->data), ¶ms);
|
||||||
|
|
||||||
point_normals_update_header(C, op);
|
point_normals_update_header(C, op);
|
||||||
|
@@ -8,7 +8,7 @@
|
|||||||
#include <ctype.h>
|
#include <ctype.h>
|
||||||
#include <float.h>
|
#include <float.h>
|
||||||
#include <math.h>
|
#include <math.h>
|
||||||
#include <stddef.h> /* for offsetof */
|
#include <stddef.h> /* For `offsetof`. */
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <time.h>
|
#include <time.h>
|
||||||
@@ -231,7 +231,7 @@ int ED_object_in_mode_to_index(const Scene *scene,
|
|||||||
BLI_assert(ob != nullptr);
|
BLI_assert(ob != nullptr);
|
||||||
/* NOTE: the `v3d` is always nullptr because the purpose of this function is to return
|
/* NOTE: the `v3d` is always nullptr because the purpose of this function is to return
|
||||||
* a reusable index, using the `v3d` only increases the chance the index may become
|
* a reusable index, using the `v3d` only increases the chance the index may become
|
||||||
* invalidparams. */
|
* invalid-parameters. */
|
||||||
int index = -1;
|
int index = -1;
|
||||||
int i = 0;
|
int i = 0;
|
||||||
FOREACH_BASE_IN_MODE_BEGIN (scene, view_layer, nullptr, -1, mode, base_iter) {
|
FOREACH_BASE_IN_MODE_BEGIN (scene, view_layer, nullptr, -1, mode, base_iter) {
|
||||||
|
@@ -2995,9 +2995,9 @@ static int view3d_select_exec(bContext *C, wmOperator *op)
|
|||||||
if (obact && obact->type == OB_GPENCIL && GPENCIL_ANY_MODE((bGPdata *)obact->data)) {
|
if (obact && obact->type == OB_GPENCIL && GPENCIL_ANY_MODE((bGPdata *)obact->data)) {
|
||||||
/* Prevent acting on Grease Pencil (when not in object mode), it implements its own selection
|
/* Prevent acting on Grease Pencil (when not in object mode), it implements its own selection
|
||||||
* operator in other modes. We might still fall trough to here (because that operator uses
|
* operator in other modes. We might still fall trough to here (because that operator uses
|
||||||
* OPERATOR_PASS_THROUGH to make tweak work) but if we dont stop here code below assumes we are
|
* OPERATOR_PASS_THROUGH to make tweak work) but if we don't stop here code below assumes we
|
||||||
* in object mode it might falsely toggle object selection. Alternatively, this could be put in
|
* are in object mode it might falsely toggle object selection. Alternatively, this could be
|
||||||
* the poll funtion instead. */
|
* put in the poll function instead. */
|
||||||
return OPERATOR_PASS_THROUGH | OPERATOR_CANCELLED;
|
return OPERATOR_PASS_THROUGH | OPERATOR_CANCELLED;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -2808,19 +2808,19 @@ static void uv_map_mirror(BMFace *efa,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/** Store a face and it's current branch on the generalized atan2 function.
|
/**
|
||||||
|
* Store a face and it's current branch on the generalized atan2 function.
|
||||||
*
|
*
|
||||||
* In complex analysis, we can generalize the arctangent function
|
* In complex analysis, we can generalize the `arctangent` function
|
||||||
* into a multi-valued function that is "almost everywhere continuous"
|
* into a multi-valued function that is "almost everywhere continuous"
|
||||||
* in the complex plane.
|
* in the complex plane.
|
||||||
*
|
*
|
||||||
* The downside is that we need to keep track of which "branch" of the
|
* The downside is that we need to keep track of which "branch" of the
|
||||||
* multi-valued function we are currently on.
|
* multi-valued function we are currently on.
|
||||||
*
|
*
|
||||||
* \note Even though atan2(a+bi, c+di) is now (multiply) defined for all
|
* \note Even though `atan2(a+bi, c+di)` is now (multiply) defined for all
|
||||||
* complex inputs, we will only evaluate it with `b==0` and `d==0`.
|
* complex inputs, we will only evaluate it with `b==0` and `d==0`.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
struct uv_face_branch {
|
struct uv_face_branch {
|
||||||
BMFace *efa;
|
BMFace *efa;
|
||||||
float branch;
|
float branch;
|
||||||
@@ -2830,7 +2830,7 @@ struct uv_face_branch {
|
|||||||
*
|
*
|
||||||
* Heuristics are used in #uv_map_mirror to improve winding.
|
* Heuristics are used in #uv_map_mirror to improve winding.
|
||||||
*
|
*
|
||||||
* if `fan` is true, faces with UVs at the pole have corrections appled to fan the UVs.
|
* if `fan` is true, faces with UVs at the pole have corrections applied to fan the UVs.
|
||||||
*
|
*
|
||||||
* if `use_seams` is true, the unwrapping will flood fill across the mesh, using
|
* if `use_seams` is true, the unwrapping will flood fill across the mesh, using
|
||||||
* seams to mark boundaries, and #BM_ELEM_TAG to prevent revisiting faces.
|
* seams to mark boundaries, and #BM_ELEM_TAG to prevent revisiting faces.
|
||||||
@@ -2851,7 +2851,7 @@ static float uv_sphere_project(const Scene *scene,
|
|||||||
return max_u;
|
return max_u;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Similar to BM_mesh_calc_face_groups with added connectivity information. */
|
/* Similar to #BM_mesh_calc_face_groups with added connectivity information. */
|
||||||
blender::Vector<uv_face_branch> stack;
|
blender::Vector<uv_face_branch> stack;
|
||||||
stack.append({efa_init, branch_init});
|
stack.append({efa_init, branch_init});
|
||||||
|
|
||||||
|
@@ -50,7 +50,7 @@ VKContext::VKContext(void *ghost_window, void *ghost_context)
|
|||||||
|
|
||||||
VKBackend::capabilities_init(*this);
|
VKBackend::capabilities_init(*this);
|
||||||
|
|
||||||
/* For offscreen contexts. Default framebuffer is empty. */
|
/* For off-screen contexts. Default frame-buffer is empty. */
|
||||||
active_fb = back_left = new VKFrameBuffer("back_left");
|
active_fb = back_left = new VKFrameBuffer("back_left");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -42,7 +42,8 @@ struct ExportJobData {
|
|||||||
Depsgraph *depsgraph;
|
Depsgraph *depsgraph;
|
||||||
wmWindowManager *wm;
|
wmWindowManager *wm;
|
||||||
|
|
||||||
char unarchived_filepath[FILE_MAX]; /* unarchived_filepath is used for usda/usdc/usd export. */
|
/** Unarchived_filepath is used for USDA/USDC/USD export. */
|
||||||
|
char unarchived_filepath[FILE_MAX];
|
||||||
char usdz_filepath[FILE_MAX];
|
char usdz_filepath[FILE_MAX];
|
||||||
USDExportParams params;
|
USDExportParams params;
|
||||||
|
|
||||||
|
@@ -212,21 +212,21 @@ static void createVertRingMap(const int mvert_tot,
|
|||||||
|
|
||||||
/**
|
/**
|
||||||
* This method computes the Laplacian Matrix and Differential Coordinates
|
* This method computes the Laplacian Matrix and Differential Coordinates
|
||||||
* for all vertex in the mesh..
|
* for all vertex in the mesh.
|
||||||
* The Linear system is LV = d
|
* The Linear system is LV = d
|
||||||
* Where L is Laplacian Matrix, V as the vertices in Mesh, d is the differential coordinates
|
* Where L is Laplacian Matrix, V as the vertices in Mesh, d is the differential coordinates
|
||||||
* The Laplacian Matrix is computes as a
|
* The Laplacian Matrix is computes as a:
|
||||||
* Lij = sum(Wij) (if i == j)
|
* `Lij = sum(Wij) (if i == j)`
|
||||||
* Lij = Wij (if i != j)
|
* `Lij = Wij (if i != j)`
|
||||||
* Wij is weight between vertex Vi and vertex Vj, we use cotangent weight
|
* `Wij` is weight between vertex Vi and vertex Vj, we use cotangent weight
|
||||||
*
|
*
|
||||||
* The Differential Coordinate is computes as a
|
* The Differential Coordinate is computes as a:
|
||||||
* di = Vi * sum(Wij) - sum(Wij * Vj)
|
* `di = Vi * sum(Wij) - sum(Wij * Vj)`
|
||||||
* Where :
|
* Where:
|
||||||
* di is the Differential Coordinate i
|
* di is the Differential Coordinate i
|
||||||
* sum (Wij) is the sum of all weights between vertex Vi and its vertices neighbors (Vj)
|
* `sum (Wij)` is the sum of all weights between vertex Vi and its vertices neighbors (`Vj`).
|
||||||
* sum (Wij * Vj) is the sum of the product between vertex neighbor Vj and weight Wij
|
* `sum (Wij * Vj)` is the sum of the product between vertex neighbor `Vj` and weight `Wij`
|
||||||
* for all neighborhood.
|
* for all neighborhood.
|
||||||
*
|
*
|
||||||
* This Laplacian Matrix is described in the paper:
|
* This Laplacian Matrix is described in the paper:
|
||||||
* Desbrun M. et.al, Implicit fairing of irregular meshes using diffusion and curvature flow,
|
* Desbrun M. et.al, Implicit fairing of irregular meshes using diffusion and curvature flow,
|
||||||
|
@@ -7082,7 +7082,7 @@ static void pyrna_subtype_set_rna(PyObject *newclass, StructRNA *srna)
|
|||||||
PyObject_SetAttr(newclass, bpy_intern_str_bl_rna, item);
|
PyObject_SetAttr(newclass, bpy_intern_str_bl_rna, item);
|
||||||
Py_DECREF(item);
|
Py_DECREF(item);
|
||||||
|
|
||||||
/* Add staticmethods and classmethods. */
|
/* Add `staticmethod` and `classmethod` functions. */
|
||||||
{
|
{
|
||||||
const PointerRNA func_ptr = {NULL, srna, NULL};
|
const PointerRNA func_ptr = {NULL, srna, NULL};
|
||||||
const ListBase *lb;
|
const ListBase *lb;
|
||||||
@@ -7092,7 +7092,7 @@ static void pyrna_subtype_set_rna(PyObject *newclass, StructRNA *srna)
|
|||||||
for (link = lb->first; link; link = link->next) {
|
for (link = lb->first; link; link = link->next) {
|
||||||
FunctionRNA *func = (FunctionRNA *)link;
|
FunctionRNA *func = (FunctionRNA *)link;
|
||||||
const int flag = RNA_function_flag(func);
|
const int flag = RNA_function_flag(func);
|
||||||
if ((flag & FUNC_NO_SELF) && /* Is staticmethod or classmethod. */
|
if ((flag & FUNC_NO_SELF) && /* Is `staticmethod` or `classmethod`. */
|
||||||
(flag & FUNC_REGISTER) == false) /* Is not for registration. */
|
(flag & FUNC_REGISTER) == false) /* Is not for registration. */
|
||||||
{
|
{
|
||||||
/* We may want to set the type of this later. */
|
/* We may want to set the type of this later. */
|
||||||
|
@@ -155,7 +155,8 @@ static void pointdensity_cache_psys(
|
|||||||
ParticleSimulationData sim = {NULL};
|
ParticleSimulationData sim = {NULL};
|
||||||
ParticleData *pa = NULL;
|
ParticleData *pa = NULL;
|
||||||
float cfra = BKE_scene_ctime_get(scene);
|
float cfra = BKE_scene_ctime_get(scene);
|
||||||
int i /*, Childexists*/ /* UNUSED */;
|
int i;
|
||||||
|
// int childexists = 0; /* UNUSED */
|
||||||
int total_particles;
|
int total_particles;
|
||||||
int data_used;
|
int data_used;
|
||||||
float *data_vel, *data_life;
|
float *data_vel, *data_life;
|
||||||
|
@@ -54,6 +54,7 @@ dict_custom = {
|
|||||||
"canonicalizing",
|
"canonicalizing",
|
||||||
"catadioptric",
|
"catadioptric",
|
||||||
"checksums",
|
"checksums",
|
||||||
|
"chrominance",
|
||||||
"clearcoat",
|
"clearcoat",
|
||||||
"codecs",
|
"codecs",
|
||||||
"collapser",
|
"collapser",
|
||||||
|
Reference in New Issue
Block a user