/*
* Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013
* Jonathan Schleifer <js@webkeks.org>
*
* All rights reserved.
*
* This file is part of ObjFW. It may be distributed under the terms of the
* Q Public License 1.0, which can be found in the file LICENSE.QPL included in
* the packaging of this file.
*
* Alternatively, it may be distributed under the terms of the GNU General
* Public License, either version 2 or 3, which can be found in the file
* LICENSE.GPLv2 or LICENSE.GPLv3 respectively included in the packaging of this
* file.
*/
#include "config.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#import "runtime.h"
#import "runtime-private.h"
struct sparsearray {
void *next[256];
};
static struct objc_hashtable *classes = NULL;
static Class *load_queue = NULL;
static size_t load_queue_cnt = 0;
static struct objc_sparsearray *empty_dtable = NULL;
static unsigned lookups_till_fast_path = 128;
static struct sparsearray *sparsearray = NULL;
static void
register_class(struct objc_abi_class *cls)
{
if (classes == NULL)
classes = objc_hashtable_new(2);
objc_hashtable_set(classes, cls->name, cls);
if (empty_dtable == NULL)
empty_dtable = objc_sparsearray_new();
cls->dtable = empty_dtable;
cls->metaclass->dtable = empty_dtable;
}
BOOL
class_registerAlias_np(Class cls, const char *name)
{
if (classes == NULL)
return NO;
objc_hashtable_set(classes, name, (Class)((uintptr_t)cls | 1));
return YES;
}
static void
register_selectors(struct objc_abi_class *cls)
{
struct objc_abi_method_list *ml;
unsigned int i;
for (ml = cls->methodlist; ml != NULL; ml = ml->next)
for (i = 0; i < ml->count; i++)
objc_register_selector(
(struct objc_abi_selector*)&ml->methods[i]);
}
inline Class
objc_classname_to_class(const char *name, bool cache)
{
Class c;
if (classes == NULL)
return Nil;
/*
* Fast path
*
* Instead of looking up the string in a dictionary, which needs
* locking, we use a sparse array to look up the pointer. If
* objc_classname_to_class() gets called a lot, it is most likely that
* the GCC ABI is used, which always calls into objc_lookup_class(), or
* that it is used in a loop by the user. In both cases, it is very
* likely that the same string pointer is passed again and again.
*
* This is not used before objc_classname_to_class() has been called a
* certain amount of times, so that no memory is wasted if it is only
* used rarely, for example if the ObjFW ABI is used and the user does
* not call it in a loop.
*
* Runtime internal usage does not use the fast path and does not count
* as a call into objc_classname_to_class(). The reason for this is
* that if the runtime calls into objc_classname_to_class(), it already
* has the lock and thus the performance gain would be small, but it
* would waste memory.
*/
if (cache && sparsearray != NULL) {
uintptr_t clsidx = (uintptr_t)name;
struct sparsearray *iter = sparsearray;
uint_fast8_t i;
for (i = 0; i < sizeof(uintptr_t) - 1; i++) {
uintptr_t idx = (clsidx >>
((sizeof(uintptr_t) - i - 1) * 8)) & 0xFF;
if ((iter = iter->next[idx]) == NULL)
break;
}
if (iter != NULL && (c = iter->next[clsidx & 0xFF]) != Nil)
return c;
}
objc_global_mutex_lock();
c = (Class)((uintptr_t)objc_hashtable_get(classes, name) & ~1);
if (cache && sparsearray == NULL && --lookups_till_fast_path == 0)
if ((sparsearray = calloc(1,
sizeof(struct sparsearray))) == NULL)
OBJC_ERROR("Failed to allocate memory for class lookup "
"fast path!");
if (cache && sparsearray != NULL) {
uintptr_t clsidx = (uintptr_t)name;
struct sparsearray *iter = sparsearray;
uint_fast8_t i;
for (i = 0; i < sizeof(uintptr_t) - 1; i++) {
uintptr_t idx = (clsidx >>
((sizeof(uintptr_t) - i - 1) * 8)) & 0xFF;
if (iter->next[idx] == NULL)
if ((iter->next[idx] = calloc(1,
sizeof(struct sparsearray))) == NULL)
OBJC_ERROR("Failed to allocate memory "
"for class lookup fast path!");
iter = iter->next[idx];
}
iter->next[clsidx & 0xFF] = c;
}
objc_global_mutex_unlock();
return c;
}
static void
call_method(Class cls, const char *method)
{
struct objc_method_list *ml;
SEL selector;
unsigned int i;
selector = sel_registerName(method);
for (ml = cls->isa->methodlist; ml != NULL; ml = ml->next)
for (i = 0; i < ml->count; i++)
if (sel_isEqual((SEL)&ml->methods[i].sel, selector))
((void(*)(id, SEL))ml->methods[i].imp)(cls,
selector);
}
static bool
has_load(Class cls)
{
struct objc_method_list *ml;
SEL selector;
unsigned int i;
selector = sel_registerName("load");
for (ml = cls->isa->methodlist; ml != NULL; ml = ml->next)
for (i = 0; i < ml->count; i++)
if (sel_isEqual((SEL)&ml->methods[i].sel, selector))
return true;
return false;
}
static void
call_load(Class cls)
{
if (cls->info & OBJC_CLASS_INFO_LOADED)
return;
if (cls->superclass != Nil)
call_load(cls->superclass);
call_method(cls, "load");
cls->info |= OBJC_CLASS_INFO_LOADED;
}
void
objc_update_dtable(Class cls)
{
struct objc_method_list *ml;
struct objc_category **cats;
unsigned int i;
if (!(cls->info & OBJC_CLASS_INFO_DTABLE))
return;
if (cls->dtable == empty_dtable)
cls->dtable = objc_sparsearray_new();
if (cls->superclass != Nil)
objc_sparsearray_copy(cls->dtable, cls->superclass->dtable);
for (ml = cls->methodlist; ml != NULL; ml = ml->next)
for (i = 0; i < ml->count; i++)
objc_sparsearray_set(cls->dtable,
(uint32_t)ml->methods[i].sel.uid,
ml->methods[i].imp);
if ((cats = objc_categories_for_class(cls)) != NULL) {
for (i = 0; cats[i] != NULL; i++) {
unsigned int j;
ml = (cls->info & OBJC_CLASS_INFO_CLASS ?
cats[i]->instance_methods : cats[i]->class_methods);
for (; ml != NULL; ml = ml->next)
for (j = 0; j < ml->count; j++)
objc_sparsearray_set(cls->dtable,
(uint32_t)ml->methods[j].sel.uid,
ml->methods[j].imp);
}
}
if (cls->subclass_list != NULL)
for (i = 0; cls->subclass_list[i] != NULL; i++)
objc_update_dtable(cls->subclass_list[i]);
}
static void
add_subclass(Class cls)
{
size_t i;
if (cls->superclass->subclass_list == NULL) {
if ((cls->superclass->subclass_list =
malloc(2 * sizeof(Class))) == NULL)
OBJC_ERROR("Not enough memory for subclass list of "
"class %s!", cls->superclass->name);
cls->superclass->subclass_list[0] = cls;
cls->superclass->subclass_list[1] = Nil;
return;
}
for (i = 0; cls->superclass->subclass_list[i] != Nil; i++);
cls->superclass->subclass_list =
realloc(cls->superclass->subclass_list, (i + 2) * sizeof(Class));
if (cls->superclass->subclass_list == NULL)
OBJC_ERROR("Not enough memory for subclass list of class %s\n",
cls->superclass->name);
cls->superclass->subclass_list[i] = cls;
cls->superclass->subclass_list[i + 1] = Nil;
}
static void
update_ivar_offsets(Class cls)
{
unsigned i;
if (!(cls->info & OBJC_CLASS_INFO_NEW_ABI))
return;
if (cls->instance_size > 0)
return;
cls->instance_size = -cls->instance_size;
if (cls->superclass != Nil) {
cls->instance_size += cls->superclass->instance_size;
if (cls->ivars != NULL) {
for (i = 0; i < cls->ivars->count; i++) {
cls->ivars->ivars[i].offset +=
cls->superclass->instance_size;
*cls->ivar_offsets[i] =
cls->ivars->ivars[i].offset;
}
}
} else
for (i = 0; i < cls->ivars->count; i++)
*cls->ivar_offsets[i] = cls->ivars->ivars[i].offset;
}
static void
setup_class(Class cls)
{
const char *superclass;
if (cls->info & OBJC_CLASS_INFO_SETUP)
return;
if ((superclass = ((struct objc_abi_class*)cls)->superclass) != NULL) {
Class super = objc_classname_to_class(superclass, false);
if (super == nil)
return;
setup_class(super);
if (!(super->info & OBJC_CLASS_INFO_SETUP))
return;
cls->superclass = super;
cls->isa->superclass = super->isa;
add_subclass(cls);
add_subclass(cls->isa);
} else
cls->isa->superclass = cls;
update_ivar_offsets(cls);
cls->info |= OBJC_CLASS_INFO_SETUP;
cls->isa->info |= OBJC_CLASS_INFO_SETUP;
}
static void
initialize_class(Class cls)
{
if (cls->info & OBJC_CLASS_INFO_INITIALIZED)
return;
if (cls->superclass)
initialize_class(cls->superclass);
cls->info |= OBJC_CLASS_INFO_DTABLE;
cls->isa->info |= OBJC_CLASS_INFO_DTABLE;
objc_update_dtable(cls);
objc_update_dtable(cls->isa);
/*
* Set it first to prevent calling it recursively due to message sends
* in the initialize method
*/
cls->info |= OBJC_CLASS_INFO_INITIALIZED;
cls->isa->info |= OBJC_CLASS_INFO_INITIALIZED;
call_method(cls, "initialize");
}
void
objc_initialize_class(Class cls)
{
if (cls->info & OBJC_CLASS_INFO_INITIALIZED)
return;
objc_global_mutex_lock();
/*
* It's possible that two threads try to initialize a class at the same
* time. Make sure that the thread which held the lock did not already
* initialize it.
*/
if (cls->info & OBJC_CLASS_INFO_INITIALIZED) {
objc_global_mutex_unlock();
return;
}
setup_class(cls);
if (!(cls->info & OBJC_CLASS_INFO_SETUP)) {
objc_global_mutex_unlock();
return;
}
initialize_class(cls);
objc_global_mutex_unlock();
}
void
objc_register_all_classes(struct objc_abi_symtab *symtab)
{
uint_fast32_t i;
for (i = 0; i < symtab->cls_def_cnt; i++) {
struct objc_abi_class *cls =
(struct objc_abi_class*)symtab->defs[i];
register_class(cls);
register_selectors(cls);
register_selectors(cls->metaclass);
}
for (i = 0; i < symtab->cls_def_cnt; i++) {
Class cls = (Class)symtab->defs[i];
if (has_load(cls)) {
setup_class(cls);
if (cls->info & OBJC_CLASS_INFO_SETUP)
call_load(cls);
else {
load_queue = realloc(load_queue,
sizeof(Class) * (load_queue_cnt + 1));
if (load_queue == NULL)
OBJC_ERROR("Not enough memory for load "
"queue!");
load_queue[load_queue_cnt++] = cls;
}
} else
cls->info |= OBJC_CLASS_INFO_LOADED;
}
/* Process load queue */
for (i = 0; i < load_queue_cnt; i++) {
setup_class(load_queue[i]);
if (load_queue[i]->info & OBJC_CLASS_INFO_SETUP) {
call_load(load_queue[i]);
load_queue_cnt--;
if (load_queue_cnt == 0) {
free(load_queue);
load_queue = NULL;
continue;
}
load_queue[i] = load_queue[load_queue_cnt];
load_queue = realloc(load_queue,
sizeof(Class) * load_queue_cnt);
if (load_queue == NULL)
OBJC_ERROR("Not enough memory for load queue!");
}
}
}
id
objc_lookUpClass(const char *name)
{
Class cls;
if ((cls = objc_classname_to_class(name, true)) == NULL)
return Nil;
if (cls->info & OBJC_CLASS_INFO_SETUP)
return cls;
objc_global_mutex_lock();
setup_class(cls);
objc_global_mutex_unlock();
if (!(cls->info & OBJC_CLASS_INFO_SETUP))
return Nil;
return cls;
}
id
objc_getClass(const char *name)
{
return objc_lookUpClass(name);
}
id
objc_getRequiredClass(const char *name)
{
Class cls;
if ((cls = objc_getClass(name)) == Nil)
OBJC_ERROR("Class %s not found!", name);
return cls;
}
Class
objc_lookup_class(const char *name)
{
return objc_getClass(name);
}
Class
objc_get_class(const char *name)
{
return objc_getRequiredClass(name);
}
bool
class_isMetaClass(Class cls)
{
return (cls->info & OBJC_CLASS_INFO_METACLASS);
}
const char*
class_getName(Class cls)
{
return cls->name;
}
Class
class_getSuperclass(Class cls)
{
return cls->superclass;
}
bool
class_isKindOfClass(Class cls1, Class cls2)
{
Class iter;
for (iter = cls1; iter != Nil; iter = iter->superclass)
if (iter == cls2)
return true;
return false;
}
unsigned long
class_getInstanceSize(Class cls)
{
return cls->instance_size;
}
IMP
class_getMethodImplementation(Class cls, SEL sel)
{
return objc_sparsearray_get(cls->dtable, (uint32_t)sel->uid);
}
const char*
objc_get_type_encoding(Class cls, SEL sel)
{
struct objc_method_list *ml;
struct objc_category **cats;
unsigned int i;
objc_global_mutex_lock();
for (ml = cls->methodlist; ml != NULL; ml = ml->next) {
for (i = 0; i < ml->count; i++) {
if (sel_isEqual((SEL)&ml->methods[i].sel, sel)) {
const char *ret = ml->methods[i].sel.types;
objc_global_mutex_unlock();
return ret;
}
}
}
if ((cats = objc_categories_for_class(cls)) != NULL) {
for (; *cats != NULL; cats++) {
for (ml = (*cats)->instance_methods; ml != NULL;
ml = ml->next) {
for (i = 0; i < ml->count; i++) {
if (ml->methods[i].sel.uid ==
sel->uid) {
const char *ret =
ml->methods[i].sel.types;
objc_global_mutex_unlock();
return ret;
}
}
}
}
}
objc_global_mutex_unlock();
if (cls->superclass != NULL)
return objc_get_type_encoding(cls->superclass, sel);
return NULL;
}
IMP
class_replaceMethod(Class cls, SEL sel, IMP newimp, const char *types)
{
struct objc_method_list *ml;
struct objc_category **cats;
unsigned int i;
IMP oldimp;
objc_global_mutex_lock();
for (ml = cls->methodlist; ml != NULL; ml = ml->next) {
for (i = 0; i < ml->count; i++) {
if (ml->methods[i].sel.uid == sel->uid) {
oldimp = ml->methods[i].imp;
ml->methods[i].imp = newimp;
objc_update_dtable(cls);
objc_global_mutex_unlock();
return oldimp;
}
}
}
if ((cats = objc_categories_for_class(cls)) != NULL) {
for (; *cats != NULL; cats++) {
if (cls->info & OBJC_CLASS_INFO_METACLASS)
ml = (*cats)->class_methods;
else
ml = (*cats)->instance_methods;
for (; ml != NULL; ml = ml->next) {
for (i = 0; i < ml->count; i++) {
if (ml->methods[i].sel.uid ==
sel->uid) {
oldimp = ml->methods[i].imp;
ml->methods[i].imp = newimp;
objc_update_dtable(cls);
objc_global_mutex_unlock();
return oldimp;
}
}
}
}
}
/* FIXME: We need a way to free this at objc_exit() */
if ((ml = malloc(sizeof(struct objc_method_list))) == NULL)
OBJC_ERROR("Not enough memory to replace method!");
ml->next = cls->methodlist;
ml->count = 1;
ml->methods[0].sel.uid = sel->uid;
ml->methods[0].sel.types = types;
ml->methods[0].imp = newimp;
cls->methodlist = ml;
objc_update_dtable(cls);
objc_global_mutex_unlock();
return (IMP)nil;
}
Class
object_getClass(id obj_)
{
struct objc_object *obj = (struct objc_object*)obj_;
return obj->isa;
}
Class
object_setClass(id obj_, Class cls)
{
struct objc_object *obj = (struct objc_object*)obj_;
Class old;
old = obj->isa;
obj->isa = cls;
return old;
}
const char*
object_getClassName(id obj)
{
return object_getClass(obj)->name;
}
void
objc_free_class(Class rcls)
{
struct objc_abi_class *cls = (struct objc_abi_class*)rcls;
if (rcls->subclass_list != NULL) {
free(rcls->subclass_list);
rcls->subclass_list = NULL;
}
if (rcls->dtable != NULL && rcls->dtable != empty_dtable)
objc_sparsearray_free(rcls->dtable);
rcls->dtable = NULL;
if (rcls->superclass != Nil)
cls->superclass = rcls->superclass->name;
objc_hashtable_set(classes, cls->name, NULL);
}
static void
free_sparsearray(struct sparsearray *sa, size_t depth)
{
uint_fast16_t i;
if (sa == NULL || depth == 0)
return;
for (i = 0; i < 256; i++)
free_sparsearray(sa->next[i], depth - 1);
free(sa);
}
void
objc_free_all_classes(void)
{
uint_fast32_t i;
if (classes == NULL)
return;
for (i = 0; i <= classes->last_idx; i++) {
if (classes->data[i] != NULL) {
Class cls = (Class)classes->data[i]->obj;
if (cls == Nil || (uintptr_t)cls & 1)
continue;
objc_free_class(cls);
objc_free_class(cls->isa);
}
}
if (empty_dtable != NULL) {
objc_sparsearray_free(empty_dtable);
empty_dtable = NULL;
}
free_sparsearray(sparsearray, sizeof(uintptr_t));
sparsearray = NULL;
objc_hashtable_free(classes);
classes = NULL;
}