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 <string.h>
24 #include <unistd.h>
25 
26 #include "telescope.h"
27 #include "utils.h"
28 
29 static void	 imsg_event_add(struct imsgev *);
30 
31 int
32 mark_nonblock(int fd)
33 {
34 	int flags;
35 
36 	if ((flags = fcntl(fd, F_GETFL)) == -1)
37 		return 0;
38 	if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1)
39 		return 0;
40 	return 1;
41 }
42 
43 int
44 has_prefix(const char *str, const char *prfx)
45 {
46 	size_t i;
47 
48 	for (i = 0; str[i] != '\0' && prfx[i] != '\0'; ++i)
49 		if (str[i] != prfx[i])
50 			return 0;
51 	return prfx[i] == '\0';
52 }
53 
54 int
55 has_suffix(const char *str, const char *sufx)
56 {
57 	size_t l, s;
58 
59 	l = strlen(str);
60 	s = strlen(sufx);
61 
62 	if (l < s)
63 		return 0;
64 
65 	return !strcmp(str + (l - s), sufx);
66 }
67 
68 int
69 unicode_isspace(uint32_t cp)
70 {
71 	if (cp < INT8_MAX)
72 		return isspace(cp);
73 	return 0;
74 }
75 
76 int
77 unicode_isgraph(uint32_t cp)
78 {
79 	if (cp < INT8_MAX)
80 		return isgraph(cp);
81 	return 1;
82 }
83 
84 static void
85 imsg_event_add(struct imsgev *iev)
86 {
87 	iev->events = EV_READ;
88 	if (iev->ibuf.w.queued)
89 		iev->events |= EV_WRITE;
90 
91 	event_del(&iev->ev);
92 	event_set(&iev->ev, iev->ibuf.fd, iev->events, iev->handler, iev);
93 	event_add(&iev->ev, NULL);
94 }
95 
96 int
97 dispatch_imsg(struct imsgev *iev, short event, imsg_handlerfn **handlers,
98     size_t size)
99 {
100 	struct imsgbuf	*ibuf;
101 	struct imsg	 imsg;
102 	size_t		 datalen, i;
103 	ssize_t		 n;
104 
105 	ibuf = &iev->ibuf;
106 
107 	if (event & EV_READ) {
108 		if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
109 			err(1, "imsg_read error");
110 		if (n == 0)
111 			return -1;
112 	}
113 	if (event & EV_WRITE) {
114 		if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
115 			err(1, "msgbuf_write");
116 		if (n == 0)
117 			return -1;
118 	}
119 
120 	for (;;) {
121 		if ((n = imsg_get(ibuf, &imsg)) == -1)
122 			_exit(1);
123 		if (n == 0)
124 			break;
125 		datalen = imsg.hdr.len - IMSG_HEADER_SIZE;
126 		i = imsg.hdr.type;
127 		if (i > (size / sizeof(imsg_handlerfn*)) || handlers[i] == NULL)
128 			abort();
129 		handlers[i](&imsg, datalen);
130 		imsg_free(&imsg);
131 	}
132 
133 	imsg_event_add(iev);
134 	return 0;
135 }
136 
137 int
138 imsg_compose_event(struct imsgev *iev, uint16_t type, uint32_t peerid,
139     pid_t pid, int fd, const void *data, uint16_t datalen)
140 {
141 	int	ret;
142 
143 	if ((ret = imsg_compose(&iev->ibuf, type, peerid, pid, fd, data,
144 	    datalen) != -1))
145 		imsg_event_add(iev);
146 
147 	return ret;
148 }
149 
150 void *
151 hash_alloc(size_t len, void *d)
152 {
153 	if ((d = malloc(len)) == NULL)
154 		abort();
155 	return d;
156 }
157 
158 void *
159 hash_calloc(size_t nmemb, size_t size, void *d)
160 {
161 	if ((d = calloc(nmemb, size)) == NULL)
162 		abort();
163 	return d;
164 }
165 
166 void
167 hash_free(void *ptr, void *d)
168 {
169 	free(ptr);
170 }