HomeSort by relevance Sort by last modified time
    Searched full:htable (Results 1 - 25 of 48) sorted by null

1 2

  /external/libsepol/src/
sidtab.c 30 s->htable = malloc(sizeof(sidtab_ptr_t) * SIDTAB_SIZE);
31 if (!s->htable)
34 s->htable[i] = (sidtab_ptr_t) NULL;
48 if (!s || !s->htable)
53 cur = s->htable[hvalue];
77 newnode->next = s->htable[hvalue];
78 s->htable[hvalue] = newnode;
92 if (!s || !s->htable)
97 cur = s->htable[hvalue];
107 s->htable[hvalue] = cur->next
    [all...]
hashtab.c 55 p->htable = (hashtab_ptr_t *) malloc(sizeof(hashtab_ptr_t) * size);
56 if (p->htable == NULL) {
61 p->htable[i] = (hashtab_ptr_t) NULL;
76 cur = h->htable[hvalue];
95 newnode->next = h->htable[hvalue];
96 h->htable[hvalue] = newnode;
115 cur = h->htable[hvalue];
125 h->htable[hvalue] = cur->next;
148 cur = h->htable[hvalue];
170 newnode->next = h->htable[hvalue]
    [all...]
avtab.c 73 newnode->next = h->htable[hvalue];
74 h->htable[hvalue] = newnode;
88 if (!h || !h->htable)
92 for (prev = NULL, cur = h->htable[hvalue];
129 if (!h || !h->htable)
132 for (prev = NULL, cur = h->htable[hvalue];
161 if (!h || !h->htable)
165 for (cur = h->htable[hvalue]; cur; cur = cur->next) {
196 if (!h || !h->htable)
200 for (cur = h->htable[hvalue]; cur; cur = cur->next)
    [all...]
  /external/libselinux/src/
avc_sidtab.c 35 s->htable = (struct sidtab_node **)avc_malloc
38 if (!s->htable) {
43 s->htable[i] = NULL;
68 newnode->next = s->htable[hvalue];
71 s->htable[hvalue] = newnode;
88 cur = s->htable[hvalue];
112 cur = h->htable[i];
141 cur = s->htable[i];
148 s->htable[i] = NULL;
150 avc_free(s->htable);
    [all...]
avc_sidtab.h 23 struct sidtab_node **htable; member in struct:sidtab
  /external/qemu/distrib/libselinux/src/
avc_sidtab.c 35 s->htable = (struct sidtab_node **)avc_malloc
38 if (!s->htable) {
43 s->htable[i] = NULL;
68 newnode->next = s->htable[hvalue];
71 s->htable[hvalue] = newnode;
88 cur = s->htable[hvalue];
112 cur = h->htable[i];
141 cur = s->htable[i];
148 s->htable[i] = NULL;
150 avc_free(s->htable);
    [all...]
avc_sidtab.h 23 struct sidtab_node **htable; member in struct:sidtab
  /external/chromium_org/third_party/boringssl/src/crypto/modes/
gcm.c 88 static void gcm_init_4bit(u128 Htable[16], uint64_t H[2]) {
91 Htable[0].hi = 0;
92 Htable[0].lo = 0;
96 Htable[8] = V;
98 Htable[4] = V;
100 Htable[2] = V;
102 Htable[1] = V;
103 Htable[3].hi = V.hi ^ Htable[2].hi, Htable[3].lo = V.lo ^ Htable[2].lo
    [all...]
internal.h 161 /* Relative position of Xi, H and pre-computed Htable is used in some
163 u128 Htable[16];
164 void (*gmult)(uint64_t Xi[2], const u128 Htable[16]);
165 void (*ghash)(uint64_t Xi[2], const u128 Htable[16], const uint8_t *inp,
  /external/openssl/crypto/modes/asm/
ghash-ia64.pl 165 { .mmi; ld8 r`16+2*$i+1`=[r8],16 // Htable[$i].hi
166 ld8 r`16+2*$i`=[r9],16 } // Htable[$i].lo
167 { .mmi; ldf8 f`32+2*$i+1`=[r10],16 // Htable[`8+$i`].hi
168 ldf8 f`32+2*$i`=[r11],16 // Htable[`8+$i`].lo
215 { .mmi; st8 [r8]=$rlo,16 // Htable[$i].lo
216 st8 [r9]=$rhi,16 // Htable[$i].hi
218 { .mmi; stf8 [r10]=f`32+2*$i`,16 // Htable[`8+$i`].lo
219 stf8 [r11]=f`32+2*$i+1`,16 // Htable[`8+$i`].hi
221 { .mmi; st8 [r14]=$rlo,16 // Htable[$i].lo>>4
222 st8 [r15]=$rhi,16 }//;; // Htable[$i].hi>>
    [all...]
  /external/openssl/crypto/modes/
gcm128.c 121 static void gcm_init_8bit(u128 Htable[256], u64 H[2])
126 Htable[0].hi = 0;
127 Htable[0].lo = 0;
131 for (Htable[128]=V, i=64; i>0; i>>=1) {
133 Htable[i] = V;
137 u128 *Hi = Htable+i, H0 = *Hi;
139 Hi[j].hi = H0.hi^Htable[j].hi;
140 Hi[j].lo = H0.lo^Htable[j].lo;
145 static void gcm_gmult_8bit(u64 Xi[2], const u128 Htable[256])
218 Z.hi ^= Htable[n].hi
    [all...]
modes_lcl.h 103 /* Relative position of Xi, H and pre-computed Htable is used
106 u128 Htable[256];
108 u128 Htable[16];
109 void (*gmult)(u64 Xi[2],const u128 Htable[16]);
110 void (*ghash)(u64 Xi[2],const u128 Htable[16],const u8 *inp,size_t len);
  /external/iptables/extensions/
libxt_hashlimit.c 49 "[--hashlimit-htable-size <num>] number of hashtable buckets\n"
50 "[--hashlimit-htable-max <num>] number of hashtable entries\n"
51 "[--hashlimit-htable-gcinterval] interval between garbage collection runs\n"
52 "[--hashlimit-htable-expire] after which time are idle entries expired?\n",
89 " --hashlimit-htable-size <num> number of hashtable buckets\n"
90 " --hashlimit-htable-max <num> number of hashtable entries\n"
91 " --hashlimit-htable-gcinterval interval between garbage collection runs\n"
92 " --hashlimit-htable-expire after which time are idle entries expired?\n"
103 {.name = "hashlimit-htable-size", .id = O_HTABLE_SIZE,
106 {.name = "hashlimit-htable-max", .id = O_HTABLE_MAX
    [all...]
libxt_hashlimit.man 43 \fB\-\-hashlimit\-htable\-size\fP \fIbuckets\fP
46 \fB\-\-hashlimit\-htable\-max\fP \fIentries\fP
49 \fB\-\-hashlimit\-htable\-expire\fP \fImsec\fP
52 \fB\-\-hashlimit\-htable\-gcinterval\fP \fImsec\fP
  /external/chromium_org/third_party/icu/source/i18n/
currpinf.cpp 336 CurrencyPluralInfo::deleteHash(Hashtable* hTable)
338 if ( hTable == NULL ) {
343 while ( (element = hTable->nextElement(pos)) != NULL ) {
348 delete hTable;
349 hTable = NULL;
358 Hashtable* hTable;
359 if ( (hTable = new Hashtable(TRUE, status)) == NULL ) {
364 delete hTable;
367 hTable->setValueComparator(ValueComparator);
368 return hTable;
    [all...]
dtitvinf.cpp 584 DateIntervalInfo::deleteHash(Hashtable* hTable)
586 if ( hTable == NULL ) {
591 while ( (element = hTable->nextElement(pos)) != NULL ) {
631 Hashtable* hTable;
632 if ( (hTable = new Hashtable(FALSE, status)) == NULL ) {
637 delete hTable;
640 hTable->setValueComparator(dtitvinfHashTableValueComparator);
641 return hTable;
tmutfmt.cpp 787 TimeUnitFormat::deleteHash(Hashtable* htable) {
790 if ( htable ) {
791 while ( (element = htable->nextElement(pos)) != NULL ) {
800 delete htable;
    [all...]
  /external/icu/icu4c/source/i18n/
currpinf.cpp 336 CurrencyPluralInfo::deleteHash(Hashtable* hTable)
338 if ( hTable == NULL ) {
343 while ( (element = hTable->nextElement(pos)) != NULL ) {
348 delete hTable;
349 hTable = NULL;
358 Hashtable* hTable;
359 if ( (hTable = new Hashtable(TRUE, status)) == NULL ) {
364 delete hTable;
367 hTable->setValueComparator(ValueComparator);
368 return hTable;
    [all...]
dtitvinf.cpp 584 DateIntervalInfo::deleteHash(Hashtable* hTable)
586 if ( hTable == NULL ) {
591 while ( (element = hTable->nextElement(pos)) != NULL ) {
631 Hashtable* hTable;
632 if ( (hTable = new Hashtable(FALSE, status)) == NULL ) {
637 delete hTable;
640 hTable->setValueComparator(dtitvinfHashTableValueComparator);
641 return hTable;
tmutfmt.cpp 687 TimeUnitFormat::deleteHash(Hashtable* htable) {
690 if ( htable ) {
691 while ( (element = htable->nextElement(pos)) != NULL ) {
700 delete htable;
757 Hashtable* hTable;
758 if ( (hTable = new Hashtable(TRUE, status)) == NULL ) {
763 delete hTable;
766 hTable->setValueComparator(tmutfmtHashTableValueComparator);
767 return hTable;
  /system/core/toolbox/upstream-netbsd/usr.bin/du/
du.c 288 } *htable; local
312 if (!htable)
320 ohtable = htable;
321 htable = calloc(htmask+1, sizeof(*htable));
322 if (!htable)
344 while (htable[h].ino || htable[h].dev) {
345 if ((htable[h].ino == ino) && (htable[h].dev == dev)
    [all...]
  /external/giflib/
gif_hash.h 29 uint32_t HTable[HT_SIZE];
  /external/libsepol/include/sepol/policydb/
sidtab.h 31 sidtab_ptr_t *htable; member in struct:__anon29255
  /external/chromium_org/third_party/icu/source/i18n/unicode/
currpinf.h 202 * @param hTable hash table to be deleted
204 void deleteHash(Hashtable* hTable);
  /external/icu/icu4c/source/i18n/unicode/
currpinf.h 202 * @param hTable hash table to be deleted
204 void deleteHash(Hashtable* hTable);

Completed in 819 milliseconds

1 2