Home | History | Annotate | Download | only in common

Lines Matching refs:buffer

146     len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
173 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
200 buffer(0), bufferCapacity(0),
224 buffer(0), bufferCapacity(0),
261 if (buffer) {
262 uprv_free(buffer);
1256 uprv_memcpy(buffer, list + 1, (len-1)*sizeof(UChar32));
1263 uprv_memcpy(buffer + 1, list, len*sizeof(UChar32));
1264 buffer[0] = UNICODESET_LOW;
1451 // Delete buffer first to defragment memory less.
1452 if (buffer != NULL) {
1453 uprv_free(buffer);
1454 buffer = NULL;
1592 if (buffer != NULL && newLen <= bufferCapacity)
1594 UChar32* temp = (UChar32*) uprv_realloc(buffer, sizeof(UChar32) * (newLen + GROW_EXTRA));
1600 buffer = temp;
1606 * Swap list and buffer.
1609 // swap list and buffer
1611 list = buffer;
1612 buffer = temp;
1661 buffer[k++] = a;
1664 buffer[k++] = b;
1671 buffer[k++] = UNICODESET_HIGH;
1704 // Back up over overlapping ranges in buffer[]
1705 if (k > 0 && a <= buffer[k-1]) {
1706 // Pick latter end value in buffer[] vs. list[]
1707 a = max(list[i], buffer[--k]);
1710 buffer[k++] = a;
1716 if (k > 0 && b <= buffer[k-1]) {
1717 b = max(other[j], buffer[--k]);
1719 buffer[k++] = b;
1728 if (k > 0 && a <= buffer[k-1]) {
1729 a = max(list[i], buffer[--k]);
1732 buffer[k++] = a;
1744 buffer[k++] = a;
1747 buffer[k++] = b;
1756 buffer[k++] = a; a = list[i++]; polarity ^= 1;
1770 buffer[k++] = b;
1787 buffer[k++] = UNICODESET_HIGH; // terminate
1824 buffer[k++] = a;
1833 buffer[k++] = a;
1837 buffer[k++] = b;
1842 buffer[k++] = a;
1854 buffer[k++] = b;
1870 buffer[k++] = a;
1884 buffer[k++] = UNICODESET_HIGH; // terminate
2093 // Delete buffer first to defragment memory less.
2094 if (buffer != NULL) {
2095 uprv_free(buffer);
2096 buffer = NULL;