File 1359-Fix-typos-in-lib-runtime_tools.patch of Package erlang
From f7857b87c7e1684671f5847e712ac162ca32f79b Mon Sep 17 00:00:00 2001
From: "Kian-Meng, Ang" <kianmeng@cpan.org>
Date: Tue, 28 Dec 2021 13:56:17 +0800
Subject: [PATCH] Fix typos in lib/runtime_tools
---
lib/runtime_tools/c_src/trace_file_drv.c | 2 +-
lib/runtime_tools/c_src/trace_ip_drv.c | 8 ++++----
lib/runtime_tools/doc/src/LTTng.xml | 2 +-
lib/runtime_tools/doc/src/dyntrace.xml | 2 +-
lib/runtime_tools/doc/src/system_information.xml | 2 +-
lib/runtime_tools/src/appmon_info.erl | 10 +++++-----
lib/runtime_tools/src/erts_alloc_config.erl | 4 ++--
lib/runtime_tools/src/system_information.erl | 2 +-
lib/runtime_tools/test/dbg_SUITE_data/dbg_test.erl | 4 ++--
9 files changed, 18 insertions(+), 18 deletions(-)
diff --git a/lib/runtime_tools/c_src/trace_file_drv.c b/lib/runtime_tools/c_src/trace_file_drv.c
index e7fd5968c1..cb09b33da9 100644
--- a/lib/runtime_tools/c_src/trace_file_drv.c
+++ b/lib/runtime_tools/c_src/trace_file_drv.c
@@ -117,7 +117,7 @@
** 0 = binary, 1 = drop
** If Op is 1, then Size reflects the number of dropped messages. The
** op 1 is never used in this driver.
-** Size, a 32 bit interger in network byte order:
+** Size, a 32 bit integer in network byte order:
** Either the size of the binary term, or the number of packet's dropped.
** Term, an array of bytes:
** An erlang term in the external format or simply empty if Op == 1, the
diff --git a/lib/runtime_tools/c_src/trace_ip_drv.c b/lib/runtime_tools/c_src/trace_ip_drv.c
index 195558f958..f21d4a86f7 100644
--- a/lib/runtime_tools/c_src/trace_ip_drv.c
+++ b/lib/runtime_tools/c_src/trace_ip_drv.c
@@ -68,7 +68,7 @@
** The number of messages to que up before dropping.
** Fl, ascii string representing a flag byte:
** 0x1 -> Drop oldest when que is full (instead of last arrived)
-** 0x2 -> Fill the que even if noone is listening.
+** 0x2 -> Fill the que even if no one is listening.
**
** The package sent over the network looks like this:
** +--+--------+-----------------------------------+
@@ -77,7 +77,7 @@
** Op, a char:
** 0 = binary, 1 = drop
** If Op is 1, then Size reflects the number of dropped messages.
-** Size, a 32 bit interger in network byte order:
+** Size, a 32 bit integer in network byte order:
** Either the size of the binary term, or the number of packet's dropped.
** Term, an array of bytes:
** An erlang term in the external format or simply empty if Op == 1, the
@@ -86,7 +86,7 @@
/*
** SO, most of the differences between WinDoze and Posixish OS'es
-** is handeled here, but the multiplexing (driver_select) is also quite
+** is handled here, but the multiplexing (driver_select) is also quite
** interesting, see my_driver_select further down in the file...
*/
@@ -677,7 +677,7 @@ static TraceIpMessage *make_buffer(int datasiz, unsigned char op,
/*
** Add message to que, discarding in a politically correct way...
-** The FLAG_DROP_OLDEST is currently ingored...
+** The FLAG_DROP_OLDEST is currently ignored...
*/
static void enque_message(TraceIpData *data, char *buff, int bufflen,
int byteswritten)
diff --git a/lib/runtime_tools/doc/src/LTTng.xml b/lib/runtime_tools/doc/src/LTTng.xml
index 7567d4ba43..00e1537176 100644
--- a/lib/runtime_tools/doc/src/LTTng.xml
+++ b/lib/runtime_tools/doc/src/LTTng.xml
@@ -521,7 +521,7 @@ Eshell V8.0 (abort with ^G)
<pre>1> <input>l(dyntrace).</input>
{module,dyntrace}</pre>
- <p>All tracepoints via dyntrace are now visibile and can be listed through <c>lttng list -u</c>.</p>
+ <p>All tracepoints via dyntrace are now visible and can be listed through <c>lttng list -u</c>.</p>
<p>Enable the process_register LTTng tracepoint for Erlang.</p>
diff --git a/lib/runtime_tools/doc/src/dyntrace.xml b/lib/runtime_tools/doc/src/dyntrace.xml
index d3b348e850..5971740b87 100644
--- a/lib/runtime_tools/doc/src/dyntrace.xml
+++ b/lib/runtime_tools/doc/src/dyntrace.xml
@@ -171,7 +171,7 @@
<desc>
<p>This function controls if user tags are to be spread to other processes with the next message. Spreading of user tags work like spreading of sequential trace tokens, so that a received user tag will be active in the process until the next message arrives (if that message does not also contain the user tag.</p>
<p>This functionality is used when a client process communicates with a file i/o-server to spread the user tag to the I/O-server and then down to the efile_drv driver. By using <c>spread_tag/1</c> and <c>restore_tag/1</c>, one can enable or disable spreading of user tags to other processes and then restore the previous state of the user tag. The TagData returned from this call contains all previous information so the state (including any previously spread user tags) will be completely restored by a later call to <c>restore_tag/1</c>.</p>
- <p>The <seealso marker="kernel:file">file</seealso> module already spread's tags, so there is noo need to manually call these function to get user tags spread to the efile driver through that module.</p>
+ <p>The <seealso marker="kernel:file">file</seealso> module already spread's tags, so there is no need to manually call these function to get user tags spread to the efile driver through that module.</p>
<p>The most use of this function would be if one for example uses the <seealso marker="stdlib:io">io</seealso> module to communicate with an I/O-server for a regular file, like in the following example:</p>
<pre>
f() ->
diff --git a/lib/runtime_tools/doc/src/system_information.xml b/lib/runtime_tools/doc/src/system_information.xml
index f52f461ddb..b8ccc73418 100644
--- a/lib/runtime_tools/doc/src/system_information.xml
+++ b/lib/runtime_tools/doc/src/system_information.xml
@@ -74,7 +74,7 @@
versions</seealso> of the same application installed in the
system, but you do not use a
<seealso marker="doc/system_principles:system_principles#BOOTSCRIPT">boot
- script</seealso> identifing the correct application version.</p>
+ script</seealso> identifying the correct application version.</p>
</item>
</taglist>
<p>Currently the sanity check is limited to verifying
diff --git a/lib/runtime_tools/src/appmon_info.erl b/lib/runtime_tools/src/appmon_info.erl
index ebff52664d..ad08a6c66f 100644
--- a/lib/runtime_tools/src/appmon_info.erl
+++ b/lib/runtime_tools/src/appmon_info.erl
@@ -40,11 +40,11 @@
%% have a nice public interface function which should handle task
%% administration. Tasks are identified by a "key" consisting of
%% three items, the requesting pid, the name of the task and the
-%% task auxillary parameter. The requesting pid is the pid of the
+%% task auxiliary parameter. The requesting pid is the pid of the
%% callee (in the appmon case it can be the node window for
%% instance), the task name is whatever name the task is given
%% (in the appmon case it can be app, app_ctrl or load). The task
-%% name can be seen as the type of the task. The task auxillary
+%% name can be seen as the type of the task. The task auxiliary
%% parameter is an all purpose parameter that have a different
%% meaning for each type of task so in appmon the Aux for app
%% contains the root pid of the monitored application and in
@@ -136,7 +136,7 @@
%%----------------------------------------------------------------------
%% Public interface
%%
-%% The Aux parameter is an auxillary parameter that can be used
+%% The Aux parameter is an auxiliary parameter that can be used
%% freely by the requesting process, it is included in the work
%% task key. appmon uses it for storing the node name when
%% requesting load and app_ctrl tasks, and appmon_a uses it for
@@ -149,7 +149,7 @@
%% Do not use gen_server:start_link because we do not want the
%% appmon_info to die when initiating process dies unless special
%% conditions apply.
-%% Uhu, we don't??? Made a fix so that this proces DOES indeed die
+%% Uhu, we don't??? Made a fix so that this process DOES indeed die
%% if it's starter dies. /Gunilla
start_link(Node, Client, Opts) ->
rpc:call(Node, ?MODULE, start_link2, [self(), Client, Opts]).
@@ -473,7 +473,7 @@ get_pid(X) when is_tuple(X) -> element(2, X).
%----------------------------------------------------------------------
%%---------------------------------------------------------------------
-%% Handling process trees of processses that are linked to each other
+%% Handling process trees of processes that are linked to each other
do_find_proc(Mode, DB, GL, Avoid) ->
case get_next(DB) of
diff --git a/lib/runtime_tools/src/erts_alloc_config.erl b/lib/runtime_tools/src/erts_alloc_config.erl
index ed36fe0589..dcf2eb7d55 100644
--- a/lib/runtime_tools/src/erts_alloc_config.erl
+++ b/lib/runtime_tools/src/erts_alloc_config.erl
@@ -265,7 +265,7 @@ strategy_str(aoff) ->
strategy_str(aoffcbf) ->
"Address order first fit carrier best fit";
strategy_str(aoffcaobf) ->
- "Address order first fit carrier adress order best fit".
+ "Address order first fit carrier address order best fit".
default_acul(A, S) ->
case carrier_migration_support(S) of
diff --git a/lib/runtime_tools/src/system_information.erl b/lib/runtime_tools/src/system_information.erl
index 9bbb87dfb4..73b4e24847 100644
--- a/lib/runtime_tools/src/system_information.erl
+++ b/lib/runtime_tools/src/system_information.erl
@@ -849,7 +849,7 @@ get_apps([Path|Paths], Apps) ->
[AppFile] ->
get_apps(Paths, [app_file_to_app(AppFile) | Apps]);
[_AppFile| _] = AppFiles ->
- %% Strange with multple .app files... Lets put them
+ %% Strange with multiple .app files... Lets put them
%% all in the list and see what we get...
lists:map(fun (AF) ->
app_file_to_app(AF)
diff --git a/lib/runtime_tools/test/dbg_SUITE_data/dbg_test.erl b/lib/runtime_tools/test/dbg_SUITE_data/dbg_test.erl
index 68ece5936e..210b25f720 100644
--- a/lib/runtime_tools/test/dbg_SUITE_data/dbg_test.erl
+++ b/lib/runtime_tools/test/dbg_SUITE_data/dbg_test.erl
@@ -23,10 +23,10 @@
%%% This module implements a priority queue as defined in
%%% "Priority Queues and the STL" by Mark Nelson in Dr.Dobb's Journal, Jan 1996
%%% see http://web2.airmail.net/markn/articles/pq_stl/priority.htm for more
-%%% information. (A heap implementation is planned aswell)
+%%% information. (A heap implementation is planned as well)
%%%----------------------------------------------------------------------
%%% The items of the queue is kept priority sorted, and because of that,
-%%% a push() operation costs more than a pop() operation (wich only
+%%% a push() operation costs more than a pop() operation (which only
%%% needs to return the top item of the queue(read: list)).
%%%----------------------------------------------------------------------
%%% The priority queue can be deceptively nice to use when creating for
--
2.31.1
