Searched refs:upto (Results 1 – 16 of 16) sorted by relevance
46 StringRef upto(Cursor C) const { in upto() function in __anondf24bfd00111::Cursor159 StringRef String = Range.upto(R); in lexName()170 Token.reset(Type, Range.upto(C)) in lexName()171 .setStringValue(Range.upto(C).drop_front(PrefixLength)); in lexName()182 Token.reset(MIToken::IntegerType, Range.upto(C)); in maybeLexIntegerType()238 auto Identifier = Range.upto(C); in maybeLexIdentifier()261 StringRef Number = NumberRange.upto(C); in maybeLexMachineBasicBlock()271 Range.upto(C)) in maybeLexMachineBasicBlock()273 .setStringValue(Range.upto(C).drop_front(StringOffset)); in maybeLexMachineBasicBlock()286 Token.reset(Kind, Range.upto(C)).setIntegerValue(APSInt(NumberRange.upto(C))); in maybeLexIndex()[all …]
638 int32_t upto = sizeof(SYMBOL_TABLE) / sizeof(SYMBOL_TABLE[0]); in findCodewordIndex() local639 while (first < upto) { in findCodewordIndex()640 int32_t mid = ((FX_DWORD)(first + upto)) >> 1; in findCodewordIndex()642 upto = mid; in findCodewordIndex()
112 ext2_ino_t i, ino_in_group, upto, first_zero; in ext2fs_new_inode() local137 upto = i + (EXT2_INODES_PER_GROUP(fs->super) - ino_in_group); in ext2fs_new_inode()138 if (i < start_inode && upto >= start_inode) in ext2fs_new_inode()139 upto = start_inode - 1; in ext2fs_new_inode()140 if (upto > fs->super->s_inodes_count) in ext2fs_new_inode()141 upto = fs->super->s_inodes_count; in ext2fs_new_inode()143 retval = ext2fs_find_first_zero_inode_bitmap2(map, i, upto, in ext2fs_new_inode()151 i = upto + 1; in ext2fs_new_inode()
7 A hash limit option (\fB\-\-hashlimit\-upto\fP, \fB\-\-hashlimit\-above\fP) and10 \fB\-\-hashlimit\-upto\fP \fIamount\fP[\fB/second\fP|\fB/minute\fP|\fB/hour\fP|\fB/day\fP]59 \-s 192.168.0.0/16 \-\-hashlimit\-mode srcip \-\-hashlimit\-upto 1000/sec63 \-s 192.168.1.1 \-\-hashlimit\-mode srcport \-\-hashlimit\-upto 100/sec68 \-s 10.0.0.8 \-\-hashlimit\-mask 28 \-\-hashlimit\-upto 10000/min
4 \fB\-\-connlimit\-upto\fP \fIn\fP28 iptables \-A INPUT \-p tcp \-\-syn \-\-dport 23 \-m connlimit \-\-connlimit\-upto 2 \-j ACCEPT
12 …upto 1 --connlimit-mask 8 --connlimit-saddr -m connlimit --connlimit-above 1 --connlimit-mask 9 --…18 -A INPUT -p tcp -m connlimit --connlimit-upto 1 --connlimit-mask 8 --connlimit-saddr25 -A INPUT -p tcp -m hashlimit --hashlimit-upto 1/sec --hashlimit-burst 5 --hashlimit-mode srcip,dsti…94 -A matches -m hashlimit --hashlimit-upto 1/sec --hashlimit-burst 1 --hashlimit-name mini1 --hashlim…95 -A matches -m hashlimit --hashlimit-upto 1/sec --hashlimit-burst 1 --hashlimit-name mini196 -A matches -m hashlimit --hashlimit-upto 1/min --hashlimit-burst 1 --hashlimit-name mini297 -A matches -m hashlimit --hashlimit-upto 1/hour --hashlimit-burst 1 --hashlimit-name mini398 -A matches -m hashlimit --hashlimit-upto 1/day --hashlimit-burst 1 --hashlimit-name mini499 -A matches -m hashlimit --hashlimit-upto 4kb/s --hashlimit-burst 400kb --hashlimit-name mini5100 -A matches -m hashlimit --hashlimit-upto 10mb/s --hashlimit-name mini6[all …]
10 # sure what is is upto.
26 (6) Age filesystem according to a specified workload upto a specified limit.
35 speed and is robust upto \f$\pm 15^{\circ}\f$. OpenCV supports both, depending upon the flag,
111 consider the array creation also, it may reach upto 100x faster. Cool, right? *(Numpy devs are
66 module (for python 2.5 upto 3.0).
83 module (for python 2.5 upto 3.0).
733 ADV "abrupto" "abr'upto"
2212 reconstruction is ambiguous upto a similarity transform. This is
META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/ ...