Searched refs:ce (Results 1 - 25 of 124) sorted by relevance

12345

/macosx-10.9.5/BootCache-106/
H A Dkext.c461 #define CB_BLOCK_PRESENT(ce, block) \
462 ((ce)->ce_blockmap != NULL && ((ce)->ce_blockmap[CB_MAPIDX(block)] & CB_MAPBIT(block)))
463 #define CB_MARK_BLOCK_PRESENT(ce, block) \
464 ((ce)->ce_blockmap[CB_MAPIDX(block)] |= CB_MAPBIT(block))
465 #define CB_MARK_BLOCK_VACANT(ce, block) \
466 ((ce)->ce_blockmap[CB_MAPIDX(block)] &= ~CB_MAPBIT(block))
473 #define CB_PAGE_VACANT(cm, ce, page) \
474 (!((ce)->ce_blockmap[CB_MAPIDX(CB_PAGE_TO_BLOCK(cm, page))] & \
548 static int BC_check_intersection(struct BC_cache_extent *ce, u_int64_
671 BC_check_intersection(struct BC_cache_extent *ce, u_int64_t offset, u_int64_t length) argument
714 struct BC_cache_extent **pce, *ce; local
965 BC_discard_bytes(struct BC_cache_extent *ce, u_int64_t offset, u_int64_t length) argument
1061 BC_next_valid_range(struct BC_cache_mount *cm, struct BC_cache_extent *ce, uint32_t fromoffset, uint32_t *nextpage, uint32_t *nextoffset, uint32_t *nextlength) argument
1100 BC_blocks_present(struct BC_cache_extent *ce, int base, int nblk) argument
1124 struct BC_cache_extent *ce = NULL; local
1628 wait_for_extent(struct BC_cache_extent *ce, struct timeval starttime) argument
1653 struct BC_cache_extent *ce = NULL, **pce, **pcontaining_extents = NULL; local
2569 struct BC_cache_extent *ce = BC_cache->c_extentlists[cel_idx] + ce_idx; local
2776 BC_setup_extent(struct BC_cache_extent *ce, const struct BC_playlist_entry *pe, int batch_adjustment, int cache_mount_idx) argument
2831 BC_fill_in_extent(struct BC_cache_extent *ce) argument
2880 BC_teardown_extent(struct BC_cache_extent *ce) argument
3460 struct BC_cache_extent *ce; local
5221 BC_free_page(struct BC_cache_extent *ce, int page) argument
[all...]
/macosx-10.9.5/bind9-45.100/bind9/lib/isccfg/
H A Daclconf.c231 const cfg_obj_t *ce = cfg_listelt_value(elt); local
234 if (cfg_obj_istuple(ce)) {
235 ce = cfg_tuple_get(ce, "value");
240 if (cfg_obj_istype(ce, &cfg_type_keyref)) {
242 } else if (cfg_obj_islist(ce)) {
244 n += count_acl_elements(ce, cctx, &negative);
247 } else if (cfg_obj_isstring(ce)) {
248 const char *name = cfg_obj_asstring(ce);
319 const cfg_obj_t *ce local
[all...]
/macosx-10.9.5/ntp-88/ntpd/
H A Dntp_intres.c457 register struct conf_entry *ce; local
460 ce = confentries;
461 if (ce == entry)
462 confentries = ce->ce_next;
464 while (ce != NULL) {
465 if (ce->ce_next == entry) {
466 ce->ce_next = entry->ce_next;
469 ce = ce->ce_next;
499 register struct conf_entry *ce; local
1266 register struct conf_entry *ce; local
[all...]
/macosx-10.9.5/tcsh-65/tcsh/
H A Dsh.err.c394 struct cleanup_entry *ce; local
404 ce = cleanup_stack + cleanup_sp;
405 ce->var = var;
406 ce->fn = fn;
408 ce->file = file;
409 ce->line = line;
423 struct cleanup_entry *ce; local
425 ce = cleanup_stack + cleanup_sp;
426 while (ce != cleanup_stack) {
427 ce
440 struct cleanup_entry ce; local
455 struct cleanup_entry ce; local
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/test/intltest/
H A Dcolldata.cpp105 void CEList::add(uint32_t ce, UErrorCode &status) argument
130 ces[listSize++] = ce;
251 void put(uint32_t ce, UnicodeString *string, UErrorCode &status);
252 StringList *getStringList(uint32_t ce) const;
255 void putStringList(uint32_t ce, StringList *stringList, UErrorCode &status);
282 void CEToStringsMap::put(uint32_t ce, UnicodeString *string, UErrorCode &status) argument
284 StringList *strings = getStringList(ce);
294 putStringList(ce, strings, status);
300 StringList *CEToStringsMap::getStringList(uint32_t ce) const
302 return (StringList *) uhash_iget(map, ce);
305 putStringList(uint32_t ce, StringList *stringList, UErrorCode &status) argument
500 uint32_t ce = ceList->get(offset); local
[all...]
H A Dcolldata.h112 void add(uint32_t ce, UErrorCode &status);
234 * @param ce - the CE
240 const StringList *getStringList(int32_t ce) const;
/macosx-10.9.5/ICU-511.35/icuSources/i18n/
H A Ducoleitr.cpp48 uint32_t ce; member in struct:RCEI
66 void put(uint32_t ce, int32_t ixLow, int32_t ixHigh);
89 void RCEBuffer::put(uint32_t ce, int32_t ixLow, int32_t ixHigh) argument
104 buffer[bufferIndex].ce = ce;
122 uint64_t ce; member in struct:PCEI
139 void put(uint64_t ce, int32_t ixLow, int32_t ixHigh);
167 void PCEBuffer::put(uint64_t ce, int32_t ixLow, int32_t ixHigh) argument
182 buffer[bufferIndex].ce = ce;
246 processCE(UCollationElements *elems, uint32_t ce) argument
448 uint32_t ce = (uint32_t) ucol_getNextCE(coll, &elems->iteratordata_, status); local
546 uint32_t ce; local
[all...]
H A Dusearch.cpp89 * @param ce collation element
93 inline int hash(uint32_t ce) argument
95 // the old value UCOL_PRIMARYORDER(ce) % MAX_TABLE_SIZE_ does not work
99 return UCOL_PRIMARYORDER(ce) % MAX_TABLE_SIZE_;
163 // if the ce is a variable, we mask and get only the primary values
284 * Initializing the ce table for a pattern.
329 int32_t ce; local
331 while ((ce = ucol_next(coleiter, status)) != UCOL_NULLORDER &&
333 uint32_t newce = getCE(strsrch, ce);
348 result += (uint16_t)(ucol_getMaxExpansion(coleiter, ce)
645 int32_t ce = getCE(strsrch, ucol_next(coleiter, &status)); local
741 shiftForward(UStringSearch *strsrch, int32_t textoffset, int32_t ce, int32_t patternceindex) argument
887 uint32_t ce = UCOL_IGNORABLE; local
941 int32_t ce = getCE(strsrch, ucol_next(coleiter, &status)); local
1023 int32_t ce; local
1219 int32_t ce = getCE(strsrch, ucol_next(coleiter, status)); local
1422 int32_t ce = getCE(strsrch, ucol_next(coleiter, &status)); local
1618 int32_t *ce = strsrch->pattern.CE; local
1863 int32_t ce = getCE(strsrch, ucol_next(coleiter, status)); local
1974 reverseShift(UStringSearch *strsrch, int32_t textoffset, int32_t ce, int32_t patternceindex) argument
2060 int32_t ce = getCE(strsrch, ucol_previous(coleiter, status)); local
2281 int32_t *ce = strsrch->pattern.CE; local
2500 int32_t ce = getCE(strsrch, ucol_previous(coleiter, status)); local
3440 int64_t ce; member in struct:CEI
[all...]
/macosx-10.9.5/swig-10/Source/Swig/
H A Dmisc.c990 const char *ce = Strchr(cs, ']'); local
991 if (*cs != '[' || ce == NULL) {
994 String *fmt = NewStringf("%%.%ds", ce-cs-1);
996 if (0 == Strncmp(ce+1, prefix, Len(prefix))) {
997 ns = NewString(ce+1+Len(prefix));
999 ns = NewString(ce+1);
1020 const char *skip_delim(char pb, char pe, const char *ce) { argument
1023 while (!end && *ce != '\0') {
1024 if (*ce == pb) {
1027 if (*ce
1047 const char *ce; local
[all...]
/macosx-10.9.5/emacs-92/emacs/lisp/
H A Dnewcomment.el280 (ce (if (string= "" comment-end) "\n" comment-end)))
285 (insert cs " hello " ce)
317 (let ((ce (if (string= "" comment-end) "\n"
323 "\\|" (regexp-quote (substring ce 0 1))
324 (if (and comment-quote-nested (<= (length ce) 1)) "" "+")
325 (regexp-quote (substring ce 1))
333 (defun comment-quote-nested (cs ce unp)
337 (setq ce (comment-string-strip ce t t))
338 (when (and comment-quote-nested (> (length ce)
[all...]
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/servers/slapd/
H A Dbconfig.c1351 CfEntryInfo *ce; local
1354 ce = c->ca_entry->e_private;
1356 if ( ce->ce_parent->ce_type == Cft_Global )
1389 CfEntryInfo *ce; local
1392 ce = c->ca_entry->e_private;
1394 if ( ce->ce_parent->ce_type == Cft_Global )
1427 CfEntryInfo *ce; local
1430 ce = c->ca_entry->e_private;
1432 if ( ce->ce_parent->ce_type == Cft_Global )
2363 CfEntryInfo *ce local
2444 CfEntryInfo *ce = c->ca_entry->e_private; local
4296 config_send( Operation *op, SlapReply *rs, CfEntryInfo *ce, int depth ) argument
4614 CfEntryInfo *ce; local
4942 CfEntryInfo *ce, *last = NULL; local
5284 config_rename_add( Operation *op, SlapReply *rs, CfEntryInfo *ce, int base, int rebase, int max, int use_ldif ) argument
5331 config_rename_del( Operation *op, SlapReply *rs, CfEntryInfo *ce, CfEntryInfo *ce2, int old, int use_ldif ) argument
5423 CfEntryInfo *ce = ca.ca_entry->e_private; local
5508 config_modify_internal( CfEntryInfo *ce, Operation *op, SlapReply *rs, ConfigArgs *ca ) argument
5836 CfEntryInfo *ce, *last; local
5955 CfEntryInfo *ce, *last; local
6165 CfEntryInfo *ce, *last, *ce2; local
6311 CfEntryInfo *ce, *last; local
6382 CfEntryInfo *ce, *last; local
6464 CfEntryInfo *ce = ch_calloc( 1, sizeof(CfEntryInfo) ); local
6658 CfEntryInfo *ce, *last; local
6762 CfEntryInfo *ce, *ceparent; local
7192 Entry *ce; local
[all...]
/macosx-10.9.5/mDNSResponder-522.92.1/mDNSCore/
H A Dnsec3.c179 // ce is the closest encloser that will be returned if we find one
181 CacheRecord **closerEncloser, const domainname **ce, mDNSu16 qtype)
216 *ce = mDNSNULL;
325 *ce = name;
380 const domainname **ce, mDNSu16 qtype)
382 if (!NSEC3Find(m, NSEC3CEProof, ncr, name, closestEncloser, closerEncloser, ce, qtype))
389 if (!closestEncloser || !closerEncloser || !ce)
391 LogMsg("NSEC3ClosestEncloserProof: ClosestEncloser %p or CloserEncloser %p ce %p, something is NULL", *closestEncloser,
392 *closerEncloser, *ce);
397 if (SameDomainName((*ce), nam
180 NSEC3Find(mDNS *const m, NSEC3FindValues val, CacheRecord *ncr, domainname *origName, CacheRecord **closestEncloser, CacheRecord **closerEncloser, const domainname **ce, mDNSu16 qtype) argument
379 NSEC3ClosestEncloserProof(mDNS *const m, CacheRecord *ncr, domainname *name, CacheRecord **closestEncloser, CacheRecord **closerEncloser, const domainname **ce, mDNSu16 qtype) argument
470 const domainname *ce = mDNSNULL; local
519 const domainname *ce = mDNSNULL; local
568 const domainname *ce = mDNSNULL; local
[all...]
H A Dnsec.c520 const domainname *ce; local
584 ce = NSECClosestEncloser(&((*rp)->resrec), &dv->origName);
585 if (!ce)
590 if (!SameDomainName(ce, dv->wildcardName))
680 const domainname *ce = SkipLeadingLabels(oname, 1); local
682 r = DNSSECCanonicalOrder(name, ce, &s);
704 *wildcard = (domainname *)ce;
831 const domainname *ce = mDNSNULL; local
870 ce = NSECClosestEncloser(&cr->resrec, &dv->q.qname);
885 // If we have a wildcard, then we should have a "ce" whic
937 const domainname *ce; local
[all...]
/macosx-10.9.5/xnu-2422.115.4/iokit/Kernel/
H A DIOStatistics.cpp302 ClassNode *ce; local
313 ce = (ClassNode *)kalloc(sizeof(ClassNode));
314 if (!ce) {
318 memset(ce, 0, sizeof(ClassNode));
335 ce->metaClass = metaClass;
336 ce->classID = lastClassIndex++;
337 ce->parentKext = foundKext;
340 superClass = ce->metaClass->getSuperClass();
345 ce->superClassID = foundClass ? foundClass->classID : (uint32_t)(-1);
347 SLIST_INIT(&ce
866 ClassNode *ce; local
908 ClassNode *ce; local
926 ClassNode *ce; local
1014 ClassNode *ce; local
[all...]
/macosx-10.9.5/swig-10/Lib/php/
H A Ddirector.swg120 zend_class_entry **ce;
125 if (zend_lookup_class(Z_STRVAL_P(&classname), Z_STRLEN_P(&classname), &ce TSRMLS_CC) != SUCCESS) {
128 if (zend_hash_find(&(*ce)->function_table, lc_fname, name_len + 1, (void**) &mptr) != SUCCESS) {
H A Dphprun.swg128 zend_class_entry **ce = NULL;
135 if (zend_lookup_class(Z_STRVAL_P(classname), Z_STRLEN_P(classname), &ce TSRMLS_CC) != SUCCESS) {
139 object_init_ex(z, *ce);
/macosx-10.9.5/autofs-234/automountd/
H A Dautod_nfs.c1538 struct cache_entry *ce, *prev; local
1552 for (ce = cache_head; ce; ce = ce->cache_next) {
1553 if (timenow > ce->cache_time) {
1556 for (prev = NULL, ce = cache_head; ce;
1557 prev = ce, ce
1619 struct cache_entry *ce, *next = NULL; local
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/test/cintltst/
H A Dcitertst.c1157 * @param ce array for storage, assuming size > 20
1333 uint32_t ce = (uint32_t)ucol_next(iter, &status); local
1334 if (ce == 0xFFFFFFFF) {
1335 ce = 0;
1340 if(UCOL_ISTHAIPREVOWEL(*codepoints) && ce == 0 && count == 0) {
1343 if (ce != ces[count] || U_FAILURE(status)) {
1432 uint32_t ce; local
1438 ce = ucol_next(resultiter, &status);
1443 while (ce != UCOL_NULLORDER) {
1444 if (ce !
1542 uint32_t ce = ucol_next(iter, &status); local
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/test/perf/howExpensiveIs/
H A Dsieve.cpp83 double ce = ceil(i); local
84 if(ce>=n) ce=n;
85 if(fl==ce) {
88 return (times[(int)fl]+times[(int)ce])/2;
/macosx-10.9.5/passwordserver_sasl-170/cyrus_sasl/mac/libdes/src/
H A Dspeed.c204 /* crypto/des/speed.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.] */ /* 11-Sep-92 Andrew Daviel Support for Silicon Graphics IRIX added */ /* 06-Apr-92 Luke Brennan Support for VMS and add extra signal calls */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #if !defined(MSDOS) && !defined(WIN32) #define TIMES #endif #include <stdio.h> #ifdef HAVE_UNISTD_H #include <unistd.h> #endif #include <signal.h> #ifdef HAVE_TIME_H #include <time.h> #endif #ifdef HAVE_SYS_TYPES_H #include <sys/types.h> #endif #ifdef HAVE_SYS_TIMES_H #include <sys/times.h> #endif #ifdef VMS #include <types.h> struct tms { time_t tms_utime; time_t tms_stime; time_t tms_uchild; /* I dunno... */ time_t tms_uchildsys; /* so these names are a guess :-) */ } #endif #ifdef HAVE_SYS_TIMEB_H #include <sys/timeb.h> #endif #include <limits.h> #ifdef HAVE_SYS_PARAM_H #include <sys/param.h> #endif #include "des.h" /* The following if from times(3) man page. It may need to be changed */ #ifndef HZ #ifndef CLK_TCK #ifndef VMS #define HZ 100.0 #else /* VMS */ #define HZ 100.0 #endif #else /* CLK_TCK */ #define HZ ((double)CLK_TCK) #endif #endif #define BUFSIZE ((long)1024) long run=0; #ifndef NOPROTO double Time_F(int s); #else double Time_F(); #endif #ifdef SIGALRM #if defined(__STDC__) || defined(sgi) #define SIGRETTYPE void #else #define SIGRETTYPE int #endif #ifndef NOPROTO SIGRETTYPE sig_done(int sig); #else SIGRETTYPE sig_done(); #endif SIGRETTYPE sig_done(sig) int sig; { signal(SIGALRM,sig_done); run=0; #ifdef LINT sig=sig; #endif } #endif #define START 0 #define STOP 1 double Time_F(s) int s; { double ret; #ifdef TIMES static struct tms tstart,tend; if (s == START) { times(&tstart); return(0); } else { times(&tend); ret=((double)(tend.tms_utime-tstart.tms_utime))/HZ; return((ret == 0.0)?1e-6:ret); } #else /* !times() */ static struct timeb tstart,tend; long i; if (s == START) { ftime(&tstart); return(0); } else { ftime(&tend); i=(long)tend.millitm-(long)tstart.millitm; ret=((double)(tend.time-tstart.time))+((double)i)/1000.0; return((ret == 0.0)?1e-6:ret); } #endif } int main(argc,argv) int argc; char **argv; { long count; static unsigned char buf[BUFSIZE]; static des_cblock key ={0x12,0x34,0x56,0x78,0x9a,0xbc,0xde,0xf0}; static des_cblock key2={0x34,0x56,0x78,0x9a,0xbc,0xde,0xf0,0x12}; static des_cblock key3={0x56,0x78,0x9a,0xbc,0xde,0xf0,0x12,0x34}; des_key_schedule sch,sch2,sch3; double a,b,c,d,e; #ifndef SIGALRM long ca,cb,cc,cd,ce; #endif #ifndef TIMES printf("To get the most acurate results, try to run this\n"); printf("program when this computer is idle.\n"); #endif des_set_key((C_Block *)key2,sch2); des_set_key((C_Block *)key3,sch3); #ifndef SIGALRM printf("First we calculate the approximate speed ...\n"); des_set_key((C_Block *)key,sch); count=10; do { long i; DES_LONG data[2]; count*=2; Time_F(START); for (i=count; i; i--) des_encrypt(data,&(sch[0]),DES_ENCRYPT); d=Time_F(STOP); } while (d < 3.0); ca=count; cb=count*3; cc=count*3*8/BUFSIZE+1; cd=count*8/BUFSIZE+1; ce=count/20+1; printf("Doing set_key %ld times\n",ca); #define COND(d) (count != (d)) #define COUNT(d) (d) #else #define COND(c) (run) #define COUNT(d) (count) signal(SIGALRM,sig_done); printf("Doing set_key for 10 seconds\n"); alarm(10); #endif Time_F(START); for (count=0,run=1; COND(ca); count++) des_set_key((C_Block *)key,sch); d=Time_F(STOP); printf("%ld set_key's in %.2f seconds\n",count,d); a=((double)COUNT(ca))/d; #ifdef SIGALRM printf("Doing des_encrypt's for 10 seconds\n"); alarm(10); #else printf("Doing des_encrypt %ld times\n",cb); #endif Time_F(START); for (count=0,run=1; COND(cb); count++) { DES_LONG data[2]; des_encrypt(data,&(sch[0]),DES_ENCRYPT); } d=Time_F(STOP); printf("%ld des_encrypt's in %.2f second\n",count,d); b=((double)COUNT(cb)*8)/d; #ifdef SIGALRM printf("Doing des_cbc_encrypt on %ld byte blocks for 10 seconds\n", BUFSIZE); alarm(10); #else printf("Doing des_cbc_encrypt %ld times on %ld byte blocks\n",cc, BUFSIZE); #endif Time_F(START); for (count=0,run=1; COND(cc); count++) des_ncbc_encrypt((C_Block *)buf,(C_Block *)buf,BUFSIZE,&(sch[0]), (C_Block *)&(key[0]),DES_ENCRYPT); d=Time_F(STOP); printf("%ld des_cbc_encrypt's of %ld byte blocks in %.2f second\n", count,BUFSIZE,d); c=((double)COUNT(cc)*BUFSIZE)/d; #ifdef SIGALRM printf("Doing des_ede_cbc_encrypt on %ld byte blocks for 10 seconds\n", BUFSIZE); alarm(10); #else printf("Doing des_ede_cbc_encrypt %ld times on %ld byte blocks\n",cd, BUFSIZE); #endif Time_F(START); for (count=0,run=1; COND(cd); count++) des_ede3_cbc_encrypt((C_Block *)buf,(C_Block *)buf,BUFSIZE, &(sch[0]), &(sch2[0]), &(sch3[0]), (C_Block *)&(key[0]), DES_ENCRYPT); d=Time_F(STOP); printf("%ld des_ede_cbc_encrypt's of %ld byte blocks in %.2f second\n", count,BUFSIZE,d); d=((double)COUNT(cd)*BUFSIZE)/d; #ifdef SIGALRM printf("Doing crypt for 10 seconds\n"); alarm(10); #else printf("Doing crypt %ld times\n",ce); #endif Time_F(START); for (count=0,run=1; COND(ce); count++) crypt("testing1","ef"); e=Time_F(STOP); printf("%ld crypts in %.2f second\n",count,e); e=((double)COUNT(ce))/e; printf("set_key per sec = %12.2f (%5.1fuS)\n",a,1.0e6/a); printf("DES raw ecb b (…)
1 /* crypto/des/speed.c */ local
/macosx-10.9.5/Libc-997.90.3/gdtoa/FreeBSD/
H A Dgdtoa-smisc.c140 ULong *ce, *x, *xe; local
145 ce = c + ((n-1) >> kshift) + 1;
159 while(c < ce)
/macosx-10.9.5/vim-53/runtime/
H A Dtermcap9 :nd=\E[C:up=\E[A:ce=\E[K:ho=\E[H:pt:
13 :ce=\E[K:cd=\E[J:\
38 :al=\EE:am:bs:bt=\EI:bw:cd=\EY:ce=\ET:cl=^Z:cm=\E=%+ %+ :co#80:dc=\EW:\
48 :ce=3\E[K:cd=50\E[J:so=2\E[7m:se=2\E[m:us=2\E[4m:ue=2\E[m:\
58 :co#80:li#25:am:do=\E[B:ce=\E[K:cd=\E[J:\
67 :ce=\E[K:ho=\E[H:dc=\E[P:ic=\E[@:vi=\E[0 p:ve=\E[1 p:\
85 :ce=^W^H^E^F\200\200\200\200\200\200:\
/macosx-10.9.5/pcre-7/pcre/
H A Dpcre_study.c94 uschar *cs, *ce; local
341 ce = cs = (uschar *)_pcre_find_bracket(startcode, utf8, GET2(cc, 1));
343 do ce += GET(ce, 1); while (*ce == OP_ALT);
344 if (cc > cs && cc < ce)
381 cs = ce = (uschar *)startcode + GET(cc, 1);
383 do ce += GET(ce, 1); while (*ce
[all...]
/macosx-10.9.5/ksh-20/ksh/src/lib/libast/regex/
H A Dregcomp.c1033 col(Celt_t* ce, int ic, unsigned char* bp, int bw, int bc, unsigned char* ep, int ew, int ec) argument
1092 mbxfrm(ce->beg, key, COLL_KEY_MAX);
1148 mbxfrm(ce->end, key, COLL_KEY_MAX);
1157 ce->typ = bt == et ? bt : COLL_range;
1160 ce->typ = COLL_char;
1161 ce++;
1166 return ce;
1432 Celt_t* ce; local
1477 ce = (Celt_t*)e->re.data;
1479 e->re.collate.elements = ce;
1759 Celt_t* ce; local
[all...]
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/page/
H A Dgen_peg_mecpu.tcl263 foreach {cs ce} $cmarker break
264 return "$cs [join $lines " $ce\n$cs "] $ce"

Completed in 311 milliseconds

12345