1 /*
2  * Copyright (C) 2017 Netronome Systems, Inc.
3  *
4  * This software is dual licensed under the GNU General License Version 2,
5  * June 1991 as shown in the file COPYING in the top-level directory of this
6  * source tree or the BSD 2-Clause License provided below.  You have the
7  * option to license this software under the complete terms of either license.
8  *
9  * The BSD 2-Clause License:
10  *
11  *     Redistribution and use in source and binary forms, with or
12  *     without modification, are permitted provided that the following
13  *     conditions are met:
14  *
15  *      1. Redistributions of source code must retain the above
16  *         copyright notice, this list of conditions and the following
17  *         disclaimer.
18  *
19  *      2. Redistributions in binary form must reproduce the above
20  *         copyright notice, this list of conditions and the following
21  *         disclaimer in the documentation and/or other materials
22  *         provided with the distribution.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28  * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29  * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30  * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31  * SOFTWARE.
32  */
33 
34 #include <linux/skbuff.h>
35 #include <linux/slab.h>
36 
37 #include "nfpcore/nfp_cpp.h"
38 #include "nfpcore/nfp_nffw.h"
39 #include "nfp_app.h"
40 #include "nfp_main.h"
41 #include "nfp_net_repr.h"
42 
43 static const struct nfp_app_type *apps[] = {
44 	&app_nic,
45 	&app_bpf,
46 #ifdef CONFIG_NFP_APP_FLOWER
47 	&app_flower,
48 #endif
49 };
50 
51 const char *nfp_app_mip_name(struct nfp_app *app)
52 {
53 	if (!app || !app->pf->mip)
54 		return "";
55 	return nfp_mip_name(app->pf->mip);
56 }
57 
58 struct sk_buff *
59 nfp_app_ctrl_msg_alloc(struct nfp_app *app, unsigned int size, gfp_t priority)
60 {
61 	struct sk_buff *skb;
62 
63 	if (nfp_app_ctrl_has_meta(app))
64 		size += 8;
65 
66 	skb = alloc_skb(size, priority);
67 	if (!skb)
68 		return NULL;
69 
70 	if (nfp_app_ctrl_has_meta(app))
71 		skb_reserve(skb, 8);
72 
73 	return skb;
74 }
75 
76 struct nfp_reprs *
77 nfp_app_reprs_set(struct nfp_app *app, enum nfp_repr_type type,
78 		  struct nfp_reprs *reprs)
79 {
80 	struct nfp_reprs *old;
81 
82 	old = rcu_dereference_protected(app->reprs[type],
83 					lockdep_is_held(&app->pf->lock));
84 	if (reprs && old) {
85 		old = ERR_PTR(-EBUSY);
86 		goto exit_unlock;
87 	}
88 
89 	rcu_assign_pointer(app->reprs[type], reprs);
90 
91 exit_unlock:
92 	return old;
93 }
94 
95 struct nfp_app *nfp_app_alloc(struct nfp_pf *pf, enum nfp_app_id id)
96 {
97 	struct nfp_app *app;
98 	unsigned int i;
99 
100 	for (i = 0; i < ARRAY_SIZE(apps); i++)
101 		if (apps[i]->id == id)
102 			break;
103 	if (i == ARRAY_SIZE(apps)) {
104 		nfp_err(pf->cpp, "failed to find app with ID 0x%02hhx\n", id);
105 		return ERR_PTR(-EINVAL);
106 	}
107 
108 	if (WARN_ON(!apps[i]->name || !apps[i]->vnic_init))
109 		return ERR_PTR(-EINVAL);
110 
111 	app = kzalloc(sizeof(*app), GFP_KERNEL);
112 	if (!app)
113 		return ERR_PTR(-ENOMEM);
114 
115 	app->pf = pf;
116 	app->cpp = pf->cpp;
117 	app->pdev = pf->pdev;
118 	app->type = apps[i];
119 
120 	return app;
121 }
122 
123 void nfp_app_free(struct nfp_app *app)
124 {
125 	kfree(app);
126 }
127