Home
last modified time | relevance | path

Searched refs:gnode (Results 1 – 13 of 13) sorted by relevance

/external/freetype/src/cache/
Dftcglyph.c31 FTC_GNode_Init( FTC_GNode gnode, in FTC_GNode_Init() argument
35 gnode->family = family; in FTC_GNode_Init()
36 gnode->gindex = gindex; in FTC_GNode_Init()
42 FTC_GNode_UnselectFamily( FTC_GNode gnode, in FTC_GNode_UnselectFamily() argument
45 FTC_Family family = gnode->family; in FTC_GNode_UnselectFamily()
48 gnode->family = NULL; in FTC_GNode_UnselectFamily()
55 FTC_GNode_Done( FTC_GNode gnode, in FTC_GNode_Done() argument
59 gnode->gindex = 0; in FTC_GNode_Done()
61 FTC_GNode_UnselectFamily( gnode, cache ); in FTC_GNode_Done()
71 FTC_GNode gnode = (FTC_GNode)ftcgnode; in ftc_gnode_compare() local
[all …]
Dftcsbits.c108 FTC_GNode gnode = FTC_GNODE( snode ); in ftc_snode_load() local
109 FTC_Family family = gnode->family; in ftc_snode_load()
116 if ( (FT_UInt)(gindex - gnode->gindex) >= snode->count ) in ftc_snode_load()
122 sbit = snode->sbits + ( gindex - gnode->gindex ); in ftc_snode_load()
332 FTC_GNode gnode = FTC_GNODE( snode ); in ftc_snode_compare() local
339 result = FT_BOOL( gnode->family == gquery->family && in ftc_snode_compare()
340 (FT_UInt)( gindex - gnode->gindex ) < snode->count ); in ftc_snode_compare()
344 FTC_SBit sbit = snode->sbits + ( gindex - gnode->gindex ); in ftc_snode_compare()
Dftcglyph.h189 FTC_GNode_Compare( FTC_GNode gnode,
199 FTC_GNode_UnselectFamily( FTC_GNode gnode,
Dftcbasic.c209 FTC_GNode gnode = (FTC_GNode)ftcgnode; in ftc_basic_gnode_compare_faceid() local
211 FTC_BasicFamily family = (FTC_BasicFamily)gnode->family; in ftc_basic_gnode_compare_faceid()
223 FTC_GNode_UnselectFamily( gnode, cache ); in ftc_basic_gnode_compare_faceid()
Dftccback.h65 ftc_gnode_compare( FTC_Node gnode,
Dftcsbits.h34 FTC_GNodeRec gnode; member
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/
DGraphvizGrapher.java242 GraphvizNode gnode = new GraphvizNode(nodeId); in newInterfaceNode() local
243 gnode.setStyle(NodeStyle.DASHED); in newInterfaceNode()
245 gnode.setTitle(nameFactory.getClassName(key)); in newInterfaceNode()
246 gnode.addSubtitle(0, nameFactory.getAnnotationName(key)); in newInterfaceNode()
247 addNode(gnode); in newInterfaceNode()
252 GraphvizNode gnode = new GraphvizNode(nodeId); in newImplementationNode() local
253 gnode.setStyle(NodeStyle.SOLID); in newImplementationNode()
255 gnode.setHeaderBackgroundColor("#000000"); in newImplementationNode()
256 gnode.setHeaderTextColor("#ffffff"); in newImplementationNode()
257 gnode.setTitle(nameFactory.getClassName(nodeId.getKey())); in newImplementationNode()
[all …]
/external/syslinux/com32/lua/src/
Dltable.c51 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
61 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
86 return gnode(t, 0); in hashnum()
158 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ in findindex()
180 if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */ in luaH_next()
181 setobj2s(L, key, gkey(gnode(t, i))); in luaH_next()
182 setobj2s(L, key+1, gval(gnode(t, i))); in luaH_next()
294 Node *n = gnode(t, i); in setnodevector()
301 t->lastfree = gnode(t, size); /* all positions are free */ in setnodevector()
Dltable.h13 #define gnode(t,i) (&(t)->node[i]) macro
Dlgc.c94 #define gnodelast(h) gnode(h, cast(size_t, sizenode(h)))
360 for (n = gnode(h, 0); n < limit; n++) { in traverseweakvalue()
392 for (n = gnode(h, 0); n < limit; n++) { in traverseephemeron()
421 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traversestrongtable()
629 for (n = gnode(h, 0); n < limit; n++) { in clearkeys()
653 for (n = gnode(h, 0); n < limit; n++) { in clearvalues()
/external/skia/third_party/lua/src/
Dltable.c51 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
61 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
157 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ in findindex()
179 if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */ in luaH_next()
180 setobj2s(L, key, gkey(gnode(t, i))); in luaH_next()
181 setobj2s(L, key+1, gval(gnode(t, i))); in luaH_next()
293 Node *n = gnode(t, i); in setnodevector()
300 t->lastfree = gnode(t, size); /* all positions are free */ in setnodevector()
Dltable.h13 #define gnode(t,i) (&(t)->node[i]) macro
Dlgc.c94 #define gnodelast(h) gnode(h, cast(size_t, sizenode(h)))
360 for (n = gnode(h, 0); n < limit; n++) { in traverseweakvalue()
392 for (n = gnode(h, 0); n < limit; n++) { in traverseephemeron()
421 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traversestrongtable()
622 for (n = gnode(h, 0); n < limit; n++) { in clearkeys()
646 for (n = gnode(h, 0); n < limit; n++) { in clearvalues()