| 86 | }; |
| 87 | |
| 88 | static void test_buffer_gets(void) |
| 89 | { |
| 90 | ACL_VSTRING *buf = acl_vstring_alloc(256); |
| 91 | const ACL_VSTRING *pbuf; |
| 92 | const char *src; |
| 93 | size_t i, n; |
| 94 | unsigned char ch = (unsigned char) -1; |
| 95 | |
| 96 | for (i = 0; i < sizeof(string_tab) / sizeof(char*); i++) { |
| 97 | printf("%s", string_tab[i]); |
| 98 | } |
| 99 | |
| 100 | printf("------------------------------------------------------------\r\n"); |
| 101 | |
| 102 | for (i = 0; i < sizeof(string_tab) / sizeof(char*); i++) { |
| 103 | src = string_tab[i]; |
| 104 | n = strlen(src); |
| 105 | while (1) { |
| 106 | const char *psrc_saved = src; |
| 107 | pbuf = acl_buffer_gets_nonl(buf, &src, n); |
| 108 | if (pbuf) { |
| 109 | printf("%s\n", STR(pbuf)); |
| 110 | ACL_VSTRING_RESET(buf); |
| 111 | n -= src - psrc_saved; |
| 112 | if (n == 0) |
| 113 | break; |
| 114 | } else |
| 115 | break; |
| 116 | } |
| 117 | } |
| 118 | |
| 119 | printf("------------------------------------------------------------\r\n"); |
| 120 | |
| 121 | for (i = 0; i < sizeof(string_tab) / sizeof(char*); i++) { |
| 122 | src = string_tab[i]; |
| 123 | n = strlen(src); |
| 124 | while (1) { |
| 125 | const char *psrc_saved = src; |
| 126 | pbuf = acl_buffer_gets(buf, &src, n); |
| 127 | if (pbuf) { |
| 128 | printf("%s", STR(pbuf)); |
| 129 | ACL_VSTRING_RESET(buf); |
| 130 | n -= src - psrc_saved; |
| 131 | if (n == 0) |
| 132 | break; |
| 133 | } else |
| 134 | break; |
| 135 | } |
| 136 | } |
| 137 | |
| 138 | acl_vstring_free(buf); |
| 139 | printf(">>>>>>>>>max ch: %d\n", ch); |
| 140 | } |
| 141 | |
| 142 | static void test_buffer_space() |
| 143 | { |
no test coverage detected
searching dependent graphs…