Home | History | Annotate | Download | only in vbit-test

Lines Matching full:u128

47          fprintf(fp, "%016"PRIx64, v.bits.u128[1]);
48 fprintf(fp, "%016"PRIx64, v.bits.u128[0]);
50 fprintf(fp, "%016"PRIx64, v.bits.u128[0]);
51 fprintf(fp, "%016"PRIx64, v.bits.u128[1]);
85 case 128: new.bits.u128[0] = ~0ull;
86 new.bits.u128[1] = ~0ull;
112 case 128: new.bits.u128[0] = 0x0;
113 new.bits.u128[1] = 0x0;
139 case 128: return v1.bits.u128[0] == v2.bits.u128[0] &&
140 v1.bits.u128[1] == v2.bits.u128[1];
168 bits = v.bits.u128[0];
170 bits = v.bits.u128[1];
195 new.bits.u128[0] = v.bits.u256[0];
196 new.bits.u128[1] = v.bits.u256[1];
198 new.bits.u128[0] = v.bits.u256[2];
199 new.bits.u128[1] = v.bits.u256[3];
235 new.bits.u128[0] = bits;
237 new.bits.u128[1] = ~0ull;
239 new.bits.u128[1] = 0;
242 new.bits.u128[1] = bits;
244 new.bits.u128[0] = ~0ull;
246 new.bits.u128[0] = 0;
283 if (v.bits.u128[1] != 0) {
284 new.bits.u128[0] = v.bits.u128[0];
285 new.bits.u128[1] = left64(v.bits.u128[1]);
287 new.bits.u128[0] = left64(v.bits.u128[0]);
288 if (new.bits.u128[0] & (1ull << 63)) { // MSB is set
289 new.bits.u128[1] = ~0ull;
291 new.bits.u128[1] = 0;
295 if (v.bits.u128[0] != 0) {
296 new.bits.u128[0] = left64(v.bits.u128[0]);
297 new.bits.u128[1] = v.bits.u128[1];
299 new.bits.u128[1] = left64(v.bits.u128[1]);
300 if (new.bits.u128[1] & (1ull << 63)) { // MSB is set
301 new.bits.u128[0] = ~0ull;
303 new.bits.u128[0] = 0;
312 uint64_t b1 = new.bits.u128[1];
313 uint64_t b0 = new.bits.u128[0];
326 uint64_t b1 = new.bits.u128[0];
327 uint64_t b0 = new.bits.u128[1];
359 case 128: new.bits.u128[0] = v1.bits.u128[0] | v2.bits.u128[0];
360 new.bits.u128[1] = v1.bits.u128[1] | v2.bits.u128[1];
387 case 128: new.bits.u128[0] = v1.bits.u128[0] & v2.bits.u128[0];
388 new.bits.u128[1] = v1.bits.u128[1] & v2.bits.u128[1];
419 new.bits.u128[0] = v2.bits.u64;
420 new.bits.u128[1] = v1.bits.u64;
422 new.bits.u128[0] = v1.bits.u64;
423 new.bits.u128[1] = v2.bits.u64;
428 new.bits.u256[0] = v2.bits.u128[0];
429 new.bits.u256[1] = v2.bits.u128[1];
430 new.bits.u256[2] = v1.bits.u128[0];
431 new.bits.u256[3] = v1.bits.u128[1];
433 new.bits.u256[0] = v1.bits.u128[0];
434 new.bits.u256[1] = v1.bits.u128[1];
435 new.bits.u256[2] = v2.bits.u128[0];
436 new.bits.u256[3] = v2.bits.u128[1];
459 new.bits.u64 = v.bits.u128[1];
461 new.bits.u64 = v.bits.u128[0];
465 new.bits.u128[0] = v.bits.u256[2];
466 new.bits.u128[1] = v.bits.u256[3];
468 new.bits.u128[0] = v.bits.u256[0];
469 new.bits.u128[1] = v.bits.u256[1];
500 new.bits.u128[0] = bits;
501 new.bits.u128[1] = 0;
503 new.bits.u128[0] = 0;
504 new.bits.u128[1] = bits;
530 new.bits.u256[0] = v.bits.u128[0];
531 new.bits.u256[1] = v.bits.u128[1];
537 new.bits.u256[2] = v.bits.u128[1];
538 new.bits.u256[3] = v.bits.u128[0];
560 case 128: if (v.bits.u128[1] == (1ull << 63)) sextend = 1; break;
587 new.bits.u128[0] = 1ull << bitno;
588 new.bits.u128[1] = 0;
590 new.bits.u128[0] = 0;
591 u128[1] = 1ull << (bitno - 64);
595 new.bits.u128[0] = 0;
596 new.bits.u128[1] = 1ull << bitno;
598 new.bits.u128[0] = 1ull << (bitno - 64);
599 new.bits.u128[1] = 0;