/macosx-10.9.5/ruby-104/ruby/benchmark/ |
H A D | bm_so_exception.rb | 12 def initialize(num) 13 @value = num 18 def initialize(num) 19 @value = num 23 def some_function(num) 25 hi_function(num) 31 def hi_function(num) 33 lo_function(num) 39 def lo_function(num) 41 blowup(num) [all...] |
/macosx-10.9.5/BerkeleyDB-21/db/common/ |
H A D | db_log2.c | 48 __db_log2(num) 49 u_int32_t num; 54 for (i = 0; limit < num; limit = limit << 1)
|
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/textutil/ |
H A D | repeat.tcl | 29 # - Linear in 'num'. 32 # - Fails for 'num == 0' because of undefined 'str'. 34 proc textutil::repeat::StrRepeat { char num } { 37 for { set i 0 } { $i < $num } { incr i } { 41 set str [ string repeat $char $num ] 48 proc ::textutil::repeat::strRepeat {char num} { 49 return [string repeat $char $num] 56 proc ::textutil::repeat::strRepeat {char num} { 57 if {$num <= 0} { 60 } elseif {$num [all...] |
H A D | tabify.tcl | 24 # of $num spaces ('num' holding the tab size). While this is certainly useful 71 proc ::textutil::tabify::tabify { string { num 8 } } { 72 return [string map [list [MakeTabStr $num] \t] $string] 75 proc ::textutil::tabify::untabify { string { num 8 } } { 76 return [string map [list \t [MakeTabStr $num]] $string] 79 proc ::textutil::tabify::MakeTabStr { num } { 83 if { $TabLen != $num } then { 84 set TabLen $num 85 set TabStr [strRepeat " " $num] [all...] |
/macosx-10.9.5/passwordserver_sasl-170/cyrus_sasl/mac/libdes/src/ |
H A D | cfb_enc.c | 79 /* crypto/des/cfb_enc.c */
/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
* All rights reserved.
*
* This package is an SSL implementation written
* by Eric Young (eay@mincom.oz.au).
* The implementation was written so as to conform with Netscapes SSL.
*
* This library is free for commercial and non-commercial use as long as
* the following conditions are aheared to. The following conditions
* apply to all code found in this distribution, be it the RC4, RSA,
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
* included with this distribution is covered by the same copyright terms
* except that the holder is Tim Hudson (tjh@mincom.oz.au).
*
* Copyright remains Eric Young's, and as such any Copyright notices in
* the code are not to be removed.
* If this package is used in a product, Eric Young should be given attribution
* as the author of the parts of the library used.
* This can be in the form of a textual message at program startup or
* in documentation (online or textual) provided with the package.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* "This product includes cryptographic software written by
* Eric Young (eay@mincom.oz.au)"
* The word 'cryptographic' can be left out if the rouines from the library
* being used are not cryptographic related :-).
* 4. If you include any Windows specific code (or a derivative thereof) from
* the apps directory (application code) you must include an acknowledgement:
* "This product includes software written by Tim Hudson (tjh@mincom.oz.au)"
*
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* The licence and distribution terms for any publically available version or
* derivative of this code cannot be changed. i.e. this code cannot simply be
* copied and put under another distribution licence
* [including the GNU Public Licence.]
*/
#include "des_locl.h"
/* The input and output are loaded in multiples of 8 bits.
* What this means is that if you hame numbits=12 and length=2
* the first 12 bits will be retrieved from the first byte and half
* the second. The second 12 bits will come from the 3rd and half the 4th
* byte.
*/
void des_cfb_encrypt(in, out, numbits, length, schedule, ivec, encrypt)
unsigned char *in;
unsigned char *out;
int numbits;
long length;
des_key_schedule schedule;
des_cblock (*ivec);
int encrypt;
{
register DES_LONG d0,d1,v0,v1,n=(numbits+7)/8;
register DES_LONG mask0,mask1;
register unsigned long l=length;
register int num=numbits;
DES_LONG ti[2];
unsigned char *iv;
if (num > 64) return;
if (num > 32)
{
mask0=0xffffffffL;
if (num == 64)
mask1=mask0;
else mask1=(1L<<(num-32))-1;
}
else
{
if (num == 32)
mask0=0xffffffffL;
else mask0=(1L<<num)-1;
mask1=0x00000000;
}
iv=(unsigned char *)ivec;
c2l(iv,v0);
c2l(iv,v1);
if (encrypt)
{
while (l >= n)
{
l-=n;
ti[0]=v0;
ti[1]=v1;
des_encrypt((DES_LONG *)ti,schedule,DES_ENCRYPT);
c2ln(in,d0,d1,n);
in+=n;
d0=(d0^ti[0])&mask0;
d1=(d1^ti[1])&mask1;
l2cn(d0,d1,out,n);
out+=n;
/* 30-08-94 - eay - changed because l>>32 and
* l<<32 are bad under gcc :-( */
if (num == 32)
{ v0=v1; v1=d0; }
else if (num == 64)
{ v0=d0; v1=d1; }
else if (num > 3 1 /* crypto/des/cfb_enc.c */ local [all...] |
/macosx-10.9.5/Heimdal-323.92.1/lib/roken/ |
H A D | closefrom.c | 48 int num = getdtablesize(); local 50 if (num < 0) 51 num = 1024; /* XXX */ 53 for (; fd <= num; fd++)
|
/macosx-10.9.5/ruby-104/ruby/ext/tk/lib/tkextlib/blt/ |
H A D | cutbuffer.rb | 13 def self.get(num = 0) 14 Tk.tk_call('::blt::cutbuffer', 'get', num) 19 def self.set(val, num = 0) 20 Tk.tk_call('::blt::cutbuffer', 'set', val, num)
|
/macosx-10.9.5/tcsh-65/tcsh/win32/msg/ |
H A D | makercjp.pl | 25 ($num,$line)= split(' ',$_,2);
26 print ($i*10000 + $num);
|
/macosx-10.9.5/Libc-997.90.3/stdlib/FreeBSD/ |
H A D | div.c | 42 div(num, denom) 43 int num, denom; 47 r.quot = num / denom; 48 r.rem = num % denom; 59 * sign of num; if both are negative and r.quot has been 61 * have the opposite sign of num). These are considered 64 * If both are num and denom are positive, r will always 68 * if num >= 0, but r.rem < 0, we got the wrong answer. 72 if (num >= 0 && r.rem < 0) {
|
H A D | ldiv.c | 42 ldiv(num, denom) 43 long num, denom; 49 r.quot = num / denom; 50 r.rem = num % denom; 51 if (num >= 0 && r.rem < 0) {
|
/macosx-10.9.5/Security-55471.14.18/libsecurity_apple_csp/open_ssl/openssl/ |
H A D | rand.h | 86 void (*seed)(const void *buf, int num); 87 int (*bytes)(unsigned char *buf, int num); 89 void (*add)(const void *buf, int num, double entropy); 90 int (*pseudorand)(unsigned char *buf, int num); 102 int RAND_bytes(unsigned char *buf,int num); 103 int RAND_pseudo_bytes(unsigned char *buf,int num); 104 void RAND_seed(const void *buf,int num); 105 void RAND_add(const void *buf,int num,double entropy); 108 const char *RAND_file_name(char *file,int num);
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/tests/mozilla/ecma/String/ |
H A D | 15.5.3.2-3.js | 96 function ToUint16( num ) { 97 num = Number( num ); 98 if ( isNaN( num ) || num == 0 || num == Number.POSITIVE_INFINITY || num == Number.NEGATIVE_INFINITY ) { 102 var sign = ( num < 0 ) ? -1 : 1; 104 num = sign * Math.floor( Math.abs( num ) ); [all...] |
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/demos-en/ |
H A D | puzzle.rb | 85 def def_puzzleswitch_proc(w, num) 86 proc{puzzleSwitch w, num} 93 num = order[i] 94 $xpos[num] = (i % 4) * 0.25 95 $ypos[num] = (i / 4) * 0.25 98 text num 100 command def_puzzleswitch_proc(w, num) 104 }.place('relx'=>$xpos[num], 'rely'=>$ypos[num], 116 def puzzleSwitch(w, num) [all...] |
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/demos-jp/ |
H A D | puzzle.rb | 85 # ������������������������������������������������������������ num ��������������������� 87 def def_puzzleswitch_proc(w, num) 88 proc{puzzleSwitch w, num} 95 num = order[i] 96 $xpos[num] = (i % 4) * 0.25 97 $ypos[num] = (i / 4) * 0.25 100 text num 102 command def_puzzleswitch_proc(w, num) 106 }.place('relx'=>$xpos[num], 'rely'=>$ypos[num], [all...] |
/macosx-10.9.5/tcl-102/tk/tk/library/demos/ |
H A D | puzzle.tcl | 19 proc puzzleSwitch {w num} { 21 if {(($ypos($num) >= ($ypos(space) - .01)) 22 && ($ypos($num) <= ($ypos(space) + .01)) 23 && ($xpos($num) >= ($xpos(space) - .26)) 24 && ($xpos($num) <= ($xpos(space) + .26))) 25 || (($xpos($num) >= ($xpos(space) - .01)) 26 && ($xpos($num) <= ($xpos(space) + .01)) 27 && ($ypos($num) >= ($ypos(space) - .26)) 28 && ($ypos($num) <= ($ypos(space) + .26)))} { 30 set xpos(space) $xpos($num) [all...] |
/macosx-10.9.5/tcl-102/tk84/tk/library/demos/ |
H A D | puzzle.tcl | 17 proc puzzleSwitch {w num} { 19 if {(($ypos($num) >= ($ypos(space) - .01)) 20 && ($ypos($num) <= ($ypos(space) + .01)) 21 && ($xpos($num) >= ($xpos(space) - .26)) 22 && ($xpos($num) <= ($xpos(space) + .26))) 23 || (($xpos($num) >= ($xpos(space) - .01)) 24 && ($xpos($num) <= ($xpos(space) + .01)) 25 && ($ypos($num) >= ($ypos(space) - .26)) 26 && ($ypos($num) <= ($ypos(space) + .26)))} { 28 set xpos(space) $xpos($num) [all...] |
/macosx-10.9.5/pyobjc-42/2.5/pyobjc/pyobjc-framework-Cocoa/PyObjCTest/ |
H A D | test_cfnumber.py | 97 num = CFNumberCreate(None, kCFNumberSInt8Type, 1) 98 self.failUnless(isinstance(num, CFNumberRef)) 99 self.failIf(CFNumberIsFloatType(num)) 100 self.failUnless(num == 1) 102 num = CFNumberCreate(None, kCFNumberSInt8Type, 1) 103 self.failUnless(isinstance(num, CFNumberRef)) 104 self.failIf(CFNumberIsFloatType(num)) 105 self.failUnless(num == 1) 107 num = CFNumberCreate(None, kCFNumberSInt16Type, 1) 108 self.failUnless(isinstance(num, CFNumberRe [all...] |
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-framework-Cocoa/PyObjCTest/ |
H A D | test_cfnumber.py | 95 num = CFNumberCreate(None, kCFNumberSInt8Type, 1) 96 self.assertIsInstance(num, CFNumberRef) 97 self.assertFalse(CFNumberIsFloatType(num)) 98 self.assertEqual(num , 1) 99 num = CFNumberCreate(None, kCFNumberSInt8Type, 1) 100 self.assertIsInstance(num, CFNumberRef) 101 self.assertFalse(CFNumberIsFloatType(num)) 102 self.assertEqual(num , 1) 103 num = CFNumberCreate(None, kCFNumberSInt16Type, 1) 104 self.assertIsInstance(num, CFNumberRe [all...] |
/macosx-10.9.5/dcerpc-58/dcerpc/include/dce/ |
H A D | codesets.idl | 126 [in] long num, 127 [in, size_is(num)] byte codesets[] 138 [in, out] long *num, 139 [out, size_is(*num)] byte codesets[]
|
/macosx-10.9.5/dtrace-118.1/DTTk/Bin/ |
H A D | syscallbyproc.d | 10 syscall:::entry { @num[execname] = count(); }
|
H A D | syscallbysysc.d | 10 syscall:::entry { @num[probefunc] = count(); }
|
/macosx-10.9.5/dtrace-118.1/DTTk/Proc/ |
H A D | syscallbyproc.d | 10 syscall:::entry { @num[execname] = count(); }
|
/macosx-10.9.5/dtrace-118.1/DTTk/System/ |
H A D | syscallbysysc.d | 10 syscall:::entry { @num[probefunc] = count(); }
|
/macosx-10.9.5/Heimdal-323.92.1/lib/gssapi/ |
H A D | gen-oid.pl | 84 my $num; 88 $num = $array[$n]; 90 my $p = int($num % 128); 93 $num = int($num / 128); 97 while ($num > 0) { 98 $p = int($num % 128) + 128; 99 $num = int($num / 128); 105 $num [all...] |
/macosx-10.9.5/curl-78.94.1/curl/tests/libtest/ |
H A D | lib557.c | 62 unsigned short num; /* unsigned short */ member in struct:unsshort_st 69 short num; /* signed short */ member in struct:sigshort_st 76 unsigned int num; /* unsigned int */ member in struct:unsint_st 83 int num; /* signed int */ member in struct:sigint_st 90 unsigned long num; /* unsigned long */ member in struct:unslong_st 97 long num; /* signed long */ member in struct:siglong_st 104 curl_off_t num; /* curl_off_t */ member in struct:curloff_st 127 i=1; us_test[i].num = 0xFFU; us_test[i].expected = "256"; 128 i++; us_test[i].num = 0xF0U; us_test[i].expected = "240"; 129 i++; us_test[i].num [all...] |