Lines Matching refs:children
36 // children are written before their parents
53 /* children.leaf_string contains this many bytes */
56 /* TRUE = children.data contains our children.
57 FALSE = children.offset contains offset to our children in the
60 /* When allocating our children, use a sequential array. */
62 /* This node's children are in a sequential array, meaning that the
63 first SEQUENTIAL_COUNT children have chars[n] = n. */
68 This is mainly used when adding new UIDs to our children to set
81 } *children;
90 } children;
92 /* Return pointer to node.children.chars[] */
94 ((unsigned char *)(node)->children.data)
95 /* Return pointer to node.children.node[] */
99 /* Return number of bytes allocated in node.children.data */
103 /* Return TRUE if children.leaf_string is set. */
106 sizeof((node)->children.static_leaf_string))
110 (node)->children.leaf_string : (node)->children.static_leaf_string)