Searched refs:p_next (Results 1 – 15 of 15) sorted by relevance
89 FT_Byte* p_next; in tt_face_load_kern() local96 p_next = p; in tt_face_load_kern()105 p_next += length; in tt_face_load_kern()107 if ( p_next > p_limit ) /* handle broken table */ in tt_face_load_kern()108 p_next = p_limit; in tt_face_load_kern()118 if ( ( p_next - p ) < 6 * (int)num_pairs ) /* handle broken count */ in tt_face_load_kern()119 num_pairs = (FT_UInt)( ( p_next - p ) / 6 ); in tt_face_load_kern()154 p = p_next; in tt_face_load_kern()
39 struct t_os_queue_elem *p_next; /**< Pointer to next list queue element. */ member
242 struct hshf_control_t_list_node *p_next; member
2928 char *path, *p, *p_next, *p1; in my_execvpe() local2948 for (p = path; p != NULL; p = p_next) { in my_execvpe()2951 p_next = NULL; in my_execvpe()2954 p_next = p1 + 1; in my_execvpe()
2663 char *path, *p, *p_next, *p1; in my_execvpe() local2681 for(p = path; p != NULL; p = p_next) { in my_execvpe()2684 p_next = NULL; in my_execvpe()2687 p_next = p1 + 1; in my_execvpe()
3902 p = p_next; in JS_NewStringLen()3904 p = p_next; in JS_NewStringLen()9898 p = p_next; in skip_spaces()20193 p = p_next; in js_parse_template_part()20320 p = p_next; in js_parse_string()20395 p = p_next; in js_parse_regexp()20407 p = p_next; in js_parse_regexp()20422 c = *p_next++; in js_parse_regexp()20433 p = p_next; in js_parse_regexp()28745 p = p_next; in dump_pc2line()[all …]
5067 const char *p_next;5114 for (p = path; *p; p = p_next)5122 p_next = (*q == '\0' ? q : q + 1);
4156 const char *p_next;4203 for (p = path; *p; p = p_next)4211 p_next = (*q == '\0' ? q : q + 1);
3663 const char *p_next;3710 for (p = path; *p; p = p_next)3718 p_next = (*q == '\0' ? q : q + 1);
4628 const char *p_next;4675 for (p = path; *p; p = p_next)4683 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);
Completed in 217 milliseconds