Searched refs:src1 (Results 1 - 2 of 2) sorted by relevance

/haiku/src/libs/glut/
H A Dglutint.h68 #define ADD_TIME(dest, src1, src2) { \
69 (dest).val = (src1).val + (src2).val; \
72 #define TIMEDELTA(dest, src1, src2) { \
73 (dest).val = (src1).val - (src2).val; \
87 #define ADD_TIME(dest, src1, src2) { \
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) { \
100 if(((dest).tv_usec = (src1)
[all...]
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c1040 re_node_set_add_intersect (re_node_set *dest, const re_node_set *src1,
1044 if (src1->nelem == 0 || src2->nelem == 0)
1049 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc)
1051 int new_alloc = src1->nelem + src2->nelem + dest->alloc;
1061 sbase = dest->nelem + src1->nelem + src2->nelem;
1062 i1 = src1->nelem - 1;
1067 if (src1->elems[i1] == src2->elems[i2])
1070 while (id >= 0 && dest->elems[id] > src1->elems[i1])
1073 if (id < 0 || dest->elems[id] != src1->elems[i1])
1074 dest->elems[--sbase] = src1
1038 re_node_set_add_intersect(re_node_set *dest, const re_node_set *src1, const re_node_set *src2) argument
1129 re_node_set_init_union(re_node_set *dest, const re_node_set *src1, const re_node_set *src2) argument
[all...]

Completed in 83 milliseconds