128  *                            node, otherwise it is a leaf node
153  * leaf[0]: The unicode version, stored as a generation number that is
157  * leaf[1]: Canonical Combining Class. During normalization, we need
165  * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
186 #define LEAF_GEN(LEAF)	((LEAF)[0])  argument
187 #define LEAF_CCC(LEAF)	((LEAF)[1])  argument
188 #define LEAF_STR(LEAF)	((const char *)((LEAF) + 2))  argument
197 /* Size of the synthesized leaf used for Hangul syllable decomposition. */
272 	/* Fill in base of leaf. */  in utf8hangul()
296  * Returns the leaf if one exists, NULL otherwise.
372  * Returns the leaf if one exists, NULL otherwise.
389 	utf8leaf_t	*leaf;  in utf8nlen()  local
394 		leaf = utf8nlookup(um, n, hangul, s, len);  in utf8nlen()
395 		if (!leaf)  in utf8nlen()
397 		if (um->tables->utf8agetab[LEAF_GEN(leaf)] >  in utf8nlen()
400 		else if (LEAF_CCC(leaf) == DECOMPOSE)  in utf8nlen()
401 			ret += strlen(LEAF_STR(leaf));  in utf8nlen()
473 	utf8leaf_t *leaf;  in utf8byte()  local
500 			leaf = utf8lookup(u8c->um, u8c->n, u8c->hangul, u8c->s);  in utf8byte()
502 			leaf = utf8nlookup(u8c->um, u8c->n, u8c->hangul,  in utf8byte()
506 		/* No leaf found implies that the input is a binary blob. */  in utf8byte()
507 		if (!leaf)  in utf8byte()
510 		ccc = LEAF_CCC(leaf);  in utf8byte()
512 		if (u8c->um->tables->utf8agetab[LEAF_GEN(leaf)] >  in utf8byte()
518 			u8c->s = LEAF_STR(leaf);  in utf8byte()
527 			leaf = utf8lookup(u8c->um, u8c->n, u8c->hangul, u8c->s);  in utf8byte()
528 			if (!leaf)  in utf8byte()
530 			ccc = LEAF_CCC(leaf);  in utf8byte()