/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/ |
H A D | bitops.h | 115 find_first_bit(const unsigned long *addr, unsigned long size) argument 120 for (bit = 0; size >= BITS_PER_LONG; 121 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) { 126 if (size) { 127 mask = (*addr) & BITMAP_LAST_WORD_MASK(size); 131 bit += size; 137 find_first_zero_bit(const unsigned long *addr, unsigned long size) argument 142 for (bit = 0; size >= BITS_PER_LONG; 143 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) { 148 if (size) { 159 find_last_bit(const unsigned long *addr, unsigned long size) argument 185 find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset) argument 224 find_next_zero_bit(const unsigned long *addr, unsigned long size, unsigned long offset) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/hwasan/ |
H A D | hwasan_interceptors.cpp | 72 int __sanitizer_posix_memalign(void **memptr, uptr alignment, uptr size) { argument 75 int res = hwasan_posix_memalign(memptr, alignment, size, &stack); 79 void * __sanitizer_memalign(uptr alignment, uptr size) { argument 81 return hwasan_memalign(alignment, size, &stack); 84 void * __sanitizer_aligned_alloc(uptr alignment, uptr size) { argument 86 return hwasan_aligned_alloc(alignment, size, &stack); 89 void * __sanitizer___libc_memalign(uptr alignment, uptr size) { argument 91 void *ptr = hwasan_memalign(alignment, size, &stack); 93 DTLS_on_libc_memalign(ptr, size); 97 void * __sanitizer_valloc(uptr size) { argument 102 __sanitizer_pvalloc(uptr size) argument 137 __sanitizer_calloc(uptr nmemb, uptr size) argument 145 __sanitizer_realloc(void *ptr, uptr size) argument 163 __sanitizer_reallocarray(void *ptr, uptr nmemb, uptr size) argument 168 __sanitizer_malloc(uptr size) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_new_delete.cpp | 27 DECLARE_REAL(void *, malloc, uptr size) 33 return InternalAlloc(size); \ 36 SCOPED_INTERCEPTOR_RAW(mangled_name, size); \ 37 p = user_alloc(thr, pc, size); \ 40 ReportOutOfMemory(size, &stack); \ 43 invoke_malloc_hook(p, size); \ 48 return InternalAlloc(size, nullptr, (uptr)align); \ 51 SCOPED_INTERCEPTOR_RAW(mangled_name, size); \ 52 p = user_memalign(thr, pc, (uptr)align, size); \ 55 ReportOutOfMemory(size, 63 operator new(__sanitizer::uptr size) argument 69 operator new[](__sanitizer::uptr size) argument 75 operator new(__sanitizer::uptr size, std::nothrow_t const&) argument 81 operator new[](__sanitizer::uptr size, std::nothrow_t const&) argument 87 operator new(__sanitizer::uptr size, std::align_val_t align) argument 93 operator new[](__sanitizer::uptr size, std::align_val_t align) argument 100 operator new(__sanitizer::uptr size, std::align_val_t align, std::nothrow_t const&) argument 109 operator new[](__sanitizer::uptr size, std::align_val_t align, std::nothrow_t const&) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/asan/ |
H A D | asan_malloc_linux.cpp | 86 void* MemalignFromLocalPool(uptr alignment, uptr size) { argument 89 PosixMemalignFromLocalPool(&ptr, alignment, size); 107 static void *ReallocFromLocalPool(void *ptr, uptr size) { argument 109 const uptr copy_size = Min(size, kDlsymAllocPoolSize - offset); 112 new_ptr = AllocateFromLocalPool(size); 116 new_ptr = asan_malloc(size, &stack); 140 INTERCEPTOR(void*, malloc, uptr size) { argument 143 return AllocateFromLocalPool(size); 146 return asan_malloc(size, &stack); 149 INTERCEPTOR(void*, calloc, uptr nmemb, uptr size) { argument 158 INTERCEPTOR(void*, realloc, void *ptr, uptr size) argument 169 INTERCEPTOR(void*, reallocarray, void *ptr, uptr nmemb, uptr size) argument 177 INTERCEPTOR(void*, memalign, uptr boundary, uptr size) argument 182 INTERCEPTOR(void*, __libc_memalign, uptr boundary, uptr size) argument 191 INTERCEPTOR(void*, aligned_alloc, uptr boundary, uptr size) argument 223 INTERCEPTOR(int, posix_memalign, void **memptr, uptr alignment, uptr size) argument 230 INTERCEPTOR(void*, valloc, uptr size) argument 236 INTERCEPTOR(void*, pvalloc, uptr size) argument [all...] |
H A D | asan_new_delete.cpp | 77 void *res = asan_memalign(0, size, &stack, type); \ 79 ReportOutOfMemory(size, &stack); \ 84 void *res = asan_memalign((uptr)align, size, &stack, type); \ 86 ReportOutOfMemory(size, &stack); \ 98 void *operator new(size_t size) argument 101 void *operator new[](size_t size) argument 104 void *operator new(size_t size, std::nothrow_t const&) argument 107 void *operator new[](size_t size, std::nothrow_t const&) argument 110 void *operator new(size_t size, std::align_val_t align) argument 113 void *operator new[](size_t size, st argument 116 operator new(size_t size, std::align_val_t align, std::nothrow_t const&) argument 119 operator new[](size_t size, std::align_val_t align, std::nothrow_t const&) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_flag_parser.h | 26 // into the buffer of size `size`. Returns false if truncation occurred and 28 virtual bool Format(char *buffer, uptr size) { argument 29 if (size > 0) 37 inline bool FormatString(char *buffer, uptr size, const char *str_to_use) { argument 39 internal_snprintf(buffer, size, "%s", str_to_use); 40 return num_symbols_should_write < size; 51 bool Format(char *buffer, uptr size) final; 78 inline bool FlagHandler<bool>::Format(char *buffer, uptr size) { argument 79 return FormatString(buffer, size, *t 99 Format(char *buffer, uptr size) argument 111 Format(char *buffer, uptr size) argument 125 Format(char *buffer, uptr size) argument 140 Format(char *buffer, uptr size) argument 155 Format(char *buffer, uptr size) argument [all...] |
H A D | sanitizer_ring_buffer.h | 18 // RingBuffer<T>: fixed-size ring buffer optimized for speed of push(). 33 UnmapOrDie(this, SizeInBytes(size())); 35 uptr size() const { function in class:__sanitizer::RingBuffer 45 uptr SizeInBytes() { return SizeInBytes(size()); } 56 CHECK_LT(Idx, size()); 59 IdxNext -= size(); 80 // bytes. Has significant constraints on size and alignment of storage. 85 // Top byte of long_ stores the buffer size in pages. 93 void Init(void *storage, uptr size) { argument 95 CHECK(IsPowerOfTwo(size)); 109 CompactRingBuffer(void *storage, uptr size) argument 115 uptr size = other.GetStorageSize(); local 132 uptr size() const { return GetStorageSize() / sizeof(T); } function in class:__sanitizer::CompactRingBuffer [all...] |
/freebsd-11-stable/contrib/unbound/util/ |
H A D | regional.c | 50 /** increase size until it fits alignment of s bytes */ 52 /** what size to align on; make sure a char* fits in it. */ 55 /** Default reasonable size for chunks */ 61 /** Default size for large objects - allocated outside of chunks. */ 85 * @param size: length of first block. 90 regional_create_custom_large_object(size_t size, size_t large_object_size) argument 93 size = ALIGN_UP(size, ALIGNMENT); 94 r = (struct regional*)malloc(size); 95 log_assert(sizeof(struct regional) <= size); 104 regional_create_custom(size_t size) argument 111 regional_create_nochunk(size_t size) argument 143 regional_alloc(struct regional *r, size_t size) argument 183 regional_alloc_init(struct regional* r, const void *init, size_t size) argument 192 regional_alloc_zero(struct regional *r, size_t size) argument [all...] |
/freebsd-11-stable/contrib/wpa/src/utils/ |
H A D | radiotap.c | 22 [IEEE80211_RADIOTAP_TSFT] = { .align = 8, .size = 8, }, 23 [IEEE80211_RADIOTAP_FLAGS] = { .align = 1, .size = 1, }, 24 [IEEE80211_RADIOTAP_RATE] = { .align = 1, .size = 1, }, 25 [IEEE80211_RADIOTAP_CHANNEL] = { .align = 2, .size = 4, }, 26 [IEEE80211_RADIOTAP_FHSS] = { .align = 2, .size = 2, }, 27 [IEEE80211_RADIOTAP_DBM_ANTSIGNAL] = { .align = 1, .size = 1, }, 28 [IEEE80211_RADIOTAP_DBM_ANTNOISE] = { .align = 1, .size = 1, }, 29 [IEEE80211_RADIOTAP_LOCK_QUALITY] = { .align = 2, .size = 2, }, 30 [IEEE80211_RADIOTAP_TX_ATTENUATION] = { .align = 2, .size = 2, }, 31 [IEEE80211_RADIOTAP_DB_TX_ATTENUATION] = { .align = 2, .size 188 find_override(struct ieee80211_radiotap_iterator *iterator, int *align, int *size) argument 239 int pad, align, size, subns; local [all...] |
/freebsd-11-stable/contrib/libarchive/libarchive/test/ |
H A D | test_read_filter_uudecode.c | 81 size_t size; local 100 size = extra * 1024; 101 /* Add extra text size of which is from 1K bytes to 103 while (size) { 104 if (size > sizeof(extradata)-1) { 107 size -= sizeof(extradata)-1; 109 memcpy(p, extradata_ptr, size-1); 110 p += size-1; 117 size = extra * 1024 + uusize; 125 read_open_memory(a, buff, size, [all...] |
/freebsd-11-stable/sys/dev/drm2/ |
H A D | drm_buffer.c | 29 * Multipart buffer for coping data which is larger than the page size. 44 * size: The number of bytes to allocate. 46 int drm_buffer_alloc(struct drm_buffer **buf, int size) argument 48 int nr_pages = size / PAGE_SIZE + 1; 59 size, nr_pages); 63 (*buf)->size = size; 68 malloc(min(PAGE_SIZE, size - idx * PAGE_SIZE), 75 idx + 1, size, nr_pages); 102 * size 104 drm_buffer_copy_from_user(struct drm_buffer *buf, void __user *user_data, int size) argument [all...] |
/freebsd-11-stable/lib/libc/stdlib/ |
H A D | merge.c | 113 mergesort_b(void *base, size_t nmemb, size_t size, cmp_t cmp) argument 115 mergesort(void *base, size_t nmemb, size_t size, cmp_t cmp) 124 if (size < PSIZE / 2) { /* Pointers must fit into 2 * size. */ 137 if (!(size % ISIZE) && !(((char *)base - (char *)0) % ISIZE)) 140 if ((list2 = malloc(nmemb * size + PSIZE)) == NULL) 144 setup(list1, list2, nmemb, size, cmp); 145 last = list2 + nmemb * size; 168 while ((b += size) < t && CMP(q, b) >sense) 174 EXPONENTIAL: for (i = size; ; 276 setup(u_char *list1, u_char *list2, size_t n, size_t size, cmp_t cmp) argument 347 insertionsort(u_char *a, size_t n, size_t size, cmp_t cmp) argument [all...] |
/freebsd-11-stable/lib/libc/stdio/ |
H A D | setvbuf.c | 51 setvbuf(FILE * __restrict fp, char * __restrict buf, int mode, size_t size) argument 58 * Verify arguments. The `int' limit on `size' is due to this 59 * particular implementation. Note, buf and size are ignored 63 if ((mode != _IOFBF && mode != _IOLBF) || (int)size < 0) 88 * Find optimal I/O size for seek optimization. This also returns 93 if (size == 0) { 95 size = iosize; 100 if ((buf = malloc(size)) == NULL) { 103 * failure, but try again with file system size. 106 if (size ! [all...] |
H A D | setbuffer.c | 42 setbuffer(FILE *fp, char *buf, int size) argument 45 (void)setvbuf(fp, buf, buf ? _IOFBF : _IONBF, (size_t)size);
|
/freebsd-11-stable/contrib/sendmail/include/sm/ |
H A D | heap.h | 32 # define sm_malloc(size) sm_malloc_tagged(size, __FILE__, __LINE__, SmHeapGroup) 44 # define sm_malloc_tagged(size, file, line, grp) sm_malloc(size) 45 # define sm_malloc_tagged_x(size, file, line, grp) sm_malloc_x(size) 47 # define sm_heap_register(ptr, size, file, line, grp) (true) 87 # define sm_pmalloc(size) sm_malloc_tagged(size, __FILE__, __LINE__, 0) 88 # define sm_pmalloc_x(size) sm_malloc_tagged_ [all...] |
/freebsd-11-stable/sbin/hastd/ |
H A D | hast_compression.c | 46 allzeros(const void *data, size_t size) argument 52 PJDLOG_ASSERT((size % sizeof(*p)) == 0); 64 size >>= 3; /* divide by 8 */ 65 if ((p[0] | p[size >> 1] | p[size - 1]) != 0) 68 for (i = 0; i < size; i++) 76 uint32_t size; local 82 newbuf = malloc(sizeof(size)); 88 size = htole32((uint32_t)*sizep); 89 bcopy(&size, newbu 98 uint32_t size; local 210 size_t size; local 258 size_t size; local [all...] |
H A D | crc32.h | 17 crc32(const void *buf, size_t size) argument 23 while (size--)
|
/freebsd-11-stable/contrib/llvm-project/libcxx/src/ |
H A D | new.cpp | 62 operator new(std::size_t size) _THROW_BAD_ALLOC 64 if (size == 0) 65 size = 1; 67 while ((p = ::malloc(size)) == 0) 86 operator new(size_t size, const std::nothrow_t&) _NOEXCEPT 93 p = ::operator new(size); 105 operator new[](size_t size) _THROW_BAD_ALLOC 107 return ::operator new(size); 112 operator new[](size_t size, const std::nothrow_t&) _NOEXCEPT 119 p = ::operator new[](size); [all...] |
/freebsd-11-stable/contrib/ntp/include/ |
H A D | ieee754io.h | 55 int fetch_ieee754 (unsigned char **bufp, int size, l_fp *lfpp, offsets_t offsets); 56 int put_ieee754 (unsigned char **bufpp, int size, l_fp *lfpp, offsets_t offsets);
|
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/ |
H A D | string.h | 57 isc_string_copy(char *target, size_t size, const char *source); 60 * pointer to a string of at least 'size' bytes. 63 * 'target' is a pointer to a char[] of at least 'size' bytes. 64 * 'size' an integer > 0. 70 * than 'size' bytes (including NUL). 82 isc_string_copy_truncate(char *target, size_t size, const char *source); 85 * pointer to a string of at least 'size' bytes. 88 * 'target' is a pointer to a char[] of at least 'size' bytes. 89 * 'size' an integer > 0. 94 * than 'size' byte [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/ |
H A D | direct_mask_range_hashing_imp.hpp | 56 notify_resized(size_type size) argument 57 { mask_based_base::notify_resized(size); }
|
/freebsd-11-stable/contrib/binutils/gas/ |
H A D | literal.c | 30 with some sort of GP register, so the size of the pool must be kept down 37 size down. */ 45 add_to_literal_pool (sym, addend, sec, size) 49 int size; 61 size... Probably correct, but unwise to rely on. */ 66 fixp = fixp->fx_next, offset += size) 73 p = frag_more (size); 74 memset (p, 0, size); 76 switch (size) 87 fix_new (frag_now, p - frag_now->fr_literal, size, sy [all...] |
/freebsd-11-stable/sys/contrib/xz-embedded/userspace/ |
H A D | xz_config.h | 42 #define kmalloc(size, flags) malloc(size) 44 #define vmalloc(size) malloc(size) 47 #define memeq(a, b, size) (memcmp(a, b, size) == 0) 48 #define memzero(buf, size) memset(buf, 0, size) 58 * small code size. You may be able to save a few bytes by #defining 118 * could save a few bytes in code size [all...] |
/freebsd-11-stable/sys/arm64/include/ |
H A D | kdb.h | 44 kdb_cpu_sync_icache(unsigned char *addr, size_t size) argument 47 cpu_icache_sync_range((vm_offset_t)addr, size);
|
/freebsd-11-stable/lib/libnv/ |
H A D | msgio.h | 47 int buf_send(int sock, void *buf, size_t size); 48 int buf_recv(int sock, void *buf, size_t size);
|