PATH: //usr/include/bind9/isc
FILE_BARU
CREATE
FOLDER_BARU
MKDIR
UPLOAD_FILE
GO
[ .. KEMBALI ]
📄 aes.h
↓
X
📄 align.h
↓
X
📄 app.h
↓
X
📄 assertions.h
↓
X
📄 astack.h
↓
X
📄 atomic.h
↓
X
📄 backtrace.h
↓
X
📄 barrier.h
↓
X
📄 base32.h
↓
X
📄 base64.h
↓
X
📄 bind9.h
↓
X
📄 buffer.h
↓
X
📄 bufferlist.h
↓
X
📄 cmocka.h
↓
X
📄 commandline.h
↓
X
📄 condition.h
↓
X
📄 counter.h
↓
X
📄 crc64.h
↓
X
📄 deprecated.h
↓
X
📄 dir.h
↓
X
📄 endian.h
↓
X
📄 errno.h
↓
X
📄 errno2result.h
↓
X
📄 error.h
↓
X
📄 event.h
↓
X
📄 eventclass.h
↓
X
📄 file.h
↓
X
📄 formatcheck.h
↓
X
📄 fsaccess.h
↓
X
📄 fuzz.h
↓
X
📄 hash.h
↓
X
📄 heap.h
↓
X
📄 hex.h
↓
X
📄 hmac.h
↓
X
📄 hp.h
↓
X
📄 ht.h
↓
X
📄 httpd.h
↓
X
📄 interfaceiter.h
↓
X
📄 iterated_hash.h
↓
X
📄 lang.h
↓
X
📄 lex.h
↓
X
📄 lfsr.h
↓
X
📄 lib.h
↓
X
📄 likely.h
↓
X
📄 list.h
↓
X
📄 log.h
↓
X
📄 magic.h
↓
X
📄 managers.h
↓
X
📄 md.h
↓
X
📄 mem.h
↓
X
📄 meminfo.h
↓
X
📄 mutex.h
↓
X
📄 mutexatomic.h
↓
X
📄 mutexblock.h
↓
X
📄 net.h
↓
X
📄 netaddr.h
↓
X
📄 netdb.h
↓
X
📄 netmgr.h
↓
X
📄 netscope.h
↓
X
📄 nonce.h
↓
X
📄 offset.h
↓
X
📄 once.h
↓
X
📄 os.h
↓
X
📄 parseint.h
↓
X
📄 platform.h
↓
X
📄 pool.h
↓
X
📄 portset.h
↓
X
📄 print.h
↓
X
📄 queue.h
↓
X
📄 quota.h
↓
X
📄 radix.h
↓
X
📄 random.h
↓
X
📄 ratelimiter.h
↓
X
📄 refcount.h
↓
X
📄 regex.h
↓
X
📄 region.h
↓
X
📄 resource.h
↓
X
📄 result.h
↓
X
📄 resultclass.h
↓
X
📄 rwlock.h
↓
X
📄 safe.h
↓
X
📄 serial.h
↓
X
📄 siphash.h
↓
X
📄 sockaddr.h
↓
X
📄 socket.h
↓
X
📄 stat.h
↓
X
📄 stats.h
↓
X
📄 stdatomic.h
↓
X
📄 stdio.h
↓
X
📄 stdtime.h
↓
X
📄 strerr.h
↓
X
📄 string.h
↓
X
📄 symtab.h
↓
X
📄 syslog.h
↓
X
📄 task.h
↓
X
📄 taskpool.h
↓
X
📄 thread.h
↓
X
📄 time.h
↓
X
📄 timer.h
↓
X
📄 tm.h
↓
X
📄 types.h
↓
X
📄 url.h
↓
X
📄 utf8.h
↓
X
📄 util.h
↓
X
📄 version.h
↓
X
SAVING...
BERHASIL DIUBAH!
EDITING: lfsr.h
/* * Copyright (C) Internet Systems Consortium, Inc. ("ISC") * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, you can obtain one at https://mozilla.org/MPL/2.0/. * * See the COPYRIGHT file distributed with this work for additional * information regarding copyright ownership. */ #ifndef ISC_LFSR_H #define ISC_LFSR_H 1 /*! \file isc/lfsr.h */ #include <inttypes.h> #include <isc/lang.h> #include <isc/types.h> typedef struct isc_lfsr isc_lfsr_t; /*% * This function is called when reseeding is needed. It is allowed to * modify any state in the LFSR in any way it sees fit OTHER THAN "bits". * * It MUST set "count" to a new value or the lfsr will never reseed again. * * Also, a reseed will never occur in the middle of an extraction. This * is purely an optimization, and is probably what one would want. */ typedef void (*isc_lfsrreseed_t)(isc_lfsr_t *, void *); /*% * The members of this structure can be used by the application, but care * needs to be taken to not change state once the lfsr is in operation. */ struct isc_lfsr { uint32_t state; /*%< previous state */ unsigned int bits; /*%< length */ uint32_t tap; /*%< bit taps */ unsigned int count; /*%< reseed count (in BITS!) */ isc_lfsrreseed_t reseed; /*%< reseed function */ void *arg; /*%< reseed function argument */ }; ISC_LANG_BEGINDECLS void isc_lfsr_init(isc_lfsr_t *lfsr, uint32_t state, unsigned int bits, uint32_t tap, unsigned int count, isc_lfsrreseed_t reseed, void *arg); /*%< * Initialize an LFSR. * * Note: * *\li Putting untrusted values into this function will cause the LFSR to * generate (perhaps) non-maximal length sequences. * * Requires: * *\li lfsr != NULL * *\li 8 <= bits <= 32 * *\li tap != 0 */ void isc_lfsr_generate(isc_lfsr_t *lfsr, void *data, unsigned int count); /*%< * Returns "count" bytes of data from the LFSR. * * Requires: * *\li lfsr be valid. * *\li data != NULL. * *\li count > 0. */ void isc_lfsr_skip(isc_lfsr_t *lfsr, unsigned int skip); /*%< * Skip "skip" states. * * Requires: * *\li lfsr be valid. */ uint32_t isc_lfsr_generate32(isc_lfsr_t *lfsr1, isc_lfsr_t *lfsr2); /*%< * Given two LFSRs, use the current state from each to skip entries in the * other. The next states are then xor'd together and returned. * * WARNING: * *\li This function is used only for very, very low security data, such * as DNS message IDs where it is desired to have an unpredictable * stream of bytes that are harder to predict than a simple flooding * attack. * * Notes: * *\li Since the current state from each of the LFSRs is used to skip * state in the other, it is important that no state be leaked * from either LFSR. * * Requires: * *\li lfsr1 and lfsr2 be valid. * *\li 1 <= skipbits <= 31 */ ISC_LANG_ENDDECLS #endif /* ISC_LFSR_H */
SIMPAN PERUBAHAN