| The Android Open Source Project | edbf3b6 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 1 | /* | 
|  | 2 | * Copyright (C) 2005 The Android Open Source Project | 
|  | 3 | * | 
|  | 4 | * Licensed under the Apache License, Version 2.0 (the "License"); | 
|  | 5 | * you may not use this file except in compliance with the License. | 
|  | 6 | * You may obtain a copy of the License at | 
|  | 7 | * | 
|  | 8 | *      http://www.apache.org/licenses/LICENSE-2.0 | 
|  | 9 | * | 
|  | 10 | * Unless required by applicable law or agreed to in writing, software | 
|  | 11 | * distributed under the License is distributed on an "AS IS" BASIS, | 
|  | 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | 
|  | 13 | * See the License for the specific language governing permissions and | 
|  | 14 | * limitations under the License. | 
|  | 15 | */ | 
|  | 16 |  | 
|  | 17 | #define LOG_TAG "Parcel" | 
|  | 18 | //#define LOG_NDEBUG 0 | 
|  | 19 |  | 
|  | 20 | #include <utils/Parcel.h> | 
|  | 21 |  | 
|  | 22 | #include <utils/Binder.h> | 
|  | 23 | #include <utils/BpBinder.h> | 
|  | 24 | #include <utils/Debug.h> | 
|  | 25 | #include <utils/ProcessState.h> | 
|  | 26 | #include <utils/Log.h> | 
|  | 27 | #include <utils/String8.h> | 
|  | 28 | #include <utils/String16.h> | 
|  | 29 | #include <utils/TextOutput.h> | 
|  | 30 | #include <utils/misc.h> | 
|  | 31 |  | 
|  | 32 | #include <private/utils/binder_module.h> | 
|  | 33 |  | 
|  | 34 | #include <stdio.h> | 
|  | 35 | #include <stdlib.h> | 
|  | 36 | #include <stdint.h> | 
|  | 37 |  | 
|  | 38 | #ifndef INT32_MAX | 
|  | 39 | #define INT32_MAX ((int32_t)(2147483647)) | 
|  | 40 | #endif | 
|  | 41 |  | 
|  | 42 | #define LOG_REFS(...) | 
|  | 43 | //#define LOG_REFS(...) LOG(LOG_DEBUG, "Parcel", __VA_ARGS__) | 
|  | 44 |  | 
|  | 45 | // --------------------------------------------------------------------------- | 
|  | 46 |  | 
|  | 47 | #define PAD_SIZE(s) (((s)+3)&~3) | 
|  | 48 |  | 
|  | 49 | // XXX This can be made public if we want to provide | 
|  | 50 | // support for typed data. | 
|  | 51 | struct small_flat_data | 
|  | 52 | { | 
|  | 53 | uint32_t type; | 
|  | 54 | uint32_t data; | 
|  | 55 | }; | 
|  | 56 |  | 
|  | 57 | namespace android { | 
|  | 58 |  | 
|  | 59 | void acquire_object(const sp<ProcessState>& proc, | 
|  | 60 | const flat_binder_object& obj, const void* who) | 
|  | 61 | { | 
|  | 62 | switch (obj.type) { | 
|  | 63 | case BINDER_TYPE_BINDER: | 
|  | 64 | if (obj.binder) { | 
|  | 65 | LOG_REFS("Parcel %p acquiring reference on local %p", who, obj.cookie); | 
|  | 66 | static_cast<IBinder*>(obj.cookie)->incStrong(who); | 
|  | 67 | } | 
|  | 68 | return; | 
|  | 69 | case BINDER_TYPE_WEAK_BINDER: | 
|  | 70 | if (obj.binder) | 
|  | 71 | static_cast<RefBase::weakref_type*>(obj.binder)->incWeak(who); | 
|  | 72 | return; | 
|  | 73 | case BINDER_TYPE_HANDLE: { | 
|  | 74 | const sp<IBinder> b = proc->getStrongProxyForHandle(obj.handle); | 
|  | 75 | if (b != NULL) { | 
|  | 76 | LOG_REFS("Parcel %p acquiring reference on remote %p", who, b.get()); | 
|  | 77 | b->incStrong(who); | 
|  | 78 | } | 
|  | 79 | return; | 
|  | 80 | } | 
|  | 81 | case BINDER_TYPE_WEAK_HANDLE: { | 
|  | 82 | const wp<IBinder> b = proc->getWeakProxyForHandle(obj.handle); | 
|  | 83 | if (b != NULL) b.get_refs()->incWeak(who); | 
|  | 84 | return; | 
|  | 85 | } | 
|  | 86 | case BINDER_TYPE_FD: { | 
|  | 87 | // intentionally blank -- nothing to do to acquire this, but we do | 
|  | 88 | // recognize it as a legitimate object type. | 
|  | 89 | return; | 
|  | 90 | } | 
|  | 91 | } | 
|  | 92 |  | 
|  | 93 | LOGD("Invalid object type 0x%08lx", obj.type); | 
|  | 94 | } | 
|  | 95 |  | 
|  | 96 | void release_object(const sp<ProcessState>& proc, | 
|  | 97 | const flat_binder_object& obj, const void* who) | 
|  | 98 | { | 
|  | 99 | switch (obj.type) { | 
|  | 100 | case BINDER_TYPE_BINDER: | 
|  | 101 | if (obj.binder) { | 
|  | 102 | LOG_REFS("Parcel %p releasing reference on local %p", who, obj.cookie); | 
|  | 103 | static_cast<IBinder*>(obj.cookie)->decStrong(who); | 
|  | 104 | } | 
|  | 105 | return; | 
|  | 106 | case BINDER_TYPE_WEAK_BINDER: | 
|  | 107 | if (obj.binder) | 
|  | 108 | static_cast<RefBase::weakref_type*>(obj.binder)->decWeak(who); | 
|  | 109 | return; | 
|  | 110 | case BINDER_TYPE_HANDLE: { | 
|  | 111 | const sp<IBinder> b = proc->getStrongProxyForHandle(obj.handle); | 
|  | 112 | if (b != NULL) { | 
|  | 113 | LOG_REFS("Parcel %p releasing reference on remote %p", who, b.get()); | 
|  | 114 | b->decStrong(who); | 
|  | 115 | } | 
|  | 116 | return; | 
|  | 117 | } | 
|  | 118 | case BINDER_TYPE_WEAK_HANDLE: { | 
|  | 119 | const wp<IBinder> b = proc->getWeakProxyForHandle(obj.handle); | 
|  | 120 | if (b != NULL) b.get_refs()->decWeak(who); | 
|  | 121 | return; | 
|  | 122 | } | 
|  | 123 | case BINDER_TYPE_FD: { | 
|  | 124 | if (obj.cookie != (void*)0) close(obj.handle); | 
|  | 125 | return; | 
|  | 126 | } | 
|  | 127 | } | 
|  | 128 |  | 
|  | 129 | LOGE("Invalid object type 0x%08lx", obj.type); | 
|  | 130 | } | 
|  | 131 |  | 
|  | 132 | inline static status_t finish_flatten_binder( | 
|  | 133 | const sp<IBinder>& binder, const flat_binder_object& flat, Parcel* out) | 
|  | 134 | { | 
|  | 135 | return out->writeObject(flat, false); | 
|  | 136 | } | 
|  | 137 |  | 
|  | 138 | status_t flatten_binder(const sp<ProcessState>& proc, | 
|  | 139 | const sp<IBinder>& binder, Parcel* out) | 
|  | 140 | { | 
|  | 141 | flat_binder_object obj; | 
|  | 142 |  | 
|  | 143 | obj.flags = 0x7f | FLAT_BINDER_FLAG_ACCEPTS_FDS; | 
|  | 144 | if (binder != NULL) { | 
|  | 145 | IBinder *local = binder->localBinder(); | 
|  | 146 | if (!local) { | 
|  | 147 | BpBinder *proxy = binder->remoteBinder(); | 
|  | 148 | if (proxy == NULL) { | 
|  | 149 | LOGE("null proxy"); | 
|  | 150 | } | 
|  | 151 | const int32_t handle = proxy ? proxy->handle() : 0; | 
|  | 152 | obj.type = BINDER_TYPE_HANDLE; | 
|  | 153 | obj.handle = handle; | 
|  | 154 | obj.cookie = NULL; | 
|  | 155 | } else { | 
|  | 156 | obj.type = BINDER_TYPE_BINDER; | 
|  | 157 | obj.binder = local->getWeakRefs(); | 
|  | 158 | obj.cookie = local; | 
|  | 159 | } | 
|  | 160 | } else { | 
|  | 161 | obj.type = BINDER_TYPE_BINDER; | 
|  | 162 | obj.binder = NULL; | 
|  | 163 | obj.cookie = NULL; | 
|  | 164 | } | 
|  | 165 |  | 
|  | 166 | return finish_flatten_binder(binder, obj, out); | 
|  | 167 | } | 
|  | 168 |  | 
|  | 169 | status_t flatten_binder(const sp<ProcessState>& proc, | 
|  | 170 | const wp<IBinder>& binder, Parcel* out) | 
|  | 171 | { | 
|  | 172 | flat_binder_object obj; | 
|  | 173 |  | 
|  | 174 | obj.flags = 0x7f | FLAT_BINDER_FLAG_ACCEPTS_FDS; | 
|  | 175 | if (binder != NULL) { | 
|  | 176 | sp<IBinder> real = binder.promote(); | 
|  | 177 | if (real != NULL) { | 
|  | 178 | IBinder *local = real->localBinder(); | 
|  | 179 | if (!local) { | 
|  | 180 | BpBinder *proxy = real->remoteBinder(); | 
|  | 181 | if (proxy == NULL) { | 
|  | 182 | LOGE("null proxy"); | 
|  | 183 | } | 
|  | 184 | const int32_t handle = proxy ? proxy->handle() : 0; | 
|  | 185 | obj.type = BINDER_TYPE_WEAK_HANDLE; | 
|  | 186 | obj.handle = handle; | 
|  | 187 | obj.cookie = NULL; | 
|  | 188 | } else { | 
|  | 189 | obj.type = BINDER_TYPE_WEAK_BINDER; | 
|  | 190 | obj.binder = binder.get_refs(); | 
|  | 191 | obj.cookie = binder.unsafe_get(); | 
|  | 192 | } | 
|  | 193 | return finish_flatten_binder(real, obj, out); | 
|  | 194 | } | 
|  | 195 |  | 
|  | 196 | // XXX How to deal?  In order to flatten the given binder, | 
|  | 197 | // we need to probe it for information, which requires a primary | 
|  | 198 | // reference...  but we don't have one. | 
|  | 199 | // | 
|  | 200 | // The OpenBinder implementation uses a dynamic_cast<> here, | 
|  | 201 | // but we can't do that with the different reference counting | 
|  | 202 | // implementation we are using. | 
|  | 203 | LOGE("Unable to unflatten Binder weak reference!"); | 
|  | 204 | obj.type = BINDER_TYPE_BINDER; | 
|  | 205 | obj.binder = NULL; | 
|  | 206 | obj.cookie = NULL; | 
|  | 207 | return finish_flatten_binder(NULL, obj, out); | 
|  | 208 |  | 
|  | 209 | } else { | 
|  | 210 | obj.type = BINDER_TYPE_BINDER; | 
|  | 211 | obj.binder = NULL; | 
|  | 212 | obj.cookie = NULL; | 
|  | 213 | return finish_flatten_binder(NULL, obj, out); | 
|  | 214 | } | 
|  | 215 | } | 
|  | 216 |  | 
|  | 217 | inline static status_t finish_unflatten_binder( | 
|  | 218 | BpBinder* proxy, const flat_binder_object& flat, const Parcel& in) | 
|  | 219 | { | 
|  | 220 | return NO_ERROR; | 
|  | 221 | } | 
|  | 222 |  | 
|  | 223 | status_t unflatten_binder(const sp<ProcessState>& proc, | 
|  | 224 | const Parcel& in, sp<IBinder>* out) | 
|  | 225 | { | 
|  | 226 | const flat_binder_object* flat = in.readObject(false); | 
|  | 227 |  | 
|  | 228 | if (flat) { | 
|  | 229 | switch (flat->type) { | 
|  | 230 | case BINDER_TYPE_BINDER: | 
|  | 231 | *out = static_cast<IBinder*>(flat->cookie); | 
|  | 232 | return finish_unflatten_binder(NULL, *flat, in); | 
|  | 233 | case BINDER_TYPE_HANDLE: | 
|  | 234 | *out = proc->getStrongProxyForHandle(flat->handle); | 
|  | 235 | return finish_unflatten_binder( | 
|  | 236 | static_cast<BpBinder*>(out->get()), *flat, in); | 
|  | 237 | } | 
|  | 238 | } | 
|  | 239 | return BAD_TYPE; | 
|  | 240 | } | 
|  | 241 |  | 
|  | 242 | status_t unflatten_binder(const sp<ProcessState>& proc, | 
|  | 243 | const Parcel& in, wp<IBinder>* out) | 
|  | 244 | { | 
|  | 245 | const flat_binder_object* flat = in.readObject(false); | 
|  | 246 |  | 
|  | 247 | if (flat) { | 
|  | 248 | switch (flat->type) { | 
|  | 249 | case BINDER_TYPE_BINDER: | 
|  | 250 | *out = static_cast<IBinder*>(flat->cookie); | 
|  | 251 | return finish_unflatten_binder(NULL, *flat, in); | 
|  | 252 | case BINDER_TYPE_WEAK_BINDER: | 
|  | 253 | if (flat->binder != NULL) { | 
|  | 254 | out->set_object_and_refs( | 
|  | 255 | static_cast<IBinder*>(flat->cookie), | 
|  | 256 | static_cast<RefBase::weakref_type*>(flat->binder)); | 
|  | 257 | } else { | 
|  | 258 | *out = NULL; | 
|  | 259 | } | 
|  | 260 | return finish_unflatten_binder(NULL, *flat, in); | 
|  | 261 | case BINDER_TYPE_HANDLE: | 
|  | 262 | case BINDER_TYPE_WEAK_HANDLE: | 
|  | 263 | *out = proc->getWeakProxyForHandle(flat->handle); | 
|  | 264 | return finish_unflatten_binder( | 
|  | 265 | static_cast<BpBinder*>(out->unsafe_get()), *flat, in); | 
|  | 266 | } | 
|  | 267 | } | 
|  | 268 | return BAD_TYPE; | 
|  | 269 | } | 
|  | 270 |  | 
|  | 271 | // --------------------------------------------------------------------------- | 
|  | 272 |  | 
|  | 273 | Parcel::Parcel() | 
|  | 274 | { | 
|  | 275 | initState(); | 
|  | 276 | } | 
|  | 277 |  | 
|  | 278 | Parcel::~Parcel() | 
|  | 279 | { | 
|  | 280 | freeDataNoInit(); | 
|  | 281 | } | 
|  | 282 |  | 
|  | 283 | const uint8_t* Parcel::data() const | 
|  | 284 | { | 
|  | 285 | return mData; | 
|  | 286 | } | 
|  | 287 |  | 
|  | 288 | size_t Parcel::dataSize() const | 
|  | 289 | { | 
|  | 290 | return (mDataSize > mDataPos ? mDataSize : mDataPos); | 
|  | 291 | } | 
|  | 292 |  | 
|  | 293 | size_t Parcel::dataAvail() const | 
|  | 294 | { | 
|  | 295 | // TODO: decide what to do about the possibility that this can | 
|  | 296 | // report an available-data size that exceeds a Java int's max | 
|  | 297 | // positive value, causing havoc.  Fortunately this will only | 
|  | 298 | // happen if someone constructs a Parcel containing more than two | 
|  | 299 | // gigabytes of data, which on typical phone hardware is simply | 
|  | 300 | // not possible. | 
|  | 301 | return dataSize() - dataPosition(); | 
|  | 302 | } | 
|  | 303 |  | 
|  | 304 | size_t Parcel::dataPosition() const | 
|  | 305 | { | 
|  | 306 | return mDataPos; | 
|  | 307 | } | 
|  | 308 |  | 
|  | 309 | size_t Parcel::dataCapacity() const | 
|  | 310 | { | 
|  | 311 | return mDataCapacity; | 
|  | 312 | } | 
|  | 313 |  | 
|  | 314 | status_t Parcel::setDataSize(size_t size) | 
|  | 315 | { | 
|  | 316 | status_t err; | 
|  | 317 | err = continueWrite(size); | 
|  | 318 | if (err == NO_ERROR) { | 
|  | 319 | mDataSize = size; | 
|  | 320 | LOGV("setDataSize Setting data size of %p to %d\n", this, mDataSize); | 
|  | 321 | } | 
|  | 322 | return err; | 
|  | 323 | } | 
|  | 324 |  | 
|  | 325 | void Parcel::setDataPosition(size_t pos) const | 
|  | 326 | { | 
|  | 327 | mDataPos = pos; | 
|  | 328 | mNextObjectHint = 0; | 
|  | 329 | } | 
|  | 330 |  | 
|  | 331 | status_t Parcel::setDataCapacity(size_t size) | 
|  | 332 | { | 
|  | 333 | if (size > mDataSize) return continueWrite(size); | 
|  | 334 | return NO_ERROR; | 
|  | 335 | } | 
|  | 336 |  | 
|  | 337 | status_t Parcel::setData(const uint8_t* buffer, size_t len) | 
|  | 338 | { | 
|  | 339 | status_t err = restartWrite(len); | 
|  | 340 | if (err == NO_ERROR) { | 
|  | 341 | memcpy(const_cast<uint8_t*>(data()), buffer, len); | 
|  | 342 | mDataSize = len; | 
|  | 343 | mFdsKnown = false; | 
|  | 344 | } | 
|  | 345 | return err; | 
|  | 346 | } | 
|  | 347 |  | 
|  | 348 | status_t Parcel::appendFrom(Parcel *parcel, size_t offset, size_t len) | 
|  | 349 | { | 
|  | 350 | const sp<ProcessState> proc(ProcessState::self()); | 
|  | 351 | status_t err; | 
|  | 352 | uint8_t *data = parcel->mData; | 
|  | 353 | size_t *objects = parcel->mObjects; | 
|  | 354 | size_t size = parcel->mObjectsSize; | 
|  | 355 | int startPos = mDataPos; | 
|  | 356 | int firstIndex = -1, lastIndex = -2; | 
|  | 357 |  | 
|  | 358 | if (len == 0) { | 
|  | 359 | return NO_ERROR; | 
|  | 360 | } | 
|  | 361 |  | 
|  | 362 | // range checks against the source parcel size | 
|  | 363 | if ((offset > parcel->mDataSize) | 
|  | 364 | || (len > parcel->mDataSize) | 
|  | 365 | || (offset + len > parcel->mDataSize)) { | 
|  | 366 | return BAD_VALUE; | 
|  | 367 | } | 
|  | 368 |  | 
|  | 369 | // Count objects in range | 
|  | 370 | for (int i = 0; i < (int) size; i++) { | 
|  | 371 | size_t off = objects[i]; | 
|  | 372 | if ((off >= offset) && (off < offset + len)) { | 
|  | 373 | if (firstIndex == -1) { | 
|  | 374 | firstIndex = i; | 
|  | 375 | } | 
|  | 376 | lastIndex = i; | 
|  | 377 | } | 
|  | 378 | } | 
|  | 379 | int numObjects = lastIndex - firstIndex + 1; | 
|  | 380 |  | 
|  | 381 | // grow data | 
|  | 382 | err = growData(len); | 
|  | 383 | if (err != NO_ERROR) { | 
|  | 384 | return err; | 
|  | 385 | } | 
|  | 386 |  | 
|  | 387 | // append data | 
|  | 388 | memcpy(mData + mDataPos, data + offset, len); | 
|  | 389 | mDataPos += len; | 
|  | 390 | mDataSize += len; | 
|  | 391 |  | 
|  | 392 | if (numObjects > 0) { | 
|  | 393 | // grow objects | 
|  | 394 | if (mObjectsCapacity < mObjectsSize + numObjects) { | 
|  | 395 | int newSize = ((mObjectsSize + numObjects)*3)/2; | 
|  | 396 | size_t *objects = | 
|  | 397 | (size_t*)realloc(mObjects, newSize*sizeof(size_t)); | 
|  | 398 | if (objects == (size_t*)0) { | 
|  | 399 | return NO_MEMORY; | 
|  | 400 | } | 
|  | 401 | mObjects = objects; | 
|  | 402 | mObjectsCapacity = newSize; | 
|  | 403 | } | 
|  | 404 |  | 
|  | 405 | // append and acquire objects | 
|  | 406 | int idx = mObjectsSize; | 
|  | 407 | for (int i = firstIndex; i <= lastIndex; i++) { | 
|  | 408 | size_t off = objects[i] - offset + startPos; | 
|  | 409 | mObjects[idx++] = off; | 
|  | 410 | mObjectsSize++; | 
|  | 411 |  | 
|  | 412 | const flat_binder_object* flat | 
|  | 413 | = reinterpret_cast<flat_binder_object*>(mData + off); | 
|  | 414 | acquire_object(proc, *flat, this); | 
|  | 415 |  | 
|  | 416 | // take note if the object is a file descriptor | 
|  | 417 | if (flat->type == BINDER_TYPE_FD) { | 
|  | 418 | mHasFds = mFdsKnown = true; | 
|  | 419 | } | 
|  | 420 | } | 
|  | 421 | } | 
|  | 422 |  | 
|  | 423 | return NO_ERROR; | 
|  | 424 | } | 
|  | 425 |  | 
|  | 426 | bool Parcel::hasFileDescriptors() const | 
|  | 427 | { | 
|  | 428 | if (!mFdsKnown) { | 
|  | 429 | scanForFds(); | 
|  | 430 | } | 
|  | 431 | return mHasFds; | 
|  | 432 | } | 
|  | 433 |  | 
|  | 434 | status_t Parcel::writeInterfaceToken(const String16& interface) | 
|  | 435 | { | 
|  | 436 | // currently the interface identification token is just its name as a string | 
|  | 437 | return writeString16(interface); | 
|  | 438 | } | 
|  | 439 |  | 
|  | 440 | bool Parcel::enforceInterface(const String16& interface) const | 
|  | 441 | { | 
|  | 442 | String16 str = readString16(); | 
|  | 443 | if (str == interface) { | 
|  | 444 | return true; | 
|  | 445 | } else { | 
|  | 446 | LOGW("**** enforceInterface() expected '%s' but read '%s'\n", | 
|  | 447 | String8(interface).string(), String8(str).string()); | 
|  | 448 | return false; | 
|  | 449 | } | 
|  | 450 | } | 
|  | 451 |  | 
|  | 452 | const size_t* Parcel::objects() const | 
|  | 453 | { | 
|  | 454 | return mObjects; | 
|  | 455 | } | 
|  | 456 |  | 
|  | 457 | size_t Parcel::objectsCount() const | 
|  | 458 | { | 
|  | 459 | return mObjectsSize; | 
|  | 460 | } | 
|  | 461 |  | 
|  | 462 | status_t Parcel::errorCheck() const | 
|  | 463 | { | 
|  | 464 | return mError; | 
|  | 465 | } | 
|  | 466 |  | 
|  | 467 | void Parcel::setError(status_t err) | 
|  | 468 | { | 
|  | 469 | mError = err; | 
|  | 470 | } | 
|  | 471 |  | 
|  | 472 | status_t Parcel::finishWrite(size_t len) | 
|  | 473 | { | 
|  | 474 | //printf("Finish write of %d\n", len); | 
|  | 475 | mDataPos += len; | 
|  | 476 | LOGV("finishWrite Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 477 | if (mDataPos > mDataSize) { | 
|  | 478 | mDataSize = mDataPos; | 
|  | 479 | LOGV("finishWrite Setting data size of %p to %d\n", this, mDataSize); | 
|  | 480 | } | 
|  | 481 | //printf("New pos=%d, size=%d\n", mDataPos, mDataSize); | 
|  | 482 | return NO_ERROR; | 
|  | 483 | } | 
|  | 484 |  | 
|  | 485 | status_t Parcel::writeUnpadded(const void* data, size_t len) | 
|  | 486 | { | 
|  | 487 | size_t end = mDataPos + len; | 
|  | 488 | if (end < mDataPos) { | 
|  | 489 | // integer overflow | 
|  | 490 | return BAD_VALUE; | 
|  | 491 | } | 
|  | 492 |  | 
|  | 493 | if (end <= mDataCapacity) { | 
|  | 494 | restart_write: | 
|  | 495 | memcpy(mData+mDataPos, data, len); | 
|  | 496 | return finishWrite(len); | 
|  | 497 | } | 
|  | 498 |  | 
|  | 499 | status_t err = growData(len); | 
|  | 500 | if (err == NO_ERROR) goto restart_write; | 
|  | 501 | return err; | 
|  | 502 | } | 
|  | 503 |  | 
|  | 504 | status_t Parcel::write(const void* data, size_t len) | 
|  | 505 | { | 
|  | 506 | void* const d = writeInplace(len); | 
|  | 507 | if (d) { | 
|  | 508 | memcpy(d, data, len); | 
|  | 509 | return NO_ERROR; | 
|  | 510 | } | 
|  | 511 | return mError; | 
|  | 512 | } | 
|  | 513 |  | 
|  | 514 | void* Parcel::writeInplace(size_t len) | 
|  | 515 | { | 
|  | 516 | const size_t padded = PAD_SIZE(len); | 
|  | 517 |  | 
|  | 518 | // sanity check for integer overflow | 
|  | 519 | if (mDataPos+padded < mDataPos) { | 
|  | 520 | return NULL; | 
|  | 521 | } | 
|  | 522 |  | 
|  | 523 | if ((mDataPos+padded) <= mDataCapacity) { | 
|  | 524 | restart_write: | 
|  | 525 | //printf("Writing %ld bytes, padded to %ld\n", len, padded); | 
|  | 526 | uint8_t* const data = mData+mDataPos; | 
|  | 527 |  | 
|  | 528 | // Need to pad at end? | 
|  | 529 | if (padded != len) { | 
|  | 530 | #if BYTE_ORDER == BIG_ENDIAN | 
|  | 531 | static const uint32_t mask[4] = { | 
|  | 532 | 0x00000000, 0xffffff00, 0xffff0000, 0xff000000 | 
|  | 533 | }; | 
|  | 534 | #endif | 
|  | 535 | #if BYTE_ORDER == LITTLE_ENDIAN | 
|  | 536 | static const uint32_t mask[4] = { | 
|  | 537 | 0x00000000, 0x00ffffff, 0x0000ffff, 0x000000ff | 
|  | 538 | }; | 
|  | 539 | #endif | 
|  | 540 | //printf("Applying pad mask: %p to %p\n", (void*)mask[padded-len], | 
|  | 541 | //    *reinterpret_cast<void**>(data+padded-4)); | 
|  | 542 | *reinterpret_cast<uint32_t*>(data+padded-4) &= mask[padded-len]; | 
|  | 543 | } | 
|  | 544 |  | 
|  | 545 | finishWrite(padded); | 
|  | 546 | return data; | 
|  | 547 | } | 
|  | 548 |  | 
|  | 549 | status_t err = growData(padded); | 
|  | 550 | if (err == NO_ERROR) goto restart_write; | 
|  | 551 | return NULL; | 
|  | 552 | } | 
|  | 553 |  | 
|  | 554 | status_t Parcel::writeInt32(int32_t val) | 
|  | 555 | { | 
|  | 556 | if ((mDataPos+sizeof(val)) <= mDataCapacity) { | 
|  | 557 | restart_write: | 
|  | 558 | *reinterpret_cast<int32_t*>(mData+mDataPos) = val; | 
|  | 559 | return finishWrite(sizeof(val)); | 
|  | 560 | } | 
|  | 561 |  | 
|  | 562 | status_t err = growData(sizeof(val)); | 
|  | 563 | if (err == NO_ERROR) goto restart_write; | 
|  | 564 | return err; | 
|  | 565 | } | 
|  | 566 |  | 
|  | 567 | status_t Parcel::writeInt64(int64_t val) | 
|  | 568 | { | 
|  | 569 | if ((mDataPos+sizeof(val)) <= mDataCapacity) { | 
|  | 570 | restart_write: | 
|  | 571 | *reinterpret_cast<int64_t*>(mData+mDataPos) = val; | 
|  | 572 | return finishWrite(sizeof(val)); | 
|  | 573 | } | 
|  | 574 |  | 
|  | 575 | status_t err = growData(sizeof(val)); | 
|  | 576 | if (err == NO_ERROR) goto restart_write; | 
|  | 577 | return err; | 
|  | 578 | } | 
|  | 579 |  | 
|  | 580 | status_t Parcel::writeFloat(float val) | 
|  | 581 | { | 
|  | 582 | if ((mDataPos+sizeof(val)) <= mDataCapacity) { | 
|  | 583 | restart_write: | 
|  | 584 | *reinterpret_cast<float*>(mData+mDataPos) = val; | 
|  | 585 | return finishWrite(sizeof(val)); | 
|  | 586 | } | 
|  | 587 |  | 
|  | 588 | status_t err = growData(sizeof(val)); | 
|  | 589 | if (err == NO_ERROR) goto restart_write; | 
|  | 590 | return err; | 
|  | 591 | } | 
|  | 592 |  | 
|  | 593 | status_t Parcel::writeDouble(double val) | 
|  | 594 | { | 
|  | 595 | if ((mDataPos+sizeof(val)) <= mDataCapacity) { | 
|  | 596 | restart_write: | 
|  | 597 | *reinterpret_cast<double*>(mData+mDataPos) = val; | 
|  | 598 | return finishWrite(sizeof(val)); | 
|  | 599 | } | 
|  | 600 |  | 
|  | 601 | status_t err = growData(sizeof(val)); | 
|  | 602 | if (err == NO_ERROR) goto restart_write; | 
|  | 603 | return err; | 
|  | 604 | } | 
|  | 605 |  | 
|  | 606 | status_t Parcel::writeCString(const char* str) | 
|  | 607 | { | 
|  | 608 | return write(str, strlen(str)+1); | 
|  | 609 | } | 
|  | 610 |  | 
|  | 611 | status_t Parcel::writeString8(const String8& str) | 
|  | 612 | { | 
|  | 613 | status_t err = writeInt32(str.bytes()); | 
|  | 614 | if (err == NO_ERROR) { | 
|  | 615 | err = write(str.string(), str.bytes()+1); | 
|  | 616 | } | 
|  | 617 | return err; | 
|  | 618 | } | 
|  | 619 |  | 
|  | 620 | status_t Parcel::writeString16(const String16& str) | 
|  | 621 | { | 
|  | 622 | return writeString16(str.string(), str.size()); | 
|  | 623 | } | 
|  | 624 |  | 
|  | 625 | status_t Parcel::writeString16(const char16_t* str, size_t len) | 
|  | 626 | { | 
|  | 627 | if (str == NULL) return writeInt32(-1); | 
|  | 628 |  | 
|  | 629 | status_t err = writeInt32(len); | 
|  | 630 | if (err == NO_ERROR) { | 
|  | 631 | len *= sizeof(char16_t); | 
|  | 632 | uint8_t* data = (uint8_t*)writeInplace(len+sizeof(char16_t)); | 
|  | 633 | if (data) { | 
|  | 634 | memcpy(data, str, len); | 
|  | 635 | *reinterpret_cast<char16_t*>(data+len) = 0; | 
|  | 636 | return NO_ERROR; | 
|  | 637 | } | 
|  | 638 | err = mError; | 
|  | 639 | } | 
|  | 640 | return err; | 
|  | 641 | } | 
|  | 642 |  | 
|  | 643 | status_t Parcel::writeStrongBinder(const sp<IBinder>& val) | 
|  | 644 | { | 
|  | 645 | return flatten_binder(ProcessState::self(), val, this); | 
|  | 646 | } | 
|  | 647 |  | 
|  | 648 | status_t Parcel::writeWeakBinder(const wp<IBinder>& val) | 
|  | 649 | { | 
|  | 650 | return flatten_binder(ProcessState::self(), val, this); | 
|  | 651 | } | 
|  | 652 |  | 
|  | 653 | status_t Parcel::writeNativeHandle(const native_handle& handle) | 
|  | 654 | { | 
|  | 655 | if (handle.version != sizeof(native_handle)) | 
|  | 656 | return BAD_TYPE; | 
|  | 657 |  | 
|  | 658 | status_t err; | 
|  | 659 | err = writeInt32(handle.numFds); | 
|  | 660 | if (err != NO_ERROR) return err; | 
|  | 661 |  | 
|  | 662 | err = writeInt32(handle.numInts); | 
|  | 663 | if (err != NO_ERROR) return err; | 
|  | 664 |  | 
|  | 665 | for (int i=0 ; err==NO_ERROR && i<handle.numFds ; i++) | 
|  | 666 | err = writeDupFileDescriptor(handle.data[i]); | 
|  | 667 |  | 
|  | 668 | if (err != NO_ERROR) { | 
|  | 669 | LOGD("write native handle, write dup fd failed"); | 
|  | 670 | return err; | 
|  | 671 | } | 
|  | 672 |  | 
|  | 673 | err = write(handle.data + handle.numFds, sizeof(int)*handle.numInts); | 
|  | 674 |  | 
|  | 675 | return err; | 
|  | 676 | } | 
|  | 677 |  | 
|  | 678 | status_t Parcel::writeFileDescriptor(int fd) | 
|  | 679 | { | 
|  | 680 | flat_binder_object obj; | 
|  | 681 | obj.type = BINDER_TYPE_FD; | 
|  | 682 | obj.flags = 0x7f | FLAT_BINDER_FLAG_ACCEPTS_FDS; | 
|  | 683 | obj.handle = fd; | 
|  | 684 | obj.cookie = (void*)0; | 
|  | 685 | return writeObject(obj, true); | 
|  | 686 | } | 
|  | 687 |  | 
|  | 688 | status_t Parcel::writeDupFileDescriptor(int fd) | 
|  | 689 | { | 
|  | 690 | flat_binder_object obj; | 
|  | 691 | obj.type = BINDER_TYPE_FD; | 
|  | 692 | obj.flags = 0x7f | FLAT_BINDER_FLAG_ACCEPTS_FDS; | 
|  | 693 | obj.handle = dup(fd); | 
|  | 694 | obj.cookie = (void*)1; | 
|  | 695 | return writeObject(obj, true); | 
|  | 696 | } | 
|  | 697 |  | 
|  | 698 | status_t Parcel::writeObject(const flat_binder_object& val, bool nullMetaData) | 
|  | 699 | { | 
|  | 700 | const bool enoughData = (mDataPos+sizeof(val)) <= mDataCapacity; | 
|  | 701 | const bool enoughObjects = mObjectsSize < mObjectsCapacity; | 
|  | 702 | if (enoughData && enoughObjects) { | 
|  | 703 | restart_write: | 
|  | 704 | *reinterpret_cast<flat_binder_object*>(mData+mDataPos) = val; | 
|  | 705 |  | 
|  | 706 | // Need to write meta-data? | 
|  | 707 | if (nullMetaData || val.binder != NULL) { | 
|  | 708 | mObjects[mObjectsSize] = mDataPos; | 
|  | 709 | acquire_object(ProcessState::self(), val, this); | 
|  | 710 | mObjectsSize++; | 
|  | 711 | } | 
|  | 712 |  | 
|  | 713 | // remember if it's a file descriptor | 
|  | 714 | if (val.type == BINDER_TYPE_FD) { | 
|  | 715 | mHasFds = mFdsKnown = true; | 
|  | 716 | } | 
|  | 717 |  | 
|  | 718 | return finishWrite(sizeof(flat_binder_object)); | 
|  | 719 | } | 
|  | 720 |  | 
|  | 721 | if (!enoughData) { | 
|  | 722 | const status_t err = growData(sizeof(val)); | 
|  | 723 | if (err != NO_ERROR) return err; | 
|  | 724 | } | 
|  | 725 | if (!enoughObjects) { | 
|  | 726 | size_t newSize = ((mObjectsSize+2)*3)/2; | 
|  | 727 | size_t* objects = (size_t*)realloc(mObjects, newSize*sizeof(size_t)); | 
|  | 728 | if (objects == NULL) return NO_MEMORY; | 
|  | 729 | mObjects = objects; | 
|  | 730 | mObjectsCapacity = newSize; | 
|  | 731 | } | 
|  | 732 |  | 
|  | 733 | goto restart_write; | 
|  | 734 | } | 
|  | 735 |  | 
|  | 736 |  | 
|  | 737 | void Parcel::remove(size_t start, size_t amt) | 
|  | 738 | { | 
|  | 739 | LOG_ALWAYS_FATAL("Parcel::remove() not yet implemented!"); | 
|  | 740 | } | 
|  | 741 |  | 
|  | 742 | status_t Parcel::read(void* outData, size_t len) const | 
|  | 743 | { | 
|  | 744 | if ((mDataPos+PAD_SIZE(len)) >= mDataPos && (mDataPos+PAD_SIZE(len)) <= mDataSize) { | 
|  | 745 | memcpy(outData, mData+mDataPos, len); | 
|  | 746 | mDataPos += PAD_SIZE(len); | 
|  | 747 | LOGV("read Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 748 | return NO_ERROR; | 
|  | 749 | } | 
|  | 750 | return NOT_ENOUGH_DATA; | 
|  | 751 | } | 
|  | 752 |  | 
|  | 753 | const void* Parcel::readInplace(size_t len) const | 
|  | 754 | { | 
|  | 755 | if ((mDataPos+PAD_SIZE(len)) >= mDataPos && (mDataPos+PAD_SIZE(len)) <= mDataSize) { | 
|  | 756 | const void* data = mData+mDataPos; | 
|  | 757 | mDataPos += PAD_SIZE(len); | 
|  | 758 | LOGV("readInplace Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 759 | return data; | 
|  | 760 | } | 
|  | 761 | return NULL; | 
|  | 762 | } | 
|  | 763 |  | 
|  | 764 | status_t Parcel::readInt32(int32_t *pArg) const | 
|  | 765 | { | 
|  | 766 | if ((mDataPos+sizeof(int32_t)) <= mDataSize) { | 
|  | 767 | const void* data = mData+mDataPos; | 
|  | 768 | mDataPos += sizeof(int32_t); | 
|  | 769 | *pArg =  *reinterpret_cast<const int32_t*>(data); | 
|  | 770 | return NO_ERROR; | 
|  | 771 | } else { | 
|  | 772 | return NOT_ENOUGH_DATA; | 
|  | 773 | } | 
|  | 774 | } | 
|  | 775 |  | 
|  | 776 | int32_t Parcel::readInt32() const | 
|  | 777 | { | 
|  | 778 | if ((mDataPos+sizeof(int32_t)) <= mDataSize) { | 
|  | 779 | const void* data = mData+mDataPos; | 
|  | 780 | mDataPos += sizeof(int32_t); | 
|  | 781 | LOGV("readInt32 Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 782 | return *reinterpret_cast<const int32_t*>(data); | 
|  | 783 | } | 
|  | 784 | return 0; | 
|  | 785 | } | 
|  | 786 |  | 
|  | 787 |  | 
|  | 788 | status_t Parcel::readInt64(int64_t *pArg) const | 
|  | 789 | { | 
|  | 790 | if ((mDataPos+sizeof(int64_t)) <= mDataSize) { | 
|  | 791 | const void* data = mData+mDataPos; | 
|  | 792 | mDataPos += sizeof(int64_t); | 
|  | 793 | *pArg = *reinterpret_cast<const int64_t*>(data); | 
|  | 794 | LOGV("readInt64 Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 795 | return NO_ERROR; | 
|  | 796 | } else { | 
|  | 797 | return NOT_ENOUGH_DATA; | 
|  | 798 | } | 
|  | 799 | } | 
|  | 800 |  | 
|  | 801 |  | 
|  | 802 | int64_t Parcel::readInt64() const | 
|  | 803 | { | 
|  | 804 | if ((mDataPos+sizeof(int64_t)) <= mDataSize) { | 
|  | 805 | const void* data = mData+mDataPos; | 
|  | 806 | mDataPos += sizeof(int64_t); | 
|  | 807 | LOGV("readInt64 Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 808 | return *reinterpret_cast<const int64_t*>(data); | 
|  | 809 | } | 
|  | 810 | return 0; | 
|  | 811 | } | 
|  | 812 |  | 
|  | 813 | status_t Parcel::readFloat(float *pArg) const | 
|  | 814 | { | 
|  | 815 | if ((mDataPos+sizeof(float)) <= mDataSize) { | 
|  | 816 | const void* data = mData+mDataPos; | 
|  | 817 | mDataPos += sizeof(float); | 
|  | 818 | LOGV("readFloat Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 819 | *pArg = *reinterpret_cast<const float*>(data); | 
|  | 820 | return NO_ERROR; | 
|  | 821 | } else { | 
|  | 822 | return NOT_ENOUGH_DATA; | 
|  | 823 | } | 
|  | 824 | } | 
|  | 825 |  | 
|  | 826 |  | 
|  | 827 | float Parcel::readFloat() const | 
|  | 828 | { | 
|  | 829 | if ((mDataPos+sizeof(float)) <= mDataSize) { | 
|  | 830 | const void* data = mData+mDataPos; | 
|  | 831 | mDataPos += sizeof(float); | 
|  | 832 | LOGV("readFloat Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 833 | return *reinterpret_cast<const float*>(data); | 
|  | 834 | } | 
|  | 835 | return 0; | 
|  | 836 | } | 
|  | 837 |  | 
|  | 838 | status_t Parcel::readDouble(double *pArg) const | 
|  | 839 | { | 
|  | 840 | if ((mDataPos+sizeof(double)) <= mDataSize) { | 
|  | 841 | const void* data = mData+mDataPos; | 
|  | 842 | mDataPos += sizeof(double); | 
|  | 843 | LOGV("readDouble Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 844 | *pArg = *reinterpret_cast<const double*>(data); | 
|  | 845 | return NO_ERROR; | 
|  | 846 | } else { | 
|  | 847 | return NOT_ENOUGH_DATA; | 
|  | 848 | } | 
|  | 849 | } | 
|  | 850 |  | 
|  | 851 |  | 
|  | 852 | double Parcel::readDouble() const | 
|  | 853 | { | 
|  | 854 | if ((mDataPos+sizeof(double)) <= mDataSize) { | 
|  | 855 | const void* data = mData+mDataPos; | 
|  | 856 | mDataPos += sizeof(double); | 
|  | 857 | LOGV("readDouble Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 858 | return *reinterpret_cast<const double*>(data); | 
|  | 859 | } | 
|  | 860 | return 0; | 
|  | 861 | } | 
|  | 862 |  | 
|  | 863 |  | 
|  | 864 | const char* Parcel::readCString() const | 
|  | 865 | { | 
|  | 866 | const size_t avail = mDataSize-mDataPos; | 
|  | 867 | if (avail > 0) { | 
|  | 868 | const char* str = reinterpret_cast<const char*>(mData+mDataPos); | 
|  | 869 | // is the string's trailing NUL within the parcel's valid bounds? | 
|  | 870 | const char* eos = reinterpret_cast<const char*>(memchr(str, 0, avail)); | 
|  | 871 | if (eos) { | 
|  | 872 | const size_t len = eos - str; | 
|  | 873 | mDataPos += PAD_SIZE(len+1); | 
|  | 874 | LOGV("readCString Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 875 | return str; | 
|  | 876 | } | 
|  | 877 | } | 
|  | 878 | return NULL; | 
|  | 879 | } | 
|  | 880 |  | 
|  | 881 | String8 Parcel::readString8() const | 
|  | 882 | { | 
|  | 883 | int32_t size = readInt32(); | 
|  | 884 | // watch for potential int overflow adding 1 for trailing NUL | 
|  | 885 | if (size > 0 && size < INT32_MAX) { | 
|  | 886 | const char* str = (const char*)readInplace(size+1); | 
|  | 887 | if (str) return String8(str, size); | 
|  | 888 | } | 
|  | 889 | return String8(); | 
|  | 890 | } | 
|  | 891 |  | 
|  | 892 | String16 Parcel::readString16() const | 
|  | 893 | { | 
|  | 894 | size_t len; | 
|  | 895 | const char16_t* str = readString16Inplace(&len); | 
|  | 896 | if (str) return String16(str, len); | 
|  | 897 | LOGE("Reading a NULL string not supported here."); | 
|  | 898 | return String16(); | 
|  | 899 | } | 
|  | 900 |  | 
|  | 901 | const char16_t* Parcel::readString16Inplace(size_t* outLen) const | 
|  | 902 | { | 
|  | 903 | int32_t size = readInt32(); | 
|  | 904 | // watch for potential int overflow from size+1 | 
|  | 905 | if (size >= 0 && size < INT32_MAX) { | 
|  | 906 | *outLen = size; | 
|  | 907 | const char16_t* str = (const char16_t*)readInplace((size+1)*sizeof(char16_t)); | 
|  | 908 | if (str != NULL) { | 
|  | 909 | return str; | 
|  | 910 | } | 
|  | 911 | } | 
|  | 912 | *outLen = 0; | 
|  | 913 | return NULL; | 
|  | 914 | } | 
|  | 915 |  | 
|  | 916 | sp<IBinder> Parcel::readStrongBinder() const | 
|  | 917 | { | 
|  | 918 | sp<IBinder> val; | 
|  | 919 | unflatten_binder(ProcessState::self(), *this, &val); | 
|  | 920 | return val; | 
|  | 921 | } | 
|  | 922 |  | 
|  | 923 | wp<IBinder> Parcel::readWeakBinder() const | 
|  | 924 | { | 
|  | 925 | wp<IBinder> val; | 
|  | 926 | unflatten_binder(ProcessState::self(), *this, &val); | 
|  | 927 | return val; | 
|  | 928 | } | 
|  | 929 |  | 
|  | 930 |  | 
|  | 931 | native_handle* Parcel::readNativeHandle(native_handle* (*alloc)(void*, int, int), void* cookie) const | 
|  | 932 | { | 
|  | 933 | int numFds, numInts; | 
|  | 934 | status_t err; | 
|  | 935 | err = readInt32(&numFds); | 
|  | 936 | if (err != NO_ERROR) return 0; | 
|  | 937 | err = readInt32(&numInts); | 
|  | 938 | if (err != NO_ERROR) return 0; | 
|  | 939 |  | 
|  | 940 | native_handle* h; | 
|  | 941 | if (alloc == 0) { | 
|  | 942 | size_t size = sizeof(native_handle) + sizeof(int)*(numFds + numInts); | 
|  | 943 | h = (native_handle*)malloc(size); | 
|  | 944 | h->version = sizeof(native_handle); | 
|  | 945 | h->numFds = numFds; | 
|  | 946 | h->numInts = numInts; | 
|  | 947 | } else { | 
|  | 948 | h = alloc(cookie, numFds, numInts); | 
|  | 949 | if (h->version != sizeof(native_handle)) { | 
|  | 950 | return 0; | 
|  | 951 | } | 
|  | 952 | } | 
|  | 953 |  | 
|  | 954 | for (int i=0 ; err==NO_ERROR && i<numFds ; i++) { | 
|  | 955 | h->data[i] = dup(readFileDescriptor()); | 
|  | 956 | if (h->data[i] < 0) err = BAD_VALUE; | 
|  | 957 | } | 
|  | 958 |  | 
|  | 959 | err = read(h->data + numFds, sizeof(int)*numInts); | 
|  | 960 |  | 
|  | 961 | if (err != NO_ERROR) { | 
|  | 962 | if (alloc == 0) { | 
|  | 963 | free(h); | 
|  | 964 | } | 
|  | 965 | h = 0; | 
|  | 966 | } | 
|  | 967 | return h; | 
|  | 968 | } | 
|  | 969 |  | 
|  | 970 |  | 
|  | 971 | int Parcel::readFileDescriptor() const | 
|  | 972 | { | 
|  | 973 | const flat_binder_object* flat = readObject(true); | 
|  | 974 | if (flat) { | 
|  | 975 | switch (flat->type) { | 
|  | 976 | case BINDER_TYPE_FD: | 
|  | 977 | //LOGI("Returning file descriptor %ld from parcel %p\n", flat->handle, this); | 
|  | 978 | return flat->handle; | 
|  | 979 | } | 
|  | 980 | } | 
|  | 981 | return BAD_TYPE; | 
|  | 982 | } | 
|  | 983 |  | 
|  | 984 | const flat_binder_object* Parcel::readObject(bool nullMetaData) const | 
|  | 985 | { | 
|  | 986 | const size_t DPOS = mDataPos; | 
|  | 987 | if ((DPOS+sizeof(flat_binder_object)) <= mDataSize) { | 
|  | 988 | const flat_binder_object* obj | 
|  | 989 | = reinterpret_cast<const flat_binder_object*>(mData+DPOS); | 
|  | 990 | mDataPos = DPOS + sizeof(flat_binder_object); | 
|  | 991 | if (!nullMetaData && (obj->cookie == NULL && obj->binder == NULL)) { | 
|  | 992 | // When transferring a NULL object, we don't write it into | 
|  | 993 | // the object list, so we don't want to check for it when | 
|  | 994 | // reading. | 
|  | 995 | LOGV("readObject Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 996 | return obj; | 
|  | 997 | } | 
|  | 998 |  | 
|  | 999 | // Ensure that this object is valid... | 
|  | 1000 | size_t* const OBJS = mObjects; | 
|  | 1001 | const size_t N = mObjectsSize; | 
|  | 1002 | size_t opos = mNextObjectHint; | 
|  | 1003 |  | 
|  | 1004 | if (N > 0) { | 
|  | 1005 | LOGV("Parcel %p looking for obj at %d, hint=%d\n", | 
|  | 1006 | this, DPOS, opos); | 
|  | 1007 |  | 
|  | 1008 | // Start at the current hint position, looking for an object at | 
|  | 1009 | // the current data position. | 
|  | 1010 | if (opos < N) { | 
|  | 1011 | while (opos < (N-1) && OBJS[opos] < DPOS) { | 
|  | 1012 | opos++; | 
|  | 1013 | } | 
|  | 1014 | } else { | 
|  | 1015 | opos = N-1; | 
|  | 1016 | } | 
|  | 1017 | if (OBJS[opos] == DPOS) { | 
|  | 1018 | // Found it! | 
|  | 1019 | LOGV("Parcel found obj %d at index %d with forward search", | 
|  | 1020 | this, DPOS, opos); | 
|  | 1021 | mNextObjectHint = opos+1; | 
|  | 1022 | LOGV("readObject Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1023 | return obj; | 
|  | 1024 | } | 
|  | 1025 |  | 
|  | 1026 | // Look backwards for it... | 
|  | 1027 | while (opos > 0 && OBJS[opos] > DPOS) { | 
|  | 1028 | opos--; | 
|  | 1029 | } | 
|  | 1030 | if (OBJS[opos] == DPOS) { | 
|  | 1031 | // Found it! | 
|  | 1032 | LOGV("Parcel found obj %d at index %d with backward search", | 
|  | 1033 | this, DPOS, opos); | 
|  | 1034 | mNextObjectHint = opos+1; | 
|  | 1035 | LOGV("readObject Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1036 | return obj; | 
|  | 1037 | } | 
|  | 1038 | } | 
|  | 1039 | LOGW("Attempt to read object from Parcel %p at offset %d that is not in the object list", | 
|  | 1040 | this, DPOS); | 
|  | 1041 | } | 
|  | 1042 | return NULL; | 
|  | 1043 | } | 
|  | 1044 |  | 
|  | 1045 | void Parcel::closeFileDescriptors() | 
|  | 1046 | { | 
|  | 1047 | size_t i = mObjectsSize; | 
|  | 1048 | if (i > 0) { | 
|  | 1049 | //LOGI("Closing file descriptors for %d objects...", mObjectsSize); | 
|  | 1050 | } | 
|  | 1051 | while (i > 0) { | 
|  | 1052 | i--; | 
|  | 1053 | const flat_binder_object* flat | 
|  | 1054 | = reinterpret_cast<flat_binder_object*>(mData+mObjects[i]); | 
|  | 1055 | if (flat->type == BINDER_TYPE_FD) { | 
|  | 1056 | //LOGI("Closing fd: %ld\n", flat->handle); | 
|  | 1057 | close(flat->handle); | 
|  | 1058 | } | 
|  | 1059 | } | 
|  | 1060 | } | 
|  | 1061 |  | 
|  | 1062 | const uint8_t* Parcel::ipcData() const | 
|  | 1063 | { | 
|  | 1064 | return mData; | 
|  | 1065 | } | 
|  | 1066 |  | 
|  | 1067 | size_t Parcel::ipcDataSize() const | 
|  | 1068 | { | 
|  | 1069 | return (mDataSize > mDataPos ? mDataSize : mDataPos); | 
|  | 1070 | } | 
|  | 1071 |  | 
|  | 1072 | const size_t* Parcel::ipcObjects() const | 
|  | 1073 | { | 
|  | 1074 | return mObjects; | 
|  | 1075 | } | 
|  | 1076 |  | 
|  | 1077 | size_t Parcel::ipcObjectsCount() const | 
|  | 1078 | { | 
|  | 1079 | return mObjectsSize; | 
|  | 1080 | } | 
|  | 1081 |  | 
|  | 1082 | void Parcel::ipcSetDataReference(const uint8_t* data, size_t dataSize, | 
|  | 1083 | const size_t* objects, size_t objectsCount, release_func relFunc, void* relCookie) | 
|  | 1084 | { | 
|  | 1085 | freeDataNoInit(); | 
|  | 1086 | mError = NO_ERROR; | 
|  | 1087 | mData = const_cast<uint8_t*>(data); | 
|  | 1088 | mDataSize = mDataCapacity = dataSize; | 
|  | 1089 | //LOGI("setDataReference Setting data size of %p to %lu (pid=%d)\n", this, mDataSize, getpid()); | 
|  | 1090 | mDataPos = 0; | 
|  | 1091 | LOGV("setDataReference Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1092 | mObjects = const_cast<size_t*>(objects); | 
|  | 1093 | mObjectsSize = mObjectsCapacity = objectsCount; | 
|  | 1094 | mNextObjectHint = 0; | 
|  | 1095 | mOwner = relFunc; | 
|  | 1096 | mOwnerCookie = relCookie; | 
|  | 1097 | scanForFds(); | 
|  | 1098 | } | 
|  | 1099 |  | 
|  | 1100 | void Parcel::print(TextOutput& to, uint32_t flags) const | 
|  | 1101 | { | 
|  | 1102 | to << "Parcel("; | 
|  | 1103 |  | 
|  | 1104 | if (errorCheck() != NO_ERROR) { | 
|  | 1105 | const status_t err = errorCheck(); | 
|  | 1106 | to << "Error: " << (void*)err << " \"" << strerror(-err) << "\""; | 
|  | 1107 | } else if (dataSize() > 0) { | 
|  | 1108 | const uint8_t* DATA = data(); | 
|  | 1109 | to << indent << HexDump(DATA, dataSize()) << dedent; | 
|  | 1110 | const size_t* OBJS = objects(); | 
|  | 1111 | const size_t N = objectsCount(); | 
|  | 1112 | for (size_t i=0; i<N; i++) { | 
|  | 1113 | const flat_binder_object* flat | 
|  | 1114 | = reinterpret_cast<const flat_binder_object*>(DATA+OBJS[i]); | 
|  | 1115 | to << endl << "Object #" << i << " @ " << (void*)OBJS[i] << ": " | 
|  | 1116 | << TypeCode(flat->type & 0x7f7f7f00) | 
|  | 1117 | << " = " << flat->binder; | 
|  | 1118 | } | 
|  | 1119 | } else { | 
|  | 1120 | to << "NULL"; | 
|  | 1121 | } | 
|  | 1122 |  | 
|  | 1123 | to << ")"; | 
|  | 1124 | } | 
|  | 1125 |  | 
|  | 1126 | void Parcel::releaseObjects() | 
|  | 1127 | { | 
|  | 1128 | const sp<ProcessState> proc(ProcessState::self()); | 
|  | 1129 | size_t i = mObjectsSize; | 
|  | 1130 | uint8_t* const data = mData; | 
|  | 1131 | size_t* const objects = mObjects; | 
|  | 1132 | while (i > 0) { | 
|  | 1133 | i--; | 
|  | 1134 | const flat_binder_object* flat | 
|  | 1135 | = reinterpret_cast<flat_binder_object*>(data+objects[i]); | 
|  | 1136 | release_object(proc, *flat, this); | 
|  | 1137 | } | 
|  | 1138 | } | 
|  | 1139 |  | 
|  | 1140 | void Parcel::acquireObjects() | 
|  | 1141 | { | 
|  | 1142 | const sp<ProcessState> proc(ProcessState::self()); | 
|  | 1143 | size_t i = mObjectsSize; | 
|  | 1144 | uint8_t* const data = mData; | 
|  | 1145 | size_t* const objects = mObjects; | 
|  | 1146 | while (i > 0) { | 
|  | 1147 | i--; | 
|  | 1148 | const flat_binder_object* flat | 
|  | 1149 | = reinterpret_cast<flat_binder_object*>(data+objects[i]); | 
|  | 1150 | acquire_object(proc, *flat, this); | 
|  | 1151 | } | 
|  | 1152 | } | 
|  | 1153 |  | 
|  | 1154 | void Parcel::freeData() | 
|  | 1155 | { | 
|  | 1156 | freeDataNoInit(); | 
|  | 1157 | initState(); | 
|  | 1158 | } | 
|  | 1159 |  | 
|  | 1160 | void Parcel::freeDataNoInit() | 
|  | 1161 | { | 
|  | 1162 | if (mOwner) { | 
|  | 1163 | //LOGI("Freeing data ref of %p (pid=%d)\n", this, getpid()); | 
|  | 1164 | mOwner(this, mData, mDataSize, mObjects, mObjectsSize, mOwnerCookie); | 
|  | 1165 | } else { | 
|  | 1166 | releaseObjects(); | 
|  | 1167 | if (mData) free(mData); | 
|  | 1168 | if (mObjects) free(mObjects); | 
|  | 1169 | } | 
|  | 1170 | } | 
|  | 1171 |  | 
|  | 1172 | status_t Parcel::growData(size_t len) | 
|  | 1173 | { | 
|  | 1174 | size_t newSize = ((mDataSize+len)*3)/2; | 
|  | 1175 | return (newSize <= mDataSize) | 
|  | 1176 | ? (status_t) NO_MEMORY | 
|  | 1177 | : continueWrite(newSize); | 
|  | 1178 | } | 
|  | 1179 |  | 
|  | 1180 | status_t Parcel::restartWrite(size_t desired) | 
|  | 1181 | { | 
|  | 1182 | if (mOwner) { | 
|  | 1183 | freeData(); | 
|  | 1184 | return continueWrite(desired); | 
|  | 1185 | } | 
|  | 1186 |  | 
|  | 1187 | uint8_t* data = (uint8_t*)realloc(mData, desired); | 
|  | 1188 | if (!data && desired > mDataCapacity) { | 
|  | 1189 | mError = NO_MEMORY; | 
|  | 1190 | return NO_MEMORY; | 
|  | 1191 | } | 
|  | 1192 |  | 
|  | 1193 | releaseObjects(); | 
|  | 1194 |  | 
|  | 1195 | if (data) { | 
|  | 1196 | mData = data; | 
|  | 1197 | mDataCapacity = desired; | 
|  | 1198 | } | 
|  | 1199 |  | 
|  | 1200 | mDataSize = mDataPos = 0; | 
|  | 1201 | LOGV("restartWrite Setting data size of %p to %d\n", this, mDataSize); | 
|  | 1202 | LOGV("restartWrite Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1203 |  | 
|  | 1204 | free(mObjects); | 
|  | 1205 | mObjects = NULL; | 
|  | 1206 | mObjectsSize = mObjectsCapacity = 0; | 
|  | 1207 | mNextObjectHint = 0; | 
|  | 1208 | mHasFds = false; | 
|  | 1209 | mFdsKnown = true; | 
|  | 1210 |  | 
|  | 1211 | return NO_ERROR; | 
|  | 1212 | } | 
|  | 1213 |  | 
|  | 1214 | status_t Parcel::continueWrite(size_t desired) | 
|  | 1215 | { | 
|  | 1216 | // If shrinking, first adjust for any objects that appear | 
|  | 1217 | // after the new data size. | 
|  | 1218 | size_t objectsSize = mObjectsSize; | 
|  | 1219 | if (desired < mDataSize) { | 
|  | 1220 | if (desired == 0) { | 
|  | 1221 | objectsSize = 0; | 
|  | 1222 | } else { | 
|  | 1223 | while (objectsSize > 0) { | 
|  | 1224 | if (mObjects[objectsSize-1] < desired) | 
|  | 1225 | break; | 
|  | 1226 | objectsSize--; | 
|  | 1227 | } | 
|  | 1228 | } | 
|  | 1229 | } | 
|  | 1230 |  | 
|  | 1231 | if (mOwner) { | 
|  | 1232 | // If the size is going to zero, just release the owner's data. | 
|  | 1233 | if (desired == 0) { | 
|  | 1234 | freeData(); | 
|  | 1235 | return NO_ERROR; | 
|  | 1236 | } | 
|  | 1237 |  | 
|  | 1238 | // If there is a different owner, we need to take | 
|  | 1239 | // posession. | 
|  | 1240 | uint8_t* data = (uint8_t*)malloc(desired); | 
|  | 1241 | if (!data) { | 
|  | 1242 | mError = NO_MEMORY; | 
|  | 1243 | return NO_MEMORY; | 
|  | 1244 | } | 
|  | 1245 | size_t* objects = NULL; | 
|  | 1246 |  | 
|  | 1247 | if (objectsSize) { | 
|  | 1248 | objects = (size_t*)malloc(objectsSize*sizeof(size_t)); | 
|  | 1249 | if (!objects) { | 
|  | 1250 | mError = NO_MEMORY; | 
|  | 1251 | return NO_MEMORY; | 
|  | 1252 | } | 
|  | 1253 |  | 
|  | 1254 | // Little hack to only acquire references on objects | 
|  | 1255 | // we will be keeping. | 
|  | 1256 | size_t oldObjectsSize = mObjectsSize; | 
|  | 1257 | mObjectsSize = objectsSize; | 
|  | 1258 | acquireObjects(); | 
|  | 1259 | mObjectsSize = oldObjectsSize; | 
|  | 1260 | } | 
|  | 1261 |  | 
|  | 1262 | if (mData) { | 
|  | 1263 | memcpy(data, mData, mDataSize < desired ? mDataSize : desired); | 
|  | 1264 | } | 
|  | 1265 | if (objects && mObjects) { | 
|  | 1266 | memcpy(objects, mObjects, objectsSize*sizeof(size_t)); | 
|  | 1267 | } | 
|  | 1268 | //LOGI("Freeing data ref of %p (pid=%d)\n", this, getpid()); | 
|  | 1269 | mOwner(this, mData, mDataSize, mObjects, mObjectsSize, mOwnerCookie); | 
|  | 1270 | mOwner = NULL; | 
|  | 1271 |  | 
|  | 1272 | mData = data; | 
|  | 1273 | mObjects = objects; | 
|  | 1274 | mDataSize = (mDataSize < desired) ? mDataSize : desired; | 
|  | 1275 | LOGV("continueWrite Setting data size of %p to %d\n", this, mDataSize); | 
|  | 1276 | mDataCapacity = desired; | 
|  | 1277 | mObjectsSize = mObjectsCapacity = objectsSize; | 
|  | 1278 | mNextObjectHint = 0; | 
|  | 1279 |  | 
|  | 1280 | } else if (mData) { | 
|  | 1281 | if (objectsSize < mObjectsSize) { | 
|  | 1282 | // Need to release refs on any objects we are dropping. | 
|  | 1283 | const sp<ProcessState> proc(ProcessState::self()); | 
|  | 1284 | for (size_t i=objectsSize; i<mObjectsSize; i++) { | 
|  | 1285 | const flat_binder_object* flat | 
|  | 1286 | = reinterpret_cast<flat_binder_object*>(mData+mObjects[i]); | 
|  | 1287 | if (flat->type == BINDER_TYPE_FD) { | 
|  | 1288 | // will need to rescan because we may have lopped off the only FDs | 
|  | 1289 | mFdsKnown = false; | 
|  | 1290 | } | 
|  | 1291 | release_object(proc, *flat, this); | 
|  | 1292 | } | 
|  | 1293 | size_t* objects = | 
|  | 1294 | (size_t*)realloc(mObjects, objectsSize*sizeof(size_t)); | 
|  | 1295 | if (objects) { | 
|  | 1296 | mObjects = objects; | 
|  | 1297 | } | 
|  | 1298 | mObjectsSize = objectsSize; | 
|  | 1299 | mNextObjectHint = 0; | 
|  | 1300 | } | 
|  | 1301 |  | 
|  | 1302 | // We own the data, so we can just do a realloc(). | 
|  | 1303 | if (desired > mDataCapacity) { | 
|  | 1304 | uint8_t* data = (uint8_t*)realloc(mData, desired); | 
|  | 1305 | if (data) { | 
|  | 1306 | mData = data; | 
|  | 1307 | mDataCapacity = desired; | 
|  | 1308 | } else if (desired > mDataCapacity) { | 
|  | 1309 | mError = NO_MEMORY; | 
|  | 1310 | return NO_MEMORY; | 
|  | 1311 | } | 
|  | 1312 | } else { | 
|  | 1313 | mDataSize = desired; | 
|  | 1314 | LOGV("continueWrite Setting data size of %p to %d\n", this, mDataSize); | 
|  | 1315 | if (mDataPos > desired) { | 
|  | 1316 | mDataPos = desired; | 
|  | 1317 | LOGV("continueWrite Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1318 | } | 
|  | 1319 | } | 
|  | 1320 |  | 
|  | 1321 | } else { | 
|  | 1322 | // This is the first data.  Easy! | 
|  | 1323 | uint8_t* data = (uint8_t*)malloc(desired); | 
|  | 1324 | if (!data) { | 
|  | 1325 | mError = NO_MEMORY; | 
|  | 1326 | return NO_MEMORY; | 
|  | 1327 | } | 
|  | 1328 |  | 
|  | 1329 | if(!(mDataCapacity == 0 && mObjects == NULL | 
|  | 1330 | && mObjectsCapacity == 0)) { | 
|  | 1331 | LOGE("continueWrite: %d/%p/%d/%d", mDataCapacity, mObjects, mObjectsCapacity, desired); | 
|  | 1332 | } | 
|  | 1333 |  | 
|  | 1334 | mData = data; | 
|  | 1335 | mDataSize = mDataPos = 0; | 
|  | 1336 | LOGV("continueWrite Setting data size of %p to %d\n", this, mDataSize); | 
|  | 1337 | LOGV("continueWrite Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1338 | mDataCapacity = desired; | 
|  | 1339 | } | 
|  | 1340 |  | 
|  | 1341 | return NO_ERROR; | 
|  | 1342 | } | 
|  | 1343 |  | 
|  | 1344 | void Parcel::initState() | 
|  | 1345 | { | 
|  | 1346 | mError = NO_ERROR; | 
|  | 1347 | mData = 0; | 
|  | 1348 | mDataSize = 0; | 
|  | 1349 | mDataCapacity = 0; | 
|  | 1350 | mDataPos = 0; | 
|  | 1351 | LOGV("initState Setting data size of %p to %d\n", this, mDataSize); | 
|  | 1352 | LOGV("initState Setting data pos of %p to %d\n", this, mDataPos); | 
|  | 1353 | mObjects = NULL; | 
|  | 1354 | mObjectsSize = 0; | 
|  | 1355 | mObjectsCapacity = 0; | 
|  | 1356 | mNextObjectHint = 0; | 
|  | 1357 | mHasFds = false; | 
|  | 1358 | mFdsKnown = true; | 
|  | 1359 | mOwner = NULL; | 
|  | 1360 | } | 
|  | 1361 |  | 
|  | 1362 | void Parcel::scanForFds() const | 
|  | 1363 | { | 
|  | 1364 | bool hasFds = false; | 
|  | 1365 | for (size_t i=0; i<mObjectsSize; i++) { | 
|  | 1366 | const flat_binder_object* flat | 
|  | 1367 | = reinterpret_cast<const flat_binder_object*>(mData + mObjects[i]); | 
|  | 1368 | if (flat->type == BINDER_TYPE_FD) { | 
|  | 1369 | hasFds = true; | 
|  | 1370 | break; | 
|  | 1371 | } | 
|  | 1372 | } | 
|  | 1373 | mHasFds = hasFds; | 
|  | 1374 | mFdsKnown = true; | 
|  | 1375 | } | 
|  | 1376 |  | 
|  | 1377 | }; // namespace android |