Spelling src

These are non-functional changes.

* accounting
* activation
* actual
* added
* addresult
* aggregable
* aligned
* alternatively
* ambiguous
* analysis
* analyzer
* anticlimactic
* apparently
* application
* appropriate
* arithmetic
* assignment
* assigns
* associated
* authentication
* authoritative
* barrier
* boundary
* broccoli
* buffering
* caching
* called
* canonicalized
* capturing
* certificates
* ciphersuite
* columns
* communication
* comparison
* comparisons
* compilation
* component
* concatenating
* concatenation
* connection
* convenience
* correctly
* corresponding
* could
* counting
* data
* declared
* decryption
* defining
* dependent
* deprecated
* detached
* dictionary
* directional
* directly
* directory
* discarding
* disconnecting
* distinguishes
* documentation
* elsewhere
* emitted
* empty
* endianness
* endpoint
* enumerator
* essentially
* evaluated
* everything
* exactly
* execute
* explicit
* expressions
* facilitates
* fiddling
* filesystem
* flag
* flagged
* for
* fragments
* guarantee
* guaranteed
* happen
* happening
* hemisphere
* identifier
* identifies
* identify
* implementation
* implemented
* implementing
* including
* inconsistency
* indeterminate
* indices
* individual
* information
* initial
* initialization
* initialize
* initialized
* initializes
* instantiate
* instantiated
* instantiates
* interface
* internal
* interpreted
* interpreter
* into
* it
* iterators
* length
* likely
* log
* longer
* mainly
* mark
* maximum
* message
* minimum
* module
* must
* name
* namespace
* necessary
* nonexistent
* not
* notifications
* notifier
* number
* objects
* occurred
* operations
* original
* otherwise
* output
* overridden
* override
* overriding
* overwriting
* ownership
* parameters
* particular
* payload
* persistent
* potential
* precision
* preexisting
* preservation
* preserved
* primarily
* probably
* procedure
* proceed
* process
* processed
* processes
* processing
* propagate
* propagated
* prototype
* provides
* publishing
* purposes
* queue
* reached
* reason
* reassem
* reassemble
* reassembler
* recommend
* record
* reduction
* reference
* regularly
* representation
* request
* reserved
* retrieve
* returning
* separate
* should
* shouldn't
* significant
* signing
* simplified
* simultaneously
* single
* somebody
* sources
* specific
* specification
* specified
* specifies
* specify
* statement
* subdirectories
* succeeded
* successful
* successfully
* supplied
* synchronization
* tag
* temporarily
* terminating
* that
* the
* transmitted
* true
* truncated
* try
* understand
* unescaped
* unforwarding
* unknown
* unknowndata
* unspecified
* update
* usually
* which
* wildcard

Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
This commit is contained in:
Josh Soref 2022-10-23 16:00:49 -04:00
parent d65c75e2ad
commit cd201aa24e
188 changed files with 432 additions and 432 deletions

View file

@ -155,7 +155,7 @@ void BasicThread::Join()
void BasicThread::Kill()
{
// We don't *really* kill the thread here because that leads to race
// conditions. Instead we set a flag that parts of the the code need
// conditions. Instead we set a flag that parts of the code need
// to check and get out of any loops they might be in.
terminating = true;
killed = true;

View file

@ -209,7 +209,7 @@ private:
uint32_t buf_len;
char* buf;
// For implementating Strerror().
// For implementing Strerror().
char* strerr_buffer;
static uint64_t thread_counter;

View file

@ -29,7 +29,7 @@ protected:
/**
* The thread manager coordinates all child threads. Once a BasicThread is
* instantitated, it gets addedd to the manager, which will delete it later
* instantiated, it gets added to the manager, which will delete it later
* once it has terminated.
*
* In addition to basic threads, the manager also provides additional
@ -79,7 +79,7 @@ public:
/**
* Returns the number of currently active threads. This counts all
* threads that are not yet joined, includingt any potentially in
* threads that are not yet joined, including any potentially in
* Terminating() state.
*/
int NumThreads() const { return all_threads.size(); }

View file

@ -105,7 +105,7 @@ private:
Type type;
};
// A message from the the child to the main process, requesting suicide.
// A message from the child to the main process, requesting suicide.
class KillMeMessage final : public OutputMessage<MsgThread>
{
public:

View file

@ -60,7 +60,7 @@ public:
virtual ~MsgThread();
/**
* Sends a message to the child thread. The message will be proceesed
* Sends a message to the child thread. The message will be processed
* once the thread has retrieved it from its incoming queue.
*
* Only the main thread may call this method.
@ -74,7 +74,7 @@ public:
*
* Only the child thread may call this method.
*
* @param msg The mesasge.
* @param msg The message.
*/
void SendOut(BasicOutputMessage* msg) { return SendOut(msg, false); }
@ -107,7 +107,7 @@ public:
*
* Only the child thread may call this method.
*
* Can be overriden in derived classed to hook into the error handling
* Can be overridden in derived classed to hook into the error handling
* but must should generally also call the parent implementation. Note
* that this method is always called by the child thread and must not access
* data or datastructures of the main thread directly.
@ -123,7 +123,7 @@ public:
*
* Only the child thread may call this method.
*
* Can be overriden in derived classed to hook into the error handling
* Can be overridden in derived classed to hook into the error handling
* but must should generally also call the parent implementation. Note
* that this method is always called by the child thread and must not access
* data or datastructures of the main thread directly.
@ -242,7 +242,7 @@ protected:
*
* This is method is called regularly by the threading::Manager.
*
* Can be overriden in derived classed to hook into the heart beat
* Can be overridden in derived classed to hook into the heart beat
* sending, but must call the parent implementation. Note that this
* method is always called by the main thread and must not access
* data of the child thread directly. Implement OnHeartbeat() if you
@ -257,7 +257,7 @@ protected:
bool Failed() const { return failed; }
/**
* Regulatly triggered for execution in the child thread.
* Regularly triggered for execution in the child thread.
*
* network_time: The network_time when the heartbeat was trigger by
* the main thread.
@ -273,7 +273,7 @@ protected:
virtual bool OnFinish(double network_time) = 0;
/**
* Overriden from BasicThread.
* Overridden from BasicThread.
*/
void Run() override;
void OnWaitForStop() override;
@ -389,9 +389,9 @@ public:
const char* Name() const { return name; }
/**
* Callback that must be overriden for processing a message.
* Callback that must be overridden for processing a message.
*/
virtual bool Process() = 0; // Thread will be terminated if returngin false.
virtual bool Process() = 0; // Thread will be terminated if returning false.
protected:
/**

View file

@ -23,7 +23,7 @@ namespace zeek::threading
*
* All Queue instances must be instantiated by Zeek's main thread.
*
* TODO: Unclear how critical performance is for this qeueue. We could likely
* TODO: Unclear how critical performance is for this queue. We could likely
* optimize it further if helpful.
*/
template <typename T> class Queue
@ -33,7 +33,7 @@ public:
* Constructor.
*
* reader, writer: The corresponding threads. This is for checking
* whether they have terminated so that we can abort I/O opeations.
* whether they have terminated so that we can abort I/O operations.
* Can be left null for the main thread.
*/
Queue(BasicThread* arg_reader, BasicThread* arg_writer);
@ -233,7 +233,7 @@ template <typename T> inline uint64_t Queue<T>::Size()
template <typename T> inline void Queue<T>::GetStats(Stats* stats)
{
// To be safe, we look all queues. That's probably unneccessary, but
// To be safe, we look all queues. That's probably unnecessary, but
// doesn't really hurt.
auto locks = LocksForAllQueues();

View file

@ -78,7 +78,7 @@ struct Field
* @param fmt The serialization format to use. The format handles
* low-level I/O.
*
* @return False if an error occured.
* @return False if an error occurred.
*/
bool Read(zeek::detail::SerializationFormat* fmt);
@ -88,7 +88,7 @@ struct Field
* @param fmt The serialization format to use. The format handles
* low-level I/O.
*
* @return False if an error occured.
* @return False if an error occurred.
*/
bool Write(zeek::detail::SerializationFormat* fmt) const;
@ -106,7 +106,7 @@ private:
/**
* Definition of a log value, i.e., a entry logged by a stream.
*
* This struct essentialy represents a serialization of a Val instance (for
* This struct essentially represents a serialization of a Val instance (for
* those Vals supported).
*/
struct Value
@ -211,7 +211,7 @@ struct Value
*
* @param fmt The serialization format to use. The format handles low-level I/O.
*
* @return False if an error occured.
* @return False if an error occurred.
*/
bool Read(zeek::detail::SerializationFormat* fmt);
@ -221,7 +221,7 @@ struct Value
* @param fmt The serialization format to use. The format handles
* low-level I/O.
*
* @return False if an error occured.
* @return False if an error occurred.
*/
bool Write(zeek::detail::SerializationFormat* fmt) const;

View file

@ -16,7 +16,7 @@ namespace zeek::threading::formatter
{
// If the value we'd write out would match exactly the a reserved string, we
// escape the first character so that the output won't be ambigious. If this
// escape the first character so that the output won't be ambiguous. If this
// function returns true, it has added an escaped version of data to desc.
static inline bool escapeReservedContent(ODesc* desc, const string& reserved, const char* data,
int size)
@ -451,7 +451,7 @@ Value* Ascii::ParseValue(const string& s, const string& name, TypeTag type, Type
for ( unsigned int i = 0; i < pos; i++ )
delete lvals[i];
// and set the length of the set to 0, otherwhise the destructor will crash.
// and set the length of the set to 0, otherwise the destructor will crash.
val->val.vector_val.size = 0;
goto parse_error;