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
@@ -120,48 +120,59 @@ char *qstrdup( const char *src )
 /*!
     \relates QCString
 
     A safe strncpy() function.
 
     Copies at most \a len bytes from \a src (stopping at \a len or the
     terminating '\0' whichever comes first) into \a dst and returns a
     pointer to \a dst. Guarantees that \a dst is '\0'-terminated. If
     \a src or \a dst is 0, returns 0 immediately.
 
     \sa qstrcpy()
 */
 
 char *qstrncpy( char *dst, const char *src, uint len )
 {
     if ( !src || !dst )
         return 0;
     strncpy( dst, src, len );
     if ( len > 0 )
         dst[len-1] = '\0';
     return dst;
 }
 
 /*!
+    \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 );
 
     \relates QCString
 
     A safe strcmp() function.
 
     Compares \a str1 and \a str2. Returns a negative value if \a str1
     is less than \a str2, 0 if \a str1 is equal to \a str2 or a
     positive value if \a str1 is greater than \a str2.
 
     Special case I: Returns 0 if \a str1 and \a str2 are both 0.
 
     Special case II: Returns a random nonzero value if \a str1 is 0
     or \a str2 is 0 (but not both).
 
     \sa qstrncmp() qstricmp() qstrnicmp()
         \link #asciinotion Note on character comparisons \endlink
 */
 
 /*!
     \fn int qstrncmp( const char *str1, const char *str2, uint len );
 
     \relates QCString
 
@@ -278,142 +289,161 @@ static void createCRC16Table()			// build CRC16 lookup table
         SET_BIT( j, 13, v1 );
         SET_BIT( j,  2, v2 );
         SET_BIT( j,  9, v2 );
         SET_BIT( j, 14, v2 );
         SET_BIT( j,  3, v3 );
         SET_BIT( j, 10, v3 );
         SET_BIT( j, 15, v3 );
         crc_tbl[i] = j;
     }
 }
 
 /*!
     \relates QMemArray
 
     Returns the CRC-16 checksum of \a len bytes starting at \a data.
 
     The checksum is independent of the byte order (endianness).
 */
 
 Q_UINT16 qChecksum( const char *data, uint len )
 {
             if ( !crc_tbl_init ) {              // create lookup table
 
 #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
 
         if ( !crc_tbl_init ) {
             createCRC16Table();
             crc_tbl_init = TRUE;
         }
     }
     register Q_UINT16 crc = 0xffff;
     uchar c;
     uchar *p = (uchar *)data;
     while ( len-- ) {
         c = *p++;
         crc = ( (crc >> 4) & 0x0fff ) ^ crc_tbl[((crc ^ c) & 15)];
         c >>= 4;
         crc = ( (crc >> 4) & 0x0fff ) ^ crc_tbl[((crc ^ c) & 15)];
     }
     return ~crc & 0xffff;
 }
 
-/*! \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()
 */
 
 /*!
   \relates QByteArray
 
+    \overload
+
   Compresses the array \a data which is \a nbytes long and returns the
   compressed byte array.
-
-  \sa qUncompress()
 */
 
 #ifndef QT_NO_COMPRESS
 QByteArray qCompress( const uchar* data, int nbytes )
 {
     if ( nbytes == 0 ) {
         QByteArray tmp( 4 );
         tmp.fill( 0 );
         return tmp;
     }
     if ( !data ) {
 #if defined(QT_CHECK_RANGE)
         qWarning( "qCompress: data is NULL." );
 #endif
         return QByteArray();
     }
 
     ulong len = nbytes * 2;
     QByteArray bazip;
     int res;
     do {
         bazip.resize( len + 4 );
         res = ::compress(  (uchar*)bazip.data()+4, &len, (uchar*)data, nbytes );
 
         switch ( res ) {
         case Z_OK:
             bazip.resize( len + 4 );
             bazip[0] = ( nbytes & 0xff000000 ) >> 24;
             bazip[1] = ( nbytes & 0x00ff0000 ) >> 16;
             bazip[2] = ( nbytes & 0x0000ff00 ) >> 8;
             bazip[3] = ( nbytes & 0x000000ff );
             break;
         case Z_MEM_ERROR:
 #if defined(QT_CHECK_RANGE)
             qWarning( "qCompress: Z_MEM_ERROR: Not enough memory." );
 #endif
             bazip.resize( 0 );
             break;
         case Z_BUF_ERROR:
             len *= 2;
             break;
         }
     } while ( res == Z_BUF_ERROR );
 
     return bazip;
 }
 #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()
 */
 
 /*!
   \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()
 */
 
 #ifndef QT_NO_COMPRESS
 QByteArray qUncompress( const uchar* data, int nbytes )
 {
     if ( !data ) {
 #if defined(QT_CHECK_RANGE)
         qWarning( "qUncompress: data is NULL." );
 #endif
         return QByteArray();
     }
     if ( nbytes <= 4 ) {
 #if defined(QT_CHECK_RANGE)
         if ( nbytes < 4 || ( data[0]!=0 || data[1]!=0 || data[2]!=0 || data[3]!=0 ) )
             qWarning( "qUncompress: Input data is corrupted." );
 #endif
         return QByteArray();
     }
     ulong expectedSize = ( data[0] << 24 ) | ( data[1] << 16 ) | ( data[2] << 8 ) | data[3];
     ulong len = QMAX( expectedSize,  1 );
     QByteArray baunzip;
     int res;
     do {
         baunzip.resize( len );
@@ -915,55 +945,59 @@ int QCString::find( char c, int index, bool cs ) const
 }
 
 #define REHASH( a ) \
     if ( sl_minus_1 < sizeof(uint) * CHAR_BIT ) \
         hashHaystack -= (a) << sl_minus_1; \
     hashHaystack <<= 1
 
 /*!
     \overload
 
     Finds the first occurrence of the string \a str, starting at
     position \a index.
 
     The search is case sensitive if \a cs is TRUE, or case insensitive
     if \a cs is FALSE.
 
     Returns the position of \a str, or -1 if \a str could not be
     found.
 
     \sa \link #asciinotion Note on character comparisons \endlink
 */
 
 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;
     if ( !str )
         return -1;
     if ( !*str )
         return index;
-    const uint l = length();
     const uint sl = qstrlen( str );
     if ( sl + index > l )
         return -1;
 
     if ( sl == 1 )
         return find( *str, index, cs );
 
     /*
       See QString::find() for details.
     */
     const char* needle = str;
     const char* haystack = data() + index;
     const char* end = data() + (l-sl);
     const uint sl_minus_1 = sl-1;
     uint hashNeedle = 0, hashHaystack = 0,i;
 
     if ( cs ) {
         for ( i = 0; i < sl; ++i ) {
             hashNeedle = ((hashNeedle<<1) + needle[i] );
             hashHaystack = ((hashHaystack<<1) + haystack[i] );
         }
         hashHaystack -= *(haystack+sl_minus_1);
 
         while ( haystack <= end ) {
@@ -1131,70 +1165,70 @@ int QCString::contains( char c, bool cs ) const
         }
     }
     return count;
 }
 
 /*!
     \overload
 
     Returns the number of times \a str occurs in the string.
 
     The match is case sensitive if \a cs is TRUE, or case insensitive
     if \a cs if FALSE.
 
     This function counts overlapping substrings, for example, "banana"
     contains two occurrences of "ana".
 
     \sa findRev()
         \link #asciinotion Note on character comparisons \endlink
 */
 
 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;
 }
 
 /*!
     Returns a substring that contains the \a len leftmost characters
     of the string.
 
     The whole string is returned if \a len exceeds the length of the
     string.
 
     Example:
     \code
     QCString s = "Pineapple";
     QCString t = s.left( 4 );  // t == "Pine"
     \endcode
 
     \sa right(), mid()
 */
-
 QCString QCString::left( uint len ) const
 {
     if ( isEmpty() ) {
         QCString empty;
         return empty;
     } else if ( len >= size() ) {
         QCString same( data() );
         return same;
     } else {
         QCString s( len+1 );
         strncpy( s.data(), data(), len );
         *(s.data()+len) = '\0';
         return s;
     }
 }
 
 /*!
     Returns a substring that contains the \a len rightmost characters
     of the string.
 
     The whole string is returned if \a len exceeds the length of the
     string.
 
     Example:
@@ -1476,57 +1510,59 @@ QCString QCString::simplifyWhiteSpace() const
     Inserts string \a s into the string at position \a index.
 
     If \a index is beyond the end of the string, the string is
     padded with spaces (ASCII 32) to length \a index and then \a s
     is appended.
 
     \code
     QCString s = "I like fish";
     s.insert( 2, "don't ");     // s == "I don't like fish"
 
     s = "x";                    // index 01234
     s.insert( 3, "yz" );        // s == "x  yz"
     \endcode
 */
 
 QCString &QCString::insert( uint index, const char *s )
 {
     int len = qstrlen(s);
     if ( len == 0 )
         return *this;
     uint olen = length();
     int nlen = olen + len;
             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;
 }
 
 /*!
     Inserts character \a c into the string at position \a index and
     returns a reference to the string.
 
     If \a index is beyond the end of the string, the string is
     padded with spaces (ASCII 32) to length \a index and then \a c
     is appended.
 
     Example:
     \code
     QCString s = "Yes";
     s.insert( 3, '!');   // s == "Yes!"
     \endcode
 
     \sa remove(), replace()
 */
 
         QCString &QCString::insert( uint index, char c )// insert char
 {
     char buf[2];
     buf[0] = c;
@@ -1548,49 +1584,49 @@ QCString &QCString::insert( uint index, char c )	// insert char
 
     If \a index is out of range, nothing happens. If \a index is
     valid, but \a index + \a len is larger than the length of the
     string, the string is truncated at position \a index.
 
     \code
     QCString s = "Montreal";
     s.remove( 1, 4 );         // s == "Meal"
     \endcode
 
     \sa insert(), replace()
 */
 
 QCString &QCString::remove( uint index, uint len )
 {
     uint olen = length();
             if ( index + len >= olen ) {        // range problems
                 if ( index < olen ) {           // index ok
             detach();
             resize( index+1 );
         }
     } else if ( len != 0 ) {
         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;
 }
 
 /*!
     Replaces \a len characters from the string, starting at position
     \a index, with \a str, and returns a reference to the string.
 
     If \a index is out of range, nothing is removed and \a str is
     appended at the end of the string. If \a index is valid, but \a
     index + \a len is larger than the length of the string, \a str
     replaces the rest of the string from position \a index.
 
     \code
     QCString s = "Say yes!";
     s.replace( 4, 3, "NO" );  // s == "Say NO!"
     \endcode
 
     \sa insert(), remove()
 */
 
 QCString &QCString::replace( uint index, uint len, const char *str )
 {
     remove( index, len );
@@ -1610,104 +1646,105 @@ QCString &QCString::replace( uint index, uint len, const char *str )
     s.replace( ',', " or " );
     // s == "a or b or c"
     \endcode
 */
 QCString &QCString::replace( char c, const char *after )
 {
     char str[2];
     str[0] = c;
     str[1] = '\0';
     return replace( str, after );
 }
 
 /*! \overload
 
     Replaces every occurrence of the string \a before in the string
     with the string \a after. Returns a reference to the string.
 
     Example:
     \code
     QCString s = "Greek is Greek";
     s.replace( "Greek", "English" );
     // s == "English is English"
     \endcode
 */
+
 QCString &QCString::replace( const char *before, const char *after )
 {
     if ( before == after || isNull() )
         return *this;
 
     detach();
 
     int index = 0;
     const int bl = before ? strlen( before ) : 0;
     const int al = after ? strlen( after ) : 0;
     char *d = data();
     uint len = length();
 
     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;
             }
         }
     } else if ( al < bl ) {
         uint to = 0;
         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;
                 if ( msize > 0 ) {
                     memmove( d + to, d + movestart, msize );
                     to += msize;
                 }
             } else {
                 to = index;
             }
             if ( al ) {
                 memcpy( d + to, after, al );
                 to += al;
             }
             index += bl;
             movestart = index;
             num++;
         }
         if ( num ) {
             int msize = len - movestart;
             if ( msize > 0 )
                 memmove( d + to, d + movestart, msize );
             resize( len - num*(bl-al) + 1 );
         }
     } else {
         // the most complex case. We don't want to loose performance by doing repeated
         // copies and reallocs of the string.
         while( index != -1 ) {
             uint indices[4096];
             uint pos = 0;
             while( pos < 4095 ) {
-                index = find(before, index);
+                index = find(before, index, TRUE, len);
                 if ( index == -1 )
                     break;
                 indices[pos++] = index;
                 index += bl;
                 // avoid infinite loop
                 if ( !bl )
                     index++;
             }
             if ( !pos )
                 break;
 
             // we have a table of replacement positions, use them for fast replacing
             int adjust = pos*(al-bl);
             // index has to be adjusted in case we get back into the loop above.
             if ( index != -1 )
                 index += adjust;
             uint newlen = len + adjust;
             int moveend = len;
             if ( newlen > len ) {
                 resize( newlen + 1 );
                 len = newlen;
             }
             d = data();
 
@@ -1742,125 +1779,125 @@ QCString &QCString::replace( char c1, char c2 )
             d[i] = c2;
         i++;
     }
     return *this;
 }
 
 
 #ifndef QT_NO_REGEXP_CAPTURE
 /*!
     \overload
 
     Finds the first occurrence of the regular expression \a rx,
     starting at position \a index.
 
     Returns the position of the next match, or -1 if \a rx was not
     found.
 
     \warning If you want to apply this function repeatedly to the same
     string it is more efficient to convert the string to a QString and
     apply the function to that.
 */
 
 int QCString::find( const QRegExp& rx, int index ) const
 {
-    QString d = QString::fromLatin1( data() );
+    QString d = QString::fromAscii( data() );
     return d.find( rx, index );
 }
 
 /*!
     \overload
 
     Finds the first occurrence of the regular expression \a rx,
     starting at position \a index and searching backwards.
 
     Returns the position of the next match (backwards), or -1 if \a rx
     was not found.
 
     \warning If you want to apply this function repeatedly to the same
     string it is more efficient to convert the string to a QString and
     apply the function to that.
 */
 
 int QCString::findRev( const QRegExp& rx, int index ) const
 {
-    QString d = QString::fromLatin1( data() );
+    QString d = QString::fromAscii( data() );
     return d.findRev( rx, index );
 }
 
 /*!
     \overload
 
     Counts the number of overlapping occurrences of \a rx in the string.
 
     Example:
     \code
     QString s = "banana and panama";
     QRegExp r = QRegExp( "a[nm]a", TRUE, FALSE );
     s.contains( r ); // 4 matches
     \endcode
 
     \sa find(), findRev()
 
     \warning If you want to apply this function repeatedly to the same
     string it is more efficient to convert the string to a QString and
     apply the function to that.
 */
 
 int QCString::contains( const QRegExp &rx ) const
 {
-    QString d = QString::fromLatin1( data() );
+    QString d = QString::fromAscii( data() );
     return d.contains( rx );
 }
 
 
 /*!
     \overload
 
     Replaces every occurrence of \a rx in the string with \a str.
     Returns a reference to the string.
 
     Example:
     \code
     QString s = "banana";
     s.replace( QRegExp("a.*a"), "" );     // becomes "b"
 
     s = "banana";
     s.replace( QRegExp("^[bn]a"), "X" );  // becomes "Xnana"
 
     s = "banana";
     s.replace( QRegExp("^[bn]a"), "" );   // becomes "nana"
     \endcode
 
     \warning If you want to apply this function repeatedly to the same
     string it is more efficient to convert the string to a QString and
     apply the function to that.
 */
 
 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() );
     return *this;
 }
 #endif //QT_NO_REGEXP
 
 /*!
     Returns the string converted to a \c long value.
 
     If \a ok is not 0: \a *ok is set to FALSE if the string is not a
     number, or if it has trailing garbage; otherwise \a *ok is set to
     TRUE.
 */
 
 long QCString::toLong( bool *ok ) const
 {
     char *p = data();
     long val=0;
     const long max_mult = 214748364;
     bool is_ok = FALSE;
     int neg = 0;
     if ( !p )
         goto bye;
             while ( isspace((uchar) *p) )       // skip leading space
@@ -2178,65 +2215,65 @@ bool QCString::setExpand( uint index, char c )
     \fn QCString::operator const char *() const
 
     Returns the string data.
 */
 
 
 /*!
     \fn QCString& QCString::append( const char *str )
 
     Appends string \a str to the string and returns a reference to the
     string. Equivalent to operator+=().
 */
 
 /*!
     Appends string \a str to the string and returns a reference to the string.
 */
 
 QCString& QCString::operator+=( const char *str )
 {
     if ( !str )
                 return *this;                   // nothing to append
     detach();
     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 );
     return *this;
 }
 
 /*!
     \overload
 
     Appends character \a c to the string and returns a reference to the string.
 */
 
 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;
     *(data() + len+1) = '\0';
     return *this;
 }
 
 
 /*****************************************************************************
   QCString stream functions
  *****************************************************************************/
 #ifndef QT_NO_DATASTREAM
 /*!
     \relates QCString
 
     Writes string \a str to the stream \a s.
 
     \sa \link datastreamformat.html Format of the QDataStream operators \endlink
 */
 QDataStream &operator<<( QDataStream &s, const QCString &str )
 {
     return s.writeBytes( str.data(), str.size() );
 }
 
 /*!