1 files changed, 64 insertions, 27 deletions

diff --git a/qmake/tools/qcstring.cpp b/qmake/tools/qcstring.cpp
index cf1b853..4651b97 100644
--- a/qmake/tools/qcstring.cpp
+++ b/qmake/tools/qcstring.cpp
@@ -142,4 +142,15 @@ char *qstrncpy( char *dst, const char *src, uint len )
 
 /*!
+    \fn uint qstrlen( const char *str );
+
+    \relates QCString
+
+    A safe strlen function.
+
+    Returns the number of characters that precede the terminating '\0'.
+    or 0 if \a str is 0.
+*/
+
+/*!
     \fn int qstrcmp( const char *str1, const char *str2 );
 
@@ -300,5 +311,6 @@ Q_UINT16 qChecksum( const char *data, uint len )
 
 #ifdef QT_THREAD_SUPPORT
-        QMutexLocker locker( qt_global_mutexpool->get( &crc_tbl_init ) );
+        QMutexLocker locker( qt_global_mutexpool ?
+                             qt_global_mutexpool->get( &crc_tbl_init ) : 0 );
 #endif // QT_THREAD_SUPPORT
 
@@ -320,7 +332,13 @@ Q_UINT16 qChecksum( const char *data, uint len )
 }
 
-/*! \fn QByteArray qCompress( const QByteArray& data)
+/*!
+    \fn QByteArray qCompress( const QByteArray& data )
+
   \relates QByteArray
-  \overload
+
+    Compresses the array \a data and returns the compressed byte
+    array.
+
+    \sa qUncompress()
 */
 
@@ -328,8 +346,8 @@ Q_UINT16 qChecksum( const char *data, uint len )
   \relates QByteArray
 
+    \overload
+
   Compresses the array \a data which is \a nbytes long and returns the
   compressed byte array.
-
-  \sa qUncompress()
 */
 
@@ -380,7 +398,21 @@ QByteArray qCompress( const uchar* data, int nbytes )
 #endif
 
-/*! \fn QByteArray qUncompress( const QByteArray& data )
+/*!
+    \fn QByteArray qUncompress( const QByteArray& data )
+
   \relates QByteArray
-  \overload
+
+    Uncompresses the array \a data and returns the uncompressed byte
+    array.
+
+    Returns an empty QByteArray if the input data was corrupt.
+    \omit
+    ADD THE FOLLOWING FOR Qt 4.0
+    This function will uncompress data compressed with qCompress()
+    from this and any earlier Qt version, back to Qt 3.1 when this
+    feature was added.
+    \endomit
+
+    \sa qCompress()
 */
 
@@ -388,10 +420,8 @@ QByteArray qCompress( const uchar* data, int nbytes )
   \relates QByteArray
 
+    \overload
+
   Uncompresses the array \a data which is \a nbytes long and returns
   the uncompressed byte array.
-
-  Returns an empty QByteArray if the input data was corrupt.
-
-  \sa qCompress()
 */
 
@@ -937,4 +967,9 @@ int QCString::find( char c, int index, bool cs ) const
 int QCString::find( const char *str, int index, bool cs ) const
 {
+    return find( str, index, cs, length() );
+}
+
+int QCString::find( const char *str, int index, bool cs, uint l ) const
+{
     if ( (uint)index >= size() )
         return -1;
@@ -943,5 +978,4 @@ int QCString::find( const char *str, int index, bool cs ) const
     if ( !*str )
         return index;
-    const uint l = length();
     const uint sl = qstrlen( str );
     if ( sl + index > l )
@@ -1153,6 +1187,7 @@ int QCString::contains( const char *str, bool cs ) const
     int count = 0;
     int i = -1;
+    uint l = length();
     // use find for the faster hashing algorithm
-    while ( ( i = find ( str, i+1, cs ) ) != -1 )
+    while ( ( i = find ( str, i+1, cs, l ) ) != -1 )
         count++;
     return count;
@@ -1174,5 +1209,4 @@ int QCString::contains( const char *str, bool cs ) const
     \sa right(), mid()
 */
-
 QCString QCString::left( uint len ) const
 {
@@ -1498,13 +1532,15 @@ QCString &QCString::insert( uint index, const char *s )
             if ( index >= olen ) {              // insert after end of string
         detach();
-        if ( QByteArray::resize(nlen+index-olen+1) ) {
+        if ( QByteArray::resize(nlen+index-olen+1, QByteArray::SpeedOptim ) ) {
             memset( data()+olen, ' ', index-olen );
             memcpy( data()+index, s, len+1 );
         }
-            } else if ( QByteArray::resize(nlen+1) ) {// normal insert
+    } else {
         detach();
+                if ( QByteArray::resize(nlen+1, QByteArray::SpeedOptim ) ) {// normal insert
         memmove( data()+index+len, data()+index, olen-index+1 );
         memcpy( data()+index, s, len );
     }
+    }
     return *this;
 }
@@ -1570,5 +1606,5 @@ QCString &QCString::remove( uint index, uint len )
         detach();
         memmove( data()+index, data()+index+len, olen-index-len+1 );
-        QByteArray::resize(olen-len+1);
+        QByteArray::resize(olen-len+1, QByteArray::SpeedOptim );
     }
     return *this;
@@ -1632,4 +1668,5 @@ QCString &QCString::replace( char c, const char *after )
     \endcode
 */
+
 QCString &QCString::replace( const char *before, const char *after )
 {
@@ -1647,5 +1684,5 @@ QCString &QCString::replace( const char *before, const char *after )
     if ( bl == al ) {
         if ( bl ) {
-            while( (index = find( before, index ) ) != -1 ) {
+            while( (index = find( before, index, TRUE, len ) ) != -1 ) {
                 memcpy( d+index, after, al );
                 index += bl;
@@ -1656,5 +1693,5 @@ QCString &QCString::replace( const char *before, const char *after )
         uint movestart = 0;
         uint num = 0;
-        while( (index = find( before, index ) ) != -1 ) {
+        while( (index = find( before, index, TRUE, len ) ) != -1 ) {
             if ( num ) {
                 int msize = index - movestart;
@@ -1687,5 +1724,5 @@ QCString &QCString::replace( const char *before, const char *after )
             uint pos = 0;
             while( pos < 4095 ) {
-                index = find(before, index);
+                index = find(before, index, TRUE, len);
                 if ( index == -1 )
                     break;
@@ -1764,5 +1801,5 @@ QCString &QCString::replace( char c1, char c2 )
 int QCString::find( const QRegExp& rx, int index ) const
 {
-    QString d = QString::fromLatin1( data() );
+    QString d = QString::fromAscii( data() );
     return d.find( rx, index );
 }
@@ -1784,5 +1821,5 @@ int QCString::find( const QRegExp& rx, int index ) const
 int QCString::findRev( const QRegExp& rx, int index ) const
 {
-    QString d = QString::fromLatin1( data() );
+    QString d = QString::fromAscii( data() );
     return d.findRev( rx, index );
 }
@@ -1809,5 +1846,5 @@ int QCString::findRev( const QRegExp& rx, int index ) const
 int QCString::contains( const QRegExp &rx ) const
 {
-    QString d = QString::fromLatin1( data() );
+    QString d = QString::fromAscii( data() );
     return d.contains( rx );
 }
@@ -1839,6 +1876,6 @@ int QCString::contains( const QRegExp &rx ) const
 QCString &QCString::replace( const QRegExp &rx, const char *str )
 {
-    QString d = QString::fromLatin1( data() );
-    QString r = QString::fromLatin1( str );
+    QString d = QString::fromAscii( data() );
+    QString r = QString::fromAscii( str );
     d.replace( rx, r );
     setStr( d.ascii() );
@@ -2200,5 +2237,5 @@ QCString& QCString::operator+=( const char *str )
     uint len1 = length();
     uint len2 = qstrlen(str);
-    if ( !QByteArray::resize( len1 + len2 + 1 ) )
+    if ( !QByteArray::resize( len1 + len2 + 1, QByteArray::SpeedOptim ) )
                 return *this;                   // no memory
     memcpy( data() + len1, str, len2 + 1 );
@@ -2216,5 +2253,5 @@ QCString &QCString::operator+=( char c )
     detach();
     uint len = length();
-    if ( !QByteArray::resize( len + 2 ) )
+    if ( !QByteArray::resize( len + 2, QByteArray::SpeedOptim  ) )
                 return *this;                   // no memory
     *(data() + len) = c;