Snap for 6680390 from add3b3a137
to rvc-release
Change-Id: I8b05f49b34f8d9f028ac41ee5b6cedf14a64ba76
This commit is contained in:
commit
6072de17cd
|
@ -96,6 +96,8 @@ cc_defaults {
|
|||
cc_library {
|
||||
name: "libbacktrace",
|
||||
vendor_available: false,
|
||||
// TODO(b/153609531): remove when no longer needed.
|
||||
native_bridge_supported: true,
|
||||
recovery_available: true,
|
||||
apex_available: [
|
||||
"//apex_available:platform",
|
||||
|
@ -120,6 +122,9 @@ cc_library {
|
|||
recovery: {
|
||||
cflags: ["-DNO_LIBDEXFILE_SUPPORT"],
|
||||
},
|
||||
native_bridge: {
|
||||
cflags: ["-DNO_LIBDEXFILE_SUPPORT"],
|
||||
},
|
||||
},
|
||||
}
|
||||
|
||||
|
|
|
@ -27,6 +27,8 @@ cc_library {
|
|||
name: "libprocinfo",
|
||||
defaults: ["libprocinfo_defaults"],
|
||||
vendor_available: true,
|
||||
// TODO(b/153609531): remove when no longer needed.
|
||||
native_bridge_supported: true,
|
||||
recovery_available: true,
|
||||
vndk: {
|
||||
enabled: true,
|
||||
|
|
|
@ -113,6 +113,8 @@ cc_library {
|
|||
name: "libunwindstack",
|
||||
vendor_available: true,
|
||||
recovery_available: true,
|
||||
// TODO(b/153609531): remove when no longer needed.
|
||||
native_bridge_supported: true,
|
||||
vndk: {
|
||||
enabled: true,
|
||||
support_system_process: true,
|
||||
|
@ -134,6 +136,11 @@ cc_library {
|
|||
exclude_srcs: ["DexFile.cpp"],
|
||||
exclude_shared_libs: ["libdexfile_support"],
|
||||
},
|
||||
native_bridge: {
|
||||
cflags: ["-UDEXFILE_SUPPORT"],
|
||||
exclude_srcs: ["DexFile.cpp"],
|
||||
exclude_shared_libs: ["libdexfile_support"],
|
||||
},
|
||||
},
|
||||
|
||||
apex_available: [
|
||||
|
|
|
@ -175,6 +175,8 @@ cc_library {
|
|||
cc_library {
|
||||
name: "libutilscallstack",
|
||||
defaults: ["libutils_defaults"],
|
||||
// TODO(b/153609531): remove when no longer needed.
|
||||
native_bridge_supported: true,
|
||||
|
||||
srcs: [
|
||||
"CallStack.cpp",
|
||||
|
|
|
@ -454,7 +454,7 @@ status_t String16::remove(size_t len, size_t begin)
|
|||
mString = getEmptyString();
|
||||
return OK;
|
||||
}
|
||||
if ((begin+len) > N) len = N-begin;
|
||||
if (len > N || len > N - begin) len = N - begin;
|
||||
if (begin == 0 && len == N) {
|
||||
return OK;
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue