|
1 /* |
|
2 * Copyright (c) 2008 Nokia Corporation and/or its subsidiary(-ies). |
|
3 * All rights reserved. |
|
4 * This component and the accompanying materials are made available |
|
5 * under the terms of "Eclipse Public License v1.0" |
|
6 * which accompanies this distribution, and is available |
|
7 * at the URL "http://www.eclipse.org/legal/epl-v10.html". |
|
8 * |
|
9 * Initial Contributors: |
|
10 * Nokia Corporation - initial contribution. |
|
11 * |
|
12 * Contributors: |
|
13 * |
|
14 * Description: |
|
15 * |
|
16 */ |
|
17 |
|
18 |
|
19 #include <rmemcell.h> |
|
20 #include <rmemchunk.h> |
|
21 #include <es_mbuf.h> |
|
22 #include <comms-infras/mbufchain.h> |
|
23 |
|
24 #include "upnpmemoryutils.h" |
|
25 |
|
26 |
|
27 TInt TUPnPMemoryUtils::CreateMemChunk(RMemChunk& aMemChunk, RMBufChain& aData, RMemoryAllocator& aAllocator) |
|
28 { |
|
29 TInt n, n1, n2; |
|
30 TUint8* p1, *p2; |
|
31 RMBuf* m1; |
|
32 RMemCell* m2; |
|
33 |
|
34 TInt len = aData.Length(); |
|
35 |
|
36 if(!len) |
|
37 { |
|
38 aMemChunk.Init(); |
|
39 return KErrNone; |
|
40 } |
|
41 |
|
42 TInt err = aMemChunk.Alloc ( len, aAllocator ); |
|
43 |
|
44 if(err != KErrNone) |
|
45 { |
|
46 return err; |
|
47 } |
|
48 m1 = aData.First(); |
|
49 p1 = m1->Ptr(); |
|
50 n1 = m1->Length(); |
|
51 |
|
52 m2 = aMemChunk.First(); |
|
53 p2 = m2->Ptr(); |
|
54 n2 = m2->Length(); |
|
55 |
|
56 while (len>0) |
|
57 { |
|
58 __ASSERT_DEBUG(n1>0 && n2>0, User::Invariant ()); |
|
59 |
|
60 n = n1 < n2 ? n1 : n2; |
|
61 |
|
62 Mem::Copy(p2, p1, n); |
|
63 |
|
64 if (n1 -= n, n1 == 0) |
|
65 { |
|
66 if (m1 = m1->Next(), m1==NULL) |
|
67 break; |
|
68 p1 = m1->Ptr(); |
|
69 n1 = m1->Length(); |
|
70 } |
|
71 else |
|
72 p1 += n; |
|
73 |
|
74 if (n2 -= n, n2 == 0) |
|
75 { |
|
76 if (m2 = m2->Next(), m2==NULL) |
|
77 break; |
|
78 p2 = m2->Ptr(); |
|
79 n2 = m2->Length(); |
|
80 } |
|
81 else |
|
82 p2 += n; |
|
83 |
|
84 len -= n; |
|
85 } |
|
86 |
|
87 return KErrNone; |
|
88 } |
|
89 |
|
90 TInt TUPnPMemoryUtils::CreateMBuf(RMBufChain& aBufChain, RMemChunk& aData) |
|
91 { |
|
92 TInt n, n1, n2; |
|
93 TUint8* p1, *p2; |
|
94 RMemCell* m1; |
|
95 RMBuf* m2; |
|
96 |
|
97 TInt len = aData.Length(); |
|
98 |
|
99 if(!len) |
|
100 { |
|
101 aBufChain.Init(); |
|
102 return KErrNone; |
|
103 } |
|
104 |
|
105 TInt err = aBufChain.Alloc ( len ); |
|
106 |
|
107 if(err != KErrNone) |
|
108 { |
|
109 return err; |
|
110 } |
|
111 m1 = aData.First(); |
|
112 p1 = m1->Ptr(); |
|
113 n1 = m1->Length(); |
|
114 |
|
115 m2 = aBufChain.First(); |
|
116 p2 = m2->Ptr(); |
|
117 n2 = m2->Length(); |
|
118 |
|
119 while (len>0) |
|
120 { |
|
121 __ASSERT_DEBUG(n1>0 && n2>0, User::Invariant ()); |
|
122 |
|
123 n = n1 < n2 ? n1 : n2; |
|
124 |
|
125 Mem::Copy(p2, p1, n); |
|
126 |
|
127 if (n1 -= n, n1 == 0) |
|
128 { |
|
129 if (m1 = m1->Next(), m1==NULL) |
|
130 break; |
|
131 p1 = m1->Ptr(); |
|
132 n1 = m1->Length(); |
|
133 } |
|
134 else |
|
135 p1 += n; |
|
136 |
|
137 if (n2 -= n, n2 == 0) |
|
138 { |
|
139 if (m2 = m2->Next(), m2==NULL) |
|
140 break; |
|
141 p2 = m2->Ptr(); |
|
142 n2 = m2->Length(); |
|
143 } |
|
144 else |
|
145 p2 += n; |
|
146 |
|
147 len -= n; |
|
148 } |
|
149 |
|
150 return KErrNone; |
|
151 } |
|
152 |
|
153 |
|
154 |