Index: lldb/trunk/examples/python/symbolication.py =================================================================== --- lldb/trunk/examples/python/symbolication.py +++ lldb/trunk/examples/python/symbolication.py @@ -223,7 +223,7 @@ @classmethod def InitWithSBTargetAndSBModule(cls, target, module): - '''Initalize this Image object with a module from a target.''' + '''Initialize this Image object with a module from a target.''' obj = cls(module.file.fullpath, module.uuid) obj.resolved_path = module.platform_file.fullpath obj.resolved = True Index: lldb/trunk/examples/summaries/cocoa/CFArray.py =================================================================== --- lldb/trunk/examples/summaries/cocoa/CFArray.py +++ lldb/trunk/examples/summaries/cocoa/CFArray.py @@ -147,7 +147,7 @@ return self.wrapper.update() - # this code acts as our defense against NULL and unitialized + # this code acts as our defense against NULL and uninitialized # NSArray pointers, which makes it much longer than it would be otherwise def make_wrapper(self): logger = lldb.formatters.Logger.Logger() Index: lldb/trunk/examples/synthetic/gnu_libstdcpp.py =================================================================== --- lldb/trunk/examples/synthetic/gnu_libstdcpp.py +++ lldb/trunk/examples/synthetic/gnu_libstdcpp.py @@ -27,7 +27,7 @@ logger = lldb.formatters.Logger.Logger() return node.GetValueAsUnsigned() - # Floyd's cyle-finding algorithm + # Floyd's cycle-finding algorithm # try to detect if this list has a loop def has_loop(self): global _list_uses_loop_detector @@ -154,7 +154,7 @@ end_val = self.end.GetValueAsUnsigned(0) # Before a vector has been constructed, it will contain bad values # so we really need to be careful about the length we return since - # unitialized data can cause us to return a huge number. We need + # uninitialized data can cause us to return a huge number. We need # to also check for any of the start, finish or end of storage values # being zero (NULL). If any are, then this vector has not been # initialized yet and we should return zero Index: lldb/trunk/examples/synthetic/libcxx.py =================================================================== --- lldb/trunk/examples/synthetic/libcxx.py +++ lldb/trunk/examples/synthetic/libcxx.py @@ -73,7 +73,7 @@ finish_val = self.finish.GetValueAsUnsigned(0) # Before a vector has been constructed, it will contain bad values # so we really need to be careful about the length we return since - # unitialized data can cause us to return a huge number. We need + # uninitialized data can cause us to return a huge number. We need # to also check for any of the start, finish or end of storage values # being zero (NULL). If any are, then this vector has not been # initialized yet and we should return zero @@ -219,7 +219,7 @@ logger = lldb.formatters.Logger.Logger() return node.GetValueAsUnsigned() - # Floyd's cyle-finding algorithm + # Floyd's cycle-finding algorithm # try to detect if this list has a loop def has_loop(self): global _list_uses_loop_detector Index: lldb/trunk/include/lldb/lldb-private-types.h =================================================================== --- lldb/trunk/include/lldb/lldb-private-types.h +++ lldb/trunk/include/lldb/lldb-private-types.h @@ -51,7 +51,7 @@ // for this register will be valid. For example, the value list for ah // would be eax (x86) or rax (x64). uint32_t *invalidate_regs; // List of registers (terminated with LLDB_INVALID_REGNUM). If this value is not - // null, all registers in this list will be invalidateed when the value of this + // null, all registers in this list will be invalidated when the value of this // register changes. For example, the invalidate list for eax would be rax // ax, ah, and al. } RegisterInfo; Index: lldb/trunk/source/API/SBProcess.cpp =================================================================== --- lldb/trunk/source/API/SBProcess.cpp +++ lldb/trunk/source/API/SBProcess.cpp @@ -409,7 +409,7 @@ Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_API)); if (log) - log->Printf ("SBProcess(%p)::GetProfileData (dst=\"%.*s\", dst_len=%" PRIu64 ") => %" PRIu64, + log->Printf ("SBProcess(%p)::GetAsyncProfileData (dst=\"%.*s\", dst_len=%" PRIu64 ") => %" PRIu64, static_cast(process_sp.get()), static_cast(bytes_read), dst, static_cast(dst_len), Index: lldb/trunk/source/Core/RegisterValue.cpp =================================================================== --- lldb/trunk/source/Core/RegisterValue.cpp +++ lldb/trunk/source/Core/RegisterValue.cpp @@ -217,7 +217,7 @@ { buffer.byte_order = src_byte_order; // Make sure to set the buffer length of the destination buffer to avoid - // problems due to uninitalized variables. + // problems due to uninitialized variables. buffer.length = src_len; } Index: lldb/trunk/tools/debugserver/source/RNBRemote.cpp =================================================================== --- lldb/trunk/tools/debugserver/source/RNBRemote.cpp +++ lldb/trunk/tools/debugserver/source/RNBRemote.cpp @@ -236,7 +236,7 @@ t.push_back (Packet (continue_with_sig, &RNBRemote::HandlePacket_C, NULL, "C", "Continue with signal")); t.push_back (Packet (detach, &RNBRemote::HandlePacket_D, NULL, "D", "Detach gdb from remote system")); // t.push_back (Packet (step_inferior_one_cycle, &RNBRemote::HandlePacket_UNIMPLEMENTED, NULL, "i", "Step inferior by one clock cycle")); -// t.push_back (Packet (signal_and_step_inf_one_cycle, &RNBRemote::HandlePacket_UNIMPLEMENTED, NULL, "I", "Signal inferior, then step one clock cyle")); +// t.push_back (Packet (signal_and_step_inf_one_cycle, &RNBRemote::HandlePacket_UNIMPLEMENTED, NULL, "I", "Signal inferior, then step one clock cycle")); t.push_back (Packet (kill, &RNBRemote::HandlePacket_k, NULL, "k", "Kill")); // t.push_back (Packet (restart, &RNBRemote::HandlePacket_UNIMPLEMENTED, NULL, "R", "Restart inferior")); // t.push_back (Packet (search_mem_backwards, &RNBRemote::HandlePacket_UNIMPLEMENTED, NULL, "t", "Search memory backwards")); Index: lldb/trunk/www/python_reference/lldb.formatters.cpp.gnu_libstdcpp-pysrc.html =================================================================== --- lldb/trunk/www/python_reference/lldb.formatters.cpp.gnu_libstdcpp-pysrc.html +++ lldb/trunk/www/python_reference/lldb.formatters.cpp.gnu_libstdcpp-pysrc.html @@ -116,7 +116,7 @@ lldb.formatters.Logger.Logger" class="py-name" href="#" onclick="return doclink('link-23', 'Logger', 'link-2');">Logger() 28 return node.GetValueAsUnsigned() 29 - 30 # Floyd's cyle-finding algorithm + 30 # Floyd's cycle-finding algorithm 31 # try to detect if this list has a loop
32 - def has_loop(self):
33 global 163 end_val = self.end.GetValueAsUnsigned(0) 164 # Before a vector has been constructed, it will contain bad values 165 # so we really need to be careful about the length we return since -166 # unitialized data can cause us to return a huge number. We need +166 # uninitialized data can cause us to return a huge number. We need 167 # to also check for any of the start, finish or end of storage values 168 # being zero (NULL). If any are, then this vector has not been 169 # initialized yet and we should return zero Index: lldb/trunk/www/python_reference/lldb.formatters.cpp.libcxx-pysrc.html =================================================================== --- lldb/trunk/www/python_reference/lldb.formatters.cpp.libcxx-pysrc.html +++ lldb/trunk/www/python_reference/lldb.formatters.cpp.libcxx-pysrc.html @@ -188,7 +188,7 @@ 73 finish_val = self.finish.GetValueAsUnsigned(0) 74 # Before a vector has been constructed, it will contain bad values 75 # so we really need to be careful about the length we return since - 76 # unitialized data can cause us to return a huge number. We need + 76 # uninitialized data can cause us to return a huge number. We need 77 # to also check for any of the start, finish or end of storage values 78 # being zero (NULL). If any are, then this vector has not been 79 # initialized yet and we should return zero @@ -543,7 +543,7 @@ lldb.formatters.Logger.Logger" class="py-name" href="#" onclick="return doclink('link-172', 'Logger', 'link-3');">Logger() 220 return node.GetValueAsUnsigned()
221 -222 # Floyd's cyle-finding algorithm +222 # Floyd's cycle-finding algorithm 223 # try to detect if this list has a loop
224 - def has_loop(self):
225 global