1 /*
2  * Copyright (c) 2021 Omar Polo <op@omarpolo.com>
3  *
4  * Permission to use, copy, modify, and distribute this software for any
5  * purpose with or without fee is hereby granted, provided that the above
6  * copyright notice and this permission notice appear in all copies.
7  *
8  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
15  */
16 
17 #include "compat.h"
18 
19 #include <ctype.h>
20 #include <errno.h>
21 #include <fcntl.h>
22 #include <stdlib.h>
23 #include <unistd.h>
24 
25 #include "telescope.h"
26 
27 static void	 imsg_event_add(struct imsgev *);
28 
29 int
30 mark_nonblock(int fd)
31 {
32 	int flags;
33 
34 	if ((flags = fcntl(fd, F_GETFL)) == -1)
35                 return 0;
36 	if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1)
37                 return 0;
38 	return 1;
39 }
40 
41 int
42 has_prefix(const char *str, const char *prfx)
43 {
44 	size_t i;
45 
46 	for (i = 0; str[i] != '\0' && prfx[i] != '\0'; ++i)
47 		if (str[i] != prfx[i])
48 			return 0;
49 	return prfx[i] == '\0';
50 }
51 
52 int
53 unicode_isspace(uint32_t cp)
54 {
55 	if (cp < INT8_MAX)
56 		return isspace(cp);
57 	return 0;
58 }
59 
60 int
61 unicode_isgraph(uint32_t cp)
62 {
63 	if (cp < INT8_MAX)
64 		return isgraph(cp);
65 	return 1;
66 }
67 
68 static void
69 imsg_event_add(struct imsgev *iev)
70 {
71 	iev->events = EV_READ;
72 	if (iev->ibuf.w.queued)
73 		iev->events |= EV_WRITE;
74 
75 	event_del(&iev->ev);
76 	event_set(&iev->ev, iev->ibuf.fd, iev->events, iev->handler, iev);
77 	event_add(&iev->ev, NULL);
78 }
79 
80 int
81 dispatch_imsg(struct imsgev *iev, short event, imsg_handlerfn **handlers,
82     size_t size)
83 {
84 	struct imsgbuf	*ibuf;
85 	struct imsg	 imsg;
86 	size_t		 datalen, i;
87 	ssize_t		 n;
88 
89 	ibuf = &iev->ibuf;
90 
91 	if (event & EV_READ) {
92 		if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
93 			err(1, "imsg_read error");
94 		if (n == 0)
95 			return -1;
96 	}
97 	if (event & EV_WRITE) {
98 		if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
99 			err(1, "msgbuf_write");
100 		if (n == 0)
101 			return -1;
102 	}
103 
104 	for (;;) {
105 		if ((n = imsg_get(ibuf, &imsg)) == -1)
106 			_exit(1);
107 		if (n == 0)
108 			break;
109 		datalen = imsg.hdr.len - IMSG_HEADER_SIZE;
110 		i = imsg.hdr.type;
111 		if (i > (size / sizeof(imsg_handlerfn*)) || handlers[i] == NULL)
112 			abort();
113 		handlers[i](&imsg, datalen);
114 		imsg_free(&imsg);
115 	}
116 
117 	imsg_event_add(iev);
118 	return 0;
119 }
120 
121 int
122 imsg_compose_event(struct imsgev *iev, uint16_t type, uint32_t peerid,
123     pid_t pid, int fd, const void *data, uint16_t datalen)
124 {
125 	int	ret;
126 
127 	if ((ret = imsg_compose(&iev->ibuf, type, peerid, pid, fd, data,
128 	    datalen) != -1))
129 		imsg_event_add(iev);
130 
131 	return ret;
132 }