| Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 1 | /**************************************************************************** |
| 2 | * Copyright (c) 2002,2004 Free Software Foundation, Inc. * |
| 3 | * * |
| 4 | * Permission is hereby granted, free of charge, to any person obtaining a * |
| 5 | * copy of this software and associated documentation files (the * |
| 6 | * "Software"), to deal in the Software without restriction, including * |
| 7 | * without limitation the rights to use, copy, modify, merge, publish, * |
| 8 | * distribute, distribute with modifications, sublicense, and/or sell * |
| 9 | * copies of the Software, and to permit persons to whom the Software is * |
| 10 | * furnished to do so, subject to the following conditions: * |
| 11 | * * |
| 12 | * The above copyright notice and this permission notice shall be included * |
| 13 | * in all copies or substantial portions of the Software. * |
| 14 | * * |
| 15 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * |
| 16 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * |
| 17 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * |
| 18 | * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, * |
| 19 | * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR * |
| 20 | * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR * |
| 21 | * THE USE OR OTHER DEALINGS IN THE SOFTWARE. * |
| 22 | * * |
| 23 | * Except as contained in this notice, the name(s) of the above copyright * |
| 24 | * holders shall not be used in advertising or otherwise to promote the * |
| 25 | * sale, use or other dealings in this Software without prior written * |
| 26 | * authorization. * |
| 27 | ****************************************************************************/ |
| 28 | |
| 29 | /**************************************************************************** |
| 30 | * Author: Thomas Dickey * |
| 31 | ****************************************************************************/ |
| 32 | |
| 33 | /* |
| 34 | ** lib_inwstr.c |
| 35 | ** |
| 36 | ** The routines winnwstr() and winwstr(). |
| 37 | ** |
| 38 | */ |
| 39 | |
| 40 | #include <curses.priv.h> |
| 41 | |
| 42 | MODULE_ID("$Id: lib_inwstr.c,v 1.4 2004/10/23 20:41:28 tom Exp $") |
| 43 | |
| 44 | NCURSES_EXPORT(int) |
| 45 | winnwstr(WINDOW *win, wchar_t *wstr, int n) |
| 46 | { |
| 47 | int row, col, inx; |
| 48 | int count = 0; |
| 49 | int last = 0; |
| 50 | cchar_t *text; |
| 51 | wchar_t wch; |
| 52 | |
| 53 | T((T_CALLED("winnwstr(%p,%p,%d)"), win, wstr, n)); |
| 54 | if (wstr != 0) { |
| 55 | if (win) { |
| 56 | getyx(win, row, col); |
| 57 | |
| 58 | text = win->_line[row].text; |
| 59 | while (count < n && count != ERR) { |
| 60 | if (!isWidecExt(text[col])) { |
| 61 | for (inx = 0; (inx < CCHARW_MAX) |
| 62 | && ((wch = text[col].chars[inx]) != 0); |
| 63 | ++inx) { |
| 64 | if (count + 1 > n) { |
| 65 | if ((count = last) == 0) { |
| 66 | count = ERR; /* error if we store nothing */ |
| 67 | } |
| 68 | break; |
| 69 | } |
| 70 | wstr[count++] = wch; |
| 71 | } |
| 72 | } |
| 73 | last = count; |
| 74 | if (++col > win->_maxx) { |
| 75 | break; |
| 76 | } |
| 77 | } |
| 78 | } |
| 79 | if (count > 0) { |
| 80 | wstr[count] = '\0'; |
| 81 | T(("winnwstr returns %s", _nc_viswbuf(wstr))); |
| 82 | } |
| 83 | } |
| 84 | returnCode(count); |
| 85 | } |
| 86 | |
| 87 | /* |
| 88 | * X/Open says winwstr() returns OK if not ERR. If that is not a blunder, it |
| 89 | * must have a null termination on the string (see above). Unlike winnstr(), |
| 90 | * it does not define what happens for a negative count with winnwstr(). |
| 91 | */ |
| 92 | NCURSES_EXPORT(int) |
| 93 | winwstr(WINDOW *win, wchar_t *wstr) |
| 94 | { |
| 95 | int result = OK; |
| 96 | T((T_CALLED("winwstr(%p,%p)"), win, wstr)); |
| 97 | if (winnwstr(win, wstr, CCHARW_MAX * (win->_maxx - win->_curx + 1)) == ERR) |
| 98 | result = ERR; |
| 99 | returnCode(result); |
| 100 | } |