$i = 0;
$t = microtime(true);
for(;$i<1000;$i++)
{
    $str = strtr(md5($i), $p2);
}
var_dump(microtime(true)-$t);    //0.085476875305176
$t = microtime(true);
for(;$i<2000;$i++)
{
    $str = preg_replace($p, '', md5($i));
}
var_dump(microtime(true)-$t);   //0.09863805770874

結(jié)果顯示，strtr的效率比preg_replace高約15%左右。
趁著周末，查看了strtr的php源碼：

復(fù)制代碼代碼如下:

PHP_FUNCTION(strtr)
{
        zval **str, **from, **to;
        int ac = ZEND_NUM_ARGS();
        //參數(shù)檢查（zend_get_parameters_ex函數(shù)定義在zend_api.c文件中）
        if (ac < 2 || ac > 3 || zend_get_parameters_ex(ac, &str, &from, &to) == FAILURE) {
                WRONG_PARAM_COUNT;
        }
        //參數(shù)檢查
        if (ac == 2 && Z_TYPE_PP(from) != IS_ARRAY) {
                php_error_docref(NULL TSRMLS_CC, E_WARNING, "The second argument is not an array.");
                RETURN_FALSE;
        }
        convert_to_string_ex(str);
        /* shortcut for empty string */
        //宏Z_STRLEN_PP定義在zend_operators.h
        if (Z_STRLEN_PP(str) == 0) {
                RETURN_EMPTY_STRING();
        }
        if (ac == 2) {
                php_strtr_array(return_value, Z_STRVAL_PP(str), Z_STRLEN_PP(str), HASH_OF(*from));
        } else {
                convert_to_string_ex(from);
                convert_to_string_ex(to);
                ZVAL_STRINGL(return_value, Z_STRVAL_PP(str), Z_STRLEN_PP(str), 1);
                php_strtr(Z_STRVAL_P(return_value),
                                  Z_STRLEN_P(return_value),
                                  Z_STRVAL_PP(from),
                                  Z_STRVAL_PP(to),
                                  MIN(Z_STRLEN_PP(from),
                                  Z_STRLEN_PP(to)));
        }
}

先看看php_strtr函數(shù)：

復(fù)制代碼代碼如下:

//trlen是字符串str_from與str_to的長(zhǎng)度的最小值
PHPAPI char *php_strtr(char *str, int len, char *str_from, char *str_to, int trlen)
{
        int i;
        unsigned char xlat[256]; //
        if ((trlen < 1) || (len < 1)) {
                return str;
        }
        //xlat的下標(biāo)與值相等
        for (i = 0; i < 256; xlat[i] = i, i++);
        //把from到to字符串的每一個(gè)字符對(duì)應(yīng)起來(lái)。例如：from="ab",to="cd"，則會(huì)產(chǎn)生這樣的對(duì)應(yīng)'a'=>'c', 'b'=>'d'。
        for (i = 0; i < trlen; i++) {
                xlat[(unsigned char) str_from[i]] = str_to[i];
        }
        //替換(不過(guò)覺(jué)得這個(gè)函數(shù)的效率還有可以改進(jìn)的地方，因?yàn)槿绻枰鎿Q的字符只是占整個(gè)字符串很少的部分，這樣就有大部分的賦值操作其實(shí)并沒(méi)有什么意義，這樣的情況下感覺(jué)先判斷再賦值感覺(jué)會(huì)高效一點(diǎn)。有空測(cè)試一下)
        for (i = 0; i < len; i++) {
                str[i] = xlat[(unsigned char) str[i]];
        }
        return str;
}

可見(jiàn)，在處理strtr('abcdaaabcd', 'ab', 'efd')這樣的操作時(shí)，應(yīng)該是很高效的。
（注意：這個(gè)操作輸出efcdeeefcd）
再看看php_strtr_array：

復(fù)制代碼代碼如下:

static void php_strtr_array(zval *return_value, char *str, int slen, HashTable *hash)
{
        zval **entry;
        char  *string_key;
        uint   string_key_len;
        zval **trans;
        zval   ctmp;
        ulong num_key;
        int minlen = 128*1024;
        int maxlen = 0, pos, len, found;
        char *key;
        HashPosition hpos;
        smart_str result = {0};
        HashTable tmp_hash;
        //把替換數(shù)組從hash復(fù)制到tmp_hash,并記錄下標(biāo)字符串的最大和最小長(zhǎng)度
        zend_hash_init(&tmp_hash, 0, NULL, NULL, 0);
        zend_hash_internal_pointer_reset_ex(hash, &hpos);
        while (zend_hash_get_current_data_ex(hash, (void **)&entry, &hpos) == SUCCESS) {
                switch (zend_hash_get_current_key_ex(hash, &string_key, &string_key_len, &num_key, 0, &hpos)) {
                        case HASH_KEY_IS_STRING:
                                len = string_key_len-1;
                                if (len < 1) {
                                        zend_hash_destroy(&tmp_hash);
                                        RETURN_FALSE;
                                }
                                zend_hash_add(&tmp_hash, string_key, string_key_len, entry, sizeof(zval*), NULL);
                                if (len > maxlen) {
                                        maxlen = len;
                                }
                                if (len < minlen) {
                                        minlen = len;
                                }
                                break;
                        //下標(biāo)如果是整形的話會(huì)轉(zhuǎn)換成字符串類型，例如：array(10=>'aa')轉(zhuǎn)換成array('10'=>'aa')
                        case HASH_KEY_IS_LONG:
                                Z_TYPE(ctmp) = IS_LONG;
                                Z_LVAL(ctmp) = num_key;
                                convert_to_string(&ctmp);
                                len = Z_STRLEN(ctmp);
                                zend_hash_add(&tmp_hash, Z_STRVAL(ctmp), len+1, entry, sizeof(zval*), NULL);
                                zval_dtor(&ctmp);
                                if (len > maxlen) {
                                        maxlen = len;
                                }
                                if (len < minlen) {
                                        minlen = len;
                                }
                                break;
                }
                zend_hash_move_forward_ex(hash, &hpos);
        }
        key = emalloc(maxlen+1);
        pos = 0; 
        //從字符串的第一個(gè)字符開(kāi)始循環(huán)匹配，pos記錄當(dāng)前查找的位置
        while (pos < slen) {
                //當(dāng)前位置加上最大長(zhǎng)度，如果大于字符串長(zhǎng)度，則最大長(zhǎng)度就需要改變
                if ((pos + maxlen) > slen) {
                        maxlen = slen - pos;
                }
                found = 0;
                memcpy(key, str+pos, maxlen);
                //從最大長(zhǎng)度開(kāi)始匹配，就是說(shuō)對(duì)'abcd'，若array('a'=>'e','ab'=>'f')，則會(huì)先把a(bǔ)b替換為f，而不是先把a(bǔ)換成e。
                for (len = maxlen; len >= minlen; len--) {
                        key[len] = 0;
                        //因?yàn)槭褂昧薶ash表，所以這樣的效率還是挺高的
                        if (zend_hash_find(&tmp_hash, key, len+1, (void**)&trans) == SUCCESS) {
                                char *tval;
                                int tlen;
                                zval tmp;
                                if (Z_TYPE_PP(trans) != IS_STRING) {
                                        tmp = **trans;
                                        zval_copy_ctor(&tmp);
                                        convert_to_string(&tmp);
                                        tval = Z_STRVAL(tmp);
                                        tlen = Z_STRLEN(tmp);
                                } else {
                                        tval = Z_STRVAL_PP(trans);
                                        tlen = Z_STRLEN_PP(trans);
                                }
                                //加入結(jié)果
                                smart_str_appendl(&result, tval, tlen);
                                //向前跳躍
                                pos += len;
                                found = 1;
                                if (Z_TYPE_PP(trans) != IS_STRING) {
                                        zval_dtor(&tmp);
                                }
                                break;
                        }
                }
                if (! found) {
                        smart_str_appendc(&result, str[pos++]);
                }
        }
        efree(key);
        zend_hash_destroy(&tmp_hash);
        smart_str_0(&result);
        RETVAL_STRINGL(result.c, result.len, 0);
}