/**
* 存储 name, handle
* @param s handle_storage
* @param name 名字
* @param handle handle
* @return 存储的 name, 返回的字符串是复制 name, 新申请的内存数据
*/
static const char *
_insert_name(struct handle_storage *s, const char * name, uint32_t handle) {
// 查找到可用的索引
int begin = 0;
int end = s->name_count - 1;
while (begin<=end) {
int mid = (begin+end)/2;
struct handle_name *n = &s->name[mid];
int c = strcmp(n->name, name);
// 如果已经插入过, 那么将不能插入, 1 个 name 只能注册 1 次, 1 个 handle 能够注册多个名字
if (c==0) {
return NULL;
}
if (c<0) {
begin = mid + 1;
} else {
end = mid - 1;
}
}
char * result = skynet_strdup(name);
_insert_name_before(s, result, handle, begin);
return result;
}
static const char *
_insert_name(struct handle_storage *s, const char * name, uint32_t handle) {
int begin = 0;
int end = s->name_count - 1;
while (begin<=end) {
int mid = (begin+end)/2;
struct handle_name *n = &s->name[mid];
int c = strcmp(n->name, name);
if (c==0) {
return NULL;
}
if (c<0) {
begin = mid + 1;
} else {
end = mid - 1;
}
}
char * result = strdup(name);
_insert_name_before(s, result, handle, begin);
return result;
}
// 插入 name 和 handle
static const char *
_insert_name(struct handle_storage *s, const char * name, uint32_t handle) {
int begin = 0;
int end = s->name_count - 1;
// 二分查找
while (begin<=end) {
int mid = (begin+end)/2;
struct handle_name *n = &s->name[mid];
int c = strcmp(n->name, name);
if (c==0) {
return NULL; // 名称已存在 这里名称不能重复插入
}
if (c<0) {
begin = mid + 1;
} else {
end = mid - 1;
}
}
char * result = strdup(name);
_insert_name_before(s, result, handle, begin); // 一直在头部插入 实际上这样插入后 name 会按长度大小排好序 这样就能使用二分查找了
return result;
}
