You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
74 lines
2.1 KiB
74 lines
2.1 KiB
4 months ago
|
/*
|
||
|
|
* Copyright (C) 2011 The Android Open Source Project
|
||
|
|
*
|
||
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
|
* you may not use this file except in compliance with the License.
|
||
|
|
* You may obtain a copy of the License at
|
||
|
|
*
|
||
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||
|
|
*
|
||
|
|
* Unless required by applicable law or agreed to in writing, software
|
||
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
|
* See the License for the specific language governing permissions and
|
||
|
|
* limitations under the License.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "dex/primitive.h"
|
||
|
|
|
||
|
|
namespace art {
|
||
|
|
|
||
|
|
static const char* kTypeNames[] = {
|
||
|
|
"PrimNot",
|
||
|
|
"PrimBoolean",
|
||
|
|
"PrimByte",
|
||
|
|
"PrimChar",
|
||
|
|
"PrimShort",
|
||
|
|
"PrimInt",
|
||
|
|
"PrimLong",
|
||
|
|
"PrimFloat",
|
||
|
|
"PrimDouble",
|
||
|
|
"PrimVoid",
|
||
|
|
};
|
||
|
|
|
||
|
|
static const char* kBoxedDescriptors[] = {
|
||
|
|
"Ljava/lang/Object;",
|
||
|
|
"Ljava/lang/Boolean;",
|
||
|
|
"Ljava/lang/Byte;",
|
||
|
|
"Ljava/lang/Character;",
|
||
|
|
"Ljava/lang/Short;",
|
||
|
|
"Ljava/lang/Integer;",
|
||
|
|
"Ljava/lang/Long;",
|
||
|
|
"Ljava/lang/Float;",
|
||
|
|
"Ljava/lang/Double;",
|
||
|
|
"Ljava/lang/Void;",
|
||
|
|
};
|
||
|
|
|
||
|
|
#define COUNT_OF(x) (sizeof(x) / sizeof((x)[0]))
|
||
|
|
|
||
|
|
const char* Primitive::PrettyDescriptor(Primitive::Type type) {
|
||
|
|
static_assert(COUNT_OF(kTypeNames) == static_cast<size_t>(Primitive::kPrimLast) + 1,
|
||
|
|
"Missing element");
|
||
|
|
CHECK(Primitive::kPrimNot <= type && type <= Primitive::kPrimVoid) << static_cast<int>(type);
|
||
|
|
return kTypeNames[type];
|
||
|
|
}
|
||
|
|
|
||
|
|
const char* Primitive::BoxedDescriptor(Primitive::Type type) {
|
||
|
|
static_assert(COUNT_OF(kBoxedDescriptors) == static_cast<size_t>(Primitive::kPrimLast) + 1,
|
||
|
|
"Missing element");
|
||
|
|
CHECK(Primitive::kPrimNot <= type && type <= Primitive::kPrimVoid) << static_cast<int>(type);
|
||
|
|
return kBoxedDescriptors[type];
|
||
|
|
}
|
||
|
|
|
||
|
|
std::ostream& operator<<(std::ostream& os, Primitive::Type type) {
|
||
|
|
uint32_t int_type = static_cast<uint32_t>(type);
|
||
|
|
if (type <= Primitive::kPrimLast) {
|
||
|
|
os << kTypeNames[int_type];
|
||
|
|
} else {
|
||
|
|
os << "Type[" << int_type << "]";
|
||
|
|
}
|
||
|
|
return os;
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace art
|