xref: /qemu/net/can/can_core.c (revision 06b40d250ecfa1633209c2e431a7a38acfd03a98)
1d18957dbSPavel Pisa /*
2d18957dbSPavel Pisa  * CAN common CAN bus emulation support
3d18957dbSPavel Pisa  *
4d18957dbSPavel Pisa  * Copyright (c) 2013-2014 Jin Yang
5d18957dbSPavel Pisa  * Copyright (c) 2014-2018 Pavel Pisa
6d18957dbSPavel Pisa  *
7d18957dbSPavel Pisa  * Initial development supported by Google GSoC 2013 from RTEMS project slot
8d18957dbSPavel Pisa  *
9d18957dbSPavel Pisa  * Permission is hereby granted, free of charge, to any person obtaining a copy
10d18957dbSPavel Pisa  * of this software and associated documentation files (the "Software"), to deal
11d18957dbSPavel Pisa  * in the Software without restriction, including without limitation the rights
12d18957dbSPavel Pisa  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13d18957dbSPavel Pisa  * copies of the Software, and to permit persons to whom the Software is
14d18957dbSPavel Pisa  * furnished to do so, subject to the following conditions:
15d18957dbSPavel Pisa  *
16d18957dbSPavel Pisa  * The above copyright notice and this permission notice shall be included in
17d18957dbSPavel Pisa  * all copies or substantial portions of the Software.
18d18957dbSPavel Pisa  *
19d18957dbSPavel Pisa  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20d18957dbSPavel Pisa  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21d18957dbSPavel Pisa  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
22d18957dbSPavel Pisa  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23d18957dbSPavel Pisa  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24d18957dbSPavel Pisa  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25d18957dbSPavel Pisa  * THE SOFTWARE.
26d18957dbSPavel Pisa  */
270b8fa32fSMarkus Armbruster 
28d18957dbSPavel Pisa #include "qemu/osdep.h"
29d18957dbSPavel Pisa #include "chardev/char.h"
300b8fa32fSMarkus Armbruster #include "qemu/module.h"
31d18957dbSPavel Pisa #include "qemu/sockets.h"
32d18957dbSPavel Pisa #include "qapi/error.h"
33d18957dbSPavel Pisa #include "net/can_emu.h"
34d18957dbSPavel Pisa #include "qom/object_interfaces.h"
35d18957dbSPavel Pisa 
36ad0c6740SJan Charvat /* CAN DLC to real data length conversion helpers */
37ad0c6740SJan Charvat 
38ad0c6740SJan Charvat static const uint8_t dlc2len[] = {
39ad0c6740SJan Charvat     0, 1, 2, 3, 4, 5, 6, 7,
40ad0c6740SJan Charvat     8, 12, 16, 20, 24, 32, 48, 64
41ad0c6740SJan Charvat };
42ad0c6740SJan Charvat 
43ad0c6740SJan Charvat /* get data length from can_dlc with sanitized can_dlc */
can_dlc2len(uint8_t can_dlc)44ad0c6740SJan Charvat uint8_t can_dlc2len(uint8_t can_dlc)
45ad0c6740SJan Charvat {
46ad0c6740SJan Charvat     return dlc2len[can_dlc & 0x0F];
47ad0c6740SJan Charvat }
48ad0c6740SJan Charvat 
49ad0c6740SJan Charvat static const uint8_t len2dlc[] = {
50ad0c6740SJan Charvat     0, 1, 2, 3, 4, 5, 6, 7, 8,                              /* 0 - 8 */
51ad0c6740SJan Charvat     9, 9, 9, 9,                                             /* 9 - 12 */
52ad0c6740SJan Charvat     10, 10, 10, 10,                                         /* 13 - 16 */
53ad0c6740SJan Charvat     11, 11, 11, 11,                                         /* 17 - 20 */
54ad0c6740SJan Charvat     12, 12, 12, 12,                                         /* 21 - 24 */
55ad0c6740SJan Charvat     13, 13, 13, 13, 13, 13, 13, 13,                         /* 25 - 32 */
56ad0c6740SJan Charvat     14, 14, 14, 14, 14, 14, 14, 14,                         /* 33 - 40 */
57ad0c6740SJan Charvat     14, 14, 14, 14, 14, 14, 14, 14,                         /* 41 - 48 */
58ad0c6740SJan Charvat     15, 15, 15, 15, 15, 15, 15, 15,                         /* 49 - 56 */
59ad0c6740SJan Charvat     15, 15, 15, 15, 15, 15, 15, 15                          /* 57 - 64 */
60ad0c6740SJan Charvat };
61ad0c6740SJan Charvat 
62ad0c6740SJan Charvat /* map the sanitized data length to an appropriate data length code */
can_len2dlc(uint8_t len)63ad0c6740SJan Charvat uint8_t can_len2dlc(uint8_t len)
64ad0c6740SJan Charvat {
65ad0c6740SJan Charvat     if (unlikely(len > 64)) {
66ad0c6740SJan Charvat         return 0xF;
67ad0c6740SJan Charvat     }
68ad0c6740SJan Charvat 
69ad0c6740SJan Charvat     return len2dlc[len];
70ad0c6740SJan Charvat }
71ad0c6740SJan Charvat 
72d18957dbSPavel Pisa struct CanBusState {
73d18957dbSPavel Pisa     Object object;
74d18957dbSPavel Pisa 
75d18957dbSPavel Pisa     QTAILQ_HEAD(, CanBusClientState) clients;
76d18957dbSPavel Pisa };
77d18957dbSPavel Pisa 
can_bus_instance_init(Object * object)78d18957dbSPavel Pisa static void can_bus_instance_init(Object *object)
79d18957dbSPavel Pisa {
80d18957dbSPavel Pisa     CanBusState *bus = (CanBusState *)object;
81d18957dbSPavel Pisa 
82d18957dbSPavel Pisa     QTAILQ_INIT(&bus->clients);
83d18957dbSPavel Pisa }
84d18957dbSPavel Pisa 
can_bus_insert_client(CanBusState * bus,CanBusClientState * client)85d18957dbSPavel Pisa int can_bus_insert_client(CanBusState *bus, CanBusClientState *client)
86d18957dbSPavel Pisa {
87d18957dbSPavel Pisa     client->bus = bus;
88d18957dbSPavel Pisa     QTAILQ_INSERT_TAIL(&bus->clients, client, next);
89d18957dbSPavel Pisa     return 0;
90d18957dbSPavel Pisa }
91d18957dbSPavel Pisa 
can_bus_remove_client(CanBusClientState * client)92d18957dbSPavel Pisa int can_bus_remove_client(CanBusClientState *client)
93d18957dbSPavel Pisa {
94d18957dbSPavel Pisa     CanBusState *bus = client->bus;
95d18957dbSPavel Pisa     if (bus == NULL) {
96d18957dbSPavel Pisa         return 0;
97d18957dbSPavel Pisa     }
98d18957dbSPavel Pisa 
99d18957dbSPavel Pisa     QTAILQ_REMOVE(&bus->clients, client, next);
100d18957dbSPavel Pisa     client->bus = NULL;
101d18957dbSPavel Pisa     return 1;
102d18957dbSPavel Pisa }
103d18957dbSPavel Pisa 
can_bus_client_send(CanBusClientState * client,const struct qemu_can_frame * frames,size_t frames_cnt)104d18957dbSPavel Pisa ssize_t can_bus_client_send(CanBusClientState *client,
105d18957dbSPavel Pisa              const struct qemu_can_frame *frames, size_t frames_cnt)
106d18957dbSPavel Pisa {
107d18957dbSPavel Pisa     int ret = 0;
108d18957dbSPavel Pisa     CanBusState *bus = client->bus;
109d18957dbSPavel Pisa     CanBusClientState *peer;
110d18957dbSPavel Pisa     if (bus == NULL) {
111d18957dbSPavel Pisa         return -1;
112d18957dbSPavel Pisa     }
113d18957dbSPavel Pisa 
114d18957dbSPavel Pisa     QTAILQ_FOREACH(peer, &bus->clients, next) {
115d18957dbSPavel Pisa         if (peer->info->can_receive(peer)) {
116d18957dbSPavel Pisa             if (peer == client) {
117d18957dbSPavel Pisa                 /* No loopback support for now */
118d18957dbSPavel Pisa                 continue;
119d18957dbSPavel Pisa             }
120d18957dbSPavel Pisa             if (peer->info->receive(peer, frames, frames_cnt) > 0) {
121d18957dbSPavel Pisa                 ret = 1;
122d18957dbSPavel Pisa             }
123d18957dbSPavel Pisa         }
124d18957dbSPavel Pisa     }
125d18957dbSPavel Pisa 
126d18957dbSPavel Pisa     return ret;
127d18957dbSPavel Pisa }
128d18957dbSPavel Pisa 
can_bus_filter_match(struct qemu_can_filter * filter,qemu_canid_t can_id)129d18957dbSPavel Pisa int can_bus_filter_match(struct qemu_can_filter *filter, qemu_canid_t can_id)
130d18957dbSPavel Pisa {
131d18957dbSPavel Pisa     int m;
132d18957dbSPavel Pisa     if (((can_id | filter->can_mask) & QEMU_CAN_ERR_FLAG)) {
133d18957dbSPavel Pisa         return (filter->can_mask & QEMU_CAN_ERR_FLAG) != 0;
134d18957dbSPavel Pisa     }
135d18957dbSPavel Pisa     m = (can_id & filter->can_mask) == (filter->can_id & filter->can_mask);
136d18957dbSPavel Pisa     return filter->can_id & QEMU_CAN_INV_FILTER ? !m : m;
137d18957dbSPavel Pisa }
138d18957dbSPavel Pisa 
can_bus_client_set_filters(CanBusClientState * client,const struct qemu_can_filter * filters,size_t filters_cnt)139d18957dbSPavel Pisa int can_bus_client_set_filters(CanBusClientState *client,
140d18957dbSPavel Pisa              const struct qemu_can_filter *filters, size_t filters_cnt)
141d18957dbSPavel Pisa {
142d18957dbSPavel Pisa     return 0;
143d18957dbSPavel Pisa }
144d18957dbSPavel Pisa 
145d18957dbSPavel Pisa 
can_bus_can_be_deleted(UserCreatable * uc)146d18957dbSPavel Pisa static bool can_bus_can_be_deleted(UserCreatable *uc)
147d18957dbSPavel Pisa {
148d18957dbSPavel Pisa     return false;
149d18957dbSPavel Pisa }
150d18957dbSPavel Pisa 
can_bus_class_init(ObjectClass * klass,const void * class_data G_GNUC_UNUSED)151d18957dbSPavel Pisa static void can_bus_class_init(ObjectClass *klass,
15212d1a768SPhilippe Mathieu-Daudé                                const void *class_data G_GNUC_UNUSED)
153d18957dbSPavel Pisa {
154d18957dbSPavel Pisa     UserCreatableClass *uc_klass = USER_CREATABLE_CLASS(klass);
155d18957dbSPavel Pisa 
156d18957dbSPavel Pisa     uc_klass->can_be_deleted = can_bus_can_be_deleted;
157d18957dbSPavel Pisa }
158d18957dbSPavel Pisa 
159d18957dbSPavel Pisa static const TypeInfo can_bus_info = {
160d18957dbSPavel Pisa     .parent = TYPE_OBJECT,
161d18957dbSPavel Pisa     .name = TYPE_CAN_BUS,
162d18957dbSPavel Pisa     .instance_size = sizeof(CanBusState),
163d18957dbSPavel Pisa     .instance_init = can_bus_instance_init,
164d18957dbSPavel Pisa     .class_init = can_bus_class_init,
165*2cd09e47SPhilippe Mathieu-Daudé     .interfaces = (const InterfaceInfo[]) {
166d18957dbSPavel Pisa         { TYPE_USER_CREATABLE },
167d18957dbSPavel Pisa         { }
168d18957dbSPavel Pisa     }
169d18957dbSPavel Pisa };
170d18957dbSPavel Pisa 
can_bus_register_types(void)171d18957dbSPavel Pisa static void can_bus_register_types(void)
172d18957dbSPavel Pisa {
173d18957dbSPavel Pisa     type_register_static(&can_bus_info);
174d18957dbSPavel Pisa }
175d18957dbSPavel Pisa 
176d18957dbSPavel Pisa type_init(can_bus_register_types);
177