Home
last modified time | relevance | path

Searched refs:tableEntry (Results 1 – 25 of 433) sorted by relevance

12345678910>>...18

/dports/www/domoticz/domoticz-2020.2/main/
H A DLuaTable.cpp32 _tEntry tableEntry; in InitTable() local
42 _tEntry tableEntry; in AddString() local
52 _tEntry tableEntry; in AddBool() local
62 _tEntry tableEntry; in AddNumber() local
72 _tEntry tableEntry; in AddInteger() local
82 _tEntry tableEntry; in AddInteger() local
93 _tEntry tableEntry; in AddString() local
104 _tEntry tableEntry; in AddNumber() local
115 _tEntry tableEntry; in AddBool() local
126 _tEntry tableEntry; in OpenSubTableEntry() local
[all …]
/dports/editors/fpc-ide/fpc-3.2.2/rtl/inc/
H A Dthreadvr.inc42 procedure init_unit_threadvars (tableEntry : pltvInitEntry);
44 while tableEntry^.varaddr <> nil do
46 CurrentTM.InitThreadvar (tableEntry^.varaddr^, tableEntry^.size);
47 inc (pchar (tableEntry), sizeof (tableEntry^));
71 procedure copy_unit_threadvars (tableEntry : pltvInitEntry);
76 while tableEntry^.varaddr <> nil do
78 newp:=CurrentTM.RelocateThreadVar(tableEntry^.varaddr^);
79 oldp:=pointer(pchar(tableEntry^.varaddr)+sizeof(pointer));
80 move(oldp^,newp^,tableEntry^.size);
81 inc (pchar (tableEntry), sizeof (tableEntry^));
/dports/lang/fpc-utils/fpc-3.2.2/rtl/inc/
H A Dthreadvr.inc42 procedure init_unit_threadvars (tableEntry : pltvInitEntry);
44 while tableEntry^.varaddr <> nil do
46 CurrentTM.InitThreadvar (tableEntry^.varaddr^, tableEntry^.size);
47 inc (pchar (tableEntry), sizeof (tableEntry^));
71 procedure copy_unit_threadvars (tableEntry : pltvInitEntry);
76 while tableEntry^.varaddr <> nil do
78 newp:=CurrentTM.RelocateThreadVar(tableEntry^.varaddr^);
79 oldp:=pointer(pchar(tableEntry^.varaddr)+sizeof(pointer));
80 move(oldp^,newp^,tableEntry^.size);
81 inc (pchar (tableEntry), sizeof (tableEntry^));
/dports/lang/fpc-source/fpc-3.2.2/rtl/inc/
H A Dthreadvr.inc42 procedure init_unit_threadvars (tableEntry : pltvInitEntry);
44 while tableEntry^.varaddr <> nil do
46 CurrentTM.InitThreadvar (tableEntry^.varaddr^, tableEntry^.size);
47 inc (pchar (tableEntry), sizeof (tableEntry^));
71 procedure copy_unit_threadvars (tableEntry : pltvInitEntry);
76 while tableEntry^.varaddr <> nil do
78 newp:=CurrentTM.RelocateThreadVar(tableEntry^.varaddr^);
79 oldp:=pointer(pchar(tableEntry^.varaddr)+sizeof(pointer));
80 move(oldp^,newp^,tableEntry^.size);
81 inc (pchar (tableEntry), sizeof (tableEntry^));
/dports/lang/fpc/fpc-3.2.2/rtl/inc/
H A Dthreadvr.inc42 procedure init_unit_threadvars (tableEntry : pltvInitEntry);
44 while tableEntry^.varaddr <> nil do
46 CurrentTM.InitThreadvar (tableEntry^.varaddr^, tableEntry^.size);
47 inc (pchar (tableEntry), sizeof (tableEntry^));
71 procedure copy_unit_threadvars (tableEntry : pltvInitEntry);
76 while tableEntry^.varaddr <> nil do
78 newp:=CurrentTM.RelocateThreadVar(tableEntry^.varaddr^);
79 oldp:=pointer(pchar(tableEntry^.varaddr)+sizeof(pointer));
80 move(oldp^,newp^,tableEntry^.size);
81 inc (pchar (tableEntry), sizeof (tableEntry^));
/dports/games/libretro-play/Play--3cd0a367b5e24c061a6310c68c9fa7f6b531ebd4/deps/Framework/src/mpeg2/
H A DVLCTable.cpp7 CVLCTable::CVLCTable(unsigned int maxBits, VLCTABLEENTRY* tableEntry, unsigned int entryCount, unsi… in CVLCTable() argument
9 , m_tableEntry(tableEntry) in CVLCTable()
61 const VLCTABLEENTRY* tableEntry(nullptr); in TryGetSymbol() local
62 auto opResult = TryPeekSymbol(stream, tableEntry); in TryGetSymbol()
65 stream->Advance(tableEntry->codeLength); in TryGetSymbol()
66 result = tableEntry->value; in TryGetSymbol()
73 const VLCTABLEENTRY* tableEntry = NULL; in GetSymbol() local
74 auto result = TryGetSymbol(stream, tableEntry); in GetSymbol()
79 return tableEntry->value; in GetSymbol()
/dports/security/clamav/clamav-0.104.2/libclamav/
H A Dtable.c49 tableEntry *tableItem; in tableDestroy()
56 tableEntry *tableNext = tableItem->next; in tableDestroy()
81 table->tableLast = table->tableHead = (tableEntry *)cli_malloc(sizeof(tableEntry)); in tableInsert()
87 tableEntry *tableItem; in tableInsert()
103 (tableEntry *)cli_malloc(sizeof(tableEntry)); in tableInsert()
127 const tableEntry *tableItem; in tableFind()
162 tableEntry *tableItem; in tableUpdate()
184 tableEntry *tableItem; in tableRemove()
202 tableEntry *tableItem; in tableIterate()
/dports/security/clamav-lts/clamav-0.103.5/libclamav/
H A Dtable.c49 tableEntry *tableItem; in tableDestroy()
56 tableEntry *tableNext = tableItem->next; in tableDestroy()
81 table->tableLast = table->tableHead = (tableEntry *)cli_malloc(sizeof(tableEntry)); in tableInsert()
87 tableEntry *tableItem; in tableInsert()
103 (tableEntry *)cli_malloc(sizeof(tableEntry)); in tableInsert()
127 const tableEntry *tableItem; in tableFind()
162 tableEntry *tableItem; in tableUpdate()
184 tableEntry *tableItem; in tableRemove()
202 tableEntry *tableItem; in tableIterate()
/dports/net/goreplay/goreplay-1.2.0/vendor/github.com/klauspost/compress/compress-1.10.10/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/net/rclone/rclone-1.57.0/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/sysutils/brename/brename-2.11.1/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go8 table [bTableSize]tableEntry
23 e.table[i] = tableEntry{}
70 var candidate tableEntry
80 e.table[nextHash] = tableEntry{offset: s + e.cur, val: cv}
95 e.table[nextHash] = tableEntry{offset: s + e.cur, val: cv}
154 e.table[nextHash] = tableEntry{offset: e.cur + i, val: uint32(x)}
158 e.table[nextHash] = tableEntry{offset: e.cur + i + 2, val: uint32(x)}
162 e.table[nextHash] = tableEntry{offset: e.cur + i + 4, val: uint32(x)}
175 e.table[prevHash] = tableEntry{offset: o, val: uint32(x)}
176 e.table[prevHash2] = tableEntry{offset: o + 1, val: uint32(x >> 8)}
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/grafana/loki/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/www/gitea/gitea-1.16.5/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/misc/concourse/concourse-6.7.2/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go8 table [bTableSize]tableEntry
23 e.table[i] = tableEntry{}
70 var candidate tableEntry
80 e.table[nextHash] = tableEntry{offset: s + e.cur, val: cv}
95 e.table[nextHash] = tableEntry{offset: s + e.cur, val: cv}
154 e.table[nextHash] = tableEntry{offset: e.cur + i, val: uint32(x)}
158 e.table[nextHash] = tableEntry{offset: e.cur + i + 2, val: uint32(x)}
162 e.table[nextHash] = tableEntry{offset: e.cur + i + 4, val: uint32(x)}
175 e.table[prevHash] = tableEntry{offset: o, val: uint32(x)}
176 e.table[prevHash2] = tableEntry{offset: o + 1, val: uint32(x >> 8)}
[all …]
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/www/minio-client/mc-RELEASE.2021-12-10T00-14-28Z/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/klauspost/compress/compress-1.11.6/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/net/traefik/traefik-2.6.1/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/ftp/sftpgo/sftpgo-2.2.0/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/irc/soju/soju-0.3.0/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/sysutils/rush/rush-0.4.2-9-ga800565/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/klauspost/compress/flate/
H A Dlevel2.go10 table [bTableSize]tableEntry
29 e.table[i] = tableEntry{}
76 var candidate tableEntry
86 e.table[nextHash] = tableEntry{offset: s + e.cur}
91 e.table[nextHash] = tableEntry{offset: nextS + e.cur}
101 e.table[nextHash] = tableEntry{offset: s + e.cur}
160 e.table[nextHash] = tableEntry{offset: e.cur + i}
164 e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
181 e.table[prevHash] = tableEntry{offset: o}
182 e.table[prevHash2] = tableEntry{offset: o + 1}
[all …]

12345678910>>...18