1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
--- 147 unchanged lines hidden (view full) ---
156 if (bits(val, 31,16)) { msb += 16; val >>= 16; }
157 if (bits(val, 15,8)) { msb += 8; val >>= 8; }
158 if (bits(val, 7,4)) { msb += 4; val >>= 4; }
159 if (bits(val, 3,2)) { msb += 2; val >>= 2; }
160 if (bits(val, 1,1)) { msb += 1; }
161 return msb;
162}
163
164#endif // __BASE_BITFIELD_HH__
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
--- 147 unchanged lines hidden (view full) ---
156 if (bits(val, 31,16)) { msb += 16; val >>= 16; }
157 if (bits(val, 15,8)) { msb += 8; val >>= 8; }
158 if (bits(val, 7,4)) { msb += 4; val >>= 4; }
159 if (bits(val, 3,2)) { msb += 2; val >>= 2; }
160 if (bits(val, 1,1)) { msb += 1; }
161 return msb;
162}
163
164#endif // __BASE_BITFIELD_HH__