Cleanup: duplicate words in comments

This commit is contained in:
Campbell Barton 2023-03-29 14:16:26 +11:00
parent 43f6df853f
commit 35f770a689
15 changed files with 22 additions and 22 deletions

View File

@ -179,8 +179,8 @@ ccl_device_inline void surface_shader_validate_bsdf_sample(const KernelGlobals k
const float2 org_roughness, const float2 org_roughness,
const float org_eta) const float org_eta)
{ {
/* Validate the the bsdf_label and bsdf_roughness_eta functions /* Validate the #bsdf_label and #bsdf_roughness_eta functions
* by estimating the values after a bsdf sample. */ * by estimating the values after a BSDF sample. */
const int comp_label = bsdf_label(kg, sc, wo); const int comp_label = bsdf_label(kg, sc, wo);
kernel_assert(org_label == comp_label); kernel_assert(org_label == comp_label);

View File

@ -569,10 +569,10 @@ void LightManager::device_update_tree(Device *,
* To do so, we repeatedly move to the left child of the current node until we reach the leftmost * To do so, we repeatedly move to the left child of the current node until we reach the leftmost
* descendant, while keeping track of the right child of each node we visited by storing the * descendant, while keeping track of the right child of each node we visited by storing the
* pointer in the `right_node_stack`. * pointer in the `right_node_stack`.
* Once finished visiting the left subtree, we retrieve the the last stored pointer from * Once finished visiting the left subtree, we retrieve the last stored pointer from
* `right_node_stack`, assign it to its parent (retrieved from `left_index_stack`), and repeat * `right_node_stack`, assign it to its parent (retrieved from `left_index_stack`), and repeat
* the process from there. */ * the process from there. */
int left_index_stack[32]; /* sizeof(bit_trail) * 8 == 32 */ int left_index_stack[32]; /* `sizeof(bit_trail) * 8 == 32`. */
LightTreeNode *right_node_stack[32]; LightTreeNode *right_node_stack[32];
int stack_id = 0; int stack_id = 0;
const LightTreeNode *node = light_tree.get_root(); const LightTreeNode *node = light_tree.get_root();

View File

@ -1198,7 +1198,7 @@ int GHOST_XrGetControllerModelData(GHOST_XrContextHandle xr_context,
* Get Vulkan handles for the given context. * Get Vulkan handles for the given context.
* *
* These handles are the same for a given context. * These handles are the same for a given context.
* Should should only be called when using a Vulkan context. * Should only be called when using a Vulkan context.
* Other contexts will not return any handles and leave the * Other contexts will not return any handles and leave the
* handles where the parameters are referring to unmodified. * handles where the parameters are referring to unmodified.
* *
@ -1234,7 +1234,7 @@ void GHOST_GetVulkanHandles(GHOST_ContextHandle context,
* At the start of each frame the correct command buffer should be * At the start of each frame the correct command buffer should be
* retrieved with this function. * retrieved with this function.
* *
* Should should only be called when using a Vulkan context. * Should only be called when using a Vulkan context.
* Other contexts will not return any handles and leave the * Other contexts will not return any handles and leave the
* handles where the parameters are referring to unmodified. * handles where the parameters are referring to unmodified.
* *
@ -1251,7 +1251,7 @@ void GHOST_GetVulkanCommandBuffer(GHOST_ContextHandle context, void *r_command_b
* Gets the Vulkan back-buffer 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 back-buffer will change. * Needs to be called after each swap event as the back-buffer will change.
* *
* Should should only be called when using a Vulkan context with an active swap chain. * Should only be called when using a Vulkan context with an active swap chain.
* Other contexts will not return any handles and leave the * Other contexts will not return any handles and leave the
* handles where the parameters are referring to unmodified. * handles where the parameters are referring to unmodified.
* *

View File

@ -44,7 +44,7 @@ class GHOST_IContext {
* Get Vulkan handles for the given context. * Get Vulkan handles for the given context.
* *
* These handles are the same for a given context. * These handles are the same for a given context.
* Should should only be called when using a Vulkan context. * Should only be called when using a Vulkan context.
* Other contexts will not return any handles and leave the * Other contexts will not return any handles and leave the
* handles where the parameters are referring to unmodified. * handles where the parameters are referring to unmodified.
* *

View File

@ -139,7 +139,7 @@ class GHOST_Context : public GHOST_IContext {
* Get Vulkan handles for the given context. * Get Vulkan handles for the given context.
* *
* These handles are the same for a given context. * These handles are the same for a given context.
* Should should only be called when using a Vulkan context. * Should only be called when using a Vulkan context.
* Other contexts will not return any handles and leave the * Other contexts will not return any handles and leave the
* handles where the parameters are referring to unmodified. * handles where the parameters are referring to unmodified.
* *

View File

@ -114,7 +114,7 @@ struct GWL_Window {
*/ */
wl_fixed_t scale_fractional = 0; wl_fixed_t scale_fractional = 0;
/** A temporary token used for the window to be notified of of it's activation. */ /** A temporary token used for the window to be notified of it's activation. */
struct xdg_activation_token_v1 *xdg_activation_token = nullptr; struct xdg_activation_token_v1 *xdg_activation_token = nullptr;
#ifdef WITH_GHOST_WAYLAND_LIBDECOR #ifdef WITH_GHOST_WAYLAND_LIBDECOR

View File

@ -174,7 +174,7 @@ class Rall2d
friend INLINE Rall2d<T,V,S> operator +(S s,const Rall2d<T,V,S>& v); friend INLINE Rall2d<T,V,S> operator +(S s,const Rall2d<T,V,S>& v);
friend INLINE Rall2d<T,V,S> operator +(const Rall2d<T,V,S>& v,S s); friend INLINE Rall2d<T,V,S> operator +(const Rall2d<T,V,S>& v,S s);
friend INLINE Rall2d<T,V,S> operator -(S s,const Rall2d<T,V,S>& v); friend INLINE Rall2d<T,V,S> operator -(S s,const Rall2d<T,V,S>& v);
friend INLINE INLINE Rall2d<T,V,S> operator -(const Rall2d<T,V,S>& v,S s); friend INLINE Rall2d<T,V,S> operator -(const Rall2d<T,V,S>& v,S s);
friend INLINE Rall2d<T,V,S> operator /(S s,const Rall2d<T,V,S>& v); friend INLINE Rall2d<T,V,S> operator /(S s,const Rall2d<T,V,S>& v);
friend INLINE Rall2d<T,V,S> operator /(const Rall2d<T,V,S>& v,S s); friend INLINE Rall2d<T,V,S> operator /(const Rall2d<T,V,S>& v,S s);

View File

@ -62,8 +62,8 @@ void delete_MEM_CacheLimiter(MEM_CacheLimiterC *This);
/** /**
* Manage object * Manage object
* *
* \param This: "This" pointer, data data object to manage. * \param This: "This" pointer, data object to manage.
* \return CacheLimiterHandle to ref, unref, touch the managed object * \return The handle to reference/unreference & touch the managed object.
*/ */
MEM_CacheLimiterHandleC *MEM_CacheLimiter_insert(MEM_CacheLimiterC *This, void *data); MEM_CacheLimiterHandleC *MEM_CacheLimiter_insert(MEM_CacheLimiterC *This, void *data);

View File

@ -30,7 +30,7 @@ template<typename T> class OffsetIndices {
BLI_assert(std::is_sorted(offsets_.begin(), offsets_.end())); BLI_assert(std::is_sorted(offsets_.begin(), offsets_.end()));
} }
/** Return the total number of elements in the the referenced arrays. */ /** Return the total number of elements in the referenced arrays. */
T total_size() const T total_size() const
{ {
return offsets_.last(); return offsets_.last();

View File

@ -156,7 +156,7 @@
/** /**
* Singe bytes (or boolean) arrays need a higher number of steps * Singe bytes (or boolean) arrays need a higher number of steps
* because the resulting values are not unique enough to result in evenly distributed values. * because the resulting values are not unique enough to result in evenly distributed values.
* Use more accumulation when the the size of the structs is small, see: #105046. * Use more accumulation when the size of the structs is small, see: #105046.
* *
* With 6 -> 22, one byte each - means an array of booleans can be combine into 22 bits * With 6 -> 22, one byte each - means an array of booleans can be combine into 22 bits
* representing 4,194,303 different combinations. * representing 4,194,303 different combinations.

View File

@ -727,7 +727,7 @@ static void get_min_max_of_nodes(const Span<bNode *> nodes,
} }
/** /**
* Skip reroute nodes when finding the the socket to use as an example for a new group interface * Skip reroute nodes when finding the socket to use as an example for a new group interface
* item. This moves "inward" into nodes selected for grouping to find properties like whether a * item. This moves "inward" into nodes selected for grouping to find properties like whether a
* connected socket has a hidden value. It only works in trivial situations-- a single line of * connected socket has a hidden value. It only works in trivial situations-- a single line of
* connected reroutes with no branching. * connected reroutes with no branching.

View File

@ -12,7 +12,7 @@
* `INST` suffix means instance, which means the shader is build to leverage instancing * `INST` suffix means instance, which means the shader is build to leverage instancing
* capabilities to reduce the number of draw-calls. * capabilities to reduce the number of draw-calls.
* *
* For full list of parameters, search for the the associated #ShaderCreateInfo. * For full list of parameters, search for the associated #ShaderCreateInfo.
* Example: `GPU_SHADER_ICON` is defined by `GPU_SHADER_CREATE_INFO(gpu_shader_icon)` * Example: `GPU_SHADER_ICON` is defined by `GPU_SHADER_CREATE_INFO(gpu_shader_icon)`
* Some parameters are builtins and are set automatically (ex: `ModelViewProjectionMatrix`). * Some parameters are builtins and are set automatically (ex: `ModelViewProjectionMatrix`).
*/ */

View File

@ -424,7 +424,7 @@ void GPU_unpack_row_length_set(uint len);
* Update the content of a texture's base mip-map level (mip 0). * Update the content of a texture's base mip-map level (mip 0).
* \a data_format is the format of the \a data . It needs to be compatible with the internal * \a data_format is the format of the \a data . It needs to be compatible with the internal
* texture storage. * texture storage.
* The \a data should be be the size of the entire mip 0 level. * The \a data should be the size of the entire mip 0 level.
* \note This function only update the content of mip 0. Either specify other mips or use * \note This function only update the content of mip 0. Either specify other mips or use
* `GPU_texture_update_mipmap_chain` to generate them if needed. * `GPU_texture_update_mipmap_chain` to generate them if needed.
*/ */
@ -434,7 +434,7 @@ void GPU_texture_update(GPUTexture *texture, eGPUDataFormat data_format, const v
* Update the content of a region of a texture's base mip-map level (mip 0). * Update the content of a region of a texture's base mip-map level (mip 0).
* \a data_format is the format of the \a data . It needs to be compatible with the internal * \a data_format is the format of the \a data . It needs to be compatible with the internal
* texture storage. * texture storage.
* The \a data should be be the size of the mip 0 level region. * The \a data should be the size of the mip 0 level region.
* \note This function only update the content of mip 0. Either specify other mips or use * \note This function only update the content of mip 0. Either specify other mips or use
* `GPU_texture_update_mipmap_chain` to generate them if needed. * `GPU_texture_update_mipmap_chain` to generate them if needed.
* *
@ -455,7 +455,7 @@ void GPU_texture_update_sub(GPUTexture *texture,
* Update the content of a texture's specific mip-map level. * Update the content of a texture's specific mip-map level.
* \a data_format is the format of the \a pixels . It needs to be compatible with the internal * \a data_format is the format of the \a pixels . It needs to be compatible with the internal
* texture storage. * texture storage.
* The \a data should be be the size of the entire \a mip_level . * The \a data should be the size of the entire \a mip_level .
*/ */
void GPU_texture_update_mipmap(GPUTexture *texture, void GPU_texture_update_mipmap(GPUTexture *texture,
int mip_level, int mip_level,

View File

@ -792,7 +792,7 @@ MTLRenderPipelineStateInstance *MTLShader::bake_current_pipeline_state(
return bake_pipeline_state(ctx, prim_type, pipeline_descriptor); return bake_pipeline_state(ctx, prim_type, pipeline_descriptor);
} }
/* Variant which bakes a pipeline state based on an an existing MTLRenderPipelineStateDescriptor. /* Variant which bakes a pipeline state based on an existing MTLRenderPipelineStateDescriptor.
* This function should be callable from a secondary compilation thread. */ * This function should be callable from a secondary compilation thread. */
MTLRenderPipelineStateInstance *MTLShader::bake_pipeline_state( MTLRenderPipelineStateInstance *MTLShader::bake_pipeline_state(
MTLContext *ctx, MTLContext *ctx,

View File

@ -105,7 +105,7 @@ typedef struct IDPropertyUIDataString {
typedef struct IDPropertyUIDataID { typedef struct IDPropertyUIDataID {
IDPropertyUIData base; IDPropertyUIData base;
/** /**
* #ID_Type. This type type is not enforced. It is just a hint to the ui for what kind of ID is * #ID_Type. This type is not enforced. It is just a hint to the ui for what kind of ID is
* expected. If this is zero, any id type is expected. * expected. If this is zero, any id type is expected.
*/ */
short id_type; short id_type;