Searched refs:chainLength (Results 1 – 7 of 7) sorted by relevance
232 FT_ULong chainLength; in gxv_mort_chain_validate() local245 chainLength = FT_NEXT_ULONG( p ); in gxv_mort_chain_validate()249 gxv_mort_featurearray_validate( p, table + chainLength, in gxv_mort_chain_validate()252 gxv_mort_subtables_validate( p, table + chainLength, nSubtables, gxvalid ); in gxv_mort_chain_validate()253 gxvalid->subtable_length = chainLength; in gxv_mort_chain_validate()
125 FT_ULong chainLength; in gxv_morx_chain_validate() local138 chainLength = FT_NEXT_ULONG( p ); in gxv_morx_chain_validate()149 gxv_morx_subtables_validate( p, table + chainLength, in gxv_morx_chain_validate()152 gxvalid->subtable_length = chainLength; in gxv_morx_chain_validate()
705 int chainLength = dIn.readInt(); in loadStore() local708 if (chainLength != 0) in loadStore()710 chain = new Certificate[chainLength]; in loadStore()712 for (int i = 0; i != chainLength; i++) in loadStore()
709 int chainLength = dIn.readInt(); in loadStore() local712 if (chainLength != 0) in loadStore()714 chain = new Certificate[chainLength]; in loadStore()716 for (int i = 0; i != chainLength; i++) in loadStore()
107 const int chainLength = 32768; in basicChainCase() local114 for (int i = 0; err == VK_SUCCESS && i < chainLength; i++) in basicChainCase()
355 chainLength() { method in Edge
33050 const int chainLength = 32768; in TEST_F() local33053 for (int i = 0; i < chainLength; i++) { in TEST_F()