Lines Matching refs:escapes
491 * Here escapes and valid chars for GDS are considered; as soon as more
1439 ber_len_t len, escapes;
1447 for ( startPos = p = str, escapes = 0; p < end; p++ ) {
1454 escapes++;
1462 escapes += 2;
1500 * escapes if not pedantic?
1534 len = ( endPos ? endPos : p ) - startPos - escapes;
1537 if ( escapes == 0 ) {
1593 ber_len_t len, escapes;
1601 for ( startPos = p = str, escapes = 0; p[ 0 ]; p++ ) {
1605 escapes++;
1646 len = ( endPos ? endPos : p ) - startPos - escapes;
1648 if ( escapes == 0 ){
1661 * This point is reached only if escapes
1682 ber_len_t len, escapes;
1694 for ( startPos = p = str, escapes = 0; p[ 0 ]; p++ ) {
1705 escapes++;
1731 len = ( endPos ? endPos : p ) - startPos - escapes;
1733 if ( escapes == 0 ) {
1762 unsigned escapes = 0;
1795 escapes++;
1824 len = endPos - startPos - escapes;
1825 assert( endPos >= startPos + escapes );
1827 if ( escapes == 0 ) {
Indexes created Thu Apr 23 00:23:13 UTC 2026