Cleanup: spelling in comments
This commit is contained in:
@@ -41,7 +41,7 @@ ccl_device float light_tree_cos_bounding_box_angle(const BoundingBox bbox,
|
|||||||
(i & 2) ? bbox.max.y : bbox.min.y,
|
(i & 2) ? bbox.max.y : bbox.min.y,
|
||||||
(i & 4) ? bbox.max.z : bbox.min.z);
|
(i & 4) ? bbox.max.z : bbox.min.z);
|
||||||
|
|
||||||
/* Caculate the bounding box angle. */
|
/* Calculate the bounding box angle. */
|
||||||
float3 point_to_corner = normalize(corner - P);
|
float3 point_to_corner = normalize(corner - P);
|
||||||
cos_theta_u = fminf(cos_theta_u, dot(point_to_centroid, point_to_corner));
|
cos_theta_u = fminf(cos_theta_u, dot(point_to_centroid, point_to_corner));
|
||||||
}
|
}
|
||||||
@@ -461,7 +461,7 @@ ccl_device int light_tree_cluster_select_emitter(KernelGlobals kg,
|
|||||||
|
|
||||||
for (int i = 0; i < knode->num_prims; i++) {
|
for (int i = 0; i < knode->num_prims; i++) {
|
||||||
int current_index = -knode->child_index + i;
|
int current_index = -knode->child_index + i;
|
||||||
/* maximum importance = importance[0], mininum importance = importance[1] */
|
/* maximum importance = importance[0], minimum importance = importance[1] */
|
||||||
float importance[2];
|
float importance[2];
|
||||||
light_tree_emitter_importance<in_volume_segment>(
|
light_tree_emitter_importance<in_volume_segment>(
|
||||||
kg, P, N_or_D, t, has_transmission, current_index, importance[0], importance[1]);
|
kg, P, N_or_D, t, has_transmission, current_index, importance[0], importance[1]);
|
||||||
|
|||||||
@@ -1045,7 +1045,7 @@ void LightManager::device_update_lights(Device *device, DeviceScene *dscene, Sce
|
|||||||
const float tan_half_spread = light->spread == M_PI_F ? FLT_MAX : tanf(half_spread);
|
const float tan_half_spread = light->spread == M_PI_F ? FLT_MAX : tanf(half_spread);
|
||||||
/* Normalization computed using:
|
/* Normalization computed using:
|
||||||
* integrate cos(x) * (1 - tan(x) / tan(a)) * sin(x) from x = 0 to a, a being half_spread.
|
* integrate cos(x) * (1 - tan(x) / tan(a)) * sin(x) from x = 0 to a, a being half_spread.
|
||||||
* Divided by tan_half_spread to simplify the attentuation computation in `area.h`. */
|
* Divided by tan_half_spread to simplify the attenuation computation in `area.h`. */
|
||||||
const float normalize_spread = 1.0f / (tan_half_spread - half_spread);
|
const float normalize_spread = 1.0f / (tan_half_spread - half_spread);
|
||||||
|
|
||||||
dir = safe_normalize(dir);
|
dir = safe_normalize(dir);
|
||||||
|
|||||||
@@ -33,7 +33,7 @@ struct OrientationBounds {
|
|||||||
|
|
||||||
enum empty_t { empty = 0 };
|
enum empty_t { empty = 0 };
|
||||||
|
|
||||||
/* If the orientation bound is set to empty, the values are set to minumums
|
/* If the orientation bound is set to empty, the values are set to minimums
|
||||||
* so that merging it with another non-empty orientation bound guarantees that
|
* so that merging it with another non-empty orientation bound guarantees that
|
||||||
* the return value is equal to non-empty orientation bound. */
|
* the return value is equal to non-empty orientation bound. */
|
||||||
__forceinline OrientationBounds(empty_t)
|
__forceinline OrientationBounds(empty_t)
|
||||||
|
|||||||
@@ -1508,7 +1508,7 @@ void uiItemsFullEnumO_items(uiLayout *layout,
|
|||||||
bool last_iter = false;
|
bool last_iter = false;
|
||||||
const EnumPropertyItem *item = item_array;
|
const EnumPropertyItem *item = item_array;
|
||||||
for (int i = 1; item->identifier && !last_iter; i++, item++) {
|
for (int i = 1; item->identifier && !last_iter; i++, item++) {
|
||||||
/* handle oversized pies */
|
/* Handle over-sized pies. */
|
||||||
if (radial && (totitem > PIE_MAX_ITEMS) && (i >= PIE_MAX_ITEMS)) {
|
if (radial && (totitem > PIE_MAX_ITEMS) && (i >= PIE_MAX_ITEMS)) {
|
||||||
if (item->name) { /* only visible items */
|
if (item->name) { /* only visible items */
|
||||||
const EnumPropertyItem *tmp;
|
const EnumPropertyItem *tmp;
|
||||||
|
|||||||
@@ -3885,7 +3885,7 @@ void GEO_uv_parametrizer_face_add(ParamHandle *phandle,
|
|||||||
while (i >= 0) {
|
while (i >= 0) {
|
||||||
/* Just check the "ears" of the n-gon.
|
/* Just check the "ears" of the n-gon.
|
||||||
* For quads, this is sufficient.
|
* For quads, this is sufficient.
|
||||||
* For pents and higher, we might miss internal duplicate triangles, but note
|
* For pentagons and higher, we might miss internal duplicate triangles, but note
|
||||||
* that such cases are rare if the source geometry is manifold and non-intersecting. */
|
* that such cases are rare if the source geometry is manifold and non-intersecting. */
|
||||||
int pm = permute.size();
|
int pm = permute.size();
|
||||||
BLI_assert(pm > 3);
|
BLI_assert(pm > 3);
|
||||||
|
|||||||
Reference in New Issue
Block a user