You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

101 lines
3.6 KiB

  1. /***************************************************************************
  2. * Copyright (C) 2004, 2005 by Dominic Rath *
  3. * Dominic.Rath@gmx.de *
  4. * *
  5. * Copyright (C) 2007,2008 √ėyvind Harboe *
  6. * oyvind.harboe@zylin.com *
  7. * *
  8. * This program is free software; you can redistribute it and/or modify *
  9. * it under the terms of the GNU General Public License as published by *
  10. * the Free Software Foundation; either version 2 of the License, or *
  11. * (at your option) any later version. *
  12. * *
  13. * This program is distributed in the hope that it will be useful, *
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of *
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
  16. * GNU General Public License for more details. *
  17. * *
  18. * You should have received a copy of the GNU General Public License *
  19. * along with this program; if not, write to the *
  20. * Free Software Foundation, Inc., *
  21. * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
  22. ***************************************************************************/
  23. #ifndef BINARYBUFFER_H
  24. #define BINARYBUFFER_H
  25. #include "types.h"
  26. /* support functions to access arbitrary bits in a byte array
  27. * flip_u32 inverses the bit order inside a 32-bit word (31..0 -> 0..31)
  28. */
  29. /* inlining this will help show what fn that is taking time during profiling. */
  30. static __inline void buf_set_u32(u8* buffer, unsigned int first, unsigned int num, u32 value)
  31. {
  32. if ((num==32)&&(first==0))
  33. {
  34. buffer[3]=(value>>24)&0xff;
  35. buffer[2]=(value>>16)&0xff;
  36. buffer[1]=(value>>8)&0xff;
  37. buffer[0]=(value>>0)&0xff;
  38. } else
  39. {
  40. unsigned int i;
  41. for (i=first; i<first+num; i++)
  42. {
  43. if (((value >> (i-first))&1) == 1)
  44. buffer[i/8] |= 1 << (i%8);
  45. else
  46. buffer[i/8] &= ~(1 << (i%8));
  47. }
  48. }
  49. }
  50. static __inline u32 buf_get_u32(u8* buffer, unsigned int first, unsigned int num)
  51. {
  52. if ((num==32)&&(first==0))
  53. {
  54. return (((u32)buffer[3])<<24)|(((u32)buffer[2])<<16)|(((u32)buffer[1])<<8)|(((u32)buffer[0])<<0);
  55. } else
  56. {
  57. u32 result = 0;
  58. unsigned int i;
  59. for (i=first; i<first+num; i++)
  60. {
  61. if (((buffer[i/8]>>(i%8))&1) == 1)
  62. result |= 1 << (i-first);
  63. }
  64. return result;
  65. }
  66. }
  67. extern u32 flip_u32(u32 value, unsigned int num);
  68. extern int buf_cmp(u8 *buf1, u8 *buf2, int size);
  69. extern int buf_cmp_mask(u8 *buf1, u8 *buf2, u8 *mask, int size);
  70. extern u8* buf_cpy(u8 *from, u8 *to, int size);
  71. extern u8* buf_set_ones(u8 *buf, int count);
  72. extern u8* buf_set_buf(u8 *src, int src_start, u8 *dst, int dst_start, int len);
  73. extern int str_to_buf(const char *str, int len, u8 *bin_buf, int buf_size, int radix);
  74. extern char* buf_to_str(const u8 *buf, int size, int radix);
  75. struct scan_field_s;
  76. extern int buf_to_u32_handler(u8 *in_buf, void *priv, struct scan_field_s *field);
  77. #define CEIL(m, n) ((m + n - 1) / n)
  78. /* read a u32 from a buffer in target memory endianness */
  79. static __inline u32 fast_target_buffer_get_u32(u8 *buffer, int little)
  80. {
  81. if (little)
  82. return le_to_h_u32(buffer);
  83. else
  84. return be_to_h_u32(buffer);
  85. }
  86. #endif /* BINARYBUFFER_H */