summaryrefslogtreecommitdiffstats
path: root/src/lilv_internal.h
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2011-12-23 02:41:56 +0000
committerDavid Robillard <d@drobilla.net>2011-12-23 02:41:56 +0000
commitc5c4a6e935eecc2d2dac7bb9cccd36057b8dc123 (patch)
treeaac647c5a0fcc59bfe583bb25c6b508f21db7a19 /src/lilv_internal.h
parentb760711088bb027d7c84eec7c19360d8f02680ec (diff)
downloadlilv-c5c4a6e935eecc2d2dac7bb9cccd36057b8dc123.tar.gz
lilv-c5c4a6e935eecc2d2dac7bb9cccd36057b8dc123.tar.bz2
lilv-c5c4a6e935eecc2d2dac7bb9cccd36057b8dc123.zip
Add LilvState API for handling plugin state. This makes it simple to save and
restore plugin state both in memory and on disk, as well as save presets in a host-sharable way since the disk format is identical to the LV2 presets format. git-svn-id: http://svn.drobilla.net/lad/trunk/lilv@3899 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'src/lilv_internal.h')
-rw-r--r--src/lilv_internal.h11
1 files changed, 9 insertions, 2 deletions
diff --git a/src/lilv_internal.h b/src/lilv_internal.h
index a700d6f..75e21a2 100644
--- a/src/lilv_internal.h
+++ b/src/lilv_internal.h
@@ -65,7 +65,6 @@ struct LilvPortImpl {
LilvNodes* classes; ///< rdf:type
};
-
struct LilvSpecImpl {
SordNode* spec;
SordNode* bundle;
@@ -132,6 +131,7 @@ struct LilvWorldImpl {
LilvNodes* loaded_files;
SordNode* dc_replaces_node;
SordNode* dyn_manifest_node;
+ SordNode* lv2_appliesTo_node;
SordNode* lv2_binary_node;
SordNode* lv2_default_node;
SordNode* lv2_index_node;
@@ -143,6 +143,7 @@ struct LilvWorldImpl {
SordNode* lv2_reportslatency_node;
SordNode* lv2_specification_node;
SordNode* lv2_symbol_node;
+ SordNode* pset_value_node;
SordNode* rdf_a_node;
SordNode* rdf_value_node;
SordNode* rdfs_class_node;
@@ -154,7 +155,6 @@ struct LilvWorldImpl {
SordNode* xsd_double_node;
SordNode* xsd_integer_node;
LilvNode* doap_name_val;
- LilvNode* lv2_applies_to_val;
LilvNode* lv2_extensionData_val;
LilvNode* lv2_name_val;
LilvNode* lv2_optionalFeature_val;
@@ -290,6 +290,13 @@ lilv_match_subject(SordIter* iter) {
}
static inline const SordNode*
+lilv_match_predicate(SordIter* iter) {
+ SordQuad tup;
+ sord_iter_get(iter, tup);
+ return tup[SORD_PREDICATE];
+}
+
+static inline const SordNode*
lilv_match_object(SordIter* iter) {
SordQuad tup;
sord_iter_get(iter, tup);