xref: /utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/newhost/drvPCIMEM.c (revision 53ee8cc121a030b8d368113ac3e966b4705770ef)
1*53ee8cc1Swenshuai.xi //<MStar Software>
2*53ee8cc1Swenshuai.xi //******************************************************************************
3*53ee8cc1Swenshuai.xi // MStar Software
4*53ee8cc1Swenshuai.xi // Copyright (c) 2010 - 2012 MStar Semiconductor, Inc. All rights reserved.
5*53ee8cc1Swenshuai.xi // All software, firmware and related documentation herein ("MStar Software") are
6*53ee8cc1Swenshuai.xi // intellectual property of MStar Semiconductor, Inc. ("MStar") and protected by
7*53ee8cc1Swenshuai.xi // law, including, but not limited to, copyright law and international treaties.
8*53ee8cc1Swenshuai.xi // Any use, modification, reproduction, retransmission, or republication of all
9*53ee8cc1Swenshuai.xi // or part of MStar Software is expressly prohibited, unless prior written
10*53ee8cc1Swenshuai.xi // permission has been granted by MStar.
11*53ee8cc1Swenshuai.xi //
12*53ee8cc1Swenshuai.xi // By accessing, browsing and/or using MStar Software, you acknowledge that you
13*53ee8cc1Swenshuai.xi // have read, understood, and agree, to be bound by below terms ("Terms") and to
14*53ee8cc1Swenshuai.xi // comply with all applicable laws and regulations:
15*53ee8cc1Swenshuai.xi //
16*53ee8cc1Swenshuai.xi // 1. MStar shall retain any and all right, ownership and interest to MStar
17*53ee8cc1Swenshuai.xi //    Software and any modification/derivatives thereof.
18*53ee8cc1Swenshuai.xi //    No right, ownership, or interest to MStar Software and any
19*53ee8cc1Swenshuai.xi //    modification/derivatives thereof is transferred to you under Terms.
20*53ee8cc1Swenshuai.xi //
21*53ee8cc1Swenshuai.xi // 2. You understand that MStar Software might include, incorporate or be
22*53ee8cc1Swenshuai.xi //    supplied together with third party`s software and the use of MStar
23*53ee8cc1Swenshuai.xi //    Software may require additional licenses from third parties.
24*53ee8cc1Swenshuai.xi //    Therefore, you hereby agree it is your sole responsibility to separately
25*53ee8cc1Swenshuai.xi //    obtain any and all third party right and license necessary for your use of
26*53ee8cc1Swenshuai.xi //    such third party`s software.
27*53ee8cc1Swenshuai.xi //
28*53ee8cc1Swenshuai.xi // 3. MStar Software and any modification/derivatives thereof shall be deemed as
29*53ee8cc1Swenshuai.xi //    MStar`s confidential information and you agree to keep MStar`s
30*53ee8cc1Swenshuai.xi //    confidential information in strictest confidence and not disclose to any
31*53ee8cc1Swenshuai.xi //    third party.
32*53ee8cc1Swenshuai.xi //
33*53ee8cc1Swenshuai.xi // 4. MStar Software is provided on an "AS IS" basis without warranties of any
34*53ee8cc1Swenshuai.xi //    kind. Any warranties are hereby expressly disclaimed by MStar, including
35*53ee8cc1Swenshuai.xi //    without limitation, any warranties of merchantability, non-infringement of
36*53ee8cc1Swenshuai.xi //    intellectual property rights, fitness for a particular purpose, error free
37*53ee8cc1Swenshuai.xi //    and in conformity with any international standard.  You agree to waive any
38*53ee8cc1Swenshuai.xi //    claim against MStar for any loss, damage, cost or expense that you may
39*53ee8cc1Swenshuai.xi //    incur related to your use of MStar Software.
40*53ee8cc1Swenshuai.xi //    In no event shall MStar be liable for any direct, indirect, incidental or
41*53ee8cc1Swenshuai.xi //    consequential damages, including without limitation, lost of profit or
42*53ee8cc1Swenshuai.xi //    revenues, lost or damage of data, and unauthorized system use.
43*53ee8cc1Swenshuai.xi //    You agree that this Section 4 shall still apply without being affected
44*53ee8cc1Swenshuai.xi //    even if MStar Software has been modified by MStar in accordance with your
45*53ee8cc1Swenshuai.xi //    request or instruction for your use, except otherwise agreed by both
46*53ee8cc1Swenshuai.xi //    parties in writing.
47*53ee8cc1Swenshuai.xi //
48*53ee8cc1Swenshuai.xi // 5. If requested, MStar may from time to time provide technical supports or
49*53ee8cc1Swenshuai.xi //    services in relation with MStar Software to you for your use of
50*53ee8cc1Swenshuai.xi //    MStar Software in conjunction with your or your customer`s product
51*53ee8cc1Swenshuai.xi //    ("Services").
52*53ee8cc1Swenshuai.xi //    You understand and agree that, except otherwise agreed by both parties in
53*53ee8cc1Swenshuai.xi //    writing, Services are provided on an "AS IS" basis and the warranty
54*53ee8cc1Swenshuai.xi //    disclaimer set forth in Section 4 above shall apply.
55*53ee8cc1Swenshuai.xi //
56*53ee8cc1Swenshuai.xi // 6. Nothing contained herein shall be construed as by implication, estoppels
57*53ee8cc1Swenshuai.xi //    or otherwise:
58*53ee8cc1Swenshuai.xi //    (a) conferring any license or right to use MStar name, trademark, service
59*53ee8cc1Swenshuai.xi //        mark, symbol or any other identification;
60*53ee8cc1Swenshuai.xi //    (b) obligating MStar or any of its affiliates to furnish any person,
61*53ee8cc1Swenshuai.xi //        including without limitation, you and your customers, any assistance
62*53ee8cc1Swenshuai.xi //        of any kind whatsoever, or any information; or
63*53ee8cc1Swenshuai.xi //    (c) conferring any license or right under any intellectual property right.
64*53ee8cc1Swenshuai.xi //
65*53ee8cc1Swenshuai.xi // 7. These terms shall be governed by and construed in accordance with the laws
66*53ee8cc1Swenshuai.xi //    of Taiwan, R.O.C., excluding its conflict of law rules.
67*53ee8cc1Swenshuai.xi //    Any and all dispute arising out hereof or related hereto shall be finally
68*53ee8cc1Swenshuai.xi //    settled by arbitration referred to the Chinese Arbitration Association,
69*53ee8cc1Swenshuai.xi //    Taipei in accordance with the ROC Arbitration Law and the Arbitration
70*53ee8cc1Swenshuai.xi //    Rules of the Association by three (3) arbitrators appointed in accordance
71*53ee8cc1Swenshuai.xi //    with the said Rules.
72*53ee8cc1Swenshuai.xi //    The place of arbitration shall be in Taipei, Taiwan and the language shall
73*53ee8cc1Swenshuai.xi //    be English.
74*53ee8cc1Swenshuai.xi //    The arbitration award shall be final and binding to both parties.
75*53ee8cc1Swenshuai.xi //
76*53ee8cc1Swenshuai.xi //******************************************************************************
77*53ee8cc1Swenshuai.xi //<MStar Software>
78*53ee8cc1Swenshuai.xi 
79*53ee8cc1Swenshuai.xi //#include <MsCommon.h> // NUSED
80*53ee8cc1Swenshuai.xi //#include "include/drvPCIMEM.h" // NUSED
81*53ee8cc1Swenshuai.xi #include "include/drvKernel.h"
82*53ee8cc1Swenshuai.xi #include "include/drvBitops.h"
83*53ee8cc1Swenshuai.xi #include "drvUsbHostConfig.h"
84*53ee8cc1Swenshuai.xi 
85*53ee8cc1Swenshuai.xi /**
86*53ee8cc1Swenshuai.xi      * @brief               Return a memory pool to be used to allocate memory by the requested characteristics.
87*53ee8cc1Swenshuai.xi      *
88*53ee8cc1Swenshuai.xi      * @param pName          name of memory pool
89*53ee8cc1Swenshuai.xi      *
90*53ee8cc1Swenshuai.xi      * @param u32Size         block size in the pool.
91*53ee8cc1Swenshuai.xi      *
92*53ee8cc1Swenshuai.xi      * @param u32AlignLen   block alignment size.
93*53ee8cc1Swenshuai.xi      *
94*53ee8cc1Swenshuai.xi      * @param U32CrossLimit  returned blocks can't cross the boundray.
95*53ee8cc1Swenshuai.xi      *
96*53ee8cc1Swenshuai.xi      * @return  ms_mem_pool     return memory pool with the requested characteristics.
97*53ee8cc1Swenshuai.xi      */
ms_mem_pool_create(const char * pName,MS_U32 u32Size,MS_U32 u32AlignLen,MS_U32 U32CrossLimit)98*53ee8cc1Swenshuai.xi struct ms_mem_pool *ms_mem_pool_create (const char *pName, MS_U32 u32Size, MS_U32 u32AlignLen, MS_U32 U32CrossLimit)
99*53ee8cc1Swenshuai.xi {
100*53ee8cc1Swenshuai.xi     struct ms_mem_pool    *pPool;
101*53ee8cc1Swenshuai.xi 
102*53ee8cc1Swenshuai.xi     if (u32AlignLen == 0)
103*53ee8cc1Swenshuai.xi         u32AlignLen = 1;
104*53ee8cc1Swenshuai.xi     if (u32Size == 0)
105*53ee8cc1Swenshuai.xi         return 0;
106*53ee8cc1Swenshuai.xi     else if (u32Size < u32AlignLen)
107*53ee8cc1Swenshuai.xi     u32Size = u32AlignLen;
108*53ee8cc1Swenshuai.xi     else if ((u32Size % u32AlignLen) != 0)
109*53ee8cc1Swenshuai.xi     {
110*53ee8cc1Swenshuai.xi         u32Size += u32AlignLen + 1;
111*53ee8cc1Swenshuai.xi         u32Size &= ~(u32AlignLen - 1);
112*53ee8cc1Swenshuai.xi     }
113*53ee8cc1Swenshuai.xi 
114*53ee8cc1Swenshuai.xi     if (U32CrossLimit == 0)
115*53ee8cc1Swenshuai.xi     {
116*53ee8cc1Swenshuai.xi         if (PAGE_SIZE < u32Size)
117*53ee8cc1Swenshuai.xi             U32CrossLimit = u32Size;
118*53ee8cc1Swenshuai.xi         else
119*53ee8cc1Swenshuai.xi             U32CrossLimit = PAGE_SIZE;
120*53ee8cc1Swenshuai.xi     }
121*53ee8cc1Swenshuai.xi     else if (U32CrossLimit < u32Size)
122*53ee8cc1Swenshuai.xi         return 0;
123*53ee8cc1Swenshuai.xi 
124*53ee8cc1Swenshuai.xi     if (!(pPool = (struct ms_mem_pool*) kmalloc (sizeof (*pPool), SLAB_KERNEL)))
125*53ee8cc1Swenshuai.xi         return pPool;
126*53ee8cc1Swenshuai.xi 
127*53ee8cc1Swenshuai.xi     strncpy (pPool->name, pName, sizeof (pPool->name)-1 );
128*53ee8cc1Swenshuai.xi     pPool->name[sizeof(pPool->name)-1] = '\0';
129*53ee8cc1Swenshuai.xi     ms_list_init (&pPool->page_list);
130*53ee8cc1Swenshuai.xi     pPool->size = u32Size;
131*53ee8cc1Swenshuai.xi     pPool->allocation = U32CrossLimit;
132*53ee8cc1Swenshuai.xi     pPool->blocks_per_page = U32CrossLimit / u32Size;
133*53ee8cc1Swenshuai.xi     ms_usbhost_debug("ms_mem_pool_create: size=%d,allocation=%d bytes, %d blocks per page",
134*53ee8cc1Swenshuai.xi         pPool->size, pPool->allocation, pPool->blocks_per_page);
135*53ee8cc1Swenshuai.xi     return pPool;
136*53ee8cc1Swenshuai.xi }
137*53ee8cc1Swenshuai.xi 
138*53ee8cc1Swenshuai.xi static struct ms_mem_page *
pool_alloc_page(struct ms_mem_pool * pMem_pool,int iFlags)139*53ee8cc1Swenshuai.xi pool_alloc_page (struct ms_mem_pool *pMem_pool, int iFlags)
140*53ee8cc1Swenshuai.xi {
141*53ee8cc1Swenshuai.xi     struct ms_mem_page  *pPage;
142*53ee8cc1Swenshuai.xi     int    mapsize;
143*53ee8cc1Swenshuai.xi 
144*53ee8cc1Swenshuai.xi     mapsize = pMem_pool->blocks_per_page;
145*53ee8cc1Swenshuai.xi     mapsize = (mapsize + BITS_PER_LONG - 1) / BITS_PER_LONG;
146*53ee8cc1Swenshuai.xi     mapsize *= sizeof (U32);
147*53ee8cc1Swenshuai.xi 
148*53ee8cc1Swenshuai.xi     pPage = (struct ms_mem_page *) kmalloc (mapsize + sizeof(struct ms_mem_page), iFlags);
149*53ee8cc1Swenshuai.xi     ms_list_init(&pPage->page_list);
150*53ee8cc1Swenshuai.xi     if (!pPage)
151*53ee8cc1Swenshuai.xi         return 0;
152*53ee8cc1Swenshuai.xi 
153*53ee8cc1Swenshuai.xi     pPage->vaddr = ncmem_alloc_page(&pPage->dma);
154*53ee8cc1Swenshuai.xi 
155*53ee8cc1Swenshuai.xi     if (pPage->vaddr)
156*53ee8cc1Swenshuai.xi     {
157*53ee8cc1Swenshuai.xi         memset (pPage->bitmap, ((U32)-1), mapsize);  // bit set == free
158*53ee8cc1Swenshuai.xi         ms_insert_list_after (&pPage->page_list, &pMem_pool->page_list);
159*53ee8cc1Swenshuai.xi     }
160*53ee8cc1Swenshuai.xi     else
161*53ee8cc1Swenshuai.xi     {
162*53ee8cc1Swenshuai.xi         kfree (pPage);
163*53ee8cc1Swenshuai.xi         pPage = 0;
164*53ee8cc1Swenshuai.xi     }
165*53ee8cc1Swenshuai.xi     return pPage;
166*53ee8cc1Swenshuai.xi }
167*53ee8cc1Swenshuai.xi 
168*53ee8cc1Swenshuai.xi /**
169*53ee8cc1Swenshuai.xi      * @brief                       Allocate a block of memory
170*53ee8cc1Swenshuai.xi      *
171*53ee8cc1Swenshuai.xi      * @param pMem_pool    The pool to allocate memory.
172*53ee8cc1Swenshuai.xi      *
173*53ee8cc1Swenshuai.xi      * @param iFlags            memory flag.
174*53ee8cc1Swenshuai.xi      *
175*53ee8cc1Swenshuai.xi      * @param pDma_addr     pointer to physical address of block
176*53ee8cc1Swenshuai.xi      *
177*53ee8cc1Swenshuai.xi      * @return                      pointer to virtual address of block
178*53ee8cc1Swenshuai.xi      */
ms_mem_pool_alloc(struct ms_mem_pool * pMem_pool,int iFlags,dma_addr_t * pDma_addr)179*53ee8cc1Swenshuai.xi void *ms_mem_pool_alloc (struct ms_mem_pool *pMem_pool, int iFlags, dma_addr_t *pDma_addr)
180*53ee8cc1Swenshuai.xi {
181*53ee8cc1Swenshuai.xi     U32    u32flag;
182*53ee8cc1Swenshuai.xi     struct list_head  *entry;
183*53ee8cc1Swenshuai.xi     struct ms_mem_page    *ms_page;
184*53ee8cc1Swenshuai.xi     int      iMap, iBlock;
185*53ee8cc1Swenshuai.xi     U32      u32Offset;
186*53ee8cc1Swenshuai.xi     void     *ms_retval;
187*53ee8cc1Swenshuai.xi 
188*53ee8cc1Swenshuai.xi     osapi_spin_lock_irqsave (&pMem_pool->lock, u32flag);
189*53ee8cc1Swenshuai.xi     list_for_loop (entry, &pMem_pool->page_list)
190*53ee8cc1Swenshuai.xi     {
191*53ee8cc1Swenshuai.xi         U32    i;
192*53ee8cc1Swenshuai.xi 
193*53ee8cc1Swenshuai.xi         const struct list_head *__mptr = entry;
194*53ee8cc1Swenshuai.xi         ms_page = (struct ms_mem_page *)( (char *)__mptr - (char *)offsetof(struct ms_mem_page,page_list));
195*53ee8cc1Swenshuai.xi 
196*53ee8cc1Swenshuai.xi         /* only cachable accesses here ... */
197*53ee8cc1Swenshuai.xi         for (iMap = 0, i = 0; i < pMem_pool->blocks_per_page; i += BITS_PER_LONG, iMap++)
198*53ee8cc1Swenshuai.xi         {
199*53ee8cc1Swenshuai.xi             if (ms_page->bitmap [iMap] == 0)
200*53ee8cc1Swenshuai.xi                 continue;
201*53ee8cc1Swenshuai.xi             iBlock = ms_find_1st_zero (~ ms_page->bitmap [iMap]);
202*53ee8cc1Swenshuai.xi             if ((i + iBlock) < pMem_pool->blocks_per_page)
203*53ee8cc1Swenshuai.xi             {
204*53ee8cc1Swenshuai.xi                 ms_clear_bit ( iBlock, &ms_page->bitmap [iMap],U32);
205*53ee8cc1Swenshuai.xi                 u32Offset = (BITS_PER_LONG * iMap) + iBlock;
206*53ee8cc1Swenshuai.xi                 u32Offset *= pMem_pool->size;
207*53ee8cc1Swenshuai.xi                 goto ready;
208*53ee8cc1Swenshuai.xi             }
209*53ee8cc1Swenshuai.xi         }
210*53ee8cc1Swenshuai.xi     }
211*53ee8cc1Swenshuai.xi 
212*53ee8cc1Swenshuai.xi     if (!(ms_page = pool_alloc_page (pMem_pool, iFlags)))
213*53ee8cc1Swenshuai.xi     {
214*53ee8cc1Swenshuai.xi         diag_printf("pool allocate page fail\n");
215*53ee8cc1Swenshuai.xi         ms_retval = 0;
216*53ee8cc1Swenshuai.xi         goto done;
217*53ee8cc1Swenshuai.xi     }
218*53ee8cc1Swenshuai.xi 
219*53ee8cc1Swenshuai.xi     ms_clear_bit (0, &ms_page->bitmap [0],U32);
220*53ee8cc1Swenshuai.xi     u32Offset = 0;
221*53ee8cc1Swenshuai.xi ready:
222*53ee8cc1Swenshuai.xi     ms_retval = (void*) (u32Offset + (size_t) ( ms_page->vaddr ));
223*53ee8cc1Swenshuai.xi     *pDma_addr = u32Offset + ms_page->dma;
224*53ee8cc1Swenshuai.xi done:
225*53ee8cc1Swenshuai.xi     osapi_spin_unlock_irqrestore (&pMem_pool->lock, u32flag);
226*53ee8cc1Swenshuai.xi     //ms_usbhost_debug("The allocated addr is %p, block size is %d ,bit_map[%d] is 0x%08X",
227*53ee8cc1Swenshuai.xi     //    ms_retval, pMem_pool->size ,iMap,(U32)ms_page->bitmap [iMap]);
228*53ee8cc1Swenshuai.xi     return ms_retval;
229*53ee8cc1Swenshuai.xi }
230*53ee8cc1Swenshuai.xi 
__is_page_busy(int ms_blocks,U32 * ms_bitmap)231*53ee8cc1Swenshuai.xi static __inline__ int __is_page_busy (int ms_blocks, U32 *ms_bitmap)
232*53ee8cc1Swenshuai.xi {
233*53ee8cc1Swenshuai.xi     while (ms_blocks > 0)
234*53ee8cc1Swenshuai.xi     {
235*53ee8cc1Swenshuai.xi         if (*ms_bitmap++ != ~0UL)
236*53ee8cc1Swenshuai.xi             return 1;
237*53ee8cc1Swenshuai.xi         ms_blocks -= BITS_PER_LONG;
238*53ee8cc1Swenshuai.xi     }
239*53ee8cc1Swenshuai.xi     return 0;
240*53ee8cc1Swenshuai.xi }
241*53ee8cc1Swenshuai.xi 
242*53ee8cc1Swenshuai.xi /**
243*53ee8cc1Swenshuai.xi      * @brief                       Destory memory pool
244*53ee8cc1Swenshuai.xi      *
245*53ee8cc1Swenshuai.xi      * @param pMem_pool    The pool to be destoryed.
246*53ee8cc1Swenshuai.xi      *
247*53ee8cc1Swenshuai.xi      * @return                     None
248*53ee8cc1Swenshuai.xi      */
ms_mem_pool_destroy(struct ms_mem_pool * pMem_pool)249*53ee8cc1Swenshuai.xi void ms_mem_pool_destroy (struct ms_mem_pool *pMem_pool)
250*53ee8cc1Swenshuai.xi {
251*53ee8cc1Swenshuai.xi     U32    u32flag;
252*53ee8cc1Swenshuai.xi 
253*53ee8cc1Swenshuai.xi     osapi_spin_lock_irqsave (&pMem_pool->lock, u32flag);
254*53ee8cc1Swenshuai.xi     while (!ms_is_empty_list (&pMem_pool->page_list))
255*53ee8cc1Swenshuai.xi     {
256*53ee8cc1Swenshuai.xi         struct ms_mem_page    *ms_page;
257*53ee8cc1Swenshuai.xi 
258*53ee8cc1Swenshuai.xi         const struct list_head *__mptr = pMem_pool->page_list.next;
259*53ee8cc1Swenshuai.xi         ms_page = (struct ms_mem_page *)( (char *)__mptr - (char *)offsetof(struct ms_mem_page,page_list) );
260*53ee8cc1Swenshuai.xi 
261*53ee8cc1Swenshuai.xi         if (__is_page_busy (pMem_pool->blocks_per_page, ms_page->bitmap))
262*53ee8cc1Swenshuai.xi         {
263*53ee8cc1Swenshuai.xi             diag_printf ("ms_mem_pool_destroy %s, %p busy\n",
264*53ee8cc1Swenshuai.xi                 pMem_pool->name, ms_page->vaddr);
265*53ee8cc1Swenshuai.xi             /* leak the still-in-use consistent memory */
266*53ee8cc1Swenshuai.xi             ms_list_remove (&ms_page->page_list);
267*53ee8cc1Swenshuai.xi             kfree (ms_page);
268*53ee8cc1Swenshuai.xi         }
269*53ee8cc1Swenshuai.xi         else
270*53ee8cc1Swenshuai.xi         {
271*53ee8cc1Swenshuai.xi 			ncmem_free_page((U32)ms_page->vaddr);
272*53ee8cc1Swenshuai.xi 			ms_list_remove (&ms_page->page_list);
273*53ee8cc1Swenshuai.xi 			kfree (ms_page);
274*53ee8cc1Swenshuai.xi         }
275*53ee8cc1Swenshuai.xi 
276*53ee8cc1Swenshuai.xi     }
277*53ee8cc1Swenshuai.xi     osapi_spin_unlock_irqrestore (&pMem_pool->lock, u32flag);
278*53ee8cc1Swenshuai.xi     kfree (pMem_pool);
279*53ee8cc1Swenshuai.xi }
280*53ee8cc1Swenshuai.xi 
281*53ee8cc1Swenshuai.xi /**
282*53ee8cc1Swenshuai.xi      * @brief               Free memory block and put back into pool
283*53ee8cc1Swenshuai.xi      *
284*53ee8cc1Swenshuai.xi      * @param pMem_pool    The pool contains the block.
285*53ee8cc1Swenshuai.xi      *
286*53ee8cc1Swenshuai.xi      * @param pVirt_addr     Virtual address of the blcok.
287*53ee8cc1Swenshuai.xi      *
288*53ee8cc1Swenshuai.xi      * @param dma_addr      Physical address of the block.
289*53ee8cc1Swenshuai.xi      *
290*53ee8cc1Swenshuai.xi      * @return  BOOL           success or not
291*53ee8cc1Swenshuai.xi      */
ms_mem_pool_free(struct ms_mem_pool * pMem_pool,void * pVirt_addr,dma_addr_t dma_addr)292*53ee8cc1Swenshuai.xi MS_BOOL ms_mem_pool_free (struct ms_mem_pool *pMem_pool, void *pVirt_addr, dma_addr_t dma_addr)
293*53ee8cc1Swenshuai.xi {
294*53ee8cc1Swenshuai.xi     struct ms_mem_page   *ms_page;
295*53ee8cc1Swenshuai.xi     struct list_head  *pEntry;
296*53ee8cc1Swenshuai.xi     U32      u32flag;
297*53ee8cc1Swenshuai.xi     int      iMap, iBlock;
298*53ee8cc1Swenshuai.xi 
299*53ee8cc1Swenshuai.xi     // find page in memory pool
300*53ee8cc1Swenshuai.xi 	osapi_spin_lock_irqsave (&pMem_pool->lock, u32flag);
301*53ee8cc1Swenshuai.xi 	list_for_loop (pEntry, &pMem_pool->page_list)
302*53ee8cc1Swenshuai.xi 	{
303*53ee8cc1Swenshuai.xi 		//page = list_entry (entry, struct ms_mem_page, page_list);
304*53ee8cc1Swenshuai.xi 		const struct list_head *__mptr = pEntry;
305*53ee8cc1Swenshuai.xi 		ms_page = (struct ms_mem_page *)( (char *)__mptr - (char *)offsetof(struct ms_mem_page,page_list) );
306*53ee8cc1Swenshuai.xi 
307*53ee8cc1Swenshuai.xi 		if (dma_addr < ms_page->dma)
308*53ee8cc1Swenshuai.xi 			continue;
309*53ee8cc1Swenshuai.xi 		if (dma_addr < (ms_page->dma + pMem_pool->allocation))
310*53ee8cc1Swenshuai.xi 			goto page_found;
311*53ee8cc1Swenshuai.xi 	}
312*53ee8cc1Swenshuai.xi 
313*53ee8cc1Swenshuai.xi 	//Not found !!
314*53ee8cc1Swenshuai.xi 	osapi_spin_unlock_irqrestore (&pMem_pool->lock, u32flag);
315*53ee8cc1Swenshuai.xi     ms_usbhost_debug ("ms_mem_pool_free %s, %p/%lx (bad dma)\n", pMem_pool->name, pVirt_addr, (U32) dma_addr);
316*53ee8cc1Swenshuai.xi     return FALSE;
317*53ee8cc1Swenshuai.xi 
318*53ee8cc1Swenshuai.xi 
319*53ee8cc1Swenshuai.xi page_found:
320*53ee8cc1Swenshuai.xi 	osapi_spin_unlock_irqrestore (&pMem_pool->lock, u32flag);
321*53ee8cc1Swenshuai.xi 
322*53ee8cc1Swenshuai.xi     iBlock = dma_addr - ms_page->dma;
323*53ee8cc1Swenshuai.xi     iBlock /= pMem_pool->size;
324*53ee8cc1Swenshuai.xi     iMap = iBlock / BITS_PER_LONG;
325*53ee8cc1Swenshuai.xi     iBlock %= BITS_PER_LONG;
326*53ee8cc1Swenshuai.xi 
327*53ee8cc1Swenshuai.xi     osapi_spin_lock_irqsave (&pMem_pool->lock, u32flag);
328*53ee8cc1Swenshuai.xi     ms_set_bit (iBlock, &ms_page->bitmap [iMap], U32);
329*53ee8cc1Swenshuai.xi     ms_usbhost_debug("Free Block: addr=0x%08X bitmap is 0x%08X",dma_addr,(U32)ms_page->bitmap [iMap]);
330*53ee8cc1Swenshuai.xi 
331*53ee8cc1Swenshuai.xi     ////   if (!is_page_busy(bpp, page->bitmap)) pool_free_page(pool, page);
332*53ee8cc1Swenshuai.xi     ////   it is not interrupt safe. Better have empty pages hang around.
333*53ee8cc1Swenshuai.xi 
334*53ee8cc1Swenshuai.xi     osapi_spin_unlock_irqrestore (&pMem_pool->lock, u32flag);
335*53ee8cc1Swenshuai.xi     return TRUE;
336*53ee8cc1Swenshuai.xi }
337*53ee8cc1Swenshuai.xi 
338