Home
last modified time | relevance | path

Searched refs:src2 (Results 1 – 2 of 2) sorted by relevance

/haiku/src/libs/glut/
H A Dglutint.h68 #define ADD_TIME(dest, src1, src2) { \ argument
69 (dest).val = (src1).val + (src2).val; \
72 #define TIMEDELTA(dest, src1, src2) { \ argument
73 (dest).val = (src1).val - (src2).val; \
87 #define ADD_TIME(dest, src1, src2) { \ argument
89 (src1).tv_usec + (src2).tv_usec) >= 1000000) { \
91 (dest).tv_sec = (src1).tv_sec + (src2).tv_sec + 1; \
93 (dest).tv_sec = (src1).tv_sec + (src2).tv_sec; \
99 #define TIMEDELTA(dest, src1, src2) { \ argument
100 if(((dest).tv_usec = (src1).tv_usec - (src2).tv_usec) < 0) { \
[all …]
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c1053 const re_node_set *src2) in re_node_set_add_intersect() argument
1056 if (src1->nelem == 0 || src2->nelem == 0) in re_node_set_add_intersect()
1061 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc) in re_node_set_add_intersect()
1063 Idx new_alloc = src1->nelem + src2->nelem + dest->alloc; in re_node_set_add_intersect()
1073 sbase = dest->nelem + src1->nelem + src2->nelem; in re_node_set_add_intersect()
1075 i2 = src2->nelem - 1; in re_node_set_add_intersect()
1079 if (src1->elems[i1] == src2->elems[i2]) in re_node_set_add_intersect()
1093 else if (src1->elems[i1] < src2->elems[i2]) in re_node_set_add_intersect()
1106 is = dest->nelem + src1->nelem + src2->nelem - 1; in re_node_set_add_intersect()
1144 const re_node_set *src2) in re_node_set_init_union() argument
[all …]