/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/world/ |
D | world | 235 codes = nameorgs.keys() 236 codes.sort() 237 for code in codes: 241 codes = countries.keys() 242 codes.sort() 243 for code in codes:
|
D | README | 1 world -- Print mappings between country names and DNS country codes. 38 Country codes are maintained by the RIPE Network Coordination Centre, 60 codes and numbers, which are also provided in the standard format
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
D | inftrees.c | 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument 35 unsigned codes; 109 for (sym = 0; sym < codes; sym++) 146 for (sym = 0; sym < codes; sym++)
|
D | inftrees.h | 61 unsigned codes, code FAR * FAR *table,
|
D | inflate.h | 118 code codes[ENOUGH]; /* space for code tables */ member
|
D | inflate.c | 122 state->lencode = state->distcode = state->next = state->codes; 923 state->next = state->codes; 997 state->next = state->codes; 1470 if (state->lencode >= state->codes && 1471 state->lencode <= state->codes + ENOUGH - 1) { 1472 copy->lencode = copy->codes + (state->lencode - state->codes); 1473 copy->distcode = copy->codes + (state->distcode - state->codes); 1475 copy->next = copy->codes + (state->next - state->codes);
|
D | algorithm.txt | 64 codes are much more common than longer codes, so pay attention to decoding the 65 short codes fast, and let the long codes take longer to decode. 79 codes are replicated many times in such a table. What inflate() does is 83 For inflate, which has 286 possible codes for the literal/length tree, the size
|
/device/linaro/bootloader/edk2/EmbeddedPkg/Library/ZLib/ |
D | inftrees.c | 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument 35 unsigned codes; 109 for (sym = 0; sym < codes; sym++) 146 for (sym = 0; sym < codes; sym++)
|
D | inftrees.h | 61 unsigned codes, code FAR * FAR *table,
|
D | inflate.h | 121 code codes[ENOUGH]; /* space for code tables */ member
|
D | inflate.c | 137 state->lencode = state->distcode = state->next = state->codes; 946 state->next = state->codes; 1020 state->next = state->codes; 1494 if (state->lencode >= state->codes && 1495 state->lencode <= state->codes + ENOUGH - 1) { 1496 copy->lencode = copy->codes + (state->lencode - state->codes); 1497 copy->distcode = copy->codes + (state->distcode - state->codes); 1499 copy->next = copy->codes + (state->next - state->codes); 1561 return (unsigned long)(state->next - state->codes);
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
D | inftrees.c | 32 int inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument 35 unsigned codes; 109 for (sym = 0; sym < codes; sym++) 146 for (sym = 0; sym < codes; sym++)
|
D | inftrees.h | 54 unsigned codes, code FAR * FAR *table,
|
D | inflate.c | 123 state->lencode = state->distcode = state->next = state->codes; 863 state->next = state->codes; 929 state->next = state->codes; 1355 if (state->lencode >= state->codes && 1356 state->lencode <= state->codes + ENOUGH - 1) { 1357 copy->lencode = copy->codes + (state->lencode - state->codes); 1358 copy->distcode = copy->codes + (state->distcode - state->codes); 1360 copy->next = copy->codes + (state->next - state->codes);
|
D | inflate.h | 114 code codes[ENOUGH]; /* space for code tables */ member
|
D | algorithm.txt | 64 codes are much more common than longer codes, so pay attention to decoding the 65 short codes fast, and let the long codes take longer to decode. 79 codes are replicated many times in such a table. What inflate() does is 83 For inflate, which has 286 possible codes for the literal/length tree, the size
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
D | _struct.c | 1223 formatcode *codes; in prepare_s() local 1287 codes = PyMem_MALLOC((len + 1) * sizeof(formatcode)); in prepare_s() 1288 if (codes == NULL) { in prepare_s() 1295 self->s_codes = codes; in prepare_s() 1316 codes->offset = size; in prepare_s() 1317 codes->size = num; in prepare_s() 1318 codes->fmtdef = e; in prepare_s() 1319 codes++; in prepare_s() 1325 codes->offset = size; in prepare_s() 1326 codes->size = e->size; in prepare_s() [all …]
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/ |
D | _struct.c | 1223 formatcode *codes; in prepare_s() local 1287 codes = PyMem_MALLOC((len + 1) * sizeof(formatcode)); in prepare_s() 1288 if (codes == NULL) { in prepare_s() 1295 self->s_codes = codes; in prepare_s() 1316 codes->offset = size; in prepare_s() 1317 codes->size = num; in prepare_s() 1318 codes->fmtdef = e; in prepare_s() 1319 codes++; in prepare_s() 1325 codes->offset = size; in prepare_s() 1326 codes->size = e->size; in prepare_s() [all …]
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
D | difflib.py | 611 codes = self.get_opcodes() 612 if not codes: 613 codes = [("equal", 0, 1, 0, 1)] 615 if codes[0][0] == 'equal': 616 tag, i1, i2, j1, j2 = codes[0] 617 codes[0] = tag, max(i1, i2-n), i2, max(j1, j2-n), j2 618 if codes[-1][0] == 'equal': 619 tag, i1, i2, j1, j2 = codes[-1] 620 codes[-1] = tag, i1, min(i2, i1+n), j1, min(j2, j1+n) 624 for tag, i1, i2, j1, j2 in codes:
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/unicode/ |
D | gencodec.py | 43 def parsecodes(codes, len=len, range=range): argument 54 if not codes: 56 l = codes.split('+')
|
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/enc/ |
D | unicode.c | 11179 OnigCodePoint code, codes[3]; local 11328 codes[0] = code; 11332 codes[1] = to->code[0]; 11335 codes[1] = code; 11339 if (onig_st_lookup(Unfold2Table, (st_data_t )(UINTN)codes, (void* )&z2) != 0) { 11353 codes[2] = to->code[0]; 11356 codes[2] = code; 11360 if (onig_st_lookup(Unfold3Table, (st_data_t )(UINTN)codes,
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/cjkcodecs/ |
D | README | 28 big5 codes already, a roundtrip compatibility is not guaranteed for 54 The euc-jisx0213 codec is enabled to decode JIS X 0212 codes on
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/cjkcodecs/ |
D | README | 28 big5 codes already, a roundtrip compatibility is not guaranteed for 54 The euc-jisx0213 codec is enabled to decode JIS X 0212 codes on
|
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Compatibility/Library/UefiLanguageLib/ |
D | UefiLanguageLib.inf | 5 # between ISO 639-2 and RFC 4646 language codes.
|
/device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Universal/DataHubDxe/ |
D | DataHubDxe.uni | 6 // Consumers may then extract the data in temporal "log" order.As an example, progress codes might 38 …hen extract the data in a temporal \"log\" order. As an example, progress codes might be recorded …
|