blob: 221ebd290400ccf27d436a0561140af6e377ac23 [file] [log] [blame]
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +05301/****************************************************************************
micky3879b9f5e72025-07-08 18:04:53 -04002 * Copyright 2020-2021,2023 Thomas E. Dickey *
3 * Copyright 1998-2016,2017 Free Software Foundation, Inc. *
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +05304 * *
5 * Permission is hereby granted, free of charge, to any person obtaining a *
6 * copy of this software and associated documentation files (the *
7 * "Software"), to deal in the Software without restriction, including *
8 * without limitation the rights to use, copy, modify, merge, publish, *
9 * distribute, distribute with modifications, sublicense, and/or sell *
10 * copies of the Software, and to permit persons to whom the Software is *
11 * furnished to do so, subject to the following conditions: *
12 * *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
15 * *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * *
24 * Except as contained in this notice, the name(s) of the above copyright *
25 * holders shall not be used in advertising or otherwise to promote the *
26 * sale, use or other dealings in this Software without prior written *
27 * authorization. *
28 ****************************************************************************/
29
30/****************************************************************************
31 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
32 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
33 * and: Thomas E. Dickey 1996-on *
34 ****************************************************************************/
35
36/*
37** lib_instr.c
38**
39** The routine winnstr().
40**
41*/
42
43#include <curses.priv.h>
44
micky3879b9f5e72025-07-08 18:04:53 -040045MODULE_ID("$Id: lib_instr.c,v 1.26 2023/06/03 12:37:04 tom Exp $")
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053046
47NCURSES_EXPORT(int)
48winnstr(WINDOW *win, char *str, int n)
49{
micky3879b9f5e72025-07-08 18:04:53 -040050 int i = 0;
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053051
Steve Kondikae271bc2015-11-15 02:50:53 +010052 T((T_CALLED("winnstr(%p,%p,%d)"), (void *) win, str, n));
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053053
micky3879b9f5e72025-07-08 18:04:53 -040054 if (!win || !str) {
55 i = ERR;
56 } else {
57 int row = win->_cury;
58 int col = win->_curx;
59 NCURSES_CH_T *text = win->_line[row].text;
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053060
61 if (n < 0)
micky3879b9f5e72025-07-08 18:04:53 -040062 n = win->_maxx - col + 1;
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053063
64 for (; i < n;) {
65#if USE_WIDEC_SUPPORT
micky3879b9f5e72025-07-08 18:04:53 -040066 cchar_t *cell = &(text[col]);
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053067 attr_t attrs;
Steve Kondikae271bc2015-11-15 02:50:53 +010068 NCURSES_PAIRS_T pair;
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053069 char *tmp;
70
71 if (!isWidecExt(*cell)) {
micky3879b9f5e72025-07-08 18:04:53 -040072 wchar_t *wch;
73 int n2;
74
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053075 n2 = getcchar(cell, 0, 0, 0, 0);
76 if (n2 > 0
77 && (wch = typeCalloc(wchar_t, (unsigned) n2 + 1)) != 0) {
micky3879b9f5e72025-07-08 18:04:53 -040078 bool done = FALSE;
79
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053080 if (getcchar(cell, wch, &attrs, &pair, 0) == OK) {
micky3879b9f5e72025-07-08 18:04:53 -040081 mbstate_t state;
82 size_t n3;
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +053083
84 init_mb(state);
Steve Kondikae271bc2015-11-15 02:50:53 +010085 n3 = wcstombs(0, wch, (size_t) 0);
micky3879b9f5e72025-07-08 18:04:53 -040086 if (!isEILSEQ(n3) && (n3 != 0) && (n3 <= MB_LEN_MAX)) {
Steve Kondikae271bc2015-11-15 02:50:53 +010087 size_t need = n3 + 10 + (size_t) i;
88 int have = (int) n3 + i;
89
90 /* check for loop-done as well as overflow */
91 if (have > n || (int) need <= 0) {
92 done = TRUE;
93 } else if ((tmp = typeCalloc(char, need)) == 0) {
94 done = TRUE;
95 } else {
micky3879b9f5e72025-07-08 18:04:53 -040096 size_t i3;
97
Steve Kondikae271bc2015-11-15 02:50:53 +010098 init_mb(state);
99 wcstombs(tmp, wch, n3);
100 for (i3 = 0; i3 < n3; ++i3)
101 str[i++] = tmp[i3];
102 free(tmp);
103 }
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +0530104 }
105 }
106 free(wch);
107 if (done)
108 break;
109 }
110 }
111#else
micky3879b9f5e72025-07-08 18:04:53 -0400112 str[i++] = (char) CharOf(text[col]);
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +0530113#endif
114 if (++col > win->_maxx) {
115 break;
116 }
117 }
micky3879b9f5e72025-07-08 18:04:53 -0400118 str[i] = '\0'; /* SVr4 does not seem to count the null */
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +0530119 }
Amit Daniel Kachhape6a01f52011-07-20 11:45:59 +0530120 T(("winnstr returns %s", _nc_visbuf(str)));
121 returnCode(i);
122}