#ifndef NVIM_EVAL_TYPVAL_H #define NVIM_EVAL_TYPVAL_H #include #include #include #include "nvim/hashtab.h" #include "nvim/garray.h" #include "nvim/mbyte.h" #include "nvim/lib/queue.h" #include "nvim/profile.h" // for proftime_T #include "nvim/pos.h" // for linenr_T /// Type used for VimL VAR_NUMBER values typedef int varnumber_T; /// Type used for VimL VAR_FLOAT values typedef double float_T; /// Maximal possible value of varnumber_T variable #define VARNUMBER_MAX INT_MAX /// Mimimal possible value of varnumber_T variable #define VARNUMBER_MIN INT_MIN /// %d printf format specifier for varnumber_T #define PRIdVARNUMBER "d" typedef struct listvar_S list_T; typedef struct dictvar_S dict_T; typedef struct partial_S partial_T; /// Special variable values typedef enum { kSpecialVarFalse, ///< v:false kSpecialVarTrue, ///< v:true kSpecialVarNull, ///< v:null } SpecialVarValue; /// Variable lock status for typval_T.v_lock typedef enum { VAR_UNLOCKED = 0, ///< Not locked. VAR_LOCKED = 1, ///< User lock, can be unlocked. VAR_FIXED = 2, ///< Locked forever. } VarLockStatus; /// VimL variable types, for use in typval_T.v_type typedef enum { VAR_UNKNOWN = 0, ///< Unknown (unspecified) value. VAR_NUMBER, ///< Number, .v_number is used. VAR_STRING, ///< String, .v_string is used. VAR_FUNC, ///< Function reference, .v_string is used as function name. VAR_LIST, ///< List, .v_list is used. VAR_DICT, ///< Dictionary, .v_dict is used. VAR_FLOAT, ///< Floating-point value, .v_float is used. VAR_SPECIAL, ///< Special value (true, false, null), .v_special ///< is used. VAR_PARTIAL, ///< Partial, .v_partial is used. } VarType; /// Structure that holds an internal variable value typedef struct { VarType v_type; ///< Variable type. VarLockStatus v_lock; ///< Variable lock status. union typval_vval_union { varnumber_T v_number; ///< Number, for VAR_NUMBER. SpecialVarValue v_special; ///< Special value, for VAR_SPECIAL. float_T v_float; ///< Floating-point number, for VAR_FLOAT. char_u *v_string; ///< String, for VAR_STRING and VAR_FUNC, can be NULL. list_T *v_list; ///< List for VAR_LIST, can be NULL. dict_T *v_dict; ///< Dictionary for VAR_DICT, can be NULL. partial_T *v_partial; ///< Closure: function with args. } vval; ///< Actual value. } typval_T; /// Values for (struct dictvar_S).dv_scope typedef enum { VAR_NO_SCOPE = 0, ///< Not a scope dictionary. VAR_SCOPE = 1, ///< Scope dictionary which requires prefix (a:, v:, …). VAR_DEF_SCOPE = 2, ///< Scope dictionary which may be accessed without prefix ///< (l:, g:). } ScopeType; /// Structure to hold an item of a list typedef struct listitem_S listitem_T; struct listitem_S { listitem_T *li_next; ///< Next item in list. listitem_T *li_prev; ///< Previous item in list. typval_T li_tv; ///< Item value. }; /// Structure used by those that are using an item in a list typedef struct listwatch_S listwatch_T; struct listwatch_S { listitem_T *lw_item; ///< Item being watched. listwatch_T *lw_next; ///< Next watcher. }; /// Structure to hold info about a list struct listvar_S { listitem_T *lv_first; ///< First item, NULL if none. listitem_T *lv_last; ///< Last item, NULL if none. int lv_refcount; ///< Reference count. int lv_len; ///< Number of items. listwatch_T *lv_watch; ///< First watcher, NULL if none. int lv_idx; ///< Index of a cached item, used for optimising repeated l[idx]. listitem_T *lv_idx_item; ///< When not NULL item at index "lv_idx". int lv_copyID; ///< ID used by deepcopy(). list_T *lv_copylist; ///< Copied list used by deepcopy(). VarLockStatus lv_lock; ///< Zero, VAR_LOCKED, VAR_FIXED. list_T *lv_used_next; ///< next list in used lists list. list_T *lv_used_prev; ///< Previous list in used lists list. }; // Static list with 10 items. Use init_static_list() to initialize. typedef struct { list_T sl_list; // must be first listitem_T sl_items[10]; } staticList10_T; // Structure to hold an item of a Dictionary. // Also used for a variable. // The key is copied into "di_key" to avoid an extra alloc/free for it. struct dictitem_S { typval_T di_tv; ///< type and value of the variable char_u di_flags; ///< flags (only used for variable) char_u di_key[1]; ///< key (actually longer!) }; #define TV_DICTITEM_STRUCT(KEY_LEN) \ struct { \ typval_T di_tv; /* Structure that holds scope dictionary itself. */ \ uint8_t di_flags; /* Flags. */ \ char_u di_key[KEY_LEN]; /* NUL. */ \ } /// Structure to hold a scope dictionary /// /// @warning Must be compatible with dictitem_T. /// /// For use in find_var_in_ht to pretend that it found dictionary item when it /// finds scope dictionary. typedef TV_DICTITEM_STRUCT(1) ScopeDictDictItem; /// Structure to hold an item of a Dictionary /// /// @warning Must be compatible with ScopeDictDictItem. /// /// Also used for a variable. typedef TV_DICTITEM_STRUCT() dictitem_T; /// Flags for dictitem_T.di_flags typedef enum { DI_FLAGS_RO = 1, ///< Read-only value DI_FLAGS_RO_SBX = 2, ///< Value, read-only in the sandbox DI_FLAGS_FIX = 4, ///< Fixed value: cannot be :unlet or remove()d. DI_FLAGS_LOCK = 8, ///< Locked value. DI_FLAGS_ALLOC = 16, ///< Separately allocated. } DictItemFlags; /// Structure representing a Dictionary struct dictvar_S { VarLockStatus dv_lock; ///< Whole dictionary lock status. ScopeType dv_scope; ///< Non-zero (#VAR_SCOPE, #VAR_DEF_SCOPE) if ///< dictionary represents a scope (i.e. g:, l: …). int dv_refcount; ///< Reference count. int dv_copyID; ///< ID used when recursivery traversing a value. hashtab_T dv_hashtab; ///< Hashtab containing all items. dict_T *dv_copydict; ///< Copied dict used by deepcopy(). dict_T *dv_used_next; ///< Next dictionary in used dictionaries list. dict_T *dv_used_prev; ///< Previous dictionary in used dictionaries list. QUEUE watchers; ///< Dictionary key watchers set by user code. }; /// Type used for script ID typedef int scid_T; // Structure to hold info for a function that is currently being executed. typedef struct funccall_S funccall_T; // Structure to hold info for a user function. typedef struct ufunc ufunc_T; struct ufunc { int uf_varargs; ///< variable nr of arguments int uf_flags; int uf_calls; ///< nr of active calls bool uf_cleared; ///< func_clear() was already called garray_T uf_args; ///< arguments garray_T uf_lines; ///< function lines int uf_profiling; ///< true when func is being profiled // Profiling the function as a whole. int uf_tm_count; ///< nr of calls proftime_T uf_tm_total; ///< time spent in function + children proftime_T uf_tm_self; ///< time spent in function itself proftime_T uf_tm_children; ///< time spent in children this call // Profiling the function per line. int *uf_tml_count; ///< nr of times line was executed proftime_T *uf_tml_total; ///< time spent in a line + children proftime_T *uf_tml_self; ///< time spent in a line itself proftime_T uf_tml_start; ///< start time for current line proftime_T uf_tml_children; ///< time spent in children for this line proftime_T uf_tml_wait; ///< start wait time for current line int uf_tml_idx; ///< index of line being timed; -1 if none int uf_tml_execed; ///< line being timed was executed scid_T uf_script_ID; ///< ID of script where function was defined, // used for s: variables int uf_refcount; ///< reference count, see func_name_refcount() funccall_T *uf_scoped; ///< l: local variables for closure char_u uf_name[1]; ///< name of function (actually longer); can // start with 123_ ( is K_SPECIAL // KS_EXTRA KE_SNR) }; /// Maximum number of function arguments #define MAX_FUNC_ARGS 20 struct partial_S { int pt_refcount; ///< Reference count. char_u *pt_name; ///< Function name; when NULL use pt_func->name. ufunc_T *pt_func; ///< Function pointer; when NULL lookup function with ///< pt_name. bool pt_auto; ///< When true the partial was created by using dict.member ///< in handle_subscript(). int pt_argc; ///< Number of arguments. typval_T *pt_argv; ///< Arguments in allocated array. dict_T *pt_dict; ///< Dict for "self". }; /// Structure used for explicit stack while garbage collecting hash tables typedef struct ht_stack_S { hashtab_T *ht; struct ht_stack_S *prev; } ht_stack_T; /// Structure used for explicit stack while garbage collecting lists typedef struct list_stack_S { list_T *list; struct list_stack_S *prev; } list_stack_T; // In a hashtab item "hi_key" points to "di_key" in a dictitem. // This avoids adding a pointer to the hashtab item. /// Convert a dictitem pointer to a hashitem key pointer #define DI2HIKEY(di) ((di)->di_key) /// Convert a hashitem key pointer to a dictitem pointer #define HIKEY2DI(p) ((dictitem_T *)(p - offsetof(dictitem_T, di_key))) /// Convert a hashitem value pointer to a dictitem pointer #define HIVAL2DI(p) \ ((dictitem_T *)(((char *)p) - offsetof(dictitem_T, di_tv))) /// Convert a hashitem pointer to a dictitem pointer #define HI2DI(hi) HIKEY2DI((hi)->hi_key) /// Get the number of items in a list /// /// @param[in] l List to check. static inline long tv_list_len(list_T *const l) FUNC_ATTR_PURE FUNC_ATTR_WARN_UNUSED_RESULT { if (l == NULL) { return 0; } return l->lv_len; } /// Empty string /// /// Needed for hack which allows not allocating empty string and still not /// crashing when freeing it. extern const char *const tv_empty_string; /// Specifies that free_unref_items() function has (not) been entered extern bool tv_in_free_unref_items; #ifdef INCLUDE_GENERATED_DECLARATIONS # include "eval/typval.h.generated.h" #endif #endif // NVIM_EVAL_TYPVAL_H