github.com/ader1990/go@v0.0.0-20140630135419-8c24447fa791/src/cmd/cc/bits.c (about) 1 // Inferno utils/cc/bits.c 2 // http://code.google.com/p/inferno-os/source/browse/utils/cc/bits.c 3 // 4 // Copyright © 1994-1999 Lucent Technologies Inc. All rights reserved. 5 // Portions Copyright © 1995-1997 C H Forsyth (forsyth@terzarima.net) 6 // Portions Copyright © 1997-1999 Vita Nuova Limited 7 // Portions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuova.com) 8 // Portions Copyright © 2004,2006 Bruce Ellis 9 // Portions Copyright © 2005-2007 C H Forsyth (forsyth@terzarima.net) 10 // Revisions Copyright © 2000-2007 Lucent Technologies Inc. and others 11 // Portions Copyright © 2009 The Go Authors. All rights reserved. 12 // 13 // Permission is hereby granted, free of charge, to any person obtaining a copy 14 // of this software and associated documentation files (the "Software"), to deal 15 // in the Software without restriction, including without limitation the rights 16 // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 17 // copies of the Software, and to permit persons to whom the Software is 18 // furnished to do so, subject to the following conditions: 19 // 20 // The above copyright notice and this permission notice shall be included in 21 // all copies or substantial portions of the Software. 22 // 23 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 24 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 25 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 26 // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 27 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 28 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 29 // THE SOFTWARE. 30 31 #include <u.h> 32 #include "cc.h" 33 34 Bits 35 bor(Bits a, Bits b) 36 { 37 Bits c; 38 int i; 39 40 for(i=0; i<BITS; i++) 41 c.b[i] = a.b[i] | b.b[i]; 42 return c; 43 } 44 45 Bits 46 band(Bits a, Bits b) 47 { 48 Bits c; 49 int i; 50 51 for(i=0; i<BITS; i++) 52 c.b[i] = a.b[i] & b.b[i]; 53 return c; 54 } 55 56 /* 57 Bits 58 bnot(Bits a) 59 { 60 Bits c; 61 int i; 62 63 for(i=0; i<BITS; i++) 64 c.b[i] = ~a.b[i]; 65 return c; 66 } 67 */ 68 69 int 70 bany(Bits *a) 71 { 72 int i; 73 74 for(i=0; i<BITS; i++) 75 if(a->b[i]) 76 return 1; 77 return 0; 78 } 79 80 int 81 beq(Bits a, Bits b) 82 { 83 int i; 84 85 for(i=0; i<BITS; i++) 86 if(a.b[i] != b.b[i]) 87 return 0; 88 return 1; 89 } 90 91 int 92 bnum(Bits a) 93 { 94 int i; 95 int32 b; 96 97 for(i=0; i<BITS; i++) 98 if(b = a.b[i]) 99 return 32*i + bitno(b); 100 diag(Z, "bad in bnum"); 101 return 0; 102 } 103 104 Bits 105 blsh(uint n) 106 { 107 Bits c; 108 109 c = zbits; 110 c.b[n/32] = 1L << (n%32); 111 return c; 112 } 113 114 int 115 bset(Bits a, uint n) 116 { 117 if(a.b[n/32] & (1L << (n%32))) 118 return 1; 119 return 0; 120 }