top 859 lib/talloc/testsuite.c void *top = talloc_new(NULL);
top 865 lib/talloc/testsuite.c parent = talloc_strdup(top, "parent");
top 869 lib/talloc/testsuite.c talloc_report_full(top, stderr);
top 870 lib/talloc/testsuite.c talloc_unlink(top, parent);
top 872 lib/talloc/testsuite.c talloc_report_full(top, stderr);
top 873 lib/talloc/testsuite.c talloc_free(top);
top 891 lib/talloc/testsuite.c void *top = talloc_new(NULL);
top 899 lib/talloc/testsuite.c parent = talloc_strdup(top, "parent");
top 905 lib/talloc/testsuite.c talloc_report_full(top, stderr);
top 907 lib/talloc/testsuite.c talloc_report_full(top, stderr);
top 909 lib/talloc/testsuite.c talloc_free(top);
top 926 lib/talloc/testsuite.c void *top = talloc_new(NULL);
top 933 lib/talloc/testsuite.c level1 = talloc_strdup(top, "level1");
top 941 lib/talloc/testsuite.c CHECK_PARENT("free_parent_deny_child", level3, top);
top 943 lib/talloc/testsuite.c talloc_free(top);
top 951 lib/talloc/testsuite.c void *top = talloc_new(NULL);
top 963 lib/talloc/testsuite.c s1 = talloc_ptrtype(top, s1);location1 = __location__;
top 980 lib/talloc/testsuite.c s2 = talloc_array_ptrtype(top, s2, 10);location2 = __location__;
top 998 lib/talloc/testsuite.c s3 = talloc_array_ptrtype(top, s3, 10);location3 = __location__;
top 1012 lib/talloc/testsuite.c s4 = talloc_array_ptrtype(top, s4, 10);location4 = __location__;
top 1026 lib/talloc/testsuite.c talloc_free(top);
top 63 lib/tdb/common/dump.c tdb_off_t rec_ptr, top;
top 65 lib/tdb/common/dump.c top = TDB_HASH_TOP(i);
top 70 lib/tdb/common/dump.c if (tdb_ofs_read(tdb, top, &rec_ptr) == -1)
top 61 lib/util/idtree.c struct idr_layer *top;
top 115 lib/util/idtree.c p = idp->top;
top 198 lib/util/idtree.c p = idp->top;
top 218 lib/util/idtree.c for (pn = p; p && p != idp->top; pn = p) {
top 232 lib/util/idtree.c idp->top = p;
top 242 lib/util/idtree.c struct idr_layer *p = idp->top;
top 248 lib/util/idtree.c *++paa = &idp->top;
top 278 lib/util/idtree.c p = idp->top;
top 307 lib/util/idtree.c if ( idp->top && idp->top->count == 1 &&
top 309 lib/util/idtree.c idp->top->ary[0]) {
top 311 lib/util/idtree.c p = idp->top->ary[0];
top 312 lib/util/idtree.c idp->top->bitmap = idp->top->count = 0;
top 313 lib/util/idtree.c free_layer(idp, idp->top);
top 314 lib/util/idtree.c idp->top = p;
top 69 lib/util/talloc_stack.c TALLOC_CTX **tmp, *top, *parent;
top 89 lib/util/talloc_stack.c top = talloc_pool(parent, poolsize);
top 91 lib/util/talloc_stack.c top = talloc_new(parent);
top 94 lib/util/talloc_stack.c if (top == NULL) {
top 98 lib/util/talloc_stack.c talloc_set_destructor(top, talloc_pop);
top 100 lib/util/talloc_stack.c talloc_stack[talloc_stacksize++] = top;
top 101 lib/util/talloc_stack.c return top;
top 434 lib/zlib/trees.c #define pqremove(s, tree, top) \
top 436 lib/zlib/trees.c top = s->heap[SMALLEST]; \
top 14832 librpc/gen_ndr/ndr_spoolss.c NDR_CHECK(ndr_push_uint32(ndr, NDR_SCALARS, r->top));
top 14846 librpc/gen_ndr/ndr_spoolss.c NDR_CHECK(ndr_pull_uint32(ndr, NDR_SCALARS, &r->top));
top 14860 librpc/gen_ndr/ndr_spoolss.c ndr_print_uint32(ndr, "top", r->top);
top 1106 librpc/gen_ndr/spoolss.h uint32_t top;
top 59 source3/client/clitar.c file_info2 *top;
top 341 source3/include/nt_printing.h uint32 top;
top 63 source3/lib/ldb/common/qsort.c #define PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top))
top 64 source3/lib/ldb/common/qsort.c #define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi)))
top 65 source3/lib/ldb/common/qsort.c #define STACK_NOT_EMPTY (stack < top)
top 108 source3/lib/ldb/common/qsort.c stack_node *top = stack;
top 937 source3/modules/getdate.c yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
top 940 source3/modules/getdate.c yy_stack_print (bottom, top)
top 942 source3/modules/getdate.c yytype_int16 *top;
top 946 source3/modules/getdate.c for (; bottom <= top; ++bottom)
top 784 source3/printing/nt_printing.c &form.top, &form.right, &form.bottom);
top 819 source3/printing/nt_printing.c (*list)[i].left, (*list)[i].top, (*list)[i].right,
top 830 source3/printing/nt_printing.c (*list)[i].left, (*list)[i].top, (*list)[i].right,
top 886 source3/printing/nt_printing.c (*list)[n].top = form->area.top;
top 954 source3/printing/nt_printing.c (*list)[n].top = form->area.top;
top 118 source3/registry/reg_backend_printing.c data[3] = form->top;
top 143 source3/registry/reg_backend_printing.c data[3] = form->top;
top 7001 source3/rpc_server/srv_spoolss_nt.c r->area.top = form->top;
top 2015 source3/rpcclient/cmd_spoolss.c info1.area.top = 10;
top 2028 source3/rpcclient/cmd_spoolss.c info2.area.top = 10;
top 2096 source3/rpcclient/cmd_spoolss.c info1.area.top = 1000;
top 2148 source3/rpcclient/cmd_spoolss.c r->area.top, r->area.bottom);
top 2163 source3/rpcclient/cmd_spoolss.c r->area.top, r->area.bottom);
top 1135 source4/heimdal/lib/asn1/parse.c yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
top 1138 source4/heimdal/lib/asn1/parse.c yy_stack_print (bottom, top)
top 1140 source4/heimdal/lib/asn1/parse.c yytype_int16 *top;
top 1144 source4/heimdal/lib/asn1/parse.c for (; bottom <= top; ++bottom)
top 754 source4/heimdal/lib/com_err/parse.c yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
top 757 source4/heimdal/lib/com_err/parse.c yy_stack_print (bottom, top)
top 759 source4/heimdal/lib/com_err/parse.c yytype_int16 *top;
top 763 source4/heimdal/lib/com_err/parse.c for (; bottom <= top; ++bottom)
top 326 source4/heimdal/lib/hcrypto/bn.c BN_rand(BIGNUM *bn, int bits, int top, int bottom)
top 353 source4/heimdal/lib/hcrypto/bn.c if (top == -1) {
top 355 source4/heimdal/lib/hcrypto/bn.c } else if (top == 0 && bits > 0) {
top 357 source4/heimdal/lib/hcrypto/bn.c } else if (top == 1 && bits > 1) {
top 2496 source4/heimdal/lib/hcrypto/imath/imath.c int i, top = bot_size + at_size;
top 2499 source4/heimdal/lib/hcrypto/imath/imath.c for(i = 0; i < top; ++i) {
top 741 source4/heimdal/lib/hx509/sel-gram.c yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
top 744 source4/heimdal/lib/hx509/sel-gram.c yy_stack_print (bottom, top)
top 746 source4/heimdal/lib/hx509/sel-gram.c yytype_int16 *top;
top 750 source4/heimdal/lib/hx509/sel-gram.c for (; bottom <= top; ++bottom)
top 62 source4/lib/ldb/common/qsort.c #define PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top))
top 63 source4/lib/ldb/common/qsort.c #define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi)))
top 64 source4/lib/ldb/common/qsort.c #define STACK_NOT_EMPTY (stack < top)
top 107 source4/lib/ldb/common/qsort.c stack_node *top = stack;
top 253 source4/ntptr/simple_ldb/ntptr_simple_ldb.c info[i].info1.area.top = samdb_result_uint(msgs[i], "area-top", 0);
top 314 source4/ntptr/simple_ldb/ntptr_simple_ldb.c SET_UINT(sptr_db, msg, "area-top", r->in.info.info1->area.top);
top 379 source4/ntptr/simple_ldb/ntptr_simple_ldb.c SET_UINT(sptr_db, msg, "area-top", r->in.info.info1->area.top);
top 741 source4/ntptr/simple_ldb/ntptr_simple_ldb.c info->info1.area.top = samdb_result_uint(msgs[0], "area-top", 0);
top 947 source4/torture/rpc/spoolss.c addform.area.top = 10;