Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 1 | /**************************************************************************** |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 2 | * Copyright (c) 1998-2013,2014 Free Software Foundation, Inc. * |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 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: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 * |
| 31 | * and: Eric S. Raymond <esr@snark.thyrsus.com> * |
| 32 | * and: Thomas E. Dickey 1996-on * |
| 33 | ****************************************************************************/ |
| 34 | |
| 35 | /* |
| 36 | ** lib_instr.c |
| 37 | ** |
| 38 | ** The routine winnstr(). |
| 39 | ** |
| 40 | */ |
| 41 | |
| 42 | #include <curses.priv.h> |
| 43 | |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 44 | MODULE_ID("$Id: lib_instr.c,v 1.21 2014/02/01 22:09:27 tom Exp $") |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 45 | |
| 46 | NCURSES_EXPORT(int) |
| 47 | winnstr(WINDOW *win, char *str, int n) |
| 48 | { |
| 49 | int i = 0, row, col; |
| 50 | |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 51 | T((T_CALLED("winnstr(%p,%p,%d)"), (void *) win, str, n)); |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 52 | |
| 53 | if (!str) |
| 54 | returnCode(0); |
| 55 | |
| 56 | if (win) { |
| 57 | getyx(win, row, col); |
| 58 | |
| 59 | if (n < 0) |
| 60 | n = win->_maxx - win->_curx + 1; |
| 61 | |
| 62 | for (; i < n;) { |
| 63 | #if USE_WIDEC_SUPPORT |
| 64 | cchar_t *cell = &(win->_line[row].text[col]); |
| 65 | wchar_t *wch; |
| 66 | attr_t attrs; |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 67 | NCURSES_PAIRS_T pair; |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 68 | int n2; |
| 69 | bool done = FALSE; |
| 70 | mbstate_t state; |
| 71 | size_t i3, n3; |
| 72 | char *tmp; |
| 73 | |
| 74 | if (!isWidecExt(*cell)) { |
| 75 | n2 = getcchar(cell, 0, 0, 0, 0); |
| 76 | if (n2 > 0 |
| 77 | && (wch = typeCalloc(wchar_t, (unsigned) n2 + 1)) != 0) { |
| 78 | if (getcchar(cell, wch, &attrs, &pair, 0) == OK) { |
| 79 | |
| 80 | init_mb(state); |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 81 | n3 = wcstombs(0, wch, (size_t) 0); |
| 82 | if (!isEILSEQ(n3) && (n3 != 0)) { |
| 83 | size_t need = n3 + 10 + (size_t) i; |
| 84 | int have = (int) n3 + i; |
| 85 | |
| 86 | /* check for loop-done as well as overflow */ |
| 87 | if (have > n || (int) need <= 0) { |
| 88 | done = TRUE; |
| 89 | } else if ((tmp = typeCalloc(char, need)) == 0) { |
| 90 | done = TRUE; |
| 91 | } else { |
| 92 | init_mb(state); |
| 93 | wcstombs(tmp, wch, n3); |
| 94 | for (i3 = 0; i3 < n3; ++i3) |
| 95 | str[i++] = tmp[i3]; |
| 96 | free(tmp); |
| 97 | } |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 98 | } |
| 99 | } |
| 100 | free(wch); |
| 101 | if (done) |
| 102 | break; |
| 103 | } |
| 104 | } |
| 105 | #else |
| 106 | str[i++] = (char) CharOf(win->_line[row].text[col]); |
| 107 | #endif |
| 108 | if (++col > win->_maxx) { |
| 109 | break; |
| 110 | } |
| 111 | } |
| 112 | } |
| 113 | str[i] = '\0'; /* SVr4 does not seem to count the null */ |
| 114 | T(("winnstr returns %s", _nc_visbuf(str))); |
| 115 | returnCode(i); |
| 116 | } |