Lines Matching refs:slen
97 if (b == NULL || b->data == NULL || b->slen < 0 || b->mlen <= 0 ||
98 b->mlen < b->slen || olen <= 0) {
108 if (7 * b->mlen < 8 * b->slen) {
110 /* If slen is close to mlen in size then use realloc to reduce
127 /* If slen is not close to mlen then avoid the penalty of copying
139 if (b->slen) bstr__memcpy ((char *) x, (char *) b->data, (size_t) b->slen);
145 b->data[b->slen] = (unsigned char) '\0';
153 * Set the size of the memory backing the bstring b to len or b->slen+1,
160 if (b == NULL || b->data == NULL || (b->slen+1) < 0 || b->mlen <= 0 ||
161 b->mlen < b->slen || len <= 0) {
165 if (len < b->slen + 1) len = b->slen + 1;
170 s[b->slen] = (unsigned char) '\0';
195 b->slen = (int) j;
223 b->slen = (int) j;
247 b->slen = len;
277 if (b == NULL || b->slen < 0 || b->data == NULL) return NULL;
278 l = b->slen;
320 d = b0->slen;
321 len = b1->slen;
337 b0->slen = d + len;
350 d = b->slen;
354 b->slen++;
366 if (b == NULL || b->data == NULL || b->slen < 0 || b->mlen < b->slen
370 l = b->mlen - b->slen;
371 d = (char *) &b->data[b->slen];
374 b->slen += i;
378 b->slen += i;
391 if (b == NULL || b->data == NULL || b->slen < 0 || b->mlen < b->slen
394 if (0 > (nl = b->slen + len)) return BSTR_ERR; /* Overflow? */
397 bBlockCopy (&b->data[b->slen], s, (size_t) len);
398 b->slen = nl;
412 if (b == NULL || b->slen < 0 || b->data == NULL) return NULL;
420 i = b->slen;
435 b0->slen = i;
438 b0->data[b0->slen] = (unsigned char) '\0';
448 if (b == NULL || b->data == NULL || b->slen < 0)
450 if (b->slen != 0) {
451 if (balloc (a, b->slen) != BSTR_OK) return BSTR_ERR;
452 bstr__memmove (a->data, b->data, b->slen);
454 if (a == NULL || a->data == NULL || a->mlen < a->slen ||
455 a->slen < 0 || a->mlen == 0)
458 a->data[b->slen] = (unsigned char) '\0';
459 a->slen = b->slen;
470 if (b == NULL || b->data == NULL || b->slen < 0)
478 if (len > b->slen - left) len = b->slen - left;
480 if (a == NULL || a->data == NULL || a->mlen < a->slen ||
481 a->slen < 0 || a->mlen == 0)
487 a->slen = len;
489 a->slen = 0;
491 a->data[a->slen] = (unsigned char) '\0';
504 if (a == NULL || a->data == NULL || a->mlen < a->slen ||
505 a->slen < 0 || a->mlen == 0 || NULL == str)
510 a->slen = i;
515 a->slen = i;
520 a->slen += (int) len;
531 if (a == NULL || a->data == NULL || a->mlen < a->slen ||
532 a->slen < 0 || a->mlen == 0 || NULL == s || len + 1 < 1)
537 a->slen = len;
546 if (n < 0 || b == NULL || b->data == NULL || b->mlen < b->slen ||
547 b->slen < 0 || b->mlen <= 0) return BSTR_ERR;
548 if (b->slen > n) {
549 b->slen = n;
565 if (b == NULL || b->data == NULL || b->mlen < b->slen ||
566 b->slen < 0 || b->mlen <= 0) return BSTR_ERR;
567 for (i=0, len = b->slen; i < len; i++) {
579 if (b == NULL || b->data == NULL || b->mlen < b->slen ||
580 b->slen < 0 || b->mlen <= 0) return BSTR_ERR;
581 for (i=0, len = b->slen; i < len; i++) {
599 if (bdata (b0) == NULL || b0->slen < 0 ||
600 bdata (b1) == NULL || b1->slen < 0) return SHRT_MIN;
601 if ((n = b0->slen) > b1->slen) n = b1->slen;
602 else if (b0->slen == b1->slen && b0->data == b1->data) return BSTR_OK;
610 if (b0->slen > n) {
615 if (b1->slen > n) {
636 if (bdata (b0) == NULL || b0->slen < 0 ||
637 bdata (b1) == NULL || b1->slen < 0 || n < 0) return SHRT_MIN;
639 if (m > b0->slen) m = b0->slen;
640 if (m > b1->slen) m = b1->slen;
650 if (n == m || b0->slen == b1->slen) return BSTR_OK;
652 if (b0->slen > m) {
674 if (bdata (b0) == NULL || b0->slen < 0 ||
675 bdata (b1) == NULL || b1->slen < 0) return BSTR_ERR;
676 if (b0->slen != b1->slen) return BSTR_OK;
677 if (b0->data == b1->data || b0->slen == 0) return 1;
678 for (i=0, n=b0->slen; i < n; i++) {
699 if (bdata (b0) == NULL || b0->slen < 0 || NULL == blk || len < 0)
701 if (b0->slen < len) return BSTR_OK;
721 if (b == NULL || b->data == NULL || b->mlen < b->slen ||
722 b->slen < 0 || b->mlen <= 0) return BSTR_ERR;
724 for (len = b->slen, i = 0; i < len; i++) {
731 b->slen = 0;
743 if (b == NULL || b->data == NULL || b->mlen < b->slen ||
744 b->slen < 0 || b->mlen <= 0) return BSTR_ERR;
746 for (i = b->slen - 1; i >= 0; i--) {
749 b->slen = i + 1;
755 b->slen = 0;
767 if (b == NULL || b->data == NULL || b->mlen < b->slen ||
768 b->slen < 0 || b->mlen <= 0) return BSTR_ERR;
770 for (i = b->slen - 1; i >= 0; i--) {
773 b->slen = i + 1;
780 b->slen = 0;
793 b0->slen < 0 || b1->slen < 0) return BSTR_ERR;
794 if (b0->slen != b1->slen) return BSTR_OK;
795 if (b0->data == b1->data || b0->slen == 0) return 1;
796 return !bstr__memcmp (b0->data, b1->data, b0->slen);
810 if (bdata (b0) == NULL || b0->slen < 0 || NULL == blk || len < 0)
812 if (b0->slen < len) return BSTR_OK;
834 if (b == NULL || s == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR;
835 for (i=0; i < b->slen; i++) {
855 if (b == NULL || s == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR;
856 for (i=0; i < b->slen; i++) {
883 b0->slen < 0 || b1->slen < 0) return SHRT_MIN;
884 n = b0->slen; if (n > b1->slen) n = b1->slen;
885 if (b0->slen == b1->slen && (b0->data == b1->data || b0->slen == 0))
894 if (b0->slen > n) return 1;
895 if (b1->slen > n) return -1;
913 b0->slen < 0 || b1->slen < 0) return SHRT_MIN;
915 if (m > b0->slen) m = b0->slen;
916 if (m > b1->slen) m = b1->slen;
926 if (n == m || b0->slen == b1->slen) return BSTR_OK;
928 if (b0->slen > m) return 1;
941 if (b == NULL || b->slen < 0 || b->data == NULL) return NULL;
948 if (len > b->slen - left) len = b->slen - left;
968 if (len < 0 || b == NULL || b->data == NULL || b->slen < 0 ||
969 b->mlen < b->slen || b->mlen <= 0)
971 if (len > 0 && pos < b->slen) {
972 if (pos + len >= b->slen) {
973 b->slen = pos;
977 b->slen - (pos+len));
978 b->slen -= len;
980 b->data[b->slen] = (unsigned char) '\0';
993 if (b == NULL || b->slen < 0 || b->mlen <= 0 || b->mlen < b->slen ||
1002 b->slen = -1;
1027 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1028 b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR;
1029 if (b1->slen == pos) return (b2->slen == 0)?pos:BSTR_ERR;
1030 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1031 if (b2->slen == 0) return pos;
1034 if ((lf = b1->slen - b2->slen + 1) <= pos) return BSTR_ERR;
1043 ll = b2->slen;
1045 /* Peel off the b2->slen == 1 case */
1054 lf = b1->slen - 1;
1110 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1111 b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR;
1112 if (b1->slen == pos && b2->slen == 0) return pos;
1113 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1114 if (b2->slen == 0) return pos;
1117 if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return 0;
1120 if ((l = b1->slen - b2->slen) < 0) return BSTR_ERR;
1128 l = b2->slen;
1157 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1158 b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR;
1159 if (b1->slen == pos) return (b2->slen == 0)?pos:BSTR_ERR;
1160 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1161 if (b2->slen == 0) return pos;
1163 l = b1->slen - b2->slen + 1;
1176 ll = b2->slen;
1205 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1206 b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR;
1207 if (b1->slen == pos && b2->slen == 0) return pos;
1208 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1209 if (b2->slen == 0) return pos;
1212 if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return BSTR_OK;
1215 if ((l = b1->slen - b2->slen) < 0) return BSTR_ERR;
1223 l = b2->slen;
1248 if (b == NULL || b->data == NULL || b->slen <= pos || pos < 0) return BSTR_ERR;
1249 p = (unsigned char *) bstr__memchr ((b->data + pos), (unsigned char) c, (b->slen - pos));
1262 if (b == NULL || b->data == NULL || b->slen <= pos || pos < 0) return BSTR_ERR;
1294 if (b == NULL || b->data == NULL || b->slen <= 0) return BSTR_ERR;
1296 for (i=0; i < b->slen; i++) {
1326 b0->slen <= pos) return BSTR_ERR;
1327 if (1 == b1->slen) return bstrchrp (b0, b1->data[0], pos);
1329 return binchrCF (b0->data, b0->slen, pos, &chrs);
1351 b0->slen < pos) return BSTR_ERR;
1352 if (pos == b0->slen) pos--;
1353 if (1 == b1->slen) return bstrrchrp (b0, b1->data[0], pos);
1367 b0->slen <= pos) return BSTR_ERR;
1370 return binchrCF (b0->data, b0->slen, pos, &chrs);
1382 b0->slen < pos) return BSTR_ERR;
1383 if (pos == b0->slen) pos--;
1401 if (pos < 0 || b0 == NULL || b0->slen < 0 || NULL == b0->data ||
1402 b0->mlen < b0->slen || b0->mlen <= 0) return BSTR_ERR;
1403 if (b1 != NULL && (b1->slen < 0 || b1->data == NULL)) return BSTR_ERR;
1412 d += aux->slen;
1421 newlen = b0->slen;
1425 bstr__memset (b0->data + b0->slen, (int) fill, (size_t) (pos - b0->slen));
1431 bBlockCopy ((char *) (b0->data + pos), (char *) aux->data, aux->slen);
1438 b0->slen = newlen;
1456 if (pos < 0 || b1 == NULL || b2 == NULL || b1->slen < 0 ||
1457 b2->slen < 0 || b1->mlen < b1->slen || b1->mlen <= 0) return BSTR_ERR;
1465 d = b1->slen + aux->slen;
1466 l = pos + aux->slen;
1475 bstr__memset (b1->data + b1->slen, (int) fill, (size_t) (pos - b1->slen));
1476 b1->slen = l;
1484 b1->slen = d;
1486 bBlockCopy (b1->data + pos, aux->data, aux->slen);
1487 b1->data[b1->slen] = (unsigned char) '\0';
1496 * fill is used is pos > b1->slen.
1506 b1->slen < 0 || b2->slen < 0 || b1->mlen < b1->slen ||
1510 if (pl >= b1->slen) {
1512 if (pos + b2->slen < b1->slen) {
1513 b1->slen = pos + b2->slen;
1514 b1->data[b1->slen] = (unsigned char) '\0';
1520 if ((pd = (ptrdiff_t) (b2->data - b1->data)) >= 0 && pd < (ptrdiff_t) b1->slen) {
1524 if (aux->slen > len) {
1525 if (balloc (b1, b1->slen + aux->slen - len) != BSTR_OK) {
1531 if (aux->slen != len) bstr__memmove (b1->data + pos + aux->slen, b1->data + pos + len, b1->slen - (pos + len));
1532 bstr__memcpy (b1->data + pos, aux->data, aux->slen);
1533 b1->slen += aux->slen - len;
1534 b1->data[b1->slen] = (unsigned char) '\0';
1549 int i, ret, slen, mlen, delta, acc;
1558 pos < 0 || find->slen <= 0 || b->mlen < 0 || b->slen > b->mlen ||
1559 b->mlen <= 0 || b->slen < 0 || repl->slen < 0) return BSTR_ERR;
1560 if (pos > b->slen - find->slen) return BSTR_OK;
1564 if ((ptrdiff_t) (pos - find->slen) < pd && pd < (ptrdiff_t) b->slen) {
1570 if ((ptrdiff_t) (pos - repl->slen) < pd && pd < (ptrdiff_t) b->slen) {
1577 delta = auxf->slen - auxr->slen;
1583 bstr__memcpy (b->data + pos, auxr->data, auxr->slen);
1584 pos += auxf->slen;
1591 /* shrinking replacement since auxf->slen > auxr->slen */
1598 if (auxr->slen)
1599 bstr__memcpy (b->data + i - acc, auxr->data, auxr->slen);
1601 pos = i + auxf->slen;
1605 i = b->slen;
1608 b->slen -= acc;
1609 b->data[b->slen] = (unsigned char) '\0';
1617 /* expanding replacement since find->slen < repl->slen. Its a lot
1622 acc = slen = 0;
1625 if (slen + 1 >= mlen) {
1638 d[slen] = pos;
1639 slen++;
1641 pos += auxf->slen;
1647 d[slen] = b->slen;
1649 if (BSTR_OK == (ret = balloc (b, b->slen + acc + 1))) {
1650 b->slen += acc;
1651 for (i = slen-1; i >= 0; i--) {
1653 s = d[i] + auxf->slen;
1658 if (auxr->slen) {
1659 bstr__memmove (b->data + s + acc - auxr->slen,
1660 auxr->data, auxr->slen);
1664 b->data[b->slen] = (unsigned char) '\0';
1705 if (pos < 0 || b == NULL || b->slen < 0 || b->mlen < b->slen ||
1709 d = b->slen + len;
1716 pos = b->slen;
1717 b->slen = l;
1724 b->slen = d;
1728 b->data[b->slen] = (unsigned char) '\0';
1749 b->slen = len;
1764 if (b == NULL || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen ||
1767 i = b->slen;
1772 b->slen = i;
1812 if (b == NULL || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen ||
1819 b->slen = d;
1829 b->slen = d;
1850 if (b == NULL || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen ||
1852 d = b->slen;
1857 b->slen = d;
1867 b->slen = d;
1886 if (0 > bgetsa (buff = bfromcstr (""), getcPtr, parm, terminator) || 0 >= buff->slen) {
1936 return s->isEOF && (s->buff->slen == 0);
1970 r->slen < 0 || r->mlen < r->slen) return BSTR_ERR;
1971 l = s->buff->slen;
1980 x.slen = i + 1;
1982 s->buff->slen = l;
1987 rlo = r->slen;
1990 x.slen = l;
1996 if (BSTR_OK != balloc (r, r->slen + s->maxBuffSz + 1)) return BSTR_ERR;
1997 b = (char *) (r->data + r->slen);
2000 r->data[r->slen] = (unsigned char) '\0';
2001 s->buff->slen = 0;
2004 return BSTR_ERR & -(r->slen == rlo);
2009 r->slen += l;
2014 r->slen += i;
2015 s->buff->slen = l - i;
2017 r->data[r->slen] = (unsigned char) '\0';
2035 term->data == NULL || r->mlen <= 0 || r->slen < 0 ||
2036 r->mlen < r->slen) return BSTR_ERR;
2037 if (term->slen == 1) return bsreadlna (r, s, term->data[0]);
2038 if (term->slen < 1 || buildCharField (&cf, term)) return BSTR_ERR;
2040 l = s->buff->slen;
2049 x.slen = i + 1;
2051 s->buff->slen = l;
2056 rlo = r->slen;
2059 x.slen = l;
2065 if (BSTR_OK != balloc (r, r->slen + s->maxBuffSz + 1)) return BSTR_ERR;
2066 b = (unsigned char *) (r->data + r->slen);
2069 r->data[r->slen] = (unsigned char) '\0';
2070 s->buff->slen = 0;
2073 return BSTR_ERR & -(r->slen == rlo);
2079 r->slen += l;
2084 r->slen += i;
2085 s->buff->slen = l - i;
2087 r->data[r->slen] = (unsigned char) '\0';
2105 || r->slen < 0 || r->mlen < r->slen || n <= 0) return BSTR_ERR;
2107 n += r->slen;
2110 l = s->buff->slen;
2112 orslen = r->slen;
2117 l = (int) s->readFnPtr (r->data + r->slen, 1, n - r->slen, s->parm);
2118 if (0 >= l || l > n - r->slen) {
2122 r->slen += l;
2123 r->data[r->slen] = (unsigned char) '\0';
2133 if (l + r->slen >= n) {
2134 x.slen = n - r->slen;
2136 s->buff->slen = l;
2137 if (BSTR_OK == ret) bdelete (s->buff, 0, x.slen);
2138 return BSTR_ERR & -(r->slen == orslen);
2141 x.slen = l;
2144 l = n - r->slen;
2152 s->buff->slen = l;
2153 return BSTR_ERR & -(r->slen == orslen);
2167 r->slen = 0;
2181 if (term->slen == 1) return bsreadln (r, s, term->data[0]);
2182 if (term->slen < 1) return BSTR_ERR;
2184 r->slen = 0;
2200 r->slen = 0;
2236 if (sep != NULL && (sep->slen < 0 || sep->data == NULL)) return NULL;
2239 v = bl->entry[i]->slen;
2245 if (sep != NULL) c += (bl->qty - 1) * sep->slen;
2256 b->slen = c-1;
2260 bstr__memcpy (b->data + c, sep->data, sep->slen);
2261 c += sep->slen;
2263 v = bl->entry[i]->slen;
2297 || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR;
2301 if (splitStr->slen == 0) {
2309 if (i >= buff->slen) {
2311 if (i >= buff->slen) {
2320 blk2tbstr (t, buff->data + i + 1, buff->slen - (i + 1));
2322 buff->slen = i;
2327 buff->slen = 0;
2362 || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR;
2364 if (splitStr->slen == 1) return bssplitscb (s, splitStr, cb, parm);
2368 if (splitStr->slen == 0) {
2374 buff->slen = 0;
2383 i = ret + splitStr->slen;
2506 if (cb == NULL || str == NULL || pos < 0 || pos > str->slen)
2511 for (i=p; i < str->slen; i++) {
2516 } while (p <= str->slen);
2541 if (cb == NULL || str == NULL || pos < 0 || pos > str->slen
2542 || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR;
2543 if (splitStr->slen == 0) {
2544 if ((ret = cb (parm, 0, str->slen)) > 0) ret = 0;
2548 if (splitStr->slen == 1)
2555 for (i=p; i < str->slen; i++) {
2560 } while (p <= str->slen);
2584 if (cb == NULL || str == NULL || pos < 0 || pos > str->slen
2585 || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR;
2587 if (0 == splitStr->slen) {
2588 for (i=pos; i < str->slen; i++) {
2594 if (splitStr->slen == 1)
2597 for (i=p=pos; i <= str->slen - splitStr->slen; i++) {
2598 if (0 == bstr__memcmp (splitStr->data, str->data + i, splitStr->slen)) {
2600 i += splitStr->slen;
2604 if ((ret = cb (parm, p, str->slen - p)) < 0) return ret;
2644 if (str == NULL || str->data == NULL || str->slen < 0) return NULL;
2672 if (str == NULL || str->data == NULL || str->slen < 0) return NULL;
2701 if ( str == NULL || str->slen < 0 || str->data == NULL ||
2702 splitStr == NULL || splitStr->slen < 0 || splitStr->data == NULL)
2777 || b->slen < 0 || b->slen > b->mlen) return BSTR_ERR;
2795 buff->slen = (int) (strlen) ((char *) buff->data);
2797 if (buff->slen < n) break;
2825 || b->slen < 0 || b->slen > b->mlen) return BSTR_ERR;
2843 buff->slen = (int) (strlen) ((char *) buff->data);
2845 if (buff->slen < n) break;
2890 buff->slen = (int) (strlen) ((char *) buff->data);
2892 if (buff->slen < n) break;
2921 * destructive of the contents of b from the b->slen point onward. If there
2929 || b->mlen <= 0 || b->slen < 0 || b->slen > b->mlen) return BSTR_ERR;
2931 if (count > (n = b->slen + count) + 2) return BSTR_ERR;
2934 exvsnprintf (r, (char *) b->data + b->slen, count + 2, fmt, arg);
2938 if (n >= (l = b->slen + (int) (strlen) ((const char *) b->data + b->slen))) {
2939 b->slen = l;
2946 b->data[b->slen] = '\0';