/* * Mr. 4th Dimention - Allen Webster * * 20.02.2016 * * File editing view for 4coder * */ // TOP #include "buffer/4coder_shared.cpp" #if BUFFER_EXPERIMENT_SCALPEL == 0 #include "buffer/4coder_golden_array.cpp" #define Buffer_Type Buffer #elif BUFFER_EXPERIMENT_SCALPEL == 1 #include "buffer/4coder_gap_buffer.cpp" #define Buffer_Type Gap_Buffer #elif BUFFER_EXPERIMENT_SCALPEL == 2 #include "buffer/4coder_multi_gap_buffer.cpp" #define Buffer_Type Multi_Gap_Buffer #else #include "buffer/4coder_rope_buffer.cpp" #define Buffer_Type Rope_Buffer #endif #include "buffer/4coder_buffer_abstract.cpp" enum Edit_Type{ ED_NORMAL, ED_REVERSE_NORMAL, ED_UNDO, ED_REDO, }; struct Edit_Step{ Edit_Type type; union{ struct{ b32 can_merge; Buffer_Edit edit; i32 pre_pos; i32 post_pos; i32 next_block, prev_block; }; struct{ i32 first_child; i32 inverse_first_child; i32 inverse_child_count; i32 special_type; }; }; i32 child_count; }; struct Edit_Stack{ u8 *strings; i32 size, max; Edit_Step *edits; i32 edit_count, edit_max; }; struct Small_Edit_Stack{ u8 *strings; i32 size, max; Buffer_Edit *edits; i32 edit_count, edit_max; }; struct Undo_Data{ Edit_Stack undo; Edit_Stack redo; Edit_Stack history; Small_Edit_Stack children; i32 history_block_count, history_head_block; i32 edit_history_cursor; b32 current_block_normal; }; enum File_Sync_State{ SYNC_GOOD, SYNC_BEHIND_OS, SYNC_UNSAVED }; struct Text_Effect{ i32 start, end; u32 color; i32 tick_down, tick_max; }; // NOTE(allen): The Editing_File struct is now divided into two // parts. Variables in the Settings part can be set even when the // file is still streaming in, and all operations except for the // initial allocation of the file. struct Editing_File_Settings{ i32 base_map_id; i32 dos_write_mode; b32 unwrapped_lines; b8 tokens_exist; b8 is_initialized; b8 unimportant; b8 read_only; }; // NOTE(allen): This part of the Editing_File is cleared whenever // the contents of the file is set. struct Editing_File_State{ b32 is_dummy; b32 is_loading; i16 font_id; Buffer_Type buffer; i32 cursor_pos; Undo_Data undo; Cpp_Token_Stack token_stack; Cpp_Token_Stack swap_stack; u32 lex_job; b32 tokens_complete; b32 still_lexing; Text_Effect paste_effect; File_Sync_State sync; u64 last_4ed_write_time; u64 last_4ed_edit_time; u64 last_sys_write_time; }; struct Editing_File_Preload{ i32 start_line; }; struct Editing_File_Name{ char live_name_[256]; char source_path_[256]; char extension_[16]; String live_name; String source_path; String extension; }; struct File_Node{ File_Node *next, *prev; }; union File_ID{ i32 id; i16 part[2]; }; inline File_ID to_file_id(i32 id){ File_ID result; result.id = id; return(result); } struct Editing_File{ // NOTE(allen): node must be the first member of Editing_File! File_Node node; Editing_File_Settings settings; union{ Editing_File_State state; Editing_File_Preload preload; }; Editing_File_Name name; File_ID id; }; #if 0 struct File_Table_Entry{ String name; u32 hash; File_ID id; }; // TODO(allen): // Remove this File_Table and instead use the table in 4tech_table.cpp // Instead of hashing by file name use the new Unique_Hash in the system. struct File_Table{ File_Table_Entry *table; i32 count, max; }; internal u32 get_file_hash(String name){ u32 x = 5381; int i = 0; char c; while (i < name.size){ c = name.str[i++]; x = ((x << 5) + x) + c; } return x; } internal b32 table_add(File_Table *table, String name, i32 id){ Assert(table->count * 3 < table->max * 2); File_Table_Entry entry, e; i32 i; entry.name = name; entry.id.id = id; entry.hash = get_file_hash(name); i = entry.hash % table->max; while ((e = table->table[i]).name.str){ if (e.hash == entry.hash && match(e.name, entry.name)){ return 1; } i = (i + 1) % table->max; } table->table[i] = entry; ++table->count; return 0; } internal b32 table_find_pos(File_Table *table, String name, i32 *index){ File_Table_Entry e; i32 i; u32 hash; hash = get_file_hash(name); i = hash % table->max; while ((e = table->table[i]).name.size){ if (e.name.str && e.hash == hash && match(e.name, name)){ *index = i; return 1; } i = (i + 1) % table->max; } return 0; } inline b32 table_find(File_Table *table, String name, File_ID *id){ i32 pos; b32 r = table_find_pos(table, name, &pos); if (r) *id = table->table[pos].id; return r; } inline b32 table_remove(File_Table *table, String name){ i32 pos; b32 r = table_find_pos(table, name, &pos); if (r){ table->table[pos].name.str = 0; --table->count; } return r; } #endif struct Non_File_Table_Entry{ String name; File_ID id; }; struct File_Table_Entry{ Unique_Hash key; File_ID id; }; internal u32 tbl_file_hash(void *item, void *arg){ Unique_Hash uhash = *((Unique_Hash*)item); u32 hash = uhash.d[0] + 101; hash = ((hash << 6) + hash) + uhash.d[1]; hash = ((hash << 6) + hash) + uhash.d[2]; hash = ((hash << 6) + hash) + uhash.d[3]; hash = ((hash << 6) + hash) + uhash.non_file_id; return(hash); } internal i32 tbl_file_compare(void *a, void *b, void *arg){ Unique_Hash ahash = *((Unique_Hash*)a); Unique_Hash bhash = *((Unique_Hash*)b); i32 result = !uhash_equal(ahash, bhash); return(result); } struct File_Array{ Editing_File *files; i32 size; }; struct Working_Set{ File_Array *file_arrays; i32 file_count, file_max; i16 array_count, array_max; File_Node free_sentinel; File_Node used_sentinel; Table non_file_table; Table table; String clipboards[64]; i32 clipboard_size, clipboard_max_size; i32 clipboard_current, clipboard_rolling; }; internal void working_set_extend_memory(Working_Set *working_set, Editing_File *new_space, i16 number_of_files){ File_ID id; i16 i, high_part; Editing_File *file_ptr; File_Node *free_sentinel; Assert(working_set->array_count < working_set->array_max); high_part = working_set->array_count++; working_set->file_arrays[high_part].files = new_space; working_set->file_arrays[high_part].size = number_of_files; working_set->file_max += number_of_files; id.part[1] = high_part; file_ptr = new_space; free_sentinel = &working_set->free_sentinel; for (i = 0; i < number_of_files; ++i, ++file_ptr){ id.part[0] = i; file_ptr->id = id; dll_insert(free_sentinel, &file_ptr->node); } } internal Editing_File* working_set_alloc(Working_Set *working_set){ Editing_File *result = 0; File_Node *node; File_ID id; if (working_set->file_count < working_set->file_max){ node = working_set->free_sentinel.next; Assert(node != &working_set->free_sentinel); result = (Editing_File*)node; dll_remove(node); // NOTE(allen): What I really want to do here is clear everything // except id, but writing that out will be a pain to maintain. id = result->id; *result = {}; result->id = id; dll_insert(&working_set->used_sentinel, node); ++working_set->file_count; } return result; } internal Editing_File* working_set_alloc_always(Working_Set *working_set, General_Memory *general){ Editing_File *result = 0; Editing_File *new_chunk; i32 full_new_count = working_set->file_max; i16 new_count; if (full_new_count > max_i16) new_count = max_i16; else new_count = (i16)full_new_count; if (working_set->file_count == working_set->file_max && working_set->array_count < working_set->array_max){ new_chunk = gen_array(general, Editing_File, new_count); working_set_extend_memory(working_set, new_chunk, new_count); } result = working_set_alloc(working_set); return(result); } inline void working_set_free_file(Working_Set *working_set, Editing_File *file){ file->state.is_dummy = 1; dll_remove(&file->node); dll_insert(&working_set->free_sentinel, &file->node); --working_set->file_count; } inline Editing_File* working_set_index(Working_Set *working_set, File_ID id){ Editing_File *result = 0; File_Array *array; if (id.part[1] >= 0 && id.part[1] < working_set->array_count){ array = working_set->file_arrays + id.part[1]; if (id.part[0] >= 0 && id.part[0] < array->size){ result = array->files + id.part[0]; } } return(result); } inline Editing_File* working_set_index(Working_Set *working_set, i32 id){ Editing_File *result; result = working_set_index(working_set, to_file_id(id)); return(result); } inline Editing_File* working_set_get_active_file(Working_Set *working_set, File_ID id){ Editing_File *result = 0; result = working_set_index(working_set, id); if (result && result->state.is_dummy){ result = 0; } return(result); } inline Editing_File* working_set_get_active_file(Working_Set *working_set, i32 id){ Editing_File *result; result = working_set_get_active_file(working_set, to_file_id(id)); return(result); } inline Editing_File* working_set_contains_file(Working_Set *working_set, Unique_Hash file_hash){ Editing_File *result = 0; File_Table_Entry *entry = 0; entry = (File_Table_Entry*)table_find_item( &working_set->table, &file_hash, 0, tbl_file_hash, tbl_file_compare); if (entry){ result = working_set_index(working_set, entry->id); } return (result); } inline Editing_File* working_set_contains_non_file(Working_Set *working_set, String filename){ Editing_File *result = 0; Non_File_Table_Entry *entry = 0; entry = (Non_File_Table_Entry*)table_find_item( &working_set->non_file_table, &filename, 0, tbl_string_hash, tbl_string_compare); if (entry){ result = working_set_index(working_set, entry->id); } return (result); } inline Editing_File* working_set_contains(System_Functions *system, Working_Set *working_set, String filename){ Unique_Hash file_hash; Editing_File *result; b32 success = 0; //terminate_with_null(&filename); file_hash = system->file_unique_hash(filename, &success); if (success){ result = working_set_contains_file(working_set, file_hash); } else{ result = working_set_contains_non_file(working_set, filename); } return(result); } internal void working_set_init(Working_Set *working_set, Partition *partition, General_Memory *general){ i16 init_count = 16; i16 array_init_count = 256; Editing_File *files, *null_file; void *mem; i32 mem_size, table_size; dll_init_sentinel(&working_set->free_sentinel); dll_init_sentinel(&working_set->used_sentinel); working_set->array_max = array_init_count; working_set->file_arrays = push_array(partition, File_Array, array_init_count); files = push_array(partition, Editing_File, init_count); working_set_extend_memory(working_set, files, init_count); null_file = working_set_index(working_set, 0); dll_remove(&null_file->node); null_file->state.is_dummy = 1; ++working_set->file_count; table_size = working_set->file_max; mem_size = table_required_mem_size(table_size, sizeof(File_Table_Entry)); mem = general_memory_allocate(general, mem_size, 0); memset(mem, 0, mem_size); table_init_memory(&working_set->table, mem, table_size, sizeof(File_Table_Entry)); table_size = working_set->file_max; // / 4; mem_size = table_required_mem_size(table_size, sizeof(Non_File_Table_Entry)); mem = general_memory_allocate(general, mem_size, 0); memset(mem, 0, mem_size); table_init_memory(&working_set->non_file_table, mem, table_size, sizeof(Non_File_Table_Entry)); } inline void working_set_grow_if_needed(Table *table, General_Memory *general, void *arg, Hash_Function *hash_func, Compare_Function *comp_func){ Table btable; i32 new_max, mem_size; void *mem; if (table_at_capacity(table)){ new_max = table->max * 2; mem_size = table_required_mem_size(new_max, table->item_size); mem = general_memory_allocate(general, mem_size, 0); table_init_memory(&btable, mem, new_max, table->item_size); table_clear(&btable); table_rehash(table, &btable, 0, hash_func, comp_func); general_memory_free(general, table->hash_array); *table = btable; } } inline void working_set_add_file(Working_Set *working_set, Unique_Hash key, File_ID file_id, General_Memory *general){ File_Table_Entry entry; entry.key = key; entry.id = file_id; working_set_grow_if_needed(&working_set->table, general, 0, tbl_file_hash, tbl_file_compare); table_add(&working_set->table, &entry, 0, tbl_file_hash, tbl_file_compare); } inline void working_set_add_non_file(Working_Set *working_set, String filename, File_ID file_id, General_Memory *general){ Non_File_Table_Entry entry; entry.name = filename; entry.id = file_id; working_set_grow_if_needed(&working_set->table, general, 0, tbl_string_hash, tbl_string_compare); table_add(&working_set->non_file_table, &entry, 0, tbl_string_hash, tbl_string_compare); } inline void working_set_add(System_Functions *system, Working_Set *working_set, Editing_File *file, General_Memory *general){ Unique_Hash file_hash; b32 success = 0; file_hash = system->file_unique_hash(file->name.source_path, &success); if (success){ working_set_add_file(working_set, file_hash, file->id, general); } else{ working_set_add_non_file(working_set, file->name.source_path, file->id, general); } } inline void working_set_remove_file(Working_Set *working_set, Unique_Hash file_hash){ table_remove_match(&working_set->table, &file_hash, 0, tbl_file_hash, tbl_file_compare); } inline void working_set_remove_non_file(Working_Set *working_set, String filename){ table_remove_match(&working_set->non_file_table, &filename, 0, tbl_string_hash, tbl_string_compare); } inline void working_set_remove(System_Functions *system, Working_Set *working_set, String filename){ Unique_Hash file_hash; b32 success = 0; file_hash = system->file_unique_hash(filename, &success); if (success){ working_set_remove_file(working_set, file_hash); } else{ working_set_remove_non_file(working_set, filename); } } // TODO(allen): Pick better first options. internal Editing_File* working_set_lookup_file(Working_Set *working_set, String string){ Editing_File *file = 0; replace_char(string, '\\', '/'); { File_Node *node, *used_nodes; used_nodes = &working_set->used_sentinel; for (dll_items(node, used_nodes)){ file = (Editing_File*)node; if (string.size == 0 || match(string, file->name.live_name)){ break; } } if (node == used_nodes) file = 0; } if (!file){ File_Node *node, *used_nodes; used_nodes = &working_set->used_sentinel; for (dll_items(node, used_nodes)){ file = (Editing_File*)node; if (string.size == 0 || has_substr(file->name.live_name, string)){ break; } } if (node == used_nodes) file = 0; } return (file); } // Hot Directory struct Hot_Directory{ String string; File_List file_list; char slash; }; internal void hot_directory_clean_end(Hot_Directory *hot_directory){ String *str = &hot_directory->string; if (str->size != 0 && str->str[str->size-1] != hot_directory->slash){ str->size = reverse_seek_slash(*str) + 1; str->str[str->size] = 0; } } internal i32 hot_directory_quick_partition(File_Info *infos, i32 start, i32 pivot){ File_Info *p = infos + pivot; File_Info *a = infos + start; for (i32 i = start; i < pivot; ++i, ++a){ i32 comp = 0; comp = p->folder - a->folder; if (comp == 0) comp = compare(a->filename, p->filename); if (comp < 0){ Swap(*a, infos[start]); ++start; } } Swap(*p, infos[start]); return start; } internal void hot_directory_quick_sort(File_Info *infos, i32 start, i32 pivot){ i32 mid = hot_directory_quick_partition(infos, start, pivot); if (start < mid-1) hot_directory_quick_sort(infos, start, mid-1); if (mid+1 < pivot) hot_directory_quick_sort(infos, mid+1, pivot); } inline void hot_directory_fixup(Hot_Directory *hot_directory, Working_Set *working_set){ File_List *files = &hot_directory->file_list; if (files->count >= 2) hot_directory_quick_sort(files->infos, 0, files->count - 1); } inline void hot_directory_set(System_Functions *system, Hot_Directory *hot_directory, String str, Working_Set *working_set){ b32 success = copy_checked(&hot_directory->string, str); terminate_with_null(&hot_directory->string); if (success){ if (str.size > 0){ system->set_file_list(&hot_directory->file_list, str); } else{ system->set_file_list(&hot_directory->file_list, make_string((char*)1, 0)); } } hot_directory_fixup(hot_directory, working_set); } inline void hot_directory_reload(System_Functions *system, Hot_Directory *hot_directory, Working_Set *working_set){ system->set_file_list(&hot_directory->file_list, hot_directory->string); hot_directory_fixup(hot_directory, working_set); } internal void hot_directory_init(Hot_Directory *hot_directory, String base, String dir, char slash){ hot_directory->string = base; hot_directory->string.str[255] = 0; hot_directory->string.size = 0; copy(&hot_directory->string, dir); append(&hot_directory->string, slash); hot_directory->slash = slash; } struct Hot_Directory_Match{ String filename; b32 is_folder; }; internal b32 filename_match(String query, Absolutes *absolutes, String filename, b32 case_sensitive){ b32 result; result = (query.size == 0); replace_char(query, '\\', '/'); replace_char(filename, '\\', '/'); if (!result) result = wildcard_match(absolutes, filename, case_sensitive); return result; } internal Hot_Directory_Match hot_directory_first_match(Hot_Directory *hot_directory, String str, b32 include_files, b32 exact_match, b32 case_sensitive){ Hot_Directory_Match result = {}; replace_char(str, '\\', '/'); Absolutes absolutes; if (!exact_match) get_absolutes(str, &absolutes, 1, 1); File_List *files = &hot_directory->file_list; File_Info *info, *end; end = files->infos + files->count; for (info = files->infos; info != end; ++info){ String filename = info->filename; b32 is_match = 0; if (exact_match){ if (case_sensitive){ if (match(filename, str)) is_match = 1; } else{ if (match_unsensitive(filename, str)) is_match = 1; } } else{ if (filename_match(str, &absolutes, filename, case_sensitive)) is_match = 1; } if (is_match){ result.is_folder = info->folder; result.filename = filename; break; } } return result; } inline File_Sync_State buffer_get_sync(Editing_File *file){ File_Sync_State result = SYNC_GOOD; if (file->state.last_4ed_write_time != file->state.last_sys_write_time) result = SYNC_BEHIND_OS; else if (file->state.last_4ed_edit_time > file->state.last_sys_write_time) result = SYNC_UNSAVED; return result; } inline b32 buffer_needs_save(Editing_File *file){ b32 result = 0; if (file->settings.unimportant == 0) if (buffer_get_sync(file) == SYNC_UNSAVED) result = 1; return(result); } inline b32 file_is_ready(Editing_File *file){ b32 result = 0; if (file && file->state.is_loading == 0){ result = 1; } return(result); } inline void file_set_to_loading(Editing_File *file){ file->state = {}; file->settings = {}; file->state.is_loading = 1; } // BOTTOM