1*418b791dSBob Badour /*
2*418b791dSBob Badour * Copyright (c) 2019, The Linux Foundation. All rights reserved.
3*418b791dSBob Badour *
4*418b791dSBob Badour * Redistribution and use in source and binary forms, with or without
5*418b791dSBob Badour * modification, are permitted provided that the following conditions are
6*418b791dSBob Badour * met:
7*418b791dSBob Badour * * Redistributions of source code must retain the above copyright
8*418b791dSBob Badour * notice, this list of conditions and the following disclaimer.
9*418b791dSBob Badour * * Redistributions in binary form must reproduce the above
10*418b791dSBob Badour * copyright notice, this list of conditions and the following
11*418b791dSBob Badour * disclaimer in the documentation and/or other materials provided
12*418b791dSBob Badour * with the distribution.
13*418b791dSBob Badour * * Neither the name of The Linux Foundation nor the names of its
14*418b791dSBob Badour * contributors may be used to endorse or promote products derived
15*418b791dSBob Badour * from this software without specific prior written permission.
16*418b791dSBob Badour *
17*418b791dSBob Badour * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
18*418b791dSBob Badour * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
19*418b791dSBob Badour * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
20*418b791dSBob Badour * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
21*418b791dSBob Badour * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22*418b791dSBob Badour * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23*418b791dSBob Badour * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
24*418b791dSBob Badour * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25*418b791dSBob Badour * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
26*418b791dSBob Badour * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
27*418b791dSBob Badour * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*418b791dSBob Badour */
29*418b791dSBob Badour #define FARF_ERROR 1
30*418b791dSBob Badour #include "HAP_farf.h"
31*418b791dSBob Badour #include "platform_libs.h"
32*418b791dSBob Badour #include "AEEatomic.h"
33*418b791dSBob Badour #include "AEEstd.h"
34*418b791dSBob Badour #include "AEEStdErr.h"
35*418b791dSBob Badour #include <stdio.h>
36*418b791dSBob Badour #include <assert.h>
37*418b791dSBob Badour #include "verify.h"
38*418b791dSBob Badour
39*418b791dSBob Badour extern struct platform_lib* (*pl_list[])(void);
40*418b791dSBob Badour static uint32 atomic_IfNotThenAdd(uint32* volatile puDest, uint32 uCompare, int nAdd);
41*418b791dSBob Badour
pl_lib_init(struct platform_lib * (* plf)(void))42*418b791dSBob Badour int pl_lib_init(struct platform_lib* (*plf)(void)) {
43*418b791dSBob Badour int nErr = AEE_SUCCESS;
44*418b791dSBob Badour struct platform_lib* pl = plf();
45*418b791dSBob Badour if(1 == atomic_Add(&pl->uRefs, 1)) {
46*418b791dSBob Badour if(pl->init) {
47*418b791dSBob Badour FARF(HIGH, "calling init for %s",pl->name);
48*418b791dSBob Badour nErr = pl->init();
49*418b791dSBob Badour FARF(HIGH, "init for %s returned %x",pl->name, nErr);
50*418b791dSBob Badour }
51*418b791dSBob Badour pl->nErr = nErr;
52*418b791dSBob Badour }
53*418b791dSBob Badour if(pl->nErr != AEE_SUCCESS) {
54*418b791dSBob Badour VERIFY_EPRINTF("Error %x: %s init failed", nErr, pl->name);
55*418b791dSBob Badour }
56*418b791dSBob Badour return pl->nErr;
57*418b791dSBob Badour }
58*418b791dSBob Badour
pl_lib_deinit(struct platform_lib * (* plf)(void))59*418b791dSBob Badour void pl_lib_deinit(struct platform_lib* (*plf)(void)) {
60*418b791dSBob Badour struct platform_lib* pl = plf();
61*418b791dSBob Badour if(1 == atomic_IfNotThenAdd(&pl->uRefs, 0, -1)) {
62*418b791dSBob Badour if(pl->deinit && pl->nErr == 0) {
63*418b791dSBob Badour pl->deinit();
64*418b791dSBob Badour }
65*418b791dSBob Badour }
66*418b791dSBob Badour return;
67*418b791dSBob Badour }
68*418b791dSBob Badour
pl_init_lst(struct platform_lib * (* lst[])(void))69*418b791dSBob Badour static int pl_init_lst(struct platform_lib* (*lst[])(void)) {
70*418b791dSBob Badour int nErr = AEE_SUCCESS;
71*418b791dSBob Badour int ii;
72*418b791dSBob Badour for(ii = 0; lst[ii] != 0; ++ii) {
73*418b791dSBob Badour nErr = pl_lib_init(lst[ii]);
74*418b791dSBob Badour if(nErr != 0) {
75*418b791dSBob Badour break;
76*418b791dSBob Badour }
77*418b791dSBob Badour }
78*418b791dSBob Badour if(nErr != AEE_SUCCESS) {
79*418b791dSBob Badour VERIFY_EPRINTF("Error %x: plinit failed\n", nErr);
80*418b791dSBob Badour }
81*418b791dSBob Badour return nErr;
82*418b791dSBob Badour
83*418b791dSBob Badour }
pl_init(void)84*418b791dSBob Badour int pl_init(void) {
85*418b791dSBob Badour int nErr = pl_init_lst(pl_list);
86*418b791dSBob Badour return nErr;
87*418b791dSBob Badour }
88*418b791dSBob Badour
pl_deinit_lst(struct platform_lib * (* lst[])(void))89*418b791dSBob Badour static void pl_deinit_lst(struct platform_lib* (*lst[])(void)) {
90*418b791dSBob Badour int size, ii;
91*418b791dSBob Badour for(size = 0; lst[size] != 0; ++size) {;}
92*418b791dSBob Badour for(ii = size - 1; ii >= 0; --ii) {
93*418b791dSBob Badour pl_lib_deinit(lst[ii]);
94*418b791dSBob Badour }
95*418b791dSBob Badour return;
96*418b791dSBob Badour }
97*418b791dSBob Badour
98*418b791dSBob Badour
pl_deinit(void)99*418b791dSBob Badour void pl_deinit(void) {
100*418b791dSBob Badour pl_deinit_lst(pl_list);
101*418b791dSBob Badour return;
102*418b791dSBob Badour }
103*418b791dSBob Badour
atomic_IfNotThenAdd(uint32 * volatile puDest,uint32 uCompare,int nAdd)104*418b791dSBob Badour static uint32 atomic_IfNotThenAdd(uint32* volatile puDest, uint32 uCompare, int nAdd)
105*418b791dSBob Badour {
106*418b791dSBob Badour uint32 uPrev;
107*418b791dSBob Badour uint32 uCurr;
108*418b791dSBob Badour do {
109*418b791dSBob Badour //check puDest
110*418b791dSBob Badour uCurr = *puDest;
111*418b791dSBob Badour uPrev = uCurr;
112*418b791dSBob Badour //see if we need to update it
113*418b791dSBob Badour if(uCurr != uCompare) {
114*418b791dSBob Badour //update it
115*418b791dSBob Badour uPrev = atomic_CompareAndExchange(puDest, uCurr + nAdd, uCurr);
116*418b791dSBob Badour }
117*418b791dSBob Badour //verify that the value was the same during the update as when we decided to update
118*418b791dSBob Badour } while(uCurr != uPrev);
119*418b791dSBob Badour return uPrev;
120*418b791dSBob Badour }
121*418b791dSBob Badour
122