1/*   $NetBSD: cchar.c,v 1.4 2010/02/23 19:48:26 drochner Exp $ */
2
3/*
4 * Copyright (c) 2005 The NetBSD Foundation Inc.
5 * All rights reserved.
6 *
7 * This code is derived from code donated to the NetBSD Foundation
8 * by Ruibiao Qiu <ruibiao@arl.wustl.edu,ruibiao@gmail.com>.
9 *
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 *	notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 *	notice, this list of conditions and the following disclaimer in the
18 *	documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the NetBSD Foundation nor the names of its
20 *	contributors may be used to endorse or promote products derived
21 *	from this software without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND
24 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
25 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
26 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37#include <sys/cdefs.h>
38#ifndef lint
39__RCSID("$NetBSD: cchar.c,v 1.4 2010/02/23 19:48:26 drochner Exp $");
40#endif						  /* not lint */
41
42#include <string.h>
43
44#include "curses.h"
45#include "curses_private.h"
46
47/*
48 * getcchar --
49 *	get a wide-character string and rendition from a cchar_t
50 */
51int
52getcchar(const cchar_t *wcval, wchar_t *wch, attr_t *attrs,
53					 short *color_pair, void *opts)
54{
55#ifndef HAVE_WCHAR
56	return ERR;
57#else
58	wchar_t *wp;
59	size_t len;
60
61	if ( opts )
62		return ERR;
63
64	len = (wp = wmemchr(wcval->vals, L'\0', CCHARW_MAX))
65		? wp - wcval->vals : CCHARW_MAX;
66
67	if (wch == NULL)
68		return (int) len;
69	if (attrs == 0 || color_pair == 0)
70		return ERR;
71	if (len > 0) {
72		*attrs = wcval->attributes;
73		*color_pair = COLOR_PAIR( wcval -> attributes );
74		wmemcpy(wch, wcval->vals, (unsigned) len);
75		wch[len] = L'\0';
76	}
77	return OK;
78#endif /* HAVE_WCHAR */
79}
80
81/*
82 * setcchar --
83 *	set cchar_t from a wide-character string and rendition
84 */
85int
86setcchar(cchar_t *wcval, const wchar_t *wch, const attr_t attrs,
87					 short color_pair, const void *opts)
88{
89#ifndef HAVE_WCHAR
90	return ERR;
91#else
92	int i;
93	size_t len;
94
95	if (opts || (len = wcslen(wch)) > CCHARW_MAX
96		|| (len > 1 && wcwidth(wch[0]) < 0)) {
97		return ERR;
98	}
99
100	/*
101	 * If we have a following spacing-character, stop at that point.  We
102	 * are only interested in adding non-spacing characters.
103	 */
104	for (i = 1; i < len; ++i) {
105		if (wcwidth(wch[i]) != 0) {
106			len = i;
107			break;
108		}
109	}
110
111	memset(wcval, 0, sizeof(*wcval));
112	if (len != 0) {
113		wcval -> attributes = attrs | color_pair;
114		wcval -> elements = 1;
115		memcpy(&wcval->vals, wch, len * sizeof(wchar_t));
116	}
117
118	return OK;
119#endif /* HAVE_WCHAR */
120}
121
122void
123__cursesi_chtype_to_cchar(chtype in, cchar_t *out)
124{
125	unsigned int idx;
126
127	if (in & __ACS_IS_WACS) {
128		idx = in & __CHARTEXT;
129		if (idx < NUM_ACS) {
130			memcpy(out, &_wacs_char[idx], sizeof(cchar_t));
131			out->attributes |= in & __ATTRIBUTES;
132			return;
133		}
134	}
135	out->vals[0] = in & __CHARTEXT;
136	out->attributes = in & __ATTRIBUTES;
137	out->elements = 1;
138}
139