static const char* build_name(const char* a, const char* b, ast_t* typeargs,
bool function)
{
size_t len = typeargs_len(typeargs);
if(a != NULL)
len += strlen(a) + 1;
if(b != NULL)
len += strlen(b) + 1;
char* name = (char*)pool_alloc_size(len);
if(a != NULL)
strcpy(name, a);
if(b != NULL)
{
if(a != NULL)
name_append(name, b);
else
strcpy(name, b);
}
typeargs_append(name, typeargs, function);
return stringtab_consume(name, len);
}
static ast_result_t sugar_ffi(ast_t* ast)
{
AST_GET_CHILDREN(ast, id, typeargs, args, named_args);
const char* name = ast_name(id);
size_t len = ast_name_len(id);
// Check for \0 in ffi name (it may be a string literal)
if(memchr(name, '\0', len) != NULL)
{
ast_error(ast, "FFI function names cannot include nul characters");
return AST_ERROR;
}
// Prefix '@' to the name
char* new_name = (char*)pool_alloc_size(len + 2);
new_name[0] = '@';
memcpy(new_name + 1, name, len);
new_name[len + 1] = '\0';
ast_t* new_id = ast_from_string(id, stringtab_consume(new_name, len + 2));
ast_replace(&id, new_id);
if(ast_id(ast) == TK_FFIDECL)
return check_params(args);
return AST_OK;
}
static const char* symbol_suffix(const char* symbol, size_t suffix)
{
size_t len = strlen(symbol);
size_t buf_size = len + 32;
char* buf = (char*)pool_alloc_size(buf_size);
snprintf(buf, buf_size, "%s" __zu, symbol, suffix);
return stringtab_consume(buf, buf_size);
}
// Convert the given ID to a hygenic string. The resulting string should not be
// deleted and is valid indefinitely.
static const char* id_to_string(const char* prefix, size_t id)
{
if(prefix == NULL)
prefix = "";
size_t len = strlen(prefix);
size_t buf_size = len + 32;
char* buffer = (char*)pool_alloc_size(buf_size);
snprintf(buffer, buf_size, "%s$" __zu, prefix, id);
return stringtab_consume(buffer, buf_size);
}
static const char* name_without_case(const char* name)
{
size_t len = strlen(name) + 1;
char* buf = (char*)ponyint_pool_alloc_size(len);
if(is_name_type(name))
{
for(size_t i = 0; i < len; i++)
buf[i] = (char)toupper(name[i]);
} else {
for(size_t i = 0; i < len; i++)
buf[i] = (char)tolower(name[i]);
}
return stringtab_consume(buf, len);
}
static const char* suggest_alt_name(ast_t* ast, const char* name)
{
assert(ast != NULL);
assert(name != NULL);
size_t name_len = strlen(name);
if(is_name_private(name))
{
// Try without leading underscore
const char* try_name = stringtab(name + 1);
if(ast_get(ast, try_name, NULL) != NULL)
return try_name;
}
else
{
// Try with a leading underscore
char* buf = (char*)ponyint_pool_alloc_size(name_len + 2);
buf[0] = '_';
strncpy(buf + 1, name, name_len + 1);
const char* try_name = stringtab_consume(buf, name_len + 2);
if(ast_get(ast, try_name, NULL) != NULL)
return try_name;
}
// Try with a different case (without crossing type/value boundary)
ast_t* case_ast = ast_get_case(ast, name, NULL);
if(case_ast != NULL)
{
ast_t* id = case_ast;
if(ast_id(id) != TK_ID)
id = ast_child(id);
assert(ast_id(id) == TK_ID);
const char* try_name = ast_name(id);
if(ast_get(ast, try_name, NULL) != NULL)
return try_name;
}
// Give up
return NULL;
}
const char* suffix_filename(compile_t* c, const char* dir, const char* prefix,
const char* file, const char* extension)
{
// Copy to a string with space for a suffix.
size_t len = strlen(dir) + strlen(prefix) + strlen(file) + strlen(extension)
+ 4;
char* filename = (char*)ponyint_pool_alloc_size(len);
// Start with no suffix.
#ifdef PLATFORM_IS_WINDOWS
snprintf(filename, len, "%s\\%s%s%s", dir, prefix, file, extension);
#else
snprintf(filename, len, "%s/%s%s%s", dir, prefix, file, extension);
#endif
int suffix = 0;
while(suffix < 100)
{
// Overwrite files but not directories.
struct stat s;
int err = stat(filename, &s);
if((err == -1) || !S_ISDIR(s.st_mode))
break;
#ifdef PLATFORM_IS_WINDOWS
snprintf(filename, len, "%s\\%s%s%d%s", dir, prefix, file, ++suffix,
extension);
#else
snprintf(filename, len, "%s/%s%s%d%s", dir, prefix, file, ++suffix,
extension);
#endif
}
if(suffix >= 100)
{
errorf(c->opt->check.errors, NULL, "couldn't pick an unused file name");
ponyint_pool_free_size(len, filename);
return NULL;
}
return stringtab_consume(filename, len);
}
static const char* quoted_locator(ast_t* use, const char* locator)
{
assert(locator != NULL);
if(strpbrk(locator, "\t\r\n\"'`;$|&<>%*?[]{}()") != NULL)
{
if(use != NULL)
ast_error(use, "use URI contains invalid characters");
return NULL;
}
size_t len = strlen(locator);
char* quoted = (char*)ponyint_pool_alloc_size(len + 3);
quoted[0] = '"';
memcpy(quoted + 1, locator, len);
quoted[len + 1] = '"';
quoted[len + 2] = '\0';
return stringtab_consume(quoted, len + 3);
}
static const char* string_to_symbol(const char* string)
{
bool prefix = false;
if(!((string[0] >= 'a') && (string[0] <= 'z')) &&
!((string[0] >= 'A') && (string[0] <= 'Z')))
{
// If it doesn't start with a letter, prefix an underscore.
prefix = true;
}
size_t len = strlen(string);
size_t buf_size = len + prefix + 1;
char* buf = (char*)pool_alloc_size(buf_size);
memcpy(buf + prefix, string, len + 1);
if(prefix)
buf[0] = '_';
for(size_t i = prefix; i < len; i++)
{
if(
(buf[i] == '_') ||
((buf[i] >= 'a') && (buf[i] <= 'z')) ||
((buf[i] >= '0') && (buf[i] <= '9'))
)
{
// Do nothing.
} else if((buf[i] >= 'A') && (buf[i] <= 'Z')) {
// Force lower case.
buf[i] |= 0x20;
} else {
// Smash a non-symbol character to an underscore.
buf[i] = '_';
}
}
return stringtab_consume(buf, buf_size);
}
static const char* quoted_locator(pass_opt_t* opt, ast_t* use,
const char* locator)
{
pony_assert(locator != NULL);
if(strpbrk(locator, INVALID_LOCATOR_CHARS) != NULL)
{
if(use != NULL)
ast_error(opt->check.errors, use, "use URI contains invalid characters");
return NULL;
}
size_t len = strlen(locator);
char* quoted = (char*)ponyint_pool_alloc_size(len + 3);
quoted[0] = '"';
memcpy(quoted + 1, locator, len);
quoted[len + 1] = '"';
quoted[len + 2] = '\0';
return stringtab_consume(quoted, len + 3);
}
ast_t* package_load(ast_t* from, const char* path, pass_opt_t* options)
{
assert(from != NULL);
const char* magic = find_magic_package(path);
const char* full_path = path;
const char* qualified_name = path;
ast_t* program = ast_nearest(from, TK_PROGRAM);
if(magic == NULL)
{
// Lookup (and hence normalise) path
bool is_relative = false;
full_path = find_path(from, path, &is_relative);
if(full_path == NULL)
return NULL;
if((from != program) && is_relative)
{
// Package to load is relative to from, build the qualified name
// The qualified name should be relative to the program being built
package_t* from_pkg = (package_t*)ast_data(ast_child(program));
if(from_pkg != NULL)
{
const char* base_name = from_pkg->qualified_name;
size_t base_name_len = strlen(base_name);
size_t path_len = strlen(path);
size_t len = base_name_len + path_len + 2;
char* q_name = (char*)pool_alloc_size(len);
memcpy(q_name, base_name, base_name_len);
q_name[base_name_len] = '/';
memcpy(q_name + base_name_len + 1, path, path_len);
q_name[len - 1] = '\0';
qualified_name = stringtab_consume(q_name, len);
}
}
}
ast_t* package = ast_get(program, full_path, NULL);
// Package already loaded
if(package != NULL)
return package;
package = create_package(program, full_path, qualified_name);
if(report_build)
printf("Building %s -> %s\n", path, full_path);
if(magic != NULL)
{
if(!parse_source_code(package, magic, options))
return NULL;
}
else
{
if(!parse_files_in_dir(package, full_path, options))
return NULL;
}
if(ast_child(package) == NULL)
{
ast_error(package, "no source files in package '%s'", path);
return NULL;
}
if(!ast_passes_subtree(&package, options, options->program_pass))
{
// If these passes failed, don't run future passes.
ast_setflag(package, AST_FLAG_PRESERVE);
return NULL;
}
return package;
}
ast_t* package_load(ast_t* from, const char* path, pass_opt_t* options)
{
const char* magic = find_magic_package(path);
const char* full_path = path;
const char* qualified_name = path;
ast_t* program = ast_nearest(from, TK_PROGRAM);
if(magic == NULL)
{
// Lookup (and hence normalise) path
bool is_relative = false;
full_path = find_path(from, path, &is_relative);
if(full_path == NULL)
return NULL;
if((from != NULL) && is_relative)
{
// Package to load is relative to from, build the qualified name
// The qualified name should be relative to the program being built
package_t* from_pkg = (package_t*)ast_data(ast_child(program));
if(from_pkg != NULL)
{
const char* base_name = from_pkg->qualified_name;
size_t base_name_len = strlen(base_name);
size_t path_len = strlen(path);
size_t len = base_name_len + path_len + 2;
char* q_name = (char*)pool_alloc_size(len);
memcpy(q_name, base_name, base_name_len);
q_name[base_name_len] = '/';
memcpy(q_name + base_name_len + 1, path, path_len);
q_name[len - 1] = '\0';
qualified_name = stringtab_consume(q_name, len);
}
}
}
ast_t* package = ast_get(program, full_path, NULL);
// Package already loaded
if(package != NULL)
return package;
package = create_package(program, full_path, qualified_name);
if(report_build)
printf("Building %s -> %s\n", path, full_path);
if(magic != NULL)
{
if(!parse_source_code(package, magic, options))
return NULL;
}
else
{
if(!parse_files_in_dir(package, full_path, options))
return NULL;
}
if(ast_child(package) == NULL)
{
ast_error(package, "no source files in package '%s'", path);
return NULL;
}
// We add new packages to the end of the program, so they will be reached by
// the current pass processing. This means we need to catch up the new
// package to the previous pass
if(!ast_passes_subtree(&package, options,
pass_prev(options->type_catchup_pass)))
return NULL;
return package;
}
ast_t* package_load(ast_t* from, const char* path, pass_opt_t* opt)
{
pony_assert(from != NULL);
magic_package_t* magic = find_magic_package(path, opt);
const char* full_path = path;
const char* qualified_name = path;
ast_t* program = ast_nearest(from, TK_PROGRAM);
if(magic == NULL)
{
// Lookup (and hence normalise) path
bool is_relative = false;
bool found_notdir = false;
full_path = find_path(from, path, &is_relative, &found_notdir, opt);
if(full_path == NULL)
{
errorf(opt->check.errors, path, "couldn't locate this path");
if(found_notdir)
errorf_continue(opt->check.errors, path, "note that a compiler "
"invocation or a 'use' directive must refer to a directory");
return NULL;
}
if((from != program) && is_relative)
{
// Package to load is relative to from, build the qualified name
// The qualified name should be relative to the program being built
package_t* from_pkg = (package_t*)ast_data(ast_child(program));
if(from_pkg != NULL)
{
const char* base_name = from_pkg->qualified_name;
size_t base_name_len = strlen(base_name);
size_t path_len = strlen(path);
size_t len = base_name_len + path_len + 2;
char* q_name = (char*)ponyint_pool_alloc_size(len);
memcpy(q_name, base_name, base_name_len);
q_name[base_name_len] = '/';
memcpy(q_name + base_name_len + 1, path, path_len);
q_name[len - 1] = '\0';
qualified_name = stringtab_consume(q_name, len);
}
}
// we are loading the package specified as program dir
if(from == program)
{
// construct the qualified name from the basename of the full path
const char* basepath = strrchr(full_path, '/');
if(basepath == NULL)
{
basepath = full_path;
} else {
basepath = basepath + 1;
}
qualified_name = basepath;
}
}
ast_t* package = ast_get(program, full_path, NULL);
// Package already loaded
if(package != NULL)
return package;
package = create_package(program, full_path, qualified_name, opt);
if(opt->verbosity >= VERBOSITY_INFO)
fprintf(stderr, "Building %s -> %s\n", path, full_path);
if(magic != NULL)
{
if(magic->src != NULL)
{
if(!parse_source_code(package, magic->src, opt))
return NULL;
} else if(magic->mapped_path != NULL) {
if(!parse_files_in_dir(package, magic->mapped_path, opt))
return NULL;
} else {
return NULL;
}
}
else
{
if(!parse_files_in_dir(package, full_path, opt))
return NULL;
}
if(ast_child(package) == NULL)
{
ast_error(opt->check.errors, package,
"no source files in package '%s'", path);
return NULL;
}
if(!ast_passes_subtree(&package, opt, opt->program_pass))
{
// If these passes failed, don't run future passes.
ast_setflag(package, AST_FLAG_PRESERVE);
return NULL;
}
return package;
}