Searched refs:p_next (Results 1 – 25 of 26) sorted by relevance
12
88 FT_Byte* p_next; in tt_face_load_kern() local95 p_next = p; in tt_face_load_kern()104 p_next += length; in tt_face_load_kern()106 if ( p_next > p_limit ) /* handle broken table */ in tt_face_load_kern()107 p_next = p_limit; in tt_face_load_kern()117 p + 8 > p_next ) in tt_face_load_kern()123 if ( ( p_next - p ) < 6 * (int)num_pairs ) /* handle broken count */ in tt_face_load_kern()124 num_pairs = (FT_UInt)( ( p_next - p ) / 6 ); in tt_face_load_kern()159 p = p_next; in tt_face_load_kern()
17 %p_next = getelementptr inbounds i8, i8* %p, i32 1619 …%load2 = call <8 x i16> @llvm.arm.neon.vld1.v8i16.p0i8(i8* %p_next, i32 2) #4 ; non-aliasing load …
3460 template <typename T> T lvl_init_struct(void *p_next) {3463 out.pNext = p_next;
393 struct user_ent *p, *p_next; in user_ent_destroy() local402 p_next = p->next; in user_ent_destroy()404 p = p_next; in user_ent_destroy()
4628 const char *p_next;4675 for (p = path; *p; p = p_next)4683 p_next = (*q == '\0' ? q : q + 1);
3662 const char *p_next;3709 for (p = path; *p; p = p_next)3717 p_next = (*q == '\0' ? q : q + 1);
4625 const char *p_next;4672 for (p = path; *p; p = p_next)4680 p_next = (*q == '\0' ? q : q + 1);
6098 const char *p_next;6145 for (p = path; *p; p = p_next)6153 p_next = (*q == '\0' ? q : q + 1);
5882 const char *p_next;5929 for (p = path; *p; p = p_next)5937 p_next = (*q == '\0' ? q : q + 1);
6006 const char *p_next;6053 for (p = path; *p; p = p_next)6061 p_next = (*q == '\0' ? q : q + 1);
6221 const char *p_next;6268 for (p = path; *p; p = p_next)6276 p_next = (*q == '\0' ? q : q + 1);
6054 const char *p_next;6101 for (p = path; *p; p = p_next)6109 p_next = (*q == '\0' ? q : q + 1);