mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 20:52:45 +00:00 
			
		
		
		
	 6f4c380d95
			
		
	
	
		6f4c380d95
		
	
	
	
	
		
			
			Using int was a mistake. This patch changes String, StringImpl, StringView and StringBuilder to use size_t instead of int for lengths. Obviously a lot of code needs to change as a result of this.
		
			
				
	
	
		
			175 lines
		
	
	
	
		
			4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			175 lines
		
	
	
	
		
			4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| #include "StringImpl.h"
 | |
| #include "HashTable.h"
 | |
| #include "StdLibExtras.h"
 | |
| #include "kmalloc.h"
 | |
| 
 | |
| #ifndef __serenity__
 | |
| #include <new>
 | |
| #endif
 | |
| 
 | |
| //#define DEBUG_STRINGIMPL
 | |
| 
 | |
| #ifdef DEBUG_STRINGIMPL
 | |
| unsigned g_stringimpl_count;
 | |
| static HashTable<StringImpl*>* g_all_live_stringimpls;
 | |
| 
 | |
| void dump_all_stringimpls()
 | |
| {
 | |
|     unsigned i = 0;
 | |
|     for (auto& it : *g_all_live_stringimpls) {
 | |
|         dbgprsize_tf("%u: \"%s\"\n", i, (*it).characters());
 | |
|         ++i;
 | |
|     }
 | |
| }
 | |
| #endif
 | |
| 
 | |
| namespace AK {
 | |
| 
 | |
| static StringImpl* s_the_empty_stringimpl = nullptr;
 | |
| 
 | |
| StringImpl& StringImpl::the_empty_stringimpl()
 | |
| {
 | |
|     if (!s_the_empty_stringimpl) {
 | |
|         void* slot = kmalloc(sizeof(StringImpl) + sizeof(char));
 | |
|         s_the_empty_stringimpl = new (slot) StringImpl(ConstructTheEmptyStringImpl);
 | |
|     }
 | |
|     return *s_the_empty_stringimpl;
 | |
| }
 | |
| 
 | |
| StringImpl::StringImpl(ConstructWithInlineBufferTag, size_t length)
 | |
|     : m_length(length)
 | |
| {
 | |
| #ifdef DEBUG_STRINGIMPL
 | |
|     if (!g_all_live_stringimpls)
 | |
|         g_all_live_stringimpls = new HashTable<StringImpl*>;
 | |
|     ++g_stringimpl_count;
 | |
|     g_all_live_stringimpls->set(this);
 | |
| #endif
 | |
| }
 | |
| 
 | |
| StringImpl::~StringImpl()
 | |
| {
 | |
| #ifdef DEBUG_STRINGIMPL
 | |
|     --g_stringimpl_count;
 | |
|     g_all_live_stringimpls->remove(this);
 | |
| #endif
 | |
| }
 | |
| 
 | |
| static inline size_t allocation_size_for_stringimpl(size_t length)
 | |
| {
 | |
|     return sizeof(StringImpl) + (sizeof(char) * length) + sizeof(char);
 | |
| }
 | |
| 
 | |
| NonnullRefPtr<StringImpl> StringImpl::create_uninitialized(size_t length, char*& buffer)
 | |
| {
 | |
|     ASSERT(length);
 | |
|     void* slot = kmalloc(allocation_size_for_stringimpl(length));
 | |
|     ASSERT(slot);
 | |
|     auto new_stringimpl = adopt(*new (slot) StringImpl(ConstructWithInlineBuffer, length));
 | |
|     buffer = const_cast<char*>(new_stringimpl->characters());
 | |
|     buffer[length] = '\0';
 | |
|     return new_stringimpl;
 | |
| }
 | |
| 
 | |
| RefPtr<StringImpl> StringImpl::create(const char* cstring, size_t length, ShouldChomp should_chomp)
 | |
| {
 | |
|     if (!cstring)
 | |
|         return nullptr;
 | |
| 
 | |
|     if (!length || !*cstring)
 | |
|         return the_empty_stringimpl();
 | |
| 
 | |
|     if (should_chomp) {
 | |
|         while (length) {
 | |
|             char last_ch = cstring[length - 1];
 | |
|             if (!last_ch || last_ch == '\n' || last_ch == '\r')
 | |
|                 --length;
 | |
|             else
 | |
|                 break;
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     if (!length)
 | |
|         return the_empty_stringimpl();
 | |
| 
 | |
|     char* buffer;
 | |
|     auto new_stringimpl = create_uninitialized(length, buffer);
 | |
|     memcpy(buffer, cstring, length * sizeof(char));
 | |
| 
 | |
|     return new_stringimpl;
 | |
| }
 | |
| 
 | |
| RefPtr<StringImpl> StringImpl::create(const char* cstring, ShouldChomp shouldChomp)
 | |
| {
 | |
|     if (!cstring)
 | |
|         return nullptr;
 | |
| 
 | |
|     return create(cstring, strlen(cstring), shouldChomp);
 | |
| }
 | |
| 
 | |
| static inline bool is_ascii_lowercase(char c)
 | |
| {
 | |
|     return c >= 'a' && c <= 'z';
 | |
| }
 | |
| 
 | |
| static inline bool is_ascii_uppercase(char c)
 | |
| {
 | |
|     return c >= 'A' && c <= 'Z';
 | |
| }
 | |
| 
 | |
| static inline char to_ascii_lowercase(char c)
 | |
| {
 | |
|     if (is_ascii_uppercase(c))
 | |
|         return c | 0x20;
 | |
|     return c;
 | |
| }
 | |
| 
 | |
| static inline char to_ascii_uppercase(char c)
 | |
| {
 | |
|     if (is_ascii_lowercase(c))
 | |
|         return c & ~0x20;
 | |
|     return c;
 | |
| }
 | |
| 
 | |
| NonnullRefPtr<StringImpl> StringImpl::to_lowercase() const
 | |
| {
 | |
|     for (size_t i = 0; i < m_length; ++i) {
 | |
|         if (!is_ascii_lowercase(characters()[i]))
 | |
|             goto slow_path;
 | |
|     }
 | |
|     return const_cast<StringImpl&>(*this);
 | |
| 
 | |
| slow_path:
 | |
|     char* buffer;
 | |
|     auto lowercased = create_uninitialized(m_length, buffer);
 | |
|     for (size_t i = 0; i < m_length; ++i)
 | |
|         buffer[i] = to_ascii_lowercase(characters()[i]);
 | |
|     return lowercased;
 | |
| }
 | |
| 
 | |
| NonnullRefPtr<StringImpl> StringImpl::to_uppercase() const
 | |
| {
 | |
|     for (size_t i = 0; i < m_length; ++i) {
 | |
|         if (!is_ascii_uppercase(characters()[i]))
 | |
|             goto slow_path;
 | |
|     }
 | |
|     return const_cast<StringImpl&>(*this);
 | |
| 
 | |
| slow_path:
 | |
|     char* buffer;
 | |
|     auto uppercased = create_uninitialized(m_length, buffer);
 | |
|     for (size_t i = 0; i < m_length; ++i)
 | |
|         buffer[i] = to_ascii_uppercase(characters()[i]);
 | |
|     return uppercased;
 | |
| }
 | |
| 
 | |
| void StringImpl::compute_hash() const
 | |
| {
 | |
|     if (!length())
 | |
|         m_hash = 0;
 | |
|     else
 | |
|         m_hash = string_hash(characters(), m_length);
 | |
|     m_has_hash = true;
 | |
| }
 | |
| 
 | |
| }
 |