Lines Matching defs:if
25 #if !UCONFIG_NO_COLLATION
64 if(idx<32) {
110 if(compressible) {
157 if(byte<maxBytes[length]) {
172 if((uint32_t)offset <= maxBytes[length]) {
201 if(l<r) {
203 } else if(l>r) {
226 if(lowerLimit>=upperLimit) {
234 if(lowerLength<upperLength) {
235 if(lowerLimit==truncateWeight(upperLimit, lowerLength)) {
242 /* if the upper limit is a prefix of the lower limit then the earlier test lowerLimit>=upperLimit has caught it */
266 if(trail<maxBytes[length]) {
274 if(weight<0xff000000) {
285 if(trail>minBytes[length]) {
297 if(middle.end>=middle.start) {
302 if(lower[length].count>0 && upper[length].count>0) {
312 if(lowerEnd>upperStart) {
318 // if the leading bytes are equal
330 } else if(lowerEnd==upperStart) {
334 if(incWeight(lowerEnd, length)==upperStart) {
341 if(merged) {
357 if(lower[length].count>0) {
361 if(middle.count>0) {
365 if(upper[length].count>0) {
373 if(middle.count>0) {
379 if(upper[length].count>0) {
383 if(lower[length].count>0) {
393 // See if the first few minLength and minLength+1 ranges have enough weights.
395 if(n <= ranges[i].count) {
397 if(ranges[i].length > minLength) {
408 if(rangeCount>1) {
424 // See if the minLength ranges have enough weights
436 if(n > count * nextCountBytes) { return false; }
442 if(ranges[i].start < start) { start = ranges[i].start; }
443 if(ranges[i].end > end) { end = ranges[i].end; }
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
464 if(count1 == 0) {
502 if(!getWeightRanges(lowerLimit, upperLimit)) {
514 if(allocWeightsInShortRanges(n, minLength)) { break; }
516 if(minLength == 4) {
524 if(allocWeightsInMinLengthRanges(n, minLength)) { break; }
549 if(rangeIndex >= rangeCount) {
555 if(--range.count == 0) {
570 #endif /* #if !UCONFIG_NO_COLLATION */