From b54c6432f9a25b86f5e56fbba00759322bd2cc03 Mon Sep 17 00:00:00 2001 From: Kefu Chai Date: Tue, 18 Sep 2018 11:23:48 +0800 Subject: [PATCH] common: fix typos Signed-off-by: Kefu Chai --- src/common/AsyncReserver.h | 2 +- src/common/DecayCounter.h | 2 +- src/common/OpQueue.h | 2 +- src/common/Throttle.h | 2 +- src/common/Timer.h | 2 +- src/common/WeightedPriorityQueue.h | 2 +- src/common/admin_socket.h | 4 +-- src/common/cohort_lru.h | 2 +- src/common/common_init.h | 2 +- src/common/escape.h | 4 +-- src/common/legacy_config_opts.h | 8 +++--- src/common/perf_counters.h | 2 +- src/common/sctp_crc32.c | 2 +- src/common/xattr.c | 2 +- src/crimson/thread/ThreadPool.h | 2 +- src/crush/CrushWrapper.h | 2 +- src/crush/builder.c | 2 +- src/crush/builder.h | 4 +-- .../isa/ErasureCodeIsaTableCache.cc | 2 +- .../jerasure/ErasureCodeJerasure.cc | 2 +- src/include/ceph_features.h | 2 +- src/include/ceph_fs.h | 2 +- src/include/cephfs/ceph_statx.h | 2 +- src/include/compat.h | 2 +- src/include/config-h.in.cmake | 4 +-- src/include/denc.h | 4 +-- src/include/frag.h | 2 +- src/include/rados/librados.h | 26 +++++++++---------- src/include/rados/librados.hpp | 4 +-- src/include/radosstriper/libradosstriper.h | 6 ++--- src/include/utime.h | 2 +- src/json_spirit/json_spirit_reader_template.h | 4 +-- src/key_value_store/key_value_structure.h | 2 +- src/key_value_store/kv_flat_btree_async.h | 2 +- src/kv/KeyValueDB.h | 2 +- src/kv/rocksdb_cache/BinnedLRUCache.h | 6 ++--- src/librados/RadosXattrIter.h | 2 +- src/libradosstriper/RadosStriperImpl.cc | 4 +-- src/messages/MOSDOp.h | 2 +- src/messages/MOSDPing.h | 2 +- src/messages/MOSDRepOp.h | 4 +-- src/messages/MOSDRepOpReply.h | 2 +- src/msg/Connection.h | 2 +- src/msg/Messenger.h | 2 +- src/msg/async/AsyncMessenger.h | 2 +- src/msg/async/dpdk/DPDK.h | 2 +- src/msg/async/dpdk/PacketUtil.h | 4 +-- src/msg/async/dpdk/TCP.h | 2 +- src/msg/simple/SimpleMessenger.h | 2 +- src/os/ObjectStore.h | 8 +++--- src/os/bluestore/BlueStore.h | 4 +-- src/os/bluestore/bluefs_types.h | 2 +- src/os/filestore/CollectionIndex.h | 4 +-- src/os/filestore/DBObjectMap.h | 2 +- src/os/filestore/HashIndex.h | 4 +-- src/os/filestore/IndexManager.h | 2 +- src/os/filestore/LFNIndex.h | 16 ++++++------ src/osd/OSDMap.h | 2 +- 58 files changed, 100 insertions(+), 100 deletions(-) diff --git a/src/common/AsyncReserver.h b/src/common/AsyncReserver.h index c88061e9647f3..4524373ca2660 100644 --- a/src/common/AsyncReserver.h +++ b/src/common/AsyncReserver.h @@ -21,7 +21,7 @@ #define rdout(x) lgeneric_subdout(cct,reserver,x) /** - * Manages a configurable number of asyncronous reservations. + * Manages a configurable number of asynchronous reservations. * * Memory usage is linear with the number of items queued and * linear with respect to the total number of priorities used diff --git a/src/common/DecayCounter.h b/src/common/DecayCounter.h index 33d400e1d8335..542d9c2f53204 100644 --- a/src/common/DecayCounter.h +++ b/src/common/DecayCounter.h @@ -25,7 +25,7 @@ /** * - * TODO: normalize value based on some fucntion of half_life, + * TODO: normalize value based on some function of half_life, * so that it can be interpreted as an approximation of a * moving average of N seconds. currently, changing half-life * skews the scale of the value, even at steady state. diff --git a/src/common/OpQueue.h b/src/common/OpQueue.h index 156bd2cc85874..26894b37fd2a3 100644 --- a/src/common/OpQueue.h +++ b/src/common/OpQueue.h @@ -28,7 +28,7 @@ namespace ceph { * Abstract class for all Op Queues * * In order to provide optimized code, be sure to declare all - * virutal functions as final in the derived class. + * virtual functions as final in the derived class. */ template diff --git a/src/common/Throttle.h b/src/common/Throttle.h index c28eb6efdf506..a5173afb0e3b9 100644 --- a/src/common/Throttle.h +++ b/src/common/Throttle.h @@ -285,7 +285,7 @@ private: * Throttles the maximum number of active requests and completes them in order * * Operations can complete out-of-order but their associated Context callback - * will completed in-order during invokation of start_op() and wait_for_ret() + * will completed in-order during invocation of start_op() and wait_for_ret() */ class OrderedThrottle { public: diff --git a/src/common/Timer.h b/src/common/Timer.h index e6ce1c1fbdd3f..f49ac0b0947a6 100644 --- a/src/common/Timer.h +++ b/src/common/Timer.h @@ -77,7 +77,7 @@ public: * Call with the event_lock LOCKED * * Returns true if the callback was cancelled. - * Returns false if you never addded the callback in the first place. + * Returns false if you never added the callback in the first place. */ bool cancel_event(Context *callback); diff --git a/src/common/WeightedPriorityQueue.h b/src/common/WeightedPriorityQueue.h index 877187d8015ec..4805495fa90e5 100644 --- a/src/common/WeightedPriorityQueue.h +++ b/src/common/WeightedPriorityQueue.h @@ -231,7 +231,7 @@ class WeightedPriorityQueue : public OpQueue // Pick a new priority out of the total priority. unsigned prio = rand() % total_prio + 1; unsigned tp = total_prio - i->key; - // Find the priority coresponding to the picked number. + // Find the priority corresponding to the picked number. // Subtract high priorities to low priorities until the picked number // is more than the total and try to dequeue that priority. // Reverse the direction from previous implementation because there is a higher diff --git a/src/common/admin_socket.h b/src/common/admin_socket.h index ec3d5ae04fba2..9f2c5ee87e233 100644 --- a/src/common/admin_socket.h +++ b/src/common/admin_socket.h @@ -58,12 +58,12 @@ public: * registered, and an incoming command is 'foo bar baz', it is * matched with 'foo bar', while 'foo fud' will match 'foo'. * - * The entire incoming command string is passed to the registred + * The entire incoming command string is passed to the registered * hook. * * @param command command string * @param cmddesc command syntax descriptor - * @param hook implementaiton + * @param hook implementation * @param help help text. if empty, command will not be included in 'help' output. * * @return 0 for success, -EEXIST if command already registered. diff --git a/src/common/cohort_lru.h b/src/common/cohort_lru.h index 5dbd112981a11..3e002344046da 100644 --- a/src/common/cohort_lru.h +++ b/src/common/cohort_lru.h @@ -460,7 +460,7 @@ namespace cohort { void drain(std::function uref, uint32_t flags = FLAG_NONE) { /* clear a table, call supplied function on - * each element found (e.g., retuns sentinel + * each element found (e.g., returns sentinel * references) */ Object::Queue2 drain_q; for (int t_ix = 0; t_ix < n_part; ++t_ix) { diff --git a/src/common/common_init.h b/src/common/common_init.h index 133533bb27d45..5a19d44ca924a 100644 --- a/src/common/common_init.h +++ b/src/common/common_init.h @@ -37,7 +37,7 @@ enum common_init_flags_t { // don't drop privileges CINIT_FLAG_DEFER_DROP_PRIVILEGES = 0x10, - // do'nt contact mons for config + // don't contact mons for config CINIT_FLAG_NO_MON_CONFIG = 0x20, }; diff --git a/src/common/escape.h b/src/common/escape.h index 97178520b7ecc..2d8770158acdb 100644 --- a/src/common/escape.h +++ b/src/common/escape.h @@ -19,7 +19,7 @@ #include /* Returns the length of a buffer that would be needed to escape 'buf' - * as an XML attrribute + * as an XML attribute */ size_t escape_xml_attr_len(const char *buf); @@ -30,7 +30,7 @@ size_t escape_xml_attr_len(const char *buf); void escape_xml_attr(const char *buf, char *out); /* Returns the length of a buffer that would be needed to escape 'buf' - * as an JSON attrribute + * as an JSON attribute */ size_t escape_json_attr_len(const char *buf, size_t src_len); diff --git a/src/common/legacy_config_opts.h b/src/common/legacy_config_opts.h index 602248cf1c0a5..b203dab096992 100644 --- a/src/common/legacy_config_opts.h +++ b/src/common/legacy_config_opts.h @@ -130,7 +130,7 @@ OPTION(ms_bind_ipv6, OPT_BOOL) OPTION(ms_bind_port_min, OPT_INT) OPTION(ms_bind_port_max, OPT_INT) OPTION(ms_bind_retry_count, OPT_INT) // If binding fails, how many times do we retry to bind -OPTION(ms_bind_retry_delay, OPT_INT) // Delay between attemps to bind +OPTION(ms_bind_retry_delay, OPT_INT) // Delay between attempts to bind OPTION(ms_bind_before_connect, OPT_BOOL) OPTION(ms_tcp_listen_backlog, OPT_INT) OPTION(ms_rwthread_stack_bytes, OPT_U64) @@ -498,7 +498,7 @@ OPTION(mds_op_complaint_time, OPT_FLOAT) // how many seconds old makes an op com OPTION(mds_op_log_threshold, OPT_INT) // how many op log messages to show in one go OPTION(mds_snap_min_uid, OPT_U32) // The minimum UID required to create a snapshot OPTION(mds_snap_max_uid, OPT_U32) // The maximum UID allowed to create a snapshot -OPTION(mds_snap_rstat, OPT_BOOL) // enable/disbale nested stat for snapshot +OPTION(mds_snap_rstat, OPT_BOOL) // enable/disable nested stat for snapshot OPTION(mds_verify_backtrace, OPT_U32) // detect clients which aren't trimming completed requests OPTION(mds_max_completed_flushes, OPT_U32) @@ -880,7 +880,7 @@ OPTION(osd_recovery_priority, OPT_U32) OPTION(osd_recovery_cost, OPT_U32) /** - * osd_recovery_op_warn_multiple scales the normal warning threshhold, + * osd_recovery_op_warn_multiple scales the normal warning threshold, * osd_op_complaint_time, so that slow recovery ops won't cause noise */ OPTION(osd_recovery_op_warn_multiple, OPT_U32) @@ -1165,7 +1165,7 @@ OPTION(filestore_collect_device_partition_information, OPT_BOOL) // (try to) use extsize for alloc hint NOTE: extsize seems to trigger // data corruption in xfs prior to kernel 3.5. filestore will -// implicity disable this if it cannot confirm the kernel is newer +// implicitly disable this if it cannot confirm the kernel is newer // than that. // NOTE: This option involves a tradeoff: When disabled, fragmentation is // worse, but large sequential writes are faster. When enabled, large diff --git a/src/common/perf_counters.h b/src/common/perf_counters.h index 0b9f782bc9e3d..57e1a157c57a2 100644 --- a/src/common/perf_counters.h +++ b/src/common/perf_counters.h @@ -38,7 +38,7 @@ enum perfcounter_type_d : uint8_t PERFCOUNTER_TIME = 0x1, // float (measuring seconds) PERFCOUNTER_U64 = 0x2, // integer (note: either TIME or U64 *must* be set) PERFCOUNTER_LONGRUNAVG = 0x4, // paired counter + sum (time) - PERFCOUNTER_COUNTER = 0x8, // counter (vs guage) + PERFCOUNTER_COUNTER = 0x8, // counter (vs gauge) PERFCOUNTER_HISTOGRAM = 0x10, // histogram (vector) of values }; diff --git a/src/common/sctp_crc32.c b/src/common/sctp_crc32.c index a8deb07fe5faf..964216d7f4310 100644 --- a/src/common/sctp_crc32.c +++ b/src/common/sctp_crc32.c @@ -62,7 +62,7 @@ __FBSDID("$FreeBSD: src/sys/netinet/sctp_crc32.c,v 1.8 2007/05/08 17:01:10 rrs E * non-NULL if the mode argument is equal to CONT or END * p_buf - the packet buffer where crc computations are being performed * length - the length of p_buf in bytes - * init_bytes - the number of initial bytes that need to be procesed before + * init_bytes - the number of initial bytes that need to be processed before * aligning p_buf to multiples of 4 bytes * mode - can be any of the following: BEGIN, CONT, END, BODY, ALIGN * diff --git a/src/common/xattr.c b/src/common/xattr.c index 510b535329ea9..c7afcf1e1e002 100644 --- a/src/common/xattr.c +++ b/src/common/xattr.c @@ -65,7 +65,7 @@ ceph_os_fsetxattr(int fd, const char *name, const void *value, #elif defined(__linux__) error = fsetxattr(fd, name, value, size, 0); #elif defined(__APPLE__) - error = fsetxattr(fd, name, value, size, 0, 0 /* no options should be indentical to Linux */ ); + error = fsetxattr(fd, name, value, size, 0, 0 /* no options should be identical to Linux */ ); #endif return (error); diff --git a/src/crimson/thread/ThreadPool.h b/src/crimson/thread/ThreadPool.h index d37c9f7fe3e8b..cfd72d2a40d25 100644 --- a/src/crimson/thread/ThreadPool.h +++ b/src/crimson/thread/ThreadPool.h @@ -85,7 +85,7 @@ public: * @param n_threads the number of threads in this thread pool. * @param cpu the CPU core to which this thread pool is assigned * @note each @c Task has its own ceph::thread::Condition, which possesses - * possesses an fd, so we should keep the size of queue under a resonable + * possesses an fd, so we should keep the size of queue under a reasonable * limit. */ ThreadPool(size_t n_threads, size_t queue_sz, unsigned cpu); diff --git a/src/crush/CrushWrapper.h b/src/crush/CrushWrapper.h index 74e23065b7617..cbe487ce53761 100644 --- a/src/crush/CrushWrapper.h +++ b/src/crush/CrushWrapper.h @@ -724,7 +724,7 @@ public: /** * returns (type_id, type) of all parent buckets between id and - * default, can be used to check for anomolous CRUSH maps + * default, can be used to check for anomalous CRUSH maps */ map get_parent_hierarchy(int id) const; diff --git a/src/crush/builder.c b/src/crush/builder.c index 53a6e1b91ef64..68dfcb69bc174 100644 --- a/src/crush/builder.c +++ b/src/crush/builder.c @@ -417,7 +417,7 @@ err: * next item or set of items. or why pow() is used the way it is. * * note that the original version 1 of this function made special - * accomodation for the case where straw lengths were identical. this + * accommodation for the case where straw lengths were identical. this * is also flawed in a non-obvious way; version 2 drops the special * handling and appears to work just as well. * diff --git a/src/crush/builder.h b/src/crush/builder.h index ffb5eaf22dbc1..bdf0a4b9cd881 100644 --- a/src/crush/builder.h +++ b/src/crush/builder.h @@ -166,7 +166,7 @@ extern int crush_get_next_bucket_id(struct crush_map *map); * to another bucket. * * @param[in] map the crush_map - * @param[in] bucketno the bucket unique identifer or 0 + * @param[in] bucketno the bucket unique identifier or 0 * @param[in] bucket the bucket to add to the __map__ * @param[out] idout a pointer to the bucket identifier * @@ -267,7 +267,7 @@ extern int crush_remove_bucket(struct crush_map *map, struct crush_bucket *bucke * * Remove __item__ from __bucket__ and subtract the item weight from * the bucket weight. If the weight of the item is greater than the - * weight of the bucket, silentely set the bucket weight to zero. + * weight of the bucket, silently set the bucket weight to zero. * * - return -ENOMEM if the __bucket__ cannot be sized down with __realloc(3)__. * - return -1 if the value of __bucket->alg__ is unknown. diff --git a/src/erasure-code/isa/ErasureCodeIsaTableCache.cc b/src/erasure-code/isa/ErasureCodeIsaTableCache.cc index a4d20a6fb17a5..7b176de81fbe3 100644 --- a/src/erasure-code/isa/ErasureCodeIsaTableCache.cc +++ b/src/erasure-code/isa/ErasureCodeIsaTableCache.cc @@ -174,7 +174,7 @@ ErasureCodeIsaTableCache::getEncodingCoefficient(int matrix, int k, int m) unsigned char** ErasureCodeIsaTableCache::getEncodingCoefficientNoLock(int matrix, int k, int m) { - // create a pointer to store an encoding coefficients adddress + // create a pointer to store an encoding coefficients address if (!encoding_coefficient[matrix][k][m]) { encoding_coefficient[matrix][k][m] = new (unsigned char*); *encoding_coefficient[matrix][k][m] = 0; diff --git a/src/erasure-code/jerasure/ErasureCodeJerasure.cc b/src/erasure-code/jerasure/ErasureCodeJerasure.cc index 649cbc2498abf..90d0dc8797b6f 100644 --- a/src/erasure-code/jerasure/ErasureCodeJerasure.cc +++ b/src/erasure-code/jerasure/ErasureCodeJerasure.cc @@ -452,7 +452,7 @@ void ErasureCodeJerasureLiberation::prepare() // bool ErasureCodeJerasureBlaumRoth::check_w(ostream *ss) const { - // back in Firefly, w = 7 was the default and produced useable + // back in Firefly, w = 7 was the default and produced usable // chunks. Tolerate this value for backward compatibility. if (w == 7) return true; diff --git a/src/include/ceph_features.h b/src/include/ceph_features.h index 99f031ce4841a..f725095c5fd8d 100644 --- a/src/include/ceph_features.h +++ b/src/include/ceph_features.h @@ -164,7 +164,7 @@ DEFINE_CEPH_FEATURE(59, 1, MSG_ADDR2) // overlap DEFINE_CEPH_FEATURE(60, 1, OSD_RECOVERY_DELETES) // *do not share this bit* DEFINE_CEPH_FEATURE(61, 1, CEPHX_V2) // *do not share this bit* -DEFINE_CEPH_FEATURE(62, 1, RESERVED) // do not use; used as a sentinal +DEFINE_CEPH_FEATURE(62, 1, RESERVED) // do not use; used as a sentinel DEFINE_CEPH_FEATURE_DEPRECATED(63, 1, RESERVED_BROKEN, LUMINOUS) // client-facing diff --git a/src/include/ceph_fs.h b/src/include/ceph_fs.h index 9e7cae8eca271..3a36959a504b0 100644 --- a/src/include/ceph_fs.h +++ b/src/include/ceph_fs.h @@ -495,7 +495,7 @@ struct ceph_mds_request_head_legacy { } __attribute__ ((packed)); /* - * Note that this is embedded wthin ceph_mds_request_head. Also, compatability + * Note that this is embedded wthin ceph_mds_request_head. Also, compatibility * with the ceph_mds_request_args_legacy must be maintained! */ union ceph_mds_request_args { diff --git a/src/include/cephfs/ceph_statx.h b/src/include/cephfs/ceph_statx.h index 17f598146a05e..f27fa295131f4 100644 --- a/src/include/cephfs/ceph_statx.h +++ b/src/include/cephfs/ceph_statx.h @@ -63,7 +63,7 @@ struct ceph_statx { #define CEPH_STATX_ALL_STATS 0x00001fffU /* All supported stats */ /* - * Compatability macros until these defines make their way into glibc + * Compatibility macros until these defines make their way into glibc */ #ifndef AT_NO_ATTR_SYNC #define AT_NO_ATTR_SYNC 0x4000 /* Don't sync attributes with the server */ diff --git a/src/include/compat.h b/src/include/compat.h index b6c629b7e03dd..397a5d99be586 100644 --- a/src/include/compat.h +++ b/src/include/compat.h @@ -51,7 +51,7 @@ // are included before this file. Redefinition might not help in this // case since already parsed code has evaluated to the wrong value. // This would warrrant for d definition that would actually be evaluated -// at the location of usage and report a possible confict. +// at the location of usage and report a possible conflict. // This is left up to a future improvement #elif (ENODATA != 87) // #warning ENODATA already defined to a value different from 87 (ENOATRR), refining to fix diff --git a/src/include/config-h.in.cmake b/src/include/config-h.in.cmake index 9f76d40b60385..329fb526febc6 100644 --- a/src/include/config-h.in.cmake +++ b/src/include/config-h.in.cmake @@ -259,10 +259,10 @@ /* Defined if you have libzfs enabled */ #cmakedefine HAVE_LIBZFS -/* Define if the C complier supports __func__ */ +/* Define if the C compiler supports __func__ */ #cmakedefine HAVE_FUNC -/* Define if the C complier supports __PRETTY_FUNCTION__ */ +/* Define if the C compiler supports __PRETTY_FUNCTION__ */ #cmakedefine HAVE_PRETTY_FUNC /* F_SETPIPE_SZ is supported */ diff --git a/src/include/denc.h b/src/include/denc.h index c8d79f8886893..0144a1504aab3 100644 --- a/src/include/denc.h +++ b/src/include/denc.h @@ -308,8 +308,8 @@ struct denc_traits< // otype == external type, i.e., the type on the wire // NOTE: the overload resolution ensures that the legacy encode/decode methods -// defined for int types is prefered to the ones defined using the specialized -// template, and hence get selected. This machinary prevents these these from +// defined for int types is preferred to the ones defined using the specialized +// template, and hence get selected. This machinery prevents these these from // getting glued into the legacy encode/decode methods; the overhead of setting // up a contiguous_appender etc is likely to be slower. namespace _denc { diff --git a/src/include/frag.h b/src/include/frag.h index 8c841ef4fee48..285f4775e36ca 100644 --- a/src/include/frag.h +++ b/src/include/frag.h @@ -70,7 +70,7 @@ * - get_first_child(), next_sibling(int parent_bits) to make (possibly partial) * iteration efficient (see, e.g., try_assimilate_children() * - rework frag_t so that we mask the left-most (most significant) bits instead of - * the right-most (least significant) bits. just because it's more intutive, and + * the right-most (least significant) bits. just because it's more intuitive, and * matches the network/netmask concept. */ diff --git a/src/include/rados/librados.h b/src/include/rados/librados.h index bbdb6c783853b..80064b23b051a 100644 --- a/src/include/rados/librados.h +++ b/src/include/rados/librados.h @@ -457,7 +457,7 @@ CEPH_RADOS_API int rados_ping_monitor(rados_t cluster, const char *mon_id, * @post If this succeeds, any function in librados may be used * * @param cluster The cluster to connect to. - * @returns 0 on sucess, negative error code on failure + * @returns 0 on success, negative error code on failure */ CEPH_RADOS_API int rados_connect(rados_t cluster); @@ -635,7 +635,7 @@ CEPH_RADOS_API int rados_cluster_fsid(rados_t cluster, char *buf, size_t len); * Get/wait for the most recent osdmap * * @param cluster the cluster to shutdown - * @returns 0 on sucess, negative error code on failure + * @returns 0 on success, negative error code on failure */ CEPH_RADOS_API int rados_wait_for_latest_osdmap(rados_t cluster); @@ -728,7 +728,7 @@ CEPH_RADOS_API int rados_get_min_compatible_osd(rados_t cluster, * based upon the current features * @param[out] require_min_compat_client required minimum client version * based upon explicit setting - * @returns 0 on sucess, negative error code on failure + * @returns 0 on success, negative error code on failure */ CEPH_RADOS_API int rados_get_min_compatible_client(rados_t cluster, int8_t* min_compat_client, @@ -1546,7 +1546,7 @@ CEPH_RADOS_API int rados_read(rados_ioctx_t io, const char *oid, char *buf, * @param init_value the init value for the algorithm * @param init_value_len the length of the init value * @param len the number of bytes to checksum - * @param off the offset to start checksuming in the object + * @param off the offset to start checksumming in the object * @param chunk_size optional length-aligned chunk size for checksums * @param pchecksum where to store the checksum result * @param checksum_len the number of bytes available for the result @@ -1801,7 +1801,7 @@ CEPH_RADOS_API int rados_stat(rados_ioctx_t io, const char *o, uint64_t *psize, * - N bytes = key name * * Restrictions: - * - The HDR update must preceed any key/value updates. + * - The HDR update must precede any key/value updates. * - All key/value updates must be in lexicographically sorted order * in cmdbuf. * - You can read/write to a tmap object via the regular APIs, but @@ -2078,7 +2078,7 @@ CEPH_RADOS_API int rados_aio_write(rados_ioctx_t io, const char *oid, const char *buf, size_t len, uint64_t off); /** - * Asychronously append data to an object + * Asynchronously append data to an object * * Queues the append and returns. * @@ -2098,7 +2098,7 @@ CEPH_RADOS_API int rados_aio_append(rados_ioctx_t io, const char *oid, const char *buf, size_t len); /** - * Asychronously write an entire object + * Asynchronously write an entire object * * The object is filled with the provided data. If the object exists, * it is atomically truncated and then written. @@ -2120,7 +2120,7 @@ CEPH_RADOS_API int rados_aio_write_full(rados_ioctx_t io, const char *oid, const char *buf, size_t len); /** - * Asychronously write the same buffer multiple times + * Asynchronously write the same buffer multiple times * * Queues the writesame and returns. * @@ -2143,7 +2143,7 @@ CEPH_RADOS_API int rados_aio_writesame(rados_ioctx_t io, const char *oid, size_t write_len, uint64_t off); /** - * Asychronously remove an object + * Asynchronously remove an object * * Queues the remove and returns. * @@ -2160,7 +2160,7 @@ CEPH_RADOS_API int rados_aio_remove(rados_ioctx_t io, const char *oid, rados_completion_t completion); /** - * Asychronously read data from an object + * Asynchronously read data from an object * * The io context determines the snapshot to read from, if any was set * by rados_ioctx_snap_set_read(). @@ -2798,7 +2798,7 @@ CEPH_RADOS_API int rados_set_alloc_hint2(rados_ioctx_t io, const char *o, * @name Object Operations * * A single rados operation can do multiple operations on one object - * atomicly. The whole operation will suceed or fail, and no partial + * atomically. The whole operation will succeed or fail, and no partial * results will be visible. * * Operations may be either reads, which can return data, or writes, @@ -3350,7 +3350,7 @@ CEPH_RADOS_API void rados_read_op_read(rados_read_op_t read_op, * @param init_value the init value for the algorithm * @param init_value_len the length of the init value * @param len the number of bytes to checksum - * @param off the offset to start checksuming in the object + * @param off the offset to start checksumming in the object * @param chunk_size optional length-aligned chunk size for checksums * @param pchecksum where to store the checksum result for this action * @param checksum_len the number of bytes available for the result @@ -3777,7 +3777,7 @@ CEPH_RADOS_API int rados_application_metadata_remove(rados_ioctx_t io, * @param keys_len number of bytes in keys buffer * @param values buffer in which to store values * @param vals_len number of bytes in values buffer - * @returns 0 on succcess, negative error code on failure + * @returns 0 on success, negative error code on failure * @returns -ERANGE if either buffer is too short */ CEPH_RADOS_API int rados_application_metadata_list(rados_ioctx_t io, diff --git a/src/include/rados/librados.hpp b/src/include/rados/librados.hpp index affe405e65487..0f47dd6b7fda3 100644 --- a/src/include/rados/librados.hpp +++ b/src/include/rados/librados.hpp @@ -316,7 +316,7 @@ namespace librados void assert_version(uint64_t ver); /** - * Guard operatation with a check that the object already exists + * Guard operation with a check that the object already exists */ void assert_exists(); @@ -1033,7 +1033,7 @@ namespace librados size_t write_len, uint64_t off); /** - * Asychronously remove an object + * Asynchronously remove an object * * Queues the remove and returns. * diff --git a/src/include/radosstriper/libradosstriper.h b/src/include/radosstriper/libradosstriper.h index 9e46867d59130..7eb33596c4343 100644 --- a/src/include/radosstriper/libradosstriper.h +++ b/src/include/radosstriper/libradosstriper.h @@ -56,7 +56,7 @@ void rados_striper_destroy(rados_striper_t striper); * This layout will be used when new objects are created (by writing to them) * Already existing objects will be opened with their own layout. * - * @param striper the targetted striper + * @param striper the targeted striper * @param stripe_unit the stripe_unit value of the new object layout * @returns 0 on success, negative error code on failure */ @@ -68,7 +68,7 @@ int rados_striper_set_object_layout_stripe_unit(rados_striper_t striper, * This layout will be used when new objects are created (by writing to them) * Already existing objects will be opened with their own layout. * - * @param striper the targetted striper + * @param striper the targeted striper * @param stripe_count the stripe_count value of the new object layout * @returns 0 on success, negative error code on failure */ @@ -80,7 +80,7 @@ int rados_striper_set_object_layout_stripe_count(rados_striper_t striper, * This layout will be used when new objects are created (by writing to them) * Already existing objects will be opened with their own layout. * - * @param striper the targetted striper + * @param striper the targeted striper * @param object_size the object_size value of the new object layout * @returns 0 on success, negative error code on failure */ diff --git a/src/include/utime.h b/src/include/utime.h index 08db335e246c0..bc9f6429a12c1 100644 --- a/src/include/utime.h +++ b/src/include/utime.h @@ -35,7 +35,7 @@ inline __u32 cap_to_u32_max(__u64 t) { return std::min(t, (__u64)std::numeric_limits::max()); } -/* WARNING: If add member in utime_t, please make sure the encode/decode funtion +/* WARNING: If add member in utime_t, please make sure the encode/decode function * work well. For little-endian machine, we should make sure there is no padding * in 32-bit machine and 64-bit machine. * You should also modify the padding_check function. diff --git a/src/json_spirit/json_spirit_reader_template.h b/src/json_spirit/json_spirit_reader_template.h index 59a8a0512653e..2d0b3a440e617 100644 --- a/src/json_spirit/json_spirit_reader_template.h +++ b/src/json_spirit/json_spirit_reader_template.h @@ -388,7 +388,7 @@ namespace json_spirit throw reason; } - // the spirit grammer + // the spirit grammar // template< class Value_type, class Iter_type > class Json_grammer : public spirit_namespace::grammar< Json_grammer< Value_type, Iter_type > > @@ -465,7 +465,7 @@ namespace json_spirit Int_action new_int ( boost::bind( &Semantic_actions_t::new_int, &self.actions_, _1 ) ); Uint64_action new_uint64 ( boost::bind( &Semantic_actions_t::new_uint64, &self.actions_, _1 ) ); - // actual grammer + // actual grammar json_ = value_ | eps_p[ &throw_not_value ] diff --git a/src/key_value_store/key_value_structure.h b/src/key_value_store/key_value_structure.h index e5f16d2f6a051..c73adc1a1e587 100644 --- a/src/key_value_store/key_value_structure.h +++ b/src/key_value_store/key_value_structure.h @@ -69,7 +69,7 @@ public: /** * set the method that gets called before each ObjectWriteOperation. * If waite_time is set and the method passed involves waiting, it will wait - * for that many miliseconds. + * for that many milliseconds. */ virtual void set_inject(injection_t inject, int wait_time) = 0; diff --git a/src/key_value_store/kv_flat_btree_async.h b/src/key_value_store/kv_flat_btree_async.h index 92c4d3b6ae9b1..346e4056cd3ee 100644 --- a/src/key_value_store/kv_flat_btree_async.h +++ b/src/key_value_store/kv_flat_btree_async.h @@ -812,7 +812,7 @@ KvFlatBtreeAsync(int k_val, string name, int cache, double cache_r, /** * sets this kvba to call inject before every ObjectWriteOperation. * If inject is wait and wait_time is set, wait will have a 10% chance of - * sleeping for waite_time miliseconds. + * sleeping for waite_time milliseconds. */ void set_inject(injection_t inject, int wait_time) override; diff --git a/src/kv/KeyValueDB.h b/src/kv/KeyValueDB.h index f9d9665aed63e..74822fbc7b595 100644 --- a/src/kv/KeyValueDB.h +++ b/src/kv/KeyValueDB.h @@ -200,7 +200,7 @@ public: } // This superclass is used both by kv iterators *and* by the ObjectMap - // omap iterator. The class hiearchies are unfortunatley tied together + // omap iterator. The class hierarchies are unfortunately tied together // by the legacy DBOjectMap implementation :(. class SimplestIteratorImpl { public: diff --git a/src/kv/rocksdb_cache/BinnedLRUCache.h b/src/kv/rocksdb_cache/BinnedLRUCache.h index 0cf9819f86862..17f91723037f0 100644 --- a/src/kv/rocksdb_cache/BinnedLRUCache.h +++ b/src/kv/rocksdb_cache/BinnedLRUCache.h @@ -215,10 +215,10 @@ class alignas(CACHE_LINE_SIZE) BinnedLRUCacheShard : public CacheShard { // not threadsafe size_t TEST_GetLRUSize(); - // Retrives high pri pool ratio + // Retrieves high pri pool ratio double GetHighPriPoolRatio() const; - // Retrives high pri pool usage + // Retrieves high pri pool usage size_t GetHighPriPoolUsage() const; private: @@ -305,7 +305,7 @@ class BinnedLRUCache : public ShardedCache { size_t TEST_GetLRUSize(); // Sets the high pri pool ratio void SetHighPriPoolRatio(double high_pri_pool_ratio); - // Retrives high pri pool ratio + // Retrieves high pri pool ratio double GetHighPriPoolRatio() const; // Retrieves high pri pool usage size_t GetHighPriPoolUsage() const; diff --git a/src/librados/RadosXattrIter.h b/src/librados/RadosXattrIter.h index 6b232bd5873ee..20a926140ea44 100644 --- a/src/librados/RadosXattrIter.h +++ b/src/librados/RadosXattrIter.h @@ -23,7 +23,7 @@ namespace librados { /** - * iterator object used in implementation of the extrenal + * iterator object used in implementation of the external * attributes part of the C interface of librados */ struct RadosXattrsIter { diff --git a/src/libradosstriper/RadosStriperImpl.cc b/src/libradosstriper/RadosStriperImpl.cc index ac47951657379..1a3eb99f860ab 100644 --- a/src/libradosstriper/RadosStriperImpl.cc +++ b/src/libradosstriper/RadosStriperImpl.cc @@ -60,7 +60,7 @@ * * Still the writing to a striped object is not atomic. This means in particular that * the size of an object may not be in sync with its content at all times. - * As the size is always garanteed to be updated first and in an atomic way, and as + * As the size is always guaranteed to be updated first and in an atomic way, and as * sparse striped objects are supported (see below), what will typically happen is * that a reader that comes too soon after a write will read 0s instead of the actual * data. @@ -1080,7 +1080,7 @@ int libradosstriper::RadosStriperImpl::internal_aio_remove( // return return rcr; } catch (ErrorCode &e) { - // errror caught when trying to take the exclusive lock + // error caught when trying to take the exclusive lock return e.m_code; } diff --git a/src/messages/MOSDOp.h b/src/messages/MOSDOp.h index bfd0b8a506f45..a8a379d8495ed 100644 --- a/src/messages/MOSDOp.h +++ b/src/messages/MOSDOp.h @@ -48,7 +48,7 @@ private: hobject_t hobj; spg_t pgid; bufferlist::const_iterator p; - // Decoding flags. Decoding is only needed for messages catched by pipe reader. + // Decoding flags. Decoding is only needed for messages caught by pipe reader. // Transition from true -> false without locks being held // Can never see final_decode_needed == false and partial_decode_needed == true atomic partial_decode_needed; diff --git a/src/messages/MOSDPing.h b/src/messages/MOSDPing.h index 16c6e3d6f013b..555807d3cceae 100644 --- a/src/messages/MOSDPing.h +++ b/src/messages/MOSDPing.h @@ -104,7 +104,7 @@ public: encode((uint32_t)s, payload); if (s) { // this should be big enough for normal min_message padding sizes. since - // we are targetting jumbo ethernet frames around 9000 bytes, 16k should + // we are targeting jumbo ethernet frames around 9000 bytes, 16k should // be more than sufficient! the compiler will statically zero this so // that at runtime we are only adding a bufferptr reference to it. static char zeros[16384] = {}; diff --git a/src/messages/MOSDRepOp.h b/src/messages/MOSDRepOp.h index fc6d06c1f7583..0e587c48d741f 100644 --- a/src/messages/MOSDRepOp.h +++ b/src/messages/MOSDRepOp.h @@ -38,7 +38,7 @@ public: spg_t pgid; bufferlist::const_iterator p; - // Decoding flags. Decoding is only needed for messages catched by pipe reader. + // Decoding flags. Decoding is only needed for messages caught by pipe reader. bool final_decode_needed; // subop @@ -81,7 +81,7 @@ public: void decode_payload() override { p = payload.cbegin(); - // splitted to partial and final + // split to partial and final decode(map_epoch, p); if (header.version >= 2) { decode(min_epoch, p); diff --git a/src/messages/MOSDRepOpReply.h b/src/messages/MOSDRepOpReply.h index 887242016ccba..3a7e5a7622597 100644 --- a/src/messages/MOSDRepOpReply.h +++ b/src/messages/MOSDRepOpReply.h @@ -48,7 +48,7 @@ public: eversion_t last_complete_ondisk; bufferlist::const_iterator p; - // Decoding flags. Decoding is only needed for messages catched by pipe reader. + // Decoding flags. Decoding is only needed for messages caught by pipe reader. bool final_decode_needed; epoch_t get_map_epoch() const override { diff --git a/src/msg/Connection.h b/src/msg/Connection.h index 03375a4dc8ce9..0744f19d38c15 100644 --- a/src/msg/Connection.h +++ b/src/msg/Connection.h @@ -55,7 +55,7 @@ public: public: Connection(CephContext *cct, Messenger *m) - // we are managed exlusively by ConnectionRef; make it so you can + // we are managed exclusively by ConnectionRef; make it so you can // ConnectionRef foo = new Connection; : RefCountedObject(cct, 0), lock("Connection::lock"), diff --git a/src/msg/Messenger.h b/src/msg/Messenger.h index 04067411c93db..737d1bcaba494 100644 --- a/src/msg/Messenger.h +++ b/src/msg/Messenger.h @@ -676,7 +676,7 @@ public: } /** - * Notify each Dispatcher of a new incomming Connection. Call + * Notify each Dispatcher of a new incoming Connection. Call * this function whenever a new Connection is accepted. * * @param con Pointer to the new Connection. diff --git a/src/msg/async/AsyncMessenger.h b/src/msg/async/AsyncMessenger.h index 27c228ed9955f..f3546325df03e 100644 --- a/src/msg/async/AsyncMessenger.h +++ b/src/msg/async/AsyncMessenger.h @@ -278,7 +278,7 @@ private: ceph::unordered_map conns; /** - * list of connection are in teh process of accepting + * list of connection are in the process of accepting * * These are not yet in the conns map. */ diff --git a/src/msg/async/dpdk/DPDK.h b/src/msg/async/dpdk/DPDK.h index 1feb661ef3246..fa12af6b279a0 100644 --- a/src/msg/async/dpdk/DPDK.h +++ b/src/msg/async/dpdk/DPDK.h @@ -280,7 +280,7 @@ class DPDKQueuePair { DPDKQueuePair& qp, rte_mbuf*& m, char* va, size_t buf_len) { static constexpr size_t max_frag_len = 15 * 1024; // 15K - // FIXME: current all tx buf is alloced without rte_malloc + // FIXME: current all tx buf is allocated without rte_malloc return copy_one_data_buf(qp, m, va, buf_len); // // Currently we break a buffer on a 15K boundary because 82599 diff --git a/src/msg/async/dpdk/PacketUtil.h b/src/msg/async/dpdk/PacketUtil.h index af834307f8149..118218e6633f7 100644 --- a/src/msg/async/dpdk/PacketUtil.h +++ b/src/msg/async/dpdk/PacketUtil.h @@ -46,7 +46,7 @@ class packet_merger { bool insert = true; auto beg = offset; auto end = beg + p.len(); - // Fisrt, try to merge the packet with existing segment + // First, try to merge the packet with existing segment for (auto it = map.begin(); it != map.end();) { auto& seg_pkt = it->second; auto seg_beg = it->first; @@ -101,7 +101,7 @@ class packet_merger { } // Second, merge adjacent segments after this packet has been merged, - // becasue this packet might fill a "whole" and make two adjacent + // because this packet might fill a "whole" and make two adjacent // segments mergable for (auto it = map.begin(); it != map.end();) { // The first segment diff --git a/src/msg/async/dpdk/TCP.h b/src/msg/async/dpdk/TCP.h index 8005e783c2a62..b7bd7132decde 100644 --- a/src/msg/async/dpdk/TCP.h +++ b/src/msg/async/dpdk/TCP.h @@ -1063,7 +1063,7 @@ Packet tcp::tcb::get_transmit_packet() { // Max number of TCP payloads we can pass to NIC uint32_t len; if (_tcp.get_hw_features().tx_tso) { - // FIXME: Info tap device the size of the splitted packet + // FIXME: Info tap device the size of the split packet len = _tcp.get_hw_features().max_packet_len - tcp_hdr_len_min - InetTraits::ip_hdr_len_min; } else { len = std::min(uint16_t(_tcp.get_hw_features().mtu - tcp_hdr_len_min - InetTraits::ip_hdr_len_min), _snd.mss); diff --git a/src/msg/simple/SimpleMessenger.h b/src/msg/simple/SimpleMessenger.h index c522ba39565f8..d899ba31d2c7a 100644 --- a/src/msg/simple/SimpleMessenger.h +++ b/src/msg/simple/SimpleMessenger.h @@ -305,7 +305,7 @@ private: */ ceph::unordered_map rank_pipe; /** - * list of pipes are in teh process of accepting + * list of pipes are in the process of accepting * * These are not yet in the rank_pipe map. */ diff --git a/src/os/ObjectStore.h b/src/os/ObjectStore.h index 77305025f605c..736cab460d3ba 100644 --- a/src/os/ObjectStore.h +++ b/src/os/ObjectStore.h @@ -146,7 +146,7 @@ public: * 1) collection is currently idle: the method returns true. c is * not touched. * 2) collection is not idle: the method returns false and c is - * called asyncronously with a value of 0 once all transactions + * called asynchronously with a value of 0 once all transactions * queued on this collection prior to the call have been applied * and committed. */ @@ -269,7 +269,7 @@ public: * sobject_encoding detects an older/simpler version of oid * present in pre-bobtail versions of ceph. use_pool_override * also detects a situation where the pool of an oid can be - * overriden for legacy operations/buffers. For non-legacy + * overridden for legacy operations/buffers. For non-legacy * implementations of ObjectStore, neither of these fields are * relevant. * @@ -298,7 +298,7 @@ public: * applies independently to each transaction element. For example, * if a transaction contains two mutating elements "create A" and * "delete B". And an enumeration operation is performed while this - * transaction is pending. It is permissable for ObjectStore to + * transaction is pending. It is permissible for ObjectStore to * report any of the four possible combinations of the existence of * A and B. * @@ -834,7 +834,7 @@ public: bool empty() { return !data.ops; } - /// Number of operations in the transation + /// Number of operations in the transaction int get_num_ops() { return data.ops; } diff --git a/src/os/bluestore/BlueStore.h b/src/os/bluestore/BlueStore.h index f5b2967eff683..6c15953dd2da0 100644 --- a/src/os/bluestore/BlueStore.h +++ b/src/os/bluestore/BlueStore.h @@ -1959,7 +1959,7 @@ private: uint64_t osd_memory_target = 0; ///< OSD memory target when autotuning cache uint64_t osd_memory_base = 0; ///< OSD base memory when autotuning cache double osd_memory_expected_fragmentation = 0; ///< expected memory fragmentation - uint64_t osd_memory_cache_min = 0; ///< Min memory to assign when autotuning cahce + uint64_t osd_memory_cache_min = 0; ///< Min memory to assign when autotuning cache double osd_memory_cache_resize_interval = 0; ///< Time to wait between cache resizing std::mutex vstatfs_lock; volatile_statfs vstatfs; @@ -2899,7 +2899,7 @@ public: const coll_t& cid, const ghobject_t& oid) { ceph_assert(granularity); // initialized - // can't call this func after filter_out has been apllied + // can't call this func after filter_out has been applied ceph_assert(!was_filtered_out); if (!len) { return; diff --git a/src/os/bluestore/bluefs_types.h b/src/os/bluestore/bluefs_types.h index 2b4ee52797d75..043f11e9c3e22 100644 --- a/src/os/bluestore/bluefs_types.h +++ b/src/os/bluestore/bluefs_types.h @@ -146,7 +146,7 @@ struct bluefs_transaction_t { OP_NONE = 0, OP_INIT, ///< initial (empty) file system marker OP_ALLOC_ADD, ///< add extent to available block storage (extent) - OP_ALLOC_RM, ///< remove extent from availabe block storage (extent) + OP_ALLOC_RM, ///< remove extent from available block storage (extent) OP_DIR_LINK, ///< (re)set a dir entry (dirname, filename, ino) OP_DIR_UNLINK, ///< remove a dir entry (dirname, filename) OP_DIR_CREATE, ///< create a dir (dirname) diff --git a/src/os/filestore/CollectionIndex.h b/src/os/filestore/CollectionIndex.h index 6177b6620ce08..eb43e47dc5308 100644 --- a/src/os/filestore/CollectionIndex.h +++ b/src/os/filestore/CollectionIndex.h @@ -109,8 +109,8 @@ protected: /** * Cleanup before replaying journal * - * Index implemenations may need to perform compound operations - * which may leave the collection unstable if interupted. cleanup + * Index implementations may need to perform compound operations + * which may leave the collection unstable if interrupted. cleanup * is called on mount to allow the CollectionIndex implementation * to stabilize. * diff --git a/src/os/filestore/DBObjectMap.h b/src/os/filestore/DBObjectMap.h index badfbb7ab14ca..45745ea2e6ffe 100644 --- a/src/os/filestore/DBObjectMap.h +++ b/src/os/filestore/DBObjectMap.h @@ -497,7 +497,7 @@ private: /** * Generate new header for c oid with new seq number * - * Has the side effect of syncronously saving the new DBObjectMap state + * Has the side effect of synchronously saving the new DBObjectMap state */ Header _generate_new_header(const ghobject_t &oid, Header parent); Header generate_new_header(const ghobject_t &oid, Header parent) { diff --git a/src/os/filestore/HashIndex.h b/src/os/filestore/HashIndex.h index 6e076f77d4f0e..7e34d15599600 100644 --- a/src/os/filestore/HashIndex.h +++ b/src/os/filestore/HashIndex.h @@ -167,8 +167,8 @@ public: CephContext* cct, coll_t collection, ///< [in] Collection const char *base_path, ///< [in] Path to the index root. - int merge_at, ///< [in] Merge threshhold. - int split_multiple, ///< [in] Split threshhold. + int merge_at, ///< [in] Merge threshold. + int split_multiple, ///< [in] Split threshold. uint32_t index_version,///< [in] Index version double retry_probability=0) ///< [in] retry probability : LFNIndex(cct, collection, base_path, index_version, retry_probability), diff --git a/src/os/filestore/IndexManager.h b/src/os/filestore/IndexManager.h index e56ed0f8daf1d..19cd29264dd97 100644 --- a/src/os/filestore/IndexManager.h +++ b/src/os/filestore/IndexManager.h @@ -41,7 +41,7 @@ struct Index { * Encapsulates mutual exclusion for CollectionIndexes. * * Allowing a modification (removal or addition of an object) to occur - * while a read is occuring (lookup of an object's path and use of + * while a read is occurring (lookup of an object's path and use of * that path) may result in the path becoming invalid. Thus, during * the lifetime of a CollectionIndex object and any paths returned * by it, no other concurrent accesses may be allowed. diff --git a/src/os/filestore/LFNIndex.h b/src/os/filestore/LFNIndex.h index 8eab3c0d3dac4..149ed10f174a8 100644 --- a/src/os/filestore/LFNIndex.h +++ b/src/os/filestore/LFNIndex.h @@ -41,11 +41,11 @@ * * User must call created when an object is created. * - * Syncronization: Calling code must ensure that there are no object + * Synchronization: Calling code must ensure that there are no object * creations or deletions during the lifetime of a Path object (except * of an object at that path). * - * Unless otherwise noted, methods which return an int return 0 on sucess + * Unless otherwise noted, methods which return an int return 0 on success * and a negative error code on failure. */ #define WRAP_RETRY(x) { \ @@ -312,7 +312,7 @@ protected: /** * Moves contents of from into to. * - * Invalidates mangled names in to. If interupted, all objects will be + * Invalidates mangled names in to. If interrupted, all objects will be * present in to before objects are removed from from. Ignores EEXIST * while linking into to. * @return Error Code, 0 on success @@ -409,7 +409,7 @@ protected: bufferlist &attr_value ///< [in] Value to save. ); - /// Read into attr_value atribute attr_name on path. + /// Read into attr_value attribute attr_name on path. int get_attr_path( const vector &path, ///< [in] Path to read. const string &attr_name, ///< [in] Attribute to read. @@ -436,7 +436,7 @@ private: } /** - * Gets the filename corresponsing to oid in path. + * Gets the filename corresponding to oid in path. * * @param [in] path Path in which to get filename for oid. * @param [in] oid Object for which to get filename. @@ -518,19 +518,19 @@ private: int lfn_parse_object_name_keyless( const string &long_name, ///< [in] Name to parse ghobject_t *out ///< [out] Resulting Object - ); ///< @return True if successfull, False otherwise. + ); ///< @return True if successful, False otherwise. /// Parse object name int lfn_parse_object_name_poolless( const string &long_name, ///< [in] Name to parse ghobject_t *out ///< [out] Resulting Object - ); ///< @return True if successfull, False otherwise. + ); ///< @return True if successful, False otherwise. /// Parse object name int lfn_parse_object_name( const string &long_name, ///< [in] Name to parse ghobject_t *out ///< [out] Resulting Object - ); ///< @return True if successfull, False otherwise. + ); ///< @return True if successful, False otherwise. /// Checks whether short_name is a hashed filename. bool lfn_is_hashed_filename( diff --git a/src/osd/OSDMap.h b/src/osd/OSDMap.h index efae118fd7e14..abaaddb5afad8 100644 --- a/src/osd/OSDMap.h +++ b/src/osd/OSDMap.h @@ -452,7 +452,7 @@ public: new_erasure_code_profiles[name] = profile; } - /// propage update pools' snap metadata to any of their tiers + /// propagate update pools' snap metadata to any of their tiers int propagate_snaps_to_tiers(CephContext *cct, const OSDMap &base); /// filter out osds with any pending state changing -- 2.39.5