Searched refs:hash (Results 1 - 25 of 43) sorted by relevance

12

/PHP_TRUNK/ext/ereg/regex/
H A Dregex2.h80 * and a mask to pick out the relevant bit of each byte. A hash code
91 uch hash; /* hash code */ member in struct:__anon72
96 #define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
97 #define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
/PHP_TRUNK/ext/phar/phar/
H A Dpharcommand.inc68 'inf' => '<bang> Hash-bang line to start the archive (e.g. #!/usr/bin/php). The hash '
94 'inf' => '<method> Selects the hash algorithm.',
412 * Check whether hash method is valid.
416 function phar_check_hash($hash, $privkey)
418 switch($hash) {
565 $hash = $this->args['h']['val'];
574 $hash = self::phar_check_hash($hash, $privkey);
606 if ($hash) {
607 $phar->setSignatureAlgorithm($hash,
[all...]
/PHP_TRUNK/ext/standard/
H A Dcrypt_freesec.c747 char *hash; member in struct:__anon445
794 for (i = 0; tests[i].hash; i++) {
795 char *hash = crypt(tests[i].pw, tests[i].hash); local
796 if (!hash && strlen(tests[i].hash) < 13)
798 if (!strcmp(hash, tests[i].hash))
H A Dpassword.c60 static php_password_algo php_password_determine_algo(const char *hash, const size_t len) argument
62 if (len > 3 && hash[0] == '$' && hash[1] == '2' && hash[2] == 'y' && len == 60) {
179 char *hash, *algo_name; local
182 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "s", &hash, &hash_len) == FAILURE) {
187 php_error_docref(NULL TSRMLS_CC, E_WARNING, "Supplied password hash too long to safely identify");
194 algo = php_password_determine_algo(hash, (size_t) hash_len);
201 sscanf(hash, "$2y$%ld$", &cost);
222 char *hash; local
277 char *ret, *password, *hash; local
310 char *hash_format, *hash, *salt, *password, *result; local
[all...]
H A Darray.c1059 /* Iterate through hash */
1181 HashPosition pos; /* hash iterator */
1476 Creates a hash containing variables and their values */
1741 HashTable *hash; local
1751 hash = Z_ARRVAL_P(array);
1754 for (j = 0, temp = hash->pListHead; temp; temp = temp->pListNext)
1767 hash->pListHead = elems[0];
1768 hash->pListTail = NULL;
1769 hash->pInternalPointer = hash
3026 HashTable *hash; local
3444 HashTable *hash; local
3816 HashTable* hash; local
[all...]
/PHP_TRUNK/ext/standard/html_tables/
H A Dhtml_table_gen.php641 * significantly slower than the hash tables for html 5 entities */
698 "/* {{{ $name hash table for entity -> codepoint */", "\n\n";
725 $hash = 5381; variable
730 $hash = (int)(((int)(((int)($hash << 5)) + $hash)) + ord($str[$pos++])) variable
733 return $hash;
790 "/* end of $name hash table for entity -> codepoint }}} */\n\n";
/PHP_TRUNK/ext/hash/
H A Dbench.php82 hash($algo, $data);
H A Dhash.c188 /* {{{ proto string hash(string algo, string data[, bool raw_output = false])
189 Generate a hash of a given input string
191 PHP_FUNCTION(hash)
198 Generate a hash of a given file
313 Generate a hash of a given input string with a key using HMAC
322 Generate a hash of a given file with a key using HMAC
340 php_hash_data *hash; local
362 hash = emalloc(sizeof(php_hash_data));
363 hash->ops = ops;
364 hash
401 php_hash_data *hash; local
422 php_hash_data *hash; local
459 php_hash_data *hash; local
492 php_hash_data *hash; local
556 php_hash_data *hash, *copy_hash; local
733 php_hash_data *hash = (php_hash_data*)rsrc->ptr; local
[all...]
H A Dphp_hash.h27 #define PHP_HASH_EXTNAME "hash"
120 PHP_FUNCTION(hash); variable
/PHP_TRUNK/ext/intl/collator/
H A Dcollator_convert.c44 HashTable* hash, int hashKeyType, char* hashKey, ulong hashIndex,
54 /* Get current hash item. */
55 zend_hash_get_current_data( hash, (void**) &hashData );
69 /* Update current hash item with the converted value. */
75 zend_hash_update( hash, hashKey, strlen( hashKey ) + 1,
80 zend_hash_index_update( hash, hashIndex,
88 HashTable* hash, int hashKeyType, char* hashKey, ulong hashIndex,
98 /* Get current hash item. */
99 zend_hash_get_current_data( hash, (void**) &hashData );
114 /* Update current hash ite
43 collator_convert_hash_item_from_utf8_to_utf16( HashTable* hash, int hashKeyType, char* hashKey, ulong hashIndex, UErrorCode* status ) argument
87 collator_convert_hash_item_from_utf16_to_utf8( HashTable* hash, int hashKeyType, char* hashKey, ulong hashIndex, UErrorCode* status ) argument
134 collator_convert_hash_from_utf8_to_utf16( HashTable* hash, UErrorCode* status ) argument
159 collator_convert_hash_from_utf16_to_utf8( HashTable* hash, UErrorCode* status ) argument
[all...]
H A Dcollator_convert.h24 void collator_convert_hash_from_utf8_to_utf16( HashTable* hash, UErrorCode* status );
25 void collator_convert_hash_from_utf16_to_utf8( HashTable* hash, UErrorCode* status );
H A Dcollator_sort.c39 zval** zstr; /* pointer to original string(hash-item) */
293 HashTable* hash = NULL; local
315 hash = HASH_OF( array );
318 collator_convert_hash_from_utf8_to_utf16( hash, COLLATOR_ERROR_CODE_P( co ) );
319 COLLATOR_CHECK_STATUS( co, "Error converting hash from UTF-8 to UTF-16" );
326 zend_hash_sort( hash, zend_qsort, collator_compare_func, renumber TSRMLS_CC );
332 collator_convert_hash_from_utf16_to_utf8( hash, COLLATOR_ERROR_CODE_P( co ) );
333 COLLATOR_CHECK_STATUS( co, "Error converting hash from UTF-16 to UTF-8" );
360 HashTable* hash = NULL; local
361 zval** hashData = NULL; /* currently processed item of input hash */
[all...]
/PHP_TRUNK/ext/mbstring/oniguruma/
H A Dst.c1 /* This is a public domain general purpose hash table package written by Peter Moore @ UCB. */
19 unsigned int hash; member in struct:st_table_entry
59 #define do_hash(key,table) (unsigned int)(*(table)->type->hash)((key))
219 ((ptr) != 0 && (ptr->hash != (hash_val) || !EQUAL((table), (key), (ptr)->key)))
270 entry->hash = hash_val;\
328 hash_val = ptr->hash % new_num_bins;
492 case ST_CHECK: /* check if hash is modified during iteration */
H A Dst.h1 /* This is a public domain general purpose hash table package written by Peter Moore @ UCB. */
21 int (*hash)(); member in struct:st_hash_type
/PHP_TRUNK/ext/dba/libcdb/
H A Dcdb_make.c63 c->hash = 0;
178 c->hash = c->split + c->numentries;
200 c->hash[u].h = c->hash[u].p = 0;
205 while (c->hash[where].p)
208 c->hash[where] = *hp++;
212 uint32_pack(buf, c->hash[u].h);
213 uint32_pack(buf + 4, c->hash[u].p);
H A Dcdb_make.h48 struct cdb_hp *split; /* includes space for hash */
49 struct cdb_hp *hash; member in struct:cdb_make
/PHP_TRUNK/ext/interbase/
H A Dinterbase.c897 char *c, hash[16], *args[] = { NULL, NULL, NULL, NULL, NULL }; local
940 PHP_MD5Final(hash, &hash_context);
943 if (SUCCESS == zend_hash_find(&EG(regular_list), hash, sizeof(hash), (void *) &le)) {
956 zend_hash_del(&EG(regular_list), hash, sizeof(hash)); local
961 switch (zend_hash_find(&EG(persistent_list), hash, sizeof(hash), (void *) &le)) {
979 zend_hash_del(&EG(persistent_list), hash, sizeof(hash)); local
[all...]
/PHP_TRUNK/ext/oci8/
H A Doci8_statement.c897 HashTable *hash = HASH_OF(bind->zval); local
899 zend_hash_internal_pointer_reset(hash);
906 if ((i < bind->array.old_length) && (zend_hash_get_current_data(hash, (void **) &entry) != FAILURE)) {
909 zend_hash_move_forward(hash);
917 if ((i < bind->array.old_length) && (zend_hash_get_current_data(hash, (void **) &entry) != FAILURE)) {
920 zend_hash_move_forward(hash);
933 if ((i < bind->array.old_length) && (zend_hash_get_current_data(hash, (void **) &entry) != FAILURE)) {
944 zend_hash_move_forward(hash);
967 if ((i < bind->array.old_length) && (zend_hash_get_current_data(hash, (void **) &entry) != FAILURE)) {
970 zend_hash_move_forward(hash);
1510 HashTable *hash; local
1579 HashTable *hash; local
1617 HashTable *hash; local
1655 HashTable *hash; local
[all...]
/PHP_TRUNK/ext/session/
H A Dmod_mm.c49 php_uint32 hv; /* hash value of key */
59 ps_sd **hash; member in struct:__anon183
94 nhash = mm_calloc(data->mm, nmax + 1, sizeof(*data->hash));
97 /* no further memory to expand hash table */
101 ehash = data->hash + data->hash_max + 1;
102 for (ohash = data->hash; ohash < ehash; ohash++) {
109 mm_free(data->mm, data->hash);
111 data->hash = nhash;
141 sd->next = data->hash[slot];
142 data->hash[slo
[all...]
/PHP_TRUNK/ext/spl/
H A Dspl_observer.c120 char *hash = emalloc((hash_len+1)*sizeof(char)); local
121 strncpy(hash, Z_STRVAL_P(rv), hash_len);
122 hash[hash_len] = 0;
128 return hash;
149 char *hash = emalloc(hash_len + 1);
156 memcpy(hash, (char *)&zvalue, hash_len);
157 hash[hash_len] = 0;
163 return hash;
168 static void spl_object_storage_free_hash(spl_SplObjectStorage *intern, char *hash) { argument
170 efree(hash);
186 spl_object_storage_get(spl_SplObjectStorage *intern, char *hash, int hash_len TSRMLS_DC) argument
201 char *hash = spl_object_storage_get_hash(intern, this, obj, &hash_len TSRMLS_CC); local
229 char *hash = spl_object_storage_get_hash(intern, this, obj, &hash_len TSRMLS_CC); local
442 char *hash = spl_object_storage_get_hash(intern, this, obj, &hash_len TSRMLS_CC); local
487 char *hash; local
507 char *hash; local
840 char *hash; local
[all...]
/PHP_TRUNK/ext/xml/
H A Dexpat_compat.h39 #include <libxml/hash.h>
/PHP_TRUNK/Zend/
H A Dzend_hash.h144 * return value, it assumes things about the order of the elements in the hash.
233 * This is Daniel J. Bernstein's popular `times 33' hash function as
235 * like ``hash(i) = hash(i-1) * 33 + str[i]''. This is one of the best
236 * known hash functions for strings. Because it is both computed very
245 * all distribute in an acceptable way and this way fill a hash table
254 * or subtraction operation. And because a hash function has to both
265 register ulong hash = 5381; local
267 /* variant with the hash unrolled eight times */
269 hash
[all...]
/PHP_TRUNK/ext/opcache/
H A Dzend_accelerator_module.c291 persistent_script = zend_accel_hash_find(&ZCSG(hash), filename, filename_len + 1);
298 persistent_script = zend_accel_hash_find(&ZCSG(hash), key, key_length + 1);
415 snprintf(buf, sizeof(buf), "%ld", ZCSG(hash).num_direct_entries);
417 snprintf(buf, sizeof(buf), "%ld", ZCSG(hash).num_entries);
419 snprintf(buf, sizeof(buf), "%ld", ZCSG(hash).max_num_entries);
469 for (i = 0; i<ZCSG(hash).max_num_entries; i++) {
470 for (cache_entry = ZCSG(hash).hash_table[i]; cache_entry; cache_entry = cache_entry->next) {
543 add_assoc_long(statistics, "num_cached_scripts", ZCSG(hash).num_direct_entries);
544 add_assoc_long(statistics, "num_cached_keys", ZCSG(hash).num_entries);
545 add_assoc_long(statistics, "max_cached_keys", ZCSG(hash)
[all...]
H A DZendAccelerator.c195 * values in ZCG(include_paths) shared hash table, current value in
390 /* function table hash keys */
399 /* class table hash keys, class names, properties, methods, constants, etc */
446 /* constant hash keys */
455 /* auto globals hash keys and names */
1065 persistent_script = zend_accel_hash_find(&ZCSG(hash), realpath, strlen(realpath) + 1);
1084 zend_accel_hash_is_full(&ZCSG(hash)) ? ACCEL_RESTART_HASH : ACCEL_RESTART_OOM;
1102 if (!zend_accel_hash_find(&ZCSG(hash), key, key_length + 1)) {
1103 if (zend_accel_hash_is_full(&ZCSG(hash))) {
1104 zend_accel_error(ACCEL_LOG_DEBUG, "No more entries in hash tabl
[all...]
/PHP_TRUNK/ext/opcache/Optimizer/
H A Dcompact_literals.c99 HashTable hash; local
285 zend_hash_init(&hash, 16, NULL, NULL, 0);
329 if (zend_hash_index_find(&hash, Z_LVAL(op_array->literals[i].constant), (void**)&pos) == SUCCESS) {
333 zend_hash_index_update(&hash, Z_LVAL(op_array->literals[i].constant), (void**)&j, sizeof(int), NULL);
342 if (zend_hash_find(&hash, (char*)&Z_DVAL(op_array->literals[i].constant), sizeof(double), (void**)&pos) == SUCCESS) {
346 zend_hash_add(&hash, (char*)&Z_DVAL(op_array->literals[i].constant), sizeof(double), (void**)&j, sizeof(int), NULL);
378 zend_hash_quick_find(&hash, key, key_len, h, (void**)&pos) == SUCCESS &&
396 zend_hash_quick_add(&hash, key, key_len, h, (void**)&j, sizeof(int), NULL);
444 zend_hash_destroy(&hash);

Completed in 60 milliseconds

12