Cross Reference: /external/valgrind/main/helgrind/hg

Lines Matching refs:i1
699    UWord    i1, i2, k, sz;
705    i1 = i2 = 0;
707       if (i1 >= wv1->size || i2 >= wv2->size)
710       if (wv1->words[i1] < wv2->words[i2]) {
711          i1++;
713       if (wv1->words[i1] > wv2->words[i2]) {
716          i1++;
720    tl_assert(i1 <= wv1->size);
722    tl_assert(i1 == wv1->size || i2 == wv2->size);
723    if (i1 == wv1->size && i2 < wv2->size) {
726    if (i2 == wv2->size && i1 < wv1->size) {
727       sz += (wv1->size - i1);
733    i1 = i2 = 0;
735       if (i1 >= wv1->size || i2 >= wv2->size)
737       if (wv1->words[i1] < wv2->words[i2]) {
738          wv_new->words[k++] = wv1->words[i1];
739          i1++;
741       if (wv1->words[i1] > wv2->words[i2]) {
745          wv_new->words[k++] = wv1->words[i1];
746          i1++;
750    tl_assert(i1 <= wv1->size);
752    tl_assert(i1 == wv1->size || i2 == wv2->size);
753    if (i1 == wv1->size && i2 < wv2->size) {
757    if (i2 == wv2->size && i1 < wv1->size) {
758       while (i1 < wv1->size)
759          wv_new->words[k++] = wv1->words[i1++];
769    UWord    i1, i2, k, sz;
794    i1 = i2 = 0;
796       if (i1 >= wv1->size || i2 >= wv2->size)
798       if (wv1->words[i1] < wv2->words[i2]) {
799          i1++;
801       if (wv1->words[i1] > wv2->words[i2]) {
805          i1++;
809    tl_assert(i1 <= wv1->size);
811    tl_assert(i1 == wv1->size || i2 == wv2->size);
816    i1 = i2 = 0;
818       if (i1 >= wv1->size || i2 >= wv2->size)
820       if (wv1->words[i1] < wv2->words[i2]) {
821          i1++;
823       if (wv1->words[i1] > wv2->words[i2]) {
826          wv_new->words[k++] = wv1->words[i1];
827          i1++;
831    tl_assert(i1 <= wv1->size);
833    tl_assert(i1 == wv1->size || i2 == wv2->size);
850    UWord    i1, i2, k, sz;
863    i1 = i2 = 0;
865       if (i1 >= wv1->size || i2 >= wv2->size)
867       if (wv1->words[i1] < wv2->words[i2]) {
869          i1++;
871       if (wv1->words[i1] > wv2->words[i2]) {
874          i1++;
878    tl_assert(i1 <= wv1->size);
880    tl_assert(i1 == wv1->size || i2 == wv2->size);
881    if (i2 == wv2->size && i1 < wv1->size) {
882       sz += (wv1->size - i1);
888    i1 = i2 = 0;
890       if (i1 >= wv1->size || i2 >= wv2->size)
892       if (wv1->words[i1] < wv2->words[i2]) {
893          wv_new->words[k++] = wv1->words[i1];
894          i1++;
896       if (wv1->words[i1] > wv2->words[i2]) {
899          i1++;
903    tl_assert(i1 <= wv1->size);
905    tl_assert(i1 == wv1->size || i2 == wv2->size);
906    if (i2 == wv2->size && i1 < wv1->size) {
907       while (i1 < wv1->size)
908          wv_new->words[k++] = wv1->words[i1++];