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 "telescope.h"
18 
19 #include <ctype.h>
20 #include <errno.h>
21 #include <fcntl.h>
22 #include <stdlib.h>
23 #include <unistd.h>
24 
25 static void	 imsg_event_add(struct imsgev *);
26 
27 int
28 mark_nonblock(int fd)
29 {
30 	int flags;
31 
32 	if ((flags = fcntl(fd, F_GETFL)) == -1)
33                 return 0;
34 	if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1)
35                 return 0;
36 	return 1;
37 }
38 
39 int
40 has_prefix(const char *str, const char *prfx)
41 {
42 	size_t i;
43 
44 	for (i = 0; str[i] != '\0' && prfx[i] != '\0'; ++i)
45 		if (str[i] != prfx[i])
46 			return 0;
47 	return prfx[i] == '\0';
48 }
49 
50 int
51 unicode_isspace(uint32_t cp)
52 {
53 	if (cp < INT8_MAX)
54 		return isspace(cp);
55 	return 0;
56 }
57 
58 int
59 unicode_isgraph(uint32_t cp)
60 {
61 	if (cp < INT8_MAX)
62 		return isgraph(cp);
63 	return 1;
64 }
65 
66 static void
67 imsg_event_add(struct imsgev *iev)
68 {
69 	iev->events = EV_READ;
70 	if (iev->ibuf.w.queued)
71 		iev->events |= EV_WRITE;
72 
73 	event_del(&iev->ev);
74 	event_set(&iev->ev, iev->ibuf.fd, iev->events, iev->handler, iev);
75 	event_add(&iev->ev, NULL);
76 }
77 
78 void
79 dispatch_imsg(struct imsgev *iev, short event, imsg_handlerfn **handlers,
80     size_t size)
81 {
82 	struct imsgbuf	*ibuf;
83 	struct imsg	 imsg;
84 	size_t		 datalen, i;
85 	ssize_t		 n;
86 
87 	ibuf = &iev->ibuf;
88 
89 	if (event & EV_READ) {
90 		if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
91 			err(1, "imsg_read error");
92 		if (n == 0)
93 			err(1, "connection closed");
94 	}
95 	if (event & EV_WRITE) {
96 		if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
97 			err(1, "msgbuf_write");
98 		if (n == 0)
99 			err(1, "connection closed");
100 	}
101 
102 	for (;;) {
103 		if ((n = imsg_get(ibuf, &imsg)) == -1)
104 			_exit(1);
105 		if (n == 0)
106 			break;
107 		datalen = imsg.hdr.len - IMSG_HEADER_SIZE;
108 		i = imsg.hdr.type;
109 		if (i > (size / sizeof(imsg_handlerfn*)) || handlers[i] == NULL)
110 			abort();
111 		handlers[i](&imsg, datalen);
112 		imsg_free(&imsg);
113 	}
114 
115 	imsg_event_add(iev);
116 }
117 
118 int
119 imsg_compose_event(struct imsgev *iev, uint16_t type, uint32_t peerid,
120     pid_t pid, int fd, const void *data, uint16_t datalen)
121 {
122 	int	ret;
123 
124 	if ((ret = imsg_compose(&iev->ibuf, type, peerid, pid, fd, data,
125 	    datalen) != -1))
126 		imsg_event_add(iev);
127 
128 	return ret;
129 }