Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 1 | /**************************************************************************** |
micky387 | 9b9f5e7 | 2025-07-08 18:04:53 -0400 | [diff] [blame] | 2 | * Copyright 2018-2022,2023 Thomas E. Dickey * |
| 3 | * Copyright 2004-2009,2016 Free Software Foundation, Inc. * |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 4 | * * |
| 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: Thomas E. Dickey * |
| 32 | ****************************************************************************/ |
| 33 | |
| 34 | /* |
| 35 | ** lib_insnstr.c |
| 36 | ** |
| 37 | ** The routine winsnstr(). |
| 38 | ** |
| 39 | */ |
| 40 | |
| 41 | #include <curses.priv.h> |
| 42 | #include <ctype.h> |
| 43 | |
micky387 | 9b9f5e7 | 2025-07-08 18:04:53 -0400 | [diff] [blame] | 44 | MODULE_ID("$Id: lib_insnstr.c,v 1.10 2023/11/21 21:58:03 tom Exp $") |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 45 | |
| 46 | NCURSES_EXPORT(int) |
| 47 | winsnstr(WINDOW *win, const char *s, int n) |
| 48 | { |
| 49 | int code = ERR; |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 50 | const unsigned char *str = (const unsigned char *) s; |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 51 | |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 52 | T((T_CALLED("winsnstr(%p,%s,%d)"), (void *) win, _nc_visbufn(s, n), n)); |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 53 | |
micky387 | 9b9f5e7 | 2025-07-08 18:04:53 -0400 | [diff] [blame] | 54 | if (win != 0 && str != 0 && n != 0) { |
Steve Kondik | ae271bc | 2015-11-15 02:50:53 +0100 | [diff] [blame] | 55 | SCREEN *sp = _nc_screen_of(win); |
micky387 | 9b9f5e7 | 2025-07-08 18:04:53 -0400 | [diff] [blame] | 56 | #if USE_WIDEC_SUPPORT |
| 57 | /* |
| 58 | * If the output contains "wide" (multibyte) characters, we will not |
| 59 | * really know the width of a character until we get the last byte |
| 60 | * of the character. Since the preceding byte(s) may use more columns |
| 61 | * on the screen than the final character, it is best to route the |
| 62 | * call to the wins_nwstr() function. |
| 63 | */ |
| 64 | if (sp->_screen_unicode) { |
| 65 | size_t nn = (n > 0) ? (size_t) n : strlen(s); |
| 66 | wchar_t *buffer = typeMalloc(wchar_t, nn + 1); |
| 67 | if (buffer != 0) { |
| 68 | mbstate_t state; |
| 69 | size_t n3; |
| 70 | init_mb(state); |
| 71 | n3 = mbstowcs(buffer, s, nn); |
| 72 | if (n3 != (size_t) (-1)) { |
| 73 | buffer[n3] = '\0'; |
| 74 | code = wins_nwstr(win, buffer, (int) n3); |
| 75 | } |
| 76 | free(buffer); |
| 77 | } |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 78 | } |
micky387 | 9b9f5e7 | 2025-07-08 18:04:53 -0400 | [diff] [blame] | 79 | if (code == ERR) |
| 80 | #endif |
| 81 | { |
| 82 | NCURSES_SIZE_T oy = win->_cury; |
| 83 | NCURSES_SIZE_T ox = win->_curx; |
| 84 | const unsigned char *cp; |
| 85 | |
| 86 | for (cp = str; (n < 0 || (cp - str) < n) && *cp; cp++) { |
| 87 | _nc_insert_ch(sp, win, (chtype) UChar(*cp)); |
| 88 | } |
| 89 | win->_curx = ox; |
| 90 | win->_cury = oy; |
| 91 | _nc_synchook(win); |
| 92 | code = OK; |
| 93 | } |
Amit Daniel Kachhap | e6a01f5 | 2011-07-20 11:45:59 +0530 | [diff] [blame] | 94 | } |
| 95 | returnCode(code); |
| 96 | } |