Home | History | Annotate | Download | only in src

Lines Matching refs:Code

6 //     * Redistributions of source code must retain the above copyright
32 // code. gcc is not happy when attempting to inline too deep.
612 TYPE_CHECKER(Code, CODE_TYPE)
1068 // CAUTION: The original code below:
2154 CAST_ACCESSOR(Code)
2772 return reinterpret_cast<Code*>(this)->CodeSize();
2924 Code::Flags Code::flags() {
2929 void Code::set_flags(Code::Flags flags) {
2930 STATIC_ASSERT(Code::NUMBER_OF_KINDS <= KindField::kMax + 1);
2939 Code::Kind Code::kind() {
2944 InlineCacheState Code::ic_state() {
2946 // Only allow uninitialized or debugger states for non-IC code
2948 // a call to code object has been replaced with a debug break call.
2957 Code::ExtraICState Code::extra_ic_state() {
2963 PropertyType Code::type() {
2968 int Code::arguments_count() {
2974 int Code::major_key() {
2984 void Code::set_major_key(int major) {
2995 bool Code::is_pregenerated() {
3000 void Code::set_is_pregenerated(bool value) {
3008 bool Code::optimizable() {
3014 void Code::set_optimizable(bool value) {
3020 bool Code::has_deoptimization_support() {
3027 void Code::set_has_deoptimization_support(bool value) {
3035 bool Code::has_debug_break_slots() {
3042 void Code::set_has_debug_break_slots(bool value) {
3050 bool Code::is_compiled_optimizable() {
3057 void Code::set_compiled_optimizable(bool value) {
3065 bool Code::has_self_optimization_header() {
3072 void Code::set_self_optimization_header(bool value) {
3080 int Code::allow_osr_at_loop_nesting_level() {
3086 void Code::set_allow_osr_at_loop_nesting_level(int level) {
3093 int Code::profiler_ticks() {
3099 void Code::set_profiler_ticks(int ticks) {
3106 unsigned Code::stack_slots() {
3112 void Code::set_stack_slots(unsigned slots) {
3118 unsigned Code::safepoint_table_offset() {
3124 void Code::set_safepoint_table_offset(unsigned offset) {
3131 unsigned Code::stack_check_table_offset() {
3137 void Code::set_stack_check_table_offset(unsigned offset) {
3144 CheckType Code::check_type() {
3151 void Code::set_check_type(CheckType value) {
3157 byte Code::unary_op_type() {
3163 void Code::set_unary_op_type(byte value) {
3169 byte Code::binary_op_type() {
3175 void Code::set_binary_op_type(byte value) {
3181 byte Code::binary_op_result_type() {
3187 void Code::set_binary_op_result_type(byte value) {
3193 byte Code::compare_state() {
3199 void Code::set_compare_state(byte value) {
3205 byte Code::to_boolean_state() {
3211 void Code::set_to_boolean_state(byte value) {
3217 bool Code::has_function_cache() {
3223 void Code::set_has_function_cache(bool flag) {
3229 bool Code::is_inline_cache_stub() {
3235 Code::Flags Code::ComputeFlags(Kind kind,
3258 Code::Flags Code::ComputeMonomorphicFlags(Kind kind,
3267 Code::Kind Code::ExtractKindFromFlags(Flags flags) {
3272 InlineCacheState Code::ExtractICStateFromFlags(Flags flags) {
3277 Code::ExtraICState Code::ExtractExtraICStateFromFlags(Flags flags) {
3282 PropertyType Code::ExtractTypeFromFlags(Flags flags) {
3287 int Code::ExtractArgumentsCountFromFlags(Flags flags) {
3292 InlineCacheHolderFlag Code::ExtractCacheHolderFromFlags(Flags flags) {
3297 Code::Flags Code::RemoveTypeFromFlags(Flags flags) {
3303 Code* Code::GetCodeFromTargetAddress(Address address) {
3304 HeapObject* code = HeapObject::FromAddress(address - Code::kHeaderSize);
3307 // Code::cast. Code::cast does not work when the object's map is
3309 Code* result = reinterpret_cast<Code*>(code);
3314 Object* Code::GetObjectFromEntryAddress(Address location_of_address) {
3316 FromAddress(Memory::Address_at(location_of_address) - Code::kHeaderSize);
3504 ACCESSORS(DebugInfo, original_code, Code, kOriginalCodeIndex)
3505 ACCESSORS(DebugInfo, code, Code, kPatchedCodeIndex)
3515 ACCESSORS(SharedFunctionInfo, construct_stub, Code, kConstructStubOffset)
3664 // If disabling optimizations we reflect that in the code object so
3665 // it will not be counted as optimizable code.
3666 if ((code()->kind() == Code::FUNCTION) && disable) {
3667 code()->set_optimizable(false);
3736 ASSERT(code()->kind() == Code::BUILTIN);
3752 Code* SharedFunctionInfo::code() {
3753 return Code::cast(READ_FIELD(this, kCodeOffset));
3757 Code* SharedFunctionInfo::unchecked_code() {
3758 return reinterpret_cast<Code*>(READ_FIELD(this, kCodeOffset));
3762 void SharedFunctionInfo::set_code(Code* value, WriteBarrierMode mode) {
3785 return code() !=
3824 Code* code = this->code();
3825 return code->kind() == Code::FUNCTION && code->has_deoptimization_support();
3841 return code()->kind() == Code::OPTIMIZED_FUNCTION;
3846 return code()->kind() == Code::FUNCTION && code()->optimizable();
3851 return code() == GetIsolate()->builtins()->builtin(Builtins::kLazyRecompile);
3855 Code* JSFunction::code() {
3856 return Code::cast(unchecked_code());
3860 Code* JSFunction::unchecked_code() {
3861 return reinterpret_cast<Code*>(
3862 Code::GetObjectFromEntryAddress(FIELD_ADDR(this, kCodeEntryOffset)));
3866 void JSFunction::set_code(Code* value) {
3877 void JSFunction::ReplaceCode(Code* code) {
3879 bool is_optimized = code->kind() == Code::OPTIMIZED_FUNCTION;
3881 set_code(code);
4002 return code() != GetIsolate()->builtins()->builtin(Builtins::kLazyCompile);
4054 Code* JSBuiltinsObject::javascript_builtin_code(Builtins::JavaScript id) {
4056 return Code::cast(READ_FIELD(this, OffsetOfCodeWithId(id)));
4061 Code* value) {
4142 INT_ACCESSORS(Code, instruction_size, kInstructionSizeOffset)
4143 ACCESSORS(Code, relocation_info, ByteArray, kRelocationInfoOffset)
4144 ACCESSORS(Code, handler_table, FixedArray, kHandlerTableOffset)
4145 ACCESSORS(Code, deoptimization_data, FixedArray, kDeoptimizationDataOffset)
4146 ACCESSORS(Code, type_feedback_info, Object, kTypeFeedbackInfoOffset)
4147 ACCESSORS(Code, gc_metadata, Object, kGCMetadataOffset)
4148 INT_ACCESSORS(Code, ic_age, kICAgeOffset)
4150 byte* Code::instruction_start() {
4155 byte* Code::instruction_end() {
4160 int Code::body_size() {
4165 FixedArray* Code::unchecked_deoptimization_data() {
4171 ByteArray* Code::unchecked_relocation_info() {
4176 byte* Code::relocation_start() {
4181 int Code::relocation_size() {
4186 byte* Code::entry() {
4191 bool Code::contains(byte* inner_pointer) {
4420 // Fast case: has hash code already been computed?
4423 // Slow case: compute hash code and set it.