| /picolibc-3.5.0-3.4.0/newlib/libc/search/ |
| D | hash_func.c | 54 * Assume that we've already split the bucket to which this key hashes,
69 const u_char *key;
73 for (key = keyarg, h = 0; len--;)
74 h = h * PRIME1 ^ (*key++ - ' ');
91 const u_char *e, *key;
95 key = keyarg;
96 e = key + len;
97 for (h = 0; key != e;) {
98 c = *key++;
99 if (!c && key > e)
[all …]
|
| D | hash_bigkey.c | 43 * Big key/data handling for the hashing package.
80 * You need to do an insert and the key/data pair is too big
89 const DBT *key, in __big_insert() argument
101 key_data = (char *)key->data; in __big_insert()
102 key_size = key->size; in __big_insert()
106 /* First move the Key */ in __big_insert()
149 * same page as the key ends, FREESPACE is at least one. in __big_insert()
177 * Called when bufp's page contains a partial key (index should be 1)
179 * All pages in the big key/data pair except bufp are freed. We cannot
225 * key/data pair. Bufp points to the first one -- it should now be in __big_delete()
[all …]
|
| D | hash_page.c | 95 putpair(char *p, const DBT *key, const DBT *val) in putpair() argument
101 /* Enter the key first. */ in putpair()
104 off = OFFSET(bp) - key->size; in putpair()
105 memmove(p + off, key->data, key->size); in putpair()
184 DBT key, val; in __split_page() local
215 key.data = (u_char *)op + ino[n]; in __split_page()
216 key.size = off - ino[n]; in __split_page()
218 if (__call_hash(hashp, key.data, key.size) == obucket) { in __split_page()
234 putpair(np, &key, &val); in __split_page()
258 * Called when we encounter an overflow or big key/data page during split
[all …]
|
| D | hcreate.3 | 88 .Fa item.key
89 points to the comparison key (a
96 that key.
165 int age, room; /* other than the key. */
188 item.key = str_ptr;
197 item.key = name_to_find;
198 while (scanf("%s", item.key) != EOF) {
202 found_item->key,
|
| D | ndbm.c | 97 dbm_fetch(DBM *db, datum key) in dbm_fetch() argument
103 dbtkey.data = key.dptr; in dbm_fetch()
104 dbtkey.size = key.dsize; in dbm_fetch()
161 dbm_delete(DBM *db, datum key) in dbm_delete() argument
166 dbtkey.data = key.dptr; in dbm_delete()
167 dbtkey.size = key.dsize; in dbm_delete()
182 dbm_store(DBM *db, datum key, datum data, int flags) in dbm_store() argument
186 dbtkey.data = key.dptr; in dbm_store()
187 dbtkey.size = key.dsize; in dbm_store()
|
| D | hash.h | 205 * each page which point to the beginning of the key and data. There are
210 * OVFLPAGE Rather than a key data pair, this pair contains
215 * PARTIAL_KEY This must be the first key/data pair on a page
216 * and implies that page contains only a partial key.
217 * That is, the key is too big to fit on a single page
222 * KEY_OFF -- offset of the beginning of the key
227 * FULL_KEY This must be the first key/data pair on the page. It
231 * There is a complete key on the page but no data
238 * KEY_OFF -- offset of the beginning of the key
244 * This page contains no key, but part of a large
[all …]
|
| D | tsearch.3 | 39 .Fn tdelete "const void *key" "void **rootp" "int (*compar) (const void *, const void *)"
41 .Fn tfind "const void *key" "void **rootp" "int (*compar) (const void *, const void *)"
43 .Fn tsearch "const void *key" "void **rootp" "int (*compar) (const void *, const void *)"
60 .Fa key
70 .Fa key
|
| D | bsearch.c | 35 * to by base, for a member that matches the object pointed to by key. The
53 void *bsearch(const void *<[key]>, const void *<[base]>,
59 that matches <[key]>, using binary search. <[nmemb]> is the element
74 Returns a pointer to an element of <[array]> that matches <[key]>. If
87 bsearch (const void *key, in bsearch() argument
107 result = compar (key, current); in bsearch()
|
| D | hcreate_r.c | 145 free(ie->ent.key); in hdestroy_r()
162 len = strlen(item.key); in hsearch_r()
163 hashval = __default_hash(item.key, len); in hsearch_r()
168 if (strcmp(ie->ent.key, item.key) == 0) in hsearch_r()
190 ie->ent.key = item.key; in hsearch_r()
|
| D | page.h | 53 * | key | data | key |
63 * key and room for the data
67 * where a single key/data pair fits on a page, but you can't append an
68 * overflow page and later you'd have to split the key/data and handle like
|
| D | tsearch.c | 56 tsearch (const void *vkey, /* key to be located */ in tsearch()
69 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ in tsearch()
77 q = malloc(sizeof(node_t)); /* T5: key not found */ in tsearch()
81 q->key = (void *)vkey; /* initialize new node */ in tsearch()
|
| D | tdelete.c | 55 /* delete node with given key */
57 tdelete (const void *__restrict vkey, /* key to be deleted */ in tdelete()
68 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) { in tdelete()
74 return NULL; /* key not found */ in tdelete()
|
| D | tfind.c | 56 tfind (const void *vkey, /* key to be found */ in tfind()
68 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ in tfind()
69 return *rootp; /* key found */ in tfind()
|
| D | hash.c | 559 * 1 to indicate an external ERROR (i.e. key not found, etc)
564 const DBT *key, argument
575 return (hash_access(hashp, HASH_GET, (DBT *)key, data));
580 DBT *key, argument
597 HASH_PUTNEW : HASH_PUT, (DBT *)key, (DBT *)data));
602 const DBT *key, argument
616 return (hash_access(hashp, HASH_DELETE, (DBT *)key, NULL));
625 DBT *key, argument
640 size = key->size;
641 kp = (char *)key->data;
[all …]
|
| D | db_local.h | 53 /* Key/data structure -- a Data-Base Thang. */
84 * is so that the access methods can skip copying the key/data pair when
145 #define R_NOKEY 0x02 /* key not required */
|
| /picolibc-3.5.0-3.4.0/newlib/testsuite/newlib.search/ |
| D | hsearchtest.c | 78 e.key = strdup(ch); /* ptr to provided key is kept! */ in main()
79 TEST(e.key != NULL); in main()
83 TEST(strcmp(ep->key, ch) == 0); in main()
87 /* e.key should be constant from here on down. */ in main()
88 e.key = ch; in main()
95 TEST(strcmp(ep->key, ch) == 0); in main()
104 TEST(strcmp(ep->key, ch) == 0); in main()
118 TEST(strcmp(ep->key, "a") == 0 && (uintptr_t)ep->data == 0); in main()
120 TEST(strcmp(ep2->key, "b") == 0 && (uintptr_t)ep2->data == 1); in main()
|
| /picolibc-3.5.0-3.4.0/.github/workflows/ |
| D | linux.yml | 31 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
69 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
120 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
171 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
222 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
|
| D | steps-head | 11 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
|
| D | head | 31 key: ${{ env.IMAGE_FILE }}-${{ hashFiles( env.PACKAGES_FILE, env.EXTRA_FILE ) }}
|
| /picolibc-3.5.0-3.4.0/newlib/libc/include/ |
| D | search.h | 45 char *key; member
62 char *key; member
|
| /picolibc-3.5.0-3.4.0/newlib/libc/machine/cris/sys/ |
| D | errno.h | 189 #define ENOKEY 126 /* Required key not available */
190 #define EKEYEXPIRED 127 /* Key has expired */
191 #define EKEYREVOKED 128 /* Key has been revoked */
192 #define EKEYREJECTED 129 /* Key was rejected by service */
|
| /picolibc-3.5.0-3.4.0/scripts/ |
| D | GeneratePicolibcCrossFile.sh | 229 for key in "${!USER_LONG_OPTIONS_SPEC[@]}"; do
230 printf -- "- %s=%s\\n" "$key" "${USER_LONG_OPTIONS_SPEC[$key]}"
251 if [[ "$OPTARG" =~ .*=.* ]] # With this --key=value format, only one argument is possible.
271 else # With this format, multiple arguments are possible, like in "--key value1 value2".
|
| /picolibc-3.5.0-3.4.0/.github/ |
| D | Dockerfile | 9 …wget -O /etc/apt/trusted.gpg.d/altusmetrum.gpg https://maps.altusmetrum.org/archive/archive-key.gp…
|
| /picolibc-3.5.0-3.4.0/newlib/libc/stdlib/ |
| D | cxa_finalize.c | 6 This is also the key function to be configured as lite exit, a size-reduced
|
| D | cxa_atexit.c | 6 This is also the key function to be configured as lite exit, a size-reduced
|
