Lines Matching refs:BSTR_OK
105 if ((len = snapUpSize (olen)) <= b->mlen) return BSTR_OK;
148 return BSTR_OK;
175 return BSTR_OK;
305 return BSTR_OK;
329 if (balloc (b0, d + len + 1) != BSTR_OK) {
339 return BSTR_OK;
351 if ((d | (b->mlen - d)) < 0 || balloc (b, d + 2) != BSTR_OK) return BSTR_ERR;
355 return BSTR_OK;
375 return BSTR_OK;
400 return BSTR_OK;
451 if (balloc (a, b->slen) != BSTR_OK) return BSTR_ERR;
460 return BSTR_OK;
485 if (balloc (a, len) != BSTR_OK) return BSTR_ERR;
492 return BSTR_OK;
511 return BSTR_OK;
521 return BSTR_OK;
538 return BSTR_OK;
552 return BSTR_OK;
570 return BSTR_OK;
584 return BSTR_OK;
602 else if (b0->slen == b1->slen && b0->data == b1->data) return BSTR_OK;
620 return BSTR_OK;
650 if (n == m || b0->slen == b1->slen) return BSTR_OK;
676 if (b0->slen != b1->slen) return BSTR_OK;
701 if (b0->slen < len) return BSTR_OK;
732 return BSTR_OK;
750 return BSTR_OK;
756 return BSTR_OK;
781 return BSTR_OK;
794 if (b0->slen != b1->slen) return BSTR_OK;
812 if (b0->slen < len) return BSTR_OK;
816 if (b0->data[i] != ((const unsigned char *) blk)[i]) return BSTR_OK;
836 if (s[i] == '\0' || b->data[i] != (unsigned char) s[i]) return BSTR_OK;
860 return BSTR_OK;
886 return BSTR_OK;
891 if (b0->data[i] == (unsigned char) '\0') return BSTR_OK;
896 return BSTR_OK;
922 if (b0->data[i] == (unsigned char) '\0') return BSTR_OK;
926 if (n == m || b0->slen == b1->slen) return BSTR_OK;
982 return BSTR_OK;
1007 return BSTR_OK;
1169 if (b1->data == b2->data && pos == 0) return BSTR_OK;
1212 if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return BSTR_OK;
1299 return BSTR_OK;
1416 if (balloc (b0, d + 1) != BSTR_OK) {
1441 return BSTR_OK;
1471 if (balloc (b1, l + 1) != BSTR_OK) {
1479 if (balloc (b1, d + 1) != BSTR_OK) {
1489 return BSTR_OK;
1525 if (balloc (b1, b1->slen + aux->slen - len) != BSTR_OK) {
1536 return BSTR_OK;
1560 if (pos > b->slen - find->slen) return BSTR_OK;
1588 return BSTR_OK;
1614 return BSTR_OK;
1649 if (BSTR_OK == (ret = balloc (b, b->slen + acc + 1))) {
1715 if (balloc (b, l + 1) != BSTR_OK) return BSTR_ERR;
1720 if (balloc (b, d + 1) != BSTR_OK) return BSTR_ERR;
1729 return BSTR_OK;
1737 * if b is NULL or of length 0, otherwise BSTR_OK is returned.
1743 if (d <= 0 || len < 0 || balloc (b, len + 1) != BSTR_OK) return BSTR_ERR;
1750 return BSTR_OK;
1769 if (BSTR_OK != balloc (b, n + 1)) return BSTR_ERR;
1777 return BSTR_OK;
1820 if (balloc (b, d + 2) != BSTR_OK) return BSTR_ERR;
1858 if (balloc (b, d + 2) != BSTR_OK) return BSTR_ERR;
1972 if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR;
1983 if (BSTR_OK == ret) bdelete (s->buff, 0, i + 1);
1984 return BSTR_OK;
1991 if (BSTR_OK != bconcat (r, &x)) return BSTR_ERR;
1996 if (BSTR_OK != balloc (r, r->slen + s->maxBuffSz + 1)) return BSTR_ERR;
2018 return BSTR_OK;
2041 if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR;
2052 if (BSTR_OK == ret) bdelete (s->buff, 0, i + 1);
2053 return BSTR_OK;
2060 if (BSTR_OK != bconcat (r, &x)) return BSTR_ERR;
2065 if (BSTR_OK != balloc (r, r->slen + s->maxBuffSz + 1)) return BSTR_ERR;
2088 return BSTR_OK;
2128 if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR;
2137 if (BSTR_OK == ret) bdelete (s->buff, 0, x.slen);
2142 if (BSTR_OK != bconcat (r, &x)) break;
2166 if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR;
2183 if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR;
2199 if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR;
2376 return BSTR_OK;
2438 return BSTR_OK;
2451 if (sl->mlen >= msz) return BSTR_OK;
2464 return BSTR_OK;
2477 if (sl->mlen == msz) return BSTR_OK;
2484 return BSTR_OK;
2517 return BSTR_OK;
2561 return BSTR_OK;
2591 return BSTR_OK;
2605 return BSTR_OK;
2633 return BSTR_OK;
2801 if (BSTR_OK != balloc (buff, n + 2)) {
2849 if (BSTR_OK != balloc (buff, n + 2)) {
2896 if (BSTR_OK != balloc (buff, n + 2)) {
2917 * BSTR_OK is returned when the output is successfully generated and
2932 if (BSTR_OK != balloc (b, n + 2)) return BSTR_ERR;
2940 return BSTR_OK;