gen.lib.cgraph.refstr__c Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-lgpl Show documentation
Show all versions of plantuml-lgpl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | PlantUML : a free UML diagram generator
* |
* +=======================================================================
*
* (C) Copyright 2009-2024, Arnaud Roques
*
* Project Info: https://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* https://plantuml.com/patreon (only 1$ per month!)
* https://plantuml.com/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* PlantUML distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library. If not, see dictref;
if (g != null)
dictref = CStarStar. BUILD(new ACCESS() {
public ST_dt_s get() {
return (ST_dt_s) g.clos.strdict;
}
public void set(ST_dt_s obj) {
g.clos.strdict = obj;
}
});
else
dictref = CStarStar. BUILD(new ACCESS() {
public ST_dt_s get() {
return zz.Refdict_default;
}
public void set(ST_dt_s obj) {
zz.Refdict_default = obj;
}
});
if (dictref.star() == null) {
dictref.star(agdtopen(zz, g, zz.Refstrdisc, zz.Dttree));
zz.HTML_BIT = 1 << 31;
zz.CNT_BITS = ~zz.HTML_BIT;
}
return dictref.star();
} finally {
LEAVING("f1nwss2xoaub1hyord232ugoj","refdict");
}
}
@Original(version="2.38.0", path="lib/cgraph/refstr.c", name="refsymbind", key="9ts4wqhw2xafdv3tlcilneewq", definition = "static refstr_t *refsymbind(Dict_t * strdict, char *s)")
@Reviewed(when = "10/11/2020")
private static ST_refstr_t refsymbind(Globals zz, ST_dt_s strdict, CString s) {
ENTERING("9ts4wqhw2xafdv3tlcilneewq","refsymbind");
try {
final ST_refstr_t key = new ST_refstr_t();
ST_refstr_t r;
// key.s = s.duplicate());
key.setString(s);
r = (ST_refstr_t) dtsearch(zz, strdict, key);
return r;
} finally {
LEAVING("9ts4wqhw2xafdv3tlcilneewq","refsymbind");
}
}
@Original(version="2.38.0", path="lib/cgraph/refstr.c", name="refstrbind", key="1scntgo71z7c2v15zapiyw59w", definition = "static char *refstrbind(Dict_t * strdict, char *s)")
private static CString refstrbind(Globals zz, ST_dt_s strdict, CString s) {
ENTERING("1scntgo71z7c2v15zapiyw59w","refstrbind");
try {
ST_refstr_t r;
r = refsymbind(zz, strdict, s);
if (r!=null)
return r.s;
else
return null;
} finally {
LEAVING("1scntgo71z7c2v15zapiyw59w","refstrbind");
}
}
@Original(version="2.38.0", path="lib/cgraph/refstr.c", name="agstrbind", key="bb8aqjshw3ecae2lsmhigd0mc", definition = "char *agstrbind(Agraph_t * g, char *s)")
public static CString agstrbind(Globals zz, ST_Agraph_s g, CString s) {
ENTERING("bb8aqjshw3ecae2lsmhigd0mc","agstrbind");
try {
return refstrbind(zz, refdict(zz, g), s);
} finally {
LEAVING("bb8aqjshw3ecae2lsmhigd0mc","agstrbind");
}
}
@Original(version="2.38.0", path="lib/cgraph/refstr.c", name="agstrdup", key="86oznromwhn9qeym0k7pih73q", definition = "char *agstrdup(Agraph_t * g, char *s)")
@Reviewed(when = "10/11/2020")
public static CString agstrdup(Globals zz, ST_Agraph_s g, CString s) {
ENTERING("86oznromwhn9qeym0k7pih73q","agstrdup");
try {
ST_refstr_t r;
ST_dt_s strdict;
// size_t sz;
if (s == null)
return null;
strdict = refdict(zz, g);
r = (ST_refstr_t) refsymbind(zz, strdict, s);
if (r!=null)
r.refcnt++;
else {
// sz = sizeof(ST_refstr_t.class).plus(s.length());
// if (g!=null)
// r = (ST_refstr_t) agalloc(g, sz);
// else
r = new ST_refstr_t();
r.refcnt = 1;
r.setString(s.duplicate());
// strcpy(r->store, s);
// r->s = r->store;
dtinsert(zz, strdict, r);
}
return r.s;
} finally {
LEAVING("86oznromwhn9qeym0k7pih73q","agstrdup");
}
}
@Original(version="2.38.0", path="lib/cgraph/refstr.c", name="agstrfree", key="enhn1ajfo86a19dgm4b8lduz7", definition = "int agstrfree(Agraph_t * g, char *s)")
public static int agstrfree(Globals zz, ST_Agraph_s g, CString s) {
ENTERING("enhn1ajfo86a19dgm4b8lduz7","agstrfree");
try {
ST_refstr_t r;
ST_dt_s strdict;
if (s == null)
return -1;
strdict = refdict(zz, g);
r = (ST_refstr_t) refsymbind(zz, strdict, s);
if (r!=null && (EQ_CSTRING(r.s, s))) {
r.refcnt--;
if ((r.refcnt!=0 && zz.CNT_BITS!=0) == false) {
agdtdelete(zz, g, strdict, r);
/*
if (g) agfree(g,r);
else free(r);
*/
}
}
if (r == null)
return -1;
return 0;
} finally {
LEAVING("enhn1ajfo86a19dgm4b8lduz7","agstrfree");
}
}
@Reviewed(when = "12/11/2020")
@Original(version="2.38.0", path="lib/cgraph/refstr.c", name="aghtmlstr", key="3em4wzjnpajd5d3igb90l3rml", definition = "int aghtmlstr(char *s)")
public static int aghtmlstr(Globals zz, CString s) {
ENTERING("3em4wzjnpajd5d3igb90l3rml","aghtmlstr");
try {
ST_refstr_t key;
if (s == null)
return 0;
key = (ST_refstr_t) s.getParent();
return (key.refcnt & zz.HTML_BIT);
} finally {
LEAVING("3em4wzjnpajd5d3igb90l3rml","aghtmlstr");
}
}
}