Lines Matching refs:words
3 /*--- Sets of words, with unique set identifiers. ---*/
137 UWord* words;
192 wv->words = NULL;
195 wv->words = wsu->alloc( wsu->cc, (SizeT)sz * sizeof(UWord) );
203 if (wv->words) {
204 dealloc(wv->words);
228 if (wv1->words[i] == wv2->words[i])
230 if (wv1->words[i] < wv2->words[i])
232 if (wv1->words[i] > wv2->words[i])
419 return (Bool)(wv->size == 1 && wv->words[0] == w);
438 return wv->words[0];
447 void HG_(getPayloadWS) ( /*OUT*/UWord** words, /*OUT*/UWord* nWords,
456 *words = wv->words;
516 if (wv->words[i] >= wv->words[i+1])
529 if (wv->words[i] == w)
541 wv->words[0] = w1;
545 wv->words[0] = w1;
546 wv->words[1] = w2;
551 wv->words[0] = w2;
552 wv->words[1] = w1;
576 VG_(printf)("%p", (void*)wv->words[i]);
619 if (wv->words[k] == w) {
627 for (; k < wv->size && wv->words[k] < w; k++) {
628 wv_new->words[j++] = wv->words[k];
630 wv_new->words[j++] = w;
632 tl_assert(wv->words[k] > w);
633 wv_new->words[j++] = wv->words[k];
666 if (wv->words[i] == w)
683 wv_new->words[k++] = wv->words[j];
710 if (wv1->words[i1] < wv2->words[i2]) {
713 if (wv1->words[i1] > wv2->words[i2]) {
737 if (wv1->words[i1] < wv2->words[i2]) {
738 wv_new->words[k++] = wv1->words[i1];
741 if (wv1->words[i1] > wv2->words[i2]) {
742 wv_new->words[k++] = wv2->words[i2];
745 wv_new->words[k++] = wv1->words[i1];
755 wv_new->words[k++] = wv2->words[i2++];
759 wv_new->words[k++] = wv1->words[i1++];
798 if (wv1->words[i1] < wv2->words[i2]) {
801 if (wv1->words[i1] > wv2->words[i2]) {
820 if (wv1->words[i1] < wv2->words[i2]) {
823 if (wv1->words[i1] > wv2->words[i2]) {
826 wv_new->words[k++] = wv1->words[i1];
867 if (wv1->words[i1] < wv2->words[i2]) {
871 if (wv1->words[i1] > wv2->words[i2]) {
892 if (wv1->words[i1] < wv2->words[i2]) {
893 wv_new->words[k++] = wv1->words[i1];
896 if (wv1->words[i1] > wv2->words[i2]) {
908 wv_new->words[k++] = wv1->words[i1++];
931 VG_(printf)("%lu", wv->words[i]);
