bin/ksh/c_ksh.c

757

for (tvp = vp; tvp; tvp = tvp->u.array)

bin/ksh/c_ksh.c

776

for (; vp; vp = vp->u.array) {

bin/ksh/edit.c

692

for (vp = v; vp; vp = vp->u.array) {

bin/ksh/eval.c

767

for (; vp; vp = vp->u.array)

bin/ksh/eval.c

842

for (; vp; vp = vp->u.array) {

bin/ksh/misc.c

328

char *array = NULL;

bin/ksh/misc.c

371

array = go.optarg;

bin/ksh/misc.c

437

if (arrayset && (!*array || *skip_varname(array, false))) {

bin/ksh/misc.c

438

bi_errorf("%s: is not an identifier", array);

bin/ksh/misc.c

448

set_array(array, arrayset, argv + go.optind);

bin/ksh/table.c

143

p->u.array = NULL;

bin/ksh/table.h

32

struct tbl *array; /* array values */

bin/ksh/var.c

1144

curr = vp->u.array;

bin/ksh/var.c

1147

curr = curr->u.array;

bin/ksh/var.c

1164

prev->u.array = new;

bin/ksh/var.c

1165

new->u.array = curr;

bin/ksh/var.c

176

bool array;

bin/ksh/var.c

180

n = array_index_calc(n, &array, &val);

bin/ksh/var.c

184

if (array)

bin/ksh/var.c

231

if (array)

bin/ksh/var.c

240

if (array)

bin/ksh/var.c

257

bool array;

bin/ksh/var.c

261

n = array_index_calc(n, &array, &val);

bin/ksh/var.c

286

if (array)

bin/ksh/var.c

667

for (t = vpbase; t; t = t->u.array) {

bin/ksh/var.c

759

for (a = vp->u.array; a; ) {

bin/ksh/var.c

761

a = a->u.array;

bin/ksh/var.c

766

vp->u.array = NULL;

bin/ls/print.c

163

static FTSENT **array;

bin/ls/print.c

178

if ((a = reallocarray(array, dp->entries, sizeof(FTSENT *))) ==

bin/ls/print.c

180

free(array);

bin/ls/print.c

181

array = NULL;

bin/ls/print.c

189

array = a;

bin/ls/print.c

193

array[num++] = p;

bin/ls/print.c

204

chcnt = printaname(array[base], dp->s_inode, dp->s_block);

games/battlestar/extern.h

42

#define TestBit(array, index) (array[index/BITS] & (1U << (index % BITS)))

games/battlestar/extern.h

43

#define SetBit(array, index) (array[index/BITS] |= (1U << (index % BITS)))

games/battlestar/extern.h

44

#define ClearBit(array, index) (array[index/BITS] &= ~(1U << (index % BITS)))

games/battlestar/misc.c

37

card(const char *array, int size)

games/battlestar/misc.c

39

const char *end = array + size;

games/battlestar/misc.c

42

while (array < end)

games/battlestar/misc.c

43

if (*array++)

games/battlestar/misc.c

49

ucard(const unsigned int *array)

games/battlestar/misc.c

54

if (TestBit(array, n))

lib/libcbor/src/cbor/arrays.c

44

bool cbor_array_push(cbor_item_t *array, cbor_item_t *pushee) {

lib/libcbor/src/cbor/arrays.c

45

CBOR_ASSERT(cbor_isa_array(array));

lib/libcbor/src/cbor/arrays.c

47

(struct _cbor_array_metadata *)&array->metadata;

lib/libcbor/src/cbor/arrays.c

48

cbor_item_t **data = (cbor_item_t **)array->data;

lib/libcbor/src/cbor/arrays.c

49

if (cbor_array_is_definite(array)) {

lib/libcbor/src/cbor/arrays.c

68

array->data, sizeof(cbor_item_t *), new_allocation);

lib/libcbor/src/cbor/arrays.c

73

array->data = new_data;

lib/libcbor/src/cbor/arrays.c

76

((cbor_item_t **)array->data)[metadata->end_ptr++] = pushee;

lib/libcbor/src/cbor/arrays.h

122

CBOR_EXPORT bool cbor_array_push(cbor_item_t* array, cbor_item_t* pushee);

lib/libfido2/src/blob.c

83

fido_free_blob_array(fido_blob_array_t *array)

lib/libfido2/src/blob.c

85

if (array->ptr == NULL)

lib/libfido2/src/blob.c

88

for (size_t i = 0; i < array->len; i++) {

lib/libfido2/src/blob.c

89

fido_blob_t *b = &array->ptr[i];

lib/libfido2/src/blob.c

94

free(array->ptr);

lib/libfido2/src/blob.c

95

array->ptr = NULL;

lib/libfido2/src/blob.c

96

array->len = 0;

lib/libfido2/src/cbor.c

1636

cbor_array_append(cbor_item_t **array, cbor_item_t *item)

lib/libfido2/src/cbor.c

1641

if ((v = cbor_array_handle(*array)) == NULL ||

lib/libfido2/src/cbor.c

1642

(n = cbor_array_size(*array)) == SIZE_MAX ||

lib/libfido2/src/cbor.c

1655

cbor_decref(array);

lib/libfido2/src/cbor.c

1656

*array = ret;

lib/libfido2/src/cbor.c

1662

cbor_array_drop(cbor_item_t **array, size_t idx)

lib/libfido2/src/cbor.c

1667

if ((v = cbor_array_handle(*array)) == NULL ||

lib/libfido2/src/cbor.c

1668

(n = cbor_array_size(*array)) == 0 || idx >= n ||

lib/libfido2/src/cbor.c

1677

cbor_decref(array);

lib/libfido2/src/cbor.c

1678

*array = ret;

lib/libfido2/src/cbor.c

540

cbor_item_t *array = NULL;

lib/libfido2/src/cbor.c

543

if ((array = cbor_new_definite_array(list->len)) == NULL)

lib/libfido2/src/cbor.c

548

cbor_array_push(array, key) == false)

lib/libfido2/src/cbor.c

553

return (array);

lib/libfido2/src/cbor.c

557

if (array != NULL)

lib/libfido2/src/cbor.c

558

cbor_decref(&array);

lib/libfido2/src/cbor.c

566

cbor_item_t *array = NULL;

lib/libfido2/src/cbor.c

569

if ((array = cbor_new_definite_array(a->len)) == NULL)

lib/libfido2/src/cbor.c

574

cbor_array_push(array, entry) == false)

lib/libfido2/src/cbor.c

579

return (array);

lib/libfido2/src/cbor.c

583

if (array != NULL)

lib/libfido2/src/cbor.c

584

cbor_decref(&array);

lib/libfido2/src/largeblob.c

401

largeblob_array_check(const fido_blob_t *array)

lib/libfido2/src/largeblob.c

406

fido_log_xxd(array->ptr, array->len, __func__);

lib/libfido2/src/largeblob.c

407

if (array->len < sizeof(expected_hash)) {

lib/libfido2/src/largeblob.c

408

fido_log_debug("%s: len %zu", __func__, array->len);

lib/libfido2/src/largeblob.c

411

body_len = array->len - sizeof(expected_hash);

lib/libfido2/src/largeblob.c

412

if (largeblob_array_digest(expected_hash, array->ptr, body_len) < 0) {

lib/libfido2/src/largeblob.c

417

return timingsafe_bcmp(expected_hash, array->ptr + body_len,

lib/libfido2/src/largeblob.c

424

fido_blob_t *array, *chunk = NULL;

lib/libfido2/src/largeblob.c

431

if ((array = fido_blob_new()) == NULL)

lib/libfido2/src/largeblob.c

435

if ((r = largeblob_get_tx(dev, array->len, n, ms)) != FIDO_OK ||

lib/libfido2/src/largeblob.c

438

__func__, array->len, n);

lib/libfido2/src/largeblob.c

441

if (fido_blob_append(array, chunk->ptr, chunk->len) < 0) {

lib/libfido2/src/largeblob.c

448

if (largeblob_array_check(array) != 0)

lib/libfido2/src/largeblob.c

451

*item = largeblob_array_load(array->ptr, array->len);

lib/libfido2/src/largeblob.c

457

fido_blob_free(&array);

lib/libfido2/src/largeblob.c

640

cbor_item_t *array = NULL;

lib/libfido2/src/largeblob.c

644

if ((r = largeblob_get_array(dev, &array, ms)) != FIDO_OK) {

lib/libfido2/src/largeblob.c

649

switch (r = largeblob_array_lookup(NULL, &idx, array, key)) {

lib/libfido2/src/largeblob.c

651

if (!cbor_array_replace(array, idx, item)) {

lib/libfido2/src/largeblob.c

657

if (cbor_array_append(&array, item) < 0) {

lib/libfido2/src/largeblob.c

667

if ((r = largeblob_set_array(dev, array, pin, ms)) != FIDO_OK) {

lib/libfido2/src/largeblob.c

674

if (array != NULL)

lib/libfido2/src/largeblob.c

675

cbor_decref(&array);

lib/libfido2/src/largeblob.c

684

cbor_item_t *array = NULL;

lib/libfido2/src/largeblob.c

688

if ((r = largeblob_get_array(dev, &array, ms)) != FIDO_OK) {

lib/libfido2/src/largeblob.c

692

if ((r = largeblob_array_lookup(NULL, &idx, array, key)) != FIDO_OK) {

lib/libfido2/src/largeblob.c

696

if (cbor_array_drop(&array, idx) < 0) {

lib/libfido2/src/largeblob.c

701

if ((r = largeblob_set_array(dev, array, pin, ms)) != FIDO_OK) {

lib/libfido2/src/largeblob.c

708

if (array != NULL)

lib/libfido2/src/largeblob.c

709

cbor_decref(&array);

libexec/tradcpp/array.c

105

array_remove(struct array *a, unsigned index_)

libexec/tradcpp/array.c

36

struct array *

libexec/tradcpp/array.c

39

struct array *a;

libexec/tradcpp/array.c

47

array_destroy(struct array *a)

libexec/tradcpp/array.c

54

array_init(struct array *a)

libexec/tradcpp/array.c

61

array_cleanup(struct array *a)

libexec/tradcpp/array.c

71

array_setsize(struct array *a, unsigned num)

libexec/tradcpp/array.c

90

array_insert(struct array *a, unsigned index_)

libexec/tradcpp/array.h

164

struct array arr; \

libexec/tradcpp/array.h

252

#define DECLARRAY(T, INLINE) DECLARRAY_BYTYPE(T##array, struct T, INLINE)

libexec/tradcpp/array.h

253

#define DEFARRAY(T, INLINE) DEFARRAY_BYTYPE(T##array, struct T, INLINE)

libexec/tradcpp/array.h

256

INLINE void T##array_destroyall(struct T##array *arr); \

libexec/tradcpp/array.h

259

T##array_destroyall(struct T##array *arr) \

libexec/tradcpp/array.h

57

struct array *array_create(void);

libexec/tradcpp/array.h

58

void array_destroy(struct array *);

libexec/tradcpp/array.h

59

void array_init(struct array *);

libexec/tradcpp/array.h

60

void array_cleanup(struct array *);

libexec/tradcpp/array.h

61

ARRAYINLINE unsigned array_num(const struct array *);

libexec/tradcpp/array.h

62

ARRAYINLINE void *array_get(const struct array *, unsigned index_);

libexec/tradcpp/array.h

63

ARRAYINLINE void array_set(const struct array *, unsigned index_, void *val);

libexec/tradcpp/array.h

64

void array_setsize(struct array *, unsigned num);

libexec/tradcpp/array.h

65

ARRAYINLINE void array_add(struct array *, void *val, unsigned *index_ret);

libexec/tradcpp/array.h

66

void array_insert(struct array *a, unsigned index_);

libexec/tradcpp/array.h

67

void array_remove(struct array *a, unsigned index_);

libexec/tradcpp/array.h

73

array_num(const struct array *a)

libexec/tradcpp/array.h

79

array_get(const struct array *a, unsigned index_)

libexec/tradcpp/array.h

86

array_set(const struct array *a, unsigned index_, void *val)

libexec/tradcpp/array.h

93

array_add(struct array *a, void *val, unsigned *index_ret)

libexec/tradcpp/main.c

264

static struct array commandline_files;

libexec/tradcpp/main.c

97

static struct array commandline_macros;

regress/lib/libcrypto/hkdf/hkdf_test.c

24

#define OPENSSL_ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))

regress/lib/libpthread/dlopen/dlopen.c

514

unsigned short *array;

regress/lib/libpthread/dlopen/dlopen.c

519

semarg.array = &val;

regress/sys/kern/sysvsem/semtest.c

72

u_short *array; /* array for GETALL & SETALL */

regress/sys/kern/unalign/unalign.c

17

uint32_t array[5];

regress/sys/kern/unalign/unalign.c

48

uint32_t *addr = array;

sbin/iked/sntrup761.c

101

static void crypto_sort_uint32(void *array,long long n)

sbin/iked/sntrup761.c

103

crypto_uint32 *x = array;

sbin/iked/sntrup761.c

106

crypto_sort_int32(array,n);

sbin/iked/sntrup761.c

38

static void crypto_sort_int32(void *array,long long n)

sbin/iked/sntrup761.c

41

int32 *x = array;

sbin/pfctl/pfctl_parser.c

2026

trans.array = ((struct pfioc_trans_e *)buf->pfrb_caddr) + from;

sbin/unwind/libunbound/services/authzone.c

7440

static size_t authdata_rrsets_to_list(struct auth_rrset** array,

sbin/unwind/libunbound/services/authzone.c

7448

array[num] = rrset;

sbin/unwind/libunbound/services/authzone.c

7474

static void addrrsigtype_if_needed(struct auth_rrset** array,

sbin/unwind/libunbound/services/authzone.c

7481

array[*rrnum] = NULL; /* nothing there, but need entry in list */

sbin/unwind/libunbound/util/config_file.c

1711

config_del_strarray(char** array, int num)

sbin/unwind/libunbound/util/config_file.c

1714

if(!array)

sbin/unwind/libunbound/util/config_file.c

1717

free(array[i]);

sbin/unwind/libunbound/util/config_file.c

1719

free(array);

sbin/unwind/libunbound/util/config_file.c

90

static void init_outgoing_availports(int* array, int num);

sbin/unwind/libunbound/util/config_file.h

1181

void config_del_strarray(char** array, int num);

sbin/unwind/libunbound/util/storage/lruhash.c

134

lock_quick_lock(&table->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

135

p = table->array[i].overflow_list;

sbin/unwind/libunbound/util/storage/lruhash.c

149

lock_quick_unlock(&table->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

162

bin_delete(table, &table->array[i]);

sbin/unwind/libunbound/util/storage/lruhash.c

163

free(table->array);

sbin/unwind/libunbound/util/storage/lruhash.c

203

bin = &table->array[d->hash & table->size_mask];

sbin/unwind/libunbound/util/storage/lruhash.c

256

lock_unprotect(&table->lock, table->array);

sbin/unwind/libunbound/util/storage/lruhash.c

258

lock_quick_destroy(&table->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

260

free(table->array);

sbin/unwind/libunbound/util/storage/lruhash.c

264

table->array = newa;

sbin/unwind/libunbound/util/storage/lruhash.c

265

lock_protect(&table->lock, table->array,

sbin/unwind/libunbound/util/storage/lruhash.c

322

bin = &table->array[hash & table->size_mask];

sbin/unwind/libunbound/util/storage/lruhash.c

371

bin = &table->array[hash & table->size_mask];

sbin/unwind/libunbound/util/storage/lruhash.c

398

bin = &table->array[hash & table->size_mask];

sbin/unwind/libunbound/util/storage/lruhash.c

457

bin_clear(table, &table->array[i]);

sbin/unwind/libunbound/util/storage/lruhash.c

48

bin_init(struct lruhash_bin* array, size_t size)

sbin/unwind/libunbound/util/storage/lruhash.c

482

lock_quick_lock(&table->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

483

en = table->array[i].overflow_list;

sbin/unwind/libunbound/util/storage/lruhash.c

488

lock_quick_unlock(&table->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

511

lock_get_mem(&table->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

516

lock_get_mem(&table->array[0].lock));

sbin/unwind/libunbound/util/storage/lruhash.c

52

(void)array;

sbin/unwind/libunbound/util/storage/lruhash.c

55

lock_quick_init(&array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

56

lock_protect(&array[i].lock, &array[i],

sbin/unwind/libunbound/util/storage/lruhash.c

604

lock_quick_lock(&h->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

605

for(e = h->array[i].overflow_list; e; e = e->overflow_next) {

sbin/unwind/libunbound/util/storage/lruhash.c

614

lock_quick_unlock(&h->array[i].lock);

sbin/unwind/libunbound/util/storage/lruhash.c

665

bin = &table->array[hash & table->size_mask];

sbin/unwind/libunbound/util/storage/lruhash.c

85

table->array = calloc(table->size, sizeof(struct lruhash_bin));

sbin/unwind/libunbound/util/storage/lruhash.c

86

if(!table->array) {

sbin/unwind/libunbound/util/storage/lruhash.c

91

bin_init(table->array, table->size);

sbin/unwind/libunbound/util/storage/lruhash.c

93

lock_protect(&table->lock, table->array,

sbin/unwind/libunbound/util/storage/lruhash.h

168

struct lruhash_bin* array;

sbin/unwind/libunbound/util/storage/lruhash.h

372

void bin_init(struct lruhash_bin* array, size_t size);

sbin/unwind/libunbound/util/storage/slabhash.c

106

lruhash_clear(sl->array[i]);

sbin/unwind/libunbound/util/storage/slabhash.c

119

lruhash_insert(sl->array[slab_idx(sl, hash)], hash, entry, data, arg);

sbin/unwind/libunbound/util/storage/slabhash.c

125

return lruhash_lookup(sl->array[slab_idx(sl, hash)], hash, key, wr);

sbin/unwind/libunbound/util/storage/slabhash.c

130

lruhash_remove(sl->array[slab_idx(sl, hash)], hash, key);

sbin/unwind/libunbound/util/storage/slabhash.c

141

lruhash_status(sl->array[i], num, extended);

sbin/unwind/libunbound/util/storage/slabhash.c

149

lock_quick_lock(&sl->array[i]->lock);

sbin/unwind/libunbound/util/storage/slabhash.c

150

total += sl->array[i]->space_max;

sbin/unwind/libunbound/util/storage/slabhash.c

151

lock_quick_unlock(&sl->array[i]->lock);

sbin/unwind/libunbound/util/storage/slabhash.c

172

lruhash_update_space_used(sl->array[slab_idx(sl, hash)], cb_arg,

sbin/unwind/libunbound/util/storage/slabhash.c

181

total += lruhash_get_mem(sl->array[i]);

sbin/unwind/libunbound/util/storage/slabhash.c

188

return sl->array[slab_idx(sl, hash)];

sbin/unwind/libunbound/util/storage/slabhash.c

229

lruhash_setmarkdel(sl->array[i], md);

sbin/unwind/libunbound/util/storage/slabhash.c

238

lruhash_traverse(sh->array[i], wr, func, arg);

sbin/unwind/libunbound/util/storage/slabhash.c

246

lock_quick_lock(&sh->array[slab]->lock);

sbin/unwind/libunbound/util/storage/slabhash.c

247

cnt += sh->array[slab]->num;

sbin/unwind/libunbound/util/storage/slabhash.c

248

lock_quick_unlock(&sh->array[slab]->lock);

sbin/unwind/libunbound/util/storage/slabhash.c

258

lock_quick_lock(&sh->array[slab]->lock);

sbin/unwind/libunbound/util/storage/slabhash.c

259

cnt += sh->array[slab]->num;

sbin/unwind/libunbound/util/storage/slabhash.c

260

if (max_collisions < sh->array[slab]->max_collisions) {

sbin/unwind/libunbound/util/storage/slabhash.c

261

max_collisions = sh->array[slab]->max_collisions;

sbin/unwind/libunbound/util/storage/slabhash.c

263

lock_quick_unlock(&sh->array[slab]->lock);

sbin/unwind/libunbound/util/storage/slabhash.c

276

lruhash_update_space_max(sl->array[i], NULL, space_max);

sbin/unwind/libunbound/util/storage/slabhash.c

59

sl->array = (struct lruhash**)calloc(sl->size, sizeof(struct lruhash*));

sbin/unwind/libunbound/util/storage/slabhash.c

60

if(!sl->array) {

sbin/unwind/libunbound/util/storage/slabhash.c

77

sl->array[i] = lruhash_create(start_size, maxmem / sl->size,

sbin/unwind/libunbound/util/storage/slabhash.c

79

if(!sl->array[i]) {

sbin/unwind/libunbound/util/storage/slabhash.c

91

if(sl->array) {

sbin/unwind/libunbound/util/storage/slabhash.c

94

lruhash_delete(sl->array[i]);

sbin/unwind/libunbound/util/storage/slabhash.c

95

free(sl->array);

sbin/unwind/libunbound/util/storage/slabhash.h

65

struct lruhash** array;

sbin/unwind/libunbound/util/timehist.c

212

timehist_export(struct timehist* hist, long long* array, size_t sz)

sbin/unwind/libunbound/util/timehist.c

219

array[i] = (long long)hist->buckets[i].count;

sbin/unwind/libunbound/util/timehist.c

223

timehist_import(struct timehist* hist, long long* array, size_t sz)

sbin/unwind/libunbound/util/timehist.c

230

hist->buckets[i].count = (size_t)array[i];

sbin/unwind/libunbound/util/timehist.h

124

void timehist_export(struct timehist* hist, long long* array, size_t sz);

sbin/unwind/libunbound/util/timehist.h

132

void timehist_import(struct timehist* hist, long long* array, size_t sz);

sys/dev/ic/aic79xx.h

100

#define NUM_ELEMENTS(array) (sizeof(array) / sizeof(*array))

sys/dev/ic/aic7xxxvar.h

75

#define NUM_ELEMENTS(array) (sizeof(array) / sizeof(*array))

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

114

entry = &array[--first_userptr];

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

116

entry = &array[last_entry++];

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

119

entry = &array[last_entry++];

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

138

sort(array, last_entry, sizeof(struct amdgpu_bo_list_entry),

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

149

amdgpu_bo_unref(&array[i].bo);

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

151

amdgpu_bo_unref(&array[i].bo);

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

76

struct amdgpu_bo_list_entry *array;

sys/dev/pci/drm/amd/amdgpu/amdgpu_bo_list.c

89

array = list->entries;

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1685

struct dma_fence **array;

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1690

array = kcalloc(fence_count, sizeof(struct dma_fence *), GFP_KERNEL);

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1692

if (array == NULL)

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1703

array[i] = fence;

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1711

r = dma_fence_wait_any_timeout(array, fence_count, true, timeout,

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1721

if (first < fence_count && array[first])

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1722

r = array[first]->error;

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1728

dma_fence_put(array[i]);

sys/dev/pci/drm/amd/amdgpu/amdgpu_cs.c

1729

kfree(array);

sys/dev/pci/drm/amd/amdgpu/amdgpu_ids.c

243

struct dma_fence_array *array;

sys/dev/pci/drm/amd/amdgpu/amdgpu_ids.c

250

array = dma_fence_array_create(i, fences, fence_context,

sys/dev/pci/drm/amd/amdgpu/amdgpu_ids.c

252

if (!array) {

sys/dev/pci/drm/amd/amdgpu/amdgpu_ids.c

259

*fence = dma_fence_get(&array->base);

sys/dev/pci/drm/amd/amdgpu/amdgpu_ids.c

261

ring->vmid_wait = &array->base;

sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_top/dml2_top_soc15.c

435

static unsigned int count_elements_in_span(int *array, unsigned int array_size, unsigned int span)

sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_top/dml2_top_soc15.c

454

if (array[i] - span_start_value <= span) {

sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_top/dml2_top_soc15.c

465

span_start_value = array[span_start_index - 1] + 1;

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

382

VCEClockInfoArray *array = (VCEClockInfoArray *)

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

389

1 + array->ucNumEntries * sizeof(VCEClockInfo));

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

394

1 + (array->ucNumEntries * sizeof (VCEClockInfo)) +

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

411

((u8 *)&array->entries[0] +

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

427

((u8 *)&array->entries[0] +

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

443

UVDClockInfoArray *array = (UVDClockInfoArray *)

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

450

1 + (array->ucNumEntries * sizeof (UVDClockInfo)));

sys/dev/pci/drm/amd/pm/legacy-dpm/legacy_dpm.c

463

((u8 *)&array->entries[0] +

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1207

const UVDClockInfoArray *array)

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1221

&array->entries[table->entries[i].ucUVDClockInfoIndex];

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1237

const VCEClockInfoArray *array)

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1249

const VCEClockInfo *entry = &array->entries[table->entries[i].ucVCEClockInfoIndex];

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1341

const VCEClockInfoArray *array = (const VCEClockInfoArray *)

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1349

table, array);

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1356

const UVDClockInfoArray *array = (const UVDClockInfoArray *)

sys/dev/pci/drm/amd/pm/powerplay/hwmgr/processpptables.c

1363

&hwmgr->dyn_state.uvd_clock_voltage_dependency_table, ptable, array);

sys/dev/pci/drm/amd/pm/powerplay/smumgr/ci_smumgr.c

2769

uint32_t array = smu_data->dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/ci_smumgr.c

2792

clk_activity_offset = array + (sizeof(SMU7_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/ci_smumgr.c

2804

up_hyst_offset = array + (sizeof(SMU7_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/ci_smumgr.c

2806

down_hyst_offset = array + (sizeof(SMU7_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/ci_smumgr.c

478

uint32_t array = smu_data->dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/ci_smumgr.c

505

result = ci_copy_bytes_to_smc(hwmgr, array,

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

1010

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

1086

result = smu7_copy_bytes_to_smc(hwmgr, array, (uint8_t *)levels,

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

1226

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

1265

result = smu7_copy_bytes_to_smc(hwmgr, array, (uint8_t *)levels,

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

2556

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

2579

clk_activity_offset = array + (sizeof(SMU73_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

2591

up_hyst_offset = array + (sizeof(SMU73_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/fiji_smumgr.c

2593

down_hyst_offset = array + (sizeof(SMU73_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

1046

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

1146

result = smu7_copy_bytes_to_smc(hwmgr, array, (uint8_t *)levels,

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

1215

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

1246

result = smu7_copy_bytes_to_smc(hwmgr, array, (uint8_t *)levels,

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

2594

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

2617

clk_activity_offset = array + (sizeof(SMU74_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

2629

up_hyst_offset = array + (sizeof(SMU74_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/polaris10_smumgr.c

2631

down_hyst_offset = array + (sizeof(SMU74_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/tonga_smumgr.c

3155

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/tonga_smumgr.c

3178

clk_activity_offset = array + (sizeof(SMU72_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/tonga_smumgr.c

3190

up_hyst_offset = array + (sizeof(SMU72_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/tonga_smumgr.c

3192

down_hyst_offset = array + (sizeof(SMU72_Discrete_GraphicsLevel) * i)

sys/dev/pci/drm/amd/pm/powerplay/smumgr/vegam_smumgr.c

1041

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/vegam_smumgr.c

1079

result = smu7_copy_bytes_to_smc(hwmgr, array, (uint8_t *)levels,

sys/dev/pci/drm/amd/pm/powerplay/smumgr/vegam_smumgr.c

874

uint32_t array = smu_data->smu7_data.dpm_table_start +

sys/dev/pci/drm/amd/pm/powerplay/smumgr/vegam_smumgr.c

957

result = smu7_copy_bytes_to_smc(hwmgr, array, (uint8_t *)levels,

sys/dev/pci/drm/dma-resv.c

642

struct dma_fence_array *array;

sys/dev/pci/drm/dma-resv.c

662

array = dma_fence_array_create(count, fences,

sys/dev/pci/drm/dma-resv.c

665

if (!array) {

sys/dev/pci/drm/dma-resv.c

672

*fence = &array->base;

sys/dev/pci/drm/drm_linux.c

2255

struct dma_fence_array *dfa = array_cb->array;

sys/dev/pci/drm/drm_linux.c

2271

cb[i].array = dfa;

sys/dev/pci/drm/drm_syncobj.c

973

struct dma_fence_array *array;

sys/dev/pci/drm/drm_syncobj.c

991

array = dma_fence_array_create(count, fences,

sys/dev/pci/drm/drm_syncobj.c

994

if (!array)

sys/dev/pci/drm/drm_syncobj.c

998

*f = &array->base;

sys/dev/pci/drm/i915/display/intel_dp.c

1536

static void seq_buf_print_array(struct seq_buf *s, const int *array, int nelem)

sys/dev/pci/drm/i915/display/intel_dp.c

1541

seq_buf_printf(s, "%s%d", i ? ", " : "", array[i]);

sys/dev/pci/drm/i915/gem/i915_gem_busy.c

61

struct dma_fence_array *array = to_dma_fence_array(fence);

sys/dev/pci/drm/i915/gem/i915_gem_busy.c

62

struct dma_fence **child = array->fences;

sys/dev/pci/drm/i915/gem/i915_gem_busy.c

63

unsigned int nchild = array->num_fences;

sys/dev/pci/drm/i915/gem/i915_gem_wait.c

119

struct dma_fence_array *array = to_dma_fence_array(fence);

sys/dev/pci/drm/i915/gem/i915_gem_wait.c

122

for (i = 0; i < array->num_fences; i++)

sys/dev/pci/drm/i915/gem/i915_gem_wait.c

123

fence_set_priority(array->fences[i], attr);

sys/dev/pci/drm/i915/gvt/handlers.c

770

i915_reg_t *array = force_nonpriv_white_list;

sys/dev/pci/drm/i915/gvt/handlers.c

775

if (reg > array[mid].reg)

sys/dev/pci/drm/i915/gvt/handlers.c

777

else if (reg < array[mid].reg)

sys/dev/pci/drm/i915/i915_request.c

1495

struct dma_fence_array *array = to_dma_fence_array(fence);

sys/dev/pci/drm/i915/i915_request.c

1499

child = array->fences;

sys/dev/pci/drm/i915/i915_request.c

1500

nchild = array->num_fences;

sys/dev/pci/drm/i915/i915_request.c

1599

struct dma_fence_array *array = to_dma_fence_array(fence);

sys/dev/pci/drm/i915/i915_request.c

1601

child = array->fences;

sys/dev/pci/drm/i915/i915_request.c

1602

nchild = array->num_fences;

sys/dev/pci/drm/include/linux/dma-fence-array.h

11

struct dma_fence_array *array;

sys/dev/pci/drm/include/linux/string.h

137

match_string(const char * const *array, size_t n, const char *str)

sys/dev/pci/drm/include/linux/string.h

142

if (array[i] == NULL)

sys/dev/pci/drm/include/linux/string.h

144

if (!strcmp(array[i], str))

sys/dev/pci/drm/radeon/r600_dpm.c

1072

VCEClockInfoArray *array = (VCEClockInfoArray *)

sys/dev/pci/drm/radeon/r600_dpm.c

1079

1 + array->ucNumEntries * sizeof(VCEClockInfo));

sys/dev/pci/drm/radeon/r600_dpm.c

1084

1 + (array->ucNumEntries * sizeof (VCEClockInfo)) +

sys/dev/pci/drm/radeon/r600_dpm.c

1103

((u8 *)&array->entries[0] +

sys/dev/pci/drm/radeon/r600_dpm.c

1118

((u8 *)&array->entries[0] +

sys/dev/pci/drm/radeon/r600_dpm.c

1134

UVDClockInfoArray *array = (UVDClockInfoArray *)

sys/dev/pci/drm/radeon/r600_dpm.c

1141

1 + (array->ucNumEntries * sizeof (UVDClockInfo)));

sys/dev/pci/drm/radeon/r600_dpm.c

1156

((u8 *)&array->entries[0] +

sys/dev/pci/maestro.c

383

#define lengthof(array) (sizeof (array) / sizeof (array)[0])

sys/kern/sysv_sem.c

327

semval = mallocarray(nsems, sizeof(arg.array[0]),

sys/kern/sysv_sem.c

332

free(semval, M_TEMP, nsems * sizeof(arg.array[0]));

sys/kern/sysv_sem.c

341

error = copyout(&semval[i], &arg.array[i],

sys/kern/sysv_sem.c

342

sizeof(arg.array[0]));

sys/kern/sysv_sem.c

370

semval = mallocarray(nsems, sizeof(arg.array[0]),

sys/kern/sysv_sem.c

373

error = copyin(&arg.array[i], &semval[i],

sys/kern/sysv_sem.c

374

sizeof(arg.array[0]));

sys/kern/sysv_sem.c

385

free(semval, M_TEMP, nsems * sizeof(arg.array[0]));

sys/kern/sysv_sem.c

402

free(semval, M_TEMP, nsems * sizeof(arg.array[0]));

sys/net/pf_ioctl.c

3467

if (copyin(io->array+i, ioe, sizeof(*ioe))) {

sys/net/pf_ioctl.c

3516

if (copyout(ioe, io->array+i, sizeof(io->array[i]))) {

sys/net/pf_ioctl.c

3541

if (copyin(io->array+i, ioe, sizeof(*ioe))) {

sys/net/pf_ioctl.c

3604

if (copyin(io->array+i, ioe, sizeof(*ioe))) {

sys/net/pf_ioctl.c

3664

if (copyin(io->array+i, ioe, sizeof(*ioe))) {

sys/net/pfvar.h

1459

} *array;

sys/scsi/mpath_rdac.c

360

char array[31];

sys/scsi/mpath_rdac.c

378

memset(array, 0, sizeof(array));

sys/scsi/mpath_rdac.c

380

array[i] = pg->array_label[i * 2 + 1];

sys/scsi/mpath_rdac.c

386

printf("%s: array %s, volume %s\n", DEVNAME(sc), array, vol);

sys/sys/sem.h

82

unsigned short *array; /* array for GETALL & SETALL */

usr.bin/awk/proto.h

162

extern Cell *array(Node **, int);

usr.bin/dc/bcode.h

43

struct array;

usr.bin/dc/bcode.h

50

struct array *array;

usr.bin/dc/inout.c

399

if (value->array != NULL)

usr.bin/dc/stack.c

144

stack->stack[stack->sp].array = NULL;

usr.bin/dc/stack.c

153

stack->stack[stack->sp].array = NULL;

usr.bin/dc/stack.c

171

stack->stack[stack->sp].array = v->array == NULL ?

usr.bin/dc/stack.c

172

NULL : array_dup(v->array);

usr.bin/dc/stack.c

191

stack->stack[stack->sp].array = v->array == NULL ?

usr.bin/dc/stack.c

192

NULL : array_dup(v->array);

usr.bin/dc/stack.c

209

array_free(stack->stack[stack->sp].array);

usr.bin/dc/stack.c

210

stack->stack[stack->sp].array = NULL;

usr.bin/dc/stack.c

223

array_free(stack->stack[stack->sp].array);

usr.bin/dc/stack.c

224

stack->stack[stack->sp].array = NULL;

usr.bin/dc/stack.c

253

static struct array *

usr.bin/dc/stack.c

256

struct array *a;

usr.bin/dc/stack.c

265

array_free(struct array *a)

usr.bin/dc/stack.c

27

static struct array *array_new(void);

usr.bin/dc/stack.c

277

static struct array *

usr.bin/dc/stack.c

278

array_dup(const struct array *a)

usr.bin/dc/stack.c

28

static __inline void array_free(struct array *);

usr.bin/dc/stack.c

280

struct array *n;

usr.bin/dc/stack.c

29

static struct array * array_dup(const struct array *);

usr.bin/dc/stack.c

293

array_grow(struct array *array, size_t newsize)

usr.bin/dc/stack.c

297

array->data = breallocarray(array->data, newsize, sizeof(*array->data));

usr.bin/dc/stack.c

298

for (i = array->size; i < newsize; i++) {

usr.bin/dc/stack.c

299

array->data[i].type = BCODE_NONE;

usr.bin/dc/stack.c

30

static __inline void array_grow(struct array *, size_t);

usr.bin/dc/stack.c

300

array->data[i].array = NULL;

usr.bin/dc/stack.c

302

array->size = newsize;

usr.bin/dc/stack.c

306

array_assign(struct array *array, size_t index, const struct value *v)

usr.bin/dc/stack.c

308

if (index >= array->size)

usr.bin/dc/stack.c

309

array_grow(array, index+1);

usr.bin/dc/stack.c

31

static __inline void array_assign(struct array *, size_t, const struct value *);

usr.bin/dc/stack.c

310

stack_free_value(&array->data[index]);

usr.bin/dc/stack.c

311

array->data[index] = *v;

usr.bin/dc/stack.c

315

array_retrieve(const struct array *array, size_t index)

usr.bin/dc/stack.c

317

if (index >= array->size)

usr.bin/dc/stack.c

319

return &array->data[index];

usr.bin/dc/stack.c

32

static __inline struct value *array_retrieve(const struct array *, size_t);

usr.bin/dc/stack.c

325

struct array *a;

usr.bin/dc/stack.c

330

n.array = NULL;

usr.bin/dc/stack.c

334

a = stack->stack[stack->sp].array;

usr.bin/dc/stack.c

336

a = stack->stack[stack->sp].array = array_new();

usr.bin/dc/stack.c

343

struct array *a;

usr.bin/dc/stack.c

347

a = stack->stack[stack->sp].array;

usr.bin/dc/stack.c

349

a = stack->stack[stack->sp].array = array_new();

usr.bin/dc/stack.c

65

array_free(v->array);

usr.bin/dc/stack.c

66

v->array = NULL;

usr.bin/dc/stack.c

86

copy->array = a->array == NULL ? NULL : array_dup(a->array);

usr.bin/dig/lib/dns/include/dns/rdataclass.h

62

char *array, unsigned int size);

usr.bin/dig/lib/dns/include/dns/rdatatype.h

62

char *array, unsigned int size);

usr.bin/dig/lib/dns/rcode.c

257

char *array, unsigned int size)

usr.bin/dig/lib/dns/rcode.c

265

isc_buffer_init(&buf, array, size);

usr.bin/dig/lib/dns/rcode.c

277

strlcpy(array, "<unknown>", size);

usr.bin/dig/lib/dns/rdata.c

1073

char *array, unsigned int size)

usr.bin/dig/lib/dns/rdata.c

1081

isc_buffer_init(&buf, array, size);

usr.bin/dig/lib/dns/rdata.c

1093

strlcpy(array, "<unknown>", size);

usr.bin/dig/lib/isc/heap.c

101

free(heap->array);

usr.bin/dig/lib/isc/heap.c

116

if (heap->array != NULL) {

usr.bin/dig/lib/isc/heap.c

117

memmove(new_array, heap->array, heap->size * sizeof(void *));

usr.bin/dig/lib/isc/heap.c

118

free(heap->array);

usr.bin/dig/lib/isc/heap.c

121

heap->array = new_array;

usr.bin/dig/lib/isc/heap.c

131

i > 1 && heap->compare(elt, heap->array[p]) ;

usr.bin/dig/lib/isc/heap.c

133

heap->array[i] = heap->array[p];

usr.bin/dig/lib/isc/heap.c

135

(heap->index)(heap->array[i], i);

usr.bin/dig/lib/isc/heap.c

137

heap->array[i] = elt;

usr.bin/dig/lib/isc/heap.c

139

(heap->index)(heap->array[i], i);

usr.bin/dig/lib/isc/heap.c

152

if (j < size && heap->compare(heap->array[j+1],

usr.bin/dig/lib/isc/heap.c

153

heap->array[j]))

usr.bin/dig/lib/isc/heap.c

155

if (heap->compare(elt, heap->array[j]))

usr.bin/dig/lib/isc/heap.c

157

heap->array[i] = heap->array[j];

usr.bin/dig/lib/isc/heap.c

159

(heap->index)(heap->array[i], i);

usr.bin/dig/lib/isc/heap.c

162

heap->array[i] = elt;

usr.bin/dig/lib/isc/heap.c

164

(heap->index)(heap->array[i], i);

usr.bin/dig/lib/isc/heap.c

192

(heap->index)(heap->array[idx], 0);

usr.bin/dig/lib/isc/heap.c

194

heap->array[heap->last] = NULL;

usr.bin/dig/lib/isc/heap.c

197

elt = heap->array[heap->last];

usr.bin/dig/lib/isc/heap.c

198

heap->array[heap->last] = NULL;

usr.bin/dig/lib/isc/heap.c

201

less = heap->compare(elt, heap->array[idx]);

usr.bin/dig/lib/isc/heap.c

202

heap->array[idx] = elt;

usr.bin/dig/lib/isc/heap.c

204

float_up(heap, idx, heap->array[idx]);

usr.bin/dig/lib/isc/heap.c

206

sink_down(heap, idx, heap->array[idx]);

usr.bin/dig/lib/isc/heap.c

214

float_up(heap, idx, heap->array[idx]);

usr.bin/dig/lib/isc/heap.c

221

sink_down(heap, idx, heap->array[idx]);

usr.bin/dig/lib/isc/heap.c

229

return (heap->array[idx]);

usr.bin/dig/lib/isc/heap.c

53

! heap->compare(heap->array[(i)], \

usr.bin/dig/lib/isc/heap.c

54

heap->array[heap_parent(i)]))

usr.bin/dig/lib/isc/heap.c

61

void **array;

usr.bin/dig/lib/isc/heap.c

85

heap->array = NULL;

usr.bin/dig/lib/isc/include/isc/sockaddr.h

120

isc_sockaddr_format(const struct sockaddr_storage *sa, char *array, unsigned int size);

usr.bin/dig/lib/isc/sockaddr.c

160

isc_sockaddr_format(const struct sockaddr_storage *sa, char *array, unsigned int size) {

usr.bin/dig/lib/isc/sockaddr.c

167

isc_buffer_init(&buf, array, size);

usr.bin/dig/lib/isc/sockaddr.c

170

snprintf(array, size, "<unknown address, family %u>",

usr.bin/dig/lib/isc/sockaddr.c

172

array[size - 1] = '\0';

usr.bin/lex/flexdef.h

647

#define reallocate_integer_array(array,size) \

usr.bin/lex/flexdef.h

648

(int *) reallocate_array( (void *) array, size, sizeof( int ) )

usr.bin/lex/flexdef.h

653

#define reallocate_bool_array(array,size) \

usr.bin/lex/flexdef.h

654

(bool *) reallocate_array( (void *) array, size, sizeof( bool ) )

usr.bin/lex/flexdef.h

666

#define reallocate_int_ptr_array(array,size) \

usr.bin/lex/flexdef.h

667

(int **) reallocate_array( (void *) array, size, sizeof( int * ) )

usr.bin/lex/flexdef.h

669

#define reallocate_char_ptr_array(array,size) \

usr.bin/lex/flexdef.h

670

(char **) reallocate_array( (void *) array, size, sizeof( char * ) )

usr.bin/lex/flexdef.h

672

#define reallocate_dfaacc_union(array, size) \

usr.bin/lex/flexdef.h

674

reallocate_array( (void *) array, size, sizeof( union dfaacc_union ) )

usr.bin/lex/flexdef.h

679

#define reallocate_character_array(array,size) \

usr.bin/lex/flexdef.h

680

(char *) reallocate_array( (void *) array, size, sizeof( char ) )

usr.bin/lex/flexdef.h

685

#define reallocate_Character_array(array,size) \

usr.bin/lex/flexdef.h

686

(u_char *) reallocate_array( (void *) array, size, sizeof( u_char ) )

usr.bin/lex/misc.c

541

myctoi(const char *array)

usr.bin/lex/misc.c

545

(void) sscanf(array, "%d", &val);

usr.bin/lex/misc.c

554

myesc(unsigned char array[])

usr.bin/lex/misc.c

558

switch (array[1]) {

usr.bin/lex/misc.c

593

while (isascii(array[sptr]) &&

usr.bin/lex/misc.c

594

isdigit(array[sptr]))

usr.bin/lex/misc.c

602

c = array[sptr];

usr.bin/lex/misc.c

603

array[sptr] = '\0';

usr.bin/lex/misc.c

605

esc_char = otoi(array + 1);

usr.bin/lex/misc.c

607

array[sptr] = c;

usr.bin/lex/misc.c

616

while (isascii(array[sptr]) &&

usr.bin/lex/misc.c

617

isxdigit(array[sptr]))

usr.bin/lex/misc.c

625

c = array[sptr];

usr.bin/lex/misc.c

626

array[sptr] = '\0';

usr.bin/lex/misc.c

628

esc_char = htoi(array + 2);

usr.bin/lex/misc.c

630

array[sptr] = c;

usr.bin/lex/misc.c

636

return array[1];

usr.bin/lex/misc.c

774

reallocate_array(void *array, int size, size_t element_size)

usr.bin/lex/misc.c

779

new_array = realloc(array, num_bytes);

usr.bin/mandoc/dba_array.c

103

dba_array_get(struct dba_array *array, int32_t ie)

usr.bin/mandoc/dba_array.c

105

if (ie < 0 || ie >= array->eu || array->em[ie] == -1)

usr.bin/mandoc/dba_array.c

107

return array->ep[ie];

usr.bin/mandoc/dba_array.c

111

dba_array_start(struct dba_array *array)

usr.bin/mandoc/dba_array.c

113

array->ec = array->eu;

usr.bin/mandoc/dba_array.c

117

dba_array_next(struct dba_array *array)

usr.bin/mandoc/dba_array.c

119

if (array->ec < array->eu)

usr.bin/mandoc/dba_array.c

120

array->ec++;

usr.bin/mandoc/dba_array.c

122

array->ec = 0;

usr.bin/mandoc/dba_array.c

123

while (array->ec < array->eu && array->em[array->ec] == -1)

usr.bin/mandoc/dba_array.c

124

array->ec++;

usr.bin/mandoc/dba_array.c

125

return array->ec < array->eu ? array->ep[array->ec] : NULL;

usr.bin/mandoc/dba_array.c

129

dba_array_del(struct dba_array *array)

usr.bin/mandoc/dba_array.c

131

if (array->ec < array->eu && array->em[array->ec] != -1) {

usr.bin/mandoc/dba_array.c

132

array->em[array->ec] = -1;

usr.bin/mandoc/dba_array.c

133

array->ed++;

usr.bin/mandoc/dba_array.c

138

dba_array_undel(struct dba_array *array)

usr.bin/mandoc/dba_array.c

140

memset(array->em, 0, sizeof(*array->em) * array->eu);

usr.bin/mandoc/dba_array.c

144

dba_array_setpos(struct dba_array *array, int32_t ie, int32_t pos)

usr.bin/mandoc/dba_array.c

146

array->em[ie] = pos;

usr.bin/mandoc/dba_array.c

150

dba_array_getpos(struct dba_array *array)

usr.bin/mandoc/dba_array.c

152

return array->pos;

usr.bin/mandoc/dba_array.c

156

dba_array_sort(struct dba_array *array, dba_compare_func func)

usr.bin/mandoc/dba_array.c

158

assert(array->ed == 0);

usr.bin/mandoc/dba_array.c

159

qsort(array->ep, array->eu, sizeof(*array->ep), func);

usr.bin/mandoc/dba_array.c

163

dba_array_writelen(struct dba_array *array, int32_t nmemb)

usr.bin/mandoc/dba_array.c

165

dba_int_write(array->eu - array->ed);

usr.bin/mandoc/dba_array.c

166

return dba_skip(nmemb, array->eu - array->ed);

usr.bin/mandoc/dba_array.c

170

dba_array_writepos(struct dba_array *array)

usr.bin/mandoc/dba_array.c

174

array->pos = dba_tell();

usr.bin/mandoc/dba_array.c

175

for (ie = 0; ie < array->eu; ie++)

usr.bin/mandoc/dba_array.c

176

if (array->em[ie] != -1)

usr.bin/mandoc/dba_array.c

177

dba_int_write(array->em[ie]);

usr.bin/mandoc/dba_array.c

181

dba_array_writelst(struct dba_array *array)

usr.bin/mandoc/dba_array.c

185

dba_array_FOREACH(array, str)

usr.bin/mandoc/dba_array.c

44

struct dba_array *array;

usr.bin/mandoc/dba_array.c

47

array = mandoc_malloc(sizeof(*array));

usr.bin/mandoc/dba_array.c

48

array->ep = mandoc_reallocarray(NULL, ea, sizeof(*array->ep));

usr.bin/mandoc/dba_array.c

49

array->em = mandoc_reallocarray(NULL, ea, sizeof(*array->em));

usr.bin/mandoc/dba_array.c

50

array->ea = ea;

usr.bin/mandoc/dba_array.c

51

array->eu = 0;

usr.bin/mandoc/dba_array.c

52

array->ed = 0;

usr.bin/mandoc/dba_array.c

53

array->ec = 0;

usr.bin/mandoc/dba_array.c

54

array->flags = flags;

usr.bin/mandoc/dba_array.c

55

array->pos = 0;

usr.bin/mandoc/dba_array.c

56

return array;

usr.bin/mandoc/dba_array.c

60

dba_array_free(struct dba_array *array)

usr.bin/mandoc/dba_array.c

64

if (array == NULL)

usr.bin/mandoc/dba_array.c

66

if (array->flags & DBA_STR)

usr.bin/mandoc/dba_array.c

67

for (ie = 0; ie < array->eu; ie++)

usr.bin/mandoc/dba_array.c

68

free(array->ep[ie]);

usr.bin/mandoc/dba_array.c

69

free(array->ep);

usr.bin/mandoc/dba_array.c

70

free(array->em);

usr.bin/mandoc/dba_array.c

71

free(array);

usr.bin/mandoc/dba_array.c

75

dba_array_set(struct dba_array *array, int32_t ie, void *entry)

usr.bin/mandoc/dba_array.c

78

assert(ie < array->ea);

usr.bin/mandoc/dba_array.c

79

assert(ie <= array->eu);

usr.bin/mandoc/dba_array.c

80

if (ie == array->eu)

usr.bin/mandoc/dba_array.c

81

array->eu++;

usr.bin/mandoc/dba_array.c

82

if (array->flags & DBA_STR)

usr.bin/mandoc/dba_array.c

84

array->ep[ie] = entry;

usr.bin/mandoc/dba_array.c

85

array->em[ie] = 0;

usr.bin/mandoc/dba_array.c

89

dba_array_add(struct dba_array *array, void *entry)

usr.bin/mandoc/dba_array.c

91

if (array->eu == array->ea) {

usr.bin/mandoc/dba_array.c

92

assert(array->flags & DBA_GROW);

usr.bin/mandoc/dba_array.c

93

array->ep = mandoc_reallocarray(array->ep,

usr.bin/mandoc/dba_array.c

94

2, sizeof(*array->ep) * array->ea);

usr.bin/mandoc/dba_array.c

95

array->em = mandoc_reallocarray(array->em,

usr.bin/mandoc/dba_array.c

96

2, sizeof(*array->em) * array->ea);

usr.bin/mandoc/dba_array.c

97

array->ea *= 2;

usr.bin/mandoc/dba_array.c

99

dba_array_set(array, array->eu, entry);

usr.bin/ssh/libcrux_mlkem768_sha3.h

5541

Eurydice_slice array) {

usr.bin/ssh/libcrux_mlkem768_sha3.h

5546

&dst, Eurydice_slice_subslice3(array, (size_t)0U, (size_t)16U, int16_t *),

usr.bin/ssh/libcrux_mlkem768_sha3.h

5558

libcrux_ml_kem_vector_portable_from_i16_array_b8(Eurydice_slice array) {

usr.bin/ssh/libcrux_mlkem768_sha3.h

5560

libcrux_secrets_int_classify_public_classify_ref_9b_39(array));

usr.bin/ssh/misc.c

2643

char ***array, int **iarray, u_int *lp, const char *s, int i)

usr.bin/ssh/misc.c

2655

*array = xrecallocarray(*array, *lp, *lp + 1, sizeof(**array));

usr.bin/ssh/misc.c

2656

(*array)[*lp] = xstrdup(s);

usr.bin/ssh/misc.c

2662

char ***array, u_int *lp, const char *s)

usr.bin/ssh/misc.c

2664

opt_array_append2(file, line, directive, array, NULL, lp, s, 0);

usr.bin/ssh/misc.c

2668

opt_array_free2(char **array, int **iarray, u_int l)

usr.bin/ssh/misc.c

2672

if (array == NULL || l == 0)

usr.bin/ssh/misc.c

2675

free(array[i]);

usr.bin/ssh/misc.c

2676

free(array);

usr.bin/ssh/misc.h

223

const char *directive, char ***array, u_int *lp, const char *s);

usr.bin/ssh/misc.h

225

const char *directive, char ***array, int **iarray, u_int *lp,

usr.bin/ssh/misc.h

227

void opt_array_free2(char **array, int **iarray, u_int l);

usr.bin/ssh/sntrup761.c

1615

static void crypto_sort_int32(void *array,long long n)

usr.bin/ssh/sntrup761.c

1618

int32 *x = array;

usr.bin/ssh/sntrup761.c

1678

static void crypto_sort_uint32(void *array,long long n)

usr.bin/ssh/sntrup761.c

1680

crypto_uint32 *x = array;

usr.bin/ssh/sntrup761.c

1683

crypto_sort_int32(array,n);

usr.bin/tic/dump_entry.c

51

#define OkIndex(index,array) ((int)(index) >= 0 && (int)(index) < (int) SIZEOF(array))

usr.bin/tmux/options.c

252

RB_INIT(&o->value.array);

usr.bin/tmux/options.c

386

return (RB_FIND(options_array, &o->value.array, &a));

usr.bin/tmux/options.c

396

RB_INSERT(options_array, &o->value.array, a);

usr.bin/tmux/options.c

404

RB_REMOVE(options_array, &o->value.array, a);

usr.bin/tmux/options.c

416

RB_FOREACH_SAFE(a, options_array, &o->value.array, a1)

usr.bin/tmux/options.c

556

return (RB_MIN(options_array, &o->value.array));

usr.bin/tmux/options.c

562

return (RB_NEXT(options_array, &o->value.array, a));

usr.bin/tmux/options.c

599

RB_FOREACH(a, options_array, &o->value.array) {

usr.bin/tmux/window-customize.c

281

int global = 0, array = 0;

usr.bin/tmux/window-customize.c

287

array = 1;

usr.bin/tmux/window-customize.c

298

format_add(ft, "option_is_array", "%d", array);

usr.bin/tmux/window-customize.c

309

if (!array) {

usr.bin/tmux/window-customize.c

329

if (array)

usr.bin/tmux/window-customize.c

337

if (array)

usr.bin/top/utils.c

108

string_index(char *string, char **array)

usr.bin/top/utils.c

112

while (*array != NULL) {

usr.bin/top/utils.c

113

if (strncmp(string, *array, strlen(string)) == 0)

usr.bin/top/utils.c

115

array++;

usr.bin/tsort/tsort.c

121

static void split_nodes(struct ohash *, struct array *, struct array *);

usr.bin/tsort/tsort.c

127

static void dump_array(struct array *);

usr.bin/tsort/tsort.c

132

static struct node *find_smallest_node(struct array *);

usr.bin/tsort/tsort.c

133

static struct node *find_good_cycle_break(struct array *);

usr.bin/tsort/tsort.c

134

static void print_cycle(struct array *);

usr.bin/tsort/tsort.c

135

static struct node *find_cycle_from(struct node *, struct array *);

usr.bin/tsort/tsort.c

136

static struct node *find_predecessor(struct array *, struct node *);

usr.bin/tsort/tsort.c

137

static unsigned int traverse_node(struct node *, unsigned int, struct array *);

usr.bin/tsort/tsort.c

138

static struct node *find_longest_cycle(struct array *, struct array *);

usr.bin/tsort/tsort.c

139

static struct node *find_normal_cycle(struct array *, struct array *);

usr.bin/tsort/tsort.c

141

static void heap_down(struct array *, unsigned int);

usr.bin/tsort/tsort.c

142

static void heapify(struct array *, int);

usr.bin/tsort/tsort.c

143

static struct node *dequeue(struct array *);

usr.bin/tsort/tsort.c

144

static void enqueue(struct array *, struct node *);

usr.bin/tsort/tsort.c

261

dump_array(struct array *a)

usr.bin/tsort/tsort.c

399

heap_down(struct array *h, unsigned int i)

usr.bin/tsort/tsort.c

416

heapify(struct array *h, int verbose)

usr.bin/tsort/tsort.c

430

dequeue(struct array *h)

usr.bin/tsort/tsort.c

454

enqueue(struct array *h, struct node *n)

usr.bin/tsort/tsort.c

530

split_nodes(struct ohash *hash, struct array *heap, struct array *remaining)

usr.bin/tsort/tsort.c

553

find_good_cycle_break(struct array *h)

usr.bin/tsort/tsort.c

579

find_smallest_node(struct array *h)

usr.bin/tsort/tsort.c

608

find_cycle_from(struct node *i, struct array *c)

usr.bin/tsort/tsort.c

656

find_predecessor(struct array *a, struct node *n)

usr.bin/tsort/tsort.c

681

traverse_node(struct node *n, unsigned int o, struct array *c)

usr.bin/tsort/tsort.c

746

print_cycle(struct array *c)

usr.bin/tsort/tsort.c

759

find_longest_cycle(struct array *h, struct array *c)

usr.bin/tsort/tsort.c

806

find_normal_cycle(struct array *h, struct array *c)

usr.bin/tsort/tsort.c

914

struct array aux; /* Unrefed nodes/cycle reporting. */

usr.bin/tsort/tsort.c

915

struct array remaining;

usr.sbin/acme-client/json.c

122

n->d.array = calloc(n->fields,

usr.sbin/acme-client/json.c

124

if (n->d.array == NULL)

usr.sbin/acme-client/json.c

128

&n->d.array[i],

usr.sbin/acme-client/json.c

159

free(n->d.array);

usr.sbin/acme-client/json.c

376

struct jsmnn *array, *obj, *error;

usr.sbin/acme-client/json.c

384

array = json_getarray(n, "challenges");

usr.sbin/acme-client/json.c

385

if (array == NULL)

usr.sbin/acme-client/json.c

388

for (i = 0; i < array->fields; i++) {

usr.sbin/acme-client/json.c

389

obj = json_getarrayobj(array->d.array[i]);

usr.sbin/acme-client/json.c

41

struct jsmnn **array; /* JSMN_ARRAY */

usr.sbin/acme-client/json.c

444

struct jsmnn *array;

usr.sbin/acme-client/json.c

461

if ((array = json_getarray(n, "authorizations")) == NULL)

usr.sbin/acme-client/json.c

464

if (array->fields > 0) {

usr.sbin/acme-client/json.c

465

order->auths = calloc(array->fields, sizeof(*order->auths));

usr.sbin/acme-client/json.c

470

order->authsz = array->fields;

usr.sbin/acme-client/json.c

473

for (i = 0; i < array->fields; i++) {

usr.sbin/acme-client/json.c

474

str = json_getarraystr(array->d.array[i]);

usr.sbin/authpf/authpf.c

701

t->array = t_e;

usr.sbin/ftp-proxy/filter.c

170

pft.array = &pfte;

usr.sbin/nsd/radtree.c

101

if(n->array[idx].node) {

usr.sbin/nsd/radtree.c

103

if(n->array[idx].node->elem)

usr.sbin/nsd/radtree.c

104

return n->array[idx].node;

usr.sbin/nsd/radtree.c

106

if((s=radnode_first_in_subtree(n->array[idx].node))!=0)

usr.sbin/nsd/radtree.c

120

if(n->array[idx].node) {

usr.sbin/nsd/radtree.c

122

n->array[idx].node);

usr.sbin/nsd/radtree.c

1251

if(n->array[byte].len != 0) {

usr.sbin/nsd/radtree.c

1254

for(i=0; i<n->array[byte].len; i++) {

usr.sbin/nsd/radtree.c

1268

if(n->array[byte].str[i] != b)

usr.sbin/nsd/radtree.c

1272

n = n->array[byte].node;

usr.sbin/nsd/radtree.c

1371

if(!n->array[byte].node) {

usr.sbin/nsd/radtree.c

1380

if(n->array[byte].len != 0) {

usr.sbin/nsd/radtree.c

1383

for(i=0; i<n->array[byte].len; i++) {

usr.sbin/nsd/radtree.c

1394

n->array[byte].node);

usr.sbin/nsd/radtree.c

1402

if(b < n->array[byte].str[i]) {

usr.sbin/nsd/radtree.c

1404

n->array[byte].node);

usr.sbin/nsd/radtree.c

1406

} else if(b > n->array[byte].str[i]) {

usr.sbin/nsd/radtree.c

1410

*result = radnode_last_in_subtree_incl_self(n->array[byte].node);

usr.sbin/nsd/radtree.c

1414

*result = radix_prev(n->array[byte].node);

usr.sbin/nsd/radtree.c

1419

n = n->array[byte].node;

usr.sbin/nsd/radtree.c

161

if(n->array[byte].len != 0) {

usr.sbin/nsd/radtree.c

163

if(pos+n->array[byte].len > len) {

usr.sbin/nsd/radtree.c

166

if(memcmp(&k[pos], n->array[byte].str,

usr.sbin/nsd/radtree.c

167

n->array[byte].len) != 0) {

usr.sbin/nsd/radtree.c

170

pos += n->array[byte].len;

usr.sbin/nsd/radtree.c

172

n = n->array[byte].node;

usr.sbin/nsd/radtree.c

198

memcpy(&a[0], &n->array[0], n->len*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

199

region_recycle(region, n->array, n->capacity*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

200

n->array = a;

usr.sbin/nsd/radtree.c

210

if(!n->array || n->capacity == 0) {

usr.sbin/nsd/radtree.c

211

n->array = (struct radsel*)region_alloc(region,

usr.sbin/nsd/radtree.c

213

if(!n->array) return 0;

usr.sbin/nsd/radtree.c

214

memset(&n->array[0], 0, sizeof(struct radsel));

usr.sbin/nsd/radtree.c

222

memset(&n->array[0], 0, sizeof(struct radsel));

usr.sbin/nsd/radtree.c

234

memmove(&n->array[need], &n->array[0],

usr.sbin/nsd/radtree.c

238

if(n->array[idx+need].node)

usr.sbin/nsd/radtree.c

239

n->array[idx+need].node->pidx = idx+need;

usr.sbin/nsd/radtree.c

242

memset(&n->array[0], 0, need*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

255

memset(&n->array[n->len], 0, need*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

380

add->array[0].node = r->node;

usr.sbin/nsd/radtree.c

381

add->array[0].str = split_str;

usr.sbin/nsd/radtree.c

382

add->array[0].len = split_len;

usr.sbin/nsd/radtree.c

40

radnode_del_postorder(region, n->array[i].node);

usr.sbin/nsd/radtree.c

41

region_recycle(region, n->array[i].str, n->array[i].len);

usr.sbin/nsd/radtree.c

412

r->node->array[add->pidx].node = add;

usr.sbin/nsd/radtree.c

413

r->node->array[add->pidx].str = split_str;

usr.sbin/nsd/radtree.c

414

r->node->array[add->pidx].len = split_len;

usr.sbin/nsd/radtree.c

43

region_recycle(region, n->array, n->capacity*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

465

region_recycle(region, com->array, com->capacity*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

480

com->array[r->node->pidx].node = r->node;

usr.sbin/nsd/radtree.c

481

com->array[r->node->pidx].str = s1_str;

usr.sbin/nsd/radtree.c

482

com->array[r->node->pidx].len = s1_len;

usr.sbin/nsd/radtree.c

483

com->array[add->pidx].node = add;

usr.sbin/nsd/radtree.c

484

com->array[add->pidx].str = s2_str;

usr.sbin/nsd/radtree.c

485

com->array[add->pidx].len = s2_len;

usr.sbin/nsd/radtree.c

520

region_recycle(rt->region, n->array,

usr.sbin/nsd/radtree.c

528

n->array[0].node = add;

usr.sbin/nsd/radtree.c

531

&n->array[0].str, &n->array[0].len)) {

usr.sbin/nsd/radtree.c

532

region_recycle(rt->region, n->array,

usr.sbin/nsd/radtree.c

568

if(!radsel_str_create(rt->region, &n->array[byte],

usr.sbin/nsd/radtree.c

577

n->array[byte].node = add;

usr.sbin/nsd/radtree.c

579

} else if(n->array[byte-n->offset].node == NULL) {

usr.sbin/nsd/radtree.c

584

if(!radsel_str_create(rt->region, &n->array[byte],

usr.sbin/nsd/radtree.c

593

n->array[byte].node = add;

usr.sbin/nsd/radtree.c

600

if(!radsel_split(rt->region, &n->array[byte-n->offset],

usr.sbin/nsd/radtree.c

619

region_recycle(region, n->array[i].str, n->array[i].len);

usr.sbin/nsd/radtree.c

621

region_recycle(region, n->array, n->capacity*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

633

struct radnode* child = n->array[0].node;

usr.sbin/nsd/radtree.c

639

joinlen = par->array[pidx].len + n->array[0].len + 1;

usr.sbin/nsd/radtree.c

647

if(par->array[pidx].str)

usr.sbin/nsd/radtree.c

648

memcpy(join, par->array[pidx].str, par->array[pidx].len);

usr.sbin/nsd/radtree.c

650

join[par->array[pidx].len] = child->pidx + n->offset;

usr.sbin/nsd/radtree.c

652

if(n->array[0].str)

usr.sbin/nsd/radtree.c

653

memmove(join+par->array[pidx].len+1, n->array[0].str, n->array[0].len);

usr.sbin/nsd/radtree.c

654

region_recycle(region, par->array[pidx].str, par->array[pidx].len);

usr.sbin/nsd/radtree.c

655

par->array[pidx].str = join;

usr.sbin/nsd/radtree.c

656

par->array[pidx].len = joinlen;

usr.sbin/nsd/radtree.c

658

par->array[pidx].node = child;

usr.sbin/nsd/radtree.c

673

region_recycle(region, n->array, n->capacity*sizeof(struct radsel));

usr.sbin/nsd/radtree.c

674

n->array = NULL;

usr.sbin/nsd/radtree.c

68

if(n->array[idx].node) {

usr.sbin/nsd/radtree.c

686

memcpy(a, n->array, sizeof(*a)*n->len);

usr.sbin/nsd/radtree.c

687

region_recycle(region, n->array, n->capacity*sizeof(*a));

usr.sbin/nsd/radtree.c

688

n->array = a;

usr.sbin/nsd/radtree.c

70

if(n->array[idx].node->len > 0) {

usr.sbin/nsd/radtree.c

700

while(shuf < n->len && n->array[shuf].node == NULL)

usr.sbin/nsd/radtree.c

711

memmove(&n->array[0], &n->array[shuf],

usr.sbin/nsd/radtree.c

716

if(n->array[idx].node)

usr.sbin/nsd/radtree.c

717

n->array[idx].node->pidx = idx;

usr.sbin/nsd/radtree.c

72

n->array[idx].node);

usr.sbin/nsd/radtree.c

729

while(shuf < n->len && n->array[n->len-1-shuf].node == NULL)

usr.sbin/nsd/radtree.c

758

region_recycle(region, par->array[pidx].str, par->array[pidx].len);

usr.sbin/nsd/radtree.c

759

par->array[pidx].str = NULL;

usr.sbin/nsd/radtree.c

76

if(n->array[idx].node->elem)

usr.sbin/nsd/radtree.c

760

par->array[pidx].len = 0;

usr.sbin/nsd/radtree.c

761

par->array[pidx].node = NULL;

usr.sbin/nsd/radtree.c

77

return n->array[idx].node;

usr.sbin/nsd/radtree.c

840

if(n->array[byte].len != 0) {

usr.sbin/nsd/radtree.c

842

if(pos+n->array[byte].len > len)

usr.sbin/nsd/radtree.c

844

if(memcmp(&k[pos], n->array[byte].str,

usr.sbin/nsd/radtree.c

845

n->array[byte].len) != 0)

usr.sbin/nsd/radtree.c

847

pos += n->array[byte].len;

usr.sbin/nsd/radtree.c

849

n = n->array[byte].node;

usr.sbin/nsd/radtree.c

891

if(!n->array[byte].node) {

usr.sbin/nsd/radtree.c

900

if(n->array[byte].len != 0) {

usr.sbin/nsd/radtree.c

902

if(pos+n->array[byte].len > len) {

usr.sbin/nsd/radtree.c

904

if( (memcmp(&k[pos], n->array[byte].str,

usr.sbin/nsd/radtree.c

907

*result = radix_prev(n->array[byte].node);

usr.sbin/nsd/radtree.c

912

*result=radnode_last_in_subtree_incl_self(n->array[byte].node);

usr.sbin/nsd/radtree.c

918

*result = radix_prev(n->array[byte].node);

usr.sbin/nsd/radtree.c

922

if( (r=memcmp(&k[pos], n->array[byte].str,

usr.sbin/nsd/radtree.c

923

n->array[byte].len)) < 0) {

usr.sbin/nsd/radtree.c

924

*result = radix_prev(n->array[byte].node);

usr.sbin/nsd/radtree.c

930

*result=radnode_last_in_subtree_incl_self(n->array[byte].node);

usr.sbin/nsd/radtree.c

932

if(!*result) *result = radix_prev(n->array[byte].node);

usr.sbin/nsd/radtree.c

935

pos += n->array[byte].len;

usr.sbin/nsd/radtree.c

937

n = n->array[byte].node;

usr.sbin/nsd/radtree.c

980

if(n->array[idx].node) {

usr.sbin/nsd/radtree.c

983

if(n->array[idx].node->elem)

usr.sbin/nsd/radtree.c

984

return n->array[idx].node;

usr.sbin/nsd/radtree.c

987

n->array[idx].node);

usr.sbin/nsd/radtree.h

51

struct radsel* array;

usr.sbin/nsd/xfrd-tcp.c

304

void pick_id_values(uint16_t* array, int num, int max)

usr.sbin/nsd/xfrd-tcp.c

312

array[i] = (uint16_t)i;

usr.sbin/nsd/xfrd-tcp.c

328

array[done++]=t;

usr.sbin/nsd/xfrd-tcp.c

331

array[done++]=j;

usr.sbin/nsd/xfrd-tcp.h

251

void pick_id_values(uint16_t* array, int num, int max);

usr.sbin/pppd/chat/chat.c

1405

pack_array (char **array, int end)

usr.sbin/pppd/chat/chat.c

1410

if (array[i] == NULL) {

usr.sbin/pppd/chat/chat.c

1412

if (array[j] != NULL)

usr.sbin/pppd/chat/chat.c

1413

array[i++] = array[j];

usr.sbin/pppd/chat/chat.c

1415

array[i] = NULL;

usr.sbin/pppd/chat/chat.c

200

void pack_array(char **array, int end);

usr.sbin/relayd/pfe_filter.c

309

env->sc_pf->pft.array = &env->sc_pf->pfte;

usr.sbin/tftp-proxy/filter.c

158

pft.array = &pfte;

usr.sbin/unbound/daemon/cachedump.c

173

struct lruhash_bin* bin = &table->array[i];

usr.sbin/unbound/daemon/cachedump.c

192

bin = &table->array[i];

usr.sbin/unbound/daemon/cachedump.c

246

if(!dump_lruhash(sh->array[slab], func, ssl, arg))

usr.sbin/unbound/services/authzone.c

7440

static size_t authdata_rrsets_to_list(struct auth_rrset** array,

usr.sbin/unbound/services/authzone.c

7448

array[num] = rrset;

usr.sbin/unbound/services/authzone.c

7474

static void addrrsigtype_if_needed(struct auth_rrset** array,

usr.sbin/unbound/services/authzone.c

7481

array[*rrnum] = NULL; /* nothing there, but need entry in list */

usr.sbin/unbound/testcode/unitslabhash.c

191

check_lru_table(table->array[i]);

usr.sbin/unbound/util/config_file.c

1711

config_del_strarray(char** array, int num)

usr.sbin/unbound/util/config_file.c

1714

if(!array)

usr.sbin/unbound/util/config_file.c

1717

free(array[i]);

usr.sbin/unbound/util/config_file.c

1719

free(array);

usr.sbin/unbound/util/config_file.c

90

static void init_outgoing_availports(int* array, int num);

usr.sbin/unbound/util/config_file.h

1181

void config_del_strarray(char** array, int num);

usr.sbin/unbound/util/storage/lruhash.c

134

lock_quick_lock(&table->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

135

p = table->array[i].overflow_list;

usr.sbin/unbound/util/storage/lruhash.c

149

lock_quick_unlock(&table->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

162

bin_delete(table, &table->array[i]);

usr.sbin/unbound/util/storage/lruhash.c

163

free(table->array);

usr.sbin/unbound/util/storage/lruhash.c

203

bin = &table->array[d->hash & table->size_mask];

usr.sbin/unbound/util/storage/lruhash.c

256

lock_unprotect(&table->lock, table->array);

usr.sbin/unbound/util/storage/lruhash.c

258

lock_quick_destroy(&table->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

260

free(table->array);

usr.sbin/unbound/util/storage/lruhash.c

264

table->array = newa;

usr.sbin/unbound/util/storage/lruhash.c

265

lock_protect(&table->lock, table->array,

usr.sbin/unbound/util/storage/lruhash.c

322

bin = &table->array[hash & table->size_mask];

usr.sbin/unbound/util/storage/lruhash.c

371

bin = &table->array[hash & table->size_mask];

usr.sbin/unbound/util/storage/lruhash.c

398

bin = &table->array[hash & table->size_mask];

usr.sbin/unbound/util/storage/lruhash.c

457

bin_clear(table, &table->array[i]);

usr.sbin/unbound/util/storage/lruhash.c

48

bin_init(struct lruhash_bin* array, size_t size)

usr.sbin/unbound/util/storage/lruhash.c

482

lock_quick_lock(&table->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

483

en = table->array[i].overflow_list;

usr.sbin/unbound/util/storage/lruhash.c

488

lock_quick_unlock(&table->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

511

lock_get_mem(&table->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

516

lock_get_mem(&table->array[0].lock));

usr.sbin/unbound/util/storage/lruhash.c

52

(void)array;

usr.sbin/unbound/util/storage/lruhash.c

55

lock_quick_init(&array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

56

lock_protect(&array[i].lock, &array[i],

usr.sbin/unbound/util/storage/lruhash.c

604

lock_quick_lock(&h->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

605

for(e = h->array[i].overflow_list; e; e = e->overflow_next) {

usr.sbin/unbound/util/storage/lruhash.c

614

lock_quick_unlock(&h->array[i].lock);

usr.sbin/unbound/util/storage/lruhash.c

665

bin = &table->array[hash & table->size_mask];

usr.sbin/unbound/util/storage/lruhash.c

85

table->array = calloc(table->size, sizeof(struct lruhash_bin));

usr.sbin/unbound/util/storage/lruhash.c

86

if(!table->array) {

usr.sbin/unbound/util/storage/lruhash.c

91

bin_init(table->array, table->size);

usr.sbin/unbound/util/storage/lruhash.c

93

lock_protect(&table->lock, table->array,

usr.sbin/unbound/util/storage/lruhash.h

168

struct lruhash_bin* array;

usr.sbin/unbound/util/storage/lruhash.h

372

void bin_init(struct lruhash_bin* array, size_t size);

usr.sbin/unbound/util/storage/slabhash.c

106

lruhash_clear(sl->array[i]);

usr.sbin/unbound/util/storage/slabhash.c

119

lruhash_insert(sl->array[slab_idx(sl, hash)], hash, entry, data, arg);

usr.sbin/unbound/util/storage/slabhash.c

125

return lruhash_lookup(sl->array[slab_idx(sl, hash)], hash, key, wr);

usr.sbin/unbound/util/storage/slabhash.c

130

lruhash_remove(sl->array[slab_idx(sl, hash)], hash, key);

usr.sbin/unbound/util/storage/slabhash.c

141

lruhash_status(sl->array[i], num, extended);

usr.sbin/unbound/util/storage/slabhash.c

149

lock_quick_lock(&sl->array[i]->lock);

usr.sbin/unbound/util/storage/slabhash.c

150

total += sl->array[i]->space_max;

usr.sbin/unbound/util/storage/slabhash.c

151

lock_quick_unlock(&sl->array[i]->lock);

usr.sbin/unbound/util/storage/slabhash.c

172

lruhash_update_space_used(sl->array[slab_idx(sl, hash)], cb_arg,

usr.sbin/unbound/util/storage/slabhash.c

181

total += lruhash_get_mem(sl->array[i]);

usr.sbin/unbound/util/storage/slabhash.c

188

return sl->array[slab_idx(sl, hash)];

usr.sbin/unbound/util/storage/slabhash.c

229

lruhash_setmarkdel(sl->array[i], md);

usr.sbin/unbound/util/storage/slabhash.c

238

lruhash_traverse(sh->array[i], wr, func, arg);

usr.sbin/unbound/util/storage/slabhash.c

246

lock_quick_lock(&sh->array[slab]->lock);

usr.sbin/unbound/util/storage/slabhash.c

247

cnt += sh->array[slab]->num;

usr.sbin/unbound/util/storage/slabhash.c

248

lock_quick_unlock(&sh->array[slab]->lock);

usr.sbin/unbound/util/storage/slabhash.c

258

lock_quick_lock(&sh->array[slab]->lock);

usr.sbin/unbound/util/storage/slabhash.c

259

cnt += sh->array[slab]->num;

usr.sbin/unbound/util/storage/slabhash.c

260

if (max_collisions < sh->array[slab]->max_collisions) {

usr.sbin/unbound/util/storage/slabhash.c

261

max_collisions = sh->array[slab]->max_collisions;

usr.sbin/unbound/util/storage/slabhash.c

263

lock_quick_unlock(&sh->array[slab]->lock);

usr.sbin/unbound/util/storage/slabhash.c

276

lruhash_update_space_max(sl->array[i], NULL, space_max);

usr.sbin/unbound/util/storage/slabhash.c

59

sl->array = (struct lruhash**)calloc(sl->size, sizeof(struct lruhash*));

usr.sbin/unbound/util/storage/slabhash.c

60

if(!sl->array) {

usr.sbin/unbound/util/storage/slabhash.c

77

sl->array[i] = lruhash_create(start_size, maxmem / sl->size,

usr.sbin/unbound/util/storage/slabhash.c

79

if(!sl->array[i]) {

usr.sbin/unbound/util/storage/slabhash.c

91

if(sl->array) {

usr.sbin/unbound/util/storage/slabhash.c

94

lruhash_delete(sl->array[i]);

usr.sbin/unbound/util/storage/slabhash.c

95

free(sl->array);

usr.sbin/unbound/util/storage/slabhash.h

65

struct lruhash** array;

usr.sbin/unbound/util/timehist.c

212

timehist_export(struct timehist* hist, long long* array, size_t sz)

usr.sbin/unbound/util/timehist.c

219

array[i] = (long long)hist->buckets[i].count;

usr.sbin/unbound/util/timehist.c

223

timehist_import(struct timehist* hist, long long* array, size_t sz)

usr.sbin/unbound/util/timehist.c

230

hist->buckets[i].count = (size_t)array[i];

usr.sbin/unbound/util/timehist.h

124

void timehist_export(struct timehist* hist, long long* array, size_t sz);

usr.sbin/unbound/util/timehist.h

132

void timehist_import(struct timehist* hist, long long* array, size_t sz);

usr.sbin/zic/zic.c

2432

char **array;

usr.sbin/zic/zic.c

2437

array = ereallocarray(NULL, strlen(cp) + 1, sizeof *array);

usr.sbin/zic/zic.c

2445

array[nsubs++] = dp = cp;

usr.sbin/zic/zic.c

2465

array[nsubs] = NULL;

usr.sbin/zic/zic.c

2466

return array;