SMS4, a block cipher whose global structure adopts a special unbalanced Feistel scheme with SP round function, is accepted as the Chinese National Standard for securing Wireless LANs. In this paper, in order to evaluate the security against linear cryptanalysis, we examine the upper bound of the maximum linear characteristic probability of SMS4-like ciphers with SP round function. In the same way as for SPN ciphers, it is sufficient to consider the lower bound of the number of linear active s-boxes. We propose a formula to compute the lower bound of the number of linear active s-boxes with regard to the number of rounds. The security threshold of SMS4-like ciphers can be estimated easily with our result. Furthermore, if the number of input words in each round of SMS4-like cipher is m, we find that it is unnecessary for designers to make the linear branch number of P greater than 2m with respect to linear cryptanalysis.