HomeSort by relevance Sort by last modified time
    Searched refs:hashHead (Results 1 - 4 of 4) sorted by null

  /hardware/intel/common/libwsbm/src/
wsbm_driver.h 107 struct _WsbmListHead hashHead;
wsbm_manager.c 152 struct _WsbmListHead *hashHead;
171 hashHead = list->hashTable + hash;
172 WSBMLISTADDTAIL(&node->hashHead, hashHead);
206 WSBMLISTDEL(&node->hashHead);
313 WSBMLISTDEL(&node->hashHead);
1065 struct _WsbmListHead *hashHead;
1072 hashHead = list->hashTable + hash;
1075 for (l = hashHead->next; l != hashHead; l = l->next)
    [all...]
  /prebuilts/go/darwin-x86/src/compress/flate/
deflate.go 93 // hashHead[hashValue] contains the largest inputIndex with the specified hash value
94 // If hashHead[hashValue] is within the current window, then
95 // hashPrev[hashHead[hashValue] & windowMask] contains the previous index
98 hashHead [hashSize]uint32
149 for i, v := range d.hashHead[:] {
151 d.hashHead[i] = uint32(int(v) - delta)
153 d.hashHead[i] = 0
217 hh := &d.hashHead[newH&hashMask]
426 hh := &d.hashHead[d.hash&hashMask]
473 hh := &d.hashHead[d.hash&hashMask
    [all...]
  /prebuilts/go/linux-x86/src/compress/flate/
deflate.go 93 // hashHead[hashValue] contains the largest inputIndex with the specified hash value
94 // If hashHead[hashValue] is within the current window, then
95 // hashPrev[hashHead[hashValue] & windowMask] contains the previous index
98 hashHead [hashSize]uint32
149 for i, v := range d.hashHead[:] {
151 d.hashHead[i] = uint32(int(v) - delta)
153 d.hashHead[i] = 0
217 hh := &d.hashHead[newH&hashMask]
426 hh := &d.hashHead[d.hash&hashMask]
473 hh := &d.hashHead[d.hash&hashMask
    [all...]

Completed in 165 milliseconds