Searched defs:words (Results 1 - 25 of 44) sorted by relevance

12

/forgerock/opendj-b2.6/resource/dsml/lib/
H A Djaxb-impl.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/sun/ com/sun/xml/ com/sun/xml/bind/ ...
H A Djaxb-xjc.jarMETA-INF/ META-INF/MANIFEST.MF META-INF/maven/ META-INF/maven/com. ...
/forgerock/opendj2-jel-hg/resource/dsml/lib/
H A Djaxb-impl.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/sun/ com/sun/xml/ com/sun/xml/bind/ ...
H A Djaxb-xjc.jarMETA-INF/ META-INF/MANIFEST.MF META-INF/maven/ META-INF/maven/com. ...
/forgerock/openam-v13/openam-oauth/samples/StockClient/lib/
H A Djersey-core-1.1.1-ea-SNAPSHOT.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/sun/ com/sun/jersey/ com/sun/jersey/api/ ...
/forgerock/openam-v13/openam-oauth/samples/StockService/lib/
H A Djersey-core-1.1.1-ea-SNAPSHOT.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/sun/ com/sun/jersey/ com/sun/jersey/api/ ...
/illumos-gate/usr/src/lib/pam_modules/authtok_check/
H A Dpacker.c40 * - each single source dictionary can only hold up to 4GB words
108 /* write words to file */
159 * words in "buf" and insert each of them into the offsets-array.
182 * make sure we only insert words consisting of
200 * helper-routine used for quicksort. we compate two words in the
288 * and insert the thus sorted words into the cracklib database
296 char *words[MAXTMP]; local
303 if ((words[ti] = malloc(MAXWORDLEN)) == NULL) {
305 free(words[ti]);
310 * we read the first word of each of the temp-files into words[]
[all...]
/illumos-gate/usr/src/lib/libtsol/common/
H A Dprivate.c51 * cvt: char *long_words[display_size]; Pointers to long words
52 * char *short_words[display_size]; Pointers to short words
55 * strings associated with long and short words.
60 * Sensitivity Label words.
72 * Clearance words.
85 alloc_words(char **words, const size_t size) argument
87 if (*words == NULL) {
88 if ((*words = malloc(size)) == NULL)
91 if ((*words = realloc(*words, siz
[all...]
/illumos-gate/usr/src/lib/libnsl/nss/
H A Dinet_ntop.c114 uint_t words[IN6ADDRSZ / INT16SZ]; local
122 (void) memset(words, '\0', sizeof (words));
124 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
128 if (words[i] == 0) {
165 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
171 tp += SPRINTF((tp, "%x", words[i]));
/illumos-gate/usr/src/lib/libresolv2/common/inet/
H A Dinet_cidr_ntop.c164 u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; local
177 memset(words, '\0', sizeof words);
179 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
185 if (words[i] == 0) {
222 (best.len == 7 && words[7] != 0x0001) ||
223 (best.len == 5 && words[5] == 0xffff))) {
240 tp += SPRINTF((tp, "%x", words[i]));
H A Dinet_net_ntop.c179 int words; local
206 /* how many words need to be displayed in output */
207 words = (bits + 15) / 16;
208 if (words == 1)
209 words = 2;
213 for (i = 0; i < (words * 2); i += 2) {
232 if (zero_l != words && zero_s == 0 && ((zero_l == 6) ||
237 /* Format whole words. */
238 for (p = 0; p < words; p++) {
243 if (p == words
[all...]
H A Dinet_net_pton.c273 int words; local
340 words = (bits + 15) / 16;
341 if (words < 2)
342 words = 2;
344 words = 8;
345 endp = tmp + 2 * words;
/illumos-gate/usr/src/lib/libcmd/common/
H A Dgrep.c79 "[w:word-match|word-regexp?Force \apatterns\a to match complete words.]"
169 unsigned char words; /* word matches only */ member in struct:State_s
194 if (state->words)
769 state.words = 1;
787 if ((state.options & REG_LITERAL) && state.words)
H A Dwc.h45 Sfoff_t words; member in struct:__anon3094
/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/
H A Dgetfilter.c456 if ( i > wordnum ) { /* add blank btw words */
517 char *word, **words; local
521 if (( words = (char **)NSLDAPI_CALLOC( 1, sizeof( char * ))) == NULL ) {
525 words[ count ] = NULL;
529 if (( words = (char **)NSLDAPI_REALLOC( words,
534 words[ count ] = word;
535 words[ ++count ] = NULL;
539 *wordsp = words;
/illumos-gate/usr/src/cmd/refer/
H A Dglue5.c30 struct words { struct
33 struct words *nst;
34 struct words *link;
35 struct words *fail;
58 static int new(struct words *x);
68 www = (struct words *)zalloc(MAXSIZ, sizeof (*www));
127 struct words *c;
268 struct words *s;
345 struct words *queue[QSIZE];
346 struct words **fron
[all...]
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dlgrp.c58 print_cpuset_range(ulong_t *cs, int words, int width) argument
68 for (i = 0; i < words; i++)
/illumos-gate/usr/src/cmd/mdb/sun4u/modules/unix/
H A Dunix.c427 print_cpuset_range(ulong_t *cs, int words, int width) argument
437 for (i = 0; i < words; i++)
466 int words; local
480 if ((words = BT_BITOUL(ncpu)) == 1) {
484 setp = mdb_alloc(words * sizeof (ulong_t), UM_SLEEP | UM_GC);
485 mdb_vread(setp, words * sizeof (ulong_t), addr);
492 for (i = 0; i < words; i++)
500 for (i = 0; i < words; i++) {
505 print_cpuset_range(setp, words, 0);
/illumos-gate/usr/src/cmd/fgrep/
H A Dfgrep.c115 struct words { struct
118 struct words *nst;
119 struct words *link;
120 struct words *fail;
246 * Normally we need one struct words for each letter in the pattern
247 * plus one terminating struct words with outp = 1, but when -x option
248 * is specified we require one more struct words for `\n` character so we
259 w = (struct words *)calloc(input_size, sizeof (struct words));
302 struct words *
[all...]
/illumos-gate/usr/src/psm/stand/cpr/sparcv9/sun4u/
H A Dmachdep.c79 * get machdep desc and set length of prom words
110 * interpret saved prom words
117 char *words; local
125 * The first string defines Forth words which help the prom
128 * The second string defines Forth words required by kadb to
131 words = SF_DATA();
134 wlen = prom_strlen(words) + 1; /* include the null */
137 (void) prom_strncpy(minibuf, words, s);
142 prom_interpret(words, 0, 0, 0, 0, 0);
143 words
[all...]
/illumos-gate/usr/src/uts/common/rpc/
H A Drpc_subr.c756 uint_t words[IN6ADDRSZ / INT16SZ]; local
766 bzero(words, sizeof (words));
768 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
773 if (words[i] == 0) {
809 (void) sprintf(tp, "%x", words[i]);
/illumos-gate/usr/src/uts/common/io/ntxn/
H A Dunm_nic_hw.c2150 u64 qhdr, req_hdr, words[6]; member in struct:__anon6415
2170 req.words[0] = HOST_TO_LE_64(*(u64 *)(uintptr_t)&mac_req);
2188 req.words[0] = HOST_TO_LE_64(mode);
/illumos-gate/usr/src/lib/libm/common/m9x/
H A Dfenv_inlines.h39 } words; member in union:fp_cwsw
50 : "=m" (u->words.cw), "=m" (u->words.sw));
68 : "r" (cwsw.words.cw), "r" (cwsw.words.sw)
/illumos-gate/usr/src/uts/common/io/e1000api/
H A De1000_80003es2lan.c52 u16 words, u16 *data);
611 * @words: number of words to write
614 * Write "words" of data to the ESB2 NVM.
617 u16 words, u16 *data)
621 return e1000_write_nvm_spi(hw, offset, words, data);
616 e1000_write_nvm_80003es2lan(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
H A De1000_i210.c41 static s32 e1000_write_nvm_srwr(struct e1000_hw *hw, u16 offset, u16 words,
229 * @words: number of words to read
235 s32 e1000_read_nvm_srrd_i210(struct e1000_hw *hw, u16 offset, u16 words, argument
246 for (i = 0; i < words; i += E1000_EERD_EEWR_MAX_COUNT) {
247 count = (words - i) / E1000_EERD_EEWR_MAX_COUNT > 0 ?
248 E1000_EERD_EEWR_MAX_COUNT : (words - i);
268 * @words: number of words to write
280 s32 e1000_write_nvm_srwr_i210(struct e1000_hw *hw, u16 offset, u16 words, argument
321 e1000_write_nvm_srwr(struct e1000_hw *hw, u16 offset, u16 words, u16 *data) argument
418 e1000_read_invm_i210(struct e1000_hw *hw, u16 offset, u16 E1000_UNUSEDARG words, u16 *data) argument
[all...]

Completed in 219 milliseconds

12